Related papers: Irreducible polynomials with prescribed trace and …

Building upon the work of A. Booker and C. Pomerance (2017), we prove that for a prime power $q \geq 7$, every residue class modulo an irreducible polynomial $F \in \mathbb{F}_q[X]$ has a non-constant, square-free representative which has…

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…

Let $f$ be sampled uniformly at random from the set of degree $n$ polynomials whose coefficients lie in $\{ \pm 1\}$. A folklore conjecture, known to hold under GRH, states that the probability that $f$ is irreducible tends to $1$ as $n$…

Let $K$ be a global field and $n > 1$ an integer. We show $n$ is composite if and only if there is an irreducible polynomial $f(x) \in K[x]$ of degree $n$ which is reducible $q$-adically for all the primes $q$ of $K$.

We present a randomized algorithm that on input a finite field $K$ with $q$ elements and a positive integer $d$ outputs a degree $d$ irreducible polynomial in $K[x]$. The running time is $d^{1+\epsilon(d)} \times (\log q)^{5+\epsilon(q)}$…

An irreducible polynomial $f\in\Bbb F_q[X]$ of degree $n$ is {\em normal} over $\Bbb F_q$ if and only if its roots $r, r^q,\dots,r^{q^{n-1}}$ satisfy the condition $\Delta_n(r, r^q,\dots,r^{q^{n-1}})\ne 0$, where…

This paper explores a natural action of the group $\mathrm{PGL}_2(\mathbb F_q)$ on the set of monic irreducible polynomials of degree at least two over a finite field $\mathbb F_q$. Our main results deal with the existence and number of…

Let $\mathbb{F}$ be a field. We show that given any $n$th degree monic polynomial $q(x)\in \mathbb{F}[x]$ and any matrix $A\in\mathbb{M}_n(\mathbb{F})$ whose trace coincides with the trace of $q(x)$ and consisting in its main diagonal of…

Let K be a field of characteristic p>0, and let q be a power of p. We determine all polynomials f in K[t]\K[t^p] of degree q(q-1)/2 such that the Galois group of f(t)-u over K(u) has a transitive normal subgroup isomorphic to PSL_2(q),…

Let $q$ be a prime power and $U$ the group of lower unitriangular matrices of order $n$ for some natural number $n$. We give a lower bound for the degrees of irreducible constituents of Andr\'{e}-Yan supercharacters and classify the…

Given a polynomial $g$ of positive degree over a finite field, we show that the proportion of polynomials of degree $n$, which can be written as $h+g^k$, where $h$ is an irreducible polynomial of degree $n$ and $k$ is a nonnegative integer,…

We generalize an approach from a 1960 paper by Ljunggren, leading to a practical algorithm that determines the set of $N > \operatorname{deg}(c) + \operatorname{deg}(d)$ such that the polynomial $$f_N(x) = x^N c(x^{-1}) + d(x)$$ is…

We give an efficient algorithm to enumerate all sets of $r\ge 1$ quadratic polynomials over a finite field, which remain irreducible under iterations and compositions.

For a rational $q=u+\frac{\alpha}{d}$ with $u, \alpha, d\in \ACOBZ$ with $u\ge 0, 1\le \alpha<d$, $\gcd(\alpha, d)=1$, the \emph{generalized Hermite-Laguerre polynomials $G_q(x)$} are defined by \begin{align*} G_q(x)&=a_nx^n+a_{n-1}(\alpha…

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…

Motivated by a question of van der Poorten about the existence of infinite chain of prime numbers (with respect to some base), in this paper we advance the study of sequences of consecutive polynomials whose coefficients are chosen…

We present an efficient deterministic algorithm which outputs exact expressions in terms of $n$ for the number of monic degree $n$ irreducible polynomials over $\mathbb{F}_{q}$ of characteristic $p$ for which the first $l < p$ coefficients…

We obtain an upper bound on the number of extended irreducible q-ary Goppa codes of degree $r$ and length $q^n+1$, where $q=p^t$ and $n$ and $r>2$ are prime numbers.

A polynomial f (multivariate over a field) is decomposable if f = g(h) with g univariate of degree at least 2. We determine the dimension (over an algebraically closed field) of the set of decomposables, and an approximation to their number…

In this paper, we obtain several new factorization results for certain classes of polynomials having integer coefficients. In doing so, we use the information about prime factorization of the value taken up by such polynomials and their…