Monogenic Fields from Polynomial Compositions with Applications
Abstract
A number field K is called monogenic if its ring of integers ZK can be expressed as a simple ring extension Z[α] for some α ∈ ZK. A monic irreducible polynomial f(x)∈Z[x] is said to be monogenic if one of its roots generates both the number field and its ring of integers. In this article, we establish the necessary and sufficient conditions for [ZKi:Z[αi]]=1, where Ki=Q(αi) and αi is a root of the composed polynomial fi(xk+b) for i=1,2. Here, f1(x)=xn+cΣj=1n(ax)n-j∈Z[x] and f2(x)=xn+cΣj=1naj-1xn-j∈Z[x] are irreducible polynomials of degree n 3. In addition, we derive asymptotic estimates for the number of monogenic polynomials in these families under natural assumptions. As an application of our main results, we construct a class of polynomials with non-square-free discriminants. We also analyze the behavior of solutions to certain related differential equations.
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.