We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure coreplatform@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
The ring $\mathbb Z_{d}$ of d-adic integers has a natural interpretation as the boundary of a rooted d-ary tree $T_{d}$. Endomorphisms of this tree (that is, solenoidal maps) are in one-to-one correspondence with 1-Lipschitz mappings from $\mathbb Z_{d}$ to itself. In the case when $d=p$ is prime, Anashin [‘Automata finiteness criterion in terms of van der Put series of automata functions’,p-Adic Numbers Ultrametric Anal. Appl.4(2) (2012), 151–160] showed that $f\in \mathrm {Lip}^{1}(\mathbb Z_{p})$ is defined by a finite Mealy automaton if and only if the reduced coefficients of its van der Put series constitute a p-automatic sequence over a finite subset of $\mathbb Z_{p}\cap \mathbb Q$. We generalize this result to arbitrary integers $d\geq 2$ and describe the explicit connection between the Moore automaton producing such a sequence and the Mealy automaton inducing the corresponding endomorphism of a rooted tree. We also produce two algorithms converting one automaton to the other and vice versa. As a demonstration, we apply our algorithms to the Thue–Morse sequence and to one of the generators of the lamplighter group acting on the binary rooted tree.
By
Rostislav Grigorchuk, Mathematics Department, Texas A&M University, College Station, TX 77843-3368, USA,
Daniel Lenz, Mathematisches Institut, Friedrich Schiller Universität Jena, 07743 Jena, Germany,
Tatiana Nagnibeda, Section de Mathématiques, University of Geneva, 2-4, Rue du Lièvre, Case Postale 64, 1211 Genève 4, Suisse
By
Rostislav Grigorchuk, Department of Mathematics, Mailstop 3368, Texas A&M University, College Station, TX 77843–3368, USA,
Pierre de la Harpe, Section de Mathématiques, University of Geneva, 2-4, Rue du Lièvre, Case Postale 64, 1211 Genève 4, Suisse
The idea of self-similarity is one of the most basic and fruitful ideas in mathematics of all times and populations. In the last few decades it established itself as the central notion in areas such as fractal geometry, dynamical systems, and statistical physics. Recently, self-similarity started playing a role in algebra as well, first of all in group theory.
Regular rooted trees are well known self-similar objects (the subtree of the regular rooted tree hanging below any vertex looks exactly like the whole tree). The self-similarity of the tree induces the self-similarity of its group of automorphisms and this is the context in which we talk about self-similar groups. Of particular interest are the finitely generated examples, which can be constructed by using finite automata. Groups of this type are extremely interesting and usually difficult to study as there are no general means to handle all situations. The difficulty of study is more than fairly compensated by the beauty of these examples and the wealth of areas and problems where they can be applied.
Branching is another idea that plays a major role in many areas, first of all in Probability Theory, where the study of branching processes is one of the main directions.
The idea of branching entered Algebra via the so called branch groups that were introduced by the first author at the Groups St Andrews Conference in Bath 1997.
Branch groups are groups that have actions “of branch type” on spherically homogeneous rooted trees.