English

Gowers' Ramsey theorem for generalized tetris operations

Combinatorics 2017-08-09 v1

Abstract

We prove a generalization of Gowers' theorem for FINk\mathrm{FIN}_{k} where, instead of the single tetris operation T:FINkFINk1T:\mathrm{FIN}_{k}\rightarrow \mathrm{FIN}_{k-1}, one considers all maps from FINk\mathrm{FIN}_{k} to FINj\mathrm{FIN}_{j} for 0jk0\leq j\leq k arising from nondecreasing surjections f:{0,1,,k+1}{0,1,,j+1}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.

Keywords

Cite

@article{arxiv.1603.09365,
  title  = {Gowers' Ramsey theorem for generalized tetris operations},
  author = {Martino Lupini},
  journal= {arXiv preprint arXiv:1603.09365},
  year   = {2017}
}

Comments

8 pages

R2 v1 2026-06-22T13:21:51.407Z