arXiv · 1711.00125
The Belyi degree is computable
Abstract
We exhibit an algorithm that, given input a curve $X$ over a number field, computes as output the minimal degree of a Belyi map $X \to \mathbb{P}^1$.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Ariyan Javanpeykar, John Voight. 2018-05-15. The Belyi degree is computable. https://arxiv.org/abs/1711.00125
Cite the original work for its findings. Save a collection to share your selection of sources.