Papers › Brauer-Manin obstructions on hyperelliptic curves

Brauer-Manin obstructions on hyperelliptic curves

1 Dec 2021arXiv:2112.00230links table onlyarchive 2025-07-28

Brendan Creutz, Duttatrey Nath Srivastava

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

We describe a practical algorithm for computing Brauer-Manin obstructions to the existence of rational points on hyperelliptic curves defined over number fields. This offers advantages over descent based methods in that its correctness does not rely on rigorous class and unit group computations of large degree number fields. We report on experiments showing it to be a very effective tool for deciding existence of rational points: Among a random samples of curves over the rational numbers of genus at least $5$ we were able to decide existence of rational points for over 99% of curves. We also demonstrate its effectiveness for high genus curves, giving an example of a genus $50$ hyperelliptic curve with a Brauer-Manin obstrution to the Hasse Principle. The main theoretical development allowing for this algorithm is an extension of the descent theory for abelian torsors to a framework of torsors with restricted ramification.

PaperPDFCode

Code

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections