Related papers: Direct sum decomposability of polynomials and fact…
The P{\l}onka sum is an algebra determined using a structure called a direct system. By a direct system, we mean an indexed family of algebras with disjoint universes whose indexes form a join-semilattice s.t. if two indexes are in a…
We present a framework to decompose real multivariate polynomials while preserving invariance and positivity. This framework has been recently introduced for tensor decompositions, in particular for quantum many-body systems. Here we…
We study the problem of decomposing a non-negative polynomial as an exact sum of squares (SOS) in the case where the associated semidefinite program is feasible but not strictly feasible (for example if the polynomial has real zeros).…
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…
In this paper, we develop a new deflation technique for refining or verifying the isolated singular zeros of polynomial systems. Starting from a polynomial system with an isolated singular zero, by computing the derivatives of the input…
Given a system of n homogeneous polynomials in n variables which is equivariant with respect to the canonical actions of the symmetric group of n symbols on the variables and on the polynomials, it is proved that its resultant can be…
We provide, in a 474 pages study, a comprehensive and self-contained treatment of Resultant Theory for a homogeneous system of polynomials with several variables (as many variables as of polynomials). In a non classical way, we use the…
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…
We derive general expressions for the sum rules of the eigenvalues of drums of arbitrary shape and arbitrary density, obeying different boundary conditions. The formulas that we present are a generalization of the analogous formulas for one…
In this paper, we give a theoretical analysis for the algorithms to compute functional decomposition for multivariate polynomials based on differentiation and homogenization which are proposed by Ye, Dai, Lam (1999) and Faug$\mu$ere, Perret…
A slice decomposition is an expression of a homogeneous polynomial as a sum of forms with a linear factor. A strength decomposition is an expression of a homogeneous polynomial as a sum of reducible forms. The slice rank and strength of a…
Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…
We consider the numerical irreducible decomposition of a positive dimensional solution set of a polynomial system into irreducible factors. Path tracking techniques computing loops around singularities connect points on the same irreducible…
T. Shudo and H. Miyamito \cite{SM78} showed that $C$ can be decomposed into a direct sum of its indecomposable subcoalgebras of $C$. Y.H. Xu \cite {XF92} showed that the decomposition was unique. He also showed that $M$ can uniquely be…
In what follows, we pose two general conjectures about decompositions of homogeneous polynomials as sums of powers. The first one (suggested by G. Ottaviani) deals with the generic k-rank of complex-valued forms of any degree divisible by k…
In this paper, a randomized algorithm for deciding the irreducibility of an irreducible polynomial and factoring a reducible polynomial over the field of rational numbers is presented. The main idea underlying the algorithm is based on…
A polynomial f (multivariate over a field) is decomposable if f = g(h) with g univariate of degree at least 2. We determine the dimension (over an algebraically closed field) of the set of decomposables, and an approximation to their number…
We derive an explicit sum formula for symmetric Macdonald polynomials. Our expression contains multiple sums over the symmetric group and uses the action of Hecke generators on the ring of polynomials. In the special cases $t=1$ and $q=0$,…
A univariate polynomial f over a field is decomposable if f = g o h = g(h) for nonlinear polynomials g and h. It is intuitively clear that the decomposable polynomials form a small minority among all polynomials over a finite field. The…
Generalizing the concept of the Macaulay inverse system, we introduce a way to describe localizations of an ideal in a polynomial ring. This leads to an approach to the differential primary decomposition as a description of the affine…