A new and simpler noncommutative central sets theorem
Abstract: Using dynamics, Furstenberg defined the concept of a central subset of positive integers and proved several powerful combinatorial properties of central sets. Later using the algebraic structure of the Stone-\v{C}ech compactification, Bergelson and Hindman, with the assistance of B. Weiss, generalized the notion of a central set to any semigroup and extended the most important combinatorial property of central sets to the central sets theorem. Currently the most powerful formulation of the central sets theorem is due to De, Hindman, and Strauss in [3, Corollary 3.10]. However their formulation of the central sets theorem for noncommutative semigroups is, compared to their formulation for commutative semigroups, complicated. In this paper I prove a simpler (but still equally strong) version of the noncommutative central sets theorem in Corollary 3.3.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.