Centralizers in Mapping Class Group and decidability of Thurston Equivalence
classification
🧮 math.GT
keywords
classgroupmappingthurstonalgorithmicallyboundbranchedcentralizer
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.