相关论文: Factorization of Polynomials over the Field of Rat…

We give an algorithm for factoring quadratic polynomials over any UFD, Z in particular. We prove the correctness of this algorithm and give examples over Z and Z[i].

Polynomial factorization in conventional sense is an ill-posed problem due to its discontinuity with respect to coefficient perturbations, making it a challenge for numerical computation using empirical data. As a regularization, this paper…

In this article, we consider polynomials of the form $f(x)=a_0+a_{n_1}x^{n_1}+a_{n_2}x^{n_2}+\dots+a_{n_r}x^{n_r}\in \mathbb{Z}[x],$ where $|a_0|\ge |a_{n_1}|+\dots+|a_{n_r}|,$ $|a_0|$ is a prime power and $|a_0|\nmid |a_{n_1}a_{n_r}|$. We…

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…

Let $R(x)=g(x)/h(x)$ be a rational expression of degree three over the finite field $\mathbb{F}_q$. We count the irreducible polynomials in $\mathbb{F}_q[x]$, of a given degree, which have the form $h(x)^{\mathrm{deg}\, f}\cdot…

We present an algorithm for computing a Smith form with multipliers of a regular matrix polynomial over a field. This algorithm differs from previous ones in that it computes a local Smith form for each irreducible factor in the determinant…

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…

Given a valued field $(K,v)$ and an irreducible polynomial $g\in K[x]$, we survey the ideas of Ore, Maclane, Okutsu, Montes, Vaqui\'e and Herrera-Olalla-Mahboub-Spivakovsky, leading (under certain conditions) to an algorithm to find the…

New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…

Numerous results on self-reciprocal polynomials over finite fields have been studied. In this paper we generalize some of these to a-self reciprocal polynomials defined in [4]. We consider some properties of the divisibility of a-reciprocal…

A key property of an algebraic variety is whether it is absolutely irreducible, meaning that it remains irreducible over the algebraic closure of its defining field, and determining absolute irreducibility is important in algebraic geometry…

In this paper we propose a novel efficient algorithm for calculating winding numbers, aiming at counting the number of roots of a given polynomial in a convex region on the complex plane. This algorithm can be used for counting and…

We study two important operations on polynomials defined over complete discrete valuation fields: Euclidean division and factorization. In particular, we design a simple and efficient algorithm for computing slope factorizations, based on…

Given a prime power $q$ and positive integers $m,t,e$ with $e > mt/2$, we determine the number of all monic irreducible polynomials $f(x)$ of degree $m$ with coefficients in $\mathbb{F}_q$ such that $f(x^t)$ contains an irreducible factor…

In this paper we give a factorization theorem for the ring of exponential polynomials in many variables over an algebraically closed field of characteristic 0 with an exponentiation. This is a generalization of the factorization theorem due…

We present a polynomial-time pseudo-deterministic algorithm for constructing irreducible polynomial of degree $d$ over finite field $\mathbb{F}_q$. A pseudo-deterministic algorithm is allowed to use randomness, but with high probability it…

Motivated by the question of whether a random polynomial with integer coefficients is likely to be irreducible, we study the probability that a monic polynomial with integer coefficients has a low-degree factor over the integers, which is…

We show that the counts of low degree irreducible factors of a random polynomial $f$ over $\mathbb{F}_q$ with independent but non-uniform coefficients behave like that of a uniform random polynomial, exhibiting a form of universality for…

Let $f(X,Y) \in \ZZ[X,Y]$ be an irreducible polynomial over $\QQ$. We give a Las Vegas absolute irreducibility test based on a property of the Newton polytope of $f$, or more precisely, of $f$ modulo some prime integer $p$. The same idea of…

Let $\S $ be an arbitrary subset of $R^n$ where $R$ is a domain with the field of fractions $\K$. Denote the ring of polynomials in $n$ variables over $\K$ by $\K[\x].$ The ring of integer-valued polynomials over $\S,$ denoted by…