Partition regularity without the columns property
- 20 February 2015
- journal article
- Published by American Mathematical Society (AMS) in Proceedings of the American Mathematical Society
- Vol. 143 (8) , 3387-3399
Abstract
A finite or infinite matrix with rational entries is called partition regular if whenever the natural numbers are finitely coloured there is a monochromatic vector with . Many of the classical theorems of Ramsey Theory may naturally be interpreted as assertions that particular matrices are partition regular. In the finite case, Rado proved that a matrix is partition regular if and only it satisfies a computable condition known as the columns property. The first requirement of the columns property is that some set of columns sums to zero.Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Partition regularity in the rationalsJournal of Combinatorial Theory, Series A, 2013
- Banach algebras on semigroups and on their compactificationsMemoirs of the American Mathematical Society, 2010
- Density and invariant means in left amenable semigroupsTopology and its Applications, 2009
- Sets satisfying the Central Sets TheoremSemigroup Forum, 2009
- Density in Arbitrary SemigroupsSemigroup Forum, 2006
- Open Problems in Partition RegularityCombinatorics, Probability and Computing, 2003
- Infinite partition regular matrices: solutions in central setsTransactions of the American Mathematical Society, 2002
- Algebra in the Stone-Čech Compactification1998
- Recurrence in Ergodic Theory and Combinatorial Number Theory1981
- Semigroups Satisfying a Strong Folner ConditionProceedings of the American Mathematical Society, 1967