Papers
Topics
Authors
Recent
Search
2000 character limit reached

Computing global Ext for complexes

Published 29 Sep 2025 in math.AG and math.AC | (2509.25103v1)

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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.