Grigorchuk group

Last updated August 23, 2023

In the mathematical area of group theory, the Grigorchuk group or the first Grigorchuk group is a finitely generated group constructed by Rostislav Grigorchuk that provided the first example of a finitely generated group of intermediate (that is, faster than polynomial but slower than exponential) growth. The group was originally constructed by Grigorchuk in a 1980 paper^[1] and he then proved in a 1984 paper^[2] that this group has intermediate growth, thus providing an answer to an important open problem posed by John Milnor in 1968. The Grigorchuk group remains a key object of study in geometric group theory, particularly in the study of the so-called branch groups and automata groups, and it has important connections with the theory of iterated monodromy groups.^[3]

History and significance

The growth of a finitely generated group measures the asymptotics, as $n\to \infty$ of the size of an n-ball in the Cayley graph of the group (that is, the number of elements of G that can be expressed as words of length at most n in the generating set of G). The study of growth rates of finitely generated groups goes back to the 1950s and is motivated in part by the notion of volume entropy (that is, the growth rate of the volume of balls) in the universal covering space of a compact Riemannian manifold in differential geometry. It is obvious that the growth rate of a finitely generated group is at most exponential and it was also understood early on that finitely generated nilpotent groups have polynomial growth. In 1968 John Milnor posed a question^[4] about the existence of a finitely generated group of intermediate growth, that is, faster than any polynomial function and slower than any exponential function. An important result in the subject is Gromov's theorem on groups of polynomial growth, obtained by Gromov in 1981, which shows that a finitely generated group has polynomial growth if and only if this group has a nilpotent subgroup of finite index. Prior to Grigorchuk's work, there were many results establishing growth dichotomy (that is, that the growth is always either polynomial or exponential) for various classes of finitely generated groups, such as linear groups, solvable groups,^[5]^[6] etc.

Grigorchuk's group G was constructed in a 1980 paper of Rostislav Grigorchuk,^[1] where he proved that this group is infinite, periodic and residually finite. In a subsequent 1984 paper^[2] Grigorchuk proved that this group has intermediate growth (this result was announced by Grigorchuk in 1983).^[7] More precisely, he proved that G has growth b(n) that is faster than $\exp({\sqrt {n}})$ but slower than $\exp(n^{s})$ where $s=\log _{32}31\approx 0.991$ . The upper bound was later improved by Laurent Bartholdi ^[8] to

s={\frac {\log 2}{\log 2-\log \eta }}\approx 0.7674,\qquad \eta ^{3}+\eta ^{2}+\eta =2.

A lower bound of $\exp(n^{0.504})$ was proved by Yurii Leonov.^[9] The precise asymptotics of the growth of G is still unknown. It is conjectured that the limit

\lim _{n\to \infty }\log _{n}\log b(n),

exists but even this remained a major open problem. This problem was resolved in 2020 by Erschler and Zheng.^[10] They show that the limit equals $s$ .

Grigorchuk's group was also the first example of a group that is amenable but not elementary amenable, thus answering a problem posed by Mahlon Marsh Day in 1957.^[11]

Originally, Grigorchuk's group G was constructed as a group of Lebesgue-measure-preserving transformations on the unit interval, but subsequently simpler descriptions of G were found and it is now usually presented as a group of automorphisms of the infinite regular binary rooted tree. The study of Grigorchuk's group informed in large part the development of the theory of branch groups, automata groups and self-similar groups in the 1990s–2000s and Grigorchuk's group remains a central object in this theory. Recently important connections between this theory and complex dynamics, particularly the notion of iterated monodromy groups, have been uncovered in the work of Volodymyr Nekrashevych,^[12] and others.

After Grigorchuk's 1984 paper, there were many subsequent extensions and generalizations.^[13]^[14]^[15]^[16]

Definition

Although initially the Grigorchuk group was defined as a group of Lebesgue measure-preserving transformations of the unit interval, at present this group is usually given by its realization as a group of automorphisms of the infinite regular binary rooted tree $T 2$ . The tree $T 2$ is the set $Σ *$ of all finite strings in the alphabet $Σ = {0,1}$ , including the empty string $\emptyset$ , which roots $T 2$ . For a vertex $x$ of $T 2$ the string $x 0$ is the left child of $x$ and the string $x 1$ is the right child of $x$ in $T 2$ . The group of all automorphisms $Aut(T 2)$ can thus be thought of as the group of all length-preserving permutations $σ$ of $Σ *$ that also respect the initial segment relation: whenever a string $x$ is an initial segment of a string $y$ then $σ(x)$ is an initial segment of $σ(y)$ .

