On the Field Isomorphism Problem for the Family of Simplest Quartic Fields

Deciding whether or not two polynomials have isomoprhic splitting fields over the rationals is the Field Isomorphism Problem. We consider polynomials of the form fₙ(x) = x⁴-nx³-6x²+nx+1 with n ≠ 3 a positive integer and we let Kₙ denote the splitting field of fₙ(x); a `simplest quartic field'. Our main theorem states that under certain hypotheses there can be at most one positive integer m ≠ n such that Kₘ=Kₙ. The proof relies on the existence of squares in recurrent sequences and a result of J.H.E. Cohn [3]. These sequences allow us to establish uniqueness of the splitting field under additional hypotheses in Section (5) and to establish a connection with elliptic curves in Section (6).