arXiv · math/0310301
A bijective proof of an unusual symmetric group generating function
Abstract
For $σ\in S_n$, let $D(σ) = \{i : σ_{i} > σ_{i+1}\}$ denote the descent set of $σ$. The length of the permutation is the number of inversions, denoted by $inv(σ) = \big | \{(i,j) : i σ_j\} \big |$. Define an unusual quadratic statisitic by $baj(σ) = \sum_{i \in D(σ)} i (n-i)$. We present here a bijective proof of the identity $\sum_{{σ\in S_n} \atop {σ(n) = k}} q^{baj(σ) - inv(σ)} = \prod_{i=1}^{n-1} {1-q^{i (n-i)} \over {1-q^i}}$ where $k$ is a fixed integer.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Mike Zabrocki. 2003-10-19. A bijective proof of an unusual symmetric group generating function. https://arxiv.org/abs/math/0310301
Cite the original work for its findings. Save a collection to share your selection of sources.