Algorithmic aspects of branched coverings II/V. Sphere bisets and their decompositions
Laurent Bartholdi, Dzmitry Dudko

TL;DR
This paper proves the decidability of Thurston equivalence for sphere branched coverings by decomposing their associated algebraic structures, called mapping class bisets, into simpler components and solving related conjugacy problems.
Contribution
It introduces a decomposition of mapping class bisets for sphere branched coverings, enabling the decision of Thurston equivalence through algebraic and analytical methods.
Findings
Decidability of Thurston equivalence for sphere branched coverings.
Decomposition of mapping class bisets into small, manageable components.
Existence of Thurston maps with infinitely generated centralizers.
Abstract
We consider "Thurston maps": branched self-coverings of the sphere with ultimately periodic critical points, and prove that the Thurston equivalence problem between them (continuous deformation of maps along with their critical orbits) is decidable. More precisely, we consider the action of mapping class groups, by pre- and post-composition, on branched coverings, and encode them algebraically as "mapping class bisets". We show how the mapping class biset of maps preserving a multicurve decomposes into mapping class bisets of smaller complexity, called "small mapping class bisets". We phrase the decision problem of Thurston equivalence between branched self-coverings of the sphere in terms of the conjugacy and centralizer problems in a mapping class biset. Our decomposition results on mapping class bisets reduce these decision problems to small mapping class bisets; they correspond…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Coding theory and cryptography · Rings, Modules, and Algebras
