arXiv Analytics

Sign in

arXiv:1709.02467 [math.LO]AbstractReferencesReviewsResources

On the classification of automorphisms of trees

Kyle Beserra, Samuel Coskey

Published 2017-09-07Version 1

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.

Categories: math.LO, math.CO
Subjects: 03E15, 05C05, 05C63, 20E45
Related articles: Most relevant | Search more
arXiv:1501.03022 [math.LO] (Published 2015-01-13)
The classification problem for automorphisms of C*-algebras
arXiv:1510.08969 [math.LO] (Published 2015-10-30)
The complexity of the classification problem of continua
arXiv:2410.00901 [math.LO] (Published 2024-10-01)
The Complexity of Proper Homotopy Equivalence of Graphs

Links

Toolbox