On the degree and half-degree principle for symmetric polynomials
From MaRDI portal
(Redirected from Publication:425291)
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 of degree in variables is positive on (on ) if and only if it is so on the subset of points with at most 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 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.
Recommendations
- Symmetric semi-algebraic sets and non-negativity of symmetric polynomials
- On the positivity of symmetric polynomial functions. I: General results
- A note on the positivity of the even degree complete homogeneous symmetric polynomials
- Deciding positivity of multisymmetric polynomials
- On the positivity of symmetric polynomial functions. II: Lattice general results and positivity criteria for degrees 4 and 5
Cites work
- scientific article; zbMATH DE number 45943 (Why is no real title available?)
- scientific article; zbMATH DE number 1256732 (Why is no real title available?)
- scientific article; zbMATH DE number 3251532 (Why is no real title available?)
- Algorithms in invariant theory
- Even symmetric sextics
- Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
- On the positivity of symmetric polynomial functions. I: General results
- Positive symmetric functions
- Pólya-Schur master theorems for circular domains and their boundaries
- Real even symmetric ternary forms
Cited in
(20)- Efficient algorithms for computing the Euler-Poincaré characteristic of symmetric semi-algebraic sets
- Reflection groups, reflection arrangements, and invariant real varieties
- Quantum entanglement, symmetric nonnegative quadratic polynomials and moment problems
- Computing critical points for invariant algebraic systems
- Discriminants of cyclic homogeneous inequalities of three variables
- Vandermonde varieties, mirrored spaces, and the cohomology of symmetric semi-algebraic sets
- Symmetric ideals, Specht polynomials and solutions to symmetric systems of equations
- On nonnegative invariant quartics in type \(A\)
- Linear slices of hyperbolic polynomials and positivity of symmetric polynomial functions
- Deciding positivity of multisymmetric polynomials
- New directions in real algebraic geometry. Abstracts from the workshop held March 19--24, 2023
- Optimizing Hypergraph-Based Polynomials Modeling Job-Occupancy in Queuing with Redundancy Scheduling
- Reflection groups and cones of sums of squares
- Faster real root decision algorithm for symmetric polynomials
- Symmetric semi-algebraic sets and non-negativity of symmetric polynomials
- Test sets for nonnegativity of polynomials invariant under a finite reflection group
- Rewriting techniques and degree bounds for higher order symmetric polynomials.
- Symmetric non-negative forms and sums of squares
- Bounding the equivariant Betti numbers of symmetric semi-algebraic sets
- Symmetry reduction in AM/GM-based optimization
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)