Related papers: Factorization of bivariate sparse polynomials

We introduce a new method for showing that the roots of the characteristic polynomial of certain finite lattices are all nonnegative integers. This method is based on the notion of a quotient of a poset which will be developed to explain…

Let $q\geqslant 2$ be a fixed prime power. We prove an asymptotic formula for counting the number of monic polynomials that are of degree $n$ and have exactly $k$ irreducible factors over the finite field $\mathbb{F}_q$. We also compare our…

Renyi's result on the density of integers whose prime factorizations have excess multiplicity has an analogue for polynomials over a finite field.

We give a formula and an estimation for the number of irreducible polynomials in two (or more) variables over a finite field.

We extend the Euler's totient function (from arithmetic) to any irreducible subfactor planar algebra, using the Mobius function of its biprojection lattice, as Hall did for the finite groups. We prove that if it is nonzero then there is a…

We prove that for almost square tensor product grids and certain sets of bivariate polynomials the Vandermonde determinant can be factored into a product of univariate Vandermonde determinants. This result generalizes the conjecture [Lemma…

In the paper Sato (2006) there are introduced two families of improper random integrals and the corresponding two convolution semigroups of infinitely divisible laws on $\Rset^d$. Theorem 3.1 gives a relation (a factorization property)…

Regarding non-unique factorization of integer-valued polynomials over a discrete valuation domain $(R,M)$ with finite residue field, it is known that there exist absolutely irreducible elements, that is, irreducible elements all of whose…

In this paper we present an unexpected link between the Factorial Conjecture and Furter's Rigidity Conjecture. The Factorial Conjecture in dimension $m$ asserts that if a polynomial $f$ in $m$ variables $X_i$ over $\C$ is such that ${\cal…

Two doubly indexed families of polynomials in several indeterminates are considered. They are related to the falling and rising factorials in a similar way as the potential polynomials (introduced by L. Comtet) are related to the ordinary…

Consider a sparse polynomial in several variables given explicitly as a sum of non-zero terms with coefficients in an effective field. In this paper, we present several algorithms for factoring such polynomials and related tasks (such as…

We provide an alternative exposition of a result due to Schinzel. Fix an integer $k \ge 2$. For almost all choices of positive integers $n_{1} < \cdots < n_{k}$, we show that the polynomial $F(x) = 1 + x^{n_{1}} + \cdots + x^{n_{k}}$,…

An old conjecture of Erd\H{o}s and R\'enyi, proved by Schinzel, predicted a bound for the number of terms of a polynomial $g(x) \in \mathbb{C}[x]$ when its square $g(x)^2$ has a given number of terms. Further conjectures and results arose,…

In this paper, we extend the notion of Lyndon word to transfinite words. We prove two main results. We first show that, given a transfinite word, there exists a unique factorization in Lyndon words that are densely non-increasing, a…

Let $k$ be a perfect field of characteristic $p > 0$, and let $K = k((u))$ be the field of Laurent series over $K$. We study the skew polynomial ring $K[T, \Phi]$, where $\Phi$ is an endomorphism of $K$ that extends a Frobenius endomorphism…

We determine necessary and sufficient conditions for unicritical polynomials to be dynamically irreducible over finite fields. This result extends the results of Boston-Jones and Hamblen-Jones-Madhu regarding the dynamical irreducibility of…

Motivated by Lang-Vojta's conjectures on hyperbolic varieties, we prove a new version of the Shafarevich conjecture in which we establish the finiteness of pointed families of polarized varieties. We then give an arithmetic application to…

Let $\mathbb F_q$ be a finite field and $n$ a positive integer. In this article, we prove that, under some conditions on $q$ and $n$, the polynomial $x^n-1$ can be split into irreducible binomials $x^t-a$ and an explicit factorization into…

In this paper we present an equivalent statement to the Jacobian conjecture. For a polynomial map F on an affine space of dimension n, we define recursively n finite sequences of polynomials. We give an equivalent condition to the…

Let $S \subset R$ be an arbitrary subset of a unique factorization domain $R$ and $\K$ be the field of fractions of $R$. The ring of integer-valued polynomials over $S$ is the set $\mathrm{Int}(S,R)= \{ f \in \mathbb{K}[x]: f(a) \in R\…