Greedy matching in Young's lattice
From MaRDI portal
Publication:1813931
DOI10.1007/BF00346131zbMath0748.06002OpenAlexW2087395748MaRDI QIDQ1813931
Publication date: 25 June 1992
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00346131
Combinatorial aspects of partitions of integers (05A17) Combinatorics of partially ordered sets (06A07)
Cites Work
- Unimodality of Gaussian coefficients: A constructive proof
- A partition of L(3,n) into saturated symmetric chains
- A symmetric chain decomposition of L(4,n)
- Unimodality and Young's lattice
- Lexicographic matching in Boolean algebras
- The Odlyzko Conjecture and O'Hara's Unimodality Proof
- Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property
This page was built for publication: Greedy matching in Young's lattice