# Changeset 1e1990 in git

Ignore:
Timestamp:
Dec 9, 2022, 11:43:57 AM (4 months ago)
Branches:
(u'spielwiese', 'a800fe4b3e9d37a38c5a10cc0ae9dfa0c15a4ee6')
Children:
c9d548b553dc5c68b96208a1a69eea9c2e5921ea
Parents:
Message:
`fixing various typos (found using egrep)`
Files:
25 edited

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

 ra26d28 example { "EXAMPLE: The poincare polynomial of the braid arrangement in k dimensions is given as: " + "EXAMPLE: The Poincare polynomial of the braid arrangement in k dimensions is given as: " + "pi(A,t) = (1 + t)*...*(1 + (k-1)*t)"; echo = 2; ring R = 0,(x,y,z,u,v),dp; proc arrCharPoly(def input) "USAGE:     arrCharPoly(arr A) RETURN:     [intvec] coefficients of the characteristic polynomial of A in incresing order RETURN:     [intvec] coefficients of the characteristic polynomial of A in increasing order REMARKS:    The algorithm only returns the coefficients of the characteristic polynomial since they are whole numbers but the basering could be something different.
• ## Singular/LIB/chern.lib

 ra26d28 print( chProj(2) ); // the coefficients of the Chern character of the complex 3-dimentional projectice space // the coefficients of the Chern character of the complex 3-dimensional projective space print( chProj(3) ); }
• ## Singular/LIB/gitfan.lib

 ra26d28 To obtain the whole GIT-fan Qgamma has to be take the cone generated by the columns of Q. RETURN: a list containing the bigint hashes of the GIT cones. NOTE: The proceduce uses parallel computation for the construction of the GIT-cones. NOTE: The procedure uses parallel computation for the construction of the GIT-cones. EXAMPLE: example GITfanParallelSymmetric; shows an example " To obtain the whole GIT-fan Qgamma has to be take the cone generated by the columns of Q. RETURN: a list containing the bigint hashes of the GIT cones. NOTE: The proceduce uses parallel computation for the construction of the GIT-cones. NOTE: The procedure uses parallel computation for the construction of the GIT-cones. EXAMPLE: example GITfanParallel; shows an example " PURPOSE: Computes the GIT fan associated to J and Q. Optionally a symmetry group action on the column space of Q can be specified. RETURN: a fan, the GIT fan. NOTE: The proceduce uses parallel computation for the construction of the GIT-cones. The a-faces are not computed in parallel. This can be done by calling the aface procedure specifying a list of simplex faces. If used with the optional argument G, the orbit decomposition of the simplex of columns of Q is computed. Refer to the Singular documentation on how to do this more efficiently using GAP. NOTE: The procedure uses parallel computation for the construction of the GIT-cones. The a-faces are not computed in parallel. This can be done by calling the aface procedure specifying a list of simplex faces. If used with the optional argument G, the orbit decomposition of the simplex of columns of Q is computed. Refer to the Singular documentation on how to do this more efficiently using GAP. EXAMPLE: example GITfan; shows an example "
• ## Singular/LIB/grobcov.lib

 ra26d28 about the values of the variables determined for every value of the parameters. If the propsition is false for every values of the parameters, then the emply list is returned. If the proposition is false for every values of the parameters, then the empty list is returned. OPTIONS: An option is a pair of arguments: string, integer. To modify the default options, pairs
• ## Singular/LIB/monomialideal.lib

 ra26d28 (returns -1 if I is not a monomial ideal). ASSUME:   I is a monomial ideal of the basering k[x(1)..x(n)]. NOTE:     This procesure returns the irreducible decomposition of I. NOTE:     This procedure returns the irreducible decomposition of I. One may call the procedure with different algorithms using the optional argument 'alg':
• ## Singular/LIB/mprimdec.lib

 ra26d28 /////////////////////////////////////////////////////////////////////// // The optimized procedures and procdures needed for this optimization // The optimized procedures and procedures needed for this optimization ///////////////////////////////////////////////////////////////////////
• ## Singular/LIB/polylib.lib

 ra26d28 int e = -1; i=u; } else                        //case: inded is nonnegative else                        //case: mindeg is nonnegative { while ( jet(c,i,v) == 0 ) { i = 2*(i+1); }
• ## Singular/LIB/schubert.lib

 ra26d28 category="Algebraic Geometry"; info=" LIBRARY:    schubert.lib    Proceduces for Intersection Theory LIBRARY:    schubert.lib    Procedures for Intersection Theory AUTHOR:     Hiep Dang,          email: hiep@mathematik.uni-kl.de
