English

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

Combinatorics 2023-05-05 v3

Abstract

A (k,m)(k,m)-Furstenberg set is a subset SFqnS \subset \mathbb{F}_q^n with the property that each kk-dimensional subspace of Fqn\mathbb{F}_q^n can be translated so that it intersects SS in at least mm points. Ellenberg and Erman proved that (k,m)(k,m)-Furstenberg sets must have size at least Cn,kmn/kC_{n,k}m^{n/k}, where Cn,kC_{n,k} is a constant depending only nn and kk. 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 Cn,kC_{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 nkn-k varieties, instead of just co-dimension nkn-k subspaces.

Keywords

Cite

@article{arxiv.1909.02431,
  title  = {Furstenberg sets in finite fields: Explaining and improving the Ellenberg-Erman proof},
  author = {Manik Dhar and Zeev Dvir and Ben Lund},
  journal= {arXiv preprint arXiv:1909.02431},
  year   = {2023}
}
R2 v1 2026-06-23T11:06:48.921Z