Changeset b324567 in git

Timestamp:

Jun 21, 2023, 4:03:31 PM (11 months ago)

Author:

Hans Schoenemann <hannes@…>

Branches:

(u'fieker-DuVal', '117eb8c30fc9e991c4decca4832b1d19036c4c65')(u'spielwiese', '38dfc5131670d387a89455159ed1e071997eec94')

Children:

3e5fb164b8ee4bc009257c64c0b7ad6b395d60d5

Parents:

b197ee994445c4a01b68b4fefc30a7fb79f36bc1

Message:

doc: sagbiNormal.lib

File:

• Singular/LIB/sagbiNormaliz.lib (modified) (6 diffs)

Singular/LIB/sagbiNormaliz.lib

@@ -9 +9 @@
 
 OVERVIEW:
-@texinfo
 
 The library sagbiNormaliz.lib provides functions for the computations of Sagbi bases. It
@@ -27 +26 @@
 directory. The user can overwrite it by setting another name.
 
-@end texinfo
-
 KEYWORDS: Sagbi basis, initial algebra
 
 PROCEDURES:
- SagbiGeneral(ideal Q [, int sagbiMaxRounds, int sorting, int verb]) computes the Sagbi basis of the subalgebra of
+sagbiGeneral(ideal Q [, int sagbiMaxRounds, int sorting, int verb]) computes the Sagbi basis of the subalgebra of
                               the current polynomial ring that is generated by the elements of Q. The computation is stopped after at most sagbiMaxRounds rounds if trhe parameter is set. If sorting is set, the  compouted elements are degrevlex sorted before a round of the algorithm.
                               The optional parameter verb sets the terminal output. Fefault is 1 = on..
 
-sagbiByDegree(ideal Q, int Sagbi_degree_bound, , [,int sorting, int verb])
-                              computes the Sagbi basis degree by degree until thwe degree bound is reached or the Sagbi basis has been computed compltely.
-
- SagbiHilbControlled(ideal Q, intvec HS_num_algebra, intvec HS_denom_algebra, int Sagbi_degree_bound[, int finalCheck, int sorting, int verb])
-                              computes the Sagbi basis up to the degree bound. The Hilbert series of the subalgebra
+sagbiByDegree(ideal Q, int Sagbi_degree_bound,[,int sorting, int verb]) computes the Sagbi basis degree by degree until thwe degree bound is reached or the Sagbi basis has been computed compltely.
+
+sagbiHilbControlled(ideal Q, intvec HS_num_algebra, intvec HS_denom_algebra, int Sagbi_degree_bound[, int finalCheck, int sorting, int verb]) computes the Sagbi basis up to the degree bound. The Hilbert series of the subalgebra
                               generated by the elements of Q is given by its numerator and denominator as a rational
                               function. HS_denom_algebra lists the exponents g_i in the factors 1 -t^g_i of the denominator.
@@ -852 +847 @@
           The component has a second integer component. Its possible values are: 0, if the full Sagbi basis has
           not been reached, 1 if this is unknown, and 2 if the full Sagbi basis has been computed.
-
-EXAMPLE:  SagbiHilbControlled; shows an example
+EXAMPLE:  sagbiHilbControlled; shows an example
 "
 {
@@ -907 +901 @@
 
 proc sagbiByDegree(ideal Q, int Sagbi_degree_bound, list #)
-"USAGE:   SagbiGeneral(ideal Q, int sagbiDegreeBound [,int sorting, int verb]);
+"USAGE:   sagbiByDegree(ideal Q, int sagbiDegreeBound [,int sorting, int verb]);
 RETURN:   RETURN:   An ideal whose generators form the Sagbi basis of the algebra generated
           by the polynomials inin degrwees <= Sagbi_degree_bound.
@@ -917 +911 @@
           not been reached, 1 if this is unknown, and 2 if the full Sagbi basis has been computed.
 
-EXAMPLE:  example agbiByDegree; shows an example
+EXAMPLE:  example sagbiByDegree; shows an example
 "
 {
@@ -973 +967 @@
 
 proc sagbiGeneral(ideal Q, list #)
-"USAGE:   SagbiGeneral(ideal Q [, int sagbiMaxRounds, int sorting, int verb]));
+"USAGE:   sagbiGeneral(ideal Q [, int sagbiMaxRounds, int sorting, int verb]));
 RETURN:   An ideal whose generators form the Sagbi basis of the algebra generated
           by the polynomials in Q as far as computwed in at most sagbiMaxRounds.