The number of inversions of permutations with fixed shape

DOI10.54550/ECA2022V2S4PP1zbMATH Open1512.05005arXiv1712.10122OpenAlexW3212666067MaRDI QIDQ6156003FDOQ6156003

Authors: A. Ayyer 

Publication date: 9 June 2023

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

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 $lambda$ under this map. Hohlweg characterized permutations having shape $lambda$ 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 $lambda$ where the extra number of inversions is less than the length of the smallest column of $lambda$. We prove the result when $lambda$ has two columns.

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

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

zbMATH Keywords

inversionsRobinson-Schensted correspondenceminimal permutationsjump partitions

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Permutations, matrices, and generalized Young tableaux
• Longest Increasing and Decreasing Subsequences
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Permutation sign under the Robinson-Schensted correspondence
• Minimal and maximal elements in two-sided cells of \(S_n\) and Robinson-Schensted correspondence
• The length of the longest increasing subsequence of a random Mallows permutation
• On the Representations of the Symmetric Group
• The solution of a conjecture of Stanley and Wilf for all layered patterns
• Note on the minimal permutations

Cited In (3)

• Permutations whose reverse shares the same recording tableau in the RS correspondence
• Inversions and Major Index for Permutations
• Enumerating \(r\)c-invariant permutations with no long decreasing subsequences

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)