Skip to main content
Log in

Computing minimal Weierstrass equations of hyperelliptic curves

  • Research
  • Published:
Research in Number Theory Aims and scope Submit manuscript

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\).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Data availability

No external dataset is used.

Notes

  1. Let \(g\ge 1\) be odd and let \(p>2\). Consider the equation \(y^2=px^{2g+1}+p^{g+2}\) over \({\mathbb {Z}}_p\). Then \(\epsilon =1\). For the point \(x=y=p=0\), we have \(\lambda =g+2\). By (2.b), this equation is minimal. But \(\lambda >g+1\). So in (1) the converse does not hold for odd g in general.

References

  1. Cremona, J., Fisher, T., Stoll, M.: Minimisation and reduction of 2-, 3- and 4-coverings of elliptic curves. Algebra Number Theory 4, 763–820 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  2. Laska, M.: An algorithm for finding a minimal Weierstrass equation for an elliptic curve. Math. Comp. 38, 257–260 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  3. Liu, Qing: Modèles entiers de courbes hyperelliptiques sur un anneau de valuation discrète. Trans. Am. Math. Soc. 348, 4577–4610 (1996)

    Article  MATH  Google Scholar 

  4. Liu, Qing: Global Weierstrass equations of hyperelliptic curves. Trans. Am. Math. Soc. 375, 5889–5906 (2022)

    MathSciNet  MATH  Google Scholar 

  5. Lockhart, Paul: On the discriminant of a hyperelliptic curve. Trans. Am. Math. Soc. 342, 729–752 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  6. The PARI Group, PARI/GP, Univ. Bordeaux, 2023, available from http://pari.math.u-bordeaux.fr/

  7. Tate, J.: Algorithm for determining the type of singular fiber in an elliptic pencil. In: Modular Functions of One Variable. IV, vol. 476. pp. 33–52, Lecture Notes in Math., Springer (1975)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Qing Liu.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

I would like to thank Bill Allombert for clarifications regarding some computational aspects in this article and for pointing out related references. I would also like to thank the referees for their thorough reading. Thank you also to the referees and Bill Allombert for suggestions which led to improvements in the presentation of this manuscript.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Liu, Q. Computing minimal Weierstrass equations of hyperelliptic curves. Res. number theory 9, 76 (2023). https://doi.org/10.1007/s40993-023-00483-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s40993-023-00483-5

Mathematics Subject Classification

Navigation