English

A bijective proof of an unusual symmetric group generating function

Combinatorics 2007-05-23 v1

Abstract

For σSn\sigma \in S_n, let D(σ)={i:σi>σi+1}D(\sigma) = \{i : \sigma_{i} > \sigma_{i+1}\} denote the descent set of σ\sigma. The length of the permutation is the number of inversions, denoted by inv(σ)={(i,j):i<j,σi>σj}inv(\sigma) = \big | \{(i,j) : i<j, \sigma_i > \sigma_j\} \big |. Define an unusual quadratic statisitic by baj(σ)=iD(σ)i(ni)baj(\sigma) = \sum_{i \in D(\sigma)} i (n-i). We present here a bijective proof of the identity σSnσ(n)=kqbaj(σ)inv(σ)=i=1n11qi(ni)1qi\sum_{{\sigma \in S_n} \atop {\sigma(n) = k}} q^{baj(\sigma) - inv(\sigma)} = \prod_{i=1}^{n-1} {{1-q^{i (n-i)}} \over {1-q^i}} where kk 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

R2 v1 2026-07-22T16:58:49.038Z