pith. sign in

arxiv: 1711.00125 · v2 · pith:KBIEUWECnew · submitted 2017-10-31 · 🧮 math.NT · math.AG

The Belyi degree is computable

classification 🧮 math.NT math.AG
keywords belyidegreealgorithmcomputablecomputescurveexhibitfield
0
0 comments X
read the original 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$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.