Operations with graded modules/matrices/resolutions
Authors:
Oleksandr Motsak <U@D>, where U=motsak, D=mathematik.uni-kl.de
Hanieh Keneshlou <hkeneshlou@yahoo.com>
Overview:
The library contains several procedures for constructing and manipulating graded modules/matrices/resolutions.
Basics about graded objects can be found in [DL].
Throughout this library graded objects are graded maps, that is,
matrices with polynomials, together with grading weights for source and
destination. Graded modules are implicitly given as coker of a graded map.
Note that in special cases we may also consider submodules in S^r generated
by columns of a graded polynomial matrix (or a graded map).
Note:
set assumeLevel to positive integer value in order to auto-check all assumptions.
We denote the current basering by S.
References:
[DL] Decker, W., Lossen, Ch.: Computing in Algebraic Geometry, Springer, 2006