CONJUGATION IN TREE AUTOMORPHISM GROUPS

DOI10.1142/S021819670100070XzbMath1030.20015MaRDI QIDQ4786296

Piotr Włodzimierz Gawron, V. I. Sushchans'kyi, Volodymyr V. Nekrashevych

Publication date: 15 December 2002

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

zbMATH Keywords

conjugacy classes; automorphism groups; rooted trees; locally finite trees

Mathematics Subject Classification ID

05C05: Trees

20E45: Conjugacy classes for groups

05C25: Graphs and abstract algebra (groups, rings, fields, etc.)

20E08: Groups acting on trees

Related Items

A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group, Automaton (Semi)groups: Wang Tilings and Schreier Tries, AN UNCOUNTABLE FAMILY OF 3-GENERATED GROUPS WITH ISOMORPHIC PROFINITE COMPLETIONS, Isometry types of profinite groups., Lie algebra associated with the group of finitary automorphisms of \(p\)-adic tree., Automata generating free products of groups of order 2., Lifts, derandomization, and diameters of Schreier graphs of Mealy automata, Orbit automata as a new tool to attack the order problem in automaton groups, On bireversible Mealy automata and the Burnside problem, Isometry groups of non standard metric products, Ergodic decomposition of group actions on rooted trees, A minimal Cantor set in the space of 3-generated groups., On Torsion-Free Semigroups Generated by Invertible Reversible Mealy Automata, Generating sets consisting of pairwise conjugate elements, INVERSE SEMIGROUPS OF PARTIAL AUTOMATON PERMUTATIONS, Dimension and randomness in groups acting on rooted trees, A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group

Cites Work

• On the automorphism group of the one-rooted binary tree
• THE AUTOMORPHISM GROUPS OF REGULAR TREES
• The Automorphism Groups of Regular Trees