An arithmetic transference proof of a relative Szemerédi theorem

DOI10.1017/S0305004113000662zbMATH Open1345.11010arXiv1307.4959OpenAlexW3099496634WikidataQ56341575 ScholiaQ56341575MaRDI QIDQ5408700FDOQ5408700

Authors: Yufei Zhao 

Publication date: 11 April 2014

Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

Abstract: Recently Conlon, Fox, and the author gave a new proof of a relative Szemer'edi 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'edi 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 note contains an alternative proof of the new relative Szemer'edi theorem, where we directly transfer Szemer'edi'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'edi's theorem as a black box.

Full work available at URL: https://arxiv.org/abs/1307.4959

Recommendations

• A relative Szemerédi theorem
• The primes contain arbitrarily long arithmetic progressions
• Szemerédi's Theorem in the Primes
• The primes contain arbitrarily long polynomial progressions
• The Green-Tao Theorem on arithmetic progressions in the primes: an ergodic point of view

Mathematics Subject Classification ID

Arithmetic progressions (11B25) Arithmetic combinatorics; higher degree uniformity (11B30)

Cites Work

• Hypergraph regularity and the multidimensional Szemerédi theorem
• Regularity Lemma for k-uniform hypergraphs
• The counting lemma for regular k‐uniform hypergraphs
• Applications of the regularity lemma for uniform hypergraphs
• A new proof of Szemerédi's theorem
• On Certain Sets of Positive Density
• The primes contain arbitrarily long polynomial progressions
• The primes contain arbitrarily long arithmetic progressions
• A variant of the hypergraph removal lemma
• On Roth's theorem on progressions
• Decompositions, approximate structure, transference, and the Hahn-Banach theorem
• The Gaussian primes contain arbitrarily shaped constellations

Cited In (8)

• Subsets of without L-shaped configurations
• A transference principle for systems of linear equations, and applications to almost twin primes
• A Transference Approach to a Roth-Type Theorem in the Squares
• A relative Szemerédi theorem
• Advice lower bounds for the dense model theorem
• Uniformity norms, their weaker versions, and applications
• Szemerédi's Theorem in the Primes
• The regularity method for graphs with few 4‐cycles

This page was built for publication: An arithmetic transference proof of a relative Szemerédi theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5408700)