How often are two permutations comparable?

DOI10.1090/S0002-9947-08-04478-4MaRDI QIDQ3522279zbMATH OpenOpenAlexFDO

Authors Adam Hammett, Boris Pittel

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

zbMATH Keywords

Bruhat orderinginversions of adjacent elementspairs of random permutationsweak ordering

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Asymptotic enumeration (05A16) Combinatorics of partially ordered sets (06A07) Permutation groups (20B99) Combinatorial probability (60C05)

Recommendations

• When all permutations are combinatorial similarities
• On comparability of bigrassmannian permutations
• Permutations with equal orders
• scientific article; zbMATH DE number 4135943
• More statistics on permutation pairs
• Statistics on pairs of permutations
• A comparative study on a permutation statistic

Cites work

• An improved tableau criterion for Bruhat order
• Combinatorics of Coxeter Groups
• Confirming two conjectures about the integer partitions
• scientific article; zbMATH DE number 1001729 (Why is no real title available?)
• scientific article; zbMATH DE number 3818741 (Why is no real title available?)
• scientific article; zbMATH DE number 47598 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3528170 (Why is no real title available?)
• scientific article; zbMATH DE number 1033382 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• scientific article; zbMATH DE number 2107707 (Why is no real title available?)
• scientific article; zbMATH DE number 765034 (Why is no real title available?)
• scientific article; zbMATH DE number 3361067 (Why is no real title available?)
• Lattices and bases of Coxeter groups
• Principles of combinatorics
• q-hook length formulas for forests
• Random set partitions: Asymptotics of subset counts
• Some characterizations of Bruhat ordering on a Coxeter group and determination of the relation Möbius function
• The number of linear extensions of subset ordering
• The number of linear extensions of the Boolean lattice
• Two new criteria for comparison in the Bruhat order

Cited in

(19)

• An improved tableau criterion for Bruhat order
• Asymptotics of the number of standard Young tableaux of skew shape
• Two new criteria for comparison in the Bruhat order
• Skew shape asymptotics, a case-based introduction
• Hook inequalities
• Asymptotics of pattern avoidance in the Klazar set partition and permutation-tuple settings
• Fast distance multiplication of unit-Monge matrices
• Trivial meet and join within the lattice of monotone triangles.
• On comparability of bigrassmannian permutations
• Equivalence classes for the -coefficient of Kazhdan-Lusztig polynomials in S_n
• On max-min representations of ordered median functions
• Free poset on permutations by scalar products
• Permutations with equal orders
• Effective Poset Inequalities
• Castelnuovo-Mumford regularity of matrix Schubert varieties
• Fibonacci numbers, reduced decompositions, and 321/3412 pattern classes
• Vanishing of Schubert coefficients via the effective Hilbert nullstellensatz
• Big data approach to Kazhdan-Lusztig polynomials
• Correlation for permutations

This page was built for publication: How often are two permutations comparable?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522279)