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$.

15 pages; improved exposition, more detailed examples

References in corpus (2)

• Polynomial bounds for Arakelov invariants of Belyi curves
• On the Belyi degree(s) of a curve defined over a number field