Presentations of NET maps
Dynamical Systems
2017-01-03 v1
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.
Cite
@article{arxiv.1701.00443,
title = {Presentations of NET maps},
author = {William Floyd and Walter Parry and Kevin M. Pilgrim},
journal= {arXiv preprint arXiv:1701.00443},
year = {2017}
}