# Twists of X(7) and primitive solutions to x^2+y^3=z^7

@article{Poonen2005TwistsOX,
title={Twists of X(7) and primitive solutions to x^2+y^3=z^7},
author={Bjorn Poonen and Edward F. Schaefer and Michael Stoll},
journal={Duke Mathematical Journal},
year={2005},
volume={137},
pages={103-158}
}
• Published 10 August 2005
• Mathematics
• Duke Mathematical Journal
We find the primitive integer solutions to x^2+y^3=z^7. A nonabelian descent argument involving the simple group of order 168 reduces the problem to the determination of the set of rational points on a finite set of twists of the Klein quartic curve X. To restrict the set of relevant twists, we exploit the isomorphism between X and the modular curve X(7), and use modularity of elliptic curves and level lowering. This leaves 10 genus-3 curves, whose rational points are found by a combination of…

### On families of 7- and 11-congruent elliptic curves

We use an invariant-theoretic method to compute certain twists of the modular curves X(n) for n = 7, 11. Searching for rational points on these twists enables us to find non-trivial pairs of

### On the Fermat-type Equation $x^3 + y^3 = z^p$

We prove that the Fermat-type equation $x^3 + y^3 = z^p$ has no solutions $(a,b,c)$ satisfying $abc \ne 0$ and $\gcd(a,b,c)=1$ when $-3$ is not a square mod~$p$. This improves to approximately

### Partial descent on hyperelliptic curves and the generalized Fermat equation x3+y4+z5=0

• Mathematics
• 2011
Let C: y2=f(x) be a hyperelliptic curve defined over ℚ. Let K be a number field and suppose f factors over K as a product of irreducible polynomials f=f1 f2 … fr. We shall define a ‘Selmer set’

### Sato–Tate distributions of twists of the Fermat and the Klein quartics

• Mathematics
Research in the Mathematical Sciences
• 2018
We determine the limiting distribution of the normalized Euler factors of an abelian threefold A defined over a number field k when A is $${\overline{\mathbb Q}}$$Q¯-isogenous to the cube of a CM

### A REFINED MODULAR APPROACH TO THE DIOPHANTINE

Let n be a positive integer and consider the Diophantine equation of generalized Fermat type x2 + y2n = z3 in nonzero coprime integer unknowns x, y, z. Using methods of modular forms and Galois

### Smooth solutions to the abc equation: the xyz Conjecture

• Mathematics
• 2009
This paper studies integer solutions to the ABC equation A+B+C=0 in which none of A, B, C has a large prime factor. Set H(A,B, C)= max(|A|,|B|,|C|) and set the smoothness S(A, B, C) to be the largest

### Perfect powers expressible as sums of two fifth or seventh powers

• Mathematics
• 2013
We show that the generalized Fermat equations with signatures (5,5,7), (5,5,19), and (7,7,5) (and unit coefficients) have no non-trivial primitive integer solutions. Assuming GRH, we also prove the

### A refined modular approach to the Diophantine equation $x^2+y^{2n}=z^3$

Let $n$ be a positive integer and consider the Diophantine equation of generalized Fermat type $x^2+y^{2n}=z^3$ in nonzero coprime integer unknowns $x,y,z$. Using methods of modular forms and Galois

### Twists of non-hyperelliptic curves

A method for computing the set of twists of a non-singular projective curve defined over an arbitrary (perfect) field $k$ based on a correspondence between twists and solutions to a Galois embedding problem.