The Grigorchuk group $G$ is the subgroup of $Aut(T 2)$ generated by four specific elements of $Aut(T 2)$ defined as follows (note that $\emptyset$ is fixed by any tree-automorphism):

G=\langle a,b,c,d\rangle \leq {\text{Aut}}(T_{2}){\text{,}}

where

a(0)=1{\text{,}}\qquad a(1)=0{\text{,}}\qquad \forall x\in \Sigma ^{*}\quad {\begin{cases}a(0x)=1x\\a(1x)=0x\end{cases}}

and

{\begin{aligned}&b(0)=c(0)=d(0)=0\\&b(1)=c(1)=d(1)=1{\text{,}}\end{aligned}}\qquad \forall x\in \Sigma ^{*}\quad {\begin{aligned}&{\begin{cases}b(0x)=0a(x)\\b(1x)=1c(x)\end{cases}}\\&{\begin{cases}c(0x)=0a(x)\\c(1x)=1d(x)\end{cases}}\\&{\begin{cases}d(0x)=0x\\d(1x)=1b(x){\text{.}}\end{cases}}\end{aligned}}

Only the element $a$ is defined explicitly; it swaps the child trees of $\emptyset$ . The elements $b$ , $c$ , and $d$ are defined through a mutual recursion.

To understand the effect of the latter operations, consider the rightmost branch $B$ of $T 2$ , which begins ${\emptyset, 1, 11, 111, ...}$ . As a branch, $B$ is order-isomorphic to $\mathbb {N} .$ The original tree $T 2$ can be obtained by rooting a tree isomorphic to $T 2$ at each element of $B$ ; conversely, one can decompose $T 2$ into isomorphic subtrees indexed by elements of $B\cong \mathbb {N}$ .

The operations $b$ , $c$ , and $d$ all respect this decomposition: they fix each element of $B$ and act as automorphisms on each indexed subtree. When $b$ acts, it fixes every subtree with index $\equiv 2 (mod 3)$ , but acts as $a$ on the rest. Likewise, when $c$ acts, it fixes only the subtrees of index $\equiv 1 (mod 3)$ ; and $d$ fixes those of index $\equiv 0 (mod 3)$ .

A compact notation for these operations is as follows: let the left (resp. right) branch of $T 2$ be $T L = 0 Σ *$ (resp. $T R = 1 Σ *$ ), so that

a(T_{L})\subseteq T_{R},\quad a(T_{R})\subseteq T_{L}{\text{.}}

We write $f = (g, h)$ to mean that $f$ acts as $g$ on $T L$ and as $h$ on $T R$ . Thus

{\begin{aligned}b=(a,c)\quad &\Longleftrightarrow \quad b(x)={\begin{cases}a(x)&x\in T_{L}\\c(x)&x\in T_{R}\end{cases}}\\c=(a,d)\quad &\Longleftrightarrow \quad c(x)={\begin{cases}a(x)&x\in T_{L}\\d(x)&x\in T_{R}\end{cases}}\\d=({\text{id}},b)\quad &\Longleftrightarrow \quad d(x)={\begin{cases}x&x\in T_{L}\\b(x)&x\in T_{R}{\text{.}}\end{cases}}\end{aligned}}

Similarly

aba=(c,a),\quad aca=(d,a),\quad ada=(b,{\text{id}}){\text{,}}

where $id$ is the identity function.

Properties

The following are basic algebraic properties of the Grigorchuk group (see^[17] for proofs):

The group G is infinite.^[2]
The group G is residually finite.^[2] Let $\rho _{n}:G\to {\text{Aut}}(T[n])$ be the restriction homomorphism that sends every element of G to its restriction to the first $n$ levels of $T 2$ . The groups Aut(T[n]) are finite and for every nontrivial g in G there exists n such that $\rho _{n}(g)\neq 1.$
The group G is generated by a and any two of the three elements b,c,d. For example, we can write $G=\langle a,b,c\rangle .$
The elements a, b, c, d are involutions.
The elements b, c, d pairwise commute and bc = cb = d, bd = db = c, dc = cd = b, so that $\langle b,c,d\rangle \leqslant G$ is an abelian group of order 4 isomorphic to the direct product of two cyclic groups of order 2.
Combining the previous two properties we see that every element of G can be written as a (positive) word in a, b, c, d such that this word does not contain any subwords of the form aa, bb, cc, dd, cd, dc, bc, cb, bd, db. Such words are called reduced.
The group G is a 2-group, that is, every element in G has finite order that is a power of 2.^[1]
The group G has intermediate growth.^[2]
The group G is amenable but not elementary amenable.^[2]
The group G is just infinite , that is G is infinite but every proper quotient group of G is finite.
The group G has the congruence subgroup property: a subgroup H has finite index in G if and only if there is a positive integer n such that $\ker(\rho _{n})\leqslant H.$
The group G has solvable subgroup membership problem, that is, there is an algorithm that, given arbitrary words w, u₁, ..., u_n decides whether or not w represents an element of the subgroup generated by u₁, ..., u_n.^[18]
The group G is subgroup separable, that is, every finitely generated subgroup is closed in the pro-finite topology on G.^[18]
Every maximal subgroup of G has finite index in G.^[19]
The group G is finitely generated but not finitely presentable.^[2]^[20]
The stabilizer of the level one vertices in $T_{2}$ in G (the subgroup of elements that act as identity on the strings 0 and 1), is generated by the following elements:

G_{\{0,1\}}=\langle b,c,d,aba,aca,ada\rangle .

G_{\{0,1\}}

is a normal subgroup of index 2 in G and

G=G_{\{0,1\}}\sqcup aG_{\{0,1\}}.

A reduced word represents an element of $G_{\{0,1\}}$ if and only if this word involves an even number of occurrences of a.
If w is a reduced word in G with a positive even number of occurrences of a, then there exist words u, v (not necessarily reduced) such that:

w=(u,v)\quad {\text{and}}\quad {\begin{cases}|u|,|v|\leqslant {\tfrac {1}{2}}|w|&|w|{\text{ odd}}\\|u|,|v|\leqslant {\tfrac {1}{2}}(|w|+1)&|w|{\text{ even}}\end{cases}}

This is sometimes called the contraction property. It plays a key role in many proofs regarding G since it allows to use inductive arguments on the length of a word.

The group G has solvable word problem and solvable conjugacy problem (consequence of the contraction property).

Related Research Articles

In mathematics, an abelian group, also called a commutative group, is a group in which the result of applying the group operation to two group elements does not depend on the order in which they are written. That is, the group operation is commutative. With addition as an operation, the integers and the real numbers form abelian groups, and the concept of an abelian group may be viewed as a generalization of these examples. Abelian groups are named after early 19th century mathematician Niels Henrik Abel.

In mathematics, more specifically in abstract algebra, the commutator subgroup or derived subgroup of a group is the subgroup generated by all the commutators of the group.

In mathematics, in the area of abstract algebra known as Galois theory, the Galois group of a certain type of field extension is a specific group associated with the field extension. The study of field extensions and their relationship to the polynomials that give rise to them via Galois groups is called Galois theory, so named in honor of Évariste Galois who first discovered them.

<span class="mw-page-title-main">Isomorphism</span> In mathematics, invertible homomorphism

In mathematics, an isomorphism is a structure-preserving mapping between two structures of the same type that can be reversed by an inverse mapping. Two mathematical structures are isomorphic if an isomorphism exists between them. The word isomorphism is derived from the Ancient Greek: ἴσοςisos "equal", and μορφήmorphe "form" or "shape".

In abstract algebra, the symmetric group defined over any set is the group whose elements are all the bijections from the set to itself, and whose group operation is the composition of functions. In particular, the finite symmetric group $defined over a finite set of symbols consists of the permutations that can be performed on the symbols. Since there are such permutation operations, the order of the symmetric group is .$

In group theory, the quaternion group Q₈ (sometimes just denoted by Q) is a non-abelian group of order eight, isomorphic to the eight-element subset $of the quaternions under multiplication. It is given by the group presentation$

In the mathematical subject of geometric group theory, the growth rate of a group with respect to a symmetric generating set describes how fast a group grows. Every element in the group can be written as a product of generators, and the growth rate counts the number of elements that can be written as a product of length n.

In geometric group theory, Gromov's theorem on groups of polynomial growth, first proved by Mikhail Gromov, characterizes finitely generated groups of polynomial growth, as those groups which have nilpotent subgroups of finite index.

In mathematics, in the subfield of geometric topology, the mapping class group is an important algebraic invariant of a topological space. Briefly, the mapping class group is a certain discrete group corresponding to symmetries of the space.

