The candidate basis conjecture for the super-diagonal coinvariant ring

From papers

Let n1n\geq1. For each ordered set partition Π\Pi of [n][n], let BΠ\mathcal{B}_\Pi be the set of monomials constructed from the associated permutation, Grassmann monomial, and schedule-number factors, and define Bn\mathcal{B}_n to be the union of the sets BΠ\mathcal{B}_\Pi. Candidate basis conjecture. For n1n\geq1, Bn\mathcal{B}_n forms a basis for SDRn\operatorname{SDR}_n. The construction is designed to match area, diagonal-inversion, and marking degrees of marked parking functions. The text presents this as a candidate basis and gives evidence, while noting that even the specialization with all yi=0y_i=0 is not known to be a basis.

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.