Papers
Topics
Authors
Recent
Search
2000 character limit reached

Waring, tangential and cactus decompositions

Published 6 Dec 2018 in math.AC and math.AG | (1812.02612v3)

Abstract: (EN) We revise the famous algorithm for symmetric tensor decomposition due to Brachat, Comon, Mourrain and Tsidgaridas. Afterwards, we generalize it in order to detect possibly different decompositions involving points on the tangential variety of a Veronese variety. Finally, we produce an algorithm for cactus rank and decomposition, which also detects the support of the minimal apolar scheme and its length at each component. (FR) Nous revenons sur le fameux algorithme de Brachat, Comon, Mourrain et Tsidgaridas pour la d\'composition des tenseurs sym\'etriques. Ensuite, nous le g\'en\'eralisons afin de d\'etecter de possibles d\'ecompositions diff\'erentes impliquant des points sur la vari\'et\'e tangentielle d'une vari\'et\'e de Veronese. Enfin, nous proposons un algorithme pour le rang et la d\'ecomposition cactus, qui, lui aussi, d\'etecte le support du sch\'ema apolaire minimal ainsi que sa longueur sur chaque composante.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.