pith. sign in

arxiv: 1701.00443 · v1 · pith:QHEB72ZOnew · submitted 2017-01-02 · 🧮 math.DS

Presentations of NET maps

classification 🧮 math.DS
keywords datasimpleadmitsaffinealgorithmsbranchedcensuscomputation
0
0 comments X
read the original abstract

A branched covering $f: S^2 \to S^2$ 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.