Algorithmic aspects of branched coverings I/V. Van Kampen's theorem for bisets

DOI10.4171/GGD/441zbMath1423.57003arXiv1512.08539OpenAlexW2964316931WikidataQ130080301 ScholiaQ130080301MaRDI QIDQ1747810

Laurent Bartholdi, Dzmitry Dudko

Publication date: 27 April 2018

Published in: Groups, Geometry, and Dynamics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1512.08539

zbMATH Keywords

coveringsgraphs of groupsamalgamated free productsbisetsvan Kampen's theoremgraphs of bisets

Mathematics Subject Classification ID

Covering spaces and low-dimensional topology (57M10) Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations (20E06) Low-dimensional topology of special (e.g., branched) coverings (57M12)

Related Items (5)

Algorithmic aspects of branched coverings. II/V: Sphere bisets and decidability of Thurston equivalence ⋮ Algorithmic aspects of branched coverings IV/V. Expanding maps ⋮ Algorithmic aspects of branched coverings ⋮ Quadratic Thurston maps with few postcritical points ⋮ Algorithmic aspects of branched coverings. III/V: Erasing maps, orbispaces, and the Birman exact sequence

This page was built for publication: Algorithmic aspects of branched coverings I/V. Van Kampen's theorem for bisets