English

Singer difference sets and the projective norm graph

Combinatorics 2019-08-16 v1 Number Theory

Abstract

We demonstrate a close connection between the classic planar Singer difference sets and certain norm equation systems arising from projective norm graphs. This, on the one hand leads to a novel description of planar Singer difference sets as a subset H\mathcal{H} of N\mathcal{N}, the group of elements of norm 1 in the field extension Fq3/Fq\mathbb{F}_{q^3}/\mathbb{F}_q. H\mathcal{H} is given as the solution set of a simple polynomial equation, and we obtain an explicit formula expressing each non-identity element of N\mathcal{N} as a product BC1B\cdot C^{-1} with B,CHB, C\in \mathcal{H}. The description and the definitions naturally carry over to the nonplanar and the infinite setting. On the other hand, relying heavily on the difference set properties, we also complete the proof that the projective norm graph NG(q,4)\text{NG}(q,4) does contain the complete bipartite graph K4,6K_{4,6} for every prime power q5q \geq 5. This complements the property, known for more than two decades, that projective norm graphs do not contain K4,7K_{4,7} (and hence provide tight lower bounds for the Tur\'an number ex(n,K4,7)ex(n,K_{4,7})).

Keywords

Cite

@article{arxiv.1908.05591,
  title  = {Singer difference sets and the projective norm graph},
  author = {Tamás Mészáros and Lajos Rónyai and Tibor Szabó},
  journal= {arXiv preprint arXiv:1908.05591},
  year   = {2019}
}

Comments

25 pages + 1 page Appendix