A simple characterization of sets satisfying the central sets theorem

MaRDI QIDQ1043775zbMATH OpenFDO

Authors Neil Hindman, D. Strauss

Publication date 9 December 2009

Published in The New York Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/226110, http://www.emis.de/journals/NYJM/j/2009/15-21.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

central sets theorem

Mathematics Subject Classification ID

Ramsey theory (05D10) Structure of topological semigroups (22A15) Topological dynamics (37B99)

Review text

The Central Sets Theorem for a discrete semigroup \(S\) originated from Furstenberg's famous work [\textit{H. Furstenberg}, Recurrence in ergodic theory and combinatorial number theory. M. B. Porter Lectures, Rice University, Department of Mathematics, 1978. Princeton, New Jersey: Princeton University Press. (1981; Zbl 0459.28023)]. In the paper under review the authors obtain a simple characterization of \(C\)-sets (i.e., those sets satisfy the conclusion of the Central Sets Theorem).

Recommendations

• Sets satisfying the central sets theorem
• A new and stronger central sets theorem
• A generalized central sets theorem and applications
• scientific article; zbMATH DE number 5610714
• A new and simpler noncommutative central sets theorem

Cited in

(13)

• Elementary characterization of essential \({\mathscr{F}} \)-sets and its combinatorial consequences
• \(D\)-sets in arbitrary semigroup
• Central sets and substitutive dynamical systems
• Sets satisfying the central sets theorem
• Dynamical characterization of C-sets and its application
• A central set of dimension $2$
• A combinatorial viewpoint on preserving notions of largeness and an abstract Rado theorem
• A history of central sets
• A study on some combinatorial sets in partial semigroups
• Cartesian product of combinatorially rich sets- algebraic, elementary and dynamical approaches
• Thick sets and the central set theorem
• Abundance of arithmetic progressions in CR-sets
• A concept of largeness of combinatorially rich sets

This page was built for publication: A simple characterization of sets satisfying the central sets theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1043775)