Monochromatic integers adding to polynomials of prime variables
From MaRDI portal
Publication:653985
DOI10.1007/s00493-011-2531-9zbMath1249.11099OpenAlexW2069376803MaRDI QIDQ653985
Publication date: 20 December 2011
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-011-2531-9
Goldbach-type theorems; other additive questions involving primes (11P32) Applications of the Hardy-Littlewood method (11P55) Extremal combinatorics (05D99)
Related Items (1)
Cites Work
- On \(\Lambda\) (p)-subsets of squares
- Roth's theorem in the primes
- Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions
- Fourier transform restriction phenomena for certain lattice subsets and applications to nonlinear evolution equations. I: Schrödinger equations
- The primes contain arbitrarily long arithmetic progressions
- On the Number of Monochromatic Solutions of x + y =z 2
- A density version of Vinogradov's three primes theorem
- Difference sets and polynomials of prime variables
- On difference sets of sequences of integers. I
- On difference sets of sequences of integers. III
This page was built for publication: Monochromatic integers adding to polynomials of prime variables