当前位置:
X-MOL 学术
›
Graphs Comb.
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Extending Muirhead’s Inequality
Graphs and Combinatorics ( IF 0.7 ) Pub Date : 2021-09-03 , DOI: 10.1007/s00373-021-02356-z Mitsuo Kato 1 , Norihide Tokushige 1 , Masashi Kosuda 2
中文翻译:
扩展缪尔黑德的不等式
更新日期:2021-09-03
Graphs and Combinatorics ( IF 0.7 ) Pub Date : 2021-09-03 , DOI: 10.1007/s00373-021-02356-z Mitsuo Kato 1 , Norihide Tokushige 1 , Masashi Kosuda 2
Affiliation
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.
中文翻译:
扩展缪尔黑德的不等式
我们提出了一种方法来证明关于对称单项函数的线性组合的不等式。这是基于 Muirhead 不等式结合图形理论设置。作为一个应用,我们证明了一些由极值组合引发的有趣的不等式。