How often are two permutations comparable?
From MaRDI portal
Publication:3522279
DOI10.1090/S0002-9947-08-04478-4zbMath1154.05002OpenAlexW2034248008MaRDI QIDQ3522279
Publication date: 1 September 2008
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0002-9947-08-04478-4
Permutations, words, matrices (05A05) Combinatorics of partially ordered sets (06A07) Combinatorial probability (60C05) Asymptotic enumeration (05A16) Permutation groups (20B99)
Related Items
Skew shape asymptotics, a case-based introduction ⋮ Effective Poset Inequalities ⋮ Trivial meet and join within the lattice of monotone triangles. ⋮ Hook inequalities ⋮ Fibonacci numbers, reduced decompositions, and 321/3412 pattern classes ⋮ Asymptotics of the number of standard Young tableaux of skew shape ⋮ Equivalence Classes for the μ-Coefficient of Kazhdan–Lusztig Polynomials inSn ⋮ On comparability of bigrassmannian permutations ⋮ On max–min representations of ordered median functions ⋮ Asymptotics of pattern avoidance in the Klazar set partition and permutation-tuple settings ⋮ Fast distance multiplication of unit-Monge matrices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- q-hook length formulas for forests
- The number of linear extensions of subset ordering
- Some characterizations of Bruhat ordering on a Coxeter group and determination of the relation Möbius function
- Random set partitions: Asymptotics of subset counts
- Lattices and bases of Coxeter groups
- An improved tableau criterion for Bruhat order
- The number of linear extensions of the Boolean lattice
- Confirming two conjectures about the integer partitions
- Two new criteria for comparison in the Bruhat order
- Principles of combinatorics
- Combinatorics of Coxeter Groups
