Related papers: Monogenic fields arising from trinomials

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…

Let $f(q)=a_rq^r+\cdots+a_sq^s$, with $a_r\neq 0$ and $a_s\neq 0$, be a real polynomial. It is a palindromic polynomial of darga $n$ if $r+s=n$ and $a_{r+i}=a_{s-i}$ for all $i$. Polynomials of darga $n$ form a linear subspace…

We show that for every subset $E$ of positive density in the set of integer square-matrices with zero traces, there exists an integer $k \geq 1$ such that the set of characteristic polynomials of matrices in $E-E$ contains the set of…

For the finite field $\mathbb{F}_{2^{3m}}$, permutation polynomials of the form $(x^{2^m}+x+\delta)^{s}+cx$ are studied. Necessary and sufficient conditions are given for the polynomials to be permutation polynomials. For this, the…

We introduce a new family of multiple orthogonal polynomials satisfying orthogonality conditions with respect to two weights $(w_1,w_2)$ on the positive real line, with $w_1(x)=x^\alpha e^{-x}$ the gamma density and $w_2(x) = x^\alpha…

In this article, we prove some factorization results for several classes of polynomials having integer coefficients, which in particular yield several classes of irreducible polynomials. Such classes of polynomials are devised by imposing…

We consider the set $\Pi ^*_d$ of monic polynomials $Q_d=x^d+\sum _{j=0}^{d-1}a_jx^j$, $x\in \mathbb{R}$, $a_j\in \mathbb{R}^*$, having $d$ distinct real roots, and its subsets defined by fixing the signs of the coefficients $a_j$. We show…

Given any fixed integer $q\ge 2$, a $q$-monomial is of the format $\displaystyle x^{s_1}_{i_1}x^{s_2}_{i_2}...x_{i_t}^{s_t}$ such that $1\le s_j \le q-1$, $1\le j \le t$. $q$-monomials are natural generalizations of multilinear monomials.…

Multiplicative relations between the roots of a polynomial in $\mathbb{Q}[x]$ have drawn much attention in the field of arithmetic and algebra, while the problem of computing these relations is interesting to researchers in many other…

A polynomial is said to be unimodal if its coefficients are non-decreasing and then non-increasing. The domination polynomial of a graph $G$ is the generating function of the number of domination sets of each cardinality in $G$, and its…

A real univariate polynomial of degree $n$ is called hyperbolic if all of its $n$ roots are on the real line. Such polynomials appear quite naturally in different applications, for example, in combinatorics and optimization. The focus of…

We provide simple criteria and algorithms for expressing homogeneous polynomials as sums of powers of independent linear forms, or equivalently, for decomposing symmetric tensors into sums of rank-1 symmetric tensors of linearly independent…

We identify pairs of positive integers $(t, d)$ with the property that the integer sequence with general term $\lfloor{n^t/d\rfloor}$ contains at most finitely many primes.

We raise a question on the existence of continuous roots of families of monic polynomials (by the root of a family of polynomials we mean a function of the coefficients of polynomials of a given family that maps each tuple of coefficients…

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…

Let $X$ be an algebraic variety over a finite field $\bF_q$, homogeneous under a linear algebraic group. We show that the number of rational points of $X$ over $\bF_{q^n}$ is a periodic polynomial function of $q^n$ with integer…

Until recently, the only known method of finding the roots of polynomials over prime power rings, other than fields, was brute force. One reason for this is the lack of a division algorithm, obstructing the use of greatest common divisors.…

For any integer n >= 2 and any nonnegative integers r,s with r+2s = n, we give an unconditional construction of infinitely many monic irreducible polynomials of degree n with integer coefficients having squarefree discriminant and exactly r…

A homogeneous set of monomials in a quotient of the polynomial ring $S:=F[x_1, \..., x_n]$ is called Gotzmann if the size of this set grows minimally when multiplied with the variables. We note that Gotzmann sets in the quotient $R:=F[x_1,…

Given $H\subseteq \mathbb{C}$ two natural objects to study are the set of zeros of polynomials with coefficients in $H$, $$\{z\in \mathbb{C}: \exists k>0,\, \exists (a_n)\in H^{k+1}, \sum_{n=0}^{k}a_{n}z^n=0\},$$ and the set of zeros of…