Strong topological Rokhlin property, shadowing, and symbolic dynamics of countable groups
Michal Doucha

TL;DR
This paper explores the strong topological Rokhlin property (STRP) in countable groups, linking it to symbolic dynamics, shadowing, and group decompositions, and provides criteria and examples for when groups possess this property.
Contribution
It establishes that the STRP is a symbolic dynamical property, characterizes groups with STRP via density of certain subshifts, and connects STRP with shadowing, including applications to various classes of groups.
Findings
Groups decomposing as free products of finite or cyclic groups have the STRP.
Finitely generated nilpotent groups lack the STRP unless virtually cyclic.
Shadowing is generic for group actions if and only if the group has the STRP.
Abstract
A countable group has the strong topological Rokhlin property (STRP) if it admits a continuous action on the Cantor space with a comeager conjugacy class. We show that having the STRP is a symbolic dynamical property. We prove that a countable group has the STRP if and only if certain sofic subshifts over are dense in the space of subshifts. A sufficient condition is that isolated shifts over are dense in the space of all subshifts. We provide numerous applications including the proof that a group that decomposes as a free product of finite or cyclic groups has the STRP. We show that finitely generated nilpotent groups do not have the STRP unless they are virtually cyclic; the same is true for many groups of the form where each factor is recursively presented. We show that a large class of non-finitely generated groups do not have the STRP,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Dynamics and Fractals · Cellular Automata and Applications · Computability, Logic, AI Algorithms
