Papers › Effective Darmon's program for the generalised Fermat equation
Effective Darmon's program for the generalised Fermat equation
Martin Azon
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 follow the ideas of Darmon's program for solving infinite families of generalised Fermat equations of signatures (p,p,r) and (r,r,p), where, r is a fixed prime and p is varying. We do so by introducing a common framework for both signatures, allowing for a uniform treatment for the two families of equations. We analyse in detail the geometry of Frey hyperelliptic curves, and the reduction types of the N\'eron models of their Jacobians. We then study the associated $2$-dimensional Galois representations: modularity, irreducibility, and level lowering. We provide a Magma package that performs the elimination step for many choices of coefficients and the exponent r. In order to illustrate the effectiveness of our results, we solve several examples of families of equations of signatures (p,p,5) and (5, 5, p).
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