2000 character limit reached
Furstenberg sets and Furstenberg schemes over finite fields
Published 12 Feb 2015 in math.AG, math.CA, and math.CO | (1502.03736v1)
Abstract: We give a lower bound for the size of a subset of $\mathbb F_qn$ 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.