The ordered-partition Hilbert-series formula for the super-diagonal coinvariant ring

From papers

Let n1n\geq1. For an ordered set partition Π\Pi of [n][n], let Π|\Pi| be its number of blocks, let τ(Π)\tau(\Pi) be its associated permutation, and let wΠ(c)w_\Pi(c) be the schedule number of cc. Let [m]q=1+q++qm1[m]_q=1+q+\cdots+q^{m-1}. The ordered-partition Hilbert-series conjecture.

Hilb(SDRn;q,t)=ΠznΠtmaj(τ(Π))c=1n[wΠ(c)]q,\operatorname{Hilb}(\operatorname{SDR}_n;q,t)=\sum_{\Pi}z^{n-|\Pi|}t^{\operatorname{maj}(\tau(\Pi))}\prod_{c=1}^{n}[w_\Pi(c)]_q,

where the sum ranges over all ordered set partitions of [n][n]. This is proposed as a compact combinatorial expression for the Hilbert series of the super-diagonal coinvariant ring, but no resolution is supplied in the text.

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

James Haglund and Emily Sergel, “Schedules and the Delta Conjecture”, arXiv:1908.04732 (2020).

Solutions 0

No solutions have been posted yet.