Hostname: page-component-78c5997874-dh8gc Total loading time: 0 Render date: 2024-11-14T04:42:34.588Z Has data issue: false hasContentIssue false

Some New Difference Sets

Published online by Cambridge University Press:  20 November 2018

Basil Gordon
Affiliation:
University of California
W. H. Mills
Affiliation:
Yale University
L. R. Welch
Affiliation:
Institute for Defense Analyses, Princeton
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

A difference set is a set D = {d1, d2, … , dk] of k distinct residues modulo v such that each non-zero residue occurs the same number of times among the k(k — 1) differences di — dj, i ≠ j. If λ is the number of times each difference occurs, then

(1)

When we wish to emphasize the particular values of v, k, and λ involved we will call such a set a (v, k, λ) difference set. Another (v, k, λ) difference set E = {e1, e2, … ek} is said to be equivalent to the original one if there exist a and t such that (t, v) = 1 and E = {a + td1, … , a + tdk}. If t = 1 we will call the set E a slide of the set D. If D = E, then t is called a multiplier of D.

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1962

References

1. Singer, J., A theorem in finite projective geometry and some applications to number theory, Trans. Amer. Math. Soc, 43 (1938), 377385.Google Scholar
2. Hall, M., A survey of difference sets, Proc. Amer. Math. Soc, 7 (1956), 975986.Google Scholar
3. Hall, M., Cyclic projective planes, Duke Math. J., 14 (1947), 10791090.Google Scholar
4. Hall, M. and Ryser, H. J., Cyclic incidence matrices, Can. J. Math., 3 (1951), 495502.Google Scholar