Subsets of $\mathbb{F}_p^n\times\mathbb{F}_p^n$ without L-shaped configurations
Sarah Peluse

TL;DR
This paper establishes a bound on the size of subsets in finite vector spaces avoiding specific four-point configurations, advancing the understanding of multidimensional Szemerédi-type theorems in finite fields.
Contribution
It provides the first meaningful bound for the density of subsets avoiding certain four-point configurations in two dimensions over finite fields.
Findings
Bound on subset density is inversely related to iterated logarithm of n.
First nontrivial bound for a 2D four-point configuration in finite field settings.
Advances the multidimensional Szemerédi theorem understanding.
Abstract
Fix a prime . We show that there exists a positive integer such that any subset of containing no nontrivial configurations of the form must have density , where denotes the -fold iterated logarithm. This gives the first reasonable bound in the multidimensional Szemer\'edi theorem for a two-dimensional four-point configuration in any setting.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Analytic Number Theory Research · Historical Geopolitical and Social Dynamics
