Papers
Topics
Authors
Recent
Search
2000 character limit reached

Furstenberg sets in finite fields: Explaining and improving the Ellenberg-Erman proof

Published 5 Sep 2019 in math.CO | (1909.02431v3)

Abstract: A $(k,m)$-Furstenberg set is a subset $S \subset \mathbb{F}qn$ with the property that each $k$-dimensional subspace of $\mathbb{F}_qn$ can be translated so that it intersects $S$ in at least $m$ points. Ellenberg and Erman proved that $(k,m)$-Furstenberg sets must have size at least $C{n,k}m{n/k}$, where $C_{n,k}$ is a constant depending only $n$ and $k$. In this paper, we adopt the same proof strategy as Ellenberg and Erman, but use more elementary techniques than their scheme-theoretic method. By modifying certain parts of the argument, we obtain an improved bound on $C_{n,k}$, and our improved bound is nearly optimal for an algebraic generalization the main combinatorial result. We also extend our analysis to give lower bounds for sets that have large intersection with shifts of a specific family of higher-degree co-dimension $n-k$ varieties, instead of just co-dimension $n-k$ subspaces.

Summary

Paper to Video (Beta)

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.

Authors (3)

Collections

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