The number of inversions of permutations with fixed shape

DOI10.54550/eca2022v2s4pp1zbMath1512.05005arXiv1712.10122OpenAlexW3212666067MaRDI QIDQ6156003

Arvind Ayyer, Unnamed Author

Publication date: 9 June 2023

Published in: Enumerative Combinatorics and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1712.10122

zbMATH Keywords

Robinson-Schensted correspondenceinversionsminimal permutationsjump partitions

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Permutations, words, matrices (05A05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Note on the minimal permutations
• Permutation sign under the Robinson-Schensted correspondence
• Permutations, matrices, and generalized Young tableaux
• Minimal and maximal elements in two-sided cells of \(S_n\) and Robinson-Schensted correspondence
• Longest Increasing and Decreasing Subsequences
• On the Representations of the Symmetric Group

This page was built for publication: The number of inversions of permutations with fixed shape