pith. sign in

arxiv: 2604.15562 · v1 · submitted 2026-04-16 · 🧮 math.NT · math.AG

Belyi map verification using certified path tracking

Alexandre Guillemot , John Voight This is my paper

Pith reviewed 2026-05-10 09:30 UTC · model grok-4.3

classification 🧮 math.NT math.AG
keywords Belyi mapsmonodromycertified homotopy continuationpath trackingnumber fieldsLMFDBrigorous computationGalois action
0
0 comments X

The pith

Certified homotopy continuation rigorously computes monodromy triples for Belyi maps given by exact equations over number fields.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper presents a complete computational workflow that starts from a Belyi map defined by polynomials with exact coefficients in a number field and uses certified path tracking to follow the solutions of the associated equations. This process determines the monodromy permutations with rigorous guarantees that no branch points or relations are missed or added. The authors then run the method on a large collection of maps already stored in the LMFDB, certifying their monodromy triples. A reader cares because these triples encode the Galois action and combinatorial structure of the maps, and having them verified removes a source of possible error when the database is used for further arithmetic or geometric research.

Core claim

We provide an end-to-end workflow to rigorously compute the monodromy of Belyi maps from exact equations over number fields using certified homotopy continuation. We then apply this method at scale to certify the monodromy triples of Belyi maps in the LMFDB.

What carries the argument

Certified homotopy continuation applied to exact algebraic equations over number fields, which tracks solution paths with rigorous error bounds to compute the monodromy permutations on the fibers.

If this is right

  • Monodromy triples stored in the LMFDB for Belyi maps can be treated as rigorously verified rather than conjectural.
  • The same workflow can be applied to additional Belyi maps defined over number fields that are not yet in the database.
  • Rigorous monodromy data becomes available for checking consistency with theoretical predictions about Galois representations attached to the maps.
  • The method supplies a template for certifying other permutation representations that arise from branched covers of the projective line.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The workflow could be combined with existing computer-algebra packages to produce certified data for dessins d'enfants that are currently studied only numerically.
  • Similar certified tracking might be used to verify other arithmetic invariants of covers, such as the field of moduli or the automorphism group.
  • Once many monodromy triples are certified, systematic searches for maps with prescribed monodromy become feasible with guaranteed completeness.
  • The technique illustrates how numerical methods can be made fully rigorous when the input data are exact algebraic, suggesting extensions to other covering problems in arithmetic geometry.

Load-bearing premise

That certified homotopy continuation applied to exact equations over number fields produces correct monodromy triples without introducing or missing any algebraic relations.

What would settle it

A concrete Belyi map whose monodromy triple computed by the certified path-tracking workflow differs from the triple obtained by an independent algebraic computation such as resolvent factorization or direct Galois group determination.

read the original abstract

We provide an end-to-end workflow to rigorously compute the monodromy of Belyi maps from exact equations over number fields using certified homotopy continuation. We then apply this method at scale to certify the monodromy triples of Belyi maps in the $L$-functions and Modular Forms Database (LMFDB).

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 3 minor

Summary. The paper presents an end-to-end workflow that converts exact Belyi equations defined over number fields into verified monodromy triples by means of certified homotopy continuation, then scales the procedure to certify the monodromy data attached to Belyi maps stored in the LMFDB.

Significance. If the certification guarantees hold, the work supplies a reproducible, machine-verifiable route to a fundamental combinatorial invariant of Belyi maps. This strengthens the reliability of the LMFDB entries and supplies a template for rigorous large-scale computation in arithmetic geometry and the theory of dessins d'enfants.

minor comments (3)
  1. [§2.3] §2.3: the description of the embedding of the number-field coefficients into C for path tracking does not specify how the minimal polynomial is used to control the working precision; a short paragraph or reference to the interval-arithmetic library would clarify reproducibility.
  2. [Table 1] Table 1: the column reporting the number of certified paths omits the total degree of the covering for each example; adding this datum would make the success rate immediately comparable across rows.
  3. [§4.1] §4.1: the statement that 'no paths were lost' would be strengthened by an explicit count of the number of paths that reached the certification threshold versus those that required extra precision iterations.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive summary, recognition of the significance of the certified workflow, and recommendation for minor revision. No major comments appear in the report, so we have no specific points requiring rebuttal or clarification.

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper describes an end-to-end workflow that takes exact Belyi equations over number fields as input and applies certified homotopy continuation (an external, independently validated numerical technique) to produce monodromy triples. No derivation step reduces by construction to a fitted parameter, self-defined quantity, or load-bearing self-citation chain; the certification guarantees enclosure of paths without introducing algebraic relations, and scaling to LMFDB entries is a direct application rather than a renaming or ansatz smuggling. The central claim remains independent of its own outputs.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract supplies no information on free parameters, axioms, or invented entities; the ledger is therefore empty.

