A family of explicit Waring decompositions of a polynomial

01/09/2023
by   Kangjin Han, et al.
0

In this paper we settle some polynomial identity which provides a family of explicit Waring decompositions of any monomial X_0^a_0X_1^a_1⋯ X_n^a_n over a field . This gives an upper bound for the Waring rank of a given monomial and naturally leads to an explicit Waring decomposition of any homogeneous form and, eventually, of any polynomial via (de)homogenization. Note that such decomposition is very useful in many applications dealing with polynomial computations, symmetric tensor problems and so on. We discuss some computational aspect of our result as comparing with other known methods and also present a computer implementation for potential use in the end.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/22/2020

Symmetric Tensor Decompositions On Varieties

This paper discusses the problem of symmetric tensor decomposition on a ...
research
07/08/2021

Decomposition algorithms for tensors and polynomials

We give algorithms to compute decompositions of a given polynomial, or m...
research
01/13/2020

Solving Decomposable Sparse Systems

Amendola et al. proposed a method for solving systems of polynomial equa...
research
07/20/2021

Counting tensor rank decompositions

The tensor rank decomposition is a useful tool for the geometric interpr...
research
11/24/2021

Explicit solution of divide-and-conquer dividing by a half recurrences with polynomial independent term

Divide-and-conquer dividing by a half recurrences, of the form x_n =a· x...
research
11/14/2022

Complete Decomposition of Symmetric Tensors in Linear Time and Polylogarithmic Precision

We study symmetric tensor decompositions, i.e. decompositions of the inp...
research
10/18/2022

Bidiagonal Decompositions of Vandermonde-Type Matrices of Arbitrary Rank

We present a method to derive new explicit expressions for bidiagonal de...

Please sign up or login with your details

Forgot password? Click here to reset