The major-index polynomial-degree conjecture

Let SnS_n be the symmetric group, let maj(π)\operatorname{maj}(\pi) denote the major index of π\pi, and let M(n,k)M(n,k) be the number of permutations wSnw\in S_n with inv(w)=k\operatorname{inv}(w)=k. For fixed k>0k>0 and nkn\geq k, consider the expected value of the first letter conditioned on maj(π)=k\operatorname{maj}(\pi)=k.

Major-index conjecture. This expected value is a rational function in nn that is 1/(k+1)1/(k+1) times the quotient of a monic degree-(k+1)(k+1) polynomial by a monic degree-kk polynomial. In particular, the source gives

E[π(1)πSn,maj(π)=1]=12\originalleft(n2+n2n1\aftergroup\originalright),\mathbb{E}[\pi(1)\mid \pi\in S_n,\operatorname{maj}(\pi)=1]=\frac{1}{2}\mathopen{}\mathclose\bgroup\originalleft(\frac{n^2+n-2}{n-1}\aftergroup\egroup\originalright), E[π(1)πSn,maj(π)=2]=13\originalleft(n3n6n2n2\aftergroup\originalright),\mathbb{E}[\pi(1)\mid \pi\in S_n,\operatorname{maj}(\pi)=2]=\frac{1}{3}\mathopen{}\mathclose\bgroup\originalleft(\frac{n^3-n-6}{n^2-n-2}\aftergroup\egroup\originalright), E[π(1)πSn,maj(π)=3]=14\originalleft(n4+6n313n218nn37n\aftergroup\originalright),\mathbb{E}[\pi(1)\mid \pi\in S_n,\operatorname{maj}(\pi)=3]=\frac{1}{4}\mathopen{}\mathclose\bgroup\originalleft(\frac{n^4+6n^3-13n^2-18n}{n^3-7n}\aftergroup\egroup\originalright), E[π(1)πSn,maj(π)=4]=15\originalleft(n5+20n445n380n216nn4+2n313n214n\aftergroup\originalright).\mathbb{E}[\pi(1)\mid \pi\in S_n,\operatorname{maj}(\pi)=4]=\frac{1}{5}\mathopen{}\mathclose\bgroup\originalleft(\frac{n^5+20n^4-45n^3-80n^2-16n}{n^4+2n^3-13n^2-14n}\aftergroup\egroup\originalright).

The denominator is an integer multiple of M(n,k)M(n,k), a degree-kk polynomial. This is presented as a conjectured pattern for the major index; the supplied text gives no resolution evidence, so it remains open.

Sources & referencesView supporting material

Primary source

Peter Kagey, “Expected value of letters of permutations with a given number of k-cycles”, arXiv:2112.05281 (2021).

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.