A symmetric chain decomposition of L(4,n)

DOI10.1016/S0195-6698(80)80040-0zbMath0447.06004OpenAlexW1968881639MaRDI QIDQ1146199

Douglas B. West

Publication date: 1980

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0195-6698(80)80040-0

zbMATH Keywords

partition of a latticesubchain

Mathematics Subject Classification ID

Structure theory of lattices (06B05)

Related Items

Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property, Computer-generated symmetric chain decompositions for \(L(4,n)\) and \(L(3,n)\), Elementary divisors and ranked posets with application to matrix compounds *, Problems on chain partitions, Strict unimodality of \(q\)-binomial coefficients, Strict unimodality of plucking polynomials of rooted trees, A combinatorial proof of the unimodality and symmetry of weak composition rank sequences, Unimodality of Gaussian coefficients: A constructive proof, Tropical decomposition of Young's partition lattice, On Bergeron's positivity problem for \(q\)-binomial coefficients, Bruhat lattices, plane partition generating functions, and minuscule representations, Interval stability and interval covering property in finite posets, Unnamed Item, Greedy matching in Young's lattice, Sperner properties for groups and relations, Unimodality of partitions with distinct parts inside Ferrers shapes

Cites Work

• A partition of L(3,n) into saturated symmetric chains
• Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property
• Sufficient Conditions for a Symmetric Chain Order