Related papers: A New Class of Irreducible Polynomials

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…

We study several related problems on polynomials with integer coefficients. This includes the integer Chebyshev problem, and the Schur problems on means of algebraic numbers. We also discuss interesting applications to approximation by…

We obtain upper bounds, independent of the ambient dimension, for the number of realizable zero-nonzero patterns and (over ordered fields) sign conditions of a finite family of polynomials $\mathcal P$ restricted to an algebraic subset $V$…

Locating the zeros of quaternionic polynomials is a fundamental problem with significant implications across scientific and engineering disciplines, yet the noncommutative nature of quaternion multiplication makes it fundamentally more…

We construct many irreducible polynomials within semigroups generated by sets of the form $S=\{x^2+c_1,\dots,x^2+c_s\}$ under composition.

The goal of this note is to bring attention to an interesting family of rings: the rings of $\mathbb Z$-valued functions on $\mathbb Z$ and, more generally, infinite subsets of $\mathbb Z$ whose restrictions to all finite sets are given by…

Let $X$ be a (real or complex) infinite dimensional linear space. We establish conditions on a homogeneous polynomial $P$ on $X$ so that, if $W$ is any finite dimensional subspace of $X$ on which $P$ vanishes, then $P$ vanishes on an…

We generalise a necessary and sufficient condition given by Cohn for all the zeros of a self-inversive polynomial to be on the unit circle. Our theorem implies some sufficient conditions found by Lakatos, Losonczi and Schinzel. We apply our…

We study polynomials with integer coefficients which become Eisenstein polynomials after the additive shift of a variable. We call such polynomials shifted Eisenstein polynomials. We determine an upper bound on the maximum shift that is…

The famous irreducibility criteria of Sch\"onemann-Eisenstein and Dumas rely on information on the divisibility of the coefficients of a polynomial by a single prime number. In this paper we provide several irreducibility criteria of…

Let $P(T,X)$ be an irreducible polynomial in two variables with rational coefficients. It follows from Hilbert's Irreducibility Theorem that for most rational numbers $t$ the specialized polynomial $P(t,X)$ is irreducible and has the same…

We propose an algorithm for determining the irreducible polynomials over finite fields, based on the use of the companion matrix of polynomials and the generalized Jordan normal form of square matrices.

This note is an introduction to the properties of stable polynomials in several variables with real or complex coefficients. These polynomials are defined in terms of where the polynomial is non-vanishing. We do not cover well-known topics…

We establish a necessary and sufficient condition for all zeros of a self-reciprocal polynomial to lie on the unit circle. Moreover, we relate the necessary and sufficient condition with a canonical system of linear differential equations…

Irreducible decompositions of monomial ideals in polynomial rings over a field are well-understood. In this paper, we investigate decompositions in the set of monomial ideals in the semigroup ring A[\mathbb{R}_{\geq 0}^d] where A is an…

Let $f$ and $g$ be Weierstrass polynomials with coefficients in the ring of formal power series over an algebraically closed field of characteristic zero. Assume that $f$ is irreducible and quasi-ordinary. We show that if degree of $g$ is…

We study the class of univariate polynomials $\beta_k(X)$, introduced by Carlitz, with coefficients in the algebraic function field $\mathbb F_q(t)$ over the finite field $\mathbb F_q$ with $q$ elements. It is implicit in the work of…

We classify, according to their computational complexity, integer optimization problems whose constraints and objective functions are polynomials with integer coefficients and the number of variables is fixed. For the optimization of an…

A polynomial with coefficients in the ring of integers $\mathcal{O}_{K}$ of a global field $K$ is called intersective if it has a root modulo every finite-indexed subgroup of $\mathcal{O}_{K}$. We prove two criteria for a polynomial…

Recently the problem of constructing a perfect Euler cuboid was related with three conjectures asserting the irreducibility of some certain three polynomials depending on integer parameters. In this paper a partial result toward proving the…