← All problems

Steingrímsson's Euler–Mahonian conjecture for ordered partitions

20 years old · traced to

Let OPnk\mathcal{OP}_n^k be the set of ordered partitions of [n][n] into kk blocks, and let mak⁡\operatorname{mak}, lmak⁡\operatorname{lmak}, bInv⁡\operatorname{bInv}, and bMaj⁡\operatorname{bMaj} be the statistics defined in the paper. Set

cbInv⁡=(k2)−bInv⁡,cbMaj⁡=(k2)−bMaj⁡,\operatorname{cbInv}=\binom{k}{2}-\operatorname{bInv},\qquad \operatorname{cbMaj}=\binom{k}{2}-\operatorname{bMaj},

and define

cinvLSB⁡=lsb⁡+cbInv⁡+(k2),cmajLSB⁡=lsb⁡+cbMaj⁡+(k2).\operatorname{cinvLSB}=\operatorname{lsb}+\operatorname{cbInv}+\binom{k}{2},\qquad \operatorname{cmajLSB}=\operatorname{lsb}+\operatorname{cbMaj}+\binom{k}{2}.

Steingrímsson's conjecture. The statistics

mak⁡+bInv⁡,lmak⁡+bInv⁡,mak⁡+bMaj⁡,lmak⁡+bMaj⁡,\operatorname{mak}+\operatorname{bInv},\quad \operatorname{lmak}+\operatorname{bInv},\quad \operatorname{mak}+\operatorname{bMaj},\quad \operatorname{lmak}+\operatorname{bMaj},

and cinvLSB⁡\operatorname{cinvLSB} and cmajLSB⁡\operatorname{cmajLSB} are Euler–Mahonian on OPnk\mathcal{OP}_n^k: their generating functions over OPnk\mathcal{OP}_n^k are all equal to

[k]q!Sq(n,k).[k]_q!S_q(n,k).

This conjecture concerns equidistribution of partition statistics and their qq-Stirling generating functions; the source presents it as the reduction of conjectures from Steingrímsson.

References

Status

  • Solved: A. Kasraoui. Computing generating functions of ordered partitions with the transfer-matrix method (Discrete Mathematics & Theoretical Computer Science, 2017) https://doi.org/10.46298/dmtcs.3508

Source: Masao Ishikawa, Anisse Kasraoui and Jiang Zeng, “Statistics on Ordered Partitions of Sets and q-Stirling Numbers”, arXiv:math/0605390 (2006).

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.