Computing rational points on rank 0 genus 3 hyperelliptic curves
Mar\'ia In\'es de Frutos-Fern\'andez, Sachi Hashimoto

TL;DR
This paper develops and implements an algorithm using the Chabauty-Coleman method to compute all rational points on genus 3 hyperelliptic curves with Mordell-Weil rank zero, demonstrating its effectiveness on a large dataset.
Contribution
The authors adapt and implement the Chabauty-Coleman method specifically for genus 3 hyperelliptic curves with rank 0 Jacobians, enabling systematic computation of rational points.
Findings
Successfully computed rational points on 5870 curves.
Validated the effectiveness of the Chabauty-Coleman method for genus 3 hyperelliptic curves.
Provided a practical algorithm for future research in rational point computation.
Abstract
We compute rational points on genus odd degree hyperelliptic curves over that have Jacobians of Mordell-Weil rank . The computation applies the Chabauty-Coleman method to find the zero set of a certain system of -adic integrals, which is known to be finite and include the set of rational points . We implemented an algorithm in Sage to carry out the Chabauty-Coleman method on a database of curves.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic Geometry and Number Theory · Cryptography and Residue Arithmetic · Polynomial and algebraic computation
