Changeset 73c3c95 in git

Timestamp:

Sep 29, 2010, 5:50:51 PM (14 years ago)

Author:

Hans Schoenemann <hannes@…>

Branches:

(u'fieker-DuVal', '117eb8c30fc9e991c4decca4832b1d19036c4c65')(u'spielwiese', '38077648e7239f98078663eb941c3c979511150a')

Children:

4708af17f762c99d15cb939acfd22139c9de5550

Parents:

c6af37758b6eecc0501fc75ccf32f552185b2924

Message:

format fix

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

File:

• Singular/LIB/dmod.lib (modified) (1 diff)

Singular/LIB/dmod.lib

@@ -42 +42 @@
 
 GUIDE:
-- Ann F^s = I(F^s) = LD in D(R)[s] can be computed by Sannfs [BM, OT, LOT]
-- Ann^(1) F^s in D(R)[s] can be computed by Sannfslog
-- global Bernstein polynomial bs in K[s] can be computed by bernsteinBM
-- Ann F^s0 = I(F^s0) = LD0 in D(R) can be computed by annfs0, annfs, annfsBM,
+@*- Ann F^s = I(F^s) = LD in D(R)[s] can be computed by Sannfs [BM, OT, LOT]
+@*- Ann^(1) F^s in D(R)[s] can be computed by Sannfslog
+@*- global Bernstein polynomial bs in K[s] can be computed by bernsteinBM
+@*- Ann F^s0 = I(F^s0) = LD0 in D(R) can be computed by annfs0, annfs, annfsBM,
     annfsOT, annfsLOT, annfs2, annfsRB etc.
-- all the relevant data to F^s (LD, LD0, bs, PS) are computed by operatorBM
-- operator PS can be computed via operatorModulo or operatorBM
-
-- annihilator of F^{s1} for a number s1 is computed with annfspecial
-- annihilator of F_1^s_1 * ... * F_p^s_p is computed with annfsBMI
-- computing the multiplicity of a rational number r in the Bernstein poly
+@*- all the relevant data to F^s (LD, LD0, bs, PS) are computed by operatorBM
+@*- operator PS can be computed via operatorModulo or operatorBM
+
+@*- annihilator of F^{s1} for a number s1 is computed with annfspecial
+@*- annihilator of F_1^s_1 * ... * F_p^s_p is computed with annfsBMI
+@*- computing the multiplicity of a rational number r in the Bernstein poly
    of a given ideal goes with checkRoot
-- check, whether a given univariate polynomial divides the Bernstein poly
+@*- check, whether a given univariate polynomial divides the Bernstein poly
    goes with checkFactor
-
 
 PROCEDURES: