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.









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)