Euler–Mahonian conjecture for the LSB statistics on ordered partitions

Let [n][n] be partitioned into kk ordered blocks. Let \lsb\lsb be the left-smaller-block statistic, and let \mathop{\text{\text{\rm cb}\text{\maj}}} and \mathop{\text{\text{\rm cb}\text{\inv}}} denote the corresponding block major-index and block inversion statistics. Define

cmaj\LSB=\lsb+cb\maj+(k2),cinv\LSB=\lsb+cb\inv+(k2).\mathop{\text{\text{\rm cmaj}\text{$\LSB$}}}=\lsb+\mathop{\text{\text{\rm cb}\text{$\maj$}}}+\binom{k}{2},\qquad \mathop{\text{\text{\rm cinv}\text{$\LSB$}}}=\lsb+\mathop{\text{\text{\rm cb}\text{$\inv$}}}+\binom{k}{2}.

LSB Euler–Mahonian conjecture. The statistics \mathop{\text{\text{\rm cmaj}\text{\LSB}}} and \mathop{\text{\text{\rm cinv}\text{\LSB}}} are Euler–Mahonian on ordered partitions of [n][n] into kk blocks. On ordinary partitions, both reduce to \lsb+(k2)\lsb+\binom{k}{2}, which is already known to be Euler–Mahonian; the ordered-partition assertion remains conjectural.

Sources & referencesView supporting material

Primary source

Einar Steingrimsson, “Statistics on ordered partitions of sets”, arXiv:math/0605670 (2019).

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.