Monochromatic integers adding to polynomials of prime variables
From MaRDI portal
Publication:653985
Recommendations
- A Schur-type addition theorem for primes
- The two-colour Rado number for the equation \(ax+by=(a+b)_z\)
- Difference sets and polynomials of prime variables
- Avoiding Monochromatic Sequences With Special Gaps
- Polynomials with Large Numbers of Prime Values
- Sequences with Large Numbers of Prime Value
- Primes of the form \(kM^n+n\)
- Almost-prime values of binary forms with one prime variable
- On the degree of regularity of generalized van der Waerden triples
- On the Number of Monochromatic Solutions of x + y =z 2
Cites work
- A density version of Vinogradov's three primes theorem
- Difference sets and polynomials of prime variables
- 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
- On \(\Lambda\) (p)-subsets of squares
- On difference sets of sequences of integers. I
- On difference sets of sequences of integers. III
- On the Number of Monochromatic Solutions of x + y =z 2
- Roth's theorem in the primes
- The primes contain arbitrarily long arithmetic progressions
Cited in
(4)
This page was built for publication: Monochromatic integers adding to polynomials of prime variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q653985)
