Article contents
Concerning Difference Sets
Published online by Cambridge University Press: 20 November 2018
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 set of integers {a0, a1, … , an} is said to be a difference set modulo N if the set of differences {ai — aj (i,j = 0, 1, … , n) contains each non-zero residue mod N exactly once. It follows that N and n are connected by the relation N = n2 + n + 1. If {a0, a1 … an} is a difference set mod N, so is the set {a0 + s, a1 + s, … , an + s} (s = 0, 1, … , N). These difference sets form a finite projective plane of N points, with each difference set constituting a line in the plane.
- Type
- Research Article
- Information
- Copyright
- Copyright © Canadian Mathematical Society 1953
References
1.
Bruck, R. H. and Ryser, H. J., The nonexistence of certain finite projective planes, Can. J.
Math., 1 (1949), 88–93.Google Scholar
2.
Evans, T. A. and Mann, H. B., On simple difference sets, Sankhyā, 11 (1951), 357–364.Google Scholar
5.
Singer, James, A theorem infinite projective geometry and some applications to number theory, Trans. Amer. Math. Soc, 43 (1938), 377–385.Google Scholar
You have
Access
- 10
- Cited by