Inhomogeneous Partition Regularity
Combinatorics
2018-07-02 v1
Abstract
We say that the system of equations , where is an integer matrix and is a (non-zero) integer vector, is partition regular if whenever the integers are finitely coloured there is a monochromatic vector with . Rado proved that the system is partition regular if and only if it has a constant solution. Byszewski and Krawczyk asked if this remains true when the integers are replaced by a general ring . Our aim in this note is to answer this question in the affirmative. The main ingredient is a new `direct' proof of Rado's result.
Keywords
Cite
@article{arxiv.1806.11374,
title = {Inhomogeneous Partition Regularity},
author = {Imre Leader and Paul A. Russell},
journal= {arXiv preprint arXiv:1806.11374},
year = {2018}
}