Papers
Topics
Authors
Recent
Search
2000 character limit reached

New Nikodym set constructions over finite fields

Published 11 Nov 2025 in math.CO | (2511.07721v1)

Abstract: For any fixed dimension $d \geq 3$ we construct a Nikodym set in $\F_qd$ of cardinality $qd - (\frac{d-2}{\log 2} +1+o(1)) q{d-1} \log q$ in the limit $q \to \infty$, when $q$ is an odd prime power. This improves upon the naive random construction, which gives a set of cardinality $qd - (d-1+o(1)) q{d-1} \log q$, and is new in the regime where $\F_q$ has unbounded characteristic and $q$ 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 give a new construction of Nikodym sets in $\F_q2$ for $q$ a perfect square that match the existing bounds of $q2 - q{3/2} + O(q \log q)$, assuming that $q$ is not the square of a prime $p \equiv 3 \pmod{4}$.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 4 likes about this paper.