相关论文: Semialgebraic decomposition of real binary forms o…

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…

We give an explicit formula for the Waring rank of every binary binomial form with complex coefficients. We give several examples to illustrate this, and compare the Waring rank and the real Waring rank for binary binomial forms.

We study the ideal generated by polynomials vanishing on a semialgebraic set and propose an algorithm to calculate the generators, which is based on some techniques of the cylindrical algebraic decomposition. By applying these, polynomial…

We study the following problem and its applications: given a homogeneous degree-$d$ polynomial $g$ as an arithmetic circuit, and a $d \times d$ matrix $X$ whose entries are homogeneous linear polynomials, compute $g(\partial/\partial x_1,…

We prove that all polynomials in several variables can be decomposed as the sums of $k$th powers: $P(x_1,...,x_n) = Q_1(x_1,...,x_n)^k+...+ Q_s(x_1,...,x_n)^k$, provided that elements of the base field are themselves sums of $k$th powers.…

Motivated by recent results on the Waring problem for polynomial rings and representation of monomial as sum of powers of linear forms, we consider the problem of presenting monomials of degree kd as sums of k-th powers of forms of degree…

Apolarity is an important tool in commutative algebra and algebraic geometry which studies a form, $f$, by the action of polynomial differential operators on $f$. The quotient of all polynomial differential operators by those which…

In this paper, we study the real and the complex Waring rank of reducible cubic forms. In particular, we compute the complex rank of all reducible cubic forms. In the real case, for all reducible cubics, we either compute or bound the real…

The paper deals with the computation of the rank and the identifiability of a specific ternary form. Often, one knows some short Waring decomposition of a given form, and the problem is to determine whether the decomposition is minimal and…

We propose a new numerical algorithm for computing the tensor rank decomposition or canonical polyadic decomposition of higher-order tensors subject to a rank and genericity constraint. Reformulating this computational problem as a system…

We reconsider the classical problem of representing a finite number of forms of degree d in n+1 variables as sums of powers of linear forms. We define a geometric construct called a `grove', which, in a number of cases allows us to…

Waring problem for homogeneus forms asks for additive decomposition of a form $f$ into powers of linear forms. A classical problem is to determine when such a decomposition is unique. In this paper I answer this question when the degree of…

In this paper we study the problem of deciding whether two disjoint semialgebraic sets of an algebraic variety over R are separable by a polynomial. For that we isolate a dense subfamily of Spaces of Orderings, named Geometric, which…

We consider the problem of constructing semisimple subalgebras of real (semi-) simple Lie algebras. We develop computational methods that help to deal with this problem. Our methods boil down to solving a set of polynomial equations. In…

For a finite $\mathbb{Z}$-algebra $R$, i.e., for a ring which is not necessarily associative or unitary, but whose additive group is finitely generated, we construct a decomposition of $R/{\rm Ann}(R)$ into directly indecomposable factors…

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 $…

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…

We provide simple criteria and algorithms for expressing homogeneous polynomials as sums of powers of independent linear forms, or equivalently, for decomposing symmetric tensors into sums of rank-1 symmetric tensors of linearly independent…

Consider a system of n polynomial equations and r polynomial inequations in n indeterminates of degree bounded by d with coefficients in a polynomial ring of s parameters with rational coefficients of bit-size at most $\sigma$. From the…

This paper presents an integer decomposition method. The method first writes an integer as a polynomial with 2 as variable that its coefficients are zero or one. Then, suppose that an integer is decomposed into product of such two…