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$.
The aim of this article is to discuss and clarify the notion of fractality for subgroups of the group of automorphisms of a regular rooted tree. For this purpose we define three types of fractality. We show that they are not equivalent, by giving explicit examples. Furthermore we present some tools that are helpful in order to determine the fractality of a given group.
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.
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 prove a general result about the decomposition on ergodic components of group actions on boundaries of spherically homogeneous rooted trees. Namely, we identify the space of ergodic components with the boundary of the orbit tree associated with the action, and show that the canonical system of ergodic invariant probability measures coincides with the system of uniform measures on the boundaries of minimal invariant subtrees of the tree. A special attention is given to the case of groups generated by finite automata. Few examples, including the lamplighter group, Sushchansky group, and the, …
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 study properties of eigenvalues of a matrix associated with a randomly chosen partial automorphism of a regular rooted tree. We show that asymptotically, as the numbers of levels goes to infinity, the fraction of non-zero eigenvalues converges to zero in probability.
We introduce a class of automorphisms of rooted $d$-regular trees arising from affine actions on their boundaries viewed as infinite dimensional vector spaces. This class includes, in particular, many examples of self-similar realizations of lamplighter groups. We show that for a regular binary tree this class coincides with the normalizer of the group of all spherically homogeneous automorphisms of this tree: automorphisms whose states coincide at all vertices of each level. We study in detail a nontrivial example of an automaton group that contains an index two subgroup with elements from th…
We study the group $QV$, the self-maps of the infinite $2$-edge coloured binary tree which preserve the edge and colour relations at cofinitely many locations. We introduce related groups $QF$, $QT$, $\tilde{Q}T$, and $\tilde{Q}V$, prove that $QF$, $\tilde{Q}T$, and $\tilde{Q}V$ are of type $\mathrm{F}_\infty$, and calculate finite presentations for them. We calculate the normal subgroup structure and rational homology of all $5$ groups, the Bieri--Neumann--Strebel--Renz invariants of $QF$, and discuss the relationship of all $5$ groups with other generalisations of Thompson's groups.
We show that every countable non-abelian free group $Γ$ admits a spherically transitive action on a rooted tree $T$ such that the action of $Γ$ on the boundary of $T$ is not essentially free. This reproves a result of Bergeron and Gaboriau. The existence of such an action answers a question of Grigorchuk, Nekrashevich and Sushchanskii.
Let $(W,S)$ be a Coxeter system, let $G$ be a group of symmetries of $(W,S)$ and let $f : W \to \GL (V)$ be the linear representation associated with a root basis $(V, \langle .,. \rangle, Π)$.We assume that $G \subset \GL (V)$, and that $G$ leaves invariant $Π$ and $\langle .,. \rangle$. We show that $W^G$ is a Coxeter group, we construct a subset $\tilde Π\subset V^G$ so that $(V^G, \langle .,. \rangle, \tilde Π)$ is a root basis of $W^G$, and we show that the induced representation $f^G : W^G \to \GL(V^G)$ is the linear representation associated with $(V^G, \langle .,. \rangle, \tilde Π)$.I…
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 di…
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…
A multi-edge spinal group is a subgroup of the automorphism group of a regular p-adic rooted tree, generated by one rooted automorphism and a finite number of directed automorphisms sharing a common directing path. We prove that torsion multi-edge spinal groups do not have maximal subgroups of infinite index. This generalizes a result of Pervova for GGS-groups.
We study the portraits of isometries of rooted trees - the labelling of the tree, at each vertex, by the permutation of its descendants - in terms of languages. We characterize regularly branched self-similar groups in terms of $ω$-regular languages. We deduce the algorithmic decidability of some problems, such as the comparison of regularly branched contracting groups, and their orbit structure on the boundary of the rooted tree.
We study the conjugacy problem in the automorphism group $Aut(T)$ of a regular rooted tree $T$ and in its subgroup $FAut(T)$ of finite-state automorphisms. We show that under the contracting condition and the finiteness of what we call the orbit-signalizer, two finite-state automorphisms are conjugate in $Aut(T)$ if and only if they are conjugate in $FAut(T)$, and that this problem is decidable. We prove that both these conditions are satisfied by bounded automorphisms and establish that the (simultaneous) conjugacy problem in the group of bounded automata is decidable.
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.
The aim of this chapter is to provide an adequate graph theoretic framework for the description of periodic bifurcations which have recently been discovered in descendant trees of finite p-groups. The graph theoretic concepts of rooted in-trees with weighted vertices and edges perfectly admit an abstract formulation of the group theoretic notions of successive extensions, nuclear rank, multifurcation, and step size. Since all graphs in this chapter are infinite and dense, we use methods of pattern recognition and independent component analysis to reduce the complex structure to periodically re…
The paper is devoted to a study of certain fixed point properties, and their relatives, in the context of full automorphism groups of countable rooted trees. Namely, we study Serre's property (FA'), also called unsplittability, property (FA), the uncountable strong cofinality, and ample generics. We give a new proof of a theorem of Psaltis to the extent that automorphism groups of rooted trees are unsplittable, and show under what circumstances automorphism groups of rooted trees have uncountable strong cofinality (and thus property (FA).) Also, we prove a necessary and sufficient condition fo…
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…
A constant spinal group is a subgroup of the automorphism group of a regular rooted tree, generated by a group of rooted automorphisms $A$ and a group of directed automorphisms $B$ whose action on a subtree is equal to the global action. We provide two conditions in terms of certain dynamical systems determined by $A$ and $B$ for constant spinal groups to be periodic, generalising previous results on Grigorchuk--Gupta--Sidki groups and other related constructions. This allows us to provide various new examples of finitely generated infinite periodic groups.
We characterize those countable rooted trees whose full automorphism group has uncountable strong cofinality or contains an open subgroup with ample generics.
To every automorphism w of an infinite rooted regular binary tree we associate a two variable generating function Φ_w that encodes information on the orbit structure of w. We prove that this is a rational function if w can be described by finitely many recursion relations of a particular form. We show that this condition is satisfied for all elements of the discrete iterated monodromy group Γassociated to a postcritically finite quadratic polynomial over C. For such Γwe also prove that there are only finitely many possibilities for the denominator of Φ_w, and we describe a procedure to determi…
We prove that if G_P is a finitely constrained group of binary rooted tree automorphisms (a group binary tree subshift of finite type) defined by an essential pattern group P of pattern size d, d>1, and if G_P has maximal Hausdorff dimension (equal to 1-1/2^{d-1}), then G_P is not topologically finitely generated. We describe precisely all essential pattern groups P that yield finitely constrained groups with maximal Haudorff dimension. For a given size d, d>1, there are exactly 2^{d-1} such pattern groups and they are all maximal in the group of automorphisms of the finite rooted regular tree…
A multi-GGS-group is a group of automorphisms of a regular rooted tree, generalising the Gupta--Sidki $p$-groups. We compute the automorphism groups of all non-constant multi-GGS-groups.
We introduce some natural families of distributions on rooted binary ranked plane trees with a view toward unifying ideas from various fields, including macroevolution, epidemiology, computational group theory, search algorithms and other fields. In the process we introduce the notions of split-exchangeability and plane-invariance of a general Markov splitting model in order to readily obtain probabilities over various equivalence classes of trees that arise in statistics, phylogenetics, epidemiology and group theory.
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.
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 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…
We find some sufficient conditions under which the permutational wreath product of two groups has a minimal generating set. In particular we prove that for a regular rooted tree the group of all automorphisms and the group of all finite-state automorphisms of such a tree satisfy these conditions.
We study spectra of noncommutative dynamical systems, representations of fractal groups, and regular graphs. We explicitly compute these spectra for five examples of groups acting on rooted trees, and in three cases obtain totally disconnected sets.
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…
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 show that the group of bounded automatic automorphisms of a rooted tree is amenable, which implies amenability of numerous classes of groups generated by finite automata. The proof is based on reducing the problem to showing amenability just of a certain explicit family of groups ("Mother groups") which is done by analyzing the asymptotic properties of random walks on these groups.
Given a torsion-free $p$-adic analytic pro-$p$ group $G$ with $\mathrm{dim}(G) < p$, we show that the self-similar actions of $G$ on regular rooted trees can be studied through the virtual endomorphisms of the associated $\mathbb{Z}_p$-Lie lattice. We explicitly classify 3-dimensional unsolvable $\mathbb{Z}_p$-Lie lattices for $p$ odd, and study their virtual endomorphisms. Together with Lazard's correspondence, this allows us to classify 3-dimensional unsolvable torsion-free $p$-adic analytic pro-$p$ groups for $p\geqslant 5$, and to determine which of them admit a faithful self-similar actio…
We study Schreier dynamical systems associated with a vast family of groups that hosts many known examples of groups of intermediate growth. We are interested in the orbital graphs for the actions of these groups on $d-$regular rooted trees and on their boundaries, viewed as topological spaces or as spaces with measure. They form interesting families of finitely ramified graphs, and we study their combinatorics, their isomorphism classes and their geometric properties, such as growth and the number of ends.
We propose to study some properties of the $C^*$-algebra naturally built out of the fundamental action that an automaton group $G$ admits on a regular rooted trees $\tree$.
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.
The definition of graph automatic groups by Kharlampovich, Khoussainov and Miasnikov and its extension to C-graph automatic by Murray Elder and the first author raise the question of whether Thompson's group F is graph automatic. We define a language of normal forms based on the combinatorial "caret types" which arise when elements of F are considered as pairs of finite rooted binary trees, which we show to be accepted by a finite state machine with 2 counters, and forms the basis of a 3-counter graph automatic structure for the group.
Let T be a rooted tree and Iso(T) be the group of isometries of T. Using model-theoretic tools we study closed subgroups G of Iso(T) with respect to the number of conjugacy classes of Iso(T) having representatives in G.
We study branch structures in Grigorchuk-Gupta-Sidki groups (GGS-groups) over primary trees, that is, regular rooted trees of degree $p^n$ for a prime $p$. Apart from a small set of exceptions for $p=2$, we prove that all these groups are weakly regular branch over $G''$. Furthermore, in most cases they are actually regular branch over $γ_3(G)$. This is a significant extension of previously known results regarding periodic GGS-groups over primary trees and general GGS-groups in the case $n=1$. We also show that, as in the case $n=1$, a GGS-group generated by a constant vector is not branch.
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.
The paper is concerned with the space of the marked Schreier graphs of the Grigorchuk group and the action of the group on this space. In particular, we describe an invariant set of the Schreier graphs corresponding to the action on the boundary of the binary rooted tree and dynamics of the group action restricted to this invariant set.
In this paper, we introduce the concept of the independence graph of a directed 2-complex. We show that the class of diagram groups is closed under graph products over independence graphs of rooted 2-trees. This allows us to show that a diagram group containing all countable diagram groups is a semi-direct product of a partially commutative group and R. Thompson's group $F$. As a result, we prove that all diagram groups are totally orderable.
Finite dimensional representations of the Hanoi Towers group are used to calculate the spectra of the finite graphs associated to the Hanoi Towers Game on three pegs (the group serves as a renorm group for the game). These graphs are Schreier graphs of the action of the Hanoi Towers group on the levels of the rooted ternary tree. The spectrum of the limiting graph (Schreier graph of the action on the boundary of the tree) is also provided.
