arXiv Analytics

Sign in

arXiv:1405.0460 [math.CO]AbstractReferencesReviewsResources

Distinguishing subgroups of the rationals by their Ramsey properties

Ben Barber, Neil Hindman, Imre Leader, Dona Strauss

Published 2014-05-02Version 1

A system of linear equations with integer coefficients is partition regular over a subset S of the reals if, whenever S\{0} is finitely coloured, there is a solution to the system contained in one colour class. It has been known for some time that there is an infinite system of linear equations that is partition regular over R but not over Q, and it was recently shown (answering a long-standing open question) that one can also distinguish Q from Z in this way. Our aim is to show that the transition from Z to Q is not sharp: there is an infinite chain of subgroups of Q, each of which has a system that is partition regular over it but not over its predecessors. We actually prove something stronger: our main result is that if R and S are subrings of Q with R not contained in S, then there is a system that is partition regular over R but not over S. This implies, for example, that the chain above may be taken to be uncountable.

Related articles: Most relevant | Search more
arXiv:1910.00311 [math.CO] (Published 2019-10-01)
The Ramsey properties for Grassmannians over $\mathbb R$, $\mathbb C$
arXiv:1103.5686 [math.CO] (Published 2011-03-29, updated 2012-12-21)
Ramsey Properties of Permutations
arXiv:2207.13982 [math.CO] (Published 2022-07-28)
Sharp thresholds for Ramsey properties