The number of inversions of permutations with fixed shape
From MaRDI portal
(Redirected from Publication:6156003)
Abstract: The Robinson-Schensted correspondence can be viewed as a map from permutations to partitions. In this work, we study the number of inversions of permutations corresponding to a fixed partition under this map. Hohlweg characterized permutations having shape with the minimum number of inversions. Here, we give the first results in this direction for higher numbers of inversions. We give explicit conjectures for both the structure and the number of permutations associated to where the extra number of inversions is less than the length of the smallest column of . We prove the result when has two columns.
Recommendations
- scientific article; zbMATH DE number 4012618
- scientific article; zbMATH DE number 2000846
- An asymptotic expansion for the number of permutations with a certain number of inversions
- Permutations with inversions
- Inversions in \(k\)-sorted permutations
- On the number of inversions in bimodal permutations
- Sum of lengths of inversions in permutations
- On inversions and cycles in permutations
- Permutation statistics on involutions
Cites work
- scientific article; zbMATH DE number 1001729 (Why is no real title available?)
- scientific article; zbMATH DE number 3771876 (Why is no real title available?)
- scientific article; zbMATH DE number 44579 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 3577263 (Why is no real title available?)
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 1181673 (Why is no real title available?)
- Longest Increasing and Decreasing Subsequences
- Minimal and maximal elements in two-sided cells of \(S_n\) and Robinson-Schensted correspondence
- Note on the minimal permutations
- On the Representations of the Symmetric Group
- Permutation sign under the Robinson-Schensted correspondence
- Permutations, matrices, and generalized Young tableaux
- The length of the longest increasing subsequence of a random Mallows permutation
- The solution of a conjecture of Stanley and Wilf for all layered patterns
Cited in
(3)
This page was built for publication: The number of inversions of permutations with fixed shape
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6156003)