On the degree and half degree principle for symmetric polynomials

Details On the degree and half degree principle for symmetric polynomials On the degree and half degree principle for symmetric polynomials

2010-01-25

arxiv.org/abs/1001.4464v2

Mathematics

Algebraic Geometry

(v2) revision based on suggestions by referee

Scientific paper

10.1016/j.jpaa.2011.08.012

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 $\R^n$ (on $\R^{n}_{\geq 0}$) if and only if it is so on the subset of points with at most $\max\{\lfloor d/2\rfloor,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 $S_n$ 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.

Affiliated with

Also associated with

No associations

Rating

On the degree and half degree principle for symmetric polynomials does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the degree and half degree principle for symmetric polynomials, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the degree and half degree principle for symmetric polynomials will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-131284