Irreducible binary cubics and the generalised superelliptic equation over number fields
From MaRDI portal
Publication:5207280
Abstract: For a large class (heuristically most) of irreducible binary cubic forms , Bennett and Dahmen proved that the generalized superelliptic equation has at most finitely many solutions in coprime, and exponent . Their proof uses, among other ingredients, modularity of certain mod Galois representations and Ribet's level lowering theorem. The aim of this paper is to treat the same problem for binary cubics with coefficients in , the ring of integers of an arbitrary number field , using by now well-documented modularity conjectures.
Recommendations
Cited in
(2)
This page was built for publication: Irreducible binary cubics and the generalised superelliptic equation over number fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5207280)