Algorithmic aspects of branched coverings
From MaRDI portal
Abstract: This is the announcement, and the long summary, of a series of articles on the algorithmic study of Thurston maps. We describe branched coverings of the sphere in terms of group-theoretical objects called bisets, and develop a theory of decompositions of bisets. We introduce a canonical "Levy" decomposition of an arbitrary Thurston map into homeomorphisms, metrically-expanding maps and maps doubly covered by torus endomorphisms. The homeomorphisms decompose themselves into finite-order and pseudo-Anosov maps, and the expanding maps decompose themselves into rational maps. As an outcome, we prove that it is decidable when two Thurston maps are equivalent. We also show that the decompositions above are computable, both in theory and in practice.
Recommendations
- Algorithmic aspects of branched coverings. II/V: Sphere bisets and decidability of Thurston equivalence
- An algebraic formulation of Thurston’s combinatorial equivalence
- Algorithmic aspects of branched coverings IV/V. Expanding maps
- Algorithmic aspects of branched coverings I/V. Van Kampen's theorem for bisets
- Algorithmic aspects of branched coverings. III/V: Erasing maps, orbispaces, and the Birman exact sequence
Cites work
- A Family of Cubic Rational Maps and Matings of Cubic Polynomials
- A primer on mapping class groups
- A proof of Thurston's topological characterization of rational functions
- Algorithmic aspects of branched coverings
- Algorithmic aspects of branched coverings I/V. Van Kampen's theorem for bisets
- Algorithmic construction of Hurwitz maps
- An algebraic characterization of expanding Thurston maps
- Combinations of complex dynamical systems
- Constructive geometrization of Thurston maps and decidability of Thurston equivalence
- Critical portraits for postcritically finite polynomials
- From rubber bands to rational maps: a research report
- Homotopy shadowing
- scientific article; zbMATH DE number 3873585 (Why is no real title available?)
- scientific article; zbMATH DE number 3879236 (Why is no real title available?)
- scientific article; zbMATH DE number 5354061 (Why is no real title available?)
- scientific article; zbMATH DE number 3699180 (Why is no real title available?)
- scientific article; zbMATH DE number 2195483 (Why is no real title available?)
- scientific article; zbMATH DE number 3106205 (Why is no real title available?)
- Iterated monodromy groups of quadratic polynomials. I.
- Matings of quadratic polynomials
- Nearly euclidean Thurston maps
- On the classification of homeomorphisms of 2-manifolds and the classification of 3-manifolds
- On the geometry and dynamics of diffeomorphisms of surfaces
- Questions about polynomial matings
- Surfaces and planar discontinuous groups. Revised and expanded transl. from the German by J. Stillwell
- Tan Lei and Shishikura's example of non-mateable degree 3 polynomials without a Lévy cycle
- The Thurston equivalence for postcritically finite branched coverings
- Thurston equivalence of topological polynomials
- Thurston equivalence to a rational map is decidable
- Thurston's pullback map on the augmented Teichmüller space and applications
- Topological characterization of canonical Thurston obstructions
- Train-tracks for surface homeomorphisms
Cited in
(25)- A Hurwitz-like classification of Thurston combinatorial classes
- Origami, affine maps, and complex dynamics
- Modular groups, Hurwitz classes and dynamic portraits of NET maps
- Algorithmic aspects of branched coverings I/V. Van Kampen's theorem for bisets
- Representing branched coverings by edge-coloured graphs
- Rationality is decidable for nearly Euclidean Thurston maps
- Algorithmic aspects of branched coverings. III/V: Erasing maps, orbispaces, and the Birman exact sequence
- Recognizing topological polynomials by lifting trees
- Invariant spanning trees for quadratic rational maps
- Centralizers in mapping class groups and decidability of Thurston equivalence
- Algorithmic aspects of branched coverings. II/V: Sphere bisets and decidability of Thurston equivalence
- Invariant graphs of rational maps
- Decomposability problem on branched coverings
- Polynomial Root-Finding Algorithms and Branched Covers
- Algorithmic aspects of branched coverings IV/V. Expanding maps
- Algorithmic aspects of branched coverings
- Expansion properties for finite subdivision rules. II
- Algorithmic construction of Hurwitz maps
- Constructive geometrization of Thurston maps and decidability of Thurston equivalence
- Branched covers and matrix factorizations
- Implicit branching and parameterized partial cover problems
- Eliminating Thurston obstructions and controlling dynamics on curves
- A solution to the degree-d twisted rabbit problem
- Computing pseudotriangulations via branched coverings
- The KP hierarchy, branched covers, and triangulations
This page was built for publication: Algorithmic aspects of branched coverings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4609689)
