Related papers: Efficient evaluation of noncommutative polynomials…
A Waring decomposition of a polynomial is an expression of the polynomial as a sum of powers of linear forms, where the number of summands is minimal possible. We prove that any Waring decomposition of a monomial is obtained from a complete…
A Waring decomposition of a (homogeneous) polynomial f is a minimal sum of powers of linear forms expressing f. Under certain conditions, such a decomposition is unique. We discuss some algorithms to compute the Waring decomposition, which…
The Waring Problem over polynomial rings asks how to decompose a homogeneous polynomial $p$ of degree $d$ as a finite sum of $d$-{th} powers of linear forms. In this work we give an algorithm to obtain a real Waring decomposition of any…
Decoupling multivariate polynomials is useful for obtaining an insight into the workings of a nonlinear mapping, performing parameter reduction, or approximating nonlinear functions. Several different tensor-based approaches have been…
By viewing non-commutative polynomials, that is, elements in free associative algebras, in terms of linear representations, we generalize Horner's rule to the non-commutative (multivariate) setting. We introduce the concept of Horner…
Let $F$ be a homogeneous form of degree $d$ in $n$ variables. A Waring decomposition of $F$ is a way to express $F$ as a sum of $d^{th}$ powers of linear forms. In this paper we consider the decompositions of a form as a sum of expressions,…
In this paper we settle some polynomial identity which provides a family of explicit Waring decompositions of any monomial $X_0^{a_0}X_1^{a_1}\cdots X_n^{a_n}$ over a field $\Bbbk$. This gives an upper bound for the Waring rank of a given…
We relate the condition numbers of computing three decompositions of symmetric tensors: the canonical polyadic decomposition, the Waring decomposition, and a Tucker-compressed Waring decomposition. Based on this relation we can speed up the…
In this paper, the canonical polyadic (CP) decomposition of tensors that corresponds to matrix multiplications is studied. Finding the rank of these tensors and computing the decompositions is a fundamental problem of algebraic complexity…
We give efficient algorithms for finding power-sum decomposition of an input polynomial $P(x)= \sum_{i\leq m} p_i(x)^d$ with component $p_i$s. The case of linear $p_i$s is equivalent to the well-studied tensor decomposition problem while…
The Canonical Polyadic decomposition (CPD) is a convenient and intuitive tool for tensor factorization; however, for higher-order tensors, it often exhibits high computational cost and permutation of tensor entries, these undesirable…
Multivariate polynomials arise in many different disciplines. Representing such a polynomial as a vector of univariate polynomials can offer useful insight, as well as more intuitive understanding. For this, techniques based on tensor…
This paper is devoted to the factorization of multivariate polynomials into products of linear forms, a problem which has applications to differential algebra, to the resolution of systems of polynomial equations and to Waring decomposition…
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 analyze the problem of determining Waring decompositions of the powers of any quadratic form over the field of complex numbers. Our main goal is to provide information about their rank and also to obtain decompositions whose size is as…
We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…
Noncommutative harmonic analysis is used to solve a nonparametric estimation problem stated in terms of compound Poisson processes on compact Lie groups. This problem of decompounding is a generalization of a similar classical problem. The…
Invariance transformations of polyadic decompositions of matrix multiplication tensors define an equivalence relation on the set of such decompositions. In this paper, we present an algorithm to efficiently decide whether two polyadic…
Tensor decomposition methods are widely used for model compression and fast inference in convolutional neural networks (CNNs). Although many decompositions are conceivable, only CP decomposition and a few others have been applied in…
It is shown how to compute quotients efficiently in non-commutative univariate polynomial rings. This extends earlier work where efficient generic quotients were studied with a primary focus on commutative domains. Fast algorithms are given…