On an Argument of Shkredov on Two-Dimensional Corners

Abstract

Let ${\mathbb{F}}_2^n$ be the finite field of cardinality $2^n$. For all large $n$, any subset $A\subset {\mathbb{F}}_2^n\times {\mathbb{F}}_2^n$ of cardinality \begin{equation*} \abs{A} \gtrsim 4^n \log\log n (\log n) ^{-1} \end{equation*} must contain three points $\{(x,y),(x+d,y),(x,y+d)\}$ for $x,y,d\in {\mathbb{F}}_2^n$ and $d\ne 0$. Our argument is an elaboration of an argument of Shkredov \cite {math.NT/0405406}, building upon the finite field analog of Ben Green \cite {math.NT/0409420}. The interest in our result is in the exponent on $\log n$, which is larger than has been obtained previously.

9 pages. IN Online Journal of Analytic Combinatorics, Vol 2. 2007. http://www.ojac.org/vol2/Lacey_McClain_2007.pdf

References in corpus (4)

• The primes contain arbitrarily long arithmetic progressions
• Long arithmetic progressions of primes
• On one problem of Gowers
• Obstructions to uniformity, and arithmetic patterns in the primes

Cited by in corpus (4)

• Three Dimensional Corners: A Box Norm Proof
• On a two-dimensional analog of Szemeredi's Theorem in Abelian groups
• Larger Corner-Free Sets from Combinatorial Degenerations
• A Polynomial Roth Theorem for Corners in Finite Fields