Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Inhomogeneous Partition Regularity (1806.11374v1)

Published 29 Jun 2018 in math.CO

Abstract: We say that the system of equations $Ax=b$, where $A$ is an integer matrix and $b$ is a (non-zero) integer vector, is partition regular if whenever the integers are finitely coloured there is a monochromatic vector $x$ with $Ax=b$. Rado proved that the system $Ax=b$ 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 $R$. 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.

Summary

We haven't generated a summary for this paper yet.