3
$\begingroup$

Many inequalities regarding symmetric polynomials such as this are posed as problems


Is there an uniform method or algorithm to prove all true ones? We can assume they are input in some basis for symmetric polynomials.

  • 0
    I'm thinking along the lines of using $e^{iz}$ to prove trig identities or [venn diagrams](http://math.stackexchange.com/questions/223026/naive-set-theory-equality-proof/223048#223048) to prove set theory.2012-11-18
  • 0
    The theory containing these any many more is decidable (https://en.wikipedia.org/wiki/Real_closed_field#Model_Theory:_decidability_and_quantifier_elimination) but I would like a more practical algorithm which just exploits the symmetry.2012-11-18
  • 0
    relevant http://mathpropress.com/stan/bibliography/inequalities.pdf2012-11-18
  • 0
    You may be also interested in this thread: http://mathoverflow.net/questions/218811/bounding-schur-symmetric-polynomials-on-the-unit-circle2015-10-23

1 Answers 1

1

There is work done in this regard and some interesting results. I recommend the following articles:

It is a fascinating area of research in which a lot remains to be discovered.