pith. sign in

arxiv: math/0607778 · v2 · submitted 2006-07-30 · 🧮 math.GR

Construction of elements in the closure of Grigorchuk group

classification 🧮 math.GR
keywords grigorchukgroupconstraintsbinaryclosureelementsportraitssatisfied
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.