Algorithmic aspects of branched coverings III/V. Erasing maps, orbispaces, and the Birman exact sequence
Laurent Bartholdi, Dzmitry Dudko

TL;DR
This paper develops a polynomial-time method for solving conjugacy problems in mapping class bisets of Thurston maps, extending classical theory with new invariants and algorithms, especially for geometric cases like expanding maps.
Contribution
It introduces an analogue of the Birman short exact sequence for mapping class bisets, enabling reduction of conjugacy problems and providing complete invariants for geometric Thurston maps.
Findings
Polynomial-time algorithms for conjugacy and centralizer problems.
Complete conjugacy invariants for geometric Thurston maps.
Description of bisets for (2,2,2,2)-maps as crossed products.
Abstract
Let be a Thurston map and let be its mapping class biset: isotopy classes rel of maps obtained by pre- and post-composing by the mapping class group of . Let be an -invariant subset, and let be the induced map. We give an analogue of the Birman short exact sequence: just as the mapping class group is an iterated extension of by fundamental groups of punctured spheres, is an iterated extension of by the dynamical biset of . Thurston equivalence of Thurston maps classically reduces to a conjugacy problem in mapping class bisets. Our short exact sequence of mapping class bisets allows us to reduce in polynomial time the conjugacy problem in to…
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.
