A relative Szemerédi theorem
From MaRDI portal
Publication:2355780
DOI10.1007/S00039-015-0324-9zbMATH Open1345.11008arXiv1305.5440OpenAlexW1836492331WikidataQ56341574 ScholiaQ56341574MaRDI QIDQ2355780FDOQ2355780
Authors: David Conlon, Jacob Fox, Yufei Zhao 
Publication date: 28 July 2015
Published in: Geometric and Functional Analysis. GAFA (Search for Journal in Brave)
Abstract: The celebrated Green-Tao theorem states that there are arbitrarily long arithmetic progressions in the primes. One of the main ingredients in their proof is a relative Szemer'edi theorem which says that any subset of a pseudorandom set of integers of positive relative density contains long arithmetic progressions. In this paper, we give a simple proof of a strengthening of the relative Szemer'edi theorem, showing that a much weaker pseudorandomness condition is sufficient. Our strengthened version can be applied to give the first relative Szemer'edi theorem for -term arithmetic progressions in pseudorandom subsets of of density . The key component in our proof is an extension of the regularity method to sparse pseudorandom hypergraphs, which we believe to be interesting in its own right. From this we derive a relative extension of the hypergraph removal lemma. This is a strengthening of an earlier theorem used by Tao in his proof that the Gaussian primes contain arbitrarily shaped constellations and, by standard arguments, allows us to deduce the relative Szemer'edi theorem.
Full work available at URL: https://arxiv.org/abs/1305.5440
Recommendations
- A generalization of Szegö's theorem
- A relative Shafarevich theorem
- On a generalization of Szemerédi's theorem
- ON A GENERALIZATION OF SZEMERÉDI'S THEOREM
- scientific article; zbMATH DE number 39934
- scientific article; zbMATH DE number 3884434
- Szasz's theorem and its generalizations
- An extension of Szegö’s theorem
- scientific article; zbMATH DE number 803516
- scientific article; zbMATH DE number 3853341
Cites Work
- Limits of dense graph sequences
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Title not available (Why is that?)
- Regularity Lemma for k-uniform hypergraphs
- The counting lemma for regular k‐uniform hypergraphs
- Applications of the regularity lemma for uniform hypergraphs
- Quasi-random graphs
- A new proof of Szemerédi's theorem
- Extremal results in sparse pseudorandom graphs
- Extremal results for random discrete structures
- Combinatorial theorems in sparse random sets
- On sets of integers containing k elements in arithmetic progression
- Hypergraph containers
- Independent sets in hypergraphs
- The primes contain arbitrarily long polynomial progressions
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- An ergodic Szemerédi theorem for commuting transformations
- The primes contain arbitrarily long arithmetic progressions
- An efficient sparse regularity concept
- A note on the random greedy independent set algorithm
- Title not available (Why is that?)
- Linear equations in primes
- Quick approximation to matrices and applications
- A variant of the hypergraph removal lemma
- Szemerédi's lemma for the analyst
- A removal lemma for systems of linear equations over finite fields
- A Szemerédi-type regularity lemma in abelian groups, with applications
- A proof of Green's conjecture regarding the removal properties of sets of linear equations
- Szemerédi’s Regularity Lemma for Sparse Graphs
- Extremal problems on set systems
- On the KŁR conjecture in random graphs
- Title not available (Why is that?)
- A combinatorial proof of the removal lemma for groups
- Decompositions, approximate structure, transference, and the Hahn-Banach theorem
- Szemerédi's regularity Lemma for matrices and sparse graphs
- A Note on a Question of Erdős and Graham
- Linear correlations amongst numbers represented by positive definite binary quadratic forms
- Metrics for sparse graphs
- A multidimensional Szemerédi theorem in the primes via combinatorics
- The Gaussian primes contain arbitrarily shaped constellations
- Green-Tao theorem in function fields
- A multi-dimensional Szemerédi theorem for the primes via a correspondence principle
- Constellations in \(\mathbb P^{d}\)
- A short proof of the multidimensional Szemerédi theorem in the primes
- Correlations of the divisor function
- An analytic approach to sparse hypergraphs: hypergraph removal
- An arithmetic transference proof of a relative Szemerédi theorem
Cited In (27)
- Narrow arithmetic progressions in the primes
- Dirac-type theorems in random hypergraphs
- A multi-dimensional Szemerédi theorem for the primes via a correspondence principle
- A transference principle for systems of linear equations, and applications to almost twin primes
- Arithmetic properties of sparse subsets of $\mathbb{Z}^n$
- Large gaps between consecutive prime numbers
- A counterexample to the Bollobás–Riordan conjectures on sparse graph limits
- Resilience for tight Hamiltonicity
- An 𝐿^{𝑝} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions
- Removal lemmas and approximate homomorphisms
- Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs
- A multidimensional Szemerédi theorem in the primes via combinatorics
- Uniformity norms, their weaker versions, and applications
- Small-scale distribution of linear patterns of primes
- Arithmetic progressions in multiplicative groups of finite fields
- Szemerédi's Theorem in the Primes
- An analytic approach to sparse hypergraphs: hypergraph removal
- The Gaussian primes contain arbitrarily shaped constellations
- Interview with David Conlon
- Weak hypergraph regularity and applications to geometric Ramsey theory
- An arithmetic transference proof of a relative Szemerédi theorem
- Polynomial patterns in the primes
- Minor arcs, mean values, and restriction theory for exponential sums over smooth numbers
- Diagonal Ramsey via effective quasirandomness
- The Green-Tao theorem for primes of the form \(x^2+y^2+1\)
- The regularity method for graphs with few 4‐cycles
- Counting results for sparse pseudorandom hypergraphs. I.
This page was built for publication: A relative Szemerédi theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2355780)
