arXiv · 1504.00244
Dessins d'enfants for analysts
Abstract
We present an algorithmic way of exactly computing Belyi functions for hypermaps and triangulations in genus 0 or 1, and the associated dessins, based on a numerical iterative approach initialized from a circle packing combined with subsequent lattice reduction. The main advantage compared to previous methods is that it is applicable to much larger graphs; we use very little algebraic geometry, and aim for this paper to be as self-contained as possible.
Explore related subjects
Keep this discovery
Vincent Beffara. 2015-04-01. Dessins d'enfants for analysts. https://arxiv.org/abs/1504.00244
Cite the original work for its findings. Save a collection to share your selection of sources.