In this paper, we first introduce the number of signed permutations with exactly k inversions, which is denoted by iB(n,k) and called Mahonian numbers of type B. Then we provide a recurrence relation for the Mahonian numbers iB(n,k). In addition, we give an explicit recursive description for the summation of inversions of all permutations in the hyperoctahedral group Bₙ, denoted by Bₙ. Furthermore, we enumerate the total number of inversions in permutations in the hyperoctahedral group Bₙ concretely with the help of an inversion statistic and a backward permutation concepts on Bₙ.
No takes yet. Share an insight, caveat, or question.
Hasan Arslan (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: