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
Parents
72
The Alternating Syzygy Behavior of Monomial Algebras
Michael Bardzell · Journal of Algebra · 1997 · 123 citations
1–5 of 72
114
5
h-index
4
h-index
3
h-index
3
h-index
3
h-index
1–5 of 114
83

Brandeis University
Waltham, United States
7 h-index
8 publications
242 citations
University of Illinois Chicago
Chicago, United States
3 h-index
3 publications
285 citations
Massachusetts Institute of Technology
Cambridge, United States
3 h-index
3 publications
198 citations

Centre National de la Recherche Scientifique
Paris, France
3 h-index
2 publications
40 citations
University of Michigan
Ann Arbor, United States
3 h-index
4 publications
143 citations
University of Pittsburgh
Pittsburgh, United States
2 h-index
2 publications
25 citations

Osnabrück University
Osnabrück, Germany
2 h-index
3 publications
117 citations
Columbia University
New York, United States
2 h-index
3 publications
264 citations
1–8 of 83
12 publications · 403 citations
11
h-index
5 publications · 328 citations
5
h-index
4 publications · 248 citations
4
h-index
2 publications · 131 citations
2
h-index
2 publications · 148 citations
2
h-index
1–5