A cycle lemma for permutation inversions (Q1849989)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A cycle lemma for permutation inversions |
scientific article |
Statements
A cycle lemma for permutation inversions (English)
0 references
2 December 2002
0 references
The permutations of the multiset \(\{ 1^{m_1},2^{m_2}\}\) of size \(n=m_1+m_2\) can be enumerated by the number of inversions. For \(d=\gcd(m_1,m_2)\), the authors give a combinatorial proof that the remainders modulo \(n/d\) of the numbers of inversions are equally distributed, and the remainders modulo \(m_1/d\) of the numbers of inversions of permutations whose first term is 1 are equally distributed. These results provide combinatorial interpretations of some properties of the Gaussian binomial coefficients.
0 references
multiset
0 references
permutation
0 references
inversion
0 references
major index
0 references
cyclic shift
0 references
greatest common divisor
0 references
Gaussian binomial coefficient
0 references