A bijective proof of an unusual symmetric group generating function
Combinatorics
2007-05-23 v1
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.
Keywords
Cite
@article{arxiv.math/0310301,
title = {A bijective proof of an unusual symmetric group generating function},
author = {Mike Zabrocki},
journal= {arXiv preprint arXiv:math/0310301},
year = {2007}
}
Comments
4 pages