On the classification of automorphisms of trees

This post is a link to https://arxiv.org/abs/1709.02467

With Kyle Beserra. Contributions to discrete mathematics 14(1):203–213.

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.