Two-Distance Sets over Finite Fields
Jozsef Solymosi

TL;DR
This paper demonstrates that Blokhuis' quadratic upper bound for two-distance sets over finite fields is nearly optimal in most dimensions, providing new constructions that complement existing higher-dimensional maximal sets.
Contribution
It proves the sharpness of Blokhuis' bound over finite fields and introduces new constructions that extend previous Lorentz space results.
Findings
Blokhuis' quadratic upper bound is sharp in almost all dimensions over finite fields.
New constructions complement existing maximal sets in Lorentz spaces.
The results advance understanding of two-distance sets in finite field geometries.
Abstract
We show that Blokhuis' quadratic upper bound for two-distance sets is sharp over finite fields in almost all dimensions. Our construction complements Lison\v{e}k's higher-dimensional maximal constructions that were carried out in Lorentz spaces.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Topology and Set Theory · Computability, Logic, AI Algorithms
