Distinguishing subgroups of the rationals by their Ramsey properties

DOI10.1016/J.JCTA.2014.10.002MaRDI QIDQ472168zbMATH OpenOpenAlexFDO

Authors Ben Barber, Neil Hindman, Imre Leader, D. Strauss

Publication date 19 November 2014

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1405.0460

zbMATH Keywords

rationalssubgroupscentral setspartition regular

Mathematics Subject Classification ID

Ramsey theory (05D10)

Abstract: 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.

Recommendations

• Partition regularity in the rationals
• scientific article; zbMATH DE number 1075579
• Rado's theorem for rings and modules
• Quantitative theorems for regular systems of equations
• Inhomogeneous partition regularity

Cites work

• scientific article; zbMATH DE number 3489125 (Why is no real title available?)
• A proof (involving Martin's axiom) of a partition relation
• Algebra in the Stone-Čech compactification. Theory and applications
• Note on Combinatorial Analysis
• Open Problems in Partition Regularity
• Partition regularity in the rationals
• Partition regularity of matrices
• Studien zur Kombinatorik

Cited in

(2)

• An algorithm to decide whether a rational subset of \({\mathbb{N}}^ k\) is recognizable
• A history of central sets

This page was built for publication: Distinguishing subgroups of the rationals by their Ramsey properties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q472168)