A search for affine difference sets of even order
โ Scribed by Troy D. VanAken
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 407 KB
- Volume
- 62
- Category
- Article
- ISSN
- 0378-3758
No coin nor oath required. For personal study only.
โฆ Synopsis
The Prime Power Conjecture asserts that the order of an affine difference set is an integral power of a prime number. K.T. Arasu and D. Jungnickel have shown that if the order of an affine difference set is even, then the order is either two or four or is divisible by eight. This paper extends this direction of research by studying cyclic affine difference sets whose orders are congruent to eight modulo sixteen. In particular, we give several numerical constraints that support the Prime Power Conjecture in this case. We conclude with a computer search for cyclic affine difference sets of order eight modulo sixteen that satisfy these new conditions.
๐ SIMILAR VOLUMES
It is shown that every abelian relative (m,n,m -1,(m 2 )/n )-difference set admits m 1 as a multiplier. ## 1. Relative difference sets and multipliers A relative (m, n, k, ).)-difference set in a finite group G of order mn relative to a \* Corresponding author.
A quasimultiple affine plane of order \(n\) and multiplicity \(\lambda\) is a \((v, k, \lambda)=\left(n^{2}, n, \lambda\right)\) balanced incomplete block design. For those cases where the Bruck-Ryser theorem rules out \(\lambda=1\) it is an interesting problem to determine the smallest actual value