Tate resolutions for products of projective spaces (Q2352381)

From MaRDI portal
Revision as of 05:00, 19 April 2024 by Importer (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Tate resolutions for products of projective spaces
scientific article

    Statements

    Tate resolutions for products of projective spaces (English)
    0 references
    0 references
    0 references
    0 references
    1 July 2015
    0 references
    Let \(X\) be such that its derived category of coherent sheaves, \(D^b(X)\) admits a \textit{full strongly exceptional collection} \((U^a)_{a\in A}\) (cf. [\textit{D. Huybrechts}, Fourier-Mukai transforms in algebraic geometry. Oxford Mathematical Monographs. Oxford Science Publications. Oxford: Clarendon Press (2006; Zbl 1095.14002)]). Then every coherent sheaf \(\mathscr F\) can be represented by a complex whose term are direct sums of elements in \((U^a)\). This is called \textit{Beilison monad of \(\mathscr F\)}. A \textit{Tate resolution} for \(\mathcal F\) is a a doubly infinite complex which simultaneously packages all the cohomology spaces and the Beilison monads of all the twists of \(\mathscr F\). The construction of a Tate resolution for sheaves on the projective space yields in many cases the fastest algorithms for computing cohomology (cf. [\textit{D. Eisenbud} et al., Trans. Am. Math. Soc. 355, No. 11, 4397--4426 (2003; Zbl 1063.14021)]). In this paper, masterly written, the authors show the existence of and provide algorithms to construct Tate resolutions for sheaves on the product of the projective spaces. As application to their work the prove a splitting criterion for vector bundles over products of projective spaces which broadly generalize Horrocks' criterion.
    0 references
    Tate resolution
    0 references
    BGG correspondence
    0 references
    free resolution
    0 references
    cohomology computing algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references