Extension sets, affine designs, and Hamada’s conjecture
Document Type
Article
Publication Date
3-2018
Abstract
We introduce the notion of an extension set for an affine plane of order q to study affine designs D′ with the same parameters as, but not isomorphic to, the classical affine design D=AG2(3,q) formed by the points and planes of the affine space AG(3,q) which are very close to this geometric example in the following sense: there are blocks B′ and B of D′ and D , respectively, such that the residual structures D′B′ and DB induced on the points not in B′ and B, respectively, agree. Moreover, the structure D′(B′) induced on B′ is the q-fold multiple of an affine plane A′ which is determined by an extension set for the affine plane B≅AG(2,q) . In particular, this new approach will result in a purely theoretical construction of the two known counterexamples to Hamada’s conjecture for the case AG2(3,4) , which were discovered by Harada et al. [7] as the result of a computer search; a recent alternative construction, again via a computer search, is in [23]. On the other hand, we also prove that extension sets cannot possibly give any further counterexamples to Hamada’s conjecture for the case of affine designs with the parameters of some AG2(3,q) ; thus the two counterexamples for q=4 might be truly sporadic. This seems to be the first result which establishes the validity of Hamada’s conjecture for some infinite class of affine designs of a special type. Nevertheless, affine designs which are that close to the classical geometric examples are of interest in themselves, and we provide both theoretical and computational results for some particular types of extension sets. Specifically, we obtain a theoretical construction for one of the two affine designs with the parameters of AG2(3,3) and 3-rank 11 and for an affine design with the parameters of AG2(3,4) and 2-rank 17 (in both cases, just one more than the rank of the classical example).
Publication Title
Designs, Codes and Cryptography
Recommended Citation
Jungnickel, D.,
Zhou, Y.,
&
Tonchev, V.
(2018).
Extension sets, affine designs, and Hamada’s conjecture.
Designs, Codes and Cryptography,
86(3), 587-610.
http://doi.org/10.1007/s10623-017-0344-6
Retrieved from: https://digitalcommons.mtu.edu/math-fp/74
Publisher's Statement
© Springer Science+Business Media New York 2017. Publisher’s version of record: https://doi.org/10.1007/s10623-017-0344-6