The coprime-width formula for the generalized descent difference polynomial

Let nn and kk be positive integers with 1k<n1\leq k<n, and define

Gn,k(q)=σSnqdesk(σ)desnk(σ).G_{n,k}(q)=\sum_{\sigma\in\mathfrak{S}_n}q^{\operatorname{des}_k(\sigma)-\operatorname{des}_{n-k}(\sigma)}.

Here An1(q)A_{n-1}(q) denotes the Eulerian polynomial of degree n1n-1. Coprime-width formula. If gcd(k,n)=1\gcd(k,n)=1, then

Gn,k(q)=nq1kAn1(q).G_{n,k}(q)=nq^{1-k}A_{n-1}(q).

The formula was supported by computational data for all n9n\leq 9 and all 1k<n1\leq k<n with gcd(k,n)=1\gcd(k,n)=1, but it does not hold more generally; determining whether a general formula exists remains open.

Sources & referencesView supporting material

Primary source

Robert Davis, “Width-k Generalizations of Classical Permutation Statistics”, arXiv:1701.04788 (2017).

Progress summary

Never refreshed

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

Solutions 0

No solutions have been posted yet.