On Darmon's program for the generalized Fermat equation, I
Nicolas Billerey, Imin Chen, Luis Dieulefait, and Nuno Freitas

TL;DR
This paper advances Darmon's program for the generalized Fermat equation by developing tools to handle modularity issues, leading to new solutions for equations like x^{11} + y^{11} = z^n and reducing complex cases to conjectures.
Contribution
It develops all but the last step of Darmon's modular method for Fermat equations, enabling new Diophantine applications and reducing complex cases to existing conjectures.
Findings
Resolved x^{11} + y^{11} = z^n for certain solutions.
Reduced solving x^5 + y^5 = z^p to Darmon's big image conjecture.
Developed tools to eliminate non-CM Hilbert newforms at the Serre level.
Abstract
In 2000, Darmon described a program to study the generalized Fermat equation using modularity of abelian varieties of -type over totally real fields. The original approach was based on hard open conjectures, which have made it difficult to apply in practice. In this paper, building on the progress surrounding the modular method from the last two decades, we analyze and expand the current limits of this program by developing all the necessary ingredients to use Frey abelian varieties for new Diophantine applications. In particular, we deal with all but the fifth and last step in the modular method for Fermat equations of signature in almost full generality. As an application, for all integers , we give a resolution of the generalized Fermat equation for solutions such that satisfies certain - or -adic…
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
