Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadata

Cited literature [26 references]  Display  Hide  Download

https://hal.inria.fr/hal-01829931
Contributor : Alain Monteil <>
Submitted on : Wednesday, July 4, 2018 - 2:05:45 PM
Last modification on : Friday, June 4, 2021 - 9:44:02 AM
Long-term archiving on: : Monday, October 1, 2018 - 2:20:41 PM

File

Angelini_revised.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01829931, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

171

Files downloads

145