Arithmetic Aspects of Number Fields Generated by Polynomial Families

Abstract

Let f(x)=(xk+c)m-axn∈Z[x] be an irreducible polynomial over Q, where k,m,n∈N with km>n, and let K=Q(θ), where θ is a root of f(x). We investigate the arithmetic properties of the number fields that arise from this family. We first obtain an explicit formula for the discriminant of f(x). Using this formula, we establish necessary and sufficient conditions for the monogeneity of f(x), expressed in terms of the prime divisors of a and c and the parameters k,m,n. This yields infinite families of monogenic polynomials of arbitrary degree, including families with a non-square-free discriminant. Building on these results, we extend our algebraic characterization to composite polynomials, establishing some explicit conditions for the monogeneity of the composition of f(x) with an arbitrary polynomial g(x). From an analytic point of view, we derive asymptotic estimates for the number of monogenic polynomials in these families under natural assumptions. We further study non-monogeneity via the field index i(K) and, for each prime p, provide sufficient conditions ensuring p(i(K))=1, yielding partial progress toward a problem of Narkiewicz. We also highlight a connection with a class of differential equations naturally associated with f(x). As an application, we determine the conditions under which the splitting field of f(x) has a full symmetric Galois group. Several explicit examples illustrate our results.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…