On a free group of transformations defined by an automaton
Mariya Vorobets, Yaroslav Vorobets
math.GRarXiv:math/0601231
Abstract
We prove that three automorphisms of the rooted binary tree defined by a certain 3-state automaton generate a free non-Abelian group of rank 3.
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