Parenthesizations of finite distributive lattices

DOI10.1007/BF01191783zbMATH Open0524.06017MaRDI QIDQ585236FDOQ585236

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

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

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)