New Nikodym set constructions over finite fields
Terence Tao

TL;DR
This paper introduces improved constructions of Nikodym sets over finite fields for higher dimensions, achieving smaller set sizes than previous methods, especially when the field size has unbounded characteristic.
Contribution
The paper presents new explicit constructions of Nikodym sets in higher dimensions over finite fields that outperform naive random approaches, particularly for fields with unbounded characteristic.
Findings
Constructed Nikodym sets with smaller size bounds in high dimensions.
Provided explicit constructions matching known bounds in two dimensions.
Achieved improvements over random constructions in the unbounded characteristic regime.
Abstract
For any fixed dimension we construct a Nikodym set in of cardinality in the limit , when is an odd prime power. This improves upon the naive random construction, which gives a set of cardinality , and is new in the regime where has unbounded characteristic and not a perfect square. While the final proofs are completely human generated, the initial ideas of the construction were inspired by output from the tools \texttt{AlphaEvolve} and \texttt{DeepThink}. We also present a simple construction of Nikodym sets in for a perfect square that is a special case of known unital-based constructions, and matches the existing bounds of , assuming that is not the square of a prime .
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 · Cryptography and Residue Arithmetic
