Pages that link to "Item:Q1771251"
From MaRDI portal
The following pages link to The number of linear extensions of the Boolean lattice (Q1771251):
Displaying 16 items.
- Pattern avoidance in poset permutations (Q304187) (← links)
- Log-concavity, ultra-log-concavity, and a maximum entropy property of discrete compound Poisson measures (Q385153) (← links)
- Counterexamples to conjectures about subset takeaway and counting linear extensions of a Boolean lattice (Q722587) (← links)
- Asymptotics of the number of standard Young tableaux of skew shape (Q1746566) (← links)
- Linear extensions and comparable pairs in partial orders (Q1789051) (← links)
- Risk-robust mechanism design for a prospect-theoretic buyer (Q2147995) (← links)
- De Finetti lattices and magog triangles (Q2227838) (← links)
- Adjacency on the order polytope with applications to the theory of fuzzy measures (Q2270242) (← links)
- Bottom-up: a new algorithm to generate random linear extensions of a poset (Q2279676) (← links)
- Sorting under partial information (without the ellipsoid algorithm). (Q2439837) (← links)
- Linear extension numbers of \(n\)-element posets (Q2663168) (← links)
- How often are two permutations comparable? (Q3522279) (← links)
- Why Is Pi Less Than Twice Phi? (Q4685116) (← links)
- Reconstruction of Partial Orders and List Representation as Random Structures (Q4982079) (← links)
- Computing Linear Extensions for Polynomial Posets Subject to Algebraic Constraints (Q5001675) (← links)
- On the convex hull of \(k\)-additive 0-1 capacities and its application to model identification in decision making (Q6061467) (← links)
