Gamma-nonnegativity conjecture for inversions and excedances in the symmetric group

From papers

For a permutation σSn\sigma\in S_n, let inv(σ)\operatorname{inv}(\sigma) and exc(σ)\operatorname{exc}(\sigma) denote its inversion number and excedance number, respectively, and define

Sn(q,t)=σSnqinv(σ)texc(σ).S_n(q,t)=\sum_{\sigma\in S_n}q^{\operatorname{inv}(\sigma)}t^{\operatorname{exc}(\sigma)}.

There exist polynomials γj(q)\gamma_j(q) with nonnegative integer coefficients such that

Sn(q,t/q)=σSnqinv(σ)exc(σ)texc(σ)=0j(n1)/2γj(q)tj(1+t)n12j.S_n(q,t/q)=\sum_{\sigma \in S_n} q^{\operatorname{inv}(\sigma)-\operatorname{exc}(\sigma)}t^{\operatorname{exc}(\sigma)} = \sum_{0\leq j \leq (n-1)/2} \gamma_j(q) t^j(1+t)^{n-1-2j}.

The result would extend the analogous Z0[q]\mathbb{Z}_{\geq 0}[q] γ\gamma-nonnegativity known for permutations in the interval [e,(12n)][e,(12\cdots n)] to the entire symmetric group. Explicit examples for n=4n=4 and n=5n=5 support the claim, but the statement is presented as an expectation rather than an established theorem.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Saul A. Blanco and T. Kyle Petersen, “Counting Dyck paths by area and rank”, arXiv:1206.0803 (2012).

Solutions 0

No solutions have been posted yet.