Deciding positivity of multisymmetric polynomials

DOI10.1016/j.jsc.2015.10.001zbMath1347.05244arXiv1409.2707OpenAlexW1527405697MaRDI QIDQ898286

Paul Görlach, Cordian Riener, Tillmann Weisser

Publication date: 8 December 2015

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

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

zbMATH Keywords

convexitypositivityalgorithmic complexitydecison problemsdegree principle

Mathematics Subject Classification ID

Symmetric functions and generalizations (05E05) Computational aspects and applications of commutative rings (13P99) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Real algebraic and real-analytic geometry (14P99)

Related Items (3)

Quantum entanglement, symmetric nonnegative quadratic polynomials and moment problems ⋮ Multi-degree bounds on the Betti numbers of real varieties and semi-algebraic sets and applications ⋮ Symmetry Reduction to Optimize a Graph-based Polynomial From Queueing Theory

Cites Work

• Unnamed Item
• Unnamed Item
• Symmetric semi-algebraic sets and non-negativity of symmetric polynomials
• On the degree and half-degree principle for symmetric polynomials
• Positive symmetric functions
• On the positivity of symmetric polynomial functions. I: General results
• Multisymmetric functions
• The ring of multisymmetric functions.
• When is the algebra of multisymmetric polynomials generated by the elementary multisymmetric polynomials?
• NP-hardness of deciding convexity of quartic polynomials and related problems
• Real even symmetric ternary forms
• Some NP-complete problems in quadratic and nonlinear programming
• Invariants of Finite Groups Generated by Reflections

This page was built for publication: Deciding positivity of multisymmetric polynomials