Irreducible binary cubics and the generalized superelliptic equation over number fields

Abstract

For a large class (heuristically most) of irreducible binary cubic forms F(x,y) ∈ Z[x,y], Bennett and Dahmen proved that the generalized superelliptic equation F(x,y)=zl has at most finitely many solutions in x,y ∈ Z coprime, z ∈ Z and exponent l ∈ Z≥ 4 . Their proof uses, among other ingredients, modularity of certain mod l 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 OK, the ring of integers of an arbitrary number field K, using by now well-documented modularity conjectures.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…