Computer-generated symmetric chain decompositions for \(L(4,n)\) and \(L(3,n)\)

DOI10.1016/j.aam.2003.11.003zbMath1054.05008OpenAlexW1986968573MaRDI QIDQ1883387

Xiangdong Wen

Publication date: 12 October 2004

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aam.2003.11.003

zbMATH Keywords

posetssymmetric chain decompositionYoung's partition lattice

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Combinatorial aspects of representation theory (05E10) Combinatorics of partially ordered sets (06A07)

Related Items (3)

A combinatorial proof of the unimodality and symmetry of weak composition rank sequences ⋮ Unimodality via Kronecker products ⋮ Unnamed Item

Uses Software

• Maple

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)
• Kathy O'Hara's Constructive Proof of the Unimodality of the Gaussian Polynomials

This page was built for publication: Computer-generated symmetric chain decompositions for \(L(4,n)\) and \(L(3,n)\)