Syzygy Computation

Syzygy Computation is a method in computational algebra that systematically determines the module of relations (syzygies) among a given set of generators in a polynomial ring or free module, typically through algorithmic Gröbner basis techniques.

72

Publications

2.8K

Citations

114

Authors

83

Institutions

Publications per year

2017–2026

7

Authors

114

  1. RL
    Robert Lazarsfeld

    University of Illinois Chicago, United States

    5 publications · 448 citations

    5

    h-index

  2. MS
    Michael Stillman

    Cornell University, United States

    4 publications · 234 citations

    4

    h-index

  3. LE
    Lawrence Ein

    University of Illinois Chicago, United States

    3 publications · 285 citations

    3

    h-index

  4. AS
    Aron Simis

    Universidade Federal de Pernambuco, Brazil

    3 publications · 136 citations

    3

    h-index

  5. FS
    Frank–Olaf Schreyer

    Saarland University, Germany

    2 publications · 41 citations

    3

    h-index

1–5 of 114

Venues

  1. Journal of Algebra

    12 publications · 403 citations

    11

    h-index

  2. Inventiones mathematicae

    5 publications · 328 citations

    5

    h-index

  3. Journal of Symbolic Computation

    4 publications · 248 citations

    4

    h-index

  4. American Journal of Mathematics

    2 publications · 131 citations

    2

    h-index

  5. Journal of Pure and Applied Algebra

    2 publications · 148 citations

    2

    h-index

1–5