Changeset 1e1990 in git


Ignore:
Timestamp:
Dec 9, 2022, 11:43:57 AM (4 months ago)
Author:
Frédéric Chapoton <chapoton@…>
Branches:
(u'spielwiese', 'a800fe4b3e9d37a38c5a10cc0ae9dfa0c15a4ee6')
Children:
c9d548b553dc5c68b96208a1a69eea9c2e5921ea
Parents:
a26d28d708999ea2f59a21ad34587f50825593e2
Message:
fixing various typos (found using egrep)
Files:
25 edited

Legend:

Unmodified
Added
Removed

  • Singular/LIB/arr.lib

    ra26d28 r1e1990  
    29682968example
    29692969{
    2970 "EXAMPLE: The poincare polynomial of the braid arrangement in k dimensions is given as: " +
     2970"EXAMPLE: The Poincare polynomial of the braid arrangement in k dimensions is given as: " +
    29712971"pi(A,t) = (1 + t)*...*(1 + (k-1)*t)"; echo = 2;
    29722972ring R = 0,(x,y,z,u,v),dp;
    … …  
    29812981proc arrCharPoly(def input)
    29822982"USAGE:     arrCharPoly(arr A)
    2983 RETURN:     [intvec] coefficients of the characteristic polynomial of A in incresing order
     2983RETURN:     [intvec] coefficients of the characteristic polynomial of A in increasing order
    29842984REMARKS:    The algorithm only returns the coefficients of the characteristic polynomial since they
    29852985            are whole numbers but the basering could be something different.

  • Singular/LIB/chern.lib

    ra26d28 r1e1990  
    25452545  print( chProj(2) );
    25462546
    2547   // the coefficients of the Chern character of the complex 3-dimentional projectice space
     2547  // the coefficients of the Chern character of the complex 3-dimensional projective space
    25482548  print( chProj(3) );
    25492549}

  • Singular/LIB/gitfan.lib

    ra26d28 r1e1990  
    16271627To obtain the whole GIT-fan Qgamma has to be take the cone generated by the columns of Q.
    16281628RETURN: a list containing the bigint hashes of the GIT cones.
    1629 NOTE: The proceduce uses parallel computation for the construction of the GIT-cones.
     1629NOTE: The procedure uses parallel computation for the construction of the GIT-cones.
    16301630EXAMPLE: example GITfanParallelSymmetric; shows an example
    16311631"
    … …  
    22902290To obtain the whole GIT-fan Qgamma has to be take the cone generated by the columns of Q.
    22912291RETURN: a list containing the bigint hashes of the GIT cones.
    2292 NOTE: The proceduce uses parallel computation for the construction of the GIT-cones.
     2292NOTE: The procedure uses parallel computation for the construction of the GIT-cones.
    22932293EXAMPLE: example GITfanParallel; shows an example
    22942294"
    … …  
    25242524PURPOSE: Computes the GIT fan associated to J and Q. Optionally a symmetry group action on the column space of Q can be specified.
    25252525RETURN: a fan, the GIT fan.
    2526 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.
     2526NOTE: 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.
    25272527EXAMPLE: example GITfan; shows an example
    25282528"

  • Singular/LIB/grobcov.lib

    ra26d28 r1e1990  
    73827382       about the values of the variables determined
    73837383       for every value of the parameters.
    7384        If the propsition is false for every values of the
    7385        parameters, then the emply list is returned.
     7384       If the proposition is false for every values of the
     7385       parameters, then the empty list is returned.
    73867386OPTIONS: An option is a pair of arguments: string,
    73877387       integer. To modify the default options, pairs

  • Singular/LIB/monomialideal.lib

    ra26d28 r1e1990  
    36343634          (returns -1 if I is not a monomial ideal).
    36353635ASSUME:   I is a monomial ideal of the basering k[x(1)..x(n)].
    3636 NOTE:     This procesure returns the irreducible decomposition of I.
     3636NOTE:     This procedure returns the irreducible decomposition of I.
    36373637          One may call the procedure with different algorithms using
    36383638          the optional argument 'alg':

  • Singular/LIB/mprimdec.lib

    ra26d28 r1e1990  
    783783
    784784///////////////////////////////////////////////////////////////////////
    785 // The optimized procedures and procdures needed for this optimization
     785// The optimized procedures and procedures needed for this optimization
    786786///////////////////////////////////////////////////////////////////////
    787787

  • Singular/LIB/polylib.lib

    ra26d28 r1e1990  
    633633         int e = -1; i=u;
    634634      }
    635       else                        //case: inded is nonnegative
     635      else                        //case: mindeg is nonnegative
    636636      {
    637637         while ( jet(c,i,v) == 0 ) { i = 2*(i+1); }

  • Singular/LIB/schubert.lib

    ra26d28 r1e1990  
    33category="Algebraic Geometry";
    44info="
    5 LIBRARY:    schubert.lib    Proceduces for Intersection Theory
     5LIBRARY:    schubert.lib    Procedures for Intersection Theory
    66
    77AUTHOR:     Hiep Dang,          email: hiep@mathematik.uni-kl.de

  • Singular/LIB/tropical.lib

    ra26d28 r1e1990  
    522522    if(dd!=0)
    523523    {
    524       // the procedurce cutdown computes a new ring, in which there lives a
     524      // the procedure cutdown computes a new ring, in which there lives a
    525525      // zero-dimensional
    526526      // ideal which has been computed by cutting down the input with

  • Singular/LIB/zeroset.lib

    ra26d28 r1e1990  
    13851385RETURN:  ring
    13861386ASSUME:  R = K[x_1,...,x_n] where K = Q or K = Q(a).
    1387 NOTE:    Creates the ring needed for all prodecures with name 'proc-name'Main
     1387NOTE:    Creates the ring needed for all procedures with name 'proc-name'Main
    13881388"
    13891389{

  • Singular/RULES

    ra26d28 r1e1990  
    4545- report internal errors via dReportError
    4646
    47 Indentiation:
    48 -------------
    49 - matching  { } should be in the same line (for very short staements)
     47Indentation:
     48------------
     49- matching  { } should be in the same line (for very short statements)
    5050  or in the same column
    5151

  • Singular/countedref.cc

    ra26d28 r1e1990  
    288288  BOOLEAN count(leftv res) { return construct(res, m_data.count() - 1); }
    289289
    290   // Get internal indentifier
     290  // Get internal identifier
    291291  BOOLEAN enumerate(leftv res) { return construct(res, (long)(data_type*)m_data); }
    292292

  • Singular/iparith.cc

    ra26d28 r1e1990  
    191191  unsigned nCmdUsed;      /**< number of commands used */
    192192  unsigned nCmdAllocated; /**< number of commands-slots allocated */
    193   unsigned nLastIdentifier; /**< valid indentifieres are slot 1..nLastIdentifier */
     193  unsigned nLastIdentifier; /**< valid identifiers are slot 1..nLastIdentifier */
    194194} SArithBase;
    195195

  • doc/texi2html

    ra26d28 r1e1990  
    411411#
    412412# -l2h_l2h
    413 # name/location of latex2html progam
     413# name/location of latex2html program
    414414$T2H_L2H_L2H = "latex2html";
    415415$T2H_OPTIONS -> {l2h_l2h} =

  • factory/README

    ra26d28 r1e1990  
    205205Algorithms for manipulation of polynomial ideals via the characteristic set
    206206methods (e.g., calculating the characteristic set and the irreducible
    207 characteristic series) are now incorpareted into factory.
     207characteristic series) are now incorporated into factory.
    208208If you want to learn about characteristic sets, the next is a good point
    209209to start with:

  • factory/int_poly.cc

    ra26d28 r1e1990  
    10031003            // point instead of testing on "less than" at the
    10041004            // last `else' in the enclosed `if' statement since a
    1005             // test on inequaltiy in general is cheaper
     1005            // test on inequality in general is cheaper
    10061006            if ( (cursor1->exp != cursor2->exp) || (cursor1->coeff != cursor2->coeff) )
    10071007            {

  • gfanlib/gfanlib_zcone.cpp

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

  • gfanlib/gfanlib_zcone.h

    ra26d28 r1e1990  
    126126public:
    127127   /**
    128     * Constructs a polyhedral cone with specified equations and ineqalities. They are read off as rows
    129     * of the matrices. For efficiency it is possible to specifying a PolyhedralConePreassumptions flag
     128    * Constructs a polyhedral cone with specified equations and inequalities. They are read off as rows
     129    * of the matrices. For efficiency it is possible to specify a PolyhedralConePreassumptions flag
    130130    * which tells what is known about the description already.
    131131    */

  • kernel/linear_algebra/linearAlgebra.h

    ra26d28 r1e1990  
    178178 * With A denoting the matrix to be inverted, the method expects the
    179179 * LU-decomposition of A, that is, pMat * A = lMat * uMat, where
    180  * the argument matrices have the appropriate proteries; see method
     180 * the argument matrices have the appropriate properties; see method
    181181 * 'luDecomp(const matrix aMat, matrix &pMat, matrix &lMat,
    182182 * matrix &uMat)'.<br>
    … …  
    231231 * The method expects the LU-decomposition of A, that is,
    232232 * pMat * A = lMat * uMat, where the argument matrices have the
    233  * appropriate proteries; see method
     233 * appropriate properties; see method
    234234 * 'luDecomp(const matrix aMat, matrix &pMat, matrix &lMat,
    235235 * matrix &uMat)'.<br>
    … …  
    276276 * The method expects the LDU-decomposition of A, that is,
    277277 * pMat * A = lMat * dMat^(-1) * uMat, where the argument matrices have
    278  * the appropriate proteries; see method
     278 * the appropriate properties; see method
    279279 * 'lduDecomp(const matrix aMat, matrix &pMat, matrix &lMat,
    280280 * matrix &dMat, matrix &uMat, poly &l, poly &u, poly &lTimesU)'.<br>

  • libpolys/coeffs/mpr_complex.cc

    ra26d28 r1e1990  
    105105}
    106106#else
    107 // problemns with solve_s.tst
     107// problems with solve_s.tst
    108108void gmp_float::setFromStr(const char * in )
    109109{

  • libpolys/polys/monomials/ring.cc

    ra26d28 r1e1990  
    37103710        if(s == 0) // Prefix IS
    37113711          rO_ISPrefix(j, j_bits, prev_ordsgn, tmp_ordsgn, r->N, v, tmp_typ[typ_i++]); // What about prev_ordsgn?
    3712         else // s = +1 or -1 // Note: typ_i might be incrimented here inside!
     3712        else // s = +1 or -1 // Note: typ_i might be incremented here inside!
    37133713        {
    37143714          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 r1e1990  
    2222 Here is how it works:
    2323 At run-time, SetProcs is used to choose the appropriate PolyProcs
    24               based on the ring properies.
     24              based on the ring properties.
    2525 At generate-time, SetProcs is used to generate all
    2626              possible PolyProcs.
Note: See TracChangeset for help on using the changeset viewer.