Some New Difference Sets
Authors:
- Basil GordonBGBasil Gordon
- W. H. MillsWMW. H. Mills
- L. R. WelchLWL. R. Welch
- 1 January 1962
- journal article
- Published by Canadian Mathematical Society in Canadian Journal of Mathematics
- Vol. 14, 614-625
Abstract
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.Keywords
This publication has 4 references indexed in Scilit:
- A survey of difference setsProceedings of the American Mathematical Society, 1956
- Cyclic Incidence MatricesCanadian Journal of Mathematics, 1951
- Cyclic projective planesDuke Mathematical Journal, 1947
- A theorem in finite projective geometry and some applications to number theoryTransactions of the American Mathematical Society, 1938