Presentations of NET maps
From MaRDI portal
Publication:4615015
Abstract: A branched covering is a nearly Euclidean Thurston (NET) map if each critical point is simple and its postcritical set has exactly four points. We show that up to equivalence, each NET map admits a normal form in terms of simple affine data. This data can then be used as input for algorithms developed for the computation of fundamental invariants, now systematically tabulated in a large census.
Recommendations
Cites work
- scientific article; zbMATH DE number 2195483 (Why is no real title available?)
- A primer on mapping class groups
- A proof of Thurston's topological characterization of rational functions
- Modular groups, Hurwitz classes and dynamic portraits of NET maps
- Nearly euclidean Thurston maps
- On Thurston's pullback map
- Origami, affine maps, and complex dynamics
- Pullback invariants of Thurston maps
Cited in
(6)- Origami, affine maps, and complex dynamics
- Modular groups, Hurwitz classes and dynamic portraits of NET maps
- Rationality is decidable for nearly Euclidean Thurston maps
- A completely PPT map
- Mapping PUNITY to UniNet
- Algorithmic aspects of branched coverings. II/V: Sphere bisets and decidability of Thurston equivalence
This page was built for publication: Presentations of NET maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4615015)