加载中…
For , let denote the descent set of . The length of the permutation is the number of inversions, denoted by $inv(\sigma) = \big | {(i,j) : i<j, \sigma_i > \sigma_j} \big |baj(\sigma) = \sum_{i \in D(\sigma)} i (n-i)$. We present here a bijective proof of the identity $\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}}k$ is a fixed integer.

生成讲解博客的中文版本

生成AI智能校验的中文版本