ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Γn=Sn⋉Γn\Gamma_n=S_n\ltimes\Gamma^n, where Γ⊂SL2(C)\Gamma\subset SL_2(\mathbb C), and let Hc,k(Γn)H_{c,k}(\Gamma_n) be the corresponding symplectic reflection algebra. Write the parameters as (λ,k)(\lambda,k), and let g\mathfrak g be the finite-dimensional Lie algebra associated with Γ\Gamma. Define the hyperplanes

Em,N:km+N=0,m∈Z,2≤m≤n,N∈Z,gcd⁡(m,N)=1,E_{m,N}: km+N=0,\qquad m\in\mathbb Z,\quad 2\le m\le n,\quad N\in\mathbb Z,\quad \operatorname{gcd}(m,N)=1,

and

Hα,m,N:(λ,α)+km+N=0,H_{\alpha,m,N}: (\lambda,\alpha)+km+N=0,

where ∣m∣≤n−1|m|\le n-1, α\alpha is a root of g\mathfrak g, and N∈Z≥0N\in\mathbb Z_{\ge 0}.

Etingof's simplicity conjecture. The algebra Hc,k(Γn)H_{c,k}(\Gamma_n) is simple if and only if (λ,k)(\lambda,k) belongs to none of the hyperplanes Em,NE_{m,N} or Hα,m,NH_{\alpha,m,N}.

The conjecture makes precise the known statement that simplicity fails only on a countable collection of parameter hyperplanes. The paper states that it holds for n=1n=1 and for all nn when Γ\Gamma is cyclic; the remaining cases are 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.