Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

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.

share|cite|improve this question
I'm thinking along the lines of using $e^{iz}$ to prove trig identities or venn diagrams to prove set theory. – sperners lemma Nov 18 '12 at 18:35
The theory containing these any many more is decidable (…) but I would like a more practical algorithm which just exploits the symmetry. – sperners lemma Nov 18 '12 at 19:14
You may be also interested in this thread:… – John Jiang Oct 23 '15 at 4:16
up vote 1 down vote accepted

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.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.