In mathematics, the fundamental theorem of Galois theory is a result that describes the structure of certain types of field extensions in relation to groups. It was proved by Évariste Galois in his development of Galois theory.

In mathematics, especially in the area of algebra known as group theory, the holomorph of a group is a group that simultaneously contains the group and its automorphism group. The holomorph provides interesting examples of groups, and allows one to treat group elements and group automorphisms in a uniform context. In group theory, for a group $, the holomorph of denoted can be described as a semidirect product or as a permutation group.$

In mathematics, specifically in group theory, the direct product is an operation that takes two groups $G$ and $H$ and constructs a new group, usually denoted $G \times H$ . This operation is the group-theoretic analogue of the Cartesian product of sets and is one of several important notions of direct product in mathematics.

In group theory, a branch of mathematics, the automorphisms and outer automorphisms of the symmetric groups and alternating groups are both standard examples of these automorphisms, and objects of study in their own right, particularly the exceptional outer automorphism of S₆, the symmetric group on 6 elements.

In linear algebra, particularly projective geometry, a semilinear map between vector spaces V and W over a field K is a function that is a linear map "up to a twist", hence semi-linear, where "twist" means "field automorphism of K". Explicitly, it is a function T : V → W that is:

<span class="mw-page-title-main">Borel–de Siebenthal theory</span>

In mathematics, Borel–de Siebenthal theory describes the closed connected subgroups of a compact Lie group that have maximal rank, i.e. contain a maximal torus. It is named after the Swiss mathematicians Armand Borel and Jean de Siebenthal who developed the theory in 1949. Each such subgroup is the identity component of the centralizer of its center. They can be described recursively in terms of the associated root system of the group. The subgroups for which the corresponding homogeneous space has an invariant complex structure correspond to parabolic subgroups in the complexification of the compact Lie group, a reductive algebraic group.

<span class="mw-page-title-main">Complexification (Lie group)</span> Universal construction of a complex Lie group from a real Lie group

In mathematics, the complexification or universal complexification of a real Lie group is given by a continuous homomorphism of the group into a complex Lie group with the universal property that every continuous homomorphism of the original group into another complex Lie group extends compatibly to a complex analytic homomorphism between the complex Lie groups. The complexification, which always exists, is unique up to unique isomorphism. Its Lie algebra is a quotient of the complexification of the Lie algebra of the original group. They are isomorphic if the original group has a quotient by a discrete normal subgroup which is linear.

In mathematics, symmetric cones, sometimes called domains of positivity, are open convex self-dual cones in Euclidean space which have a transitive group of symmetries, i.e. invertible operators that take the cone onto itself. By the Koecher–Vinberg theorem these correspond to the cone of squares in finite-dimensional real Euclidean Jordan algebras, originally studied and classified by Jordan, von Neumann & Wigner (1934). The tube domain associated with a symmetric cone is a noncompact Hermitian symmetric space of tube type. All the algebraic and geometric structures associated with the symmetric space can be expressed naturally in terms of the Jordan algebra. The other irreducible Hermitian symmetric spaces of noncompact type correspond to Siegel domains of the second kind. These can be described in terms of more complicated structures called Jordan triple systems, which generalize Jordan algebras without identity.

Non-commutative cryptography is the area of cryptology where the cryptographic primitives, methods and systems are based on algebraic structures like semigroups, groups and rings which are non-commutative. One of the earliest applications of a non-commutative algebraic structure for cryptographic purposes was the use of braid groups to develop cryptographic protocols. Later several other non-commutative structures like Thompson groups, polycyclic groups, Grigorchuk groups, and matrix groups have been identified as potential candidates for cryptographic applications. In contrast to non-commutative cryptography, the currently widely used public-key cryptosystems like RSA cryptosystem, Diffie–Hellman key exchange and elliptic curve cryptography are based on number theory and hence depend on commutative algebraic structures.

In the mathematical subject of group theory, the Howson property, also known as the finitely generated intersection property (FGIP), is the property of a group saying that the intersection of any two finitely generated subgroups of this group is again finitely generated. The property is named after Albert G. Howson who in a 1954 paper established that free groups have this property.

In mathematics, the automorphism group of an object X is the group consisting of automorphisms of X under composition of morphisms. For example, if X is a finite-dimensional vector space, then the automorphism group of X is the group of invertible linear transformations from X to itself. If instead X is a group, then its automorphism group $is the group consisting of all group automorphisms of X .$

