English

On an Argument of Shkredov on Two-Dimensional Corners

Combinatorics 2007-05-23 v3 Number Theory

Abstract

Let F2n\mathbb F_2^n be the finite field of cardinality 2n2 ^{n}. For all large nn, any subset AF2n×F2nA\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)} \{(x,y) ,(x+d,y) ,(x,y+d)\} for x,y,dF2nx,y,d\in \mathbb F_2^n and d0d\neq0. 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 logn \log n, which is larger than has been obtained previously.

Keywords

Cite

@article{arxiv.math/0510491,
  title  = {On an Argument of Shkredov on Two-Dimensional Corners},
  author = {Michael T Lacey and William McClain},
  journal= {arXiv preprint arXiv:math/0510491},
  year   = {2007}
}

Comments

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