We explore the structure of the p-adic automorphism group Gamma of the infinite rooted regular tree. We determine the asymptotic order of a typical element, answering an old question of Turan.
We initiate the study of a general dimension theory of groups acting on rooted trees. We describe the relationship between dimension and other properties of groups such as solvability, existence of dense free subgroups and the normal subgroup structure. We show that subgroups of Gamma generated by three random elements are full-dimensional and that there exist finitely generated subgroups of arbitrary dimension. Specifically, our results solve an open problem of Shalev and answer a question of Sidki.
We show that on groups generated by bounded activity automata, every symmetric, finitely supported probability measure has the Liouville property. More generally we show this for every group of automorphisms of bounded type of a rooted tree. For automaton groups, we also give a uniform upper bound for the entropy of convolutions of every symmetric, finitely supported measure.
We show that if a group $G$ acting faithfully on a rooted tree $T$ has a free subgroup, then either there exists a point $w$ of the boundary $\partial T$ and a free subgroup of $G$ with trivial stabilizer of $w$, or there exists $w\in\partial T$ and a free subgroup of $G$ fixing $w$ and acting faithfully on arbitrarily small neighborhoods of $w$. This can be used to prove absence of free subgroups for different known classes of groups. For instance, we prove that iterated monodromy groups of expanding coverings have no free subgroups and give another proof of a theorem by S. Sidki.
We study the class of groups generated by automata that act essentially freely on the boundary of a rooted tree. In the process we establish and discuss some general tools for determining if a group belongs to this class, and explore the connections of this class to the classes of just-infinite and scale-invariant groups. Our main application is a complete classification of groups generated by 3-state automata over 2-letter alphabet that are in this class.
Centre for Mathematical Sciences, Lund University（隆德大学数学中心）；Department of Mathematics, University of the Basque Country UPV/EHU（巴斯克大学数学系）；School of Mathematical Sciences, University of Southampton（南安普顿大学数学科学学院）
本文研究群作用于根树上的虚拟 retract，证明有限生成分支群不具有 LR 性质，并揭示 LR 性质在后临界有限二次复多项式中与欧几里得 orbifold 的关系，同时提供新的 pro-2 群例子。
We investigate invariant random subgroups in groups acting on rooted trees. Let $\mathrm{Alt}_f(T)$ be the group of finitary even automorphisms of the $d$-ary rooted tree $T$. We prove that a nontrivial ergodic IRS of $\mathrm{Alt}_f(T)$ that acts without fixed points on the boundary of $T$ contains a level stabilizer, in particular it is the random conjugate of a finite index subgroup. Applying the technique to branch groups we prove that an ergodic IRS in a finitary regular branch group contains the derived subgroup of a generalized rigid level stabilizer. We also prove that every weakly bra…
The group of isometries W of a regular rooted tree, and many of its subgroups with branching structure, have groups of automorphisms induced by conjugation in W. This fact has stimulated the computation of the group of automorphisms of such well-known examples as the group G studied by R. Grigorchuk, and the group H studied by N. Gupta and the second author. In this paper, we pursue the larger theme of towers of automorphisms of groups of tree isometries such as G and H. We describe this tower for all groups acting on the binary rooted tree which decompose as infinitely iterated wreath product…
We consider groups that act on spherically symmetric rooted trees and study the associated representation of the group on the space of locally constant functions on the boundary of the tree. We introduce and discuss the new notion of locally 2-transitive actions. Assuming local 2-transitivity our main theorem yields a precise decomposition of the boundary representation into irreducible constituents. The method can be used to study Gelfand pairs and enables us to answer a question of Grigorchuk. To provide examples, we analyse in detail the local 2-transitivity of GGS-groups. Moreover, our res…
Based on the work of Abercrombie, Barnea and Shalev gave an explicit formula for the Hausdorff dimension of a group acting on a rooted tree. We focus here on the binary tree T. Abert and Virag showed that there exist finitely generated (but not necessarily level-transitive) subgroups of AutT of arbitrary dimension in [0,1]. In this article we explicitly compute the Hausdorff dimension of the level-transitive spinal groups. We then show examples of 3-generated spinal groups which have transcendental Hausdroff dimension, and exhibit a construction of 2-generated groups whose Hausdorff dimension …
We provide a self-similar measure for the self-similar group $G$ acting faithfully on the binary rooted tree, defined as the iterated monodromy group of the quadratic polynomial $z^2+i$. We also provide an $L$-presentation for $G$ and calculations related to the spectrum of the Markov operator on the Schreier graph of the action of $G$ on the orbit of a point on the boundary of the binary rooted tree.
We show that every polynomial in $\mathbb Z[x]$ defines an endomorphism of the $d$-ary rooted tree induced by its action on the ring $\mathbb Z_d$ of $d$-adic integers. The sections of this endomorphism also turn out to be induced by polynomials in $\mathbb Z[x]$ of the same degree. In the case of permutational polynomials acting on $\mathbb Z_d$ by bijections the induced endomorphisms are automorphisms of the tree. In the case of $\mathbb Z_2$ such polynomials were completely characterized by Rivest. As our main application we utilize the result of Rivest to derive the condition on the coeffi…
This is a long introduction to the theory of "branch groups": groups acting on rooted trees which exhibit some self-similarity features in their lattice of subgroups.
We show that amenability of a group acting by homeomorphisms can be deduced from a certain local property of the action and recurrency of the orbital Schreier graphs. This covers amenability of a wide class groups, the amenability of which was an open problem, as well as unifies many known examples to one general proof. In particular, this includes Grigorchuk's group, Basilica group, the full topological group of Cantor minimal system, groups acting on rooted trees by bounded automorphisms, groups generated by finite automata of linear activity growth, groups that naturally appear in holomorph…
This note describes the first example of a group that is amenable, but cannot be obtained by subgroups, quotients, extensions and direct limits from the class of groups locally of subexponential growth. It has a balanced presentation \[Δ= < b,t|[b,t^2]b^{-1},[[[b,t^{-1}],b],b]>.\] I show that it acts transitively on a 3-regular tree, and that $Γ=< b,b^{t^{-1}}$ stabilizes a vertex and acts by restriction on a binary rooted tree. $Γ$ is a "fractal group", generated by a 3-state automaton, and is a discrete analogue of the monodromy action of iterates of f(z)=z^2-1 on associated coverings of the…
With any self-similar action of a finitely generated group $G$ of automorphisms of a regular rooted tree $T$ can be naturally associated an infinite sequence of finite graphs $\{Γ_n\}_{n\geq 1}$, where $Γ_n$ is the Schreier graph of the action of $G$ on the $n$-th level of $T$. Moreover, the action of $G$ on $\partial T$ gives rise to orbital Schreier graphs $Γ_ξ$, $ξ\in \partial T$. Denoting by $ξ_n$ the prefix of length $n$ of the infinite ray $ξ$, the rooted graph $(Γ_ξ,ξ)$ is then the limit of the sequence of finite rooted graphs $\{(Γ_n,ξ_n)\}_{n\geq 1}$ in the sense of pointed Gromov-Hau…
We construct a group acting on a binary rooted tree; this discrete group mimics the monodromy action of iterates of $f(z)=z^2-1$ on associated coverings of the Riemann sphere. We then derive some algebraic properties of the group, and describe for that specific example the connection between group theory, geometry and dynamics. The most striking is probably that the quotient Cayley graphs of the group (aka ``Schreier graphs'') converge to the Julia set of $f$.
I describe a class of groups acting on rooted trees. The original claim was that all have intermediate word growth between polynomial and exponential. The argument constructs a functional equation on the growth formal power series, and derives the growth properties from its analytical behaviour. Unfortunately, there are substantial mistakes in the proofs, so the main claims should be considered unsettled. In particular, it is still an open problem whether the growth of the Gupta-Sidki group is intermediate or exponential.
We study in detail the profinite group G arising as geometric étale iterated monodromy group of an arbitrary quadratic morphism f with an infinite postcritical orbit over a field of characteristic different from two. This is a self-similar closed subgroup of the group of automorphisms of a regular rooted binary tree. In many cases it is equal to the automorphism group of the tree, but there remain some interesting cases where it is not. In these cases we prove that the conjugacy class of G depends only on the combinatorial type of the postcritical orbit of f. We also determine the Hausdorff di…
Inspired by the Basilica group $\mathcal B$, we describe a general construction which allows us to associate to any group of automorphisms $G \leq \operatorname{Aut}(T)$ of a rooted tree $T$ a family of Basilica groups $\operatorname{Bas}_s(G), s \in \mathbb{N}_+$. For the dyadic odometer $\mathcal{O}_2$, one has $\mathcal B = \operatorname{Bas}_2(\mathcal{O}_2)$. We study which properties of groups acting on rooted trees are preserved under this operation. Introducing some techniques for handling $\operatorname{Bas}_s(G)$, in case $G$ fulfills some branching conditions, we are able to calcula…
I compute the structure of the restricted 2-algebra associated to a group first described by Andrew Brunner, Said Sidki and Ana Cristina Vieira, acting on the binary rooted tree. I show that its width is unbounded, growing logarithmically, and obeys a simple rule. As a consequence, the dimension of the successive quotients of powers of the augmentation ideal in the modular group algebra is p(0)+...+p(n), the count of partitions of numbers up to n.
Let $G$ be a finitely generated regular branch group acting by automorphisms on a regular rooted tree $T$. It is well-known that stabilizers of infinite rays in $T$ (aka parabolic subgroups) are weakly maximal subgroups in $G$, that is, maximal among subgroups of infinite index. We show that, given a finite subgroup $Q\leq G$, $G$ possesses uncountably many automorphism equivalence classes of weakly maximal subgroups containing $Q$. In particular, for Grigorchuk-Gupta-Sidki type groups this implies that they have uncountably many automorphism equivalence classes of weakly maximal subgroups tha…
We state and study the congruence subgroup problem for groups acting on rooted tree, and for branch groups in particular. The problem is reduced to the computation of the congruence kernel, which we split into two parts: the branch kernel and the rigid kernel. In the case of regular branch groups, we prove that the first one is Abelian while the second has finite exponent. We also establish some rigidity results concerning these kernels. We work out explicitly known and new examples of non-trivial congruence kernels, describing in each case the group action. The Hanoi tower group receives part…
This is Chapter 24 in the "AutoMathA" handbook. Finite automata have been used effectively in recent years to define infinite groups. The two main lines of research have as their most representative objects the class of automatic groups (including word-hyperbolic groups as a particular case) and automata groups (singled out among the more general self-similar groups). The first approach implements in the language of automata some tight constraints on the geometry of the group's Cayley graph, building strange, beautiful bridges between far-off domains. Automata are used to define a normal form …
