Presentations of NET maps

@article{Floyd2017PresentationsON,
  title={Presentations of NET maps},
  author={W. Floyd and W. Parry and K. Pilgrim},
  journal={arXiv: Dynamical Systems},
  year={2017}
}
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. 
4 Citations
Origami, Affine Maps, and Complex Dynamics
  • 7
  • PDF
The Thurston Algorithm for quadratic matings
  • 3
  • PDF

References

SHOWING 1-9 OF 9 REFERENCES
On Thurston's pullback map
  • 27
  • PDF
Boundary values of the thurston pullback map
  • 15
  • PDF
Nearly Euclidean Thurston maps
  • 21
  • PDF
A proof of Thurston's topological characterization of rational functions
  • 372
  • PDF
A Primer on Mapping Class Groups (Pms-49)
  • 770
Self-Similar Groups
  • 454
  • PDF