2000 character limit reached
Amenability, proximality and higher order syndeticity
Published 14 Dec 2020 in math.GR, math.DS, math.FA, and math.OA | (2012.07276v2)
Abstract: We show that the universal minimimal proximal flow and the universal minimal strongly proximal flow of a discrete group can be realized as the Stone spaces of translation invariant Boolean algebras of subsets of the group satisfying a higher order notion of syndeticity. We establish algebraic, combinatorial and topological dynamical characterizations of these subsets that we use to obtain new necessary and sufficient conditions for strong amenability and amenability. We also characterize dense orbit sets, answering a question of Glasner, Tsankov, Weiss and Zucker.
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.