New bounds for Szemeredi's theorem, Ia: Progressions of length 4 in finite field geometries revisited
Let p > 4 be a prime. We show that the largest subset of F_p^n with no 4-term arithmetic progressions has cardinality << N(log N)^{-c}, where c = 2^{-22} and N := p^n. A result of this type was claimed in a previous paper by the authors and published in Proc. London Math. Societ...
| Auteurs principaux: | , |
|---|---|
| Format: | Journal article |
| Publié: |
2012
|