Pages that link to "Item:Q3522279"
From MaRDI portal
The following pages link to How often are two permutations comparable? (Q3522279):
Displayed 11 items.
- Trivial meet and join within the lattice of monotone triangles. (Q405297) (← links)
- Fibonacci numbers, reduced decompositions, and 321/3412 pattern classes (Q659574) (← links)
- Asymptotics of the number of standard Young tableaux of skew shape (Q1746566) (← links)
- Skew shape asymptotics, a case-based introduction (Q2145989) (← links)
- Hook inequalities (Q2204969) (← links)
- Asymptotics of pattern avoidance in the Klazar set partition and permutation-tuple settings (Q2323247) (← links)
- Fast distance multiplication of unit-Monge matrices (Q2350900) (← links)
- On comparability of bigrassmannian permutations (Q4616099) (← links)
- Equivalence Classes for the μ-Coefficient of Kazhdan–Lusztig Polynomials in<i>S<sub>n</sub></i> (Q4915405) (← links)
- On max–min representations of ordered median functions (Q4981859) (← links)
- Effective Poset Inequalities (Q6046818) (← links)