The primes contain arbitrarily long arithmetic progressions
From MaRDI portal
Abstract: We prove that there are arbitrarily long arithmetic progressions of primes. There are three major ingredients. The first is Szemeredi's theorem, which asserts that any subset of the integers of positive density contains progressions of arbitrary length. The second, which is the main new ingredient of this paper, is a certain transference principle. This allows us to deduce from Szemeredi's theorem that any subset of a sufficiently pseudorandom set of positive relative density contains progressions of arbitrary length. The third ingredient is a recent result of Goldston and Yildirim. Using this, one may place the primes inside a pseudorandom set of ``almost primes with positive relative density.
Recommendations
- scientific article; zbMATH DE number 5233961
- The Green-Tao Theorem on arithmetic progressions in the primes: an ergodic point of view
- Arithmetic progressions in prime numbers (after B. Green and T. Tao)
- Almost arithmetic progressions in the primes and other large sets
- Obstructions to uniformity and arithmetic patterns in the primes
- A multidimensional Szemerédi theorem in the primes via combinatorics
- The primes contain arbitrarily long polynomial progressions
- The Green-Tao theorem: an exposition
- Arithmetic progressions and the primes
- Roth's theorem in the primes
Cited in
(only showing first 100 items - show all)- The metamathematics of ergodic theory
- Uniformity seminorms on \(\ell^{\infty}\) and applications
- Arithmetic progressions in sets of fractional dimension
- Additive combinatorics and graph theory
- Ergodic theorems for nonconventional arrays and an extension of the Szemerédi theorem
- Finite Ramanujan expansions and shifted convolution sums of arithmetical functions. II.
- Arithmetic progressions in multiplicative groups of finite fields
- Expansion for cubes in the Heisenberg group
- A multidimensional Szemerédi theorem in the primes via combinatorics
- Finite and infinite arithmetic progressions related to beta-expansion
- Prime power and prime product distance graphs
- A proof of a sumset conjecture of Erdős
- A structure theorem for multiplicative functions over the Gaussian integers and applications
- What we talk about when we talk about numbers
- Dimension of certain sets of regular and minus continued fractions with positive partial quotients
- On the Gowers norms of certain functions
- In a shadow of the RH: cyclic vectors of Hardy spaces on the Hilbert multidisc
- Noise correlation bounds for uniform low degree functions
- Note on the lower bound of least common multiple
- Generalized Fourier coefficients of multiplicative functions
- Distributions of finite sequences represented by polynomials in Piatetski-Shapiro sequences
- Longest arithmetic progressions of palindromes
- On Assouad dimension and arithmetic progressions in sets defined by digit restrictions
- Equisum partitions of sets of positive integers
- An approximate logic for measures
- Distribution of \(\alpha p^2\) modulo one with prime variable \(p\) of a special form
- Counting pseudo progressions
- Multidimensional configurations in the primes with shifted prime steps
- Arithmetic progressions of Carmichael numbers in a reduced residue class
- Approximate arithmetic structure in large sets of integers
- Linear inequalities in primes
- Rational points on fibrations with few non-split fibres
- An abelian loop for non-composite numbers
- On arithmetic progressions in model sets
- Diophantine equations in primes: density of prime points on affine hypersurfaces
- Arithmetic progressions and chaos in linear dynamics
- A Szemerédi-type theorem for subsets of the unit cube
- The number of k-dimensional corner-free subsets of grids
- Regularity and inverse theorems for uniformity norms on compact abelian groups and nilmanifolds
- Gowers norms control diophantine inequalities
- Multidimensional scaling and visualization of patterns in prime numbers
- Conjugacy class sizes in arithmetic progression
- Algebraic combinatorics in bounded induction
- The Bateman-Horn conjecture: heuristic, history, and applications
- Natural density and the quantifier ``most
- The most likely common difference of arithmetic progressions among primes
- Diophantine approximation with Goldbach numbers
- Sparse subsets of the natural numbers and Euler's totient function
- Arithmetic progressions in self-similar sets
- Bivariate fluctuations for the number of arithmetic progressions in random sets
- Structured sequences and matrix ranks
- On the interplay between additive and multiplicative largeness and its combinatorial applications
- The Green-Tao theorem for primes of the form x^2+y^2+1
- Random unconditional convergence of vector-valued Dirichlet series
- The structure of logarithmically averaged correlations of multiplicative functions, with applications to the Chowla and Elliott conjectures
- On a biparameter maximal multilinear operator
- Some analytical and computational aspects of prime numbers, prime number theorems and distribution of primes with applications
- A multi-dimensional Szemerédi theorem for the primes via a correspondence principle
- Feasible analysis, randomness, and base invariance
- A relative Szemerédi theorem
- Enveloping semigroups in topological dynamics
- An inverse theorem for the uniformity seminorms associated with the action of \(\mathbb F_p^\infty\)
- A Hardy field extension of Szemerédi's theorem
- On sums of sparse prime subsets
- Counting rational points on quartic del Pezzo surfaces with a rational conic
- Restriction theory of the Selberg sieve, with applications
- Ramsey classes of topological and metric spaces
- A density version of the Vinogradov three primes theorem
- Extremal results in sparse pseudorandom graphs
- An application of proof mining to nonlinear iterations
- The Gaussian primes contain arbitrarily shaped constellations
- On twin primes associated with the Hawkins random sieve
- The Green-Tao theorem on primes in arithmetical progressions in the positive cone of \(\mathbb Z [X]\)
- Finite field models in arithmetic combinatorics -- ten years on
- Hilbert cubes in arithmetic sets
- A view on multiple recurrence
- A transference principle for systems of linear equations, and applications to almost twin primes
- Box-counting dimensions of popcorn subsets
- Finite configurations in sparse sets
- A prime analogue of Roth's theorem in function fields
- Sum-avoiding sets in groups
- Concatenation theorems for anti-Gowers-uniform functions and Host-Kra characteristic factors
- Goldbach's conjectures: a historical perspective
- Advice lower bounds for the dense model theorem
- Additive combinatorics: with a view towards computer science and cryptography -- an exposition
- Large gaps between consecutive prime numbers
- On Bhargava's factorials of the set of twin primes in \(\mathbb{Z}\) and in \(\mathbb{F}_{q}[T]\)
- Ergodic theory, Boole type transformations, dynamical systems theory
- On systems of complexity one in the primes
- The least common multiple of consecutive arithmetic progression terms
- The ternary Goldbach problem with primes in positive density sets
- Are There Arbitrarily Long Arithmetic Progressions In The Sequence of Twin Primes?
- On the distribution of \(\alpha p\) modulo one for primes \(p\) of a special form
- Linear forms and quadratic uniformity for functions on F^n_p
- Poincaré recurrence and number theory: thirty years later
- Expander graphs in pure and applied mathematics
- Arithmetic progressions in the graphs of slightly curved sequences
- The least common multiple of consecutive terms in a quadratic progression
- Gowers uniformity norm and pseudorandom measures of the pseudorandom binary sequences
- Generalizations of Fourier analysis, and how to apply them
This page was built for publication: The primes contain arbitrarily long arithmetic progressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2389092)
