Hostname: page-component-cd9895bd7-jn8rn Total loading time: 0 Render date: 2024-12-30T20:23:04.186Z Has data issue: false hasContentIssue false
  • English
  • Français

An arithmetic transference proof of a relative Szemerédi theorem

Published online by Cambridge University Press:  14 November 2013

YUFEI ZHAO
YUFEI ZHAO*
Affiliation:
Department of Mathematics, MIT, Cambridge, MA 02139-4307, U.S.A. e-mail: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

Recently, Conlon, Fox and the author gave a new proof of a relative Szemerédi theorem, which was the main novel ingredient in the proof of the celebrated Green–Tao theorem that the primes contain arbitrarily long arithmetic progressions. Roughly speaking, a relative Szemerédi theorem says that if S is a set of integers satisfying certain conditions, and A is a subset of S with positive relative density, then A contains long arithmetic progressions, and our recent results show that S only needs to satisfy a so-called linear forms condition.

This paper contains an alternative proof of the new relative Szemerédi theorem, where we directly transfer Szemerédi's theorem, instead of going through the hypergraph removal lemma. This approach provides a somewhat more direct route to establishing the result, and it gives better quantitative bounds.

The proof has three main ingredients: (1) a transference principle/dense model theorem of Green–Tao and Tao–Ziegler (with simplified proofs given later by Gowers, and independently, Reingold–Trevisan–Tulsiani–Vadhan) applied with a discrepancy/cut-type norm (instead of a Gowers uniformity norm as it was applied in earlier works); (2) a counting lemma established by Conlon, Fox and the author; and (3) Szemerédi's theorem as a black box.

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 156 , Issue 2 , March 2014 , pp. 255 - 261
Copyright
Copyright © Cambridge Philosophical Society 2013 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Conlon, D., Fox, J. and Zhao, Y. A relative Szemerédi theorem. arXiv:1305.5440.Google Scholar
[2]Goldston, D. A. and Yildirim, C. Y.Higher correlations of divisor sums related to primes. I. Triple correlations. Integers 3 (2003), A5, 66.Google Scholar
[3]Gowers, W. T.A new proof of Szemerédi's theorem. Geom. Funct. Anal. 11 (2001), no. 3, 465–588.Google Scholar
[4]Gowers, W. T.Hypergraph regularity and the multidimensional Szemerédi theorem. Ann. of Math. 166 (2007), no. 3, 897–946.Google Scholar
[5]Gowers, W. T.Decompositions, approximate structure, transference and the Hahn–Banach theorem. Bull. Lond. Math. Soc. 42 (2010), no. 4, 573–606.Google Scholar
[6]Green, B. and Tao, T.The primes contain arbitrarily long arithmetic progressions. Ann. of Math. 167 (2008), no. 2, 481–547.Google Scholar
[7]Green, B. and Tao, T.New bounds for Szemerédi's theorem. II. A new bound for r 4(N). Analytic Number Theory (Cambridge Press, Cambridge, 2009), pp. 180–204.Google Scholar
[8]Nagle, B., Rödl, V. and Schacht, M.The counting lemma for regular k-uniform hypergraphs. Random Structures Algorithms 28 (2006), no. 2, 113–179.CrossRefGoogle Scholar
[9]Reingold, O., Trevisan, L., Tulsiani, M. and Vadhan, S. New proofs of the Green–Tao–Ziegler dense model theorem: an exposition. arXiv:0806.0381.Google Scholar
[10]Reingold, O., Trevisan, L., Tulsiani, M. and Vadhan, S. Dense subsets of pseudorandom sets. 49th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society (2008), pp. 76–85.Google Scholar
[11]Rödl, V. and Skokan, J.Regularity lemma for k-uniform hypergraphs.Random Structures Algorithms 25 (2004), no. 1, 1–42.CrossRefGoogle Scholar
[12]Rödl, V. and Skokan, J.Applications of the regularity lemma for uniform hypergraphs. Random Structures Algorithms 28 (2006), no. 2, 180–194.Google Scholar
[13]Sanders, T.On Roth's theorem on progressions. Ann. of Math. (2) 174 (2011), no. 1, 619–636.Google Scholar
[14]Szemerédi, E.On sets of integers containing no k elements in arithmetic progression. Acta Arith. 27 (1975), 199–245.Google Scholar
[15]Tao, T. A remark on Goldston–Yíldírím correlation estimates. Available at http://www.math.ucla.edu/~tao/preprints/Expository/gy-corr.dvi.Google Scholar
[16]Tao, T.The Gaussian primes contain arbitrarily shaped constellations. J. Anal. Math. 99 (2006), 109–176.Google Scholar
[17]Tao, T.A variant of the hypergraph removal lemma. J. Combin. Theory Ser. A 113 (2006), no. 7, 1257–1280.Google Scholar
[18]Tao, T. and Ziegler, T.The primes contain arbitrarily long polynomial progressions. Acta Math. 201 (2008), no. 2, 213–305.CrossRefGoogle Scholar
[19]Varnavides, P.On certain sets of positive density. J. London Math. Soc. 34 (1959), 358–360.CrossRefGoogle Scholar