For bounded automatic actions of inverse semigroups the orbit relation is ω-regular, making first-order statements about orbits and actions decidable, including computability of Fatou component encodings for post-critically finite polynomials.
Palindromic subshifts and simple periodic groups of intermediate growth
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We describe a new class of groups of Burnside type, giving a procedure transforming an arbitrary non-free minimal action of the dihedral group on a Cantor set into an orbit-equivalent action of an infinite finitely generated periodic group. We show that if the associated Schreier graphs are linearly repetitive, then the group is of intermediate growth. In particular, this gives first examples of simple groups of intermediate growth.
fields
math.GR 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Automatic actions I. Bounded automata and orbits
For bounded automatic actions of inverse semigroups the orbit relation is ω-regular, making first-order statements about orbits and actions decidable, including computability of Fatou component encodings for post-critically finite polynomials.