
TL;DR
This paper provides an elementary proof of a known inequality involving Kostka numbers, showing that for partitions with a dominance relation, the Kostka number decreases accordingly.
Contribution
It offers a new, elementary proof of a classical result on Kostka numbers, addressing a question from MathOverflow.
Findings
Proves that if nd are partitions with ; , then K_{\u001,} ; K_{,}
Establishes the inequality K_{\u001,} ; K_{,} under dominance order
Provides insight into the structure of Kostka numbers and their monotonicity properties.
Abstract
We give an elementary proof of a well-known result on Kostka numbers, following a question from Mark Wildon on MathOverflow. Namely, we show that given partitions of with , we have .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplex Systems and Time Series Analysis · Mathematical and Theoretical Analysis · Advanced Topology and Set Theory
