2000 character limit reached
Computing resolutions of quotient singularities
Published 29 Feb 2016 in math.AG | (1603.00071v3)
Abstract: Let $G\subseteq GL(n)$ be a finite group without pseudo-reflections. We present an algorithm to compute and verify a candidate for the Cox ring of a resolution $X\rightarrow \mathbb{C}n/G$, which is based just on the geometry of the singularity $\mathbb{C}n/G$, 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 $X\rightarrow \mathbb{C}3/G$ for all $G\subseteq GL(3)$ with the aforementioned property and of order $|G|\leq 12$. We also provide examples in dimension 4.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.