Elkies trinomial curves
In number theory, the Elkies trinomial curves are certain hyperelliptic curves constructed by Noam Elkies which have the property that rational points on them correspond to trinomial polynomials giving an extension of Q with particular Galois groups.
One curve, C168, gives Galois group PSL(2,7) from a polynomial of degree seven, and the other, C1344, gives Galois group AL(8), the semidirect product of a 2-elementary group of order eight acted on by PSL(2, 7), giving a transitive permutation subgroup of the symmetric group on eight roots of order 1344.
The equation of the curve C168 is
The curve is a plane algebraic curve model for a Galois resolvent for the trinomial polynomial equation x7 + bx + c = 0. If there exists a point (x, y) on the (projectivized) curve, there is a corresponding pair (b, c) of rational numbers, such that the trinomial polynomial either factors or has Galois group PSL(2,7), the finite simple group of order 168. The curve has genus two, and so by Faltings theorem there are only a finite number of rational points on it. These rational points were proven by Nils Bruin using the computer program Kash to be the only ones on C168, and they give only four distinct trinomial polynomials with Galois group PSL(2,7): x7-7x+3 (the Trinks polynomial), (1/11)x7-14x+32 (the Erbach-Fisher-McKay polynomial) and two new polynomials with Galois group PSL(2,7),
On the other hand, the equation of curve C1344 is
Once again the genus is two, and by Faltings theorem the list of rational points is finite. It is thought the only rational points on it correspond to polynomials x8+16x+28, x8+576x+1008, 19453x8+19x+2 which have Galois group AL(8), and x8+324x+567, which comes from two different rational points and has Galois group PSL(2, 7) again, this time as the Galois group of a polynomial of degree eight.
- Bruin, Nils; Elkies, Noam (2002). "Trinomials ax7+bx+c and ax8+bx+c with Galois Groups of Order 168 and 8⋅168". Algorithmic Number Theory: 5th International Symposium, ANTS-V. Lecture Notes in Computer Science, vol. 2369, Springer-Verlag. pp. 172–188. MR 2041082.