A partition of L(3,n) into saturated symmetric chains

DOI10.1016/S0195-6698(80)80022-9zbMath0445.05018MaRDI QIDQ1145148

Bernt Lindström

Publication date: 1980

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

zbMATH Keywords

partially ordered setBruhat ordersymmetric chain decomposition

Mathematics Subject Classification ID

Partial orders, general (06A06) Combinatorial aspects of partitions of integers (05A17)

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, A symmetric chain decomposition of L(4,n), 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

Cites Work

• Dilworth Numbers, Incidence Maps and Product Partial Orders
• Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property
• The Normal Form of Compound and Induced Matrices
• Unnamed Item
• Unnamed Item