Related papers: Constructing irreducible polynomials recursively w…

We identify a recursive structure among factorizations of polynomial values into two integer factors. Polynomials for which this recursive structure characterizes all non-trivial representations of integer factorizations of the polynomial…

Let g be a complex reductive Lie algebra and U(g) the universal enveloping algebra of g. Associated to a faithful irreducible finite dimensional representation of g, a square matrix F with entries in U(g) naturally arises and if we consider…

In this paper we present an iterative construction of irreducible polynomials over finite fields based upon repeated applications of transforms induced by endomorphisms of odd prime degree of ordinary elliptic curves.

In this paper we discuss the permutational property of polynomials of the form $f(L(x))+k(L(x))\cdot M(x)\in \mathbb F_{q^n}[x]$ over the finite field $\mathbb F_{q^n}$, where $L, M\in \mathbb F_q[x]$ are $q$-linearized polynomials. The…

We construct four new classes of permutation trinomials over the cubic extension of a finite field with even characteristic. Additionally, we explicitly provide the compositional inverse of each class of permutation trinomials in polynomial…

Let $\mathfrak{p}$ be a monic irreducible polynomial in $A:=\mathbb{F}_q[\theta]$, the ring of polynomials in the indeterminate $\theta$ over the finite field $\mathbb{F}_q$, and let $\zeta$ be a root of $\mathfrak{p}$ in an algebraic…

Given an odd prime $q$, a natural number $l$ and non-zero $q$-free integers $a_{1}, a_{2}, \ldots, a_{l}$, none of which are equal to $1$ or $-1$, we give necessary and sufficient conditions for the polynomial $\prod_{j=1}^{l} (x^{q} -…

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…

For a Noetherian local ring (R, m) having a finite residue field of cardinality q, we study the connections between the ideal Z(R) of R[x], which is the set of polynomials that vanish on R, and the ideal Z(m), the polynomials that vanish on…

Call a monic integer polynomial exceptional if it has a root modulo all but a finite number of primes, but does not have an integer root. We classify all irreducible monic integer polynomials $h$ for which there is an irreducible monic…

A method for generating irreducible polynomials of degree n over the finite field GF(2) is proposed. The irreducible polynomials are found by solving a system of equations that brings the information on the internal properties of the…

Jakhar shown that for $f(x)=a_nx^n + a_{n-1}x^{n-1}+\cdot+ a_0$ ($a_0\neq 0$) is a polynomial with rational coefficients, if there exists a prime integer $p$ satisfying $\nu_p(a_n)=0$ and $n\nu_p(a_i)\ge (n-i)\nu_p(a_0)> 0$ for every $0\le…

We show that for any polynomial $f: \mathbb{Z}\to \mathbb{Z}$ with positive leading coefficient and irreducible over $\mathbb{Q}$, if $N$ is large enough then there are two strings of consecutive positive integers $I_{1}=\{n_1-m,\ldots,…

Polynomial multiplication is a fundamental problem in symbolic computation. There are efficient methods for the multiplication of two univariate polynomials. However, there is rarely efficiently nontrivial method for the multiplication of…

Let $\mathbb F_{q^2}$ be the finite field with $q^2$ elements. We provide a simple and effective method, using reciprocal polynomials, for the construction of algebraic curves over $\mathbb F_{q^2}$ with many rational points. The curves…

We focus on the permutation polynomials of the form $L(X)+\Tr_{m}^{3m}(X)^{s}$ over $\F_{q^3}$, where $\F_q$ is the finite field with $q=p^m$ elements, $p$ is a prime number, $m$ is a positive integer, $\Tr_{m}^{3m}$ is the relative trace…

We propose a unified method to construct multicyclic codes of arbitrary dimension $r$ over $\mathbb{F}_q$. The approach relies on $r$-dimensional primitive idempotents defined as tensor products of univariate ones, combined with…

Let $\mathbb{F}_q$ be the finite field with $q$ elements, and $T$ a positive integer. In this article we find a sharp estimative of the total number of monic irreducible binomials in $\mathbb F_q[x]$ of degree less or equal to $T$, when $T$…

Let $\{q_n^{(\alpha,\beta,m)}(x)\}_{n\ge 0}$ be the orthonormal polynomials respect to the Sobolev-type inner product \begin{equation*} \langle f,g\rangle_{\alpha,\beta,m}=\sum_{k=0}^m \int_{-1}^{1}f^{(k)}(x)g^{(k)}(x)\,…

Say a trinomial $x^n+A x^m+B \in \Q[x]$ has reducibility type $(n_1,n_2,...,n_k)$ if there exists a factorization of the trinomial into irreducible polynomials in $\Q[x]$ of degrees $n_1$, $n_2$,...,$n_k$, ordered so that $n_1 \leq n_2 \leq…