Computing global Ext for complexes
Abstract: We give a computational algorithm for computing Ext groups between bounded complexes of coherent sheaves on a projective variety, and we describe an implementation of this algorithm in Macaulay2. In particular, our results yield methods for computing derived global sections of bounded complexes of coherent sheaves and mutations of exceptional collections.
Paper Prompts
Sign up for free to create and run prompts on this paper.