Related papers: Factorization of polynomials in one variable over …
Tropical roots of tropical polynomials have been previously studied and used to localize roots of classical polynomials and eigenvalues of matrix polynomials. We extend the theory of tropical roots from tropical polynomials to tropical…
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…
Polynomial factorization is a fundamental problem in computational algebra. Over the past half century, a variety of algorithmic techniques have been developed to tackle different variants of this problem. In parallel, algebraic complexity…
We study the problem of counting the total number of affine solutions of a system of n binomials in n variables over an algebraically closed field of characteristic zero. We show that we may decide in polynomial time if that number is…
We extend to several variables an earlier result of ours, according to which an entire function of one variable of sufficiently small exponential type, having all derivatives of even order taking integer values at two points, is a…
Motion polynomials (polynomials over the dual quaternions with nonzero real norm) describe rational motions. We present a necessary and sufficient condition for reduced bounded motion polynomials to admit factorizations into monic linear…
The main purpose of this paper is to study the NP-complete subset-sum problem, not in the usual context of time-complexity-based classification of the algorithms (exponential/polynomial), but through a new kind of algorithmic classification…
The growth of tropical geometry has generated significant interest in the tropical semiring in the past decade. However, there are other semirings in tropical algebra that provide more information, such as the symmetrized (max, +),…
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\…
In this paper we further develop the theory of matrices over the extended tropical semiring. Introducing a notion of tropical linear dependence allows for a natural definition of matrix rank in a sense that coincides with the notions of…
We consider the problems of finding the lexicographically minimal (or maximal) satisfying assignment of propositional formulae for different restricted formula classes. It turns out that for each class from our framework, the above problem…
A multidimensional optimization problem is formulated in the tropical mathematics setting as to maximize a nonlinear objective function, which is defined through a multiplicative conjugate transposition operator on vectors in a…
In a previous paper, we have shown that any Boolean formula can be encoded as a linear programming problem in the framework of Bayesian probability theory. When applied to NP-complete algorithms, this leads to the fundamental conclusion…
In this paper, we provide the degree distribution of irreducible factors of the composed polynomial $f(L(x))$ over $\mathbb F_q$, where $f(x)\in \mathbb F_q[x]$ is irreducible and $L(x)\in \mathbb F_q[x]$ is a linearized polynomial. We…
Newton iteration (NI) is an almost 350 years old recursive formula that approximates a simple root of a polynomial quite rapidly. We generalize it to a matrix recurrence (allRootsNI) that approximates all the roots simultaneously. In this…
We study nonnegative and sums of squares symmetric (and even symmetric) functions of fixed degree. We can think of these as limit cones of symmetric nonnegative polynomials and symmetric sums of squares of fixed degree as the number of…
In this note we prove that the factorization theorem for dominated polynomials previously proved by the authors is equivalent to an alternative factorization scheme that uses classical linear techniques and a linearization process. However,…
We study the probability that a random polynomial with integer coefficients is reducible when factored over the rational numbers. Using computer-generated data, we investigate a number of different models, including both monic and non-monic…
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…
We study the problem of generating monomials of a polynomial in the context of enumeration complexity. In this setting, the complexity measure is the delay between two solutions and the total time. We present two new algorithms for…