References

1 2 3 R. I. Grigorchuk. On Burnside's problem on periodic groups. (Russian) Funktsionalyi Analiz i ego Prilozheniya, vol. 14 (1980), no. 1, pp. 53–54.
1 2 3 4 5 6 7 R. I. Grigorchuk, Degrees of growth of finitely generated groups and the theory of invariant means. Izvestiya Akademii Nauk SSSR. Seriya Matematicheskaya. vol. 48 (1984), no. 5, pp. 939–985.
↑ Volodymyr Nekrashevych. Self-similar groups. Mathematical Surveys and Monographs, 117. American Mathematical Society, Providence, RI, 2005. ISBN 0-8218-3831-8.
↑ John Milnor, Problem No. 5603, American Mathematical Monthly, vol. 75 (1968), pp. 685–686.
↑ John Milnor. Growth of finitely generated solvable groups. Archived 2011-05-23 at the Wayback Machine Journal of Differential Geometry. vol. 2 (1968), pp. 447–449.
↑ Joseph Rosenblatt. Invariant Measures and Growth Conditions, Transactions of the American Mathematical Society, vol. 193 (1974), pp. 33–53.
↑ Grigorchuk, R. I. (1983). К проблеме Милнора о групповом росте[On the Milnor problem of group growth]. Doklady Akademii Nauk SSSR (in Russian). 271 (1): 30–33.
↑ Laurent Bartholdi. Lower bounds on the growth of a group acting on the binary rooted tree. International Journal of Algebra and Computation, vol. 11 (2001), no. 1, pp. 73–88.
↑ Yu. G. Leonov, On a lower bound for the growth of a 3-generator 2-group. Matematicheskii Sbornik, vol. 192 (2001), no. 11, pp. 77–92; translation in: Sbornik Mathematics. vol. 192 (2001), no. 11–12, pp. 1661–1676.
↑ Anna Erschler, Tianyi Zheng. "Growth of periodic Grigorchuk groups." Inventiones Mathematicae, vol. 219 (2020), no.3, pp 1069–1155.
↑ Mahlon M. Day. Amenable semigroups. Illinois Journal of Mathematics, vol. 1 (1957), pp. 509–544.
↑ Volodymyr Nekrashevych, Self-similar groups. Mathematical Surveys and Monographs, 117. American Mathematical Society, Providence, RI, 2005. ISBN 0-8218-3831-8.
↑ Roman Muchnik, and Igor Pak. On growth of Grigorchuk groups. International Journal of Algebra and Computation, vol. 11 (2001), no. 1, pp. 1–17.
↑ Laurent Bartholdi. The growth of Grigorchuk's torsion group. International Mathematics Research Notices, 1998, no. 20, pp. 1049–1054.
↑ Anna Erschler. Critical constants for recurrence of random walks on G-spaces. Archived 2011-07-25 at the Wayback Machine Université de Grenoble. Annales de l'Institut Fourier, vol. 55 (2005), no. 2, pp. 493–509.
↑ Jeremie Brieussel, Growth of certain groups Archived 2011-10-02 at the Wayback Machine , Doctoral Dissertation, University of Paris, 2008.
↑ Pierre de la Harpe. Topics in geometric group theory. Chicago Lectures in Mathematics. University of Chicago Press, Chicago. ISBN 0-226-31719-6; Ch. VIII, The first Grigorchuk group, pp. 211–264.
1 2 R. I.Grigorchuk, and J. S. Wilson. A structural property concerning abstract commensurability of subgroups. Journal of the London Mathematical Society (2), vol. 68 (2003), no. 3, pp. 671–682.
↑ E. L. Pervova, Everywhere dense subgroups of a group of tree automorphisms. (in Russian). Trudy Matematicheskogo Instituta Imeni V. A. Steklova. vol. 231 (2000), Din. Sist., Avtom. i Beskon. Gruppy, pp. 356–367; translation in: Proceedings of the Steklov Institute of Mathematics, vol 231 (2000), no. 4, pp. 339–350.
↑ I. G. Lysënok, A set of defining relations for the Grigorchuk group. Matematicheskie Zametki, vol. 38 (1985), no. 4, pp. 503–516.

External links

Rostislav Grigorchuk and Igor Pak, Groups of Intermediate Growth: an Introduction for Beginners, preprint, 2006, arXiv

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.

