2000 character limit reached
Orbifold Quot schemes via the Le Bruyn-Procesi theorem (2407.18740v1)
Published 26 Jul 2024 in math.AG
Abstract: This note provides a short proof of the fact that the reduced scheme underlying each orbifold Quot scheme associated to a finite subgroup of SL(2,C) is isomorphic to a Nakajima quiver variety. Our approach uses recent work of the author with Yamagishi, allowing us to bypass the combinatorial arguments and the use of recollement from the original paper with Gammelgaard, Gyenge and Szendroi.
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.