An arithmetic transference proof of a relative Szemerédi theorem

DOI10.1017/S0305004113000662zbMath1345.11010arXiv1307.4959OpenAlexW3099496634WikidataQ56341575 ScholiaQ56341575MaRDI QIDQ5408700

Yufei Zhao

Publication date: 11 April 2014

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

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

Mathematics Subject Classification ID

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

Related Items (6)

Uniformity norms, their weaker versions, and applications ⋮ Subsets of without L-shaped configurations ⋮ Szemerédi's Theorem in the Primes ⋮ Advice Lower Bounds for the Dense Model Theorem ⋮ The regularity method for graphs with few 4‐cycles ⋮ A relative Szemerédi theorem

Cites Work

• On Roth's theorem on progressions
• The primes contain arbitrarily long polynomial progressions
• A variant of the hypergraph removal lemma
• The primes contain arbitrarily long arithmetic progressions
• The Gaussian primes contain arbitrarily shaped constellations
• Hypergraph regularity and the multidimensional Szemerédi theorem
• On Certain Sets of Positive Density
• Decompositions, approximate structure, transference, and the Hahn-Banach 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

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