On the Field Isomorphism Problem for the Family of Simplest Quartic Fields
Abstract
Deciding whether or not two polynomials have isomoprhic splitting fields over the rationals is the Field Isomorphism Problem. We consider polynomials of the form fn(x) = x4-nx3-6x2+nx+1 with n ≠ 3 a positive integer and we let Kn denote the splitting field of fn(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 Km=Kn. 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).
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.