diff options
| author | dos-reis <gdr@axiomatics.org> | 2008-04-03 04:23:42 +0000 |
|---|---|---|
| committer | dos-reis <gdr@axiomatics.org> | 2008-04-03 04:23:42 +0000 |
| commit | 001e19b08ba7fb1b9e6f6bdb44a82ba3db3fc532 (patch) | |
| tree | da9e2fe5d81ff4cd7709d12e44b8c3e348b8a8e3 /src/algebra/idecomp.spad.pamphlet | |
| parent | a7bab9a6c2070d05e2dbd256ce455079c8ced385 (diff) | |
| download | open-axiom-001e19b08ba7fb1b9e6f6bdb44a82ba3db3fc532.tar.gz | |
Replace `^=' with `~='.
Diffstat (limited to 'src/algebra/idecomp.spad.pamphlet')
| -rw-r--r-- | src/algebra/idecomp.spad.pamphlet | 22 |
1 files changed, 11 insertions, 11 deletions
diff --git a/src/algebra/idecomp.spad.pamphlet b/src/algebra/idecomp.spad.pamphlet index 9ba4d219..740d60de 100644 --- a/src/algebra/idecomp.spad.pamphlet +++ b/src/algebra/idecomp.spad.pamphlet @@ -145,7 +145,7 @@ IdealDecompositionPackage(vl,nv) : C == T -- take away nv, now doesn't lf:=Id.first pv:DPoly:=0 pw:DPoly:=0 - while degree(lf,y)^=1 repeat + while degree(lf,y)~=1 repeat val:=random()$Z rem 23 pv:=px+val*py pw:=px-val*py @@ -153,7 +153,7 @@ IdealDecompositionPackage(vl,nv) : C == T -- take away nv, now doesn't lf:=Id.first ris:= generators(zeroRadComp(groebnerIdeal(Id.rest),truelist.rest)) ris:=cons(lf,ris) - if pv^=0 then + if pv~=0 then ris:=[(univariate(h,x)).pw for h in ris] groebnerIdeal(groebner ris) @@ -172,12 +172,12 @@ IdealDecompositionPackage(vl,nv) : C == T -- take away nv, now doesn't truelist=[] => true n:=#truelist Jd:=groebner generators J - for x in truelist while Jd^=[] repeat + for x in truelist while Jd~=[] repeat f := Jd.first Jd:=Jd.rest - if ((y:=mainVariable f) case "failed") or (y::OV ^=x ) + if ((y:=mainVariable f) case "failed") or (y::OV ~=x ) or _^ (ismonic (f,x)) then return false - while Jd^=[] and (mainVariable Jd.first)::OV=x repeat Jd:=Jd.rest + while Jd~=[] and (mainVariable Jd.first)::OV=x repeat Jd:=Jd.rest if Jd=[] and position(x,truelist)<n then return false true @@ -246,7 +246,7 @@ IdealDecompositionPackage(vl,nv) : C == T -- take away nv, now doesn't pushdown(g:DPoly,x:OV) : DPoly == rf:DPoly:=0$DPoly i:=position(x,lvint) - while g^=0 repeat + while g~=0 repeat g1:=reductum g rf:=rf+pushdterm(g-g1,x,i) g := g1 @@ -266,11 +266,11 @@ IdealDecompositionPackage(vl,nv) : C == T -- take away nv, now doesn't rf:DPoly:=0$DPoly g := f xp := convert(x)@SE - while g^=0 repeat + while g~=0 repeat h:=lcm(trueden(denom leadingCoefficient g,xp),h) g:=reductum g f:=(h::F)*f - while f^=0 repeat + while f~=0 repeat g:=reductum f rf:=rf+pushuterm(f-g,xp,x) f:=g @@ -296,7 +296,7 @@ IdealDecompositionPackage(vl,nv) : C == T -- take away nv, now doesn't is0dimprimary(J:FIdeal,truelist:List OV) : Boolean == element?(1,J) => true Jd:=generators(groebner J) - #(factors factor Jd.last)^=1 => return false + #(factors factor Jd.last)~=1 => return false i:=subtractIfCan(#truelist,1) (i case "failed") => return true JR:=(reverse Jd);JM:=groebnerIdeal([JR.first]);JP:List(DPoly):=[] @@ -353,10 +353,10 @@ IdealDecompositionPackage(vl,nv) : C == T -- take away nv, now doesn't element?(1,J) => true n:NNI:=#vl;i:NNI:=1 Jd:=generators J - #Jd^=n => false + #Jd~=n => false for f in Jd repeat if _^ ismonic(f,lvint.i) then return false - if i<n and (degree univariate(f,lvint.i))^=1 then return false + if i<n and (degree univariate(f,lvint.i))~=1 then return false i:=i+1 g:=Jd.n #(lfact:=factors(factor g)) >1 => false |