On the classification of automorphisms of trees
Logic
2020-01-09 v2 Combinatorics
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.
Keywords
Cite
@article{arxiv.1709.02467,
title = {On the classification of automorphisms of trees},
author = {Kyle Beserra and Samuel Coskey},
journal= {arXiv preprint arXiv:1709.02467},
year = {2020}
}