# Changeset b8cf6c in git

Ignore:
Timestamp:
Feb 26, 2009, 3:07:04 PM (14 years ago)
Branches:
(u'spielwiese', '0d6b7fcd9813a1ca1ed4220cfa2b104b97a0a003')
Children:
d0207e95ed305d5305c318e2bf6c1acf7bb30320
Parents:
982e0181ff465b667d7d64681f4247eabf628b8c
Message:
```*hannes: fixed typos (ticket 90)

File:
1 edited

Unmodified
Removed
• ## Singular/LIB/redcgs.lib

 r982e01 ////////////////////////////////////////////////////////////////////////////// version="\$Id: redcgs.lib,v 1.3 2008-10-09 09:31:58 Singular Exp \$"; version="\$Id: redcgs.lib,v 1.4 2009-02-26 14:07:04 Singular Exp \$"; category="General purpose"; info=" LIBRARY:  redcgs.lib      Reduced Comprehesive Groebner Systems. LIBRARY:  redcgs.lib      Reduced Comprehensive Groebner Systems. PURPOSE:  Comprehensive Groebner Systems. Canonical Forms. The library contains Monte's algorithms to compute disjoint, reduced reached, and if so, to give a Warning. The warning does not invalidate the output, but it only recognizes that the theoretical objective is not completely reached by the actual campcting methods and that some segments completely reached by the actual computing methods and that some segments that can be packed have not been packed with a single basis. of ideal J (non repeated). Integer factors are ignored, even 0 is ignored. It can be called from ideal @R, but the given ideal J must only contain poynomials in the the given ideal J must only contain polynomials in the parameters. redspec(N,W);        Given null and non-null conditions depending only on the int i; ideal W12;  poly ff1; poly g1=0; ideal GG; int tt=1; // detect weather f1 reduces to 0 on segment 2 // detect whether f1 reduces to 0 on segment 2 ff1=pnormalform(f1,N2,W2); if (ff1==0) { // detect weather N1 is included in N2 // detect whether N1 is included in N2 def RR=basering; setring @P; if (tt==1) { // detect weather W1 intersect W2 is non-empty // detect whether W1 intersect W2 is non-empty for (i=1;i<=size(W1);i++) {
Note: See TracChangeset for help on using the changeset viewer.