Polynomial decompositions with invariance and positivity inspired by tensors

arXiv2109.06680MaRDI QIDQ6377635FDOQ6377635

Andreas Klingler, Gemma De las Cuevas, Tim Netzer

Publication date: 14 September 2021

Abstract: We present a framework to decompose real multivariate polynomials while preserving invariance and positivity. This framework has been recently introduced for tensor decompositions, in particular for quantum many-body systems. Here we transfer results about decomposition structures, invariance under permutations of variables, positivity, rank inequalities and separations, approximations, and undecidability to real polynomials. Specifically, we define invariant decompositions of polynomials and characterize which polynomials admit such decompositions. We then include positivity: We define invariant separable and sum-of-squares decompositions, and characterize the polynomials similarly. We provide inequalities and separations between the ranks of the decompositions, and show that the separations are not robust with respect to approximations. For cyclically invariant decompositions, we show that it is undecidable whether the polynomial is nonnegative or sum-of-squares for all system sizes. Our work sheds new light on polynomials by putting them on an equal footing with tensors, and opens the door to extending this framework to other tensor product structures.

This page was built for publication: Polynomial decompositions with invariance and positivity inspired by tensors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6377635)