Subsets of Fpn×Fpn without L-shaped configurations
Abstract
Fix a prime p≥ 11. We show that there exists a positive integer m such that any subset of Fpn×Fpn containing no nontrivial configurations of the form (x,y),(x,y+z),(x,y+2z),(x+z,y) must have density 1/mn, where m denotes the m-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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.