A relative Szemerédi theorem
From MaRDI portal
Publication:2355780
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.
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
- scientific article; zbMATH DE number 3609704 (Why is no real title available?)
- scientific article; zbMATH DE number 1989994 (Why is no real title available?)
- scientific article; zbMATH DE number 2209746 (Why is no real title available?)
- A Note on a Question of Erdős and Graham
- A Szemerédi-type regularity lemma in abelian groups, with applications
- A combinatorial proof of the removal lemma for groups
- A multi-dimensional Szemerédi theorem for the primes via a correspondence principle
- A multidimensional Szemerédi theorem in the primes via combinatorics
- A new proof of Szemerédi's theorem
- A note on the random greedy independent set algorithm
- A proof of Green's conjecture regarding the removal properties of sets of linear equations
- A removal lemma for systems of linear equations over finite fields
- A short proof of the multidimensional Szemerédi theorem in the primes
- A variant of the hypergraph removal lemma
- An analytic approach to sparse hypergraphs: hypergraph removal
- An arithmetic transference proof of a relative Szemerédi theorem
- An efficient sparse regularity concept
- An ergodic Szemerédi theorem for commuting transformations
- Applications of the regularity lemma for uniform hypergraphs
- Combinatorial theorems in sparse random sets
- Constellations in \(\mathbb P^{d}\)
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Correlations of the divisor function
- Decompositions, approximate structure, transference, and the Hahn-Banach theorem
- Extremal problems on set systems
- Extremal results for random discrete structures
- Extremal results in sparse pseudorandom graphs
- Green-Tao theorem in function fields
- Hypergraph containers
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Independent sets in hypergraphs
- Limits of dense graph sequences
- Linear correlations amongst numbers represented by positive definite binary quadratic forms
- Linear equations in primes
- Metrics for sparse graphs
- On sets of integers containing k elements in arithmetic progression
- On the KŁR conjecture in random graphs
- Quasi-random graphs
- Quick approximation to matrices and applications
- Regularity Lemma for k-uniform hypergraphs
- Szemerédi's lemma for the analyst
- Szemerédi's regularity Lemma for matrices and sparse graphs
- Szemerédi’s Regularity Lemma for Sparse Graphs
- The Gaussian primes contain arbitrarily shaped constellations
- The counting lemma for regular k‐uniform hypergraphs
- The primes contain arbitrarily long arithmetic progressions
- The primes contain arbitrarily long polynomial progressions
Cited in
(27)- The regularity method for graphs with few 4‐cycles
- 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
- Large gaps between consecutive prime numbers
- Arithmetic properties of sparse subsets of $\mathbb{Z}^n$
- A counterexample to the Bollobás–Riordan conjectures on sparse graph limits
- Resilience for tight Hamiltonicity
- A multidimensional Szemerédi theorem in the primes via combinatorics
- Removal lemmas and approximate homomorphisms
- Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs
- 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
- An \(L^p\) theory of sparse graph convergence. I: Limits, sparse random graph models, and power law distributions
- Weak hypergraph regularity and applications to geometric Ramsey theory
- An arithmetic transference proof of a relative Szemerédi theorem
- Minor arcs, mean values, and restriction theory for exponential sums over smooth numbers
- Polynomial patterns in the primes
- The Green-Tao theorem for primes of the form \(x^2+y^2+1\)
- Diagonal Ramsey via effective quasirandomness
- 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)
