10 citations · 25 across the 14 of their papers we have counts for
Showing math.GRShow all
3 papers · 1 filter
math.GR2018
Algorithmic aspects of branched coverings III/V. Erasing maps, orbispaces, and the Birman exact sequence
Laurent Bartholdi, Dzmitry Dudko
Let be a Thurston map and let be its mapping class biset: isotopy classes rel of maps obtained by pre- and…
math.GR2016★ 1 cited
Algorithmic aspects of branched coverings II/V. Sphere bisets and their decompositions
Laurent Bartholdi, Dzmitry Dudko
We consider "Thurston maps": branched self-coverings of the sphere with ultimately periodic critical points, and prove that the Thurston equivalence problem between them (continuou…
math.GR2015
Algorithmic aspects of branched coverings I. Van Kampen's Theorem for bisets
Laurent Bartholdi, Dzmitry Dudko
We develop a general theory of "bisets": sets with two commuting group actions. They naturally encode topological correspondences. Just as van Kampen's theorem decomposes into a gr…