Dilworth Numbers, Incidence Maps and Product Partial Orders
From MaRDI portal
Publication:3966187
DOI10.1137/0601024zbMath0501.06003OpenAlexW2045527623MaRDI QIDQ3966187
Publication date: 1980
Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0601024
Sperner propertyfinite partially ordered setDilworth numbersunion of antichainsproduct of partial orders
Related Items (14)
Representations of $\mathfrak{sl}( 2,\mathbb{C} )$ on Posets and the Sperner Property ⋮ Combinatorial verification of the elementary divisors of tensor products ⋮ Acyclic Digraphs, Young Tableaux and Nilpotent Matrices ⋮ Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property ⋮ Chain lengths in the dominance lattice ⋮ A partition of L(3,n) into saturated symmetric chains ⋮ Product partial orders with the Sperner property ⋮ Bound on the Jordan type of a generic nilpotent matrix commuting with a given matrix ⋮ The poset of the nilpotent commutator of a nilpotent matrix ⋮ The smallest part of the generic partition of the nilpotent commutator of a nilpotent matrix ⋮ Finite posets and Ferrers shapes ⋮ An asymptotic formula for the maximum size of an h-family in products of partially ordered sets ⋮ Some sequences associated with combinatorial structures ⋮ Brauer diagrams, updown tableaux and nilpotent matrices
Cites Work
- Unnamed Item
- A short proof of the existence of k-saturated partitions of partially ordered sets
- On chains and Sperner k-families in ranked posets
- Product partial orders with the Sperner property
- The morphology of partially ordered sets
- Some partitions associated with a partially ordered set
- Weyl Groups, the Hard Lefschetz Theorem, and the Sperner Property
- [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
- The structure of Sperner k-families
This page was built for publication: Dilworth Numbers, Incidence Maps and Product Partial Orders