[G0-1] 1 2 3 R. I. Grigorchuk. On Burnside's problem on periodic groups. (Russian) Funktsionalyi Analiz i ego Prilozheniya, vol. 14 (1980), no. 1, pp. 53–54.

[G-2] 1 2 3 4 5 6 7 R. I. Grigorchuk, Degrees of growth of finitely generated groups and the theory of invariant means. Izvestiya Akademii Nauk SSSR. Seriya Matematicheskaya. vol. 48 (1984), no. 5, pp. 939–985.

[N-3] Volodymyr Nekrashevych. Self-similar groups. Mathematical Surveys and Monographs, 117. American Mathematical Society, Providence, RI, 2005. ISBN 0-8218-3831-8.

[4] John Milnor, Problem No. 5603, American Mathematical Monthly, vol. 75 (1968), pp. 685–686.

[5] John Milnor. Growth of finitely generated solvable groups. Archived 2011-05-23 at the Wayback Machine Journal of Differential Geometry. vol. 2 (1968), pp. 447–449.

[6] Joseph Rosenblatt. Invariant Measures and Growth Conditions, Transactions of the American Mathematical Society, vol. 193 (1974), pp. 33–53.

[7] Grigorchuk, R. I. (1983). К проблеме Милнора о групповом росте[On the Milnor problem of group growth]. Doklady Akademii Nauk SSSR (in Russian). 271 (1): 30–33.

[8] Laurent Bartholdi. Lower bounds on the growth of a group acting on the binary rooted tree. International Journal of Algebra and Computation, vol. 11 (2001), no. 1, pp. 73–88.

[9] Yu. G. Leonov, On a lower bound for the growth of a 3-generator 2-group. Matematicheskii Sbornik, vol. 192 (2001), no. 11, pp. 77–92; translation in: Sbornik Mathematics. vol. 192 (2001), no. 11–12, pp. 1661–1676.

[10] Anna Erschler, Tianyi Zheng. "Growth of periodic Grigorchuk groups." Inventiones Mathematicae, vol. 219 (2020), no.3, pp 1069–1155.

[11] Mahlon M. Day. Amenable semigroups. Illinois Journal of Mathematics, vol. 1 (1957), pp. 509–544.

[12] Volodymyr Nekrashevych, Self-similar groups. Mathematical Surveys and Monographs, 117. American Mathematical Society, Providence, RI, 2005. ISBN 0-8218-3831-8.

[13] Roman Muchnik, and Igor Pak. On growth of Grigorchuk groups. International Journal of Algebra and Computation, vol. 11 (2001), no. 1, pp. 1–17.

[14] Laurent Bartholdi. The growth of Grigorchuk's torsion group. International Mathematics Research Notices, 1998, no. 20, pp. 1049–1054.

[15] Anna Erschler. Critical constants for recurrence of random walks on G-spaces. Archived 2011-07-25 at the Wayback Machine Université de Grenoble. Annales de l'Institut Fourier, vol. 55 (2005), no. 2, pp. 493–509.

[16] Jeremie Brieussel, Growth of certain groups Archived 2011-10-02 at the Wayback Machine , Doctoral Dissertation, University of Paris, 2008.

[DH-17] Pierre de la Harpe. Topics in geometric group theory. Chicago Lectures in Mathematics. University of Chicago Press, Chicago. ISBN 0-226-31719-6; Ch. VIII, The first Grigorchuk group, pp. 211–264.

[GW-18] 1 2 R. I.Grigorchuk, and J. S. Wilson. A structural property concerning abstract commensurability of subgroups. Journal of the London Mathematical Society (2), vol. 68 (2003), no. 3, pp. 671–682.

[19] E. L. Pervova, Everywhere dense subgroups of a group of tree automorphisms. (in Russian). Trudy Matematicheskogo Instituta Imeni V. A. Steklova. vol. 231 (2000), Din. Sist., Avtom. i Beskon. Gruppy, pp. 356–367; translation in: Proceedings of the Steklov Institute of Mathematics, vol 231 (2000), no. 4, pp. 339–350.

[20] I. G. Lysënok, A set of defining relations for the Grigorchuk group. Matematicheskie Zametki, vol. 38 (1985), no. 4, pp. 503–516.

[1]

[2]

[3]

[4]

[5]

[6]

[7]

[8]

[9]

[10]

[11]

[12]

[13]

[14]

[15]

[16]

[17]

[18]

[19]

[20]