ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let n=kp+rn=kp+r with 0≤r<p0\le r<p. Define

[k]z=1−zk1−z,[k]z!=[k]z[k−1]z⋯[1]z,[k]_z=\frac{1-z^k}{1-z},\qquad [k]_z!=[k]_z[k-1]_z\dotsm [1]_z,

and

Qr(n,z)=(n−1r−1)zr+1+∑i=0r(n−r−2+ii)zi.Q_r(n,z)=\binom{n-1}{r-1}z^{r+1}+\sum_{i=0}^{r}\binom{n-r-2+i}{i}z^i.

Here Lt,c\mathcal{L}_{t,c} is the irreducible quotient of the polynomial representation of the rational Cherednik algebra, and cc is generic. Etingof–Rains conjecture. The Hilbert series of Lt,c\mathcal{L}_{t,c} has the form

hL0,c(z)=[r]z![p]zQr(n,z)h_{\mathcal{L}_{0,c}}(z)=[r]_z![p]_zQ_r(n,z)

and

hL1,c(z)=[p]zn−1[r]zp![p]zp!Qr(n,zp).h_{\mathcal{L}_{1,c}}(z)=[p]_z^{n-1}[r]_{z^p}![p]_{z^p}!Q_r\left(n,z^p\right).

This conjecture gives the proposed Hilbert-series formula in the general case n=kp+rn=kp+r and is reported as unpublished. The formula holds in the cases established in the source and in the earlier work of Devadas and Sun, while the general case remains open.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.