Related papers: A study of some recent irreducibility criteria for…
In this article we study asymptotic behavior of the probability that a random monic polynomial with integer coefficients is irreducible over the integers. We consider the cases where the coefficients grow together with the degree of the…
In this paper, we study properties of polynomials over division rings. Moreover, we present formulas for finding roots of some polynomials
The goal of this paper is to prove that a random polynomial with i.i.d. random coefficients taking values uniformly in $\{1,\ldots, 210\}$ is irreducible with probability tending to $1$ as the degree tends to infinity. Moreover, we prove…
The ring of integer-valued polynomials over a given subset $S$ of $\Z$ (or $ \mathrm{Int}(S,\Z ))$ is defined as the set of polynomials in $\Q[x]$ which maps $S$ to $\Z$. In factorization theory, it is crucial to check the irreducibility of…
We continue our study on counting irreducible polynomials over a finite field with prescribed coefficients. We set up a general combinatorial framework using generating functions with coefficients from a group algebra which is generated by…
In this article we study the irreducibility of polynomials of the form $x^n+\epsilon_1 x^m+p^k\epsilon_2$, $p$ being a prime number. We will show that they are irreducible for $m=1$. We have also provided the cyclotomic factors and…
The following result, a consequence of Dumas criterion for irreducibility of polynomials over integers, is generally proved using the notion of Newton diagram: Let $f(x)$ be a polynomial with integer coefficients and $k$ be a positive…
We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results are expressed in terms of a generating series, an exact formula and an asymptotic approximation. We also consider the…
In this paper we consider in detail the composition of an irreducible polynomial with X^2 and suggest a recurrent construction of irreducible polynomials of fixed degree over finite fields of odd characteristics. More precisely, given an…
We consider the question of certifying that a polynomial in ${\mathbb Z}[x]$ or ${\mathbb Q}[x]$ is irreducible. Knowing that a polynomial is irreducible lets us recognise that a quotient ring is actually a field extension (equiv.~that a…
A sequence of coefficients that appeared in the evaluation of a rational integral has been shown to be unimodal. An alternative proof is presented.
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…
It is known that random monic integral polynomials of bounded degree $d$ and integral coefficients distributed uniformly and independently in $[-H,H]$ are irreducible over $\mathbb{Z}$ with probability tending to $1$ as $H\to \infty$. In…
This is a complement to our paper arXiv:0802.1461. We study irreducibility of spectral determinants of some one-parametric eigenvalue problems in dimension one with polynomial potentials.
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.
We provide upper bounds on the total number of irreducible factors, and in particular irreducibility criteria for some classes of bivariate polynomials $f(x,y)$ over an arbitrary field $\mathbb{K}$. Our results rely on information on the…
If K/k is a function field in one variable of positive characteristic, we describe a general algorithm to factor one-variable polynomials with coefficients in K. The algorithm is flexible enough to find factors subject to additional…
In this paper, we give error bounds on the number of monic irreducible polynomials $a_0+a_1x+\dots+a_{n-1}x^{n-1}+x^n$ over a finite field $\mathbb{F}_q$ of degree $n$ with $(a_0, a_1, \dots, a_{n-1}, 1)$ lying in a fixed affine algebraic…
In this paper, we give some counting results on integer polynomials of fixed degree and bounded height whose distinct non-zero roots are multiplicatively dependent. These include sharp lower bounds, upper bounds and asymptotic formulas for…
We establish new results on root separation of integer, irreducible polynomials of degree at least four. These improve earlier bounds of Bugeaud and Mignotte (for even degree) and of Beresnevich, Bernik, and Goetze (for odd degree).