The Belyi degree is computable

2017/10/31 by Ariyan Javanpeykar, Javanpeykar, Ariyan, John Voight +1
Computer Science · Mathematics · #Algebraic Geometry (math.AG) #Algebraic Geometry and Number Theory #Coding theory and cryptography #FOS: Mathematics #Number Theory (math.NT) #Rings, Modules, and Algebras

paper · pdf · doi:10.48550/arxiv.1711.00125

openalex publication_date 2017/10/31 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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 → ℙ¹.

Related

• On the Belyi degree(s) of a curve defined over a number field
• Belyi's theorem revisited
• Bounding the Degree of Belyi Polynomials
• On the Belyi degree of a number field
• Algorithms and differential relations for Belyi functions