arXiv:1603.09365 [math.CO]AbstractReferencesReviewsResources
Gowers' Ramsey theorem for generalized tetris operations
Published 2016-03-30Version 1
We prove a generalization of Gowers' theorem for $\mathrm{FIN}_{k}$ where, instead of the single tetris operation $T:\mathrm{FIN}_{k}\rightarrow \mathrm{FIN}_{k-1}$, one considers all maps from $\mathrm{FIN}_{k}$ to $\mathrm{FIN}_{j}$ for $0\leq j\leq k$ arising from nondecreasing surjections $f:\left\{ 0,1,\ldots ,k+1\right\} \rightarrow \left\{ 0,1,\ldots ,j+1\right\} $. This answers a question of Barto\v{s}ov\'{a} and Kwiatkowska. We also prove a common generalization of such a result and the Galvin--Glazer--Hindman theorem on finite products, in the setting of layered partial semigroups introduced by Farah, Hindman, and McLeod.
Comments: 8 pages
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:1409.5846 [math.CO] (Published 2014-09-20)
A Ramsey theorem for partial orders with linear extensions
arXiv:1705.02989 [math.CO] (Published 2017-05-08)
Ramsey theorem for designs
arXiv:math/9801096 [math.CO] (Published 1998-01-21)
Stable matching in a common generalization of the marriage and assignment models