Majorization Inequalities from Logarithmic Convexity

Abstract

Majorization inequalities for symmetric polynomials have interested mathematicians for centuries, from the AM-GM inequality for two variables going back at least to Baudhāyana's Śulbasūtra and Euclid's Elements in the first millenium BCE, through classical results of Newton, Muirhead and Gantmacher, to more recent extensions to Schur polynomials and zonal spherical functions. These have been established case by case, with no unified approach. Although it is known that majorization inequalities follow from symmetry and convexity in the indexing partition, the difficulty of proving convexity in specific cases has left a number of outstanding conjectures inaccessible until now. The key insight of this paper is that log-convexity provides a more versatile tool and a unifying principle. It implies convexity and hence majorization, and it is preserved under multiplication and weighted averaging, making it well suited to inductive arguments in a wide range of settings. Using this idea, we prove new majorization inequalities for Macdonald polynomials, Jack polynomials and Heckman-Opdam hypergeometric functions, unifying existing results and resolving several open conjectures.

Majorization, Entropy and Concentration Inequalities for Discrete α-Concave Random Variables
Abdulmajeed Alqasem, Heshan Aravinda, Arnaud Marsiglietti
arXiv4 Oct 2026PreprintarXiv licenceFull textProbabilityarXiv
From Majorization to Horn and Unitary-Orbit Inequalities
Juntai Zhou
arXiv5 Sep 2026PreprintarXiv licenceFull textAnalysis & PDEs Mathematical physicsarXiv
On a New Generalized Convexity and Its Related Midpoint-, Trapezoid-, and Simpson-Type Inequalities via Multiplicative Calculus
Mohammad Akram, Inna Kalchuk, Muhammad Tariq +1
Axioms14 Oct 2026Peer-reviewedCC BY 4.0General mathematicsCrossref
Strict rearrangement inequalities for logarithmic p-Laplacians
Hichem Hajaiej, Qinyang Li, Weichang Zhan
arXiv1 Nov 2026PreprintCC BY 4.0Full textAnalysis & PDEsarXiv
Sharp inequalities for the Newtonian and logarithmic capacities
Mengwei Su, Qiang Sun, Ge Xiong
arXiv3 Oct 2026PreprintCC BY-NC-ND 4.0Full textAnalysis & PDEs Mathematical physicsarXiv

Cite

BibTeX RIS

BibTeX

@misc{mcswiggen2026majorization,
  title = {{Majorization Inequalities from Logarithmic Convexity}},
  author = {Colin McSwiggen and Siddhartha Sahi},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2605.12680},
  eprint = {2605.12680},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2605.12680},
}

RIS

TY  - UNPB
TI  - Majorization Inequalities from Logarithmic Convexity
AU  - Colin McSwiggen
AU  - Siddhartha Sahi
PY  - 2026
DA  - 2026/09/24
PB  - arXiv
DO  - 10.48550/arxiv.2605.12680
UR  - https://arxiv.org/abs/2605.12680
AB  - Majorization inequalities for symmetric polynomials have interested mathematicians for centuries, from the AM-GM inequality for two variables going back at least to Baudhāyana's Śulbasūtra and Euclid's Elements in the first millenium BCE, through classical results of Newton, Muirhead and Gantmacher, to more recent extensions to Schur polynomials and zonal spherical functions. These have been established case by case, with no unified approach. Although it is known that majorization inequalities follow from symmetry and convexity in the indexing partition, the difficulty of proving convexity in specific cases has left a number of outstanding conjectures inaccessible until now. The key insight of this paper is that log-convexity provides a more versatile tool and a unifying principle. It implies convexity and hence majorization, and it is preserved under multiplication and weighted averaging, making it well suited to inductive arguments in a wide range of settings. Using this idea, we prove new majorization inequalities for Macdonald polynomials, Jack polynomials and Heckman-Opdam hypergeometric functions, unifying existing results and resolving several open conjectures.
ER  -

Abstract

Related

Cite