Partition regularity and multiplicatively syndetic sets
Combinatorics
2020-06-17 v3 Number Theory
Abstract
We show how multiplicatively syndetic sets can be used in the study of partition regularity of dilation invariant systems of polynomial equations. In particular, we prove that a dilation invariant system of polynomial equations is partition regular if and only if it has a solution inside every multiplicatively syndetic set. We also adapt the methods of Green-Tao and Chow-Lindqvist-Prendiville to develop a syndetic version of Roth's density increment strategy. This argument is then used to obtain bounds on the Rado numbers of configurations of the form .
Cite
@article{arxiv.1902.01149,
title = {Partition regularity and multiplicatively syndetic sets},
author = {Jonathan Chapman},
journal= {arXiv preprint arXiv:1902.01149},
year = {2020}
}
Comments
29 pages. v3. Referee comments incorporated, accepted for publication in Acta Arithmetica