Related papers: Polynomial factorization over henselian fields

We study the explicit factorization of $2^n r$-th cyclotomic polynomials over finite field $\mathbb{F}_q$ where $q, r$ are odd with $(r, q) =1$. We show that all irreducible factors of $2^n r$-th cyclotomic polynomials can be obtained…

For a field $K$, and a root $\alpha$ of an irreducible polynomial over $K$ (in some algebraic closure) the number of roots of $f(x)$ lying in $K(\alpha)$ is studied here. Given such an $f(x)$ of degree $n$ for which $r$ of the roots are i n…

Polynomial factorization and root finding are among the most standard themes of computational mathematics. Yet still, little has been done for polynomials over quaternion algebras, with the single exception of Hamiltonian quaternions for…

We classify the pairs of polynomials $f,g$ over a field $K$, such that $f(X)-g(Y)$ has a factor of total degree at most 2. This was done by Y. Bilu for characteristic 0 fields $K$. As his method does not work in positive characteristic, we…

Let $(K,v)$ be a discrete valued field with valuation ring $\oo$, and let $\oo_v$ be the completion of $\oo$ with respect to the $v$-adic topology. In this paper we discuss the advantages of manipulating polynomials in $\oo_v[x]$ in a…

We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible…

Let $D$ be a Krull domain admitting a prime element with finite residue field and let $K$ be its quotient field. We show that for all positive integers $k$ and $1 < n_1 \leq \ldots \leq n_k$ there exists an integer-valued polynomial on $D$,…

We obtain various irreducibility criteria for pairs of polynomials $(f(X),g(X))$ with integer coefficients whose resultant $Res(f,g)$ is a prime number, or is divisible by a sufficiently large prime number, and also for some of their linear…

This article deals with the computation of the characteristic polynomial of dense matrices over small finite fields and over the integers. We first present two algorithms for the finite fields: one is based on Krylov iterates and Gaussian…

This paper addresses the factorization of polynomials of the form $F(x) = f_{0}(x) + f_{1}(x) x^{n} + \cdots + f_{r-1}(x) x^{(r-1)n} + f_{r}(x) x^{rn}$ where $r$ is a fixed positive integer and the $f_{j}(x)$ are fixed polynomials in…

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.

Let $f(x)\in \mathbb{F}_q[x]$ be an irreducible polynomial of degree $m$ and exponent $e$, and $n$ be a positive integer such that $\nu_p(q-1)\ge \nu_{p}(e)+\nu_p(n)$ for all $p$ prime divisor of $n$. We show a fast algorithm to determine…

This article is a natural construction of our previous works. In this article, we employ similar ideas due to MacLane to provide an estimate of IC(K(X)|K,v) when (K(X)|K,v) is a valuation algebraic extension. Our central result is an…

It has been recently discovered by Bell, Heinle and Levandovskyy that a large class of algebras, including the ubiquitous $G$-algebras, are finite factorization domains (FFD for short). Utilizing this result, we contribute an algorithm to…

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…

We show that the effective factorization of Ore polynomials over $\mathbb{F}_q(t)$ is still an open problem. This is so because the known algorithm in [1] presents two gaps, and therefore it does not cover all the examples. We amend one of…

Let $\tilde{f}(X)\in\mathbb{Z}[X]$ be a degree-$n$ polynomial such that $f(X):=\tilde{f}(X)\bmod p$ factorizes into $n$ distinct linear factors over $\mathbb{F}_p$. We study the problem of deterministically factoring $f(X)$ over…

Let $f(T)$ be a monic polynomial of degree $d$ with coefficients in a finite field $\mathbb{F}_q$. Extending earlier results in the literature, but now allowing $(q,2d)>1$, we give a criterion for $f$ to satisfy the following property: for…

In this paper we give an introduction on how one can extend a valuation from a field $K$ to the polynomial ring $K[x]$ in one variable over $K$. This follows a similar line as the one presented by the author in his talk at ALaNT 5. We will…

We consider polynomials with integer coefficients and discuss their factorization properties in Z[[x]], the ring of formal power series over Z. We treat polynomials of arbitrary degree and give sufficient conditions for their reducibility…