Changeset b9b906 in git for Singular/LIB/toric.lib

Timestamp:

Jan 16, 2001, 2:48:47 PM (23 years ago)

Author:

Hans Schönemann <hannes@…>

Branches:

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

Children:

081d28e7da33af82545a27eb9f8ee82b0884b9f0

Parents:

4e3468f1f6473297e317588e34a7719e241780f9

Message:

*hannes: lib format revisited


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

File:

• Singular/LIB/toric.lib (modified) (4 diffs)

Singular/LIB/toric.lib

@@ -1 +1 @@
 ///////////////////////////////////////////////////////////////////////////////
-version="$Id: toric.lib,v 1.9 2000-12-22 14:57:44 greuel Exp $";
+version="$Id: toric.lib,v 1.10 2001-01-16 13:48:46 Singular Exp $";
 category="Commutative Algebra";
 info="
@@ -667 +667 @@
         toric_ideal(A,alg,prsv); A intmat, alg string, prsv intvec
 RETURN: ideal: standard basis of the toric ideal of A
-NOTE:   These procedures return the standard basis of the toric ideal of A 
-        with respect to the term ordering in the actual basering. Not all 
-        term orderings are supported: The usual global term orderings may be 
+NOTE:   These procedures return the standard basis of the toric ideal of A
+        with respect to the term ordering in the actual basering. Not all
+        term orderings are supported: The usual global term orderings may be
         used, but no block orderings combining them.
         One may call the procedure with several different algorithms:
@@ -677 +677 @@
         - the algorithm of Hosten/Sturmfels (hs),
         - the algorithm of DiBiase/Urbanke (du).
-       The argument `alg' should be the abbreviation for an algorithm as 
+       The argument `alg' should be the abbreviation for an algorithm as
        above: ect, pt, blr, hs or du.
 
-      If `alg' is chosen to be `blr' or `hs', the algorithm needs a vector 
-      with positive coefficcients in the row space of A. 
-      If no row of A contains only positive entries, one has to use the 
-      second version of toric_ideal which takes such a vector as its third 
+      If `alg' is chosen to be `blr' or `hs', the algorithm needs a vector
+      with positive coefficcients in the row space of A.
+      If no row of A contains only positive entries, one has to use the
+      second version of toric_ideal which takes such a vector as its third
       argument.
       For the mathematical background, see
@@ -732 +732 @@
 "USAGE:   toric_std(I);      I ideal
 RETURN:   ideal: standard basis of I
-NOTE:     This procedure computes the standard basis of I using a specialized 
-          Buchberger algorithm. The generating system by which I is given has 
-          to consist of binomials of the form x^u-x^v. There is no real check 
-          if I is toric. If I is generated by binomials of the above form, 
-          but not toric, toric_std computes an ideal `between' I and its 
+NOTE:     This procedure computes the standard basis of I using a specialized
+          Buchberger algorithm. The generating system by which I is given has
+          to consist of binomials of the form x^u-x^v. There is no real check
+          if I is toric. If I is generated by binomials of the above form,
+          but not toric, toric_std computes an ideal `between' I and its
           saturation with respect to all variables.
           For the mathematical background, see