poly.lib
Procedures for Manipulating Polys, Ideals, Modules
O. Bachmann, G.-M: Greuel, A. Fruehbis
Procedures:
D.2.4.1 cyclic ideal of cyclic n-roots D.2.4.2 katsura katsura [i] ideal D.2.4.3 freerank rank of coker(input) if coker is free else -1 D.2.4.4 is_homog int, =1 resp. =0 if input is homogeneous resp. not D.2.4.5 is_zero int, =1 resp. =0 if coker(input) is 0 resp. not D.2.4.6 lcm lcm of given generators of ideal D.2.4.7 maxcoef maximal length of coefficient occurring in poly/... D.2.4.8 maxdeg int/intmat = degree/s of terms of maximal order D.2.4.9 maxdeg1 int = [weighted] maximal degree of input D.2.4.10 mindeg int/intmat = degree/s of terms of minimal order D.2.4.11 mindeg1 int = [weighted] minimal degree of input D.2.4.12 normalize normalize poly/... such that leading coefficient is 1 D.2.4.13 rad_con check radical containment of poly p in ideal I D.2.4.14 content content of polynomial/vector f D.2.4.15 numerator numerator of number n D.2.4.16 denominator denominator of number n D.2.4.17 mod2id conversion of a module M to an ideal D.2.4.18 id2mod conversion inverse to mod2id D.2.4.19 substitute substitute in I variables by polynomials D.2.4.20 subrInterred interred w.r.t. a subset of variables D.2.4.21 hilbPoly Hilbert polynomial of basering/I