Changeset 4bde6b in git for kernel/GBEngine/kutil.cc


Ignore:
Timestamp:
May 15, 2020, 3:20:00 PM (4 years ago)
Author:
Hans Schoenemann <hannes@…>
Branches:
(u'spielwiese', 'fe61d9c35bf7c61f2b6cbf1b56e25e2f08d536cc')
Children:
a1b40ab8675488c2a4f8e225d9d748ba70340727
Parents:
538e06d0809adf9f75fea000cf70d354bb674ab5
Message:
spelling p1
File:
1 edited

Legend:

Unmodified
Added
Removed

  • kernel/GBEngine/kutil.cc

    r538e06 r4bde6b  
    14181418  *the set B collects the pairs of type (S[j],p)
    14191419  *suppose (r,p) is in B and (s,p) is the new pair and lcm(s,p) != lcm(r,p)
    1420   *if the leading term of s devides lcm(r,p) then (r,p) will be canceled
    1421   *if the leading term of r devides lcm(s,p) then (s,p) will not enter B
     1420  *if the leading term of s divides lcm(r,p) then (r,p) will be canceled
     1421  *if the leading term of r divides lcm(s,p) then (s,p) will not enter B
    14221422  */
    14231423
    … …  
    20362036    *the set B collects the pairs of type (S[j],p)
    20372037    *suppose (r,p) is in B and (s,p) is the new pair and lcm(s,p)#lcm(r,p)
    2038     *if the leading term of s devides lcm(r,p) then (r,p) will be canceled
    2039     *if the leading term of r devides lcm(s,p) then (s,p) will not enter B
     2038    *if the leading term of s divides lcm(r,p) then (r,p) will be canceled
     2039    *if the leading term of r divides lcm(s,p) then (s,p) will not enter B
    20402040    */
    20412041    {
    … …  
    20802080      *i.e. lcm(s,p)=product of the leading terms of s and p.
    20812081      *Suppose (s,r) is in L and the leading term
    2082       *of p devides lcm(s,r)
    2083       *(==> the leading term of p devides the leading term of r)
    2084       *but the leading term of s does not devide the leading term of r
     2082      *of p divides lcm(s,r)
     2083      *(==> the leading term of p divides the leading term of r)
     2084      *but the leading term of s does not divide the leading term of r
    20852085      *(notice that tis condition is automatically satisfied if r is still
    20862086      *in S), then (s,r) can be canceled.
    … …  
    21012101      *the set B collects the pairs of type (S[j],p)
    21022102      *suppose (r,p) is in B and (s,p) is the new pair and lcm(s,p)#lcm(r,p)
    2103       *if the leading term of s devides lcm(r,p) then (r,p) will be canceled
    2104       *if the leading term of r devides lcm(s,p) then (s,p) will not enter B
     2103      *if the leading term of s divides lcm(r,p) then (r,p) will be canceled
     2104      *if the leading term of r divides lcm(s,p) then (s,p) will not enter B
    21052105      */
    21062106      for(j = strat->Bl;j>=0;j--)
    … …  
    21922192    *suppose we have (s,r),(r,p),(s,p) and spoly(s,p) == 0 and (r,p) is
    21932193    *still in B (i.e. lcm(r,p) == lcm(s,p) or the leading term of s does not
    2194     *devide lcm(r,p)). In the last case (s,r) can be canceled if the leading
    2195     *term of p devides the lcm(s,r)
     2194    *divide lcm(r,p)). In the last case (s,r) can be canceled if the leading
     2195    *term of p divides the lcm(s,r)
    21962196    *(this canceling should be done here because
    21972197    *the case lcm(s,p) == lcm(s,r) is not covered in chainCrit)
    … …  
    23122312    *the set B collects the pairs of type (S[j],p)
    23132313    *suppose (r,p) is in B and (s,p) is the new pair and lcm(s,p)#lcm(r,p)
    2314     *if the leading term of s devides lcm(r,p) then (r,p) will be canceled
    2315     *if the leading term of r devides lcm(s,p) then (s,p) will not enter B
     2314    *if the leading term of s divides lcm(r,p) then (r,p) will be canceled
     2315    *if the leading term of r divides lcm(s,p) then (s,p) will not enter B
    23162316    */
    23172317    {
    … …  
    23522352    *i.e. lcm(s,p)=product of the leading terms of s and p.
    23532353    *Suppose (s,r) is in L and the leading term
    2354     *of p devides lcm(s,r)
    2355     *(==> the leading term of p devides the leading term of r)
    2356     *but the leading term of s does not devide the leading term of r
     2354    *of p divides lcm(s,r)
     2355    *(==> the leading term of p divides the leading term of r)
     2356    *but the leading term of s does not divide the leading term of r
    23572357    *(notice that tis condition is automatically satisfied if r is still
    23582358    *in S), then (s,r) can be canceled.
    … …  
    23732373    *the set B collects the pairs of type (S[j],p)
    23742374    *suppose (r,p) is in B and (s,p) is the new pair and lcm(s,p)#lcm(r,p)
    2375     *if the leading term of s devides lcm(r,p) then (r,p) will be canceled
    2376     *if the leading term of r devides lcm(s,p) then (s,p) will not enter B
     2375    *if the leading term of s divides lcm(r,p) then (r,p) will be canceled
     2376    *if the leading term of r divides lcm(s,p) then (s,p) will not enter B
    23772377    */
    23782378    for(j = strat->Bl;j>=0;j--)
    … …  
    24212421    *suppose we have (s,r),(r,p),(s,p) and spoly(s,p) == 0 and (r,p) is
    24222422    *still in B (i.e. lcm(r,p) == lcm(s,p) or the leading term of s does not
    2423     *devide lcm(r,p)). In the last case (s,r) can be canceled if the leading
    2424     *term of p devides the lcm(s,r)
     2423    *divide lcm(r,p)). In the last case (s,r) can be canceled if the leading
     2424    *term of p divides the lcm(s,r)
    24252425    *(this canceling should be done here because
    24262426    *the case lcm(s,p) == lcm(s,r) is not covered in chainCrit)
    … …  
    42344234  *the set B collects the pairs of type (S[j],p)
    42354235  *suppose (r,p) is in B and (s,p) is the new pair and lcm(s,p) != lcm(r,p)
    4236   *if the leading term of s devides lcm(r,p) then (r,p) will be canceled
    4237   *if the leading term of r devides lcm(s,p) then (s,p) will not enter B
     4236  *if the leading term of s divides lcm(r,p) then (r,p) will be canceled
     4237  *if the leading term of r divides lcm(s,p) then (s,p) will not enter B
    42384238  */
    42394239  for(j = strat->Bl;j>=0;j--)
    … …  
    42924292    *suppose we have (s,r),(r,p),(s,p) and spoly(s,p) == 0 and (r,p) is
    42934293    *still in B (i.e. lcm(r,p) == lcm(s,p) or the leading term of s does not
    4294     *devide lcm(r,p)). In the last case (s,r) can be canceled if the leading
    4295     *term of p devides the lcm(s,r)
     4294    *divide lcm(r,p)). In the last case (s,r) can be canceled if the leading
     4295    *term of p divides the lcm(s,r)
    42964296    *(this canceling should be done here because
    42974297    *the case lcm(s,p) == lcm(s,r) is not covered in chainCrit)
    … …  
    1256912569  *the set B collects the pairs of type (S[j],p)
    1257012570  *suppose (r,p) is in B and (s,p) is the new pair and lcm(s,p) != lcm(r,p)
    12571   *if the leading term of s devides lcm(r,p) then (r,p) will be canceled
    12572   *if the leading term of r devides lcm(s,p) then (s,p) will not enter B
     12571  *if the leading term of s divides lcm(r,p) then (r,p) will be canceled
     12572  *if the leading term of r divides lcm(s,p) then (s,p) will not enter B
    1257312573  */
    1257412574
    … …  
    1295212952    *the set B collects the pairs of type (S[j],p)
    1295312953    *suppose (r,p) is in B and (s,p) is the new pair and lcm(s,p)#lcm(r,p)
    12954     *if the leading term of s devides lcm(r,p) then (r,p) will be canceled
    12955     *if the leading term of r devides lcm(s,p) then (s,p) will not enter B
     12954    *if the leading term of s divides lcm(r,p) then (r,p) will be canceled
     12955    *if the leading term of r divides lcm(s,p) then (s,p) will not enter B
    1295612956    */
    1295712957    {
    … …  
    1300813008      *i.e. lcm(s,p)=product of the leading terms of s and p.
    1300913009      *Suppose (s,r) is in L and the leading term
    13010       *of p devides lcm(s,r)
    13011       *(==> the leading term of p devides the leading term of r)
    13012       *but the leading term of s does not devide the leading term of r
     13010      *of p divides lcm(s,r)
     13011      *(==> the leading term of p divides the leading term of r)
     13012      *but the leading term of s does not divide the leading term of r
    1301313013      *(notice that tis condition is automatically satisfied if r is still
    1301413014      *in S), then (s,r) can be canceled.
    … …  
    1303513035      *the set B collects the pairs of type (S[j],p)
    1303613036      *suppose (r,p) is in B and (s,p) is the new pair and lcm(s,p)#lcm(r,p)
    13037       *if the leading term of s devides lcm(r,p) then (r,p) will be canceled
    13038       *if the leading term of r devides lcm(s,p) then (s,p) will not enter B
     13037      *if the leading term of s divides lcm(r,p) then (r,p) will be canceled
     13038      *if the leading term of r divides lcm(s,p) then (s,p) will not enter B
    1303913039      */
    1304013040      for(j = strat->Bl;j>=0;j--)
    … …  
    1314113141    *suppose we have (s,r),(r,p),(s,p) and spoly(s,p) == 0 and (r,p) is
    1314213142    *still in B (i.e. lcm(r,p) == lcm(s,p) or the leading term of s does not
    13143     *devide lcm(r,p)). In the last case (s,r) can be canceled if the leading
    13144     *term of p devides the lcm(s,r)
     13143    *divide lcm(r,p)). In the last case (s,r) can be canceled if the leading
     13144    *term of p divides the lcm(s,r)
    1314513145    *(this canceling should be done here because
    1314613146    *the case lcm(s,p) == lcm(s,r) is not covered in chainCrit)
Note: See TracChangeset for help on using the changeset viewer.