Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 14 Jun 2024 in math.NT | (2406.10414v1)

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 $f_n(x) = x4-nx3-6x2+nx+1$ with $n \neq 3$ a positive integer and we let $K_n$ denote the splitting field of $f_n(x)$; a `simplest quartic field'. Our main theorem states that under certain hypotheses there can be at most one positive integer $m \neq n$ such that $K_m=K_n$. 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).

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.