arXiv · 1902.02645
Centralizers in Mapping Class Group and decidability of Thurston Equivalence
Abstract
We find a constructive bound for the word length of a generating set for the centralizer of an element of the Mapping Class Group. As a consequence, we show that it is algorithmically decidable whether two postcritically finite branched coverings of the sphere are Thurston equivalent.
Explore related subjects
Keep this discovery
Kasra Rafi, Nikita Selinger, Michael Yampolsky. 2019-02-05. Centralizers in Mapping Class Group and decidability of Thurston Equivalence. https://arxiv.org/abs/1902.02645
Cite the original work for its findings. Save a collection to share your selection of sources.