Computing minimal Weierstrass equations of hyperelliptic curves

DOI10.1007/S40993-023-00483-5MaRDI QIDQ6072070zbMATH OpenOpenAlexFDO

Authors

Publication date 29 November 2023

Published in Research in Number Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2209.00469

zbMATH Keywords

hyperelliptic curvesminimal Weierstrass equationspointed hyperelliptic curves

Mathematics Subject Classification ID

Elliptic curves over global fields (11G05) [https://duckduckgo.com/?q=MSC%2011G30%20%22Curves+of+arbitrary+genus+or+genus+%28%0D%0Ae+1%29+over+global+fields%22 Curves of arbitrary genus or genus ( e 1) over global fields (11G30)] Global ground fields in algebraic geometry (14G25)

Abstract: We describe an algorithm for determining a minimal Weierstrass equation for hyperelliptic curves over principal ideal domains. When the curve has a rational Weierstrass point $w_0$, we also give a similar algorithm for determining the minimal Weierstrass equation with respect to $w_0$.

Review text

The notion of minimal Weierstrass equation is very well known for elliptic curves and seminal work from Tate allowed to explicitly compute them (over a DVR with perfect residue field). Previous work from the author and others have extended this notion to hyperelliptic curves of arbitrary genus. In the paper under review, the author gives an explicit and very detailed procedure for computing minimal Weierstrass equations of hyperellitpic curves over a PID, with a variation for minimal pointed Weierstrass equations (that is, for the case where there is a distinguished point, defined as a certain pole). There exists a PARI implementation (over \(\mathbb{Z}\)) of the described procedures. The paper is written with great clarity and attention to detail.

Recommendations

• scientific article; zbMATH DE number 2086898
• Minimal integral Weierstrass equations for genus 2 curves
• Global Weierstrass equations of hyperelliptic curves
• Computing Hasse-Witt matrices of hyperelliptic curves in average polynomial time. II
• Hyperelliptic curves and their invariants: geometric, arithmetic and algorithmic aspects

Cites work

• Algorithm for determining the type of a singular fiber in an elliptic pencil.
• An Algorithm for Finding a Minimal Weierstrass Equation for an Elliptic Curve
• Global Weierstrass equations of hyperelliptic curves
• Minimisation and reduction of 2-, 3- and 4-coverings of elliptic curves
• Modèles entiers des courbes hyperelliptiques sur un corps de valuation discrète
• On the Discriminant of a Hyperelliptic Curve

Cited in

(3)

• Minimal integral Weierstrass equations for genus 2 curves
• Minimisation of 2-coverings of genus 2 Jacobians
• Computing Euler factors of genus 2 curves at odd primes of almost good reduction

This page was built for publication: Computing minimal Weierstrass equations of hyperelliptic curves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6072070)