Related papers: Factorization of a class of composed polynomials

We give an overview of combinatoric properties of the number of ordered $k$-factorizations $f_k(n,l)$ of an integer, where every factor is greater or equal to $l$. We show that for a large number $k$ of factors, the value of the cumulative…

In this paper, the result of applying iterative univariate resultant constructions to multivariate polynomials is analyzed. We consider the input polynomials as generic polynomials of a given degree and exhibit explicit decompositions into…

Let $k$ be a finite field, and $L$ be a $q$-linearized polynomial defined over $k$ of $q$-degree $r$ ($L=\sum^r_{i=0}a_iZ^{q^i}$, with $a_i\in k$). This paper provides an algorithm to compute a characteristic polynomial of $L$ over a large…

In this article, we consider the polynomials of the form $f(x)=a_0+a_1x+a_2x^2+\cdots+a_nx^n\in \mathbb{Z}[x],$ where $|a_0|=|a_1|+\dots+|a_n|$ and $|a_0|$ is a prime. We show that these polynomials have a cyclotomic factor whenever…

We study the number of irreducible polynomials over $\mathbf{F}_{q}$ with some coefficients prescribed. Using the technique developed by Bourgain, we show that there is an irreducible polynomial of degree $n$ with $r$ coefficients…

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$.

Let GF(q), q=p^r, be a finite field with a primitive element g. In this paper we use exponential sums and Jacobi sums to compute the number of the irreducible polynomials of degree m over GF(q) with trace fixed and norm restricted to a…

Rational transformations of polynomials are extensively studied in the context of finite fields, especially for the construction of irreducible polynomials. In this paper, we consider the factorization of rational transformations with…

A monic polynomial in F_q[t] of degree n over a finite field F_q of odd characteristic can be written as the sum of two irreducible monic elements in F_q[t] of degrees n and n-1 if q is larger than a bound depending only on n. The main tool…

Rings of integer-valued polynomials are known to be atomic, non-factorial rings furnishing examples for both irreducible elements for which all powers factor uniquely (\emph{absolutely irreducibles}) and irreducible elements where some…

Let $f(x) = \sum\limits _{i=0}^{n} a_i x^i $ be a polynomial with coefficients from the ring $\mathbb{Z}$ of integers satisfying either $(i)$ $0 < a_0 \leq a_{1} \leq \cdots \leq a_{k-1} < a_{k} < a_{k+1} \leq \cdots \leq a_n$ for some $k$,…

For any polynomial $P \in \mathbb{C}[X_1,X_2,...,X_n]$, we describe a $\mathbb{C}$-vector space $F(P)$ of solutions of a linear system of equations coming from some algebraic partial differential equations such that the dimension of $F(P)$…

Let $\Bbb F_q$ be a finite field with $q$ elements and $n$ a positive integer. Mart\'inez, Vergara and Oliveira \cite{MVO} explicitly factorized $x^{n} - 1$ over $\Bbb F_q$ under the condition of $rad(n)|(q-1)$. In this paper, suppose that…

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…

In this paper, a randomized algorithm for deciding the irreducibility of an irreducible polynomial and factoring a reducible polynomial over the field of rational numbers is presented. The main idea underlying the algorithm is based on…

In this paper we investigate the factorization behaviour of the binomial polynomials $\binom{x}{n} = \frac{x(x-1)\cdots (x-n+1)}{n!}$ and their powers in the ring of integer-valued polynomials $\operatorname{Int}(\mathbb{Z})$. While it is…

We present the formula for the number of monic irreducible polynomials of degree $n$ over the finite field $\mathbb F_q$ where the coefficients of $x^{n-1}$ and $x$ vanish for $n\ge3$. In particular, we give a relation between rational…

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…

Let $\mathbb{F}_{q}$ be a finite field with $q$ elements and $\mathbb{F}_{q}[x]$ the ring of polynomials over $\mathbb{F}_{q}$. Let $l(x), k(x)$ be coprime polynomials in $\mathbb{F}_{q}[x]$ and $\Phi(k)$ the Euler function in…

We prove that the convolution of a selfdecomposable distribution with its background driving law is again selfdecomposable if and only if the background driving law is s-selfdecomposable. We will refer to this as the factorization property…