The number of linear extensions of subset ordering

DOI10.1016/0012-365X(87)90016-1zbMath0647.05003OpenAlexW2044306617MaRDI QIDQ1104324

Jichang Sha, Daniel J. Kleitman

Publication date: 1987

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(87)90016-1

zbMATH Keywords

subsetslinear extensionsfinite setcontainment ordering

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Chain conditions, complete algebras (06E10)

Related Items (9)

Skew shape asymptotics, a case-based introduction ⋮ Log-concavity, ultra-log-concavity, and a maximum entropy property of discrete compound Poisson measures ⋮ How often are two permutations comparable? ⋮ De Finetti lattices and magog triangles ⋮ Asymptotics of the number of standard Young tableaux of skew shape ⋮ Sharpening the LYM inequality ⋮ Counterexamples to conjectures about subset takeaway and counting linear extensions of a Boolean lattice ⋮ Linear extensions and comparable pairs in partial orders ⋮ Computing Linear Extensions for Polynomial Posets Subject to Algebraic Constraints

Cites Work

• On subsets contained in a family of non-commensurable subsets of a finite set

This page was built for publication: The number of linear extensions of subset ordering