The paper solves a concrete computational problem in arithmetic geometry: given a superelliptic curve YK : y^n = f(x) over a local field K, compute the oK-lattice M of integral differential forms β a quantity needed for the NΓ©ron model of the Jacobian and for numerically testing the Birch and Swinnerton-Dyer conjecture .
The key conceptual move is stated in the abstract and Proposition 1.1/Corollary 1.2: instead of computing a regular model (the prior state of the art, e.g. Donnelly's Magma implementation or Dokchitser's scripts, both with strong restrictions), it suffices to build a model with only rational singularities, for which the canonical sheaf pushforward is desingularization-invariant. Theorem 1.5 proves that if n is invertible in oK and the branch divisor on a regular P1-model is normal crossing, the normalization Y has only tame quotient (hence rational, by Boutot) singularities .
Algorithms 3.10/3.13 construct the required regular P1-model using MacLane inductive valuations and shortest N-paths, extending RΓΌth's thesis framework without assuming an algebraically closed residue field β a genuine technical refinement over prior work .
The only quantitative validation is two examples over Q5 sharing the branch polynomial f = (xΒ²β5)Β³β5β΅: the genus-2 curve yields basis B = (5, x), the genus-4 curve yields B = (5Β², 5x, xΒ²β5, y). The per-valuation data from Tables 1β2 show the internal machinery (orders of vanishing v(dx) and w(Ξ·)) is nontrivial and varies across the valuation tree:
These observed bases are direct, checkable outputs; correctness in principle follows from Theorem 4.14, but no independent cross-check against an alternative implementation is reported .
Strengths: complete proofs, reproducible public code (regularmodels and MCLF repositories on GitHub), careful bookkeeping of non-integral order-of-vanishing conventions, and honest positioning against Magma/Dokchitser alternatives.
Limitations the paper states or implies: scope restricted to superelliptic curves with n invertible in oK (Assumption 1.4) β tame covers only, so wild cases (p | n) remain open; only two examples, both over Q5 with the same f; the constructed model is not regular, and the authors defer regular-model computation to future work. Blind spots BGPT adds: no benchmarking of runtime or scaling behavior versus existing implementations; no adversarial examples (e.g. highly degenerate f, large residue-field extensions where the footnote-7 issue β multiple extensions per valuation β could blow up computation); no numerical cross-validation of the lattice via discriminant/conductor invariants. The proof of Proposition 1.1 also leans on Boutot's result outside its stated hypotheses (footnote 1 concedes schemes over a field of characteristic zero), which the authors argue goes through unchanged β plausible but not fully re-derived, a residual epistemic gap.
What would change the assessment: a counterexample where the normalization of a normal-crossing model fails rationality, or a case where the computed basis fails v(Ο) β₯ 0 for some vertical valuation, would falsify the core correctness claim. Confidence in the theory is high; confidence in practical coverage breadth is moderate pending more examples.
Know what changed, what holds up, and what remains uncertain. Every Friday. No ads.