A new and stronger central sets theorem

DOI10.4064/fm199-2-5zbMath1148.05052OpenAlexW1983381241MaRDI QIDQ5458421

Neil Hindman, Dibyendu De, Dona E. Strauss

Publication date: 11 April 2008

Published in: Fundamenta Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4064/fm199-2-5

zbMATH Keywords

central sets theoremStone-Cech compactification of semigroups

Mathematics Subject Classification ID

Structure of topological semigroups (22A15) Ramsey theory (05D10)

Related Items (30)

Multi-recurrence and van der Waerden systems ⋮ Sets satisfying the central sets theorem ⋮ IP*-sets in function field and mixing properties ⋮ Combined algebraic properties of \(C^\ast\)-sets near zero ⋮ A generalized central sets theorem and applications ⋮ Polynomial extension of the stronger central sets theorem ⋮ Central sets theorem in arbitrary semigroup ⋮ Dynamical notions along filters ⋮ Central sets and substitutive dynamical systems ⋮ Dynamics near an idempotent ⋮ Central sets theorem near zero ⋮ Unnamed Item ⋮ New polynomial and multidimensional extensions of classical partition results ⋮ Central sets theorem near zero ⋮ Unnamed Item ⋮ A history of central sets ⋮ Infinite image partition regular matrices -- solution in C-sets ⋮ Notions of size in a semigroup: an update from a historical perspective ⋮ A generalized central sets theorem in partial semigroups ⋮ The research of seven students at Howard University ⋮ Cartesian product of some combinatorially rich sets ⋮ Unnamed Item ⋮ Image partition regularity near zero ⋮ The research of thirteen students at Howard university ⋮ Solvability of Rado systems in \(D\)-sets ⋮ Strongly central sets and sets of polynomial returns mod 1 ⋮ Unnamed Item ⋮ Central sets theorem along filters and some combinatorial consequences ⋮ A new and simpler noncommutative central sets theorem ⋮ Central sets generated by uniformly recurrent words

This page was built for publication: A new and stronger central sets theorem