Parenthesizations of finite distributive lattices

DOI10.1007/BF01191783MaRDI QIDQ585236zbMATH OpenFDO

Authors Emden R. Gansner

Publication date 1983

Published in Algebra Universalis (Search for Journal in Brave)

zbMATH Keywords

symmetric chain decompositionchain decomposition of finite distributive latticelexicographic partial matchingsparenthesisation

Mathematics Subject Classification ID

Structure and representation theory of distributive lattices (06D05)

Cites work

• scientific article; zbMATH DE number 3704591 (Why is no real title available?)
• scientific article; zbMATH DE number 3749179 (Why is no real title available?)
• scientific article; zbMATH DE number 3304025 (Why is no real title available?)
• Collections of Subsets with the Sperner Property
• Combinatorial Structure of the Faces of then-Cube
• Lexicographic matching in Boolean algebras
• Maximum antichains of rectangular arrays
• On a lemma of Littlewood and Offord on the distribution of certain sums
• On chains and Sperner k-families in ranked posets
• On the lattice of faces of the 𝑛-cube
• On the lattice of order ideals of an up-down poset
• Strong versions of Sperner's theorem
• Sufficient Conditions for a Symmetric Chain Order
• The structure of Sperner k-families

Cited in

(2)

• On the lattice of order ideals of an up-down poset
• Symmetric Fibonaccian distributive lattices and representations of the special linear Lie algebras

This page was built for publication: Parenthesizations of finite distributive lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q585236)