Computing resolutions of quotient singularities
Maria Donten-Bury, Simon Keicher

TL;DR
This paper introduces an algorithm to compute Cox rings of resolutions for quotient singularities arising from finite groups acting on complex space, enabling systematic analysis of these resolutions without prior explicit knowledge.
Contribution
The authors develop a geometry-based algorithm and implementation to compute Cox rings of resolutions for quotient singularities, including all cases in dimension three with group order up to 12.
Findings
Successfully computed Cox rings for all G in GL(3) with |G| ≤ 12.
Provided examples of resolutions in dimension four.
Validated the algorithm's effectiveness in singularity resolution analysis.
Abstract
Let be a finite group without pseudo-reflections. We present an algorithm to compute and verify a candidate for the Cox ring of a resolution , which is based just on the geometry of the singularity , without further knowledge of its resolutions. We explain the use of our implementation of the algorithms in Singular. As an application, we determine the Cox rings of resolutions for all with the aforementioned property and of order . We also provide examples in dimension 4.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
