Construction of elements in the closure of Grigorchuk group
Goulnara Arzhantseva, Zoran Sunic
Abstract
We describe constraints that need to be satisfied ``near the top'' of the portraits of the elements in Grigorchuk group. These constraints, if satisfied by the portraits of all sections of some binary tree automorphism, guarantee that this automotphism belongs to the closure of Grigorchuk group in the pro-finite group of binary tree automorphisms. The constraints may be viewed as an effective version of a more conceptual description given earlier by Grigorchuk.
Create a lesson
Related papers
Kleisli convolution representations of power monoids
Haicun Wen, Jian He, Yu-Zhe Liu
The Hurwitz Action in the Affine Symmetric Group
Patrick Wegener
Classification of Group Extensions
Claude Archer
A Determination of B-groups of Order p4
Christopher Herbig
A note on normal generation and the first 2-betti number
Sam P. Fisher, Yash Lodha
Asymptotic enumeration of minimally transitive permutation groups
Binzhou Xia, Shasha Zheng