Papers
Topics
Authors
Recent
Search
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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.