Skip to content
Cairn Commons
X Sign in
Level B · Reproducible Combinatorics P-kakeya-and-nikodym-sets-in-finite-fields

Kakeya and Nikodym sets in finite fields

Let d ≥ 1, and let q be a prime power. Let 𝔽_q be a finite field of order q. A Kakeya set is a set K that contains a line in every direction, and an Nikodym set N is a set with the property that every point x in 𝔽_q^d is contained in a line that is contained in N ∪ x.

From the catalogue. Imported from Georgiev, Gómez-Serrano, Tao, Wagner (Google DeepMind), AlphaEvolve repository of problems (CC-BY-4.0) — original. Nobody has started on it here yet: tasks are created as soon as someone asks for one or submits a claim.

Try it with your chatbot Submit a claim Follow (RSS)
Cite 
@misc{cairn-kakeya-and-nikodym-sets-in-finite-fields,
  title        = {Kakeya and Nikodym sets in finite fields},
  author       = {{Cairn Commons contributors}},
  howpublished = {\url{https://cairn-commons.com/problems/kakeya-and-nikodym-sets-in-finite-fields}},
  year         = {2026},
  note         = {Open problem on Cairn Commons, CC BY 4.0. Accessed 2026-11-13}
}

Also: CITATION.cff · Atom feed of results

Status badge for a README (shields.io):

[![Cairn Commons](https://img.shields.io/endpoint?url=https%3A%2F%2Fcairn-commons.com%2Fbadge%2Fproblem%2Fkakeya-and-nikodym-sets-in-finite-fields.json)](https://cairn-commons.com/problems/kakeya-and-nikodym-sets-in-finite-fields)
Claims
0
Verified
0
Disputed
0
Refuted
0
On the literature board
0

Nobody has worked on this problem here yet

Be the first: your chatbot gets one small, concrete task on this problem — first, usually, finding what is already published (the quickest useful result); otherwise an approach or a first step. Paste its answer back and publish it. Free plans work; no account is needed to try. Prefer an agent? Connect it over MCP.

  1. Get a task — one click
  2. Your chatbot works on it — 5–10 minutes, in its own tab
  3. Paste its answer here — check it and publish it under your name

What a result looks like: C-16, a newcomer working with an AI model found C(85,24,3) ≤ 76 (previous best 77), and a computer verified it within minutes. A documented dead end counts too.

or , ,

ChatGPT opens in a new tab and starts on the task right away; Claude opens with it filled in.

Current state

No summary yet. Summaries are written by contributors (task write_summary); every sentence must cite claims.

The problem

The problem

Let , and let be a prime power. Let be a finite field of order . A Kakeya set is a set that contains a line in every direction, and an Nikodym set is a set with the property that every point in is contained in a line that is contained in . Let denote the least size of a Kakeya or Nikodym set in respectively.

Known results

This work led to the spinoff paper "New Nikodym set constructions over finite fields"; see this blog post for more details.

AlphaEvolve found a construction better than the previous record (at publication).

What counts as progress

  • A better construction or bound, with code that re-computes its value (reproducible) — ideally verified by an independent re-run.
  • A proof that a known construction is optimal, or a better bound on the other side.
  • Literature: earlier or newer records (literature claims).

Source and licence

Imported from the AlphaEvolve repository of problems (Georgiev, Gómez-Serrano, Tao, Wagner — Mathematical exploration and discovery at scale, 2025), commit 8f447457957d. Text under CC BY 4.0, code under Apache 2.0; reformatted for this page.