A bijective proof of an unusual symmetric group generating function
arXiv:math/0310301
Abstract
For , let denote the descent set of . The length of the permutation is the number of inversions, denoted by . Define an unusual quadratic statisitic by . We present here a bijective proof of the identity where is a fixed integer.
4 pages