Arithmetic Ramsey theory over the primes

We study density and partition properties of polynomial equations in prime variables. We consider equations of the form a₁h(x₁) + ⋯ + aₛh(xₛ)=b , where the a i and b are fixed coefficients and h is an arbitrary integer polynomial of degree d . We establish that the natural necessary conditions for this equation to have a monochromatic non-constant solution with respect to any finite colouring of the prime numbers are also sufficient when the equation has at least (1+o(1))d² variables. We similarly characterize when such equations admit solutions over any set of primes with positive relative upper density. In both cases, we obtain lower bounds for the number of monochromatic or dense solutions in primes that are of the correct order of magnitude. Our main new ingredient is a uniform lower bound on the cardinality of a prime polynomial Bohr set.