映射类群中的中心化子与Thurston等价的可判定性
Centralizers in Mapping Class Group and decidability of Thurston Equivalence
摘要：
我们发现一个建设性的界限的生成集的中心化的映射类群的元素的字长。因此，我们表明，它是算法判定是否两个后临界有限分支覆盖的领域是瑟斯顿等价的。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
