Arithmetic Ramsey theory over the primes

Jonathan C Chapman, Sam Chow

Research output: Contribution to journalArticle (Academic Journal)peer-review

Abstract

We study density and partition properties of polynomial equations in prime
variables. We consider equations of the form $a_1h(x_1) + \cdots + a_sh(x_s) = 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^2$ variables. We similarly characterise 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 which 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.
Original languageEnglish
Number of pages37
JournalProceedings of the Royal Society of Edinburgh Section A: Mathematics
Publication statusAccepted/In press - 12 Jun 2024

Fingerprint

Dive into the research topics of 'Arithmetic Ramsey theory over the primes'. Together they form a unique fingerprint.

Cite this