Related papers: Waring decompositions of monomials

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…

Primary decomposition of commutative monoid congruences is insensitive to certain features of primary decomposition in commutative rings. These features are captured by the more refined theory of mesoprimary decomposition of congruences,…

In this article, the ring of polynomials is studied in a systematic way through the theory of monoid rings. As a consequence, this study provides natural and canonical approaches in order to find easy and rigorous proofs and methods for…

We consider simultaneous Waring decompositions: Given forms $ f_d $ of degrees $ kd $, $ (d = 2,3 )$, which admit a representation as $ d $-th power sums of $ k $-forms $ q_1,\ldots,q_m $, when is it possible to reconstruct the addends $…

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…

Symmetric tensor decomposition is an important problem with applications in several areas for example signal processing, statistics, data analysis and computational neuroscience. It is equivalent to Waring's problem for homogeneous…

Border complexity measures are defined via limits (or topological closures), so that any function which can approximated arbitrarily closely by low complexity functions itself has low border complexity. Debordering is the task of proving an…

In this paper, we reveal an internal structure within Dedekind numbers, demonstrating that they can be expressed as polynomials of powers of 2. This discovery is based on innovative concepts and methods, offering a new perspective on the…

Power series in which the summand satisfies a linear recurrence relation with polynomial coefficients are shown to be the solution of a linear differential or algebraic equation. Solving the associated differential or algebraic equation…

We show that if a homogeneous polynomial $f$ in $n$ variables has Waring rank $n+1$, then the corresponding projective hypersurface $f=0$ has at most isolated singularities, and the type of these singularities is completely determined by…

A polynomial ring with rational coefficients is an irreducible representation of Lie algebras of endomorphisms of exterior powers of a infinite countable dimensional $\mathbb{Q}$-vector space. We give an explicit description of it, using…

We give an expression of polynomials for higher sums of powers of integers via the higher order Bernoulli numbers.

Varieties of Sums of Powers describe the additive decompositions of an homogeneous polynomial into powers of linear forms. Despite their long history, going back to Sylvester and Hilbert, few of them are known for special degrees and number…

We study multivariate trigonometric polynomials, satisfying a set of constraints close to the known Strung-Fix conditions. Based on the polyphase representation of these polynomials relative to a general dilation matrix, we develop a simple…

We study generalized sums of linear orders. These are binary operations that, given linear orders $A$ and $B$, return an order $A \oplus B$ that can be decomposed as an isomorphic copy of $A$ interleaved with a copy of $B$. We show that…

Motivated by the search for a deeper understanding of tensor rank, in view of its computational complexity applications, we investigate a possible path to determine the maximum symmetric rank in given degree and dimension. We work in terms…

Let F denote a homogeneous degree 4 polynomial in 3 variables, and let s be an integer between 1 and 5. We would like to know if F can be written as a sum of fourth powers of s linear forms (or a degeneration). We determine necessary and…

We establish sharp estimates that adapt the polynomial method to arbitrary varieties. These include a partitioning theorem, estimates on polynomials vanishing on fixed sets and bounds for the number of connected components of real algebraic…

The matching polynomial of a graph is the generating function of the numbers of its matchings with respect to their cardinality. A graph polynomial is polynomial reconstructible, if its value for a graph can be determined from its values…

We consider binomial and inverse binomial sums at infinity and rewrite them in terms of a small set of constants, such as powers of $\pi$ or $\log(2)$. In order to perform these simplifications, we view the series as specializations of…