Large point-line matchings and small Nikodym sets
Zach Hunter, Cosmin Pohoata, Jacques Verstraete, Shengtong Zhang

TL;DR
This paper constructs large point-line matchings in finite field geometries using a novel connection to arithmetic combinatorics, leading to improved bounds for Nikodym sets, blocking sets, and minimal distance problems.
Contribution
It introduces new large matchings in finite field incidence graphs and applies these to improve bounds on Nikodym sets, blocking sets, and minimal distance configurations.
Findings
Constructed matchings of size q^{1.233} in _q^2
Improved Nikodym set sizes to q^d - q^{d - o_d(1)}
Solved a longstanding problem by constructing a minimal blocking set in _qP^2
Abstract
For any integer and prime power , we construct unexpectedly large induced matchings in the point-line incidence graph of by leveraging a new connection with the Furstenberg-S\'ark\"ozy problem from arithmetic combinatorics. In particular, we significantly improve the previously well-known baselines when is prime, showing that contains matchings of size and contains matchings of size . These results and their proofs have several applications. First, we also obtain new constructions for finite field Nikodym sets in dimension , improving recent results of Tao by polynomial factors. For example, when is prime, we show the existence of Nikodym sets in of size . Second, we construct a new minimal blocking set in ,…
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 · Coding theory and cryptography · Polynomial and algebraic computation
