Pfister’s Theorem Fails in the Free Case

From MaRDI portal
Publication:2849463

DOI10.1007/978-3-0348-0411-0_14zbMATH Open1276.16018arXiv1102.1768OpenAlexW1577253818MaRDI QIDQ2849463FDOQ2849463


Authors: Martin Ames Harrison Edit this on Wikidata


Publication date: 18 September 2013

Published in: Mathematical Methods in Systems, Optimization, and Control (Search for Journal in Brave)

Abstract: Artin solved Hilbert's 17th problem by showing that every positive semidefinite polynomial can be realized as a sum of squares of rational functions. Pfister gave a bound on the number of squares of rational functions: if p is a positive semi-definite polynomial in n variables, then there is a polynomial q so that q2p is a sum of at most 2n squares. As shown by D'Angelo and Lebl, the analog of Pfister's theorem fails in the case of Hermitian polynomials. Specifically, it was shown that the rank of any multiple of the polynomial |z|2dequiv(sumj|zj|2)d is bounded below by a quantity depending on d. Here we prove that a similar result holds in a free ast-algebra.


Full work available at URL: https://arxiv.org/abs/1102.1768




Recommendations





Cited In (2)





This page was built for publication: Pfister’s Theorem Fails in the Free Case

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