Changeset 9660f5 in git


Ignore:
Timestamp:
Apr 3, 2009, 10:58:53 PM (15 years ago)
Author:
Motsak Oleksandr <motsak@…>
Branches:
(u'spielwiese', '17f1d200f27c5bd38f5dfc6e8a0879242279d1d8')
Children:
bb02ea041a895524f1e9c21fb8250d90719003c1
Parents:
5c990f152831c8b6b6954cc2fc0829365f41cc20
Message:
*motsak: fixes due to O.Iena


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

Legend:

Unmodified
Added
Removed
  • Singular/LIB/algebra.lib

    r5c990f1 r9660f5  
    33//new proc  nonZeroEntry(id), used to fix a bug in proc finitenessTest
    44///////////////////////////////////////////////////////////////////////////////
    5 version="$Id: algebra.lib,v 1.19 2009-02-20 09:26:50 Singular Exp $";
     5version="$Id: algebra.lib,v 1.20 2009-04-03 20:58:53 motsak Exp $";
    66category="Commutative Algebra";
    77info="
     
    249249                and then l[2] = y(0)-h(y(1),...,y(k)) if p = h(i[1],...,i[k])
    250250         l[1]=0 iff p is in not the subring generated by i,
    251                 and then l[2] = h(y(0),y(1),...,y(k) where p satisfies the
     251                and then l[2] = h(y(0),y(1),...,y(k)) where p satisfies the
    252252                nonlinear relation h(p,i[1],...,i[k])=0.
    253253@end format
    254254NOTE:    the proc algebra_containment tests the same with a different
    255255         algorithm, which is often faster
     256         if l[1] == 0 then l[2] may contain more than one relation h(y(0),y(1),...,y(k)),
     257         separated by comma
    256258EXAMPLE: example inSubring; shows an example
    257259"
     
    298300     }
    299301     if (deg(ker[i]/y(0))>0)
    300      { l[2]=l[2]+string(ker[i]);
     302     { if( l[2] != "" ){ l[2] = l[2] + ","; }
     303       l[2] = l[2] + string(ker[i]);
    301304     }
    302305  }
Note: See TracChangeset for help on using the changeset viewer.