2000 character limit reached
On uniformly recurrent subgroups of finitely generated groups
Published 6 Feb 2017 in math.DS and math.GR | (1702.01631v1)
Abstract: We prove that if $G$ is a finitely generated group and $Z$ is a uniformly recurrent subgroup of $G$ then there exists a minimal system $(X,G)$ with $Z$ as its stability system. This answers a query of Glasner and Weiss \cite{GW} in the case of finitely generated groups. Using the same method (introduced by Alon, Grytczuk, Haluszczak and Riordan \cite{AGHR}) we will prove that finitely generated sofic groups have free Bernoulli-subshifts admitting an invariant probability measure.
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.