POLYNOMIAL PATTERNS IN THE PRIMES
From MaRDI portal
Publication:5226582
DOI10.1017/fmp.2017.3zbMath1459.11030arXiv1603.07817OpenAlexW2963980262MaRDI QIDQ5226582
Publication date: 1 August 2019
Published in: Forum of Mathematics, Pi (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1603.07817
Primes represented by polynomials; other multiplicative structures of polynomial values (11N32) Arithmetic combinatorics; higher degree uniformity (11B30)
Related Items
Uniformity norms, their weaker versions, and applications, Higher uniformity of bounded multiplicative functions in short intervals on average, A view on multiple recurrence, A polynomial Roth theorem on the real line, Bounds for sets with no polynomial progressions, Small sets containing any pattern, Further bounds in the polynomial Szemer
Cites Work
- Unnamed Item
- Large gaps between consecutive prime numbers
- Multiplicative functions in short intervals
- Erratum to ``The primes contain arbitrarily long polynomial progressions
- The quantitative behaviour of polynomial orbits on nilmanifolds
- The Möbius function is strongly orthogonal to nilsequences
- Diophantine equations in the primes
- The primes contain arbitrarily long polynomial progressions
- An averaged form of Chowla's conjecture
- Linear equations in primes
- Intersective polynomials and the primes
- A new proof of Szemerédi's theorem for arithmetic progressions of length four
- A relative Szemerédi theorem
- The primes contain arbitrarily long arithmetic progressions
- Concatenation theorems for anti-Gowers-uniform functions and Host-Kra characteristic factors
- Polynomial Configurations in the Primes
- Primes in short arithmetic progressions
- Sur certaines hypothèses concernant les nombres premiers
- A Heuristic Asymptotic Formula Concerning the Distribution of Prime Numbers
- Decompositions, approximate structure, transference, and the Hahn-Banach theorem
- On the representation of large odd integer as a sum of three almost equal primes
- On sets of integers containing k elements in arithmetic progression
- Polynomial extensions of van der Waerden’s and Szemerédi’s theorems
- The true complexity of a system of linear equations
- An inverse theorem for the Gowers \(U^{s+1}[N\)-norm]
- On the difference between consecutive primes
- A new proof of Szemerédi's theorem
