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.
The Growth of Grigorchuk's Group
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
In 1980 Rostislav Grigorchuk constructed a group $G$ of intermediate growth, and later obtained the following estimates on its growth function: $$e^{\sqrt{n}}\precsim\gamma(n)\precsim e^{n^\beta},$$ where $\beta=\log_{32}(31)\approx0.991$. Using elementary methods we bring the upper bound down to $\log(2)/\log(2/\eta)\approx0.767$, where $\eta\approx0.811$ is the real root of the polynomial $X^3+X^2+X-2$.
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.