Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
GPT-5.1
GPT-5.1 130 tok/s
Gemini 3.0 Pro 29 tok/s Pro
Gemini 2.5 Flash 145 tok/s Pro
Kimi K2 191 tok/s Pro
Claude Sonnet 4.5 34 tok/s Pro
2000 character limit reached

On the Field Isomorphism Problem for the Family of Simplest Quartic Fields (2406.10414v1)

Published 14 Jun 2024 in math.NT

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

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

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

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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