Analysis of an algorithm to compute the cohomology groups of coherent sheaves and its applications (Q2364350)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Analysis of an algorithm to compute the cohomology groups of coherent sheaves and its applications
scientific article

    Statements

    Analysis of an algorithm to compute the cohomology groups of coherent sheaves and its applications (English)
    0 references
    0 references
    19 July 2017
    0 references
    The article describes an algorithm to compute the dimensions and vectorspace bases of the cohomology groups of a coherent sheaves, based on a method described in [\textit{M. Maruyama}, Gröbner bases and the application. Tokyo: Kyoritsu Publisher (2002; Zbl 1387.13001)] by computing projective resolutions and the Čech cohomology via Gröbner bases for free modules and linear algebra. The algorithm is described, its computational complexity analyzed and experiments performed (the author implemented the algorithm in Magma). Also presented are applications to computing the Frobenius action on varieties defined over perfect finite fields and to computing the ranks of morphisms of the cohomology groups. The experiments indicate that for more than seven variables, under certain conditions, the new algorithm performs better than Magma's built-in function in time and memory. In addition it computes explicit bases, whereas Magma's does not. The author indicates as part of the conclusion: ``[\dots] However, our algorithm works well under the assumption that a free resolution of a module has been computed. Thus it is necessary to improve the computation of a free resolution for a finitely generated module.''
    0 references
    0 references
    computer algebra
    0 references
    Gröbner bases
    0 references
    algebraic geometry
    0 references
    cohomology groups
    0 references
    coherent sheaves
    0 references
    0 references
    0 references
    0 references

    Identifiers

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