Table of Contents
Fetching ...

Arithmetic Aspects of Number Fields Generated by Polynomial Families

Rupam Barman, Anuj Jakhar, Ravi Kalwaniya, Prabhakar Yadav

Abstract

Let $f(x)=(x^{k}+c)^{m}-ax^{n}\in\mathbb{Z}[x]$ be an irreducible polynomial over $\mathbb{Q}$, where $k,m,n\in\mathbb{N}$ with $km>n$, and let $K=\mathbb{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.

Arithmetic Aspects of Number Fields Generated by Polynomial Families

Abstract

Let be an irreducible polynomial over , where with , and let , where is a root of . We investigate the arithmetic properties of the number fields that arise from this family. We first obtain an explicit formula for the discriminant of . Using this formula, we establish necessary and sufficient conditions for the monogeneity of , expressed in terms of the prime divisors of and and the parameters . 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 with an arbitrary polynomial . 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 and, for each prime , provide sufficient conditions ensuring , yielding partial progress toward a problem of Narkiewicz. We also highlight a connection with a class of differential equations naturally associated with . As an application, we determine the conditions under which the splitting field of has a full symmetric Galois group. Several explicit examples illustrate our results.
Paper Structure (10 sections, 26 theorems, 108 equations, 1 figure, 2 tables)

This paper contains 10 sections, 26 theorems, 108 equations, 1 figure, 2 tables.

Key Result

Theorem 2.1

Let $a,c \in \mathbb{Z}$ with $c \neq 0$, and let $m,n,k \in \mathbb{N}$ with $km>n$. Suppose that the polynomial $f(x) = (x^k + c)^m - a x^n \in \mathbb{Z}[x]$ is irreducible over $\mathbb{Z}$ and let $\theta$ be a root of $f(x)$. Then where $n = n_1 t$, $k = k_1 t$ and $t=\gcd(n,k)$.

Figures (1)

  • Figure 1: Newton polygon of $f(x)$ with respect to $p$

Theorems & Definitions (50)

  • Theorem 2.1
  • Theorem 2.2
  • Corollary 2.3
  • Definition 2.4
  • Corollary 2.5
  • Definition 2.6
  • Theorem 2.7
  • Theorem 2.8
  • Theorem 2.9
  • Theorem 2.10
  • ...and 40 more