The number of linear extensions of the Boolean lattice

DOI10.1023/B:ORDE.0000034596.50352.f7zbMath1061.06001OpenAlexW2056461053MaRDI QIDQ1771251

Prasad Tetali, Graham R. Brightwell

Publication date: 7 April 2005

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:orde.0000034596.50352.f7

zbMATH Keywords

Boolean latticeentropy methodnumber of linear extensionsbipartite order

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Total orders (06A05)

Related Items (16)

Pattern avoidance in poset permutations ⋮ Risk-robust mechanism design for a prospect-theoretic buyer ⋮ Linear extension numbers of \(n\)-element posets ⋮ Log-concavity, ultra-log-concavity, and a maximum entropy property of discrete compound Poisson measures ⋮ On the convex hull of \(k\)-additive 0-1 capacities and its application to model identification in decision making ⋮ How often are two permutations comparable? ⋮ Sorting under partial information (without the ellipsoid algorithm). ⋮ De Finetti lattices and magog triangles ⋮ Asymptotics of the number of standard Young tableaux of skew shape ⋮ Adjacency on the order polytope with applications to the theory of fuzzy measures ⋮ Why Is Pi Less Than Twice Phi? ⋮ Counterexamples to conjectures about subset takeaway and counting linear extensions of a Boolean lattice ⋮ Bottom-up: a new algorithm to generate random linear extensions of a poset ⋮ Linear extensions and comparable pairs in partial orders ⋮ Reconstruction of Partial Orders and List Representation as Random Structures ⋮ Computing Linear Extensions for Polynomial Posets Subject to Algebraic Constraints

This page was built for publication: The number of linear extensions of the Boolean lattice