pith-pipeline@v0.9.0 · 5328 in / 991 out tokens · 20103 ms · 2026-05-10T09:30:08.953034+00:00 · methodology

discussion (0)

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

Reference graph

Works this paper leans on

28 extracted references · 28 canonical work pages

  1. [1]

    Computation of Belyi Maps with Prescribed Ramifi- cation and Applications in Galois Theory

    D. Barth and A. Wenz. “Computation of Belyi Maps with Prescribed Ramifi- cation and Applications in Galois Theory”. In:Journal of Algebra569 (2021), pp. 616–642

    work page 2021

  2. [2]

    AlgorithmicCon- struction of Hurwitz Maps

    L.Bartholdi,X.Buff,H.-C.GrafVonBothmer,andJ.Kröker.“AlgorithmicCon- struction of Hurwitz Maps”. In:Experimental Mathematics24.1 (2015), pp. 76– 92

    work page 2015

  3. [3]

    Certified Numerical Homotopy Tracking

    C. Beltrán and A. Leykin. “Certified Numerical Homotopy Tracking”. In:Exper- imental Mathematics21.1 (2012), pp. 69–83

    work page 2012

  4. [4]

    Robust certified numerical homotopy tracking

    C. Beltrán and A. Leykin. “Robust certified numerical homotopy tracking”. In: Found. Comput. Math.13.2 (2013), pp. 253–295

    work page 2013

  5. [5]

    On Galois Extensions Of a Maximal Cyclotomic Field

    G. V. Belyi. “On Galois Extensions Of a Maximal Cyclotomic Field”. In:Math. USSR Izv.14.2 (1980), p. 247

    work page 1980

  6. [6]

    On the computation of modular forms on noncongruence subgroups

    D. Berghaus, H. Monien, and D. Radchenko. “On the computation of modular forms on noncongruence subgroups”. In:Math. Comp.93.347 (2024), pp. 1399– 1425

    work page 2024

  7. [7]

    Msolve: A Library for Solving Polynomial Systems

    J. Berthomieu, C. Eder, and M. Safey El Din. “Msolve: A Library for Solving Polynomial Systems”. In:Proceedings of the 2021 International Symposium on Symbolic and Algebraic Computation. ISSAC ’21. New York, NY, USA: Associ- ation for Computing Machinery, 2021, pp. 51–58

    work page 2021

  8. [8]

    HomotopyContinuation.Jl: A Package for Homotopy Continuation in Julia

    P. Breiding and S. Timme. “HomotopyContinuation.Jl: A Package for Homotopy Continuation in Julia”. In:Mathematical Software – ICMS 2018. Ed. by J. H. Davenport, M. Kauers, G. Labahn, and J. Urban. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2018, pp. 458–465

    work page 2018

  9. [9]

    Numerical computation of endomorphism rings of Jacobians

    N. Bruin, J. Sijsling, and A. Zotine. “Numerical computation of endomorphism rings of Jacobians”. In:Proceedings of the Thirteenth Algorithmic Number The- ory Symposium. Vol. 2. Open Book Ser. Math. Sci. Publ., Berkeley, CA, 2019, pp. 155–171. 8 A. Guillemot, J. Voight

    work page 2019

  10. [10]

    Computing Riemann Matrices of Algebraic Curves

    B. Deconinck and M. van Hoeij. “Computing Riemann Matrices of Algebraic Curves”. In:Physica D: Nonlinear Phenomena. Advances in Nonlinear Mathe- matics and Science: A Special Issue to Honor Vladimir Zakharov 152–153 (2001), pp. 28–46

    work page 2001

  11. [11]

    Certified Homotopy Tracking Using the Krawczyk Method

    T. Duff and K. Lee. “Certified Homotopy Tracking Using the Krawczyk Method”. In:Proc. ISSAC 2024. New York, NY, USA: Association for Computing Machin- ery, 2024, pp. 274–282

    work page 2024

  12. [12]

    T.DuffandK.Lee.Certifying Galois/Monodromy Actions via Homotopy Graphs

    work page

  13. [13]

    arXiv:2603.17288 [math]

    work page arXiv

  14. [14]

    The complex polynomialsP(x)withGal(P(x)−t) ∼= M23

    N. D. Elkies. “The complex polynomialsP(x)withGal(P(x)−t) ∼= M23”. In: ANTS X—Proceedings of the Tenth Algorithmic Number Theory Symposium. Vol. 1. Open Book Ser. Math. Sci. Publ., Berkeley, CA, 2013, pp. 359–367

    work page 2013

  15. [15]

    Guillemot.Belyi monodromy.https://gitlab.inria.fr/aguillem/belyi- monodromy

    A. Guillemot.Belyi monodromy.https://gitlab.inria.fr/aguillem/belyi- monodromy. GitLab repository. Accessed 2026-04-12

    work page 2026

  16. [16]

    Certified Algebraic Path Tracking with Algpath

    A. Guillemot. “Certified Algebraic Path Tracking with Algpath”. In:ACM Com- mun. Comput. Algebra59.3 (2026), pp. 53–56

    work page 2026

  17. [17]

    Validated Numerics for Algebraic Path Tracking

    A. Guillemot and P. Lairez. “Validated Numerics for Algebraic Path Tracking”. In:Proc. ISSAC 2024. New York, NY, USA: Association for Computing Machin- ery, 2024, pp. 36–45

    work page 2024

  18. [18]

    Numerical Calculation of Three-Point Branched Covers of the Projective Line

    M. Klug, M. Musty, S. Schiavone, and J. Voight. “Numerical Calculation of Three-Point Branched Covers of the Projective Line”. In:LMS J. Comput. Math. 17.1 (2014), pp. 379–430

    work page 2014

  19. [19]

    Kranich.An Epsilon-Delta Bound for Plane Algebraic Curves and Its Use for Certified Homotopy Continuation of Systems of Plane Algebraic Curves

    S. Kranich.An Epsilon-Delta Bound for Plane Algebraic Curves and Its Use for Certified Homotopy Continuation of Systems of Plane Algebraic Curves. 2016. arXiv:1505.03432 [math]

    work page arXiv 2016

  20. [20]

    SIROCCO: A Library for Certified Polynomial Root Continuation

    M. Á. Marco-Buzunariz and M. Rodríguez. “SIROCCO: A Library for Certified Polynomial Root Continuation”. In:Mathematical Software – ICMS 2016. Ed. by G.-M. Greuel, T. Koch, P. Paule, and A. Sommese. Vol. 9725. Cham: Springer International Publishing, 2016, pp. 191–197

    work page 2016

  21. [21]

    R. E. Moore, R. B. Kearfott, and M. J. Cloud.Introduction to Interval Anal- ysis. Other Titles in Applied Mathematics. Society for Industrial and Applied Mathematics, 2009

    work page 2009

  22. [22]

    A Database of Belyi Maps

    M. Musty, S. Schiavone, J. Sijsling, and J. Voight. “A Database of Belyi Maps”. In:Open Book Series2.1 (2019), pp. 375–392

    work page 2019

  23. [23]

    Hurwitz–Belyi Maps

    D. P. Roberts. “Hurwitz–Belyi Maps”. In:Publications mathématiques de Be- sançon. Algèbre et théorie des nombres(2018), pp. 25–67

    work page 2018

  24. [24]

    Solving Algebraic Problems With High Accuracy

    S. M. Rump. “Solving Algebraic Problems With High Accuracy”. In:A New Approach to Scientific Computation. Ed. by U. W. Kulisch and W. L. Miranker. Academic Press, 1983, pp. 51–120

    work page 1983

  25. [25]

    Dessins d’enfants on the Riemann Sphere

    “Dessins d’enfants on the Riemann Sphere”. In:The Grothendieck Theory of Dessins d’Enfants. Ed. by L. Schneps. London Mathematical Society Lecture Note Series. Cambridge: Cambridge University Press, 1994, pp. 47–78

    work page 1994

  26. [26]

    On Computing Belyi Maps

    J. Sijsling and J. Voight. “On Computing Belyi Maps”. In:Publications mathé- matiques de Besançon. Algèbre et théorie des nombres1 (2015), pp. 73–131

    work page 2015

  27. [27]

    van der Hoeven.Reliable Homotopy Continuation

    J. van der Hoeven.Reliable Homotopy Continuation. Research Report. LIX, Ecole polytechnique, 2015

    work page 2015

  28. [28]

    An Approach for Certifying Homotopy Contin- uation Paths: Univariate Case

    J. Xu, M. Burr, and C. Yap. “An Approach for Certifying Homotopy Contin- uation Paths: Univariate Case”. In:Proc. ISSAC 2018. New York, NY, USA: Association for Computing Machinery, 2018, pp. 399–406

    work page 2018