WARING DECOMPOSITIONS AND IDENTIFIABILITY VIA BERTINI AND MACAULAY2 SOFTWARE - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2017

WARING DECOMPOSITIONS AND IDENTIFIABILITY VIA BERTINI AND MACAULAY2 SOFTWARE

Abstract

Starting from our previous papers [AGMO] and [ABC], we prove the existence of a non-empty Euclidean open subset whose elements are polynomial vectors with 4 components, in 3 variables, degrees, respectively, 2, 3, 3, 3 and rank 6, which are not identifiable over C but are identifiable over R. This result has been obtained via computer-aided procedures suitably adapted to investigate the number of Waring decompositions for general polynomial vectors over the fields of complex and real numbers. Furthermore, by means of the Hessian criterion ([COV]), we prove identifiability over C for polynomial vectors in many cases of sub-generic rank.
Fichier principal
Vignette du fichier
Angelini_revised.pdf (372.72 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01829931 , version 1 (04-07-2018)

Identifiers

  • HAL Id : hal-01829931 , version 1

Cite

Elena Angelini. WARING DECOMPOSITIONS AND IDENTIFIABILITY VIA BERTINI AND MACAULAY2 SOFTWARE. MEGA 2017 - International Conference on Effective Methods in Algebraic Geometry, Jun 2017, Nice, France. ⟨hal-01829931⟩
80 View
69 Download

Share

Gmail Facebook X LinkedIn More