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