Publication Date
5-2016
Date of Final Oral Examination (Defense)
3-16-2016
Type of Culminating Activity
Thesis
Degree Title
Master of Science in Mathematics
Department
Mathematics
Major Advisor
Samuel Coskey, Ph.D.
Advisor
Marion Scheepers, Ph.D.
Advisor
Zachariah Teitler, Ph.D.
Abstract
In this thesis we identify the complexity of the conjugacy problem of automorphisms of regular trees. We expand on the results of Kechris, Louveau, and Friedman on the complexities of the isomorphism problem of classes of countable trees. We see in nearly all cases that the complexity of isomorphism of subtrees of a given regular countable tree is the same as the complexity of conjugacy of automorphisms of the same tree, though we present an example for which this does not hold.
Recommended Citation
Beserra, Kyle Douglas, "On the Conjugacy Problem for Automorphisms of Trees" (2016). Boise State University Theses and Dissertations. 1083.
https://scholarworks.boisestate.edu/td/1083