On the classification of automorphisms of trees
Kyle Beserra, Samuel Coskey
TL;DR
This paper investigates the complexity of classifying automorphisms of countable trees up to conjugacy, analyzing both rooted and unrooted cases, and extending to non-regularly branching trees.
Contribution
It provides a detailed complexity analysis of automorphism conjugacy problems for various types of countable trees, including regular and non-regular cases.
Findings
Complexity characterization for automorphisms of regularly branching trees.
Analysis of conjugacy problem complexity for non-regular trees.
Comparison between rooted and unrooted tree automorphism classifications.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.