On the classification of automorphisms of trees
From MaRDI portal
Publication:3299362
Abstract: We identify the complexity of the classification problem for automorphisms of a given countable regularly branching tree up to conjugacy. We consider both the rooted and unrooted cases. Additionally, we calculate the complexity of the conjugacy problem in the case of automorphisms of several non-regularly branching trees.
Recommendations
Cites work
- A Borel reductibility theory for classes of countable structures
- An anti-classification theorem for ergodic measure preserving transformations
- CONJUGATION IN TREE AUTOMORPHISM GROUPS
- COUNTABLE BOREL EQUIVALENCE RELATIONS
- Conjugacy and cocycle conjugacy of automorphisms of \({\mathcal O}_2\) are not Borel
- Countable sections for locally compact group actions
- Invariant descriptive set theory
- The Structure of Hyperfinite Borel Equivalence Relations
- The conjugacy problem for the automorphism group of the random graph
Cited in
(9)- Sur une classe de transformations d'arbres
- CONJUGATION IN TREE AUTOMORPHISM GROUPS
- Classes of Tree Homomorphisms with Decidable Preservation of Regularity
- scientific article; zbMATH DE number 3559897 (Why is no real title available?)
- The conjugacy problem for automorphism groups of homogeneous digraphs
- scientific article; zbMATH DE number 2186231 (Why is no real title available?)
- The distribution of the number of automorphisms of random trees
- scientific article; zbMATH DE number 6010656 (Why is no real title available?)
- On confinal dynamics of rooted tree automorphisms
This page was built for publication: On the classification of automorphisms of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3299362)