Furstenberg sets and Furstenberg schemes over finite fields
Abstract
We give a lower bound for the size of a subset of Fqn containing a rich k-plane in every direction, a k-plane Furstenberg set. The chief novelty of our method is that we use arguments on non-reduced subschemes and flat families to derive combinatorial facts about incidences between points and k-planes in space.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.