Generalised Rado and Roth criteria
Number Theory
2022-10-11 v1 Combinatorics
Abstract
We study the Ramsey properties of equations , where are integers, and is an integer polynomial of degree . Provided there are at least variables, we show that Rado's criterion and an intersectivity condition completely characterise which equations of this form admit monochromatic solutions with respect to an arbitrary finite colouring of the positive integers. Furthermore, we obtain a Roth-type theorem for these equations, showing that they admit non-constant solutions over any set of integers with positive upper density if and only if . In addition, we establish sharp asymptotic lower bounds for the number of monochromatic/dense solutions (supersaturation).
Cite
@article{arxiv.2210.04347,
title = {Generalised Rado and Roth criteria},
author = {Jonathan Chapman and Sam Chow},
journal= {arXiv preprint arXiv:2210.04347},
year = {2022}
}
Comments
36 pages