A bijective proof of an unusual symmetric group generating function
| dc.creator | Zabrocki, Mike | |
| dc.date | 2003-10-19 | |
| dc.date.accessioned | 2026-07-07T05:02:05Z | |
| dc.date.available | 2026-07-07T05:02:05Z | |
| dc.description | 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, σ_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. | |
| dc.description | 4 pages | |
| dc.identifier | https://arxiv.org/abs/math/0310301 | |
| dc.identifier | http://arxiv.org/abs/math/0310301 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/68917 | |
| dc.subject | Combinatorics | |
| dc.subject | 05A05 (primary) 20F55 | |
| dc.title | A bijective proof of an unusual symmetric group generating function | |
| dc.type | text |