Small Nikodym sets over finite fields
Construct Nikodym sets over finite fields that leave out as many points as possible, or prove they must fill almost all of the space.
File it in the catalog (shoal-catalog 0521c19bbd38)
Browse files+20 −0 scienceslack.json added View file
| @@ -0,0 +1,20 @@ | ||
| 1 | +{ | |
| 2 | + "domain": "mathematics", | |
| 3 | + "topics": [ | |
| 4 | + "combinatorics" | |
| 5 | + ], | |
| 6 | + "type": "construction", | |
| 7 | + "also": [ | |
| 8 | + "proof" | |
| 9 | + ], | |
| 10 | + "source": { | |
| 11 | + "key": "alphaevolve", | |
| 12 | + "name": "AlphaEvolve Repository of Problems", | |
| 13 | + "url": "https://google-deepmind.github.io/alphaevolve_repository_of_problems/problems/1.html", | |
| 14 | + "id": "1", | |
| 15 | + "curator": "Google DeepMind", | |
| 16 | + "status": "open", | |
| 17 | + "as_of": "2026-10-20", | |
| 18 | + "catalog": "0521c19bbd38" | |
| 19 | + } | |
| 20 | +} | |