← All problems

Dais–Henk–Ziegler projective crepant-resolution conjecture

For every integer n≥2n\ge 2 and every finite subgroup G⊂SL⁡n(C)G\subset \operatorname{SL}_n(\mathbb{C}) such that Cn/G\mathbb{C}^n/G is a complete intersection, the quotient singularity Cn/G\mathbb{C}^n/G admits a projective crepant resolution.

References

Source: arXiv

Progress summary

Refreshed
Open · solution reported

An unrefereed October preprint claims explicit counterexamples that disprove the conjecture, but the claim has not been independently checked.

The Dais–Henk–Ziegler conjecture proposed projective crepant resolutions for a broad class of quotient singularities, extending results known for abelian complete intersections. The original work dates from 1998, with a broader 2005 study of higher-dimensional cases.

Known results

  • Abelian Gorenstein quotient complete intersections admit torus-equivariant projective crepant resolutions in all dimensions (Dais, Henk, Ziegler, 1998).
  • For higher-dimensional finite subgroups G⊂SL⁡(r,C)G \subset \operatorname{SL}(r,\mathbb{C}), necessary conditions were obtained using Hilbert-basis elements and bounds on ∣G∣|G| (Dais, Henk, Ziegler, 2005).
  • Later examples established both existence and nonexistence of crepant resolutions in dimension 44, without a general criterion.

October 12, 2026 counterexamples

On October 12, 2026, Dominik Burek and Sławomir Cynk's preprint Crepant resolutions of four-dimensional finite quotients claimed a complete case-by-case criterion for C4/G\mathbb{C}^4/G with G⊂SL⁡4(Z)G \subset \operatorname{SL}_4(\mathbb{Z}), including explicit counterexamples to the conjecture. It also claims that neither the Molien series nor the age polynomial decides existence. The result is unrefereed and has no independent mathematical assessment in the retrieved sources.

Current status (as of October 2026): The conjecture has claimed counterexamples and is therefore claimed solved, but the preprint is unverified; the earlier abelian complete-intersection cases remain established.

Sources

Solutions 0

No solutions have been posted yet.