On the degree and half-degree principle for symmetric polynomials

From MaRDI portal
Publication:425291

DOI10.1016/J.JPAA.2011.08.012zbMATH Open1242.05272arXiv1001.4464OpenAlexW2139517149MaRDI QIDQ425291FDOQ425291


Authors: Cordian Riener Edit this on Wikidata


Publication date: 8 June 2012

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

Abstract: In this note we aim to give a new, elementary proof of a statement that was first proved by Timofte. It says that a symmetric real polynomial F of degree d in n variables is positive on Rn (on Rgeq0n) if and only if it is so on the subset of points with at most maxlfloord/2floor,2 distinct components. We deduce Timofte's original statement as a corollary of a slightly more general statement on symmetric optimization problems. The idea we are using to prove this statement is to relate it to a linear optimization problem in the orbit space. The fact that for the case of the symmetric group Sn this can be viewed as a question on normalized univariate real polynomials with only real roots allows us to conclude the theorems in a very elementary way. We hope that the methods presented here will make it possible to derive similar statements also in the case of other groups.


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




Recommendations




Cites Work


Cited In (20)





This page was built for publication: On the degree and half-degree principle for symmetric polynomials

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