Majorization and Inequalities among Complete Homogeneous Symmetric Functions
Pith reviewed 2026-05-22 16:30 UTC · model grok-4.3
The pith
Majorization does not characterize inequalities among complete homogeneous symmetric functions for any degree greater than 7.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
The authors prove that for every integer degree n greater than 7, majorization does not characterize the inequalities among the complete homogeneous symmetric functions of degree n. This is established by exhibiting specific pairs of partitions of n for which the majorization relation holds in one direction while the inequality between the associated complete homogeneous symmetric functions holds in the opposite direction.
What carries the argument
Counterexample pairs of integer partitions of n > 7 on which the majorization partial order diverges from the inequality direction of the complete homogeneous symmetric function values.
If this is right
- For each degree n > 7, at least one pair of partitions serves as a counterexample to the characterization.
- Additional criteria beyond majorization are required to fully describe inequalities among CHs in higher degrees.
- The structure of inequalities for CHs becomes more complex as degree increases beyond 7.
Where Pith is reading between the lines
- If similar divergences occur in other families of symmetric functions, majorization may have limited scope as a general tool for symmetric function inequalities.
- Computational searches for counterexamples could be extended to related problems in algebraic combinatorics.
Load-bearing premise
That there exist explicit pairs of partitions for each n greater than 7 where majorization and the CH inequality point in opposite directions.
What would settle it
A single degree n > 7 for which every pair of partitions satisfies that majorization implies the corresponding CH inequality in the same direction, with no counterexamples.
read the original abstract
Inequalities among symmetric functions are fundamental in various branches of mathematics, thus motivating a systematic study of their structure. Majorization has been shown to characterize inequalities among commonly used symmetric functions, except for complete homogeneous symmetric functions (shortened as CHs). In 2011, Cuttler, Greene, and Skandera posed a natural question: Can majorization also characterize inequalities among CHs? Their work demonstrated that majorization characterizes inequalities among CHs up to degree 7 and suggested exploring its validity for higher degrees. In this paper, we show that, for every degree greater than 7, majorization does not characterize inequalities among CHs.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript claims that majorization characterizes inequalities among complete homogeneous symmetric functions (CHs) only up to degree 7, as previously shown by Cuttler, Greene, and Skandera. For every integer degree n > 7 the authors assert that there exist partitions λ, μ ⊢ n with λ ≻ μ in the majorization order yet the corresponding CH symmetric functions satisfy the reverse inequality, thereby showing that majorization fails to characterize CH inequalities in all higher degrees.
Significance. If the asserted counterexamples are correctly constructed and verified, the result supplies a sharp negative answer to the 2011 question of Cuttler et al. and delineates the exact range in which majorization applies to CHs. The work thereby contributes a precise boundary result to the study of inequalities among symmetric functions.
major comments (1)
- The universal negative statement for all n > 7 is load-bearing on the existence, for each such n, of at least one explicit pair λ, μ ⊢ n satisfying λ ≻ μ while h_λ and h_μ reverse the expected inequality. The manuscript must therefore supply, in the section presenting the main result, either a concrete list of such pairs for small n > 7 together with the explicit expansions or generating-function evaluations that confirm the reversal, or a general constructive method that can be checked for arbitrary n.
Simulated Author's Rebuttal
We thank the referee for the detailed and constructive report. The major comment correctly identifies that the universal claim for all n > 7 requires transparent verification of the counterexamples. We address this point below and will revise the manuscript to incorporate the requested material.
read point-by-point responses
-
Referee: The universal negative statement for all n > 7 is load-bearing on the existence, for each such n, of at least one explicit pair λ, μ ⊢ n satisfying λ ≻ μ while h_λ and h_μ reverse the expected inequality. The manuscript must therefore supply, in the section presenting the main result, either a concrete list of such pairs for small n > 7 together with the explicit expansions or generating-function evaluations that confirm the reversal, or a general constructive method that can be checked for arbitrary n.
Authors: We agree that explicit verification improves clarity and verifiability. The manuscript already contains a general constructive method (based on a specific family of partitions that can be generated for any n > 7), but we acknowledge that the presentation can be strengthened. In the revised version we will add, in the main theorem section, an explicit list of pairs for n = 8, 9, and 10 together with the corresponding generating-function evaluations or direct expansions that confirm the reversal. We will also expand the description of the general construction into a fully checkable algorithmic procedure, including the precise rule for selecting λ and μ from the majorization lattice for arbitrary n. revision: yes
Circularity Check
No circularity: negative result for n>7 rests on explicit counterexample partitions independent of the cited positive result up to degree 7.
full rationale
The paper cites the independent 2011 work of Cuttler, Greene, and Skandera to establish that majorization characterizes CH inequalities for degrees ≤7. For every degree >7 it asserts the opposite by exhibiting (or constructing) at least one pair of partitions λ, μ ⊢ n such that λ ≻ μ yet the complete homogeneous symmetric functions satisfy the reversed inequality. This step is a direct, externally verifiable construction rather than a self-definition, a fitted parameter renamed as a prediction, or a load-bearing self-citation chain. No equation or premise in the derivation reduces to its own inputs by construction; the claim remains falsifiable by independent evaluation of the generating functions or explicit expansions for the cited partitions.
Axiom & Free-Parameter Ledger
axioms (2)
- standard math Majorization is the standard partial order on integer partitions or real sequences as defined in the 2011 Cuttler-Greene-Skandera paper.
- standard math Complete homogeneous symmetric functions are the standard generating functions summing all monomials of given degree.
Forward citations
Cited by 1 Pith paper
-
Majorization Inequalities from Logarithmic Convexity
Log-convexity implies convexity and thus majorization inequalities for Macdonald polynomials, Jack polynomials, and Heckman-Opdam hypergeometric functions, unifying prior results and resolving open conjectures.
Reference graph
Works this paper leans on
-
[1]
T. M. Apostol, Mathematical Analysis, 2nd edition, Addison-Wesley, Reading, 1974
work page 1974
-
[2]
P. S. Bullen, Handbook of Means and their Inequalities, in: Mathematics and its Ap- plications, vol. 560, Kluwer Academic Publishers Group, Dordrecht, 2003, Revised from the 1988 original [P. S. Bullen, D. S. Mitrinović and P. M. Vasić, Means and their inequalities, Reidel, Dordrecht; MR0947142]
work page 2003
- [3]
-
[4]
G. E. Collins, H. Hong, Partial cylindrical algebraic decomposition for quantifier elimi- nation, Journal of Symbolic Computation 12(3) (1991) 299–328
work page 1991
-
[5]
A. Cuttler, C. Greene, M. Skandera, Inequalities for symmetric means, European Jour- nal of Combinatorics 32 (6) (2011) 745-761
work page 2011
-
[6]
G. H. Hardy, J. E. Littlewood, G. Pólya, Inequalities, 2nd edition, Cambridge University Press, Cambridge, 1952
work page 1952
- [7]
- [8]
- [9]
-
[10]
D. E. Littlewood, The Theory of Group Characters and Matrix Representations of Groups, 2nd edition, Clarendon Press, Oxford, 1950, p. 84
work page 1950
-
[11]
I. G. Macdonald, Symmetric Functions and Hall Polynomials, 2nd edition, Clarendon Press, Oxford, 1998
work page 1998
-
[12]
RealCertify: a Maple package for certifying non-negativity
V. Magron, M. S. El Din, Realcertify: a maple package for certifying non-negativity, https://arxiv .org /abs /1805.02201, (2018)
work page internal anchor Pith review Pith/arXiv arXiv 2018
-
[13]
A. W. Marshall, I. Olkin, B. C. Arnold, Inequalities: Theory of Majorization and Its Applications, 2nd edition, Springer, New York, 2011
work page 2011
-
[14]
C. McSwiggen, J. Novak, Majorization and spherical functions. International Mathe- matics Research Notices, 5 (2022) 3977–4000
work page 2022
-
[15]
R. F. Muirhead, Some methods applicable to identities and inequalities of symmetric algebraic functions ofnletters, Proceedings of the Edinburgh Mathematical Society 21 (1902/03) 144-157. 14
work page 1902
-
[16]
I. Newton, Arithmetica universalis: sive de compositione et resolutione arithmetica liber, Leiden, Opera, I, 1732, p. 173
-
[17]
E. Smirnov, A. Tutubalina, Symmetric Functions: A Beginner’s Course, Springer Cham, 2024, p. 39
work page 2024
-
[18]
S. Sra, On inequalities for normalized Schur functions, European Journal of Combina- torics 51 (2016) 492-494
work page 2016
-
[19]
R. P. Stanley, Enumerative Combinatorics, vol. 2, Cambridge University Press, Cam- bridge, 1999, pp. 286-412
work page 1999
-
[20]
V. Timofte, On the positivity of symmetric polynomial functions.: Part I: General results, Journal of Mathematical Analysis and Applications 284(1) (2003) 174-190
work page 2003
-
[21]
V. Timofte, A. Timofte, On algorithms testing positivity of real symmetric polynomials, Journal of Inequalities and Applications 135 (2021), article number: 135
work page 2021
-
[22]
B. C. Xia, L. Yang, Automated Inequality Proving and Discovering, World Scientific, Singapore, 2016
work page 2016
-
[23]
J. Xu, Y. Yao, Pólya method and the successive difference substitution method, Science China Mathematics 42 (2012) 203-213. (in Chinese). 15
work page 2012
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.