CONJUGATION IN TREE AUTOMORPHISM GROUPS

DOI10.1142/S021819670100070XzbMATH Open1030.20015OpenAlexW2023463206MaRDI QIDQ4786296FDOQ4786296

Authors: P. Gawron, Volodymyr Nekrashevych, V. Sushchansky 

Publication date: 15 December 2002

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

Full work available at URL: https://doi.org/10.1142/s021819670100070x

Recommendations

• Conjugacy classes of the automorphism group of a tree
• scientific article; zbMATH DE number 2169355
• On conjugacy in groups of finite-state automorphisms of rooted trees
• Conjugation on the group of local isometries of the boundary of a locally finite root tree.
• On the classification of automorphisms of trees

zbMATH Keywords

conjugacy classesautomorphism groupsrooted treeslocally finite trees

Mathematics Subject Classification ID

Trees (05C05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Groups acting on trees (20E08) Conjugacy classes for groups (20E45)

Cites Work

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

Cited In (35)

• Title not available (Why is that?)
• Generating sets consisting of pairwise conjugate elements
• Ergodic decomposition of group actions on rooted trees
• Title not available (Why is that?)
• A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group
• Automaton (Semi)groups: Wang Tilings and Schreier Tries
• A minimal Cantor set in the space of 3-generated groups.
• Automorphisms of the frame set groups and the branch groups
• Représentations sphériques des groupes agissant transitivement sur un arbre semi-homogène
• A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group
• Commensurability growth of branch groups
• Title not available (Why is that?)
• On conjugacy in groups of finite-state automorphisms of rooted trees
• Automata generating free products of groups of order 2.
• Orbit automata as a new tool to attack the order problem in automaton groups
• On the conjugacy problem for finite-state automorphisms of regular rooted trees. With an appendix by Raphaël M. Jungers
• Conjugation on the group of local isometries of the boundary of a locally finite root tree.
• Lie algebra associated with the group of finitary automorphisms of \(p\)-adic tree.
• Isometry groups of non standard metric products
• Title not available (Why is that?)
• Dimension and randomness in groups acting on rooted trees
• On Torsion-Free Semigroups Generated by Invertible Reversible Mealy Automata
• AN UNCOUNTABLE FAMILY OF 3-GENERATED GROUPS WITH ISOMORPHIC PROFINITE COMPLETIONS
• On the Basilica operation
• Title not available (Why is that?)
• On bireversible Mealy automata and the Burnside problem
• Title not available (Why is that?)
• Conjugacy and dynamics in almost automorphism groups of trees
• Isometry types of profinite groups.
• Automorphism groups of trees acting locally with affine permutations
• Inverse semigroups of partial automaton permutations.
• Title not available (Why is that?)
• The group of balanced automorphisms of a spherically homogeneous rooted tree.
• Lifts, derandomization, and diameters of Schreier graphs of Mealy automata
• On the classification of automorphisms of trees

This page was built for publication: CONJUGATION IN TREE AUTOMORPHISM GROUPS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4786296)