Related papers: On majorization for polynomials sharing a common i…
We consider polynomials of bi-degree $(n,1)$ over the skew field of quaternions where the indeterminates commute with each other and with all coefficients. Polynomials of this type do not generally admit factorizations. We recall a…
The concepts of differentiation and integration for matrices are known. As far as each matrix is differentiable, it is not clear a priori whether a given matrix is integrable or not. Recently some progress was obtained for diagonalizable…
Polynomial optimization problems over binary variables can be expressed as integer programs using a linearization with extra monomials in addition to those arising in the given polynomial. We characterize when such a linearization yields an…
This paper extends earlier work on the distribution in the complex plane of the roots of random polynomials. In this paper, the random polynomials are generalized to random finite sums of given "basis" functions. The basis functions are…
It is well known that for two univariate polynomials over complex number field the number of their common roots is equal to the order of their resultant. In this paper, we show that this fundamental relationship still holds for the tropical…
Factorizations over cones and their duals play central roles for many areas of mathematics and computer science. One of the reasons behind this is the ability to find a representation for various objects using a well-structured family of…
We provide a unified, elementary, topological approach to the classical results stating the continuity of the complex roots of a polynomial with respect to its coefficients, and the continuity of the coefficients with respect to the roots.…
In this paper we obtain some statements concerning ideals of polynomials and apply these results in a number of different situations. Among other results, we present new characterizations of $\mathcal{L}_{\infty}$-spaces, Coincidence…
Factorization -- a simple form of standardization -- is concerned with reduction strategies, i.e. how a result is computed. We present a new technique for proving factorization theorems for compound rewriting systems in a modular way, which…
We prove that if a polynomial has a root mod $p$ for every large prime $p$, then it has a real root. As an application, we show that the primes can't be covered by finitely many positive definite binary quadratic forms.
We extend our previous work on Poisson-like formulas for subresultants in roots to the case of polynomials with multiple roots in both the univariate and multivariate case, and also explore some closed formulas in roots for univariate…
This paper mainly studies problems about so called "permutation polynomials modulo $m$", polynomials with integer coefficients that can induce bijections over Z_m={0,...,m-1}. The necessary and sufficient conditions of permutation…
A well-known generalisation of positional numeration systems is the case where the base is the residue class of $x$ modulo a given polynomial $f(x)$ with coefficients in (for example) the integers, and where we try to construct finite…
In algebraic, topological, and geometric combinatorics inequalities among the coefficients of combinatorial polynomials are frequently studied. Recently a notion called the alternatingly increasing property, which is stronger than…
In this paper we consider linear combinations of two trivariate homogeneous polynomials of second degree. We formulate and solve two problems: i) Characterization of polynomials for which all linear combinations are factorizable. ii) How…
A random number of items each independently marked with one of a collection of colours gives rise to the multinomial marking, which generalises binomial thinning. A multivariate version, where previously marked items are then re-marked, has…
In this paper, we consider the existence of a factorization of a monic, bounded motion polynomial. We prove existence of factorizations, possibly after multiplication with a real polynomial and provide algorithms for computing polynomial…
We provide sufficient conditions for systems of polynomial equations over general (real or complex) algebras to have a solution. This generalizes known results on quaternions, octonions and matrix algebras. We also generalize the…
The bipartition polynomial of a graph is a generalization of many other graph polynomials, including the domination, Ising, matching, independence, cut, and Euler polynomial. We show in this paper that it is also a powerful tool for proving…
Just as knowing some roots of a polynomial allows one to factor it, a well-known result provides a factorization of any scalar differential operator given a set of linearly independent functions in its kernel. This note provides a…