Extending Muirhead’s Inequality
2021
We present a method to prove an inequality concerning a linear combination of symmetric monomial functions. This is based on Muirhead’s inequality combining with a graph theoretical setting. As an application we prove some interesting inequalities motivated from extremal combinatorics.
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
4
References
0
Citations
NaN
KQI