Skip to main content

Sum-free sets, difference sets and cyclotomy

Contributed Papers

Part of the Lecture Notes in Mathematics book series (LNM,volume 403)

Abstract

A subset S of an additive group G is said to be a sum-free set if S ∩ (S + S) = Ø. A sum-free set S is said to be locally maximal if for every sum-free set T such that S⊑T⊑G, we have S = T.

Here we determine some sum-free cyclotomic classes in finite fields and from them, we construct new supplementary difference sets, association schemes and block designs. We also continue our study of locally maximal sum-free sets in groups of small orders and in finite fields.

Supported in part by U.S. A.E.C., contract number AT(11-1)-3077-V, at the Courant Institute of Mathematical Sciences, New York University.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   29.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   39.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. N. BIGGS, “Finite Groups of Automorphisms”, London Math. Soc. Lecture Note Series, 6, Cambridge University Press, 1971.

    Google Scholar 

  2. I.M. CHAKRAVARTI and S. IKEDA, Construction of association schemes and designs from finite groups, J. Combinatorial Theory Ser. A 13 (1972) 207–219.

    CrossRef  MathSciNet  MATH  Google Scholar 

  3. R.E. GREENWOOD and A.M. GLEASON, Combinatorial relations and chromatic graphs, Canad. J. Math. 7 (1955), 1–7.

    CrossRef  MathSciNet  MATH  Google Scholar 

  4. I. SCHÜR, über die Kongruenz xm + ym = zm (mod p), Jber. Deutsch. Math.-Verein. 25 (1916), 114–117.

    Google Scholar 

  5. T. STORER, “Cyclotomy and Difference Sets”, Lectures in Advanced Mathematics, 2, Markham Publishing Company, Chicago, 1967.

    Google Scholar 

  6. A.P. STREET AND E.G. WHITEHEAD Jr., Group Ramsey theory, J. Combinatorial Theory Ser. A (to appear).

    Google Scholar 

  7. W.D. WALLIS, A.P. STREET and J.S. WALLIS, “Combinatorics: Room Squares, Sum-Free Sets, Hadamard Matrices”, Lecture Motes in Mathematics, 292, Springer-Verlag, Berlin, 1972.

    Google Scholar 

  8. M.B. WELLS, “Elements of Combinatorial Computing”, Pergamon Press, Oxford, New York, 1971.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1974 Springer-Verlag

About this paper

Cite this paper

Street, A.P., Whitehead, E.G. (1974). Sum-free sets, difference sets and cyclotomy. In: Holton, D.A. (eds) Combinatorial Mathematics. Lecture Notes in Mathematics, vol 403. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0057384

Download citation

  • DOI: https://doi.org/10.1007/BFb0057384

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-06903-4

  • Online ISBN: 978-3-540-37837-2

  • eBook Packages: Springer Book Archive