• ## Singular/LIB/tropical.lib

 ra26d28 if(dd!=0) { // the procedurce cutdown computes a new ring, in which there lives a // the procedure cutdown computes a new ring, in which there lives a // zero-dimensional // ideal which has been computed by cutting down the input with
• ## Singular/LIB/zeroset.lib

 ra26d28 RETURN:  ring ASSUME:  R = K[x_1,...,x_n] where K = Q or K = Q(a). NOTE:    Creates the ring needed for all prodecures with name 'proc-name'Main NOTE:    Creates the ring needed for all procedures with name 'proc-name'Main " {
• ## Singular/RULES

 ra26d28 - report internal errors via dReportError Indentiation: ------------- - matching  { } should be in the same line (for very short staements) Indentation: ------------ - matching  { } should be in the same line (for very short statements) or in the same column
• ## Singular/countedref.cc

 ra26d28 BOOLEAN count(leftv res) { return construct(res, m_data.count() - 1); } // Get internal indentifier // Get internal identifier BOOLEAN enumerate(leftv res) { return construct(res, (long)(data_type*)m_data); }
• ## Singular/iparith.cc

 ra26d28 unsigned nCmdUsed;      /**< number of commands used */ unsigned nCmdAllocated; /**< number of commands-slots allocated */ unsigned nLastIdentifier; /**< valid indentifieres are slot 1..nLastIdentifier */ unsigned nLastIdentifier; /**< valid identifiers are slot 1..nLastIdentifier */ } SArithBase;
• ## doc/texi2html

 ra26d28 # # -l2h_l2h # name/location of latex2html progam # name/location of latex2html program \$T2H_L2H_L2H = "latex2html"; \$T2H_OPTIONS -> {l2h_l2h} =

 ra26d28 Algorithms for manipulation of polynomial ideals via the characteristic set methods (e.g., calculating the characteristic set and the irreducible characteristic series) are now incorpareted into factory. characteristic series) are now incorporated into factory. If you want to learn about characteristic sets, the next is a good point to start with:
• ## factory/int_poly.cc

 ra26d28 // point instead of testing on "less than" at the // last `else' in the enclosed `if' statement since a // test on inequaltiy in general is cheaper // test on inequality in general is cheaper if ( (cursor1->exp != cursor2->exp) || (cursor1->coeff != cursor2->coeff) ) {
• ## gfanlib/gfanlib_zcone.cpp

 ra26d28 /* this number is same as poly->m, except when poly is given by nonhomogeneous inequalty: poly is given by nonhomogeneous inequality: !(poly->homogeneous) && poly->representation==Inequality, it is poly->m+1.   See dd_ConeDataLoad. /* At this point we know lineality space, implied equations and also inequalities for the ray. To construct a vector on the ray which is stable under (or indendent of) angle and linarity preserving transformation we find the dimension 1 subspace orthorgonal to the implied equations and the ray which is stable under (or independant of) angle and linearity preserving transformation we find the dimension 1 subspace orthogonal to the implied equations and the lineality space and pick a suitable primitive generator */
• ## gfanlib/gfanlib_zcone.h

 ra26d28 public: /** * Constructs a polyhedral cone with specified equations and ineqalities. They are read off as rows * of the matrices. For efficiency it is possible to specifying a PolyhedralConePreassumptions flag * Constructs a polyhedral cone with specified equations and inequalities. They are read off as rows * of the matrices. For efficiency it is possible to specify a PolyhedralConePreassumptions flag * which tells what is known about the description already. */
• ## kernel/linear_algebra/linearAlgebra.h

 ra26d28 * With A denoting the matrix to be inverted, the method expects the * LU-decomposition of A, that is, pMat * A = lMat * uMat, where * the argument matrices have the appropriate proteries; see method * the argument matrices have the appropriate properties; see method * 'luDecomp(const matrix aMat, matrix &pMat, matrix &lMat, * matrix &uMat)'.
* The method expects the LU-decomposition of A, that is, * pMat * A = lMat * uMat, where the argument matrices have the * appropriate proteries; see method * appropriate properties; see method * 'luDecomp(const matrix aMat, matrix &pMat, matrix &lMat, * matrix &uMat)'.
* The method expects the LDU-decomposition of A, that is, * pMat * A = lMat * dMat^(-1) * uMat, where the argument matrices have * the appropriate proteries; see method * the appropriate properties; see method * 'lduDecomp(const matrix aMat, matrix &pMat, matrix &lMat, * matrix &dMat, matrix &uMat, poly &l, poly &u, poly &lTimesU)'.
• ## libpolys/coeffs/mpr_complex.cc

 ra26d28 } #else // problemns with solve_s.tst // problems with solve_s.tst void gmp_float::setFromStr(const char * in ) {
• ## libpolys/polys/monomials/ring.cc

 ra26d28 if(s == 0) // Prefix IS rO_ISPrefix(j, j_bits, prev_ordsgn, tmp_ordsgn, r->N, v, tmp_typ[typ_i++]); // What about prev_ordsgn? else // s = +1 or -1 // Note: typ_i might be incrimented here inside! else // s = +1 or -1 // Note: typ_i might be incremented here inside! { rO_ISSuffix(j, j_bits, prev_ordsgn, tmp_ordsgn, r->N, v, tmp_typ, typ_i, s); // Suffix.
• ## libpolys/polys/templates/p_Procs_Impl.h

 ra26d28 Here is how it works: At run-time, SetProcs is used to choose the appropriate PolyProcs based on the ring properies. based on the ring properties. At generate-time, SetProcs is used to generate all possible PolyProcs.
Note: See TracChangeset for help on using the changeset viewer.