English

Effective Darmon's program for the generalised Fermat equation

Number Theory 2025-07-04 v2

Abstract

We follow the ideas of Darmon's program for solving infinite families of generalised Fermat equations of signatures (p,p,r)(p,p,r) and (r,r,p)(r,r,p), where, rr is a fixed prime and pp 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 22-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 rr. In order to illustrate the effectiveness of our results, we solve several examples of families of equations of signatures (p,p,5)(p,p,5) and (5,5,p)(5, 5, p).

Cite

@article{arxiv.2504.01967,
  title  = {Effective Darmon's program for the generalised Fermat equation},
  author = {Martin Azon},
  journal= {arXiv preprint arXiv:2504.01967},
  year   = {2025}
}

Comments

60 pages, fixed typos and turned the previous code into a Magma package. Comments are welcome!

R2 v1 2026-06-28T22:44:16.993Z