Changeset a2466f in git for kernel/polys.cc

Timestamp:

Jun 12, 2006, 2:07:12 AM (17 years ago)

Author:

Oliver Wienand <wienand@…>

Branches:

(u'jengelh-datetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', 'f875bbaccd0831e36aaed09ff6adeb3eb45aeb94')

Children:

c4c516319dd7380d23251f74e2a664cdb5664571

Parents:

30f22c1ce9b7faf89c70d82bed9c82dd6d7b4979

Message:

[oliver] @hannes: Please check changes to kutil.cc(pDivComp).

kutil.cc:
* pDivComp now distinguishes between equal and incomparable monoms
* changes to chainCritRing, in progress

ringgb.*:
* changes to testGB, now tests also inclusion of I

polys.cc:
* just doc


git-svn-id: file:///usr/local/Singular/svn/trunk@9195 2c84dea3-7e68-4137-9b89-c4e89433aadc

File:

• kernel/polys.cc (modified) (3 diffs)

kernel/polys.cc

@@ -2 +2 @@
 *  Computer Algebra System SINGULAR     *
 ****************************************/
-/* $Id: polys.cc,v 1.8 2006-03-20 20:33:57 wienand Exp $ */
+/* $Id: polys.cc,v 1.9 2006-06-12 00:07:11 wienand Exp $ */
 
 /*
@@ -921 +921 @@
 }
 
+/* Returns TRUE if
+     * LM(p) | LM(lcm)
+     * LC(p) | LC(lcm) only if ring
+     * Exists i, j:
+         * LE(p, i)  != LE(lcm, i)
+         * LE(p1, i) != LE(lcm, i)   ==> LCM(p1, p) != lcm
+         * LE(p, j)  != LE(lcm, j)
+         * LE(p2, j) != LE(lcm, j)   ==> LCM(p2, p) != lcm
+*/
 BOOLEAN pCompareChain (poly p,poly p1,poly p2,poly lcm)
 {
@@ -926 +935 @@
 
   if (lcm==NULL) return FALSE;
-  #ifdef HAVE_RING2TOM 
+  #ifdef HAVE_RING2TOM
   // In coefficient rings, the coefficient plays a role in chain crit TODO
   if (currRing->cring == 1 && !pLmDivisibleByNoComp(p, lcm)) return FALSE;