Singular Manual: gradedModules_lib

> | ### D.15.20 gradedModules_lib Library: gradedModules.lib Purpose: 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 Procedures:
> D.15.20.1 grobj |  | construct a graded object (map) given by matrix M
> D.15.20.2 grtest |  | check whether A is a valid graded object
> D.15.20.3 grdeg |  | compute graded degrees of columns of the map M
> D.15.20.4 grview |  | view the graded structure of map M
> D.15.20.5 grshift |  | shift graded module coker(M) by +d
> D.15.20.6 grzero |  | presentation of S(0)^1
> D.15.20.7 grtwist |  | presentation of S(d)^r
> D.15.20.8 grtwists |  | presentation of S(v[1])+...+S(v[size(v)])
> D.15.20.9 grsum |  | direct sum of two graded modules coker(M) + coker(N)
> D.15.20.10 grpower |  | direct p-th power of graded module coker(M)
> D.15.20.11 grtranspose |  | un-ordered graded transpose of map M
> D.15.20.12 grgens |  | try to compute submodule generators of coker(M)
> D.15.20.13 grpres |  | presentation of submodule generated by columns of F
> D.15.20.14 grorder |  | reorder cols/rows of M for correct graded-block-structure
> D.15.20.15 grtranspose1 |  | reordered graded transpose of map M
> D.15.20.16 TestGRRes |  | compute/order/transpose a graded resolution of ideal I
> D.15.20.17 KeneshlouMatrixPresentation |  | build some presentation with intvec v
> D.15.20.18 grsyz |  | syzygy of Im(M)
> D.15.20.19 grres |  | resolution of Im(M) of length l... minimal?
> D.15.20.20 grlift |  | graded lift, gens!
> D.15.20.21 grprod |  | composition of graded maps (product of matrices?)
> D.15.20.22 grgroebner |  | Groebner Basis of Im(M) as a graded object
> D.15.20.23 grconcat |  | sum of maps into the same target module
> D.15.20.24 grrndmat |  | generate random matrix compatible with src and dst gradings
> D.15.20.25 grrndmap |  | generate random 0-deg homomorphism src(S) -> src(D)
> D.15.20.26 grrndmap2 |  | generate random 0-deg homomorphism dst(S) -> dst(D)
> D.15.20.27 grlifting |  | RND! chain lifting
> D.15.20.28 grlifting2 |  | RND! chain lifting
> D.15.20.29 mappingcone |  |
> D.15.20.30 grlifting3 |  | RND! chain lifting? probably wrong one
> D.15.20.31 mappingcone3 |  |
> D.15.20.32 grrange |  | get the row-weightings
> D.15.20.33 grneg |  | graded object given by -A
> D.15.20.34 matrixpres |  | matrix presentation of direct sum of Omega^{a[i]}(i)

User manual for Singular version 4-1-3p2, 2020, generated by texi2html.