On the size of Nikodym sets in spaces over rings
Chengfei Xie, Gennian Ge

TL;DR
This paper extends the understanding of Nikodym sets in spaces over rings, establishing lower bounds on their size when the modulus is square-free, generalizing known finite field results.
Contribution
It proves a lower bound on the size of Nikodym sets over rings with square-free modulus, extending finite field results to a broader algebraic setting.
Findings
Nikodym sets have size at least c_n N^{n-o(1)} for square-free N
The result generalizes finite field case to rings over integers
Provides bounds that depend only on the dimension n
Abstract
A Nikodym set is a set containing for every , where is a line passing through . We prove that if is square-free, then the size of every Nikodym set is at least , where only depends on . This result is an extension of the result in the finite field case.
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
TopicsComplexity and Algorithms in Graphs · Limits and Structures in Graph Theory · Advanced Graph Theory Research
