Related papers: Arithmetic Aspects of Number Fields Generated by P…

Let $f(x)=x^{2p}+ax^p+b^p$, where $p$ is a prime and $a,b\in {\mathbb Z}$ with $ab\ne 0$. If $f(x)$ is irreducible over ${\mathbb Q}$, we say that $f(x)$ is monogenic if $\{1,\theta,\theta^2,\ldots ,\theta^{2p-1}\}$ is a basis for the ring…

We consider the family of polynomials $f_{d,c}(x)=x^d+c$ over the rational field $\Q$. Fixing integers $d, n\ge 2$, we show that the density of primes that can appear as primitive prime divisors of $f_{d,c}^n(0)$ for some $c\in\Q$ is…

For each integer $n\ge 2$, we identify new infinite families of monogenic trinomials $f(x)=x^n+Ax^m+B$ with non-squarefree discriminant, many of which have small Galois group. These families are thus different from many previous…

It is a classical problem in algebraic number theory to decide if a number field is monogeneous, that is if it admits power integral bases. It is especially interesting to consider this question in an infinite parametric familiy of number…

A monogenic polynomial $f$ is a monic irreducible polynomial with integer coefficients which produces a monogenic number field. For a given prime $q$, using the Chebotarev density theorem, we will show the density of primes $p$, such that…

Let $K$ be a pure number field generated by a complex root of a monic irreducible polynomial $F(x)=x^{60}-m\in \mathbb{Z}[x]$, with $m\neq \pm1$ a square free integer. In this paper, we study the monogeneity of $K$. We prove that if…

Let $K$ be a number field. Given a polynomial $f(x)\in K[x]$ of degree $d\ge 2$, it is conjectured that the number of preperiodic points of $f$ is bounded by a uniform bound that depends only on $d$ and $[K:\mathbb Q]$. However, the only…

We say that a monic polynomial $f(x)\in {\mathbb Z}[x]$ of degree $N$ is monogenic if $f(x)$ is irreducible over ${\mathbb Q}$ and $\{1,\theta,\theta^2,\ldots ,\theta^{N-1}\}$ is a basis for ${\mathbb Z}_K$, the ring of integers of…

Let $f(x)$ be a monic polynomial in $\dZ[x]$ with no rational roots but with roots in $\dQ_p$ for all $p$, or equivalently, with roots mod $n$ for all $n$. It is known that $f(x)$ cannot be irreducible but can be a product of two or more…

The main goal of this paper is to provide a complete answer to the Problem 22 of Narkiewicz \cite{Nar} for any sextic number field $K$ generated by a complex root $\alpha$ of a monic irreducible trinomial $F(x) = x^6+ax^5+b \in…

Using the action of the Galois group of a normal extension of number fields, we generalize and symmetrize various fundamental statements in algebra and algebraic number theory concerning splitting types of prime ideals, factorization types…

To study a Dirichlet polynomial $f(s)=\frac{a_{m}}{m^{s}}+\cdots +\frac{a_{n}}{n^{s}}$ by regarding it as a multivariate polynomial via the canonical map $\phi$ sending $p_i^{-s}$ to an indeterminate $X_i$, with $p_i$ the $i$th prime…

Let $K = \mathbb{Q} (\alpha) $ be a pure number field generated by a complex root $\alpha$ a monic irreducible polynomial $ F(x) = x^{p^r} -m$, with $ m \neq 1 $ is a square free rational integer, $p$ is a rational prime integer, and $r$ is…

For a suitable irreducible \textit{base} polynomial $f(x)\in \mathbf{Z}[x]$ of degree $k$, a family of polynomials $F_m(x)$ depending on $f(x)$ is constructed with the properties: (i) there is exactly one irreducible factor $\Phi_{d,f}(x)$…

We give a method of constructing polynomials of arbitrarily large degree irreducible over a global field F but reducible modulo every prime of F. The method consists of finding quadratic f in F[x] whose iterates have the desired property,…

Let $K = \mathbb{Q} (\alpha) $ be a pure number field generated by a complex root $\alpha$ of a monic irreducible polynomial $ F(x) = x^{2^u\cdot 3^v}-m$, with $m \neq \pm 1$ a square free rational integer, $u$, and $v$ two positive…

We consider the class of polynomial optimization problems $\inf \{f(x):x\in K\}$ for which the quadratic module generated by the polynomials that define $K$ and the polynomial $c-f$ (for some scalar $c$) is Archimedean. For such problems,…

Linearized polynomials appear in many different contexts, such as rank metric codes, cryptography and linear sets, and the main issue regards the characterization of the number of roots from their coefficients. Results of this type have…

In all available papers, on power integral bases of pure octic number fields $K$, generated by a root $\alpha$ of a monic irreducible polynomial $f(x)=x^8-m\in\mathbf Z[x]$, it was assumed that $m\neq \pm 1$ is square free. In this paper,…

Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…