Gowers' Ramsey theorem for generalized tetris operations
classification
🧮 math.CO
keywords
mathrmtheoremgeneralizationgowersldotsleftproveright
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.