* algebra/matcat.spad.pamphlet (MatrixCategory) [matrix]:

Add overload that takes sizes and function to compute entries.
author: dos-reis <gdr@axiomatics.org> 2010-06-27 20:40:42 +0000
committer: dos-reis <gdr@axiomatics.org> 2010-06-27 20:40:42 +0000
commit: c18c464e8da9c36f71e468d52f3090a13acb4fa9 (patch)
tree: 6d2ad504471ca0e911acc1e6ba3b41ee71755ee9 /src/share/algebra/browse.daase
parent: 29325dbb1fed9b472690b8541ef038f138070aea (diff)
download: open-axiom-c18c464e8da9c36f71e468d52f3090a13acb4fa9.tar.gz
1 files changed, 148 insertions, 148 deletions
diff --git a/src/share/algebra/browse.daase b/src/share/algebra/browse.daase
index bb6faffd..f274ebea 100644
--- a/src/share/algebra/browse.daase
+++ b/src/share/algebra/browse.daase
@@ -1,5 +1,5 @@
 
-(2292778 . 3486628450)       
+(2293192 . 3486658188)       
 (-18 A S) 
 ((|constructor| (NIL "One-dimensional-array aggregates serves as models for one-dimensional arrays. Categorically,{} these aggregates are finite linear aggregates with the \\spadatt{shallowlyMutable} property,{} that is,{} any component of the array may be changed without affecting the identity of the overall array. Array data structures are typically represented by a fixed area in storage and therefore cannot efficiently grow or shrink on demand as can list structures (see however \\spadtype{FlexibleArray} for a data structure which is a cross between a list and an array). Iteration over,{} and access to,{} elements of arrays is extremely fast (and often can be optimized to open-code). Insertion and deletion however is generally slow since an entirely new data structure must be created for the result."))) 
 NIL 
@@ -56,7 +56,7 @@ NIL
 ((|constructor| (NIL "This domain represents the syntax for an add-expression.")) (|body| (((|SpadAst|) $) "base(\\spad{d}) returns the actual body of the add-domain expression \\spad{`d'}.")) (|base| (((|SpadAst|) $) "\\spad{base(d)} returns the base domain(\\spad{s}) of the add-domain expression."))) 
 NIL 
 NIL 
-(-32 R -1967) 
+(-32 R -1966) 
 ((|constructor| (NIL "This package provides algebraic functions over an integral domain.")) (|iroot| ((|#2| |#1| (|Integer|)) "\\spad{iroot(p, n)} should be a non-exported function.")) (|definingPolynomial| ((|#2| |#2|) "\\spad{definingPolynomial(f)} returns the defining polynomial of \\spad{f} as an element of \\spad{F}. Error: if \\spad{f} is not a kernel.")) (|minPoly| (((|SparseUnivariatePolynomial| |#2|) (|Kernel| |#2|)) "\\spad{minPoly(k)} returns the defining polynomial of \\spad{k}.")) (** ((|#2| |#2| (|Fraction| (|Integer|))) "\\spad{x ** q} is \\spad{x} raised to the rational power \\spad{q}.")) (|droot| (((|OutputForm|) (|List| |#2|)) "\\spad{droot(l)} should be a non-exported function.")) (|inrootof| ((|#2| (|SparseUnivariatePolynomial| |#2|) |#2|) "\\spad{inrootof(p, x)} should be a non-exported function.")) (|belong?| (((|Boolean|) (|BasicOperator|)) "\\spad{belong?(op)} is \\spad{true} if \\spad{op} is an algebraic operator,{} that is,{} an \\spad{n}th root or implicit algebraic operator.")) (|operator| (((|BasicOperator|) (|BasicOperator|)) "\\spad{operator(op)} returns a copy of \\spad{op} with the domain-dependent properties appropriate for \\spad{F}. Error: if \\spad{op} is not an algebraic operator,{} that is,{} an \\spad{n}th root or implicit algebraic operator.")) (|rootOf| ((|#2| (|SparseUnivariatePolynomial| |#2|) (|Symbol|)) "\\spad{rootOf(p, y)} returns \\spad{y} such that \\spad{p(y) = 0}. The object returned displays as \\spad{'y}."))) 
 NIL 
 ((|HasCategory| |#1| (LIST (QUOTE -1057) (QUOTE (-576))))) 
@@ -88,11 +88,11 @@ NIL
 ((|constructor| (NIL "Factorization of univariate polynomials with coefficients in \\spadtype{AlgebraicNumber}.")) (|doublyTransitive?| (((|Boolean|) |#1|) "\\spad{doublyTransitive?(p)} is \\spad{true} if \\spad{p} is irreducible over over the field \\spad{K} generated by its coefficients,{} and if \\spad{p(X) / (X - a)} is irreducible over \\spad{K(a)} where \\spad{p(a) = 0}.")) (|split| (((|Factored| |#1|) |#1|) "\\spad{split(p)} returns a prime factorisation of \\spad{p} over its splitting field.")) (|factor| (((|Factored| |#1|) |#1|) "\\spad{factor(p)} returns a prime factorisation of \\spad{p} over the field generated by its coefficients.") (((|Factored| |#1|) |#1| (|List| (|AlgebraicNumber|))) "\\spad{factor(p, [a1,...,an])} returns a prime factorisation of \\spad{p} over the field generated by its coefficients and a1,{}...,{}an."))) 
 NIL 
 NIL 
-(-40 -1967 UP UPUP -2583) 
+(-40 -1966 UP UPUP -3290) 
 ((|constructor| (NIL "Function field defined by \\spad{f}(\\spad{x},{} \\spad{y}) = 0.")) (|knownInfBasis| (((|Void|) (|NonNegativeInteger|)) "\\spad{knownInfBasis(n)} \\undocumented{}"))) 
 ((-4455 |has| (-419 |#2|) (-374)) (-4460 |has| (-419 |#2|) (-374)) (-4454 |has| (-419 |#2|) (-374)) ((-4464 "*") . T) (-4456 . T) (-4457 . T) (-4459 . T)) 
 ((|HasCategory| (-419 |#2|) (QUOTE (-146))) (|HasCategory| (-419 |#2|) (QUOTE (-148))) (|HasCategory| (-419 |#2|) (QUOTE (-360))) (-2781 (|HasCategory| (-419 |#2|) (QUOTE (-374))) (|HasCategory| (-419 |#2|) (QUOTE (-360)))) (|HasCategory| (-419 |#2|) (QUOTE (-374))) (|HasCategory| (-419 |#2|) (QUOTE (-379))) (-2781 (-12 (|HasCategory| (-419 |#2|) (QUOTE (-238))) (|HasCategory| (-419 |#2|) (QUOTE (-374)))) (|HasCategory| (-419 |#2|) (QUOTE (-360)))) (-2781 (-12 (|HasCategory| (-419 |#2|) (QUOTE (-238))) (|HasCategory| (-419 |#2|) (QUOTE (-374)))) (-12 (|HasCategory| (-419 |#2|) (QUOTE (-237))) (|HasCategory| (-419 |#2|) (QUOTE (-374)))) (|HasCategory| (-419 |#2|) (QUOTE (-360)))) (-2781 (-12 (|HasCategory| (-419 |#2|) (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasCategory| (-419 |#2|) (QUOTE (-374)))) (-12 (|HasCategory| (-419 |#2|) (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasCategory| (-419 |#2|) (QUOTE (-360))))) (-2781 (-12 (|HasCategory| (-419 |#2|) (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasCategory| (-419 |#2|) (QUOTE (-374)))) (-12 (|HasCategory| (-419 |#2|) (LIST (QUOTE -917) (QUOTE (-1195)))) (|HasCategory| (-419 |#2|) (QUOTE (-374))))) (|HasCategory| (-419 |#2|) (LIST (QUOTE -651) (QUOTE (-576)))) (-2781 (|HasCategory| (-419 |#2|) (LIST (QUOTE -1057) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| (-419 |#2|) (QUOTE (-374)))) (|HasCategory| (-419 |#2|) (LIST (QUOTE -1057) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| (-419 |#2|) (LIST (QUOTE -1057) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#1| (QUOTE (-379))) (-12 (|HasCategory| (-419 |#2|) (QUOTE (-237))) (|HasCategory| (-419 |#2|) (QUOTE (-374)))) (-12 (|HasCategory| (-419 |#2|) (LIST (QUOTE -917) (QUOTE (-1195)))) (|HasCategory| (-419 |#2|) (QUOTE (-374)))) (-12 (|HasCategory| (-419 |#2|) (QUOTE (-238))) (|HasCategory| (-419 |#2|) (QUOTE (-374)))) (-12 (|HasCategory| (-419 |#2|) (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasCategory| (-419 |#2|) (QUOTE (-374))))) 
-(-41 R -1967) 
+(-41 R -1966) 
 ((|constructor| (NIL "AlgebraicManipulations provides functions to simplify and expand expressions involving algebraic operators.")) (|rootKerSimp| ((|#2| (|BasicOperator|) |#2| (|NonNegativeInteger|)) "\\spad{rootKerSimp(op,f,n)} should be local but conditional.")) (|rootSimp| ((|#2| |#2|) "\\spad{rootSimp(f)} transforms every radical of the form \\spad{(a * b**(q*n+r))**(1/n)} appearing in \\spad{f} into \\spad{b**q * (a * b**r)**(1/n)}. This transformation is not in general valid for all complex numbers \\spad{b}.")) (|rootProduct| ((|#2| |#2|) "\\spad{rootProduct(f)} combines every product of the form \\spad{(a**(1/n))**m * (a**(1/s))**t} into a single power of a root of \\spad{a},{} and transforms every radical power of the form \\spad{(a**(1/n))**m} into a simpler form.")) (|rootPower| ((|#2| |#2|) "\\spad{rootPower(f)} transforms every radical power of the form \\spad{(a**(1/n))**m} into a simpler form if \\spad{m} and \\spad{n} have a common factor.")) (|ratPoly| (((|SparseUnivariatePolynomial| |#2|) |#2|) "\\spad{ratPoly(f)} returns a polynomial \\spad{p} such that \\spad{p} has no algebraic coefficients,{} and \\spad{p(f) = 0}.")) (|ratDenom| ((|#2| |#2| (|List| (|Kernel| |#2|))) "\\spad{ratDenom(f, [a1,...,an])} removes the \\spad{ai}\\spad{'s} which are algebraic from the denominators in \\spad{f}.") ((|#2| |#2| (|List| |#2|)) "\\spad{ratDenom(f, [a1,...,an])} removes the \\spad{ai}\\spad{'s} which are algebraic kernels from the denominators in \\spad{f}.") ((|#2| |#2| |#2|) "\\spad{ratDenom(f, a)} removes \\spad{a} from the denominators in \\spad{f} if \\spad{a} is an algebraic kernel.") ((|#2| |#2|) "\\spad{ratDenom(f)} rationalizes the denominators appearing in \\spad{f} by moving all the algebraic quantities into the numerators.")) (|rootSplit| ((|#2| |#2|) "\\spad{rootSplit(f)} transforms every radical of the form \\spad{(a/b)**(1/n)} appearing in \\spad{f} into \\spad{a**(1/n) / b**(1/n)}. This transformation is not in general valid for all complex numbers \\spad{a} and \\spad{b}.")) (|coerce| (($ (|SparseMultivariatePolynomial| |#1| (|Kernel| $))) "\\spad{coerce(x)} \\undocumented")) (|denom| (((|SparseMultivariatePolynomial| |#1| (|Kernel| $)) $) "\\spad{denom(x)} \\undocumented")) (|numer| (((|SparseMultivariatePolynomial| |#1| (|Kernel| $)) $) "\\spad{numer(x)} \\undocumented"))) 
 NIL 
 ((-12 (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (LIST (QUOTE -1057) (QUOTE (-576)))) (|HasCategory| |#2| (LIST (QUOTE -442) (|devaluate| |#1|))))) 
@@ -144,7 +144,7 @@ NIL
 ((|constructor| (NIL "\\spad{ApplyUnivariateSkewPolynomial} (internal) allows univariate skew polynomials to be applied to appropriate modules.")) (|apply| ((|#2| |#3| (|Mapping| |#2| |#2|) |#2|) "\\spad{apply(p, f, m)} returns \\spad{p(m)} where the action is given by \\spad{x m = f(m)}. \\spad{f} must be an \\spad{R}-pseudo linear map on \\spad{M}."))) 
 NIL 
 NIL 
-(-54 |Base| R -1967) 
+(-54 |Base| R -1966) 
 ((|constructor| (NIL "This package apply rewrite rules to expressions,{} calling the pattern matcher.")) (|localUnquote| ((|#3| |#3| (|List| (|Symbol|))) "\\spad{localUnquote(f,ls)} is a local function.")) (|applyRules| ((|#3| (|List| (|RewriteRule| |#1| |#2| |#3|)) |#3| (|PositiveInteger|)) "\\spad{applyRules([r1,...,rn], expr, n)} applies the rules \\spad{r1},{}...,{}\\spad{rn} to \\spad{f} a most \\spad{n} times.") ((|#3| (|List| (|RewriteRule| |#1| |#2| |#3|)) |#3|) "\\spad{applyRules([r1,...,rn], expr)} applies the rules \\spad{r1},{}...,{}\\spad{rn} to \\spad{f} an unlimited number of times,{} \\spadignore{i.e.} until none of \\spad{r1},{}...,{}\\spad{rn} is applicable to the expression."))) 
 NIL 
 NIL 
@@ -392,7 +392,7 @@ NIL
 ((|constructor| (NIL "A basic operator is an object that can be applied to a list of arguments from a set,{} the result being a kernel over that set.")) (|setProperties| (($ $ (|AssociationList| (|String|) (|None|))) "\\spad{setProperties(op, l)} sets the property list of \\spad{op} to \\spad{l}. Argument \\spad{op} is modified \"in place\",{} \\spadignore{i.e.} no copy is made.")) (|setProperty| (($ $ (|Identifier|) (|None|)) "\\spad{setProperty(op, p, v)} attaches property \\spad{p} to \\spad{op},{} and sets its value to \\spad{v}. Argument \\spad{op} is modified \"in place\",{} \\spadignore{i.e.} no copy is made.") (($ $ (|String|) (|None|)) "\\spad{setProperty(op, s, v)} attaches property \\spad{s} to \\spad{op},{} and sets its value to \\spad{v}. Argument \\spad{op} is modified \"in place\",{} \\spadignore{i.e.} no copy is made.")) (|property| (((|Maybe| (|None|)) $ (|Identifier|)) "\\spad{property(op, p)} returns the value of property \\spad{p} if it is attached to \\spad{op},{} otherwise \\spad{nothing}.") (((|Union| (|None|) "failed") $ (|String|)) "\\spad{property(op, s)} returns the value of property \\spad{s} if it is attached to \\spad{op},{} and \"failed\" otherwise.")) (|deleteProperty!| (($ $ (|Identifier|)) "\\spad{deleteProperty!(op, p)} unattaches property \\spad{p} from \\spad{op}. Argument \\spad{op} is modified \"in place\",{} \\spadignore{i.e.} no copy is made.") (($ $ (|String|)) "\\spad{deleteProperty!(op, s)} unattaches property \\spad{s} from \\spad{op}. Argument \\spad{op} is modified \"in place\",{} \\spadignore{i.e.} no copy is made.")) (|assert| (($ $ (|Identifier|)) "\\spad{assert(op, p)} attaches property \\spad{p} to \\spad{op}. Argument \\spad{op} is modified \"in place\",{} \\spadignore{i.e.} no copy is made.")) (|has?| (((|Boolean|) $ (|Identifier|)) "\\spad{has?(op,p)} tests if property \\spad{s} is attached to \\spad{op}.")) (|input| (((|Union| (|Mapping| (|InputForm|) (|List| (|InputForm|))) "failed") $) "\\spad{input(op)} returns the \"\\%input\" property of \\spad{op} if it has one attached,{} \"failed\" otherwise.") (($ $ (|Mapping| (|InputForm|) (|List| (|InputForm|)))) "\\spad{input(op, foo)} attaches foo as the \"\\%input\" property of \\spad{op}. If \\spad{op} has a \"\\%input\" property \\spad{f},{} then \\spad{op(a1,...,an)} gets converted to InputForm as \\spad{f(a1,...,an)}.")) (|display| (($ $ (|Mapping| (|OutputForm|) (|OutputForm|))) "\\spad{display(op, foo)} attaches foo as the \"\\%display\" property of \\spad{op}. If \\spad{op} has a \"\\%display\" property \\spad{f},{} then \\spad{op(a)} gets converted to OutputForm as \\spad{f(a)}. Argument \\spad{op} must be unary.") (($ $ (|Mapping| (|OutputForm|) (|List| (|OutputForm|)))) "\\spad{display(op, foo)} attaches foo as the \"\\%display\" property of \\spad{op}. If \\spad{op} has a \"\\%display\" property \\spad{f},{} then \\spad{op(a1,...,an)} gets converted to OutputForm as \\spad{f(a1,...,an)}.") (((|Union| (|Mapping| (|OutputForm|) (|List| (|OutputForm|))) "failed") $) "\\spad{display(op)} returns the \"\\%display\" property of \\spad{op} if it has one attached,{} and \"failed\" otherwise.")) (|comparison| (($ $ (|Mapping| (|Boolean|) $ $)) "\\spad{comparison(op, foo?)} attaches foo? as the \"\\%less?\" property to \\spad{op}. If op1 and op2 have the same name,{} and one of them has a \"\\%less?\" property \\spad{f},{} then \\spad{f(op1, op2)} is called to decide whether \\spad{op1 < op2}.")) (|equality| (($ $ (|Mapping| (|Boolean|) $ $)) "\\spad{equality(op, foo?)} attaches foo? as the \"\\%equal?\" property to \\spad{op}. If op1 and op2 have the same name,{} and one of them has an \"\\%equal?\" property \\spad{f},{} then \\spad{f(op1, op2)} is called to decide whether op1 and op2 should be considered equal.")) (|weight| (($ $ (|NonNegativeInteger|)) "\\spad{weight(op, n)} attaches the weight \\spad{n} to \\spad{op}.") (((|NonNegativeInteger|) $) "\\spad{weight(op)} returns the weight attached to \\spad{op}.")) (|nary?| (((|Boolean|) $) "\\spad{nary?(op)} tests if \\spad{op} has arbitrary arity.")) (|unary?| (((|Boolean|) $) "\\spad{unary?(op)} tests if \\spad{op} is unary.")) (|nullary?| (((|Boolean|) $) "\\spad{nullary?(op)} tests if \\spad{op} is nullary.")) (|operator| (($ (|Symbol|) (|Arity|)) "\\spad{operator(f, a)} makes \\spad{f} into an operator of arity \\spad{a}.") (($ (|Symbol|) (|NonNegativeInteger|)) "\\spad{operator(f, n)} makes \\spad{f} into an \\spad{n}-ary operator.") (($ (|Symbol|)) "\\spad{operator(f)} makes \\spad{f} into an operator with arbitrary arity.")) (|copy| (($ $) "\\spad{copy(op)} returns a copy of \\spad{op}.")) (|properties| (((|AssociationList| (|String|) (|None|)) $) "\\spad{properties(op)} returns the list of all the properties currently attached to \\spad{op}."))) 
 NIL 
 NIL 
-(-116 -1967 UP) 
+(-116 -1966 UP) 
 ((|constructor| (NIL "\\spadtype{BoundIntegerRoots} provides functions to find lower bounds on the integer roots of a polynomial.")) (|integerBound| (((|Integer|) |#2|) "\\spad{integerBound(p)} returns a lower bound on the negative integer roots of \\spad{p},{} and 0 if \\spad{p} has no negative integer roots."))) 
 NIL 
 NIL 
@@ -524,7 +524,7 @@ NIL
 ((|constructor| (NIL "Rings of Characteristic Zero."))) 
 ((-4459 . T)) 
 NIL 
-(-149 -1967 UP UPUP) 
+(-149 -1966 UP UPUP) 
 ((|constructor| (NIL "Tools to send a point to infinity on an algebraic curve.")) (|chvar| (((|Record| (|:| |func| |#3|) (|:| |poly| |#3|) (|:| |c1| (|Fraction| |#2|)) (|:| |c2| (|Fraction| |#2|)) (|:| |deg| (|NonNegativeInteger|))) |#3| |#3|) "\\spad{chvar(f(x,y), p(x,y))} returns \\spad{[g(z,t), q(z,t), c1(z), c2(z), n]} such that under the change of variable \\spad{x = c1(z)},{} \\spad{y = t * c2(z)},{} one gets \\spad{f(x,y) = g(z,t)}. The algebraic relation between \\spad{x} and \\spad{y} is \\spad{p(x, y) = 0}. The algebraic relation between \\spad{z} and \\spad{t} is \\spad{q(z, t) = 0}.")) (|eval| ((|#3| |#3| (|Fraction| |#2|) (|Fraction| |#2|)) "\\spad{eval(p(x,y), f(x), g(x))} returns \\spad{p(f(x), y * g(x))}.")) (|goodPoint| ((|#1| |#3| |#3|) "\\spad{goodPoint(p, q)} returns an integer a such that a is neither a pole of \\spad{p(x,y)} nor a branch point of \\spad{q(x,y) = 0}.")) (|rootPoly| (((|Record| (|:| |exponent| (|NonNegativeInteger|)) (|:| |coef| (|Fraction| |#2|)) (|:| |radicand| |#2|)) (|Fraction| |#2|) (|NonNegativeInteger|)) "\\spad{rootPoly(g, n)} returns \\spad{[m, c, P]} such that \\spad{c * g ** (1/n) = P ** (1/m)} thus if \\spad{y**n = g},{} then \\spad{z**m = P} where \\spad{z = c * y}.")) (|radPoly| (((|Union| (|Record| (|:| |radicand| (|Fraction| |#2|)) (|:| |deg| (|NonNegativeInteger|))) "failed") |#3|) "\\spad{radPoly(p(x, y))} returns \\spad{[c(x), n]} if \\spad{p} is of the form \\spad{y**n - c(x)},{} \"failed\" otherwise.")) (|mkIntegral| (((|Record| (|:| |coef| (|Fraction| |#2|)) (|:| |poly| |#3|)) |#3|) "\\spad{mkIntegral(p(x,y))} returns \\spad{[c(x), q(x,z)]} such that \\spad{z = c * y} is integral. The algebraic relation between \\spad{x} and \\spad{y} is \\spad{p(x, y) = 0}. The algebraic relation between \\spad{x} and \\spad{z} is \\spad{q(x, z) = 0}."))) 
 NIL 
 NIL 
@@ -564,7 +564,7 @@ NIL
 ((|constructor| (NIL "Color() specifies a domain of 27 colors provided in the \\Language{} system (the colors mix additively).")) (|color| (($ (|Integer|)) "\\spad{color(i)} returns a color of the indicated hue \\spad{i}.")) (|numberOfHues| (((|PositiveInteger|)) "\\spad{numberOfHues()} returns the number of total hues,{} set in totalHues.")) (|hue| (((|Integer|) $) "\\spad{hue(c)} returns the hue index of the indicated color \\spad{c}.")) (|blue| (($) "\\spad{blue()} returns the position of the blue hue from total hues.")) (|green| (($) "\\spad{green()} returns the position of the green hue from total hues.")) (|yellow| (($) "\\spad{yellow()} returns the position of the yellow hue from total hues.")) (|red| (($) "\\spad{red()} returns the position of the red hue from total hues.")) (+ (($ $ $) "\\spad{c1 + c2} additively mixes the two colors \\spad{c1} and \\spad{c2}.")) (* (($ (|DoubleFloat|) $) "\\spad{s * c},{} returns the color \\spad{c},{} whose weighted shade has been scaled by \\spad{s}.") (($ (|PositiveInteger|) $) "\\spad{s * c},{} returns the color \\spad{c},{} whose weighted shade has been scaled by \\spad{s}."))) 
 NIL 
 NIL 
-(-159 R -1967) 
+(-159 R -1966) 
 ((|constructor| (NIL "Provides combinatorial functions over an integral domain.")) (|ipow| ((|#2| (|List| |#2|)) "\\spad{ipow(l)} should be local but conditional.")) (|iidprod| ((|#2| (|List| |#2|)) "\\spad{iidprod(l)} should be local but conditional.")) (|iidsum| ((|#2| (|List| |#2|)) "\\spad{iidsum(l)} should be local but conditional.")) (|iipow| ((|#2| (|List| |#2|)) "\\spad{iipow(l)} should be local but conditional.")) (|iiperm| ((|#2| (|List| |#2|)) "\\spad{iiperm(l)} should be local but conditional.")) (|iibinom| ((|#2| (|List| |#2|)) "\\spad{iibinom(l)} should be local but conditional.")) (|iifact| ((|#2| |#2|) "\\spad{iifact(x)} should be local but conditional.")) (|product| ((|#2| |#2| (|SegmentBinding| |#2|)) "\\spad{product(f(n), n = a..b)} returns \\spad{f}(a) * ... * \\spad{f}(\\spad{b}) as a formal product.") ((|#2| |#2| (|Symbol|)) "\\spad{product(f(n), n)} returns the formal product \\spad{P}(\\spad{n}) which verifies \\spad{P}(\\spad{n+1})\\spad{/P}(\\spad{n}) = \\spad{f}(\\spad{n}).")) (|summation| ((|#2| |#2| (|SegmentBinding| |#2|)) "\\spad{summation(f(n), n = a..b)} returns \\spad{f}(a) + ... + \\spad{f}(\\spad{b}) as a formal sum.") ((|#2| |#2| (|Symbol|)) "\\spad{summation(f(n), n)} returns the formal sum \\spad{S}(\\spad{n}) which verifies \\spad{S}(\\spad{n+1}) - \\spad{S}(\\spad{n}) = \\spad{f}(\\spad{n}).")) (|factorials| ((|#2| |#2| (|Symbol|)) "\\spad{factorials(f, x)} rewrites the permutations and binomials in \\spad{f} involving \\spad{x} in terms of factorials.") ((|#2| |#2|) "\\spad{factorials(f)} rewrites the permutations and binomials in \\spad{f} in terms of factorials.")) (|factorial| ((|#2| |#2|) "\\spad{factorial(n)} returns the factorial of \\spad{n},{} \\spadignore{i.e.} \\spad{n!}.")) (|permutation| ((|#2| |#2| |#2|) "\\spad{permutation(n, r)} returns the number of permutations of \\spad{n} objects taken \\spad{r} at a time,{} \\spadignore{i.e.} \\spad{n!/}(\\spad{n}-\\spad{r})!.")) (|binomial| ((|#2| |#2| |#2|) "\\spad{binomial(n, r)} returns the number of subsets of \\spad{r} objects taken among \\spad{n} objects,{} \\spadignore{i.e.} \\spad{n!/}(\\spad{r!} * (\\spad{n}-\\spad{r})!).")) (** ((|#2| |#2| |#2|) "\\spad{a ** b} is the formal exponential a**b.")) (|operator| (((|BasicOperator|) (|BasicOperator|)) "\\spad{operator(op)} returns a copy of \\spad{op} with the domain-dependent properties appropriate for \\spad{F}; error if \\spad{op} is not a combinatorial operator.")) (|belong?| (((|Boolean|) (|BasicOperator|)) "\\spad{belong?(op)} is \\spad{true} if \\spad{op} is a combinatorial operator."))) 
 NIL 
 NIL 
@@ -688,7 +688,7 @@ NIL
 ((|constructor| (NIL "This domain provides implementations for constructors.")) (|findConstructor| (((|Maybe| $) (|Identifier|)) "\\spad{findConstructor(s)} attempts to find a constructor named \\spad{s}. If successful,{} returns that constructor; otherwise,{} returns \\spad{nothing}."))) 
 NIL 
 NIL 
-(-190 R -1967) 
+(-190 R -1966) 
 ((|constructor| (NIL "\\spadtype{ComplexTrigonometricManipulations} provides function that compute the real and imaginary parts of complex functions.")) (|complexForm| (((|Complex| (|Expression| |#1|)) |#2|) "\\spad{complexForm(f)} returns \\spad{[real f, imag f]}.")) (|trigs| ((|#2| |#2|) "\\spad{trigs(f)} rewrites all the complex logs and exponentials appearing in \\spad{f} in terms of trigonometric functions.")) (|real?| (((|Boolean|) |#2|) "\\spad{real?(f)} returns \\spad{true} if \\spad{f = real f}.")) (|imag| (((|Expression| |#1|) |#2|) "\\spad{imag(f)} returns the imaginary part of \\spad{f} where \\spad{f} is a complex function.")) (|real| (((|Expression| |#1|) |#2|) "\\spad{real(f)} returns the real part of \\spad{f} where \\spad{f} is a complex function.")) (|complexElementary| ((|#2| |#2| (|Symbol|)) "\\spad{complexElementary(f, x)} rewrites the kernels of \\spad{f} involving \\spad{x} in terms of the 2 fundamental complex transcendental elementary functions: \\spad{log, exp}.") ((|#2| |#2|) "\\spad{complexElementary(f)} rewrites \\spad{f} in terms of the 2 fundamental complex transcendental elementary functions: \\spad{log, exp}.")) (|complexNormalize| ((|#2| |#2| (|Symbol|)) "\\spad{complexNormalize(f, x)} rewrites \\spad{f} using the least possible number of complex independent kernels involving \\spad{x}.") ((|#2| |#2|) "\\spad{complexNormalize(f)} rewrites \\spad{f} using the least possible number of complex independent kernels."))) 
 NIL 
 NIL 
@@ -796,11 +796,11 @@ NIL
 ((|constructor| (NIL "\\indented{1}{This domain implements a simple view of a database whose fields are} indexed by symbols")) (- (($ $ $) "\\spad{db1-db2} returns the difference of databases \\spad{db1} and \\spad{db2} \\spadignore{i.e.} consisting of elements in \\spad{db1} but not in \\spad{db2}")) (+ (($ $ $) "\\spad{db1+db2} returns the merge of databases \\spad{db1} and \\spad{db2}")) (|fullDisplay| (((|Void|) $ (|PositiveInteger|) (|PositiveInteger|)) "\\spad{fullDisplay(db,start,end )} prints full details of entries in the range \\axiom{\\spad{start}..end} in \\axiom{\\spad{db}}.") (((|Void|) $) "\\spad{fullDisplay(db)} prints full details of each entry in \\axiom{\\spad{db}}.") (((|Void|) $) "\\spad{fullDisplay(x)} displays \\spad{x} in detail")) (|display| (((|Void|) $) "\\spad{display(db)} prints a summary line for each entry in \\axiom{\\spad{db}}.") (((|Void|) $) "\\spad{display(x)} displays \\spad{x} in some form")) (|elt| (((|DataList| (|String|)) $ (|Symbol|)) "\\spad{elt(db,s)} returns the \\axiom{\\spad{s}} field of each element of \\axiom{\\spad{db}}.") (($ $ (|QueryEquation|)) "\\spad{elt(db,q)} returns all elements of \\axiom{\\spad{db}} which satisfy \\axiom{\\spad{q}}.") (((|String|) $ (|Symbol|)) "\\spad{elt(x,s)} returns an element of \\spad{x} indexed by \\spad{s}"))) 
 NIL 
 NIL 
-(-217 -1967 UP UPUP R) 
+(-217 -1966 UP UPUP R) 
 ((|constructor| (NIL "This package provides functions for computing the residues of a function on an algebraic curve.")) (|doubleResultant| ((|#2| |#4| (|Mapping| |#2| |#2|)) "\\spad{doubleResultant(f, ')} returns \\spad{p}(\\spad{x}) whose roots are rational multiples of the residues of \\spad{f} at all its finite poles. Argument ' is the derivation to use."))) 
 NIL 
 NIL 
-(-218 -1967 FP) 
+(-218 -1966 FP) 
 ((|constructor| (NIL "Package for the factorization of a univariate polynomial with coefficients in a finite field. The algorithm used is the \"distinct degree\" algorithm of Cantor-Zassenhaus,{} modified to use trace instead of the norm and a table for computing Frobenius as suggested by Naudin and Quitte .")) (|irreducible?| (((|Boolean|) |#2|) "\\spad{irreducible?(p)} tests whether the polynomial \\spad{p} is irreducible.")) (|tracePowMod| ((|#2| |#2| (|NonNegativeInteger|) |#2|) "\\spad{tracePowMod(u,k,v)} produces the sum of \\spad{u**(q**i)} for \\spad{i} running and \\spad{q=} size \\spad{F}")) (|trace2PowMod| ((|#2| |#2| (|NonNegativeInteger|) |#2|) "\\spad{trace2PowMod(u,k,v)} produces the sum of \\spad{u**(2**i)} for \\spad{i} running from 1 to \\spad{k} all computed modulo the polynomial \\spad{v}.")) (|exptMod| ((|#2| |#2| (|NonNegativeInteger|) |#2|) "\\spad{exptMod(u,k,v)} raises the polynomial \\spad{u} to the \\spad{k}th power modulo the polynomial \\spad{v}.")) (|separateFactors| (((|List| |#2|) (|List| (|Record| (|:| |deg| (|NonNegativeInteger|)) (|:| |prod| |#2|)))) "\\spad{separateFactors(lfact)} takes the list produced by \\spadfunFrom{separateDegrees}{DistinctDegreeFactorization} and produces the complete list of factors.")) (|separateDegrees| (((|List| (|Record| (|:| |deg| (|NonNegativeInteger|)) (|:| |prod| |#2|))) |#2|) "\\spad{separateDegrees(p)} splits the square free polynomial \\spad{p} into factors each of which is a product of irreducibles of the same degree.")) (|distdfact| (((|Record| (|:| |cont| |#1|) (|:| |factors| (|List| (|Record| (|:| |irr| |#2|) (|:| |pow| (|Integer|)))))) |#2| (|Boolean|)) "\\spad{distdfact(p,sqfrflag)} produces the complete factorization of the polynomial \\spad{p} returning an internal data structure. If argument \\spad{sqfrflag} is \\spad{true},{} the polynomial is assumed square free.")) (|factorSquareFree| (((|Factored| |#2|) |#2|) "\\spad{factorSquareFree(p)} produces the complete factorization of the square free polynomial \\spad{p}.")) (|factor| (((|Factored| |#2|) |#2|) "\\spad{factor(p)} produces the complete factorization of the polynomial \\spad{p}."))) 
 NIL 
 NIL 
@@ -812,7 +812,7 @@ NIL
 ((|constructor| (NIL "This domain represents the syntax of a definition.")) (|body| (((|SpadAst|) $) "\\spad{body(d)} returns the right hand side of the definition \\spad{`d'}.")) (|signature| (((|Signature|) $) "\\spad{signature(d)} returns the signature of the operation being defined. Note that this list may be partial in that it contains only the types actually specified in the definition.")) (|head| (((|HeadAst|) $) "\\spad{head(d)} returns the head of the definition \\spad{`d'}. This is a list of identifiers starting with the name of the operation followed by the name of the parameters,{} if any."))) 
 NIL 
 NIL 
-(-221 R -1967) 
+(-221 R -1966) 
 ((|constructor| (NIL "\\spadtype{ElementaryFunctionDefiniteIntegration} provides functions to compute definite integrals of elementary functions.")) (|innerint| (((|Union| (|:| |f1| (|OrderedCompletion| |#2|)) (|:| |f2| (|List| (|OrderedCompletion| |#2|))) (|:| |fail| "failed") (|:| |pole| "potentialPole")) |#2| (|Symbol|) (|OrderedCompletion| |#2|) (|OrderedCompletion| |#2|) (|Boolean|)) "\\spad{innerint(f, x, a, b, ignore?)} should be local but conditional")) (|integrate| (((|Union| (|:| |f1| (|OrderedCompletion| |#2|)) (|:| |f2| (|List| (|OrderedCompletion| |#2|))) (|:| |fail| "failed") (|:| |pole| "potentialPole")) |#2| (|SegmentBinding| (|OrderedCompletion| |#2|)) (|String|)) "\\spad{integrate(f, x = a..b, \"noPole\")} returns the integral of \\spad{f(x)dx} from a to \\spad{b}. If it is not possible to check whether \\spad{f} has a pole for \\spad{x} between a and \\spad{b} (because of parameters),{} then this function will assume that \\spad{f} has no such pole. Error: if \\spad{f} has a pole for \\spad{x} between a and \\spad{b} or if the last argument is not \"noPole\".") (((|Union| (|:| |f1| (|OrderedCompletion| |#2|)) (|:| |f2| (|List| (|OrderedCompletion| |#2|))) (|:| |fail| "failed") (|:| |pole| "potentialPole")) |#2| (|SegmentBinding| (|OrderedCompletion| |#2|))) "\\spad{integrate(f, x = a..b)} returns the integral of \\spad{f(x)dx} from a to \\spad{b}. Error: if \\spad{f} has a pole for \\spad{x} between a and \\spad{b}."))) 
 NIL 
 NIL 
@@ -832,7 +832,7 @@ NIL
 ((|constructor| (NIL "The deRham complex of Euclidean space,{} that is,{} the class of differential forms of arbitary degree over a coefficient ring. See Flanders,{} Harley,{} Differential Forms,{} With Applications to the Physical Sciences,{} New York,{} Academic Press,{} 1963.")) (|exteriorDifferential| (($ $) "\\spad{exteriorDifferential(df)} returns the exterior derivative (gradient,{} curl,{} divergence,{} ...) of the differential form \\spad{df}.")) (|totalDifferential| (($ (|Expression| |#1|)) "\\spad{totalDifferential(x)} returns the total differential (gradient) form for element \\spad{x}.")) (|map| (($ (|Mapping| (|Expression| |#1|) (|Expression| |#1|)) $) "\\spad{map(f,df)} replaces each coefficient \\spad{x} of differential form \\spad{df} by \\spad{f(x)}.")) (|degree| (((|Integer|) $) "\\spad{degree(df)} returns the homogeneous degree of differential form \\spad{df}.")) (|retractable?| (((|Boolean|) $) "\\spad{retractable?(df)} tests if differential form \\spad{df} is a 0-form,{} \\spadignore{i.e.} if degree(\\spad{df}) = 0.")) (|homogeneous?| (((|Boolean|) $) "\\spad{homogeneous?(df)} tests if all of the terms of differential form \\spad{df} have the same degree.")) (|generator| (($ (|NonNegativeInteger|)) "\\spad{generator(n)} returns the \\spad{n}th basis term for a differential form.")) (|coefficient| (((|Expression| |#1|) $ $) "\\spad{coefficient(df,u)},{} where \\spad{df} is a differential form,{} returns the coefficient of \\spad{df} containing the basis term \\spad{u} if such a term exists,{} and 0 otherwise.")) (|reductum| (($ $) "\\spad{reductum(df)},{} where \\spad{df} is a differential form,{} returns \\spad{df} minus the leading term of \\spad{df} if \\spad{df} has two or more terms,{} and 0 otherwise.")) (|leadingBasisTerm| (($ $) "\\spad{leadingBasisTerm(df)} returns the leading basis term of differential form \\spad{df}.")) (|leadingCoefficient| (((|Expression| |#1|) $) "\\spad{leadingCoefficient(df)} returns the leading coefficient of differential form \\spad{df}."))) 
 ((-4459 . T)) 
 NIL 
-(-226 R -1967) 
+(-226 R -1966) 
 ((|constructor| (NIL "\\spadtype{DefiniteIntegrationTools} provides common tools used by the definite integration of both rational and elementary functions.")) (|checkForZero| (((|Union| (|Boolean|) "failed") (|SparseUnivariatePolynomial| |#2|) (|OrderedCompletion| |#2|) (|OrderedCompletion| |#2|) (|Boolean|)) "\\spad{checkForZero(p, a, b, incl?)} is \\spad{true} if \\spad{p} has a zero between a and \\spad{b},{} \\spad{false} otherwise,{} \"failed\" if this cannot be determined. Check for a and \\spad{b} inclusive if incl? is \\spad{true},{} exclusive otherwise.") (((|Union| (|Boolean|) "failed") (|Polynomial| |#1|) (|Symbol|) (|OrderedCompletion| |#2|) (|OrderedCompletion| |#2|) (|Boolean|)) "\\spad{checkForZero(p, x, a, b, incl?)} is \\spad{true} if \\spad{p} has a zero for \\spad{x} between a and \\spad{b},{} \\spad{false} otherwise,{} \"failed\" if this cannot be determined. Check for a and \\spad{b} inclusive if incl? is \\spad{true},{} exclusive otherwise.")) (|computeInt| (((|Union| (|OrderedCompletion| |#2|) "failed") (|Kernel| |#2|) |#2| (|OrderedCompletion| |#2|) (|OrderedCompletion| |#2|) (|Boolean|)) "\\spad{computeInt(x, g, a, b, eval?)} returns the integral of \\spad{f} for \\spad{x} between a and \\spad{b},{} assuming that \\spad{g} is an indefinite integral of \\spad{f} and \\spad{f} has no pole between a and \\spad{b}. If \\spad{eval?} is \\spad{true},{} then \\spad{g} can be evaluated safely at \\spad{a} and \\spad{b},{} provided that they are finite values. Otherwise,{} limits must be computed.")) (|ignore?| (((|Boolean|) (|String|)) "\\spad{ignore?(s)} is \\spad{true} if \\spad{s} is the string that tells the integrator to assume that the function has no pole in the integration interval."))) 
 NIL 
 NIL 
@@ -958,11 +958,11 @@ NIL
 NIL 
 (-257 |n| R M S) 
 ((|constructor| (NIL "This constructor provides a direct product type with a left matrix-module view."))) 
-((-4459 -2781 (-2696 (|has| |#4| (-1068)) (|has| |#4| (-238))) (|has| |#4| (-6 -4459)) (-2696 (|has| |#4| (-1068)) (|has| |#4| (-915 (-1195))))) (-4456 |has| |#4| (-1068)) (-4457 |has| |#4| (-1068)) (-4462 . T)) 
+((-4459 -2781 (-2697 (|has| |#4| (-1068)) (|has| |#4| (-238))) (|has| |#4| (-6 -4459)) (-2697 (|has| |#4| (-1068)) (|has| |#4| (-915 (-1195))))) (-4456 |has| |#4| (-1068)) (-4457 |has| |#4| (-1068)) (-4462 . T)) 
 ((-2781 (-12 (|HasCategory| |#4| (QUOTE (-21))) (|HasCategory| |#4| (LIST (QUOTE -319) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-174))) (|HasCategory| |#4| (LIST (QUOTE -319) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-238))) (|HasCategory| |#4| (LIST (QUOTE -319) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-374))) (|HasCategory| |#4| (LIST (QUOTE -319) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-379))) (|HasCategory| |#4| (LIST (QUOTE -319) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-738))) (|HasCategory| |#4| (LIST (QUOTE -319) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-805))) (|HasCategory| |#4| (LIST (QUOTE -319) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-862))) (|HasCategory| |#4| (LIST (QUOTE -319) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-1068))) (|HasCategory| |#4| (LIST (QUOTE -319) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-1119))) (|HasCategory| |#4| (LIST (QUOTE -319) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -319) (|devaluate| |#4|))) (|HasCategory| |#4| (LIST (QUOTE -915) (QUOTE (-1195)))))) (|HasCategory| |#4| (QUOTE (-374))) (-2781 (|HasCategory| |#4| (QUOTE (-174))) (|HasCategory| |#4| (QUOTE (-374))) (|HasCategory| |#4| (QUOTE (-1068)))) (-2781 (|HasCategory| |#4| (QUOTE (-174))) (|HasCategory| |#4| (QUOTE (-374)))) (|HasCategory| |#4| (QUOTE (-1068))) (|HasCategory| |#4| (QUOTE (-738))) (|HasCategory| |#4| (QUOTE (-805))) (-2781 (|HasCategory| |#4| (QUOTE (-805))) (|HasCategory| |#4| (QUOTE (-862)))) (|HasCategory| |#4| (QUOTE (-379))) (-2781 (-12 (|HasCategory| |#4| (LIST (QUOTE -651) (QUOTE (-576)))) (|HasCategory| |#4| (LIST (QUOTE -915) (QUOTE (-1195))))) (-12 (|HasCategory| |#4| (QUOTE (-174))) (|HasCategory| |#4| (LIST (QUOTE -651) (QUOTE (-576))))) (-12 (|HasCategory| |#4| (QUOTE (-238))) (|HasCategory| |#4| (LIST (QUOTE -651) (QUOTE (-576))))) (-12 (|HasCategory| |#4| (QUOTE (-374))) (|HasCategory| |#4| (LIST (QUOTE -651) (QUOTE (-576))))) (-12 (|HasCategory| |#4| (QUOTE (-1068))) (|HasCategory| |#4| (LIST (QUOTE -651) (QUOTE (-576)))))) (|HasCategory| |#4| (LIST (QUOTE -915) (QUOTE (-1195)))) (-2781 (|HasCategory| |#4| (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasCategory| |#4| (QUOTE (-238))) (|HasCategory| |#4| (QUOTE (-1068)))) (|HasCategory| |#4| (QUOTE (-238))) (-2781 (|HasCategory| |#4| (QUOTE (-238))) (-12 (|HasCategory| |#4| (QUOTE (-237))) (|HasCategory| |#4| (QUOTE (-1068))))) (-2781 (|HasCategory| |#4| (LIST (QUOTE -915) (QUOTE (-1195)))) (-12 (|HasCategory| |#4| (QUOTE (-1068))) (|HasCategory| |#4| (LIST (QUOTE -917) (QUOTE (-1195)))))) (|HasCategory| |#4| (QUOTE (-1119))) (-2781 (-12 (|HasCategory| |#4| (LIST (QUOTE -1057) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| |#4| (LIST (QUOTE -915) (QUOTE (-1195))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1057) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| |#4| (QUOTE (-21)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1057) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| |#4| (QUOTE (-174)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1057) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| |#4| (QUOTE (-238)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1057) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| |#4| (QUOTE (-374)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1057) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| |#4| (QUOTE (-379)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1057) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| |#4| (QUOTE (-738)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1057) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| |#4| (QUOTE (-805)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1057) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| |#4| (QUOTE (-862)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1057) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| |#4| (QUOTE (-1068)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1057) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| |#4| (QUOTE (-1119))))) (-2781 (-12 (|HasCategory| |#4| (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasCategory| |#4| (LIST (QUOTE -1057) (QUOTE (-576))))) (-12 (|HasCategory| |#4| (QUOTE (-21))) (|HasCategory| |#4| (LIST (QUOTE -1057) (QUOTE (-576))))) (-12 (|HasCategory| |#4| (QUOTE (-174))) (|HasCategory| |#4| (LIST (QUOTE -1057) (QUOTE (-576))))) (-12 (|HasCategory| |#4| (QUOTE (-238))) (|HasCategory| |#4| (LIST (QUOTE -1057) (QUOTE (-576))))) (-12 (|HasCategory| |#4| (QUOTE (-374))) (|HasCategory| |#4| (LIST (QUOTE -1057) (QUOTE (-576))))) (-12 (|HasCategory| |#4| (QUOTE (-379))) (|HasCategory| |#4| (LIST (QUOTE -1057) (QUOTE (-576))))) (-12 (|HasCategory| |#4| (QUOTE (-738))) (|HasCategory| |#4| (LIST (QUOTE -1057) (QUOTE (-576))))) (-12 (|HasCategory| |#4| (QUOTE (-805))) (|HasCategory| |#4| (LIST (QUOTE -1057) (QUOTE (-576))))) (-12 (|HasCategory| |#4| (QUOTE (-862))) (|HasCategory| |#4| (LIST (QUOTE -1057) (QUOTE (-576))))) (|HasCategory| |#4| (QUOTE (-1068))) (-12 (|HasCategory| |#4| (QUOTE (-1119))) (|HasCategory| |#4| (LIST (QUOTE -1057) (QUOTE (-576)))))) (-2781 (-12 (|HasCategory| |#4| (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasCategory| |#4| (LIST (QUOTE -1057) (QUOTE (-576))))) (-12 (|HasCategory| |#4| (QUOTE (-21))) (|HasCategory| |#4| (LIST (QUOTE -1057) (QUOTE (-576))))) (-12 (|HasCategory| |#4| (QUOTE (-174))) (|HasCategory| |#4| (LIST (QUOTE -1057) (QUOTE (-576))))) (-12 (|HasCategory| |#4| (QUOTE (-238))) (|HasCategory| |#4| (LIST (QUOTE -1057) (QUOTE (-576))))) (-12 (|HasCategory| |#4| (QUOTE (-374))) (|HasCategory| |#4| (LIST (QUOTE -1057) (QUOTE (-576))))) (-12 (|HasCategory| |#4| (QUOTE (-379))) (|HasCategory| |#4| (LIST (QUOTE -1057) (QUOTE (-576))))) (-12 (|HasCategory| |#4| (QUOTE (-738))) (|HasCategory| |#4| (LIST (QUOTE -1057) (QUOTE (-576))))) (-12 (|HasCategory| |#4| (QUOTE (-805))) (|HasCategory| |#4| (LIST (QUOTE -1057) (QUOTE (-576))))) (-12 (|HasCategory| |#4| (QUOTE (-862))) (|HasCategory| |#4| (LIST (QUOTE -1057) (QUOTE (-576))))) (-12 (|HasCategory| |#4| (QUOTE (-1068))) (|HasCategory| |#4| (LIST (QUOTE -1057) (QUOTE (-576))))) (-12 (|HasCategory| |#4| (QUOTE (-1119))) (|HasCategory| |#4| (LIST (QUOTE -1057) (QUOTE (-576)))))) (|HasCategory| (-576) (QUOTE (-862))) (-12 (|HasCategory| |#4| (QUOTE (-1068))) (|HasCategory| |#4| (LIST (QUOTE -651) (QUOTE (-576))))) (-2781 (-12 (|HasCategory| |#4| (QUOTE (-1068))) (|HasCategory| |#4| (LIST (QUOTE -915) (QUOTE (-1195))))) (-12 (|HasCategory| |#4| (QUOTE (-1068))) (|HasCategory| |#4| (LIST (QUOTE -917) (QUOTE (-1195)))))) (-2781 (-12 (|HasCategory| |#4| (QUOTE (-238))) (|HasCategory| |#4| (QUOTE (-1068)))) (-12 (|HasCategory| |#4| (QUOTE (-237))) (|HasCategory| |#4| (QUOTE (-1068))))) (-12 (|HasCategory| |#4| (QUOTE (-1119))) (|HasCategory| |#4| (LIST (QUOTE -1057) (QUOTE (-576))))) (-2781 (|HasCategory| |#4| (QUOTE (-1068))) (-12 (|HasCategory| |#4| (QUOTE (-1119))) (|HasCategory| |#4| (LIST (QUOTE -1057) (QUOTE (-576)))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1057) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| |#4| (QUOTE (-1119)))) (-2781 (|HasAttribute| |#4| (QUOTE -4459)) (-12 (|HasCategory| |#4| (QUOTE (-238))) (|HasCategory| |#4| (QUOTE (-1068)))) (-12 (|HasCategory| |#4| (QUOTE (-1068))) (|HasCategory| |#4| (LIST (QUOTE -915) (QUOTE (-1195)))))) (-12 (|HasCategory| |#4| (QUOTE (-237))) (|HasCategory| |#4| (QUOTE (-1068)))) (-12 (|HasCategory| |#4| (QUOTE (-1068))) (|HasCategory| |#4| (LIST (QUOTE -917) (QUOTE (-1195))))) (|HasCategory| |#4| (QUOTE (-862))) (|HasCategory| |#4| (QUOTE (-174))) (|HasCategory| |#4| (QUOTE (-21))) (|HasCategory| |#4| (QUOTE (-23))) (|HasCategory| |#4| (QUOTE (-132))) (|HasCategory| |#4| (QUOTE (-25))) (|HasCategory| |#4| (LIST (QUOTE -625) (QUOTE (-874)))) (|HasCategory| |#4| (QUOTE (-102))) (-12 (|HasCategory| |#4| (QUOTE (-1119))) (|HasCategory| |#4| (LIST (QUOTE -319) (|devaluate| |#4|))))) 
 (-258 |n| R S) 
 ((|constructor| (NIL "This constructor provides a direct product of \\spad{R}-modules with an \\spad{R}-module view."))) 
-((-4459 -2781 (-2696 (|has| |#3| (-1068)) (|has| |#3| (-238))) (|has| |#3| (-6 -4459)) (-2696 (|has| |#3| (-1068)) (|has| |#3| (-915 (-1195))))) (-4456 |has| |#3| (-1068)) (-4457 |has| |#3| (-1068)) (-4462 . T)) 
+((-4459 -2781 (-2697 (|has| |#3| (-1068)) (|has| |#3| (-238))) (|has| |#3| (-6 -4459)) (-2697 (|has| |#3| (-1068)) (|has| |#3| (-915 (-1195))))) (-4456 |has| |#3| (-1068)) (-4457 |has| |#3| (-1068)) (-4462 . T)) 
 ((-2781 (-12 (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (LIST (QUOTE -319) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (LIST (QUOTE -319) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-238))) (|HasCategory| |#3| (LIST (QUOTE -319) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-374))) (|HasCategory| |#3| (LIST (QUOTE -319) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-379))) (|HasCategory| |#3| (LIST (QUOTE -319) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-738))) (|HasCategory| |#3| (LIST (QUOTE -319) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-805))) (|HasCategory| |#3| (LIST (QUOTE -319) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-862))) (|HasCategory| |#3| (LIST (QUOTE -319) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1068))) (|HasCategory| |#3| (LIST (QUOTE -319) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1119))) (|HasCategory| |#3| (LIST (QUOTE -319) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -319) (|devaluate| |#3|))) (|HasCategory| |#3| (LIST (QUOTE -915) (QUOTE (-1195)))))) (|HasCategory| |#3| (QUOTE (-374))) (-2781 (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (QUOTE (-374))) (|HasCategory| |#3| (QUOTE (-1068)))) (-2781 (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (QUOTE (-374)))) (|HasCategory| |#3| (QUOTE (-1068))) (|HasCategory| |#3| (QUOTE (-738))) (|HasCategory| |#3| (QUOTE (-805))) (-2781 (|HasCategory| |#3| (QUOTE (-805))) (|HasCategory| |#3| (QUOTE (-862)))) (|HasCategory| |#3| (QUOTE (-379))) (-2781 (-12 (|HasCategory| |#3| (LIST (QUOTE -651) (QUOTE (-576)))) (|HasCategory| |#3| (LIST (QUOTE -915) (QUOTE (-1195))))) (-12 (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (LIST (QUOTE -651) (QUOTE (-576))))) (-12 (|HasCategory| |#3| (QUOTE (-238))) (|HasCategory| |#3| (LIST (QUOTE -651) (QUOTE (-576))))) (-12 (|HasCategory| |#3| (QUOTE (-374))) (|HasCategory| |#3| (LIST (QUOTE -651) (QUOTE (-576))))) (-12 (|HasCategory| |#3| (QUOTE (-1068))) (|HasCategory| |#3| (LIST (QUOTE -651) (QUOTE (-576)))))) (|HasCategory| |#3| (LIST (QUOTE -915) (QUOTE (-1195)))) (-2781 (|HasCategory| |#3| (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasCategory| |#3| (QUOTE (-238))) (|HasCategory| |#3| (QUOTE (-1068)))) (|HasCategory| |#3| (QUOTE (-238))) (-2781 (|HasCategory| |#3| (QUOTE (-238))) (-12 (|HasCategory| |#3| (QUOTE (-237))) (|HasCategory| |#3| (QUOTE (-1068))))) (-2781 (|HasCategory| |#3| (LIST (QUOTE -915) (QUOTE (-1195)))) (-12 (|HasCategory| |#3| (QUOTE (-1068))) (|HasCategory| |#3| (LIST (QUOTE -917) (QUOTE (-1195)))))) (|HasCategory| |#3| (QUOTE (-1119))) (-2781 (-12 (|HasCategory| |#3| (LIST (QUOTE -1057) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| |#3| (LIST (QUOTE -915) (QUOTE (-1195))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1057) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| |#3| (QUOTE (-21)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1057) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| |#3| (QUOTE (-174)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1057) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| |#3| (QUOTE (-238)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1057) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| |#3| (QUOTE (-374)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1057) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| |#3| (QUOTE (-379)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1057) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| |#3| (QUOTE (-738)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1057) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| |#3| (QUOTE (-805)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1057) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| |#3| (QUOTE (-862)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1057) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| |#3| (QUOTE (-1068)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1057) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| |#3| (QUOTE (-1119))))) (-2781 (-12 (|HasCategory| |#3| (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasCategory| |#3| (LIST (QUOTE -1057) (QUOTE (-576))))) (-12 (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (LIST (QUOTE -1057) (QUOTE (-576))))) (-12 (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (LIST (QUOTE -1057) (QUOTE (-576))))) (-12 (|HasCategory| |#3| (QUOTE (-238))) (|HasCategory| |#3| (LIST (QUOTE -1057) (QUOTE (-576))))) (-12 (|HasCategory| |#3| (QUOTE (-374))) (|HasCategory| |#3| (LIST (QUOTE -1057) (QUOTE (-576))))) (-12 (|HasCategory| |#3| (QUOTE (-379))) (|HasCategory| |#3| (LIST (QUOTE -1057) (QUOTE (-576))))) (-12 (|HasCategory| |#3| (QUOTE (-738))) (|HasCategory| |#3| (LIST (QUOTE -1057) (QUOTE (-576))))) (-12 (|HasCategory| |#3| (QUOTE (-805))) (|HasCategory| |#3| (LIST (QUOTE -1057) (QUOTE (-576))))) (-12 (|HasCategory| |#3| (QUOTE (-862))) (|HasCategory| |#3| (LIST (QUOTE -1057) (QUOTE (-576))))) (|HasCategory| |#3| (QUOTE (-1068))) (-12 (|HasCategory| |#3| (QUOTE (-1119))) (|HasCategory| |#3| (LIST (QUOTE -1057) (QUOTE (-576)))))) (-2781 (-12 (|HasCategory| |#3| (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasCategory| |#3| (LIST (QUOTE -1057) (QUOTE (-576))))) (-12 (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (LIST (QUOTE -1057) (QUOTE (-576))))) (-12 (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (LIST (QUOTE -1057) (QUOTE (-576))))) (-12 (|HasCategory| |#3| (QUOTE (-238))) (|HasCategory| |#3| (LIST (QUOTE -1057) (QUOTE (-576))))) (-12 (|HasCategory| |#3| (QUOTE (-374))) (|HasCategory| |#3| (LIST (QUOTE -1057) (QUOTE (-576))))) (-12 (|HasCategory| |#3| (QUOTE (-379))) (|HasCategory| |#3| (LIST (QUOTE -1057) (QUOTE (-576))))) (-12 (|HasCategory| |#3| (QUOTE (-738))) (|HasCategory| |#3| (LIST (QUOTE -1057) (QUOTE (-576))))) (-12 (|HasCategory| |#3| (QUOTE (-805))) (|HasCategory| |#3| (LIST (QUOTE -1057) (QUOTE (-576))))) (-12 (|HasCategory| |#3| (QUOTE (-862))) (|HasCategory| |#3| (LIST (QUOTE -1057) (QUOTE (-576))))) (-12 (|HasCategory| |#3| (QUOTE (-1068))) (|HasCategory| |#3| (LIST (QUOTE -1057) (QUOTE (-576))))) (-12 (|HasCategory| |#3| (QUOTE (-1119))) (|HasCategory| |#3| (LIST (QUOTE -1057) (QUOTE (-576)))))) (|HasCategory| (-576) (QUOTE (-862))) (-12 (|HasCategory| |#3| (QUOTE (-1068))) (|HasCategory| |#3| (LIST (QUOTE -651) (QUOTE (-576))))) (-2781 (-12 (|HasCategory| |#3| (QUOTE (-1068))) (|HasCategory| |#3| (LIST (QUOTE -915) (QUOTE (-1195))))) (-12 (|HasCategory| |#3| (QUOTE (-1068))) (|HasCategory| |#3| (LIST (QUOTE -917) (QUOTE (-1195)))))) (-2781 (-12 (|HasCategory| |#3| (QUOTE (-238))) (|HasCategory| |#3| (QUOTE (-1068)))) (-12 (|HasCategory| |#3| (QUOTE (-237))) (|HasCategory| |#3| (QUOTE (-1068))))) (-12 (|HasCategory| |#3| (QUOTE (-1119))) (|HasCategory| |#3| (LIST (QUOTE -1057) (QUOTE (-576))))) (-2781 (|HasCategory| |#3| (QUOTE (-1068))) (-12 (|HasCategory| |#3| (QUOTE (-1119))) (|HasCategory| |#3| (LIST (QUOTE -1057) (QUOTE (-576)))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1057) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| |#3| (QUOTE (-1119)))) (-2781 (|HasAttribute| |#3| (QUOTE -4459)) (-12 (|HasCategory| |#3| (QUOTE (-238))) (|HasCategory| |#3| (QUOTE (-1068)))) (-12 (|HasCategory| |#3| (QUOTE (-1068))) (|HasCategory| |#3| (LIST (QUOTE -915) (QUOTE (-1195)))))) (-12 (|HasCategory| |#3| (QUOTE (-237))) (|HasCategory| |#3| (QUOTE (-1068)))) (-12 (|HasCategory| |#3| (QUOTE (-1068))) (|HasCategory| |#3| (LIST (QUOTE -917) (QUOTE (-1195))))) (|HasCategory| |#3| (QUOTE (-862))) (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (QUOTE (-23))) (|HasCategory| |#3| (QUOTE (-132))) (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (LIST (QUOTE -625) (QUOTE (-874)))) (|HasCategory| |#3| (QUOTE (-102))) (-12 (|HasCategory| |#3| (QUOTE (-1119))) (|HasCategory| |#3| (LIST (QUOTE -319) (|devaluate| |#3|))))) 
 (-259 A R S V E) 
 ((|constructor| (NIL "\\spadtype{DifferentialPolynomialCategory} is a category constructor specifying basic functions in an ordinary differential polynomial ring with a given ordered set of differential indeterminates. In addition,{} it implements defaults for the basic functions. The functions \\spadfun{order} and \\spadfun{weight} are extended from the set of derivatives of differential indeterminates to the set of differential polynomials. Other operations provided on differential polynomials are \\spadfun{leader},{} \\spadfun{initial},{} \\spadfun{separant},{} \\spadfun{differentialVariables},{} and \\spadfun{isobaric?}. Furthermore,{} if the ground ring is a differential ring,{} then evaluation (substitution of differential indeterminates by elements of the ground ring or by differential polynomials) is provided by \\spadfun{eval}. A convenient way of referencing derivatives is provided by the functions \\spadfun{makeVariable}. \\blankline To construct a domain using this constructor,{} one needs to provide a ground ring \\spad{R},{} an ordered set \\spad{S} of differential indeterminates,{} a ranking \\spad{V} on the set of derivatives of the differential indeterminates,{} and a set \\spad{E} of exponents in bijection with the set of differential monomials in the given differential indeterminates. \\blankline")) (|separant| (($ $) "\\spad{separant(p)} returns the partial derivative of the differential polynomial \\spad{p} with respect to its leader.")) (|initial| (($ $) "\\spad{initial(p)} returns the leading coefficient when the differential polynomial \\spad{p} is written as a univariate polynomial in its leader.")) (|leader| ((|#4| $) "\\spad{leader(p)} returns the derivative of the highest rank appearing in the differential polynomial \\spad{p} Note: an error occurs if \\spad{p} is in the ground ring.")) (|isobaric?| (((|Boolean|) $) "\\spad{isobaric?(p)} returns \\spad{true} if every differential monomial appearing in the differential polynomial \\spad{p} has same weight,{} and returns \\spad{false} otherwise.")) (|weight| (((|NonNegativeInteger|) $ |#3|) "\\spad{weight(p, s)} returns the maximum weight of all differential monomials appearing in the differential polynomial \\spad{p} when \\spad{p} is viewed as a differential polynomial in the differential indeterminate \\spad{s} alone.") (((|NonNegativeInteger|) $) "\\spad{weight(p)} returns the maximum weight of all differential monomials appearing in the differential polynomial \\spad{p}.")) (|weights| (((|List| (|NonNegativeInteger|)) $ |#3|) "\\spad{weights(p, s)} returns a list of weights of differential monomials appearing in the differential polynomial \\spad{p} when \\spad{p} is viewed as a differential polynomial in the differential indeterminate \\spad{s} alone.") (((|List| (|NonNegativeInteger|)) $) "\\spad{weights(p)} returns a list of weights of differential monomials appearing in differential polynomial \\spad{p}.")) (|degree| (((|NonNegativeInteger|) $ |#3|) "\\spad{degree(p, s)} returns the maximum degree of the differential polynomial \\spad{p} viewed as a differential polynomial in the differential indeterminate \\spad{s} alone.")) (|order| (((|NonNegativeInteger|) $) "\\spad{order(p)} returns the order of the differential polynomial \\spad{p},{} which is the maximum number of differentiations of a differential indeterminate,{} among all those appearing in \\spad{p}.") (((|NonNegativeInteger|) $ |#3|) "\\spad{order(p,s)} returns the order of the differential polynomial \\spad{p} in differential indeterminate \\spad{s}.")) (|differentialVariables| (((|List| |#3|) $) "\\spad{differentialVariables(p)} returns a list of differential indeterminates occurring in a differential polynomial \\spad{p}.")) (|makeVariable| (((|Mapping| $ (|NonNegativeInteger|)) $) "\\spad{makeVariable(p)} views \\spad{p} as an element of a differential ring,{} in such a way that the \\spad{n}-th derivative of \\spad{p} may be simply referenced as \\spad{z}.\\spad{n} where \\spad{z} \\spad{:=} makeVariable(\\spad{p}). Note: In the interpreter,{} \\spad{z} is given as an internal map,{} which may be ignored.") (((|Mapping| $ (|NonNegativeInteger|)) |#3|) "\\spad{makeVariable(s)} views \\spad{s} as a differential indeterminate,{} in such a way that the \\spad{n}-th derivative of \\spad{s} may be simply referenced as \\spad{z}.\\spad{n} where \\spad{z} :=makeVariable(\\spad{s}). Note: In the interpreter,{} \\spad{z} is given as an internal map,{} which may be ignored."))) 
@@ -1068,11 +1068,11 @@ NIL
 ((|constructor| (NIL "A domain used in the construction of the exterior algebra on a set \\spad{X} over a ring \\spad{R}. This domain represents the set of all ordered subsets of the set \\spad{X},{} assumed to be in correspondance with {1,{}2,{}3,{} ...}. The ordered subsets are themselves ordered lexicographically and are in bijective correspondance with an ordered basis of the exterior algebra. In this domain we are dealing strictly with the exponents of basis elements which can only be 0 or 1. \\blankline The multiplicative identity element of the exterior algebra corresponds to the empty subset of \\spad{X}. A coerce from List Integer to an ordered basis element is provided to allow the convenient input of expressions. Another exported function forgets the ordered structure and simply returns the list corresponding to an ordered subset.")) (|Nul| (($ (|NonNegativeInteger|)) "\\spad{Nul()} gives the basis element 1 for the algebra generated by \\spad{n} generators.")) (|exponents| (((|List| (|Integer|)) $) "\\spad{exponents(x)} converts a domain element into a list of zeros and ones corresponding to the exponents in the basis element that \\spad{x} represents.")) (|degree| (((|NonNegativeInteger|) $) "\\spad{degree(x)} gives the numbers of 1\\spad{'s} in \\spad{x},{} \\spadignore{i.e.} the number of non-zero exponents in the basis element that \\spad{x} represents.")) (|coerce| (($ (|List| (|Integer|))) "\\spad{coerce(l)} converts a list of 0\\spad{'s} and 1\\spad{'s} into a basis element,{} where 1 (respectively 0) designates that the variable of the corresponding index of \\spad{l} is (respectively,{} is not) present. Error: if an element of \\spad{l} is not 0 or 1."))) 
 NIL 
 NIL 
-(-285 R -1967) 
+(-285 R -1966) 
 ((|constructor| (NIL "Provides elementary functions over an integral domain.")) (|localReal?| (((|Boolean|) |#2|) "\\spad{localReal?(x)} should be local but conditional")) (|specialTrigs| (((|Union| |#2| "failed") |#2| (|List| (|Record| (|:| |func| |#2|) (|:| |pole| (|Boolean|))))) "\\spad{specialTrigs(x,l)} should be local but conditional")) (|iiacsch| ((|#2| |#2|) "\\spad{iiacsch(x)} should be local but conditional")) (|iiasech| ((|#2| |#2|) "\\spad{iiasech(x)} should be local but conditional")) (|iiacoth| ((|#2| |#2|) "\\spad{iiacoth(x)} should be local but conditional")) (|iiatanh| ((|#2| |#2|) "\\spad{iiatanh(x)} should be local but conditional")) (|iiacosh| ((|#2| |#2|) "\\spad{iiacosh(x)} should be local but conditional")) (|iiasinh| ((|#2| |#2|) "\\spad{iiasinh(x)} should be local but conditional")) (|iicsch| ((|#2| |#2|) "\\spad{iicsch(x)} should be local but conditional")) (|iisech| ((|#2| |#2|) "\\spad{iisech(x)} should be local but conditional")) (|iicoth| ((|#2| |#2|) "\\spad{iicoth(x)} should be local but conditional")) (|iitanh| ((|#2| |#2|) "\\spad{iitanh(x)} should be local but conditional")) (|iicosh| ((|#2| |#2|) "\\spad{iicosh(x)} should be local but conditional")) (|iisinh| ((|#2| |#2|) "\\spad{iisinh(x)} should be local but conditional")) (|iiacsc| ((|#2| |#2|) "\\spad{iiacsc(x)} should be local but conditional")) (|iiasec| ((|#2| |#2|) "\\spad{iiasec(x)} should be local but conditional")) (|iiacot| ((|#2| |#2|) "\\spad{iiacot(x)} should be local but conditional")) (|iiatan| ((|#2| |#2|) "\\spad{iiatan(x)} should be local but conditional")) (|iiacos| ((|#2| |#2|) "\\spad{iiacos(x)} should be local but conditional")) (|iiasin| ((|#2| |#2|) "\\spad{iiasin(x)} should be local but conditional")) (|iicsc| ((|#2| |#2|) "\\spad{iicsc(x)} should be local but conditional")) (|iisec| ((|#2| |#2|) "\\spad{iisec(x)} should be local but conditional")) (|iicot| ((|#2| |#2|) "\\spad{iicot(x)} should be local but conditional")) (|iitan| ((|#2| |#2|) "\\spad{iitan(x)} should be local but conditional")) (|iicos| ((|#2| |#2|) "\\spad{iicos(x)} should be local but conditional")) (|iisin| ((|#2| |#2|) "\\spad{iisin(x)} should be local but conditional")) (|iilog| ((|#2| |#2|) "\\spad{iilog(x)} should be local but conditional")) (|iiexp| ((|#2| |#2|) "\\spad{iiexp(x)} should be local but conditional")) (|iisqrt3| ((|#2|) "\\spad{iisqrt3()} should be local but conditional")) (|iisqrt2| ((|#2|) "\\spad{iisqrt2()} should be local but conditional")) (|operator| (((|BasicOperator|) (|BasicOperator|)) "\\spad{operator(p)} returns an elementary operator with the same symbol as \\spad{p}")) (|belong?| (((|Boolean|) (|BasicOperator|)) "\\spad{belong?(p)} returns \\spad{true} if operator \\spad{p} is elementary")) (|pi| ((|#2|) "\\spad{pi()} returns the \\spad{pi} operator")) (|acsch| ((|#2| |#2|) "\\spad{acsch(x)} applies the inverse hyperbolic cosecant operator to \\spad{x}")) (|asech| ((|#2| |#2|) "\\spad{asech(x)} applies the inverse hyperbolic secant operator to \\spad{x}")) (|acoth| ((|#2| |#2|) "\\spad{acoth(x)} applies the inverse hyperbolic cotangent operator to \\spad{x}")) (|atanh| ((|#2| |#2|) "\\spad{atanh(x)} applies the inverse hyperbolic tangent operator to \\spad{x}")) (|acosh| ((|#2| |#2|) "\\spad{acosh(x)} applies the inverse hyperbolic cosine operator to \\spad{x}")) (|asinh| ((|#2| |#2|) "\\spad{asinh(x)} applies the inverse hyperbolic sine operator to \\spad{x}")) (|csch| ((|#2| |#2|) "\\spad{csch(x)} applies the hyperbolic cosecant operator to \\spad{x}")) (|sech| ((|#2| |#2|) "\\spad{sech(x)} applies the hyperbolic secant operator to \\spad{x}")) (|coth| ((|#2| |#2|) "\\spad{coth(x)} applies the hyperbolic cotangent operator to \\spad{x}")) (|tanh| ((|#2| |#2|) "\\spad{tanh(x)} applies the hyperbolic tangent operator to \\spad{x}")) (|cosh| ((|#2| |#2|) "\\spad{cosh(x)} applies the hyperbolic cosine operator to \\spad{x}")) (|sinh| ((|#2| |#2|) "\\spad{sinh(x)} applies the hyperbolic sine operator to \\spad{x}")) (|acsc| ((|#2| |#2|) "\\spad{acsc(x)} applies the inverse cosecant operator to \\spad{x}")) (|asec| ((|#2| |#2|) "\\spad{asec(x)} applies the inverse secant operator to \\spad{x}")) (|acot| ((|#2| |#2|) "\\spad{acot(x)} applies the inverse cotangent operator to \\spad{x}")) (|atan| ((|#2| |#2|) "\\spad{atan(x)} applies the inverse tangent operator to \\spad{x}")) (|acos| ((|#2| |#2|) "\\spad{acos(x)} applies the inverse cosine operator to \\spad{x}")) (|asin| ((|#2| |#2|) "\\spad{asin(x)} applies the inverse sine operator to \\spad{x}")) (|csc| ((|#2| |#2|) "\\spad{csc(x)} applies the cosecant operator to \\spad{x}")) (|sec| ((|#2| |#2|) "\\spad{sec(x)} applies the secant operator to \\spad{x}")) (|cot| ((|#2| |#2|) "\\spad{cot(x)} applies the cotangent operator to \\spad{x}")) (|tan| ((|#2| |#2|) "\\spad{tan(x)} applies the tangent operator to \\spad{x}")) (|cos| ((|#2| |#2|) "\\spad{cos(x)} applies the cosine operator to \\spad{x}")) (|sin| ((|#2| |#2|) "\\spad{sin(x)} applies the sine operator to \\spad{x}")) (|log| ((|#2| |#2|) "\\spad{log(x)} applies the logarithm operator to \\spad{x}")) (|exp| ((|#2| |#2|) "\\spad{exp(x)} applies the exponential operator to \\spad{x}"))) 
 NIL 
 NIL 
-(-286 R -1967) 
+(-286 R -1966) 
 ((|constructor| (NIL "ElementaryFunctionStructurePackage provides functions to test the algebraic independence of various elementary functions,{} using the Risch structure theorem (real and complex versions). It also provides transformations on elementary functions which are not considered simplifications.")) (|tanQ| ((|#2| (|Fraction| (|Integer|)) |#2|) "\\spad{tanQ(q,a)} is a local function with a conditional implementation.")) (|rootNormalize| ((|#2| |#2| (|Kernel| |#2|)) "\\spad{rootNormalize(f, k)} returns \\spad{f} rewriting either \\spad{k} which must be an \\spad{n}th-root in terms of radicals already in \\spad{f},{} or some radicals in \\spad{f} in terms of \\spad{k}.")) (|validExponential| (((|Union| |#2| "failed") (|List| (|Kernel| |#2|)) |#2| (|Symbol|)) "\\spad{validExponential([k1,...,kn],f,x)} returns \\spad{g} if \\spad{exp(f)=g} and \\spad{g} involves only \\spad{k1...kn},{} and \"failed\" otherwise.")) (|realElementary| ((|#2| |#2| (|Symbol|)) "\\spad{realElementary(f,x)} rewrites the kernels of \\spad{f} involving \\spad{x} in terms of the 4 fundamental real transcendental elementary functions: \\spad{log, exp, tan, atan}.") ((|#2| |#2|) "\\spad{realElementary(f)} rewrites \\spad{f} in terms of the 4 fundamental real transcendental elementary functions: \\spad{log, exp, tan, atan}.")) (|rischNormalize| (((|Record| (|:| |func| |#2|) (|:| |kers| (|List| (|Kernel| |#2|))) (|:| |vals| (|List| |#2|))) |#2| (|Symbol|)) "\\spad{rischNormalize(f, x)} returns \\spad{[g, [k1,...,kn], [h1,...,hn]]} such that \\spad{g = normalize(f, x)} and each \\spad{ki} was rewritten as \\spad{hi} during the normalization.")) (|normalize| ((|#2| |#2| (|Symbol|)) "\\spad{normalize(f, x)} rewrites \\spad{f} using the least possible number of real algebraically independent kernels involving \\spad{x}.") ((|#2| |#2|) "\\spad{normalize(f)} rewrites \\spad{f} using the least possible number of real algebraically independent kernels."))) 
 NIL 
 NIL 
@@ -1124,7 +1124,7 @@ NIL
 ((|constructor| (NIL "An eltable aggregate is one which can be viewed as a function. For example,{} the list \\axiom{[1,{}7,{}4]} can applied to 0,{}1,{} and 2 respectively will return the integers 1,{}7,{} and 4; thus this list may be viewed as mapping 0 to 1,{} 1 to 7 and 2 to 4. In general,{} an aggregate can map members of a domain {\\em Dom} to an image domain {\\em Im}.")) (|qsetelt!| ((|#2| $ |#1| |#2|) "\\spad{qsetelt!(u,x,y)} sets the image of \\axiom{\\spad{x}} to be \\axiom{\\spad{y}} under \\axiom{\\spad{u}},{} without checking that \\axiom{\\spad{x}} is in the domain of \\axiom{\\spad{u}}. If such a check is required use the function \\axiom{setelt}.")) (|setelt| ((|#2| $ |#1| |#2|) "\\spad{setelt(u,x,y)} sets the image of \\spad{x} to be \\spad{y} under \\spad{u},{} assuming \\spad{x} is in the domain of \\spad{u}. Error: if \\spad{x} is not in the domain of \\spad{u}.")) (|qelt| ((|#2| $ |#1|) "\\spad{qelt(u, x)} applies \\axiom{\\spad{u}} to \\axiom{\\spad{x}} without checking whether \\axiom{\\spad{x}} is in the domain of \\axiom{\\spad{u}}. If \\axiom{\\spad{x}} is not in the domain of \\axiom{\\spad{u}} a memory-access violation may occur. If a check on whether \\axiom{\\spad{x}} is in the domain of \\axiom{\\spad{u}} is required,{} use the function \\axiom{elt}.")) (|elt| ((|#2| $ |#1| |#2|) "\\spad{elt(u, x, y)} applies \\spad{u} to \\spad{x} if \\spad{x} is in the domain of \\spad{u},{} and returns \\spad{y} otherwise. For example,{} if \\spad{u} is a polynomial in \\axiom{\\spad{x}} over the rationals,{} \\axiom{elt(\\spad{u},{}\\spad{n},{}0)} may define the coefficient of \\axiom{\\spad{x}} to the power \\spad{n},{} returning 0 when \\spad{n} is out of range."))) 
 NIL 
 NIL 
-(-299 S R |Mod| -2679 -4168 |exactQuo|) 
+(-299 S R |Mod| -3046 -1512 |exactQuo|) 
 ((|constructor| (NIL "These domains are used for the factorization and gcds of univariate polynomials over the integers in order to work modulo different primes. See \\spadtype{ModularRing},{} \\spadtype{ModularField}")) (|inv| (($ $) "\\spad{inv(x)} \\undocumented")) (|recip| (((|Union| $ "failed") $) "\\spad{recip(x)} \\undocumented")) (|exQuo| (((|Union| $ "failed") $ $) "\\spad{exQuo(x,y)} \\undocumented")) (|reduce| (($ |#2| |#3|) "\\spad{reduce(r,m)} \\undocumented")) (|coerce| ((|#2| $) "\\spad{coerce(x)} \\undocumented")) (|modulus| ((|#3| $) "\\spad{modulus(x)} \\undocumented"))) 
 ((-4455 . T) ((-4464 "*") . T) (-4456 . T) (-4457 . T) (-4459 . T)) 
 NIL 
@@ -1156,11 +1156,11 @@ NIL
 ((|constructor| (NIL "ErrorFunctions implements error functions callable from the system interpreter. Typically,{} these functions would be called in user functions. The simple forms of the functions take one argument which is either a string (an error message) or a list of strings which all together make up a message. The list can contain formatting codes (see below). The more sophisticated versions takes two arguments where the first argument is the name of the function from which the error was invoked and the second argument is either a string or a list of strings,{} as above. When you use the one argument version in an interpreter function,{} the system will automatically insert the name of the function as the new first argument. Thus in the user interpreter function \\indented{2}{\\spad{f x == if x < 0 then error \"negative argument\" else x}} the call to error will actually be of the form \\indented{2}{\\spad{error(\"f\",\"negative argument\")}} because the interpreter will have created a new first argument. \\blankline Formatting codes: error messages may contain the following formatting codes (they should either start or end a string or else have blanks around them): \\indented{3}{\\spad{\\%l}\\space{6}start a new line} \\indented{3}{\\spad{\\%b}\\space{6}start printing in a bold font (where available)} \\indented{3}{\\spad{\\%d}\\space{6}stop\\space{2}printing in a bold font (where available)} \\indented{3}{\\spad{ \\%ceon}\\space{2}start centering message lines} \\indented{3}{\\spad{\\%ceoff}\\space{2}stop\\space{2}centering message lines} \\indented{3}{\\spad{\\%rjon}\\space{3}start displaying lines \"ragged left\"} \\indented{3}{\\spad{\\%rjoff}\\space{2}stop\\space{2}displaying lines \"ragged left\"} \\indented{3}{\\spad{\\%i}\\space{6}indent\\space{3}following lines 3 additional spaces} \\indented{3}{\\spad{\\%u}\\space{6}unindent following lines 3 additional spaces} \\indented{3}{\\spad{\\%xN}\\space{5}insert \\spad{N} blanks (eg,{} \\spad{\\%x10} inserts 10 blanks)} \\blankline")) (|error| (((|Exit|) (|String|) (|List| (|String|))) "\\spad{error(nam,lmsg)} displays error messages \\spad{lmsg} preceded by a message containing the name \\spad{nam} of the function in which the error is contained.") (((|Exit|) (|String|) (|String|)) "\\spad{error(nam,msg)} displays error message \\spad{msg} preceded by a message containing the name \\spad{nam} of the function in which the error is contained.") (((|Exit|) (|List| (|String|))) "\\spad{error(lmsg)} displays error message \\spad{lmsg} and terminates.") (((|Exit|) (|String|)) "\\spad{error(msg)} displays error message \\spad{msg} and terminates."))) 
 NIL 
 NIL 
-(-307 -1967 S) 
+(-307 -1966 S) 
 ((|constructor| (NIL "This package allows a map from any expression space into any object to be lifted to a kernel over the expression set,{} using a given property of the operator of the kernel.")) (|map| ((|#2| (|Mapping| |#2| |#1|) (|String|) (|Kernel| |#1|)) "\\spad{map(f, p, k)} uses the property \\spad{p} of the operator of \\spad{k},{} in order to lift \\spad{f} and apply it to \\spad{k}."))) 
 NIL 
 NIL 
-(-308 E -1967) 
+(-308 E -1966) 
 ((|constructor| (NIL "This package allows a mapping \\spad{E} \\spad{->} \\spad{F} to be lifted to a kernel over \\spad{E}; This lifting can fail if the operator of the kernel cannot be applied in \\spad{F}; Do not use this package with \\spad{E} = \\spad{F},{} since this may drop some properties of the operators.")) (|map| ((|#2| (|Mapping| |#2| |#1|) (|Kernel| |#1|)) "\\spad{map(f, k)} returns \\spad{g = op(f(a1),...,f(an))} where \\spad{k = op(a1,...,an)}."))) 
 NIL 
 NIL 
@@ -1208,7 +1208,7 @@ NIL
 ((|constructor| (NIL "This category provides \\spadfun{eval} operations. A domain may belong to this category if it is possible to make ``evaluation\\spad{''} substitutions.")) (|eval| (($ $ (|List| (|Equation| |#1|))) "\\spad{eval(f, [x1 = v1,...,xn = vn])} replaces \\spad{xi} by \\spad{vi} in \\spad{f}.") (($ $ (|Equation| |#1|)) "\\spad{eval(f,x = v)} replaces \\spad{x} by \\spad{v} in \\spad{f}."))) 
 NIL 
 NIL 
-(-320 -1967) 
+(-320 -1966) 
 ((|constructor| (NIL "This package is to be used in conjuction with \\indented{12}{the CycleIndicators package. It provides an evaluation} \\indented{12}{function for SymmetricPolynomials.}")) (|eval| ((|#1| (|Mapping| |#1| (|Integer|)) (|SymmetricPolynomial| (|Fraction| (|Integer|)))) "\\spad{eval(f,s)} evaluates the cycle index \\spad{s} by applying \\indented{1}{the function \\spad{f} to each integer in a monomial partition,{}} \\indented{1}{forms their product and sums the results over all monomials.}"))) 
 NIL 
 NIL 
@@ -1236,7 +1236,7 @@ NIL
 ((|constructor| (NIL "Expressions involving symbolic functions.")) (|squareFreePolynomial| (((|Factored| (|SparseUnivariatePolynomial| $)) (|SparseUnivariatePolynomial| $)) "\\spad{squareFreePolynomial(p)} \\undocumented{}")) (|factorPolynomial| (((|Factored| (|SparseUnivariatePolynomial| $)) (|SparseUnivariatePolynomial| $)) "\\spad{factorPolynomial(p)} \\undocumented{}")) (|simplifyPower| (($ $ (|Integer|)) "simplifyPower?(\\spad{f},{}\\spad{n}) \\undocumented{}")) (|number?| (((|Boolean|) $) "\\spad{number?(f)} tests if \\spad{f} is rational")) (|reduce| (($ $) "\\spad{reduce(f)} simplifies all the unreduced algebraic quantities present in \\spad{f} by applying their defining relations."))) 
 ((-4459 -2781 (-12 (|has| |#1| (-568)) (-2781 (|has| |#1| (-1068)) (|has| |#1| (-485)))) (|has| |#1| (-1068)) (|has| |#1| (-485))) (-4457 |has| |#1| (-174)) (-4456 |has| |#1| (-174)) ((-4464 "*") |has| |#1| (-568)) (-4455 |has| |#1| (-568)) (-4460 |has| |#1| (-568)) (-4454 |has| |#1| (-568))) 
 ((-2781 (|HasCategory| |#1| (LIST (QUOTE -1057) (LIST (QUOTE -419) (QUOTE (-576))))) (-12 (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (LIST (QUOTE -1057) (QUOTE (-576)))))) (|HasCategory| |#1| (QUOTE (-568))) (-2781 (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-1068)))) (|HasCategory| |#1| (QUOTE (-21))) (-2781 (|HasCategory| |#1| (LIST (QUOTE -1057) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| |#1| (QUOTE (-568)))) (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (-2781 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-1068)))) (|HasCategory| |#1| (QUOTE (-1068))) (-2781 (-12 (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (LIST (QUOTE -651) (QUOTE (-576))))) (-12 (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (LIST (QUOTE -651) (QUOTE (-576))))) (-12 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (LIST (QUOTE -651) (QUOTE (-576))))) (-12 (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (LIST (QUOTE -651) (QUOTE (-576))))) (-12 (|HasCategory| |#1| (QUOTE (-1068))) (|HasCategory| |#1| (LIST (QUOTE -651) (QUOTE (-576)))))) (-2781 (|HasCategory| |#1| (QUOTE (-485))) (|HasCategory| |#1| (QUOTE (-1131)))) (|HasCategory| |#1| (QUOTE (-485))) (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-548)))) (-2781 (|HasCategory| |#1| (QUOTE (-1068))) (|HasCategory| |#1| (LIST (QUOTE -1057) (QUOTE (-576))))) (|HasCategory| |#1| (LIST (QUOTE -1057) (QUOTE (-576)))) (|HasCategory| |#1| (LIST (QUOTE -899) (QUOTE (-390)))) (|HasCategory| |#1| (LIST (QUOTE -899) (QUOTE (-576)))) (|HasCategory| |#1| (LIST (QUOTE -626) (LIST (QUOTE -905) (QUOTE (-390))))) (|HasCategory| |#1| (LIST (QUOTE -626) (LIST (QUOTE -905) (QUOTE (-576))))) (-12 (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (LIST (QUOTE -1057) (QUOTE (-576))))) (-2781 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-1068)))) (-2781 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-1068)))) (-2781 (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-1068)))) (-12 (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-568)))) (-2781 (|HasCategory| |#1| (QUOTE (-485))) (|HasCategory| |#1| (QUOTE (-568)))) (-12 (|HasCategory| |#1| (QUOTE (-1068))) (|HasCategory| |#1| (LIST (QUOTE -651) (QUOTE (-576))))) (-2781 (|HasCategory| |#1| (QUOTE (-21))) (-12 (|HasCategory| |#1| (QUOTE (-1068))) (|HasCategory| |#1| (LIST (QUOTE -651) (QUOTE (-576)))))) (-2781 (|HasCategory| |#1| (QUOTE (-25))) (-12 (|HasCategory| |#1| (QUOTE (-1068))) (|HasCategory| |#1| (LIST (QUOTE -651) (QUOTE (-576))))) (|HasCategory| |#1| (QUOTE (-1131)))) (-2781 (|HasCategory| |#1| (QUOTE (-25))) (-12 (|HasCategory| |#1| (QUOTE (-1068))) (|HasCategory| |#1| (LIST (QUOTE -651) (QUOTE (-576)))))) (-2781 (|HasCategory| |#1| (QUOTE (-485))) (|HasCategory| |#1| (QUOTE (-1068)))) (-2781 (-12 (|HasCategory| |#1| (LIST (QUOTE -1057) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| |#1| (QUOTE (-568)))) (-12 (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (LIST (QUOTE -1057) (QUOTE (-576)))))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-1131))) (|HasCategory| |#1| (LIST (QUOTE -1057) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| $ (QUOTE (-1068))) (|HasCategory| $ (LIST (QUOTE -1057) (QUOTE (-576))))) 
-(-327 R -1967) 
+(-327 R -1966) 
 ((|constructor| (NIL "Taylor series solutions of explicit ODE\\spad{'s}.")) (|seriesSolve| (((|Any|) |#2| (|BasicOperator|) (|Equation| |#2|) (|List| |#2|)) "\\spad{seriesSolve(eq, y, x = a, [b0,...,bn])} is equivalent to \\spad{seriesSolve(eq = 0, y, x = a, [b0,...,b(n-1)])}.") (((|Any|) |#2| (|BasicOperator|) (|Equation| |#2|) (|Equation| |#2|)) "\\spad{seriesSolve(eq, y, x = a, y a = b)} is equivalent to \\spad{seriesSolve(eq=0, y, x=a, y a = b)}.") (((|Any|) |#2| (|BasicOperator|) (|Equation| |#2|) |#2|) "\\spad{seriesSolve(eq, y, x = a, b)} is equivalent to \\spad{seriesSolve(eq = 0, y, x = a, y a = b)}.") (((|Any|) (|Equation| |#2|) (|BasicOperator|) (|Equation| |#2|) |#2|) "\\spad{seriesSolve(eq,y, x=a, b)} is equivalent to \\spad{seriesSolve(eq, y, x=a, y a = b)}.") (((|Any|) (|List| |#2|) (|List| (|BasicOperator|)) (|Equation| |#2|) (|List| (|Equation| |#2|))) "\\spad{seriesSolve([eq1,...,eqn], [y1,...,yn], x = a,[y1 a = b1,..., yn a = bn])} is equivalent to \\spad{seriesSolve([eq1=0,...,eqn=0], [y1,...,yn], x = a, [y1 a = b1,..., yn a = bn])}.") (((|Any|) (|List| |#2|) (|List| (|BasicOperator|)) (|Equation| |#2|) (|List| |#2|)) "\\spad{seriesSolve([eq1,...,eqn], [y1,...,yn], x=a, [b1,...,bn])} is equivalent to \\spad{seriesSolve([eq1=0,...,eqn=0], [y1,...,yn], x=a, [b1,...,bn])}.") (((|Any|) (|List| (|Equation| |#2|)) (|List| (|BasicOperator|)) (|Equation| |#2|) (|List| |#2|)) "\\spad{seriesSolve([eq1,...,eqn], [y1,...,yn], x=a, [b1,...,bn])} is equivalent to \\spad{seriesSolve([eq1,...,eqn], [y1,...,yn], x = a, [y1 a = b1,..., yn a = bn])}.") (((|Any|) (|List| (|Equation| |#2|)) (|List| (|BasicOperator|)) (|Equation| |#2|) (|List| (|Equation| |#2|))) "\\spad{seriesSolve([eq1,...,eqn],[y1,...,yn],x = a,[y1 a = b1,...,yn a = bn])} returns a taylor series solution of \\spad{[eq1,...,eqn]} around \\spad{x = a} with initial conditions \\spad{yi(a) = bi}. Note: eqi must be of the form \\spad{fi(x, y1 x, y2 x,..., yn x) y1'(x) + gi(x, y1 x, y2 x,..., yn x) = h(x, y1 x, y2 x,..., yn x)}.") (((|Any|) (|Equation| |#2|) (|BasicOperator|) (|Equation| |#2|) (|List| |#2|)) "\\spad{seriesSolve(eq,y,x=a,[b0,...,b(n-1)])} returns a Taylor series solution of \\spad{eq} around \\spad{x = a} with initial conditions \\spad{y(a) = b0},{} \\spad{y'(a) = b1},{} \\spad{y''(a) = b2},{} ...,{}\\spad{y(n-1)(a) = b(n-1)} \\spad{eq} must be of the form \\spad{f(x, y x, y'(x),..., y(n-1)(x)) y(n)(x) + g(x,y x,y'(x),...,y(n-1)(x)) = h(x,y x, y'(x),..., y(n-1)(x))}.") (((|Any|) (|Equation| |#2|) (|BasicOperator|) (|Equation| |#2|) (|Equation| |#2|)) "\\spad{seriesSolve(eq,y,x=a, y a = b)} returns a Taylor series solution of \\spad{eq} around \\spad{x} = a with initial condition \\spad{y(a) = b}. Note: \\spad{eq} must be of the form \\spad{f(x, y x) y'(x) + g(x, y x) = h(x, y x)}."))) 
 NIL 
 NIL 
@@ -1247,7 +1247,7 @@ NIL
 (-329 FE |var| |cen|) 
 ((|constructor| (NIL "ExponentialOfUnivariatePuiseuxSeries is a domain used to represent essential singularities of functions. An object in this domain is a function of the form \\spad{exp(f(x))},{} where \\spad{f(x)} is a Puiseux series with no terms of non-negative degree. Objects are ordered according to order of singularity,{} with functions which tend more rapidly to zero or infinity considered to be larger. Thus,{} if \\spad{order(f(x)) < order(g(x))},{} \\spadignore{i.e.} the first non-zero term of \\spad{f(x)} has lower degree than the first non-zero term of \\spad{g(x)},{} then \\spad{exp(f(x)) > exp(g(x))}. If \\spad{order(f(x)) = order(g(x))},{} then the ordering is essentially random. This domain is used in computing limits involving functions with essential singularities.")) (|exponentialOrder| (((|Fraction| (|Integer|)) $) "\\spad{exponentialOrder(exp(c * x **(-n) + ...))} returns \\spad{-n}. exponentialOrder(0) returns \\spad{0}.")) (|exponent| (((|UnivariatePuiseuxSeries| |#1| |#2| |#3|) $) "\\spad{exponent(exp(f(x)))} returns \\spad{f(x)}")) (|exponential| (($ (|UnivariatePuiseuxSeries| |#1| |#2| |#3|)) "\\spad{exponential(f(x))} returns \\spad{exp(f(x))}. Note: the function does NOT check that \\spad{f(x)} has no non-negative terms."))) 
 (((-4464 "*") |has| |#1| (-174)) (-4455 |has| |#1| (-568)) (-4460 |has| |#1| (-374)) (-4454 |has| |#1| (-374)) (-4456 . T) (-4457 . T) (-4459 . T)) 
-((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-174))) (-2781 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-568)))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (-12 (|HasCategory| |#1| (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -419) (QUOTE (-576))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -419) (QUOTE (-576))) (|devaluate| |#1|)))) (|HasCategory| (-419 (-576)) (QUOTE (-1131))) (|HasCategory| |#1| (QUOTE (-374))) (-2781 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#1| (QUOTE (-568)))) (-2781 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#1| (QUOTE (-568)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -419) (QUOTE (-576)))))) (|HasSignature| |#1| (LIST (QUOTE -3581) (LIST (|devaluate| |#1|) (QUOTE (-1195)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -419) (QUOTE (-576)))))) (-2781 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-976))) (|HasCategory| |#1| (QUOTE (-1221))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasSignature| |#1| (LIST (QUOTE -3009) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1195))))) (|HasSignature| |#1| (LIST (QUOTE -1935) (LIST (LIST (QUOTE -656) (QUOTE (-1195))) (|devaluate| |#1|))))))) 
+((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-174))) (-2781 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-568)))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (-12 (|HasCategory| |#1| (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -419) (QUOTE (-576))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -419) (QUOTE (-576))) (|devaluate| |#1|)))) (|HasCategory| (-419 (-576)) (QUOTE (-1131))) (|HasCategory| |#1| (QUOTE (-374))) (-2781 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#1| (QUOTE (-568)))) (-2781 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#1| (QUOTE (-568)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -419) (QUOTE (-576)))))) (|HasSignature| |#1| (LIST (QUOTE -3581) (LIST (|devaluate| |#1|) (QUOTE (-1195)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -419) (QUOTE (-576)))))) (-2781 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-976))) (|HasCategory| |#1| (QUOTE (-1221))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasSignature| |#1| (LIST (QUOTE -4121) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1195))))) (|HasSignature| |#1| (LIST (QUOTE -1934) (LIST (LIST (QUOTE -656) (QUOTE (-1195))) (|devaluate| |#1|))))))) 
 (-330 M) 
 ((|constructor| (NIL "computes various functions on factored arguments.")) (|log| (((|List| (|Record| (|:| |coef| (|NonNegativeInteger|)) (|:| |logand| |#1|))) (|Factored| |#1|)) "\\spad{log(f)} returns \\spad{[(a1,b1),...,(am,bm)]} such that the logarithm of \\spad{f} is equal to \\spad{a1*log(b1) + ... + am*log(bm)}.")) (|nthRoot| (((|Record| (|:| |exponent| (|NonNegativeInteger|)) (|:| |coef| |#1|) (|:| |radicand| (|List| |#1|))) (|Factored| |#1|) (|NonNegativeInteger|)) "\\spad{nthRoot(f, n)} returns \\spad{(p, r, [r1,...,rm])} such that the \\spad{n}th-root of \\spad{f} is equal to \\spad{r * \\spad{p}th-root(r1 * ... * rm)},{} where \\spad{r1},{}...,{}\\spad{rm} are distinct factors of \\spad{f},{} each of which has an exponent smaller than \\spad{p} in \\spad{f}."))) 
 NIL 
@@ -1280,11 +1280,11 @@ NIL
 ((|constructor| (NIL "\\indented{1}{A FlexibleArray is the notion of an array intended to allow for growth} at the end only. Hence the following efficient operations \\indented{2}{\\spad{append(x,a)} meaning append item \\spad{x} at the end of the array \\spad{a}} \\indented{2}{\\spad{delete(a,n)} meaning delete the last item from the array \\spad{a}} Flexible arrays support the other operations inherited from \\spadtype{ExtensibleLinearAggregate}. However,{} these are not efficient. Flexible arrays combine the \\spad{O(1)} access time property of arrays with growing and shrinking at the end in \\spad{O(1)} (average) time. This is done by using an ordinary array which may have zero or more empty slots at the end. When the array becomes full it is copied into a new larger (50\\% larger) array. Conversely,{} when the array becomes less than 1/2 full,{} it is copied into a smaller array. Flexible arrays provide for an efficient implementation of many data structures in particular heaps,{} stacks and sets."))) 
 ((-4463 . T) (-4462 . T)) 
 ((-2781 (-12 (|HasCategory| |#1| (QUOTE (-862))) (|HasCategory| |#1| (LIST (QUOTE -319) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1119))) (|HasCategory| |#1| (LIST (QUOTE -319) (|devaluate| |#1|))))) (-2781 (-12 (|HasCategory| |#1| (QUOTE (-1119))) (|HasCategory| |#1| (LIST (QUOTE -319) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -625) (QUOTE (-874))))) (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-548)))) (-2781 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-862))) (|HasCategory| |#1| (QUOTE (-1119)))) (-2781 (|HasCategory| |#1| (QUOTE (-862))) (|HasCategory| |#1| (QUOTE (-1119)))) (|HasCategory| |#1| (QUOTE (-862))) (|HasCategory| (-576) (QUOTE (-862))) (|HasCategory| |#1| (QUOTE (-1119))) (|HasCategory| |#1| (LIST (QUOTE -625) (QUOTE (-874)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1119))) (|HasCategory| |#1| (LIST (QUOTE -319) (|devaluate| |#1|))))) 
-(-338 S -1967) 
+(-338 S -1966) 
 ((|constructor| (NIL "FiniteAlgebraicExtensionField {\\em F} is the category of fields which are finite algebraic extensions of the field {\\em F}. If {\\em F} is finite then any finite algebraic extension of {\\em F} is finite,{} too. Let {\\em K} be a finite algebraic extension of the finite field {\\em F}. The exponentiation of elements of {\\em K} defines a \\spad{Z}-module structure on the multiplicative group of {\\em K}. The additive group of {\\em K} becomes a module over the ring of polynomials over {\\em F} via the operation \\spadfun{linearAssociatedExp}(a:K,{}f:SparseUnivariatePolynomial \\spad{F}) which is linear over {\\em F},{} \\spadignore{i.e.} for elements {\\em a} from {\\em K},{} {\\em c,d} from {\\em F} and {\\em f,g} univariate polynomials over {\\em F} we have \\spadfun{linearAssociatedExp}(a,{}cf+dg) equals {\\em c} times \\spadfun{linearAssociatedExp}(a,{}\\spad{f}) plus {\\em d} times \\spadfun{linearAssociatedExp}(a,{}\\spad{g}). Therefore \\spadfun{linearAssociatedExp} is defined completely by its action on monomials from {\\em F[X]}: \\spadfun{linearAssociatedExp}(a,{}monomial(1,{}\\spad{k})\\spad{\\$}SUP(\\spad{F})) is defined to be \\spadfun{Frobenius}(a,{}\\spad{k}) which is {\\em a**(q**k)} where {\\em q=size()\\$F}. The operations order and discreteLog associated with the multiplicative exponentiation have additive analogues associated to the operation \\spadfun{linearAssociatedExp}. These are the functions \\spadfun{linearAssociatedOrder} and \\spadfun{linearAssociatedLog},{} respectively.")) (|linearAssociatedLog| (((|Union| (|SparseUnivariatePolynomial| |#2|) "failed") $ $) "\\spad{linearAssociatedLog(b,a)} returns a polynomial {\\em g},{} such that the \\spadfun{linearAssociatedExp}(\\spad{b},{}\\spad{g}) equals {\\em a}. If there is no such polynomial {\\em g},{} then \\spadfun{linearAssociatedLog} fails.") (((|SparseUnivariatePolynomial| |#2|) $) "\\spad{linearAssociatedLog(a)} returns a polynomial {\\em g},{} such that \\spadfun{linearAssociatedExp}(normalElement(),{}\\spad{g}) equals {\\em a}.")) (|linearAssociatedOrder| (((|SparseUnivariatePolynomial| |#2|) $) "\\spad{linearAssociatedOrder(a)} retruns the monic polynomial {\\em g} of least degree,{} such that \\spadfun{linearAssociatedExp}(a,{}\\spad{g}) is 0.")) (|linearAssociatedExp| (($ $ (|SparseUnivariatePolynomial| |#2|)) "\\spad{linearAssociatedExp(a,f)} is linear over {\\em F},{} \\spadignore{i.e.} for elements {\\em a} from {\\em \\$},{} {\\em c,d} form {\\em F} and {\\em f,g} univariate polynomials over {\\em F} we have \\spadfun{linearAssociatedExp}(a,{}cf+dg) equals {\\em c} times \\spadfun{linearAssociatedExp}(a,{}\\spad{f}) plus {\\em d} times \\spadfun{linearAssociatedExp}(a,{}\\spad{g}). Therefore \\spadfun{linearAssociatedExp} is defined completely by its action on monomials from {\\em F[X]}: \\spadfun{linearAssociatedExp}(a,{}monomial(1,{}\\spad{k})\\spad{\\$}SUP(\\spad{F})) is defined to be \\spadfun{Frobenius}(a,{}\\spad{k}) which is {\\em a**(q**k)},{} where {\\em q=size()\\$F}.")) (|generator| (($) "\\spad{generator()} returns a root of the defining polynomial. This element generates the field as an algebra over the ground field.")) (|normal?| (((|Boolean|) $) "\\spad{normal?(a)} tests whether the element \\spad{a} is normal over the ground field \\spad{F},{} \\spadignore{i.e.} \\spad{a**(q**i), 0 <= i <= extensionDegree()-1} is an \\spad{F}-basis,{} where \\spad{q = size()\\$F}. Implementation according to Lidl/Niederreiter: Theorem 2.39.")) (|normalElement| (($) "\\spad{normalElement()} returns a element,{} normal over the ground field \\spad{F},{} \\spadignore{i.e.} \\spad{a**(q**i), 0 <= i < extensionDegree()} is an \\spad{F}-basis,{} where \\spad{q = size()\\$F}. At the first call,{} the element is computed by \\spadfunFrom{createNormalElement}{FiniteAlgebraicExtensionField} then cached in a global variable. On subsequent calls,{} the element is retrieved by referencing the global variable.")) (|createNormalElement| (($) "\\spad{createNormalElement()} computes a normal element over the ground field \\spad{F},{} that is,{} \\spad{a**(q**i), 0 <= i < extensionDegree()} is an \\spad{F}-basis,{} where \\spad{q = size()\\$F}. Reference: Such an element exists Lidl/Niederreiter: Theorem 2.35.")) (|trace| (($ $ (|PositiveInteger|)) "\\spad{trace(a,d)} computes the trace of \\spad{a} with respect to the field of extension degree \\spad{d} over the ground field of size \\spad{q}. Error: if \\spad{d} does not divide the extension degree of \\spad{a}. Note: \\spad{trace(a,d) = reduce(+,[a**(q**(d*i)) for i in 0..n/d])}.") ((|#2| $) "\\spad{trace(a)} computes the trace of \\spad{a} with respect to the field considered as an algebra with 1 over the ground field \\spad{F}.")) (|norm| (($ $ (|PositiveInteger|)) "\\spad{norm(a,d)} computes the norm of \\spad{a} with respect to the field of extension degree \\spad{d} over the ground field of size. Error: if \\spad{d} does not divide the extension degree of \\spad{a}. Note: norm(a,{}\\spad{d}) = reduce(*,{}[a**(\\spad{q**}(d*i)) for \\spad{i} in 0..\\spad{n/d}])") ((|#2| $) "\\spad{norm(a)} computes the norm of \\spad{a} with respect to the field considered as an algebra with 1 over the ground field \\spad{F}.")) (|degree| (((|PositiveInteger|) $) "\\spad{degree(a)} returns the degree of the minimal polynomial of an element \\spad{a} over the ground field \\spad{F}.")) (|extensionDegree| (((|PositiveInteger|)) "\\spad{extensionDegree()} returns the degree of field extension.")) (|definingPolynomial| (((|SparseUnivariatePolynomial| |#2|)) "\\spad{definingPolynomial()} returns the polynomial used to define the field extension.")) (|minimalPolynomial| (((|SparseUnivariatePolynomial| $) $ (|PositiveInteger|)) "\\spad{minimalPolynomial(x,n)} computes the minimal polynomial of \\spad{x} over the field of extension degree \\spad{n} over the ground field \\spad{F}.") (((|SparseUnivariatePolynomial| |#2|) $) "\\spad{minimalPolynomial(a)} returns the minimal polynomial of an element \\spad{a} over the ground field \\spad{F}.")) (|represents| (($ (|Vector| |#2|)) "\\spad{represents([a1,..,an])} returns \\spad{a1*v1 + ... + an*vn},{} where \\spad{v1},{}...,{}\\spad{vn} are the elements of the fixed basis.")) (|coordinates| (((|Matrix| |#2|) (|Vector| $)) "\\spad{coordinates([v1,...,vm])} returns the coordinates of the \\spad{vi}\\spad{'s} with to the fixed basis. The coordinates of \\spad{vi} are contained in the \\spad{i}th row of the matrix returned by this function.") (((|Vector| |#2|) $) "\\spad{coordinates(a)} returns the coordinates of \\spad{a} with respect to the fixed \\spad{F}-vectorspace basis.")) (|basis| (((|Vector| $) (|PositiveInteger|)) "\\spad{basis(n)} returns a fixed basis of a subfield of \\spad{\\$} as \\spad{F}-vectorspace.") (((|Vector| $)) "\\spad{basis()} returns a fixed basis of \\spad{\\$} as \\spad{F}-vectorspace."))) 
 NIL 
 ((|HasCategory| |#2| (QUOTE (-379)))) 
-(-339 -1967) 
+(-339 -1966) 
 ((|constructor| (NIL "FiniteAlgebraicExtensionField {\\em F} is the category of fields which are finite algebraic extensions of the field {\\em F}. If {\\em F} is finite then any finite algebraic extension of {\\em F} is finite,{} too. Let {\\em K} be a finite algebraic extension of the finite field {\\em F}. The exponentiation of elements of {\\em K} defines a \\spad{Z}-module structure on the multiplicative group of {\\em K}. The additive group of {\\em K} becomes a module over the ring of polynomials over {\\em F} via the operation \\spadfun{linearAssociatedExp}(a:K,{}f:SparseUnivariatePolynomial \\spad{F}) which is linear over {\\em F},{} \\spadignore{i.e.} for elements {\\em a} from {\\em K},{} {\\em c,d} from {\\em F} and {\\em f,g} univariate polynomials over {\\em F} we have \\spadfun{linearAssociatedExp}(a,{}cf+dg) equals {\\em c} times \\spadfun{linearAssociatedExp}(a,{}\\spad{f}) plus {\\em d} times \\spadfun{linearAssociatedExp}(a,{}\\spad{g}). Therefore \\spadfun{linearAssociatedExp} is defined completely by its action on monomials from {\\em F[X]}: \\spadfun{linearAssociatedExp}(a,{}monomial(1,{}\\spad{k})\\spad{\\$}SUP(\\spad{F})) is defined to be \\spadfun{Frobenius}(a,{}\\spad{k}) which is {\\em a**(q**k)} where {\\em q=size()\\$F}. The operations order and discreteLog associated with the multiplicative exponentiation have additive analogues associated to the operation \\spadfun{linearAssociatedExp}. These are the functions \\spadfun{linearAssociatedOrder} and \\spadfun{linearAssociatedLog},{} respectively.")) (|linearAssociatedLog| (((|Union| (|SparseUnivariatePolynomial| |#1|) "failed") $ $) "\\spad{linearAssociatedLog(b,a)} returns a polynomial {\\em g},{} such that the \\spadfun{linearAssociatedExp}(\\spad{b},{}\\spad{g}) equals {\\em a}. If there is no such polynomial {\\em g},{} then \\spadfun{linearAssociatedLog} fails.") (((|SparseUnivariatePolynomial| |#1|) $) "\\spad{linearAssociatedLog(a)} returns a polynomial {\\em g},{} such that \\spadfun{linearAssociatedExp}(normalElement(),{}\\spad{g}) equals {\\em a}.")) (|linearAssociatedOrder| (((|SparseUnivariatePolynomial| |#1|) $) "\\spad{linearAssociatedOrder(a)} retruns the monic polynomial {\\em g} of least degree,{} such that \\spadfun{linearAssociatedExp}(a,{}\\spad{g}) is 0.")) (|linearAssociatedExp| (($ $ (|SparseUnivariatePolynomial| |#1|)) "\\spad{linearAssociatedExp(a,f)} is linear over {\\em F},{} \\spadignore{i.e.} for elements {\\em a} from {\\em \\$},{} {\\em c,d} form {\\em F} and {\\em f,g} univariate polynomials over {\\em F} we have \\spadfun{linearAssociatedExp}(a,{}cf+dg) equals {\\em c} times \\spadfun{linearAssociatedExp}(a,{}\\spad{f}) plus {\\em d} times \\spadfun{linearAssociatedExp}(a,{}\\spad{g}). Therefore \\spadfun{linearAssociatedExp} is defined completely by its action on monomials from {\\em F[X]}: \\spadfun{linearAssociatedExp}(a,{}monomial(1,{}\\spad{k})\\spad{\\$}SUP(\\spad{F})) is defined to be \\spadfun{Frobenius}(a,{}\\spad{k}) which is {\\em a**(q**k)},{} where {\\em q=size()\\$F}.")) (|generator| (($) "\\spad{generator()} returns a root of the defining polynomial. This element generates the field as an algebra over the ground field.")) (|normal?| (((|Boolean|) $) "\\spad{normal?(a)} tests whether the element \\spad{a} is normal over the ground field \\spad{F},{} \\spadignore{i.e.} \\spad{a**(q**i), 0 <= i <= extensionDegree()-1} is an \\spad{F}-basis,{} where \\spad{q = size()\\$F}. Implementation according to Lidl/Niederreiter: Theorem 2.39.")) (|normalElement| (($) "\\spad{normalElement()} returns a element,{} normal over the ground field \\spad{F},{} \\spadignore{i.e.} \\spad{a**(q**i), 0 <= i < extensionDegree()} is an \\spad{F}-basis,{} where \\spad{q = size()\\$F}. At the first call,{} the element is computed by \\spadfunFrom{createNormalElement}{FiniteAlgebraicExtensionField} then cached in a global variable. On subsequent calls,{} the element is retrieved by referencing the global variable.")) (|createNormalElement| (($) "\\spad{createNormalElement()} computes a normal element over the ground field \\spad{F},{} that is,{} \\spad{a**(q**i), 0 <= i < extensionDegree()} is an \\spad{F}-basis,{} where \\spad{q = size()\\$F}. Reference: Such an element exists Lidl/Niederreiter: Theorem 2.35.")) (|trace| (($ $ (|PositiveInteger|)) "\\spad{trace(a,d)} computes the trace of \\spad{a} with respect to the field of extension degree \\spad{d} over the ground field of size \\spad{q}. Error: if \\spad{d} does not divide the extension degree of \\spad{a}. Note: \\spad{trace(a,d) = reduce(+,[a**(q**(d*i)) for i in 0..n/d])}.") ((|#1| $) "\\spad{trace(a)} computes the trace of \\spad{a} with respect to the field considered as an algebra with 1 over the ground field \\spad{F}.")) (|norm| (($ $ (|PositiveInteger|)) "\\spad{norm(a,d)} computes the norm of \\spad{a} with respect to the field of extension degree \\spad{d} over the ground field of size. Error: if \\spad{d} does not divide the extension degree of \\spad{a}. Note: norm(a,{}\\spad{d}) = reduce(*,{}[a**(\\spad{q**}(d*i)) for \\spad{i} in 0..\\spad{n/d}])") ((|#1| $) "\\spad{norm(a)} computes the norm of \\spad{a} with respect to the field considered as an algebra with 1 over the ground field \\spad{F}.")) (|degree| (((|PositiveInteger|) $) "\\spad{degree(a)} returns the degree of the minimal polynomial of an element \\spad{a} over the ground field \\spad{F}.")) (|extensionDegree| (((|PositiveInteger|)) "\\spad{extensionDegree()} returns the degree of field extension.")) (|definingPolynomial| (((|SparseUnivariatePolynomial| |#1|)) "\\spad{definingPolynomial()} returns the polynomial used to define the field extension.")) (|minimalPolynomial| (((|SparseUnivariatePolynomial| $) $ (|PositiveInteger|)) "\\spad{minimalPolynomial(x,n)} computes the minimal polynomial of \\spad{x} over the field of extension degree \\spad{n} over the ground field \\spad{F}.") (((|SparseUnivariatePolynomial| |#1|) $) "\\spad{minimalPolynomial(a)} returns the minimal polynomial of an element \\spad{a} over the ground field \\spad{F}.")) (|represents| (($ (|Vector| |#1|)) "\\spad{represents([a1,..,an])} returns \\spad{a1*v1 + ... + an*vn},{} where \\spad{v1},{}...,{}\\spad{vn} are the elements of the fixed basis.")) (|coordinates| (((|Matrix| |#1|) (|Vector| $)) "\\spad{coordinates([v1,...,vm])} returns the coordinates of the \\spad{vi}\\spad{'s} with to the fixed basis. The coordinates of \\spad{vi} are contained in the \\spad{i}th row of the matrix returned by this function.") (((|Vector| |#1|) $) "\\spad{coordinates(a)} returns the coordinates of \\spad{a} with respect to the fixed \\spad{F}-vectorspace basis.")) (|basis| (((|Vector| $) (|PositiveInteger|)) "\\spad{basis(n)} returns a fixed basis of a subfield of \\spad{\\$} as \\spad{F}-vectorspace.") (((|Vector| $)) "\\spad{basis()} returns a fixed basis of \\spad{\\$} as \\spad{F}-vectorspace."))) 
 ((-4454 . T) (-4460 . T) (-4455 . T) ((-4464 "*") . T) (-4456 . T) (-4457 . T) (-4459 . T)) 
 NIL 
@@ -1308,15 +1308,15 @@ NIL
 ((|constructor| (NIL "\\indented{1}{Lift a map to finite divisors.} Author: Manuel Bronstein Date Created: 1988 Date Last Updated: 19 May 1993")) (|map| (((|FiniteDivisor| |#5| |#6| |#7| |#8|) (|Mapping| |#5| |#1|) (|FiniteDivisor| |#1| |#2| |#3| |#4|)) "\\spad{map(f,d)} \\undocumented{}"))) 
 NIL 
 NIL 
-(-345 S -1967 UP UPUP R) 
+(-345 S -1966 UP UPUP R) 
 ((|constructor| (NIL "This category describes finite rational divisors on a curve,{} that is finite formal sums SUM(\\spad{n} * \\spad{P}) where the \\spad{n}\\spad{'s} are integers and the \\spad{P}\\spad{'s} are finite rational points on the curve.")) (|generator| (((|Union| |#5| "failed") $) "\\spad{generator(d)} returns \\spad{f} if \\spad{(f) = d},{} \"failed\" if \\spad{d} is not principal.")) (|principal?| (((|Boolean|) $) "\\spad{principal?(D)} tests if the argument is the divisor of a function.")) (|reduce| (($ $) "\\spad{reduce(D)} converts \\spad{D} to some reduced form (the reduced forms can be differents in different implementations).")) (|decompose| (((|Record| (|:| |id| (|FractionalIdeal| |#3| (|Fraction| |#3|) |#4| |#5|)) (|:| |principalPart| |#5|)) $) "\\spad{decompose(d)} returns \\spad{[id, f]} where \\spad{d = (id) + div(f)}.")) (|divisor| (($ |#5| |#3| |#3| |#3| |#2|) "\\spad{divisor(h, d, d', g, r)} returns the sum of all the finite points where \\spad{h/d} has residue \\spad{r}. \\spad{h} must be integral. \\spad{d} must be squarefree. \\spad{d'} is some derivative of \\spad{d} (not necessarily dd/dx). \\spad{g = gcd(d,discriminant)} contains the ramified zeros of \\spad{d}") (($ |#2| |#2| (|Integer|)) "\\spad{divisor(a, b, n)} makes the divisor \\spad{nP} where \\spad{P:} \\spad{(x = a, y = b)}. \\spad{P} is allowed to be singular if \\spad{n} is a multiple of the rank.") (($ |#2| |#2|) "\\spad{divisor(a, b)} makes the divisor \\spad{P:} \\spad{(x = a, y = b)}. Error: if \\spad{P} is singular.") (($ |#5|) "\\spad{divisor(g)} returns the divisor of the function \\spad{g}.") (($ (|FractionalIdeal| |#3| (|Fraction| |#3|) |#4| |#5|)) "\\spad{divisor(I)} makes a divisor \\spad{D} from an ideal \\spad{I}.")) (|ideal| (((|FractionalIdeal| |#3| (|Fraction| |#3|) |#4| |#5|) $) "\\spad{ideal(D)} returns the ideal corresponding to a divisor \\spad{D}."))) 
 NIL 
 NIL 
-(-346 -1967 UP UPUP R) 
+(-346 -1966 UP UPUP R) 
 ((|constructor| (NIL "This category describes finite rational divisors on a curve,{} that is finite formal sums SUM(\\spad{n} * \\spad{P}) where the \\spad{n}\\spad{'s} are integers and the \\spad{P}\\spad{'s} are finite rational points on the curve.")) (|generator| (((|Union| |#4| "failed") $) "\\spad{generator(d)} returns \\spad{f} if \\spad{(f) = d},{} \"failed\" if \\spad{d} is not principal.")) (|principal?| (((|Boolean|) $) "\\spad{principal?(D)} tests if the argument is the divisor of a function.")) (|reduce| (($ $) "\\spad{reduce(D)} converts \\spad{D} to some reduced form (the reduced forms can be differents in different implementations).")) (|decompose| (((|Record| (|:| |id| (|FractionalIdeal| |#2| (|Fraction| |#2|) |#3| |#4|)) (|:| |principalPart| |#4|)) $) "\\spad{decompose(d)} returns \\spad{[id, f]} where \\spad{d = (id) + div(f)}.")) (|divisor| (($ |#4| |#2| |#2| |#2| |#1|) "\\spad{divisor(h, d, d', g, r)} returns the sum of all the finite points where \\spad{h/d} has residue \\spad{r}. \\spad{h} must be integral. \\spad{d} must be squarefree. \\spad{d'} is some derivative of \\spad{d} (not necessarily dd/dx). \\spad{g = gcd(d,discriminant)} contains the ramified zeros of \\spad{d}") (($ |#1| |#1| (|Integer|)) "\\spad{divisor(a, b, n)} makes the divisor \\spad{nP} where \\spad{P:} \\spad{(x = a, y = b)}. \\spad{P} is allowed to be singular if \\spad{n} is a multiple of the rank.") (($ |#1| |#1|) "\\spad{divisor(a, b)} makes the divisor \\spad{P:} \\spad{(x = a, y = b)}. Error: if \\spad{P} is singular.") (($ |#4|) "\\spad{divisor(g)} returns the divisor of the function \\spad{g}.") (($ (|FractionalIdeal| |#2| (|Fraction| |#2|) |#3| |#4|)) "\\spad{divisor(I)} makes a divisor \\spad{D} from an ideal \\spad{I}.")) (|ideal| (((|FractionalIdeal| |#2| (|Fraction| |#2|) |#3| |#4|) $) "\\spad{ideal(D)} returns the ideal corresponding to a divisor \\spad{D}."))) 
 NIL 
 NIL 
-(-347 -1967 UP UPUP R) 
+(-347 -1966 UP UPUP R) 
 ((|constructor| (NIL "This domains implements finite rational divisors on a curve,{} that is finite formal sums SUM(\\spad{n} * \\spad{P}) where the \\spad{n}\\spad{'s} are integers and the \\spad{P}\\spad{'s} are finite rational points on the curve.")) (|lSpaceBasis| (((|Vector| |#4|) $) "\\spad{lSpaceBasis(d)} returns a basis for \\spad{L(d) = {f | (f) >= -d}} as a module over \\spad{K[x]}.")) (|finiteBasis| (((|Vector| |#4|) $) "\\spad{finiteBasis(d)} returns a basis for \\spad{d} as a module over {\\em K[x]}."))) 
 NIL 
 NIL 
@@ -1336,11 +1336,11 @@ NIL
 ((|constructor| (NIL "Lifts a map from rings to function fields over them.")) (|map| ((|#8| (|Mapping| |#5| |#1|) |#4|) "\\spad{map(f, p)} lifts \\spad{f} to \\spad{F1} and applies it to \\spad{p}."))) 
 NIL 
 NIL 
-(-352 S -1967 UP UPUP) 
+(-352 S -1966 UP UPUP) 
 ((|constructor| (NIL "This category is a model for the function field of a plane algebraic curve.")) (|rationalPoints| (((|List| (|List| |#2|))) "\\spad{rationalPoints()} returns the list of all the affine rational points.")) (|nonSingularModel| (((|List| (|Polynomial| |#2|)) (|Symbol|)) "\\spad{nonSingularModel(u)} returns the equations in u1,{}...,{}un of an affine non-singular model for the curve.")) (|algSplitSimple| (((|Record| (|:| |num| $) (|:| |den| |#3|) (|:| |derivden| |#3|) (|:| |gd| |#3|)) $ (|Mapping| |#3| |#3|)) "\\spad{algSplitSimple(f, D)} returns \\spad{[h,d,d',g]} such that \\spad{f=h/d},{} \\spad{h} is integral at all the normal places \\spad{w}.\\spad{r}.\\spad{t}. \\spad{D},{} \\spad{d' = Dd},{} \\spad{g = gcd(d, discriminant())} and \\spad{D} is the derivation to use. \\spad{f} must have at most simple finite poles.")) (|hyperelliptic| (((|Union| |#3| "failed")) "\\spad{hyperelliptic()} returns \\spad{p(x)} if the curve is the hyperelliptic defined by \\spad{y**2 = p(x)},{} \"failed\" otherwise.")) (|elliptic| (((|Union| |#3| "failed")) "\\spad{elliptic()} returns \\spad{p(x)} if the curve is the elliptic defined by \\spad{y**2 = p(x)},{} \"failed\" otherwise.")) (|elt| ((|#2| $ |#2| |#2|) "\\spad{elt(f,a,b)} or \\spad{f}(a,{} \\spad{b}) returns the value of \\spad{f} at the point \\spad{(x = a, y = b)} if it is not singular.")) (|primitivePart| (($ $) "\\spad{primitivePart(f)} removes the content of the denominator and the common content of the numerator of \\spad{f}.")) (|differentiate| (($ $ (|Mapping| |#3| |#3|)) "\\spad{differentiate(x, d)} extends the derivation \\spad{d} from UP to \\$ and applies it to \\spad{x}.")) (|integralDerivationMatrix| (((|Record| (|:| |num| (|Matrix| |#3|)) (|:| |den| |#3|)) (|Mapping| |#3| |#3|)) "\\spad{integralDerivationMatrix(d)} extends the derivation \\spad{d} from UP to \\$ and returns (\\spad{M},{} \\spad{Q}) such that the i^th row of \\spad{M} divided by \\spad{Q} form the coordinates of \\spad{d(wi)} with respect to \\spad{(w1,...,wn)} where \\spad{(w1,...,wn)} is the integral basis returned by integralBasis().")) (|integralRepresents| (($ (|Vector| |#3|) |#3|) "\\spad{integralRepresents([A1,...,An], D)} returns \\spad{(A1 w1+...+An wn)/D} where \\spad{(w1,...,wn)} is the integral basis of \\spad{integralBasis()}.")) (|integralCoordinates| (((|Record| (|:| |num| (|Vector| |#3|)) (|:| |den| |#3|)) $) "\\spad{integralCoordinates(f)} returns \\spad{[[A1,...,An], D]} such that \\spad{f = (A1 w1 +...+ An wn) / D} where \\spad{(w1,...,wn)} is the integral basis returned by \\spad{integralBasis()}.")) (|represents| (($ (|Vector| |#3|) |#3|) "\\spad{represents([A0,...,A(n-1)],D)} returns \\spad{(A0 + A1 y +...+ A(n-1)*y**(n-1))/D}.")) (|yCoordinates| (((|Record| (|:| |num| (|Vector| |#3|)) (|:| |den| |#3|)) $) "\\spad{yCoordinates(f)} returns \\spad{[[A1,...,An], D]} such that \\spad{f = (A1 + A2 y +...+ An y**(n-1)) / D}.")) (|inverseIntegralMatrixAtInfinity| (((|Matrix| (|Fraction| |#3|))) "\\spad{inverseIntegralMatrixAtInfinity()} returns \\spad{M} such that \\spad{M (v1,...,vn) = (1, y, ..., y**(n-1))} where \\spad{(v1,...,vn)} is the local integral basis at infinity returned by \\spad{infIntBasis()}.")) (|integralMatrixAtInfinity| (((|Matrix| (|Fraction| |#3|))) "\\spad{integralMatrixAtInfinity()} returns \\spad{M} such that \\spad{(v1,...,vn) = M (1, y, ..., y**(n-1))} where \\spad{(v1,...,vn)} is the local integral basis at infinity returned by \\spad{infIntBasis()}.")) (|inverseIntegralMatrix| (((|Matrix| (|Fraction| |#3|))) "\\spad{inverseIntegralMatrix()} returns \\spad{M} such that \\spad{M (w1,...,wn) = (1, y, ..., y**(n-1))} where \\spad{(w1,...,wn)} is the integral basis of \\spadfunFrom{integralBasis}{FunctionFieldCategory}.")) (|integralMatrix| (((|Matrix| (|Fraction| |#3|))) "\\spad{integralMatrix()} returns \\spad{M} such that \\spad{(w1,...,wn) = M (1, y, ..., y**(n-1))},{} where \\spad{(w1,...,wn)} is the integral basis of \\spadfunFrom{integralBasis}{FunctionFieldCategory}.")) (|reduceBasisAtInfinity| (((|Vector| $) (|Vector| $)) "\\spad{reduceBasisAtInfinity(b1,...,bn)} returns \\spad{(x**i * bj)} for all \\spad{i},{}\\spad{j} such that \\spad{x**i*bj} is locally integral at infinity.")) (|normalizeAtInfinity| (((|Vector| $) (|Vector| $)) "\\spad{normalizeAtInfinity(v)} makes \\spad{v} normal at infinity.")) (|complementaryBasis| (((|Vector| $) (|Vector| $)) "\\spad{complementaryBasis(b1,...,bn)} returns the complementary basis \\spad{(b1',...,bn')} of \\spad{(b1,...,bn)}.")) (|integral?| (((|Boolean|) $ |#3|) "\\spad{integral?(f, p)} tests whether \\spad{f} is locally integral at \\spad{p(x) = 0}.") (((|Boolean|) $ |#2|) "\\spad{integral?(f, a)} tests whether \\spad{f} is locally integral at \\spad{x = a}.") (((|Boolean|) $) "\\spad{integral?()} tests if \\spad{f} is integral over \\spad{k[x]}.")) (|integralAtInfinity?| (((|Boolean|) $) "\\spad{integralAtInfinity?()} tests if \\spad{f} is locally integral at infinity.")) (|integralBasisAtInfinity| (((|Vector| $)) "\\spad{integralBasisAtInfinity()} returns the local integral basis at infinity.")) (|integralBasis| (((|Vector| $)) "\\spad{integralBasis()} returns the integral basis for the curve.")) (|ramified?| (((|Boolean|) |#3|) "\\spad{ramified?(p)} tests whether \\spad{p(x) = 0} is ramified.") (((|Boolean|) |#2|) "\\spad{ramified?(a)} tests whether \\spad{x = a} is ramified.")) (|ramifiedAtInfinity?| (((|Boolean|)) "\\spad{ramifiedAtInfinity?()} tests if infinity is ramified.")) (|singular?| (((|Boolean|) |#3|) "\\spad{singular?(p)} tests whether \\spad{p(x) = 0} is singular.") (((|Boolean|) |#2|) "\\spad{singular?(a)} tests whether \\spad{x = a} is singular.")) (|singularAtInfinity?| (((|Boolean|)) "\\spad{singularAtInfinity?()} tests if there is a singularity at infinity.")) (|branchPoint?| (((|Boolean|) |#3|) "\\spad{branchPoint?(p)} tests whether \\spad{p(x) = 0} is a branch point.") (((|Boolean|) |#2|) "\\spad{branchPoint?(a)} tests whether \\spad{x = a} is a branch point.")) (|branchPointAtInfinity?| (((|Boolean|)) "\\spad{branchPointAtInfinity?()} tests if there is a branch point at infinity.")) (|rationalPoint?| (((|Boolean|) |#2| |#2|) "\\spad{rationalPoint?(a, b)} tests if \\spad{(x=a,y=b)} is on the curve.")) (|absolutelyIrreducible?| (((|Boolean|)) "\\spad{absolutelyIrreducible?()} tests if the curve absolutely irreducible?")) (|genus| (((|NonNegativeInteger|)) "\\spad{genus()} returns the genus of one absolutely irreducible component")) (|numberOfComponents| (((|NonNegativeInteger|)) "\\spad{numberOfComponents()} returns the number of absolutely irreducible components."))) 
 NIL 
 ((|HasCategory| |#2| (QUOTE (-379))) (|HasCategory| |#2| (QUOTE (-374)))) 
-(-353 -1967 UP UPUP) 
+(-353 -1966 UP UPUP) 
 ((|constructor| (NIL "This category is a model for the function field of a plane algebraic curve.")) (|rationalPoints| (((|List| (|List| |#1|))) "\\spad{rationalPoints()} returns the list of all the affine rational points.")) (|nonSingularModel| (((|List| (|Polynomial| |#1|)) (|Symbol|)) "\\spad{nonSingularModel(u)} returns the equations in u1,{}...,{}un of an affine non-singular model for the curve.")) (|algSplitSimple| (((|Record| (|:| |num| $) (|:| |den| |#2|) (|:| |derivden| |#2|) (|:| |gd| |#2|)) $ (|Mapping| |#2| |#2|)) "\\spad{algSplitSimple(f, D)} returns \\spad{[h,d,d',g]} such that \\spad{f=h/d},{} \\spad{h} is integral at all the normal places \\spad{w}.\\spad{r}.\\spad{t}. \\spad{D},{} \\spad{d' = Dd},{} \\spad{g = gcd(d, discriminant())} and \\spad{D} is the derivation to use. \\spad{f} must have at most simple finite poles.")) (|hyperelliptic| (((|Union| |#2| "failed")) "\\spad{hyperelliptic()} returns \\spad{p(x)} if the curve is the hyperelliptic defined by \\spad{y**2 = p(x)},{} \"failed\" otherwise.")) (|elliptic| (((|Union| |#2| "failed")) "\\spad{elliptic()} returns \\spad{p(x)} if the curve is the elliptic defined by \\spad{y**2 = p(x)},{} \"failed\" otherwise.")) (|elt| ((|#1| $ |#1| |#1|) "\\spad{elt(f,a,b)} or \\spad{f}(a,{} \\spad{b}) returns the value of \\spad{f} at the point \\spad{(x = a, y = b)} if it is not singular.")) (|primitivePart| (($ $) "\\spad{primitivePart(f)} removes the content of the denominator and the common content of the numerator of \\spad{f}.")) (|differentiate| (($ $ (|Mapping| |#2| |#2|)) "\\spad{differentiate(x, d)} extends the derivation \\spad{d} from UP to \\$ and applies it to \\spad{x}.")) (|integralDerivationMatrix| (((|Record| (|:| |num| (|Matrix| |#2|)) (|:| |den| |#2|)) (|Mapping| |#2| |#2|)) "\\spad{integralDerivationMatrix(d)} extends the derivation \\spad{d} from UP to \\$ and returns (\\spad{M},{} \\spad{Q}) such that the i^th row of \\spad{M} divided by \\spad{Q} form the coordinates of \\spad{d(wi)} with respect to \\spad{(w1,...,wn)} where \\spad{(w1,...,wn)} is the integral basis returned by integralBasis().")) (|integralRepresents| (($ (|Vector| |#2|) |#2|) "\\spad{integralRepresents([A1,...,An], D)} returns \\spad{(A1 w1+...+An wn)/D} where \\spad{(w1,...,wn)} is the integral basis of \\spad{integralBasis()}.")) (|integralCoordinates| (((|Record| (|:| |num| (|Vector| |#2|)) (|:| |den| |#2|)) $) "\\spad{integralCoordinates(f)} returns \\spad{[[A1,...,An], D]} such that \\spad{f = (A1 w1 +...+ An wn) / D} where \\spad{(w1,...,wn)} is the integral basis returned by \\spad{integralBasis()}.")) (|represents| (($ (|Vector| |#2|) |#2|) "\\spad{represents([A0,...,A(n-1)],D)} returns \\spad{(A0 + A1 y +...+ A(n-1)*y**(n-1))/D}.")) (|yCoordinates| (((|Record| (|:| |num| (|Vector| |#2|)) (|:| |den| |#2|)) $) "\\spad{yCoordinates(f)} returns \\spad{[[A1,...,An], D]} such that \\spad{f = (A1 + A2 y +...+ An y**(n-1)) / D}.")) (|inverseIntegralMatrixAtInfinity| (((|Matrix| (|Fraction| |#2|))) "\\spad{inverseIntegralMatrixAtInfinity()} returns \\spad{M} such that \\spad{M (v1,...,vn) = (1, y, ..., y**(n-1))} where \\spad{(v1,...,vn)} is the local integral basis at infinity returned by \\spad{infIntBasis()}.")) (|integralMatrixAtInfinity| (((|Matrix| (|Fraction| |#2|))) "\\spad{integralMatrixAtInfinity()} returns \\spad{M} such that \\spad{(v1,...,vn) = M (1, y, ..., y**(n-1))} where \\spad{(v1,...,vn)} is the local integral basis at infinity returned by \\spad{infIntBasis()}.")) (|inverseIntegralMatrix| (((|Matrix| (|Fraction| |#2|))) "\\spad{inverseIntegralMatrix()} returns \\spad{M} such that \\spad{M (w1,...,wn) = (1, y, ..., y**(n-1))} where \\spad{(w1,...,wn)} is the integral basis of \\spadfunFrom{integralBasis}{FunctionFieldCategory}.")) (|integralMatrix| (((|Matrix| (|Fraction| |#2|))) "\\spad{integralMatrix()} returns \\spad{M} such that \\spad{(w1,...,wn) = M (1, y, ..., y**(n-1))},{} where \\spad{(w1,...,wn)} is the integral basis of \\spadfunFrom{integralBasis}{FunctionFieldCategory}.")) (|reduceBasisAtInfinity| (((|Vector| $) (|Vector| $)) "\\spad{reduceBasisAtInfinity(b1,...,bn)} returns \\spad{(x**i * bj)} for all \\spad{i},{}\\spad{j} such that \\spad{x**i*bj} is locally integral at infinity.")) (|normalizeAtInfinity| (((|Vector| $) (|Vector| $)) "\\spad{normalizeAtInfinity(v)} makes \\spad{v} normal at infinity.")) (|complementaryBasis| (((|Vector| $) (|Vector| $)) "\\spad{complementaryBasis(b1,...,bn)} returns the complementary basis \\spad{(b1',...,bn')} of \\spad{(b1,...,bn)}.")) (|integral?| (((|Boolean|) $ |#2|) "\\spad{integral?(f, p)} tests whether \\spad{f} is locally integral at \\spad{p(x) = 0}.") (((|Boolean|) $ |#1|) "\\spad{integral?(f, a)} tests whether \\spad{f} is locally integral at \\spad{x = a}.") (((|Boolean|) $) "\\spad{integral?()} tests if \\spad{f} is integral over \\spad{k[x]}.")) (|integralAtInfinity?| (((|Boolean|) $) "\\spad{integralAtInfinity?()} tests if \\spad{f} is locally integral at infinity.")) (|integralBasisAtInfinity| (((|Vector| $)) "\\spad{integralBasisAtInfinity()} returns the local integral basis at infinity.")) (|integralBasis| (((|Vector| $)) "\\spad{integralBasis()} returns the integral basis for the curve.")) (|ramified?| (((|Boolean|) |#2|) "\\spad{ramified?(p)} tests whether \\spad{p(x) = 0} is ramified.") (((|Boolean|) |#1|) "\\spad{ramified?(a)} tests whether \\spad{x = a} is ramified.")) (|ramifiedAtInfinity?| (((|Boolean|)) "\\spad{ramifiedAtInfinity?()} tests if infinity is ramified.")) (|singular?| (((|Boolean|) |#2|) "\\spad{singular?(p)} tests whether \\spad{p(x) = 0} is singular.") (((|Boolean|) |#1|) "\\spad{singular?(a)} tests whether \\spad{x = a} is singular.")) (|singularAtInfinity?| (((|Boolean|)) "\\spad{singularAtInfinity?()} tests if there is a singularity at infinity.")) (|branchPoint?| (((|Boolean|) |#2|) "\\spad{branchPoint?(p)} tests whether \\spad{p(x) = 0} is a branch point.") (((|Boolean|) |#1|) "\\spad{branchPoint?(a)} tests whether \\spad{x = a} is a branch point.")) (|branchPointAtInfinity?| (((|Boolean|)) "\\spad{branchPointAtInfinity?()} tests if there is a branch point at infinity.")) (|rationalPoint?| (((|Boolean|) |#1| |#1|) "\\spad{rationalPoint?(a, b)} tests if \\spad{(x=a,y=b)} is on the curve.")) (|absolutelyIrreducible?| (((|Boolean|)) "\\spad{absolutelyIrreducible?()} tests if the curve absolutely irreducible?")) (|genus| (((|NonNegativeInteger|)) "\\spad{genus()} returns the genus of one absolutely irreducible component")) (|numberOfComponents| (((|NonNegativeInteger|)) "\\spad{numberOfComponents()} returns the number of absolutely irreducible components."))) 
 ((-4455 |has| (-419 |#2|) (-374)) (-4460 |has| (-419 |#2|) (-374)) (-4454 |has| (-419 |#2|) (-374)) ((-4464 "*") . T) (-4456 . T) (-4457 . T) (-4459 . T)) 
 NIL 
@@ -1372,7 +1372,7 @@ NIL
 ((|constructor| (NIL "FiniteFieldCategory is the category of finite fields")) (|representationType| (((|Union| "prime" "polynomial" "normal" "cyclic")) "\\spad{representationType()} returns the type of the representation,{} one of: \\spad{prime},{} \\spad{polynomial},{} \\spad{normal},{} or \\spad{cyclic}.")) (|order| (((|PositiveInteger|) $) "\\spad{order(b)} computes the order of an element \\spad{b} in the multiplicative group of the field. Error: if \\spad{b} equals 0.")) (|discreteLog| (((|NonNegativeInteger|) $) "\\spad{discreteLog(a)} computes the discrete logarithm of \\spad{a} with respect to \\spad{primitiveElement()} of the field.")) (|primitive?| (((|Boolean|) $) "\\spad{primitive?(b)} tests whether the element \\spad{b} is a generator of the (cyclic) multiplicative group of the field,{} \\spadignore{i.e.} is a primitive element. Implementation Note: see \\spad{ch}.IX.1.3,{} th.2 in \\spad{D}. Lipson.")) (|primitiveElement| (($) "\\spad{primitiveElement()} returns a primitive element stored in a global variable in the domain. At first call,{} the primitive element is computed by calling \\spadfun{createPrimitiveElement}.")) (|createPrimitiveElement| (($) "\\spad{createPrimitiveElement()} computes a generator of the (cyclic) multiplicative group of the field.")) (|tableForDiscreteLogarithm| (((|Table| (|PositiveInteger|) (|NonNegativeInteger|)) (|Integer|)) "\\spad{tableForDiscreteLogarithm(a,n)} returns a table of the discrete logarithms of \\spad{a**0} up to \\spad{a**(n-1)} which,{} called with key \\spad{lookup(a**i)} returns \\spad{i} for \\spad{i} in \\spad{0..n-1}. Error: if not called for prime divisors of order of \\indented{7}{multiplicative group.}")) (|factorsOfCyclicGroupSize| (((|List| (|Record| (|:| |factor| (|Integer|)) (|:| |exponent| (|Integer|))))) "\\spad{factorsOfCyclicGroupSize()} returns the factorization of size()\\spad{-1}")) (|conditionP| (((|Union| (|Vector| $) "failed") (|Matrix| $)) "\\spad{conditionP(mat)},{} given a matrix representing a homogeneous system of equations,{} returns a vector whose characteristic'th powers is a non-trivial solution,{} or \"failed\" if no such vector exists.")) (|charthRoot| (($ $) "\\spad{charthRoot(a)} takes the characteristic'th root of {\\em a}. Note: such a root is alway defined in finite fields."))) 
 ((-4454 . T) (-4460 . T) (-4455 . T) ((-4464 "*") . T) (-4456 . T) (-4457 . T) (-4459 . T)) 
 NIL 
-(-361 R UP -1967) 
+(-361 R UP -1966) 
 ((|constructor| (NIL "In this package \\spad{R} is a Euclidean domain and \\spad{F} is a framed algebra over \\spad{R}. The package provides functions to compute the integral closure of \\spad{R} in the quotient field of \\spad{F}. It is assumed that \\spad{char(R/P) = char(R)} for any prime \\spad{P} of \\spad{R}. A typical instance of this is when \\spad{R = K[x]} and \\spad{F} is a function field over \\spad{R}.")) (|localIntegralBasis| (((|Record| (|:| |basis| (|Matrix| |#1|)) (|:| |basisDen| |#1|) (|:| |basisInv| (|Matrix| |#1|))) |#1|) "\\spad{integralBasis(p)} returns a record \\spad{[basis,basisDen,basisInv]} containing information regarding the local integral closure of \\spad{R} at the prime \\spad{p} in the quotient field of \\spad{F},{} where \\spad{F} is a framed algebra with \\spad{R}-module basis \\spad{w1,w2,...,wn}. If \\spad{basis} is the matrix \\spad{(aij, i = 1..n, j = 1..n)},{} then the \\spad{i}th element of the local integral basis is \\spad{vi = (1/basisDen) * sum(aij * wj, j = 1..n)},{} \\spadignore{i.e.} the \\spad{i}th row of \\spad{basis} contains the coordinates of the \\spad{i}th basis vector. Similarly,{} the \\spad{i}th row of the matrix \\spad{basisInv} contains the coordinates of \\spad{wi} with respect to the basis \\spad{v1,...,vn}: if \\spad{basisInv} is the matrix \\spad{(bij, i = 1..n, j = 1..n)},{} then \\spad{wi = sum(bij * vj, j = 1..n)}.")) (|integralBasis| (((|Record| (|:| |basis| (|Matrix| |#1|)) (|:| |basisDen| |#1|) (|:| |basisInv| (|Matrix| |#1|)))) "\\spad{integralBasis()} returns a record \\spad{[basis,basisDen,basisInv]} containing information regarding the integral closure of \\spad{R} in the quotient field of \\spad{F},{} where \\spad{F} is a framed algebra with \\spad{R}-module basis \\spad{w1,w2,...,wn}. If \\spad{basis} is the matrix \\spad{(aij, i = 1..n, j = 1..n)},{} then the \\spad{i}th element of the integral basis is \\spad{vi = (1/basisDen) * sum(aij * wj, j = 1..n)},{} \\spadignore{i.e.} the \\spad{i}th row of \\spad{basis} contains the coordinates of the \\spad{i}th basis vector. Similarly,{} the \\spad{i}th row of the matrix \\spad{basisInv} contains the coordinates of \\spad{wi} with respect to the basis \\spad{v1,...,vn}: if \\spad{basisInv} is the matrix \\spad{(bij, i = 1..n, j = 1..n)},{} then \\spad{wi = sum(bij * vj, j = 1..n)}.")) (|squareFree| (((|Factored| $) $) "\\spad{squareFree(x)} returns a square-free factorisation of \\spad{x}"))) 
 NIL 
 NIL 
@@ -1396,7 +1396,7 @@ NIL
 ((|constructor| (NIL "FiniteFieldExtensionByPolynomial(\\spad{GF},{} defpol) implements the extension of the finite field {\\em GF} generated by the extension polynomial {\\em defpol} which MUST be irreducible. Note: the user has the responsibility to ensure that {\\em defpol} is irreducible."))) 
 ((-4454 . T) (-4460 . T) (-4455 . T) ((-4464 "*") . T) (-4456 . T) (-4457 . T) (-4459 . T)) 
 ((-2781 (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-379)))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-379))) (|HasCategory| |#1| (QUOTE (-146)))) 
-(-367 -1967 GF) 
+(-367 -1966 GF) 
 ((|constructor| (NIL "FiniteFieldPolynomialPackage2(\\spad{F},{}\\spad{GF}) exports some functions concerning finite fields,{} which depend on a finite field {\\em GF} and an algebraic extension \\spad{F} of {\\em GF},{} \\spadignore{e.g.} a zero of a polynomial over {\\em GF} in \\spad{F}.")) (|rootOfIrreduciblePoly| ((|#1| (|SparseUnivariatePolynomial| |#2|)) "\\spad{rootOfIrreduciblePoly(f)} computes one root of the monic,{} irreducible polynomial \\spad{f},{} which degree must divide the extension degree of {\\em F} over {\\em GF},{} \\spadignore{i.e.} \\spad{f} splits into linear factors over {\\em F}.")) (|Frobenius| ((|#1| |#1|) "\\spad{Frobenius(x)} \\undocumented{}")) (|basis| (((|Vector| |#1|) (|PositiveInteger|)) "\\spad{basis(n)} \\undocumented{}")) (|lookup| (((|PositiveInteger|) |#1|) "\\spad{lookup(x)} \\undocumented{}")) (|coerce| ((|#1| |#2|) "\\spad{coerce(x)} \\undocumented{}"))) 
 NIL 
 NIL 
@@ -1404,7 +1404,7 @@ NIL
 ((|constructor| (NIL "This package provides a number of functions for generating,{} counting and testing irreducible,{} normal,{} primitive,{} random polynomials over finite fields.")) (|reducedQPowers| (((|PrimitiveArray| (|SparseUnivariatePolynomial| |#1|)) (|SparseUnivariatePolynomial| |#1|)) "\\spad{reducedQPowers(f)} generates \\spad{[x,x**q,x**(q**2),...,x**(q**(n-1))]} reduced modulo \\spad{f} where \\spad{q = size()\\$GF} and \\spad{n = degree f}.")) (|leastAffineMultiple| (((|SparseUnivariatePolynomial| |#1|) (|SparseUnivariatePolynomial| |#1|)) "\\spad{leastAffineMultiple(f)} computes the least affine polynomial which is divisible by the polynomial \\spad{f} over the finite field {\\em GF},{} \\spadignore{i.e.} a polynomial whose exponents are 0 or a power of \\spad{q},{} the size of {\\em GF}.")) (|random| (((|SparseUnivariatePolynomial| |#1|) (|PositiveInteger|) (|PositiveInteger|)) "\\spad{random(m,n)}\\$FFPOLY(\\spad{GF}) generates a random monic polynomial of degree \\spad{d} over the finite field {\\em GF},{} \\spad{d} between \\spad{m} and \\spad{n}.") (((|SparseUnivariatePolynomial| |#1|) (|PositiveInteger|)) "\\spad{random(n)}\\$FFPOLY(\\spad{GF}) generates a random monic polynomial of degree \\spad{n} over the finite field {\\em GF}.")) (|nextPrimitiveNormalPoly| (((|Union| (|SparseUnivariatePolynomial| |#1|) "failed") (|SparseUnivariatePolynomial| |#1|)) "\\spad{nextPrimitiveNormalPoly(f)} yields the next primitive normal polynomial over a finite field {\\em GF} of the same degree as \\spad{f} in the following order,{} or \"failed\" if there are no greater ones. Error: if \\spad{f} has degree 0. Note: the input polynomial \\spad{f} is made monic. Also,{} \\spad{f < g} if the {\\em lookup} of the constant term of \\spad{f} is less than this number for \\spad{g} or,{} in case these numbers are equal,{} if the {\\em lookup} of the coefficient of the term of degree {\\em n-1} of \\spad{f} is less than this number for \\spad{g}. If these numbers are equals,{} \\spad{f < g} if the number of monomials of \\spad{f} is less than that for \\spad{g},{} or if the lists of exponents for \\spad{f} are lexicographically less than those for \\spad{g}. If these lists are also equal,{} the lists of coefficients are coefficients according to the lexicographic ordering induced by the ordering of the elements of {\\em GF} given by {\\em lookup}. This operation is equivalent to nextNormalPrimitivePoly(\\spad{f}).")) (|nextNormalPrimitivePoly| (((|Union| (|SparseUnivariatePolynomial| |#1|) "failed") (|SparseUnivariatePolynomial| |#1|)) "\\spad{nextNormalPrimitivePoly(f)} yields the next normal primitive polynomial over a finite field {\\em GF} of the same degree as \\spad{f} in the following order,{} or \"failed\" if there are no greater ones. Error: if \\spad{f} has degree 0. Note: the input polynomial \\spad{f} is made monic. Also,{} \\spad{f < g} if the {\\em lookup} of the constant term of \\spad{f} is less than this number for \\spad{g} or if {\\em lookup} of the coefficient of the term of degree {\\em n-1} of \\spad{f} is less than this number for \\spad{g}. Otherwise,{} \\spad{f < g} if the number of monomials of \\spad{f} is less than that for \\spad{g} or if the lists of exponents for \\spad{f} are lexicographically less than those for \\spad{g}. If these lists are also equal,{} the lists of coefficients are compared according to the lexicographic ordering induced by the ordering of the elements of {\\em GF} given by {\\em lookup}. This operation is equivalent to nextPrimitiveNormalPoly(\\spad{f}).")) (|nextNormalPoly| (((|Union| (|SparseUnivariatePolynomial| |#1|) "failed") (|SparseUnivariatePolynomial| |#1|)) "\\spad{nextNormalPoly(f)} yields the next normal polynomial over a finite field {\\em GF} of the same degree as \\spad{f} in the following order,{} or \"failed\" if there are no greater ones. Error: if \\spad{f} has degree 0. Note: the input polynomial \\spad{f} is made monic. Also,{} \\spad{f < g} if the {\\em lookup} of the coefficient of the term of degree {\\em n-1} of \\spad{f} is less than that for \\spad{g}. In case these numbers are equal,{} \\spad{f < g} if if the number of monomials of \\spad{f} is less that for \\spad{g} or if the list of exponents of \\spad{f} are lexicographically less than the corresponding list for \\spad{g}. If these lists are also equal,{} the lists of coefficients are compared according to the lexicographic ordering induced by the ordering of the elements of {\\em GF} given by {\\em lookup}.")) (|nextPrimitivePoly| (((|Union| (|SparseUnivariatePolynomial| |#1|) "failed") (|SparseUnivariatePolynomial| |#1|)) "\\spad{nextPrimitivePoly(f)} yields the next primitive polynomial over a finite field {\\em GF} of the same degree as \\spad{f} in the following order,{} or \"failed\" if there are no greater ones. Error: if \\spad{f} has degree 0. Note: the input polynomial \\spad{f} is made monic. Also,{} \\spad{f < g} if the {\\em lookup} of the constant term of \\spad{f} is less than this number for \\spad{g}. If these values are equal,{} then \\spad{f < g} if if the number of monomials of \\spad{f} is less than that for \\spad{g} or if the lists of exponents of \\spad{f} are lexicographically less than the corresponding list for \\spad{g}. If these lists are also equal,{} the lists of coefficients are compared according to the lexicographic ordering induced by the ordering of the elements of {\\em GF} given by {\\em lookup}.")) (|nextIrreduciblePoly| (((|Union| (|SparseUnivariatePolynomial| |#1|) "failed") (|SparseUnivariatePolynomial| |#1|)) "\\spad{nextIrreduciblePoly(f)} yields the next monic irreducible polynomial over a finite field {\\em GF} of the same degree as \\spad{f} in the following order,{} or \"failed\" if there are no greater ones. Error: if \\spad{f} has degree 0. Note: the input polynomial \\spad{f} is made monic. Also,{} \\spad{f < g} if the number of monomials of \\spad{f} is less than this number for \\spad{g}. If \\spad{f} and \\spad{g} have the same number of monomials,{} the lists of exponents are compared lexicographically. If these lists are also equal,{} the lists of coefficients are compared according to the lexicographic ordering induced by the ordering of the elements of {\\em GF} given by {\\em lookup}.")) (|createPrimitiveNormalPoly| (((|SparseUnivariatePolynomial| |#1|) (|PositiveInteger|)) "\\spad{createPrimitiveNormalPoly(n)}\\$FFPOLY(\\spad{GF}) generates a normal and primitive polynomial of degree \\spad{n} over the field {\\em GF}. polynomial of degree \\spad{n} over the field {\\em GF}.")) (|createNormalPrimitivePoly| (((|SparseUnivariatePolynomial| |#1|) (|PositiveInteger|)) "\\spad{createNormalPrimitivePoly(n)}\\$FFPOLY(\\spad{GF}) generates a normal and primitive polynomial of degree \\spad{n} over the field {\\em GF}. Note: this function is equivalent to createPrimitiveNormalPoly(\\spad{n})")) (|createNormalPoly| (((|SparseUnivariatePolynomial| |#1|) (|PositiveInteger|)) "\\spad{createNormalPoly(n)}\\$FFPOLY(\\spad{GF}) generates a normal polynomial of degree \\spad{n} over the finite field {\\em GF}.")) (|createPrimitivePoly| (((|SparseUnivariatePolynomial| |#1|) (|PositiveInteger|)) "\\spad{createPrimitivePoly(n)}\\$FFPOLY(\\spad{GF}) generates a primitive polynomial of degree \\spad{n} over the finite field {\\em GF}.")) (|createIrreduciblePoly| (((|SparseUnivariatePolynomial| |#1|) (|PositiveInteger|)) "\\spad{createIrreduciblePoly(n)}\\$FFPOLY(\\spad{GF}) generates a monic irreducible univariate polynomial of degree \\spad{n} over the finite field {\\em GF}.")) (|numberOfNormalPoly| (((|PositiveInteger|) (|PositiveInteger|)) "\\spad{numberOfNormalPoly(n)}\\$FFPOLY(\\spad{GF}) yields the number of normal polynomials of degree \\spad{n} over the finite field {\\em GF}.")) (|numberOfPrimitivePoly| (((|PositiveInteger|) (|PositiveInteger|)) "\\spad{numberOfPrimitivePoly(n)}\\$FFPOLY(\\spad{GF}) yields the number of primitive polynomials of degree \\spad{n} over the finite field {\\em GF}.")) (|numberOfIrreduciblePoly| (((|PositiveInteger|) (|PositiveInteger|)) "\\spad{numberOfIrreduciblePoly(n)}\\$FFPOLY(\\spad{GF}) yields the number of monic irreducible univariate polynomials of degree \\spad{n} over the finite field {\\em GF}.")) (|normal?| (((|Boolean|) (|SparseUnivariatePolynomial| |#1|)) "\\spad{normal?(f)} tests whether the polynomial \\spad{f} over a finite field is normal,{} \\spadignore{i.e.} its roots are linearly independent over the field.")) (|primitive?| (((|Boolean|) (|SparseUnivariatePolynomial| |#1|)) "\\spad{primitive?(f)} tests whether the polynomial \\spad{f} over a finite field is primitive,{} \\spadignore{i.e.} all its roots are primitive."))) 
 NIL 
 NIL 
-(-369 -1967 FP FPP) 
+(-369 -1966 FP FPP) 
 ((|constructor| (NIL "This package solves linear diophantine equations for Bivariate polynomials over finite fields")) (|solveLinearPolynomialEquation| (((|Union| (|List| |#3|) "failed") (|List| |#3|) |#3|) "\\spad{solveLinearPolynomialEquation([f1, ..., fn], g)} (where the \\spad{fi} are relatively prime to each other) returns a list of \\spad{ai} such that \\spad{g/prod fi = sum ai/fi} or returns \"failed\" if no such list of \\spad{ai}\\spad{'s} exists."))) 
 NIL 
 NIL 
@@ -1544,7 +1544,7 @@ NIL
 ((|constructor| (NIL "Code to manipulate Fortran Output Stack")) (|topFortranOutputStack| (((|String|)) "\\spad{topFortranOutputStack()} returns the top element of the Fortran output stack")) (|pushFortranOutputStack| (((|Void|) (|String|)) "\\spad{pushFortranOutputStack(f)} pushes \\spad{f} onto the Fortran output stack") (((|Void|) (|FileName|)) "\\spad{pushFortranOutputStack(f)} pushes \\spad{f} onto the Fortran output stack")) (|popFortranOutputStack| (((|Void|)) "\\spad{popFortranOutputStack()} pops the Fortran output stack")) (|showFortranOutputStack| (((|Stack| (|String|))) "\\spad{showFortranOutputStack()} returns the Fortran output stack")) (|clearFortranOutputStack| (((|Stack| (|String|))) "\\spad{clearFortranOutputStack()} clears the Fortran output stack"))) 
 NIL 
 NIL 
-(-404 -1967 UP UPUP R) 
+(-404 -1966 UP UPUP R) 
 ((|constructor| (NIL "\\indented{1}{Finds the order of a divisor over a finite field} Author: Manuel Bronstein Date Created: 1988 Date Last Updated: 11 Jul 1990")) (|order| (((|NonNegativeInteger|) (|FiniteDivisor| |#1| |#2| |#3| |#4|)) "\\spad{order(x)} \\undocumented"))) 
 NIL 
 NIL 
@@ -1572,7 +1572,7 @@ NIL
 ((|constructor| (NIL "\\axiomType{FortranProgram} allows the user to build and manipulate simple models of FORTRAN subprograms. These can then be transformed into actual FORTRAN notation.")) (|coerce| (($ (|Equation| (|Expression| (|Complex| (|Float|))))) "\\spad{coerce(eq)} \\undocumented{}") (($ (|Equation| (|Expression| (|Float|)))) "\\spad{coerce(eq)} \\undocumented{}") (($ (|Equation| (|Expression| (|Integer|)))) "\\spad{coerce(eq)} \\undocumented{}") (($ (|Expression| (|Complex| (|Float|)))) "\\spad{coerce(e)} \\undocumented{}") (($ (|Expression| (|Float|))) "\\spad{coerce(e)} \\undocumented{}") (($ (|Expression| (|Integer|))) "\\spad{coerce(e)} \\undocumented{}") (($ (|Equation| (|Expression| (|MachineComplex|)))) "\\spad{coerce(eq)} \\undocumented{}") (($ (|Equation| (|Expression| (|MachineFloat|)))) "\\spad{coerce(eq)} \\undocumented{}") (($ (|Equation| (|Expression| (|MachineInteger|)))) "\\spad{coerce(eq)} \\undocumented{}") (($ (|Expression| (|MachineComplex|))) "\\spad{coerce(e)} \\undocumented{}") (($ (|Expression| (|MachineFloat|))) "\\spad{coerce(e)} \\undocumented{}") (($ (|Expression| (|MachineInteger|))) "\\spad{coerce(e)} \\undocumented{}") (($ (|Record| (|:| |localSymbols| (|SymbolTable|)) (|:| |code| (|List| (|FortranCode|))))) "\\spad{coerce(r)} \\undocumented{}") (($ (|List| (|FortranCode|))) "\\spad{coerce(lfc)} \\undocumented{}") (($ (|FortranCode|)) "\\spad{coerce(fc)} \\undocumented{}"))) 
 NIL 
 NIL 
-(-411 -1967 UP) 
+(-411 -1966 UP) 
 ((|constructor| (NIL "\\indented{1}{Full partial fraction expansion of rational functions} Author: Manuel Bronstein Date Created: 9 December 1992 Date Last Updated: June 18,{} 2010 References: \\spad{M}.Bronstein & \\spad{B}.Salvy,{} \\indented{12}{Full Partial Fraction Decomposition of Rational Functions,{}} \\indented{12}{in Proceedings of ISSAC'93,{} Kiev,{} ACM Press.}")) (|construct| (($ (|List| (|Record| (|:| |exponent| (|NonNegativeInteger|)) (|:| |center| |#2|) (|:| |num| |#2|)))) "\\spad{construct(l)} is the inverse of fracPart.")) (|fracPart| (((|List| (|Record| (|:| |exponent| (|NonNegativeInteger|)) (|:| |center| |#2|) (|:| |num| |#2|))) $) "\\spad{fracPart(f)} returns the list of summands of the fractional part of \\spad{f}.")) (|polyPart| ((|#2| $) "\\spad{polyPart(f)} returns the polynomial part of \\spad{f}.")) (|fullPartialFraction| (($ (|Fraction| |#2|)) "\\spad{fullPartialFraction(f)} returns \\spad{[p, [[j, Dj, Hj]...]]} such that \\spad{f = p(x) + \\sum_{[j,Dj,Hj] in l} \\sum_{Dj(a)=0} Hj(a)/(x - a)\\^j}.")) (+ (($ |#2| $) "\\spad{p + x} returns the sum of \\spad{p} and \\spad{x}"))) 
 NIL 
 NIL 
@@ -1628,11 +1628,11 @@ NIL
 ((|constructor| (NIL "\\indented{1}{Lifting of morphisms to fractional ideals.} Author: Manuel Bronstein Date Created: 1 Feb 1989 Date Last Updated: 27 Feb 1990 Keywords: ideal,{} algebra,{} module.")) (|map| (((|FractionalIdeal| |#5| |#6| |#7| |#8|) (|Mapping| |#5| |#1|) (|FractionalIdeal| |#1| |#2| |#3| |#4|)) "\\spad{map(f,i)} \\undocumented{}"))) 
 NIL 
 NIL 
-(-425 R -1967 UP A) 
+(-425 R -1966 UP A) 
 ((|constructor| (NIL "Fractional ideals in a framed algebra.")) (|randomLC| ((|#4| (|NonNegativeInteger|) (|Vector| |#4|)) "\\spad{randomLC(n,x)} should be local but conditional.")) (|minimize| (($ $) "\\spad{minimize(I)} returns a reduced set of generators for \\spad{I}.")) (|denom| ((|#1| $) "\\spad{denom(1/d * (f1,...,fn))} returns \\spad{d}.")) (|numer| (((|Vector| |#4|) $) "\\spad{numer(1/d * (f1,...,fn))} = the vector \\spad{[f1,...,fn]}.")) (|norm| ((|#2| $) "\\spad{norm(I)} returns the norm of the ideal \\spad{I}.")) (|basis| (((|Vector| |#4|) $) "\\spad{basis((f1,...,fn))} returns the vector \\spad{[f1,...,fn]}.")) (|ideal| (($ (|Vector| |#4|)) "\\spad{ideal([f1,...,fn])} returns the ideal \\spad{(f1,...,fn)}."))) 
 ((-4459 . T)) 
 NIL 
-(-426 R -1967 UP A |ibasis|) 
+(-426 R -1966 UP A |ibasis|) 
 ((|constructor| (NIL "Module representation of fractional ideals.")) (|module| (($ (|FractionalIdeal| |#1| |#2| |#3| |#4|)) "\\spad{module(I)} returns \\spad{I} viewed has a module over \\spad{R}.") (($ (|Vector| |#4|)) "\\spad{module([f1,...,fn])} = the module generated by \\spad{(f1,...,fn)} over \\spad{R}.")) (|norm| ((|#2| $) "\\spad{norm(f)} returns the norm of the module \\spad{f}.")) (|basis| (((|Vector| |#4|) $) "\\spad{basis((f1,...,fn))} = the vector \\spad{[f1,...,fn]}."))) 
 NIL 
 ((|HasCategory| |#4| (LIST (QUOTE -1057) (|devaluate| |#2|)))) 
@@ -1680,7 +1680,7 @@ NIL
 ((|constructor| (NIL "A finite-set aggregate models the notion of a finite set,{} that is,{} a collection of elements characterized by membership,{} but not by order or multiplicity. See \\spadtype{Set} for an example.")) (|min| ((|#1| $) "\\spad{min(u)} returns the smallest element of aggregate \\spad{u}.")) (|max| ((|#1| $) "\\spad{max(u)} returns the largest element of aggregate \\spad{u}.")) (|universe| (($) "\\spad{universe()}\\$\\spad{D} returns the universal set for finite set aggregate \\spad{D}.")) (|complement| (($ $) "\\spad{complement(u)} returns the complement of the set \\spad{u},{} \\spadignore{i.e.} the set of all values not in \\spad{u}.")) (|cardinality| (((|NonNegativeInteger|) $) "\\spad{cardinality(u)} returns the number of elements of \\spad{u}. Note: \\axiom{cardinality(\\spad{u}) = \\#u}."))) 
 ((-4462 . T) (-4452 . T) (-4463 . T)) 
 NIL 
-(-438 R -1967) 
+(-438 R -1966) 
 ((|constructor| (NIL "\\spadtype{FunctionSpaceComplexIntegration} provides functions for the indefinite integration of complex-valued functions.")) (|complexIntegrate| ((|#2| |#2| (|Symbol|)) "\\spad{complexIntegrate(f, x)} returns the integral of \\spad{f(x)dx} where \\spad{x} is viewed as a complex variable.")) (|internalIntegrate0| (((|IntegrationResult| |#2|) |#2| (|Symbol|)) "\\spad{internalIntegrate0 should} be a local function,{} but is conditional.")) (|internalIntegrate| (((|IntegrationResult| |#2|) |#2| (|Symbol|)) "\\spad{internalIntegrate(f, x)} returns the integral of \\spad{f(x)dx} where \\spad{x} is viewed as a complex variable."))) 
 NIL 
 NIL 
@@ -1688,7 +1688,7 @@ NIL
 ((|constructor| (NIL "\\indented{1}{Author: James Davenport} Date Created: 17 April 1992 Date Last Updated: Basic Functions: Related Constructors: Also See: AMS Classifications: Keywords: References: Description:")) (|makeCos| (($ |#2| |#1|) "\\spad{makeCos(e,r)} makes a sin expression with given argument and coefficient")) (|makeSin| (($ |#2| |#1|) "\\spad{makeSin(e,r)} makes a sin expression with given argument and coefficient")) (|coerce| (($ (|FourierComponent| |#2|)) "\\spad{coerce(c)} converts sin/cos terms into Fourier Series") (($ |#1|) "\\spad{coerce(r)} converts coefficients into Fourier Series"))) 
 ((-4449 -12 (|has| |#1| (-6 -4449)) (|has| |#2| (-6 -4449))) (-4456 . T) (-4457 . T) (-4459 . T)) 
 ((-12 (|HasAttribute| |#1| (QUOTE -4449)) (|HasAttribute| |#2| (QUOTE -4449)))) 
-(-440 R -1967) 
+(-440 R -1966) 
 ((|constructor| (NIL "\\spadtype{FunctionSpaceIntegration} provides functions for the indefinite integration of real-valued functions.")) (|integrate| (((|Union| |#2| (|List| |#2|)) |#2| (|Symbol|)) "\\spad{integrate(f, x)} returns the integral of \\spad{f(x)dx} where \\spad{x} is viewed as a real variable."))) 
 NIL 
 NIL 
@@ -1700,15 +1700,15 @@ NIL
 ((|constructor| (NIL "A space of formal functions with arguments in an arbitrary ordered set.")) (|univariate| (((|Fraction| (|SparseUnivariatePolynomial| $)) $ (|Kernel| $)) "\\spad{univariate(f, k)} returns \\spad{f} viewed as a univariate fraction in \\spad{k}.")) (/ (($ (|SparseMultivariatePolynomial| |#1| (|Kernel| $)) (|SparseMultivariatePolynomial| |#1| (|Kernel| $))) "\\spad{p1/p2} returns the quotient of \\spad{p1} and \\spad{p2} as an element of \\%.")) (|denominator| (($ $) "\\spad{denominator(f)} returns the denominator of \\spad{f} converted to \\%.")) (|denom| (((|SparseMultivariatePolynomial| |#1| (|Kernel| $)) $) "\\spad{denom(f)} returns the denominator of \\spad{f} viewed as a polynomial in the kernels over \\spad{R}.")) (|convert| (($ (|Factored| $)) "\\spad{convert(f1\\^e1 ... fm\\^em)} returns \\spad{(f1)\\^e1 ... (fm)\\^em} as an element of \\%,{} using formal kernels created using a \\spadfunFrom{paren}{ExpressionSpace}.")) (|isPower| (((|Union| (|Record| (|:| |val| $) (|:| |exponent| (|Integer|))) "failed") $) "\\spad{isPower(p)} returns \\spad{[x, n]} if \\spad{p = x**n} and \\spad{n <> 0}.")) (|numerator| (($ $) "\\spad{numerator(f)} returns the numerator of \\spad{f} converted to \\%.")) (|numer| (((|SparseMultivariatePolynomial| |#1| (|Kernel| $)) $) "\\spad{numer(f)} returns the numerator of \\spad{f} viewed as a polynomial in the kernels over \\spad{R} if \\spad{R} is an integral domain. If not,{} then numer(\\spad{f}) = \\spad{f} viewed as a polynomial in the kernels over \\spad{R}.")) (|coerce| (($ (|Fraction| (|Polynomial| (|Fraction| |#1|)))) "\\spad{coerce(f)} returns \\spad{f} as an element of \\%.") (($ (|Polynomial| (|Fraction| |#1|))) "\\spad{coerce(p)} returns \\spad{p} as an element of \\%.") (($ (|Fraction| |#1|)) "\\spad{coerce(q)} returns \\spad{q} as an element of \\%.") (($ (|SparseMultivariatePolynomial| |#1| (|Kernel| $))) "\\spad{coerce(p)} returns \\spad{p} as an element of \\%.")) (|isMult| (((|Union| (|Record| (|:| |coef| (|Integer|)) (|:| |var| (|Kernel| $))) "failed") $) "\\spad{isMult(p)} returns \\spad{[n, x]} if \\spad{p = n * x} and \\spad{n <> 0}.")) (|isPlus| (((|Union| (|List| $) "failed") $) "\\spad{isPlus(p)} returns \\spad{[m1,...,mn]} if \\spad{p = m1 +...+ mn} and \\spad{n > 1}.")) (|isExpt| (((|Union| (|Record| (|:| |var| (|Kernel| $)) (|:| |exponent| (|Integer|))) "failed") $ (|Symbol|)) "\\spad{isExpt(p,f)} returns \\spad{[x, n]} if \\spad{p = x**n} and \\spad{n <> 0} and \\spad{x = f(a)}.") (((|Union| (|Record| (|:| |var| (|Kernel| $)) (|:| |exponent| (|Integer|))) "failed") $ (|BasicOperator|)) "\\spad{isExpt(p,op)} returns \\spad{[x, n]} if \\spad{p = x**n} and \\spad{n <> 0} and \\spad{x = op(a)}.") (((|Union| (|Record| (|:| |var| (|Kernel| $)) (|:| |exponent| (|Integer|))) "failed") $) "\\spad{isExpt(p)} returns \\spad{[x, n]} if \\spad{p = x**n} and \\spad{n <> 0}.")) (|isTimes| (((|Union| (|List| $) "failed") $) "\\spad{isTimes(p)} returns \\spad{[a1,...,an]} if \\spad{p = a1*...*an} and \\spad{n > 1}.")) (** (($ $ (|NonNegativeInteger|)) "\\spad{x**n} returns \\spad{x} * \\spad{x} * \\spad{x} * ... * \\spad{x} (\\spad{n} times).")) (|eval| (($ $ (|Symbol|) (|NonNegativeInteger|) (|Mapping| $ $)) "\\spad{eval(x, s, n, f)} replaces every \\spad{s(a)**n} in \\spad{x} by \\spad{f(a)} for any \\spad{a}.") (($ $ (|Symbol|) (|NonNegativeInteger|) (|Mapping| $ (|List| $))) "\\spad{eval(x, s, n, f)} replaces every \\spad{s(a1,...,am)**n} in \\spad{x} by \\spad{f(a1,...,am)} for any a1,{}...,{}am.") (($ $ (|List| (|Symbol|)) (|List| (|NonNegativeInteger|)) (|List| (|Mapping| $ (|List| $)))) "\\spad{eval(x, [s1,...,sm], [n1,...,nm], [f1,...,fm])} replaces every \\spad{si(a1,...,an)**ni} in \\spad{x} by \\spad{fi(a1,...,an)} for any a1,{}...,{}am.") (($ $ (|List| (|Symbol|)) (|List| (|NonNegativeInteger|)) (|List| (|Mapping| $ $))) "\\spad{eval(x, [s1,...,sm], [n1,...,nm], [f1,...,fm])} replaces every \\spad{si(a)**ni} in \\spad{x} by \\spad{fi(a)} for any \\spad{a}.") (($ $ (|List| (|BasicOperator|)) (|List| $) (|Symbol|)) "\\spad{eval(x, [s1,...,sm], [f1,...,fm], y)} replaces every \\spad{si(a)} in \\spad{x} by \\spad{fi(y)} with \\spad{y} replaced by \\spad{a} for any \\spad{a}.") (($ $ (|BasicOperator|) $ (|Symbol|)) "\\spad{eval(x, s, f, y)} replaces every \\spad{s(a)} in \\spad{x} by \\spad{f(y)} with \\spad{y} replaced by \\spad{a} for any \\spad{a}.") (($ $) "\\spad{eval(f)} unquotes all the quoted operators in \\spad{f}.") (($ $ (|List| (|Symbol|))) "\\spad{eval(f, [foo1,...,foon])} unquotes all the \\spad{fooi}\\spad{'s} in \\spad{f}.") (($ $ (|Symbol|)) "\\spad{eval(f, foo)} unquotes all the foo\\spad{'s} in \\spad{f}.")) (|applyQuote| (($ (|Symbol|) (|List| $)) "\\spad{applyQuote(foo, [x1,...,xn])} returns \\spad{'foo(x1,...,xn)}.") (($ (|Symbol|) $ $ $ $) "\\spad{applyQuote(foo, x, y, z, t)} returns \\spad{'foo(x,y,z,t)}.") (($ (|Symbol|) $ $ $) "\\spad{applyQuote(foo, x, y, z)} returns \\spad{'foo(x,y,z)}.") (($ (|Symbol|) $ $) "\\spad{applyQuote(foo, x, y)} returns \\spad{'foo(x,y)}.") (($ (|Symbol|) $) "\\spad{applyQuote(foo, x)} returns \\spad{'foo(x)}.")) (|variables| (((|List| (|Symbol|)) $) "\\spad{variables(f)} returns the list of all the variables of \\spad{f}.")) (|ground| ((|#1| $) "\\spad{ground(f)} returns \\spad{f} as an element of \\spad{R}. An error occurs if \\spad{f} is not an element of \\spad{R}.")) (|ground?| (((|Boolean|) $) "\\spad{ground?(f)} tests if \\spad{f} is an element of \\spad{R}."))) 
 ((-4459 -2781 (|has| |#1| (-1068)) (|has| |#1| (-485))) (-4457 |has| |#1| (-174)) (-4456 |has| |#1| (-174)) ((-4464 "*") |has| |#1| (-568)) (-4455 |has| |#1| (-568)) (-4460 |has| |#1| (-568)) (-4454 |has| |#1| (-568))) 
 NIL 
-(-443 R -1967) 
+(-443 R -1966) 
 ((|constructor| (NIL "Provides some special functions over an integral domain.")) (|iiabs| ((|#2| |#2|) "\\spad{iiabs(x)} should be local but conditional.")) (|iiGamma| ((|#2| |#2|) "\\spad{iiGamma(x)} should be local but conditional.")) (|airyBi| ((|#2| |#2|) "\\spad{airyBi(x)} returns the airybi function applied to \\spad{x}")) (|airyAi| ((|#2| |#2|) "\\spad{airyAi(x)} returns the airyai function applied to \\spad{x}")) (|besselK| ((|#2| |#2| |#2|) "\\spad{besselK(x,y)} returns the besselk function applied to \\spad{x} and \\spad{y}")) (|besselI| ((|#2| |#2| |#2|) "\\spad{besselI(x,y)} returns the besseli function applied to \\spad{x} and \\spad{y}")) (|besselY| ((|#2| |#2| |#2|) "\\spad{besselY(x,y)} returns the bessely function applied to \\spad{x} and \\spad{y}")) (|besselJ| ((|#2| |#2| |#2|) "\\spad{besselJ(x,y)} returns the besselj function applied to \\spad{x} and \\spad{y}")) (|polygamma| ((|#2| |#2| |#2|) "\\spad{polygamma(x,y)} returns the polygamma function applied to \\spad{x} and \\spad{y}")) (|digamma| ((|#2| |#2|) "\\spad{digamma(x)} returns the digamma function applied to \\spad{x}")) (|Beta| ((|#2| |#2| |#2|) "\\spad{Beta(x,y)} returns the beta function applied to \\spad{x} and \\spad{y}")) (|Gamma| ((|#2| |#2| |#2|) "\\spad{Gamma(a,x)} returns the incomplete Gamma function applied to a and \\spad{x}") ((|#2| |#2|) "\\spad{Gamma(f)} returns the formal Gamma function applied to \\spad{f}")) (|abs| ((|#2| |#2|) "\\spad{abs(f)} returns the absolute value operator applied to \\spad{f}")) (|operator| (((|BasicOperator|) (|BasicOperator|)) "\\spad{operator(op)} returns a copy of \\spad{op} with the domain-dependent properties appropriate for \\spad{F}; error if \\spad{op} is not a special function operator")) (|belong?| (((|Boolean|) (|BasicOperator|)) "\\spad{belong?(op)} is \\spad{true} if \\spad{op} is a special function operator."))) 
 NIL 
 NIL 
-(-444 R -1967) 
+(-444 R -1966) 
 ((|constructor| (NIL "FunctionsSpacePrimitiveElement provides functions to compute primitive elements in functions spaces.")) (|primitiveElement| (((|Record| (|:| |primelt| |#2|) (|:| |pol1| (|SparseUnivariatePolynomial| |#2|)) (|:| |pol2| (|SparseUnivariatePolynomial| |#2|)) (|:| |prim| (|SparseUnivariatePolynomial| |#2|))) |#2| |#2|) "\\spad{primitiveElement(a1, a2)} returns \\spad{[a, q1, q2, q]} such that \\spad{k(a1, a2) = k(a)},{} \\spad{ai = qi(a)},{} and \\spad{q(a) = 0}. The minimal polynomial for a2 may involve \\spad{a1},{} but the minimal polynomial for \\spad{a1} may not involve a2; This operations uses \\spadfun{resultant}.") (((|Record| (|:| |primelt| |#2|) (|:| |poly| (|List| (|SparseUnivariatePolynomial| |#2|))) (|:| |prim| (|SparseUnivariatePolynomial| |#2|))) (|List| |#2|)) "\\spad{primitiveElement([a1,...,an])} returns \\spad{[a, [q1,...,qn], q]} such that then \\spad{k(a1,...,an) = k(a)},{} \\spad{ai = qi(a)},{} and \\spad{q(a) = 0}. This operation uses the technique of \\spadglossSee{groebner bases}{Groebner basis}."))) 
 NIL 
 ((|HasCategory| |#2| (QUOTE (-27)))) 
-(-445 R -1967) 
+(-445 R -1966) 
 ((|constructor| (NIL "This package provides function which replaces transcendental kernels in a function space by random integers. The correspondence between the kernels and the integers is fixed between calls to new().")) (|newReduc| (((|Void|)) "\\spad{newReduc()} \\undocumented")) (|bringDown| (((|SparseUnivariatePolynomial| (|Fraction| (|Integer|))) |#2| (|Kernel| |#2|)) "\\spad{bringDown(f,k)} \\undocumented") (((|Fraction| (|Integer|)) |#2|) "\\spad{bringDown(f)} \\undocumented"))) 
 NIL 
 NIL 
@@ -1716,7 +1716,7 @@ NIL
 ((|constructor| (NIL "Creates and manipulates objects which correspond to the basic FORTRAN data types: REAL,{} INTEGER,{} COMPLEX,{} LOGICAL and CHARACTER")) (= (((|Boolean|) $ $) "\\spad{x=y} tests for equality")) (|logical?| (((|Boolean|) $) "\\spad{logical?(t)} tests whether \\spad{t} is equivalent to the FORTRAN type LOGICAL.")) (|character?| (((|Boolean|) $) "\\spad{character?(t)} tests whether \\spad{t} is equivalent to the FORTRAN type CHARACTER.")) (|doubleComplex?| (((|Boolean|) $) "\\spad{doubleComplex?(t)} tests whether \\spad{t} is equivalent to the (non-standard) FORTRAN type DOUBLE COMPLEX.")) (|complex?| (((|Boolean|) $) "\\spad{complex?(t)} tests whether \\spad{t} is equivalent to the FORTRAN type COMPLEX.")) (|integer?| (((|Boolean|) $) "\\spad{integer?(t)} tests whether \\spad{t} is equivalent to the FORTRAN type INTEGER.")) (|double?| (((|Boolean|) $) "\\spad{double?(t)} tests whether \\spad{t} is equivalent to the FORTRAN type DOUBLE PRECISION")) (|real?| (((|Boolean|) $) "\\spad{real?(t)} tests whether \\spad{t} is equivalent to the FORTRAN type REAL.")) (|coerce| (((|SExpression|) $) "\\spad{coerce(x)} returns the \\spad{s}-expression associated with \\spad{x}") (((|Symbol|) $) "\\spad{coerce(x)} returns the symbol associated with \\spad{x}") (($ (|Symbol|)) "\\spad{coerce(s)} transforms the symbol \\spad{s} into an element of FortranScalarType provided \\spad{s} is one of real,{} complex,{}double precision,{} logical,{} integer,{} character,{} REAL,{} COMPLEX,{} LOGICAL,{} INTEGER,{} CHARACTER,{} DOUBLE PRECISION") (($ (|String|)) "\\spad{coerce(s)} transforms the string \\spad{s} into an element of FortranScalarType provided \\spad{s} is one of \"real\",{} \"double precision\",{} \"complex\",{} \"logical\",{} \"integer\",{} \"character\",{} \"REAL\",{} \"COMPLEX\",{} \"LOGICAL\",{} \"INTEGER\",{} \"CHARACTER\",{} \"DOUBLE PRECISION\""))) 
 NIL 
 NIL 
-(-447 R -1967 UP) 
+(-447 R -1966 UP) 
 ((|constructor| (NIL "\\indented{1}{Used internally by IR2F} Author: Manuel Bronstein Date Created: 12 May 1988 Date Last Updated: 22 September 1993 Keywords: function,{} space,{} polynomial,{} factoring")) (|anfactor| (((|Union| (|Factored| (|SparseUnivariatePolynomial| (|AlgebraicNumber|))) "failed") |#3|) "\\spad{anfactor(p)} tries to factor \\spad{p} over algebraic numbers,{} returning \"failed\" if it cannot")) (|UP2ifCan| (((|Union| (|:| |overq| (|SparseUnivariatePolynomial| (|Fraction| (|Integer|)))) (|:| |overan| (|SparseUnivariatePolynomial| (|AlgebraicNumber|))) (|:| |failed| (|Boolean|))) |#3|) "\\spad{UP2ifCan(x)} should be local but conditional.")) (|qfactor| (((|Union| (|Factored| (|SparseUnivariatePolynomial| (|Fraction| (|Integer|)))) "failed") |#3|) "\\spad{qfactor(p)} tries to factor \\spad{p} over fractions of integers,{} returning \"failed\" if it cannot")) (|ffactor| (((|Factored| |#3|) |#3|) "\\spad{ffactor(p)} tries to factor a univariate polynomial \\spad{p} over \\spad{F}"))) 
 NIL 
 ((|HasCategory| |#2| (LIST (QUOTE -1057) (QUOTE (-48))))) 
@@ -1748,7 +1748,7 @@ NIL
 ((|constructor| (NIL "\\spadtype{GaloisGroupFactorizer} provides functions to factor resolvents.")) (|btwFact| (((|Record| (|:| |contp| (|Integer|)) (|:| |factors| (|List| (|Record| (|:| |irr| |#1|) (|:| |pow| (|Integer|)))))) |#1| (|Boolean|) (|Set| (|NonNegativeInteger|)) (|NonNegativeInteger|)) "\\spad{btwFact(p,sqf,pd,r)} returns the factorization of \\spad{p},{} the result is a Record such that \\spad{contp=}content \\spad{p},{} \\spad{factors=}List of irreducible factors of \\spad{p} with exponent. If \\spad{sqf=true} the polynomial is assumed to be square free (\\spadignore{i.e.} without repeated factors). \\spad{pd} is the \\spadtype{Set} of possible degrees. \\spad{r} is a lower bound for the number of factors of \\spad{p}. Please do not use this function in your code because its design may change.")) (|henselFact| (((|Record| (|:| |contp| (|Integer|)) (|:| |factors| (|List| (|Record| (|:| |irr| |#1|) (|:| |pow| (|Integer|)))))) |#1| (|Boolean|)) "\\spad{henselFact(p,sqf)} returns the factorization of \\spad{p},{} the result is a Record such that \\spad{contp=}content \\spad{p},{} \\spad{factors=}List of irreducible factors of \\spad{p} with exponent. If \\spad{sqf=true} the polynomial is assumed to be square free (\\spadignore{i.e.} without repeated factors).")) (|factorOfDegree| (((|Union| |#1| "failed") (|PositiveInteger|) |#1| (|List| (|NonNegativeInteger|)) (|NonNegativeInteger|) (|Boolean|)) "\\spad{factorOfDegree(d,p,listOfDegrees,r,sqf)} returns a factor of \\spad{p} of degree \\spad{d} knowing that \\spad{p} has for possible splitting of its degree \\spad{listOfDegrees},{} and that \\spad{p} has at least \\spad{r} factors. If \\spad{sqf=true} the polynomial is assumed to be square free (\\spadignore{i.e.} without repeated factors).") (((|Union| |#1| "failed") (|PositiveInteger|) |#1| (|List| (|NonNegativeInteger|)) (|NonNegativeInteger|)) "\\spad{factorOfDegree(d,p,listOfDegrees,r)} returns a factor of \\spad{p} of degree \\spad{d} knowing that \\spad{p} has for possible splitting of its degree \\spad{listOfDegrees},{} and that \\spad{p} has at least \\spad{r} factors.") (((|Union| |#1| "failed") (|PositiveInteger|) |#1| (|List| (|NonNegativeInteger|))) "\\spad{factorOfDegree(d,p,listOfDegrees)} returns a factor of \\spad{p} of degree \\spad{d} knowing that \\spad{p} has for possible splitting of its degree \\spad{listOfDegrees}.") (((|Union| |#1| "failed") (|PositiveInteger|) |#1| (|NonNegativeInteger|)) "\\spad{factorOfDegree(d,p,r)} returns a factor of \\spad{p} of degree \\spad{d} knowing that \\spad{p} has at least \\spad{r} factors.") (((|Union| |#1| "failed") (|PositiveInteger|) |#1|) "\\spad{factorOfDegree(d,p)} returns a factor of \\spad{p} of degree \\spad{d}.")) (|factorSquareFree| (((|Factored| |#1|) |#1| (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{factorSquareFree(p,d,r)} factorizes the polynomial \\spad{p} using the single factor bound algorithm,{} knowing that \\spad{d} divides the degree of all factors of \\spad{p} and that \\spad{p} has at least \\spad{r} factors. \\spad{f} is supposed not having any repeated factor (this is not checked).") (((|Factored| |#1|) |#1| (|List| (|NonNegativeInteger|)) (|NonNegativeInteger|)) "\\spad{factorSquareFree(p,listOfDegrees,r)} factorizes the polynomial \\spad{p} using the single factor bound algorithm,{} knowing that \\spad{p} has for possible splitting of its degree \\spad{listOfDegrees} and that \\spad{p} has at least \\spad{r} factors. \\spad{f} is supposed not having any repeated factor (this is not checked).") (((|Factored| |#1|) |#1| (|List| (|NonNegativeInteger|))) "\\spad{factorSquareFree(p,listOfDegrees)} factorizes the polynomial \\spad{p} using the single factor bound algorithm and knowing that \\spad{p} has for possible splitting of its degree \\spad{listOfDegrees}. \\spad{f} is supposed not having any repeated factor (this is not checked).") (((|Factored| |#1|) |#1| (|NonNegativeInteger|)) "\\spad{factorSquareFree(p,r)} factorizes the polynomial \\spad{p} using the single factor bound algorithm and knowing that \\spad{p} has at least \\spad{r} factors. \\spad{f} is supposed not having any repeated factor (this is not checked).") (((|Factored| |#1|) |#1|) "\\spad{factorSquareFree(p)} returns the factorization of \\spad{p} which is supposed not having any repeated factor (this is not checked).")) (|factor| (((|Factored| |#1|) |#1| (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{factor(p,d,r)} factorizes the polynomial \\spad{p} using the single factor bound algorithm,{} knowing that \\spad{d} divides the degree of all factors of \\spad{p} and that \\spad{p} has at least \\spad{r} factors.") (((|Factored| |#1|) |#1| (|List| (|NonNegativeInteger|)) (|NonNegativeInteger|)) "\\spad{factor(p,listOfDegrees,r)} factorizes the polynomial \\spad{p} using the single factor bound algorithm,{} knowing that \\spad{p} has for possible splitting of its degree \\spad{listOfDegrees} and that \\spad{p} has at least \\spad{r} factors.") (((|Factored| |#1|) |#1| (|List| (|NonNegativeInteger|))) "\\spad{factor(p,listOfDegrees)} factorizes the polynomial \\spad{p} using the single factor bound algorithm and knowing that \\spad{p} has for possible splitting of its degree \\spad{listOfDegrees}.") (((|Factored| |#1|) |#1| (|NonNegativeInteger|)) "\\spad{factor(p,r)} factorizes the polynomial \\spad{p} using the single factor bound algorithm and knowing that \\spad{p} has at least \\spad{r} factors.") (((|Factored| |#1|) |#1|) "\\spad{factor(p)} returns the factorization of \\spad{p} over the integers.")) (|tryFunctionalDecomposition| (((|Boolean|) (|Boolean|)) "\\spad{tryFunctionalDecomposition(b)} chooses whether factorizers have to look for functional decomposition of polynomials (\\spad{true}) or not (\\spad{false}). Returns the previous value.")) (|tryFunctionalDecomposition?| (((|Boolean|)) "\\spad{tryFunctionalDecomposition?()} returns \\spad{true} if factorizers try functional decomposition of polynomials before factoring them.")) (|eisensteinIrreducible?| (((|Boolean|) |#1|) "\\spad{eisensteinIrreducible?(p)} returns \\spad{true} if \\spad{p} can be shown to be irreducible by Eisenstein\\spad{'s} criterion,{} \\spad{false} is inconclusive.")) (|useEisensteinCriterion| (((|Boolean|) (|Boolean|)) "\\spad{useEisensteinCriterion(b)} chooses whether factorizers check Eisenstein\\spad{'s} criterion before factoring: \\spad{true} for using it,{} \\spad{false} else. Returns the previous value.")) (|useEisensteinCriterion?| (((|Boolean|)) "\\spad{useEisensteinCriterion?()} returns \\spad{true} if factorizers check Eisenstein\\spad{'s} criterion before factoring.")) (|useSingleFactorBound| (((|Boolean|) (|Boolean|)) "\\spad{useSingleFactorBound(b)} chooses the algorithm to be used by the factorizers: \\spad{true} for algorithm with single factor bound,{} \\spad{false} for algorithm with overall bound. Returns the previous value.")) (|useSingleFactorBound?| (((|Boolean|)) "\\spad{useSingleFactorBound?()} returns \\spad{true} if algorithm with single factor bound is used for factorization,{} \\spad{false} for algorithm with overall bound.")) (|modularFactor| (((|Record| (|:| |prime| (|Integer|)) (|:| |factors| (|List| |#1|))) |#1|) "\\spad{modularFactor(f)} chooses a \"good\" prime and returns the factorization of \\spad{f} modulo this prime in a form that may be used by \\spadfunFrom{completeHensel}{GeneralHenselPackage}. If prime is zero it means that \\spad{f} has been proved to be irreducible over the integers or that \\spad{f} is a unit (\\spadignore{i.e.} 1 or \\spad{-1}). \\spad{f} shall be primitive (\\spadignore{i.e.} content(\\spad{p})\\spad{=1}) and square free (\\spadignore{i.e.} without repeated factors).")) (|numberOfFactors| (((|NonNegativeInteger|) (|List| (|Record| (|:| |factor| |#1|) (|:| |degree| (|Integer|))))) "\\spad{numberOfFactors(ddfactorization)} returns the number of factors of the polynomial \\spad{f} modulo \\spad{p} where \\spad{ddfactorization} is the distinct degree factorization of \\spad{f} computed by \\spadfunFrom{ddFact}{ModularDistinctDegreeFactorizer} for some prime \\spad{p}.")) (|stopMusserTrials| (((|PositiveInteger|) (|PositiveInteger|)) "\\spad{stopMusserTrials(n)} sets to \\spad{n} the bound on the number of factors for which \\spadfun{modularFactor} stops to look for an other prime. You will have to remember that the step of recombining the extraneous factors may take up to \\spad{2**n} trials. Returns the previous value.") (((|PositiveInteger|)) "\\spad{stopMusserTrials()} returns the bound on the number of factors for which \\spadfun{modularFactor} stops to look for an other prime. You will have to remember that the step of recombining the extraneous factors may take up to \\spad{2**stopMusserTrials()} trials.")) (|musserTrials| (((|PositiveInteger|) (|PositiveInteger|)) "\\spad{musserTrials(n)} sets to \\spad{n} the number of primes to be tried in \\spadfun{modularFactor} and returns the previous value.") (((|PositiveInteger|)) "\\spad{musserTrials()} returns the number of primes that are tried in \\spadfun{modularFactor}.")) (|degreePartition| (((|Multiset| (|NonNegativeInteger|)) (|List| (|Record| (|:| |factor| |#1|) (|:| |degree| (|Integer|))))) "\\spad{degreePartition(ddfactorization)} returns the degree partition of the polynomial \\spad{f} modulo \\spad{p} where \\spad{ddfactorization} is the distinct degree factorization of \\spad{f} computed by \\spadfunFrom{ddFact}{ModularDistinctDegreeFactorizer} for some prime \\spad{p}.")) (|makeFR| (((|Factored| |#1|) (|Record| (|:| |contp| (|Integer|)) (|:| |factors| (|List| (|Record| (|:| |irr| |#1|) (|:| |pow| (|Integer|))))))) "\\spad{makeFR(flist)} turns the final factorization of henselFact into a \\spadtype{Factored} object."))) 
 NIL 
 NIL 
-(-455 R UP -1967) 
+(-455 R UP -1966) 
 ((|constructor| (NIL "\\spadtype{GaloisGroupFactorizationUtilities} provides functions that will be used by the factorizer.")) (|length| ((|#3| |#2|) "\\spad{length(p)} returns the sum of the absolute values of the coefficients of the polynomial \\spad{p}.")) (|height| ((|#3| |#2|) "\\spad{height(p)} returns the maximal absolute value of the coefficients of the polynomial \\spad{p}.")) (|infinityNorm| ((|#3| |#2|) "\\spad{infinityNorm(f)} returns the maximal absolute value of the coefficients of the polynomial \\spad{f}.")) (|quadraticNorm| ((|#3| |#2|) "\\spad{quadraticNorm(f)} returns the \\spad{l2} norm of the polynomial \\spad{f}.")) (|norm| ((|#3| |#2| (|PositiveInteger|)) "\\spad{norm(f,p)} returns the \\spad{lp} norm of the polynomial \\spad{f}.")) (|singleFactorBound| (((|Integer|) |#2|) "\\spad{singleFactorBound(p,r)} returns a bound on the infinite norm of the factor of \\spad{p} with smallest Bombieri\\spad{'s} norm. \\spad{p} shall be of degree higher or equal to 2.") (((|Integer|) |#2| (|NonNegativeInteger|)) "\\spad{singleFactorBound(p,r)} returns a bound on the infinite norm of the factor of \\spad{p} with smallest Bombieri\\spad{'s} norm. \\spad{r} is a lower bound for the number of factors of \\spad{p}. \\spad{p} shall be of degree higher or equal to 2.")) (|rootBound| (((|Integer|) |#2|) "\\spad{rootBound(p)} returns a bound on the largest norm of the complex roots of \\spad{p}.")) (|bombieriNorm| ((|#3| |#2| (|PositiveInteger|)) "\\spad{bombieriNorm(p,n)} returns the \\spad{n}th Bombieri\\spad{'s} norm of \\spad{p}.") ((|#3| |#2|) "\\spad{bombieriNorm(p)} returns quadratic Bombieri\\spad{'s} norm of \\spad{p}.")) (|beauzamyBound| (((|Integer|) |#2|) "\\spad{beauzamyBound(p)} returns a bound on the larger coefficient of any factor of \\spad{p}."))) 
 NIL 
 NIL 
@@ -1860,7 +1860,7 @@ NIL
 ((|constructor| (NIL "GradedModule(\\spad{R},{}\\spad{E}) denotes ``E-graded \\spad{R}-module\\spad{''},{} \\spadignore{i.e.} collection of \\spad{R}-modules indexed by an abelian monoid \\spad{E}. An element \\spad{g} of \\spad{G[s]} for some specific \\spad{s} in \\spad{E} is said to be an element of \\spad{G} with {\\em degree} \\spad{s}. Sums are defined in each module \\spad{G[s]} so two elements of \\spad{G} have a sum if they have the same degree. \\blankline Morphisms can be defined and composed by degree to give the mathematical category of graded modules.")) (+ (($ $ $) "\\spad{g+h} is the sum of \\spad{g} and \\spad{h} in the module of elements of the same degree as \\spad{g} and \\spad{h}. Error: if \\spad{g} and \\spad{h} have different degrees.")) (- (($ $ $) "\\spad{g-h} is the difference of \\spad{g} and \\spad{h} in the module of elements of the same degree as \\spad{g} and \\spad{h}. Error: if \\spad{g} and \\spad{h} have different degrees.") (($ $) "\\spad{-g} is the additive inverse of \\spad{g} in the module of elements of the same grade as \\spad{g}.")) (* (($ $ |#1|) "\\spad{g*r} is right module multiplication.") (($ |#1| $) "\\spad{r*g} is left module multiplication.")) ((|Zero|) (($) "0 denotes the zero of degree 0.")) (|degree| ((|#2| $) "\\spad{degree(g)} names the degree of \\spad{g}. The set of all elements of a given degree form an \\spad{R}-module."))) 
 NIL 
 NIL 
-(-483 |lv| -1967 R) 
+(-483 |lv| -1966 R) 
 ((|constructor| (NIL "\\indented{1}{Author : \\spad{P}.Gianni,{} Summer \\spad{'88},{} revised November \\spad{'89}} Solve systems of polynomial equations using Groebner bases Total order Groebner bases are computed and then converted to lex ones This package is mostly intended for internal use.")) (|genericPosition| (((|Record| (|:| |dpolys| (|List| (|DistributedMultivariatePolynomial| |#1| |#2|))) (|:| |coords| (|List| (|Integer|)))) (|List| (|DistributedMultivariatePolynomial| |#1| |#2|)) (|List| (|OrderedVariableList| |#1|))) "\\spad{genericPosition(lp,lv)} puts a radical zero dimensional ideal in general position,{} for system \\spad{lp} in variables \\spad{lv}.")) (|testDim| (((|Union| (|List| (|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|)) "failed") (|List| (|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|)) (|List| (|OrderedVariableList| |#1|))) "\\spad{testDim(lp,lv)} tests if the polynomial system \\spad{lp} in variables \\spad{lv} is zero dimensional.")) (|groebSolve| (((|List| (|List| (|DistributedMultivariatePolynomial| |#1| |#2|))) (|List| (|DistributedMultivariatePolynomial| |#1| |#2|)) (|List| (|OrderedVariableList| |#1|))) "\\spad{groebSolve(lp,lv)} reduces the polynomial system \\spad{lp} in variables \\spad{lv} to triangular form. Algorithm based on groebner bases algorithm with linear algebra for change of ordering. Preprocessing for the general solver. The polynomials in input are of type \\spadtype{DMP}."))) 
 NIL 
 NIL 
@@ -1875,7 +1875,7 @@ NIL
 (-486 |Coef| |var| |cen|) 
 ((|constructor| (NIL "This is a category of univariate Puiseux series constructed from univariate Laurent series. A Puiseux series is represented by a pair \\spad{[r,f(x)]},{} where \\spad{r} is a positive rational number and \\spad{f(x)} is a Laurent series. This pair represents the Puiseux series \\spad{f(x\\^r)}.")) (|integrate| (($ $ (|Variable| |#2|)) "\\spad{integrate(f(x))} returns an anti-derivative of the power series \\spad{f(x)} with constant coefficient 0. We may integrate a series when we can divide coefficients by integers.")) (|coerce| (($ (|UnivariatePuiseuxSeries| |#1| |#2| |#3|)) "\\spad{coerce(f)} converts a Puiseux series to a general power series.") (($ (|Variable| |#2|)) "\\spad{coerce(var)} converts the series variable \\spad{var} into a Puiseux series."))) 
 (((-4464 "*") |has| |#1| (-174)) (-4455 |has| |#1| (-568)) (-4460 |has| |#1| (-374)) (-4454 |has| |#1| (-374)) (-4456 . T) (-4457 . T) (-4459 . T)) 
-((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-174))) (-2781 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-568)))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (-12 (|HasCategory| |#1| (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -419) (QUOTE (-576))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -419) (QUOTE (-576))) (|devaluate| |#1|)))) (|HasCategory| (-419 (-576)) (QUOTE (-1131))) (|HasCategory| |#1| (QUOTE (-374))) (-2781 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#1| (QUOTE (-568)))) (-2781 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#1| (QUOTE (-568)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -419) (QUOTE (-576)))))) (|HasSignature| |#1| (LIST (QUOTE -3581) (LIST (|devaluate| |#1|) (QUOTE (-1195)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -419) (QUOTE (-576)))))) (-2781 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-976))) (|HasCategory| |#1| (QUOTE (-1221))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasSignature| |#1| (LIST (QUOTE -3009) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1195))))) (|HasSignature| |#1| (LIST (QUOTE -1935) (LIST (LIST (QUOTE -656) (QUOTE (-1195))) (|devaluate| |#1|))))))) 
+((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-174))) (-2781 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-568)))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (-12 (|HasCategory| |#1| (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -419) (QUOTE (-576))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -419) (QUOTE (-576))) (|devaluate| |#1|)))) (|HasCategory| (-419 (-576)) (QUOTE (-1131))) (|HasCategory| |#1| (QUOTE (-374))) (-2781 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#1| (QUOTE (-568)))) (-2781 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#1| (QUOTE (-568)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -419) (QUOTE (-576)))))) (|HasSignature| |#1| (LIST (QUOTE -3581) (LIST (|devaluate| |#1|) (QUOTE (-1195)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -419) (QUOTE (-576)))))) (-2781 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-976))) (|HasCategory| |#1| (QUOTE (-1221))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasSignature| |#1| (LIST (QUOTE -4121) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1195))))) (|HasSignature| |#1| (LIST (QUOTE -1934) (LIST (LIST (QUOTE -656) (QUOTE (-1195))) (|devaluate| |#1|))))))) 
 (-487 |Key| |Entry| |Tbl| |dent|) 
 ((|constructor| (NIL "A sparse table has a default entry,{} which is returned if no other value has been explicitly stored for a key."))) 
 ((-4463 . T)) 
@@ -1916,7 +1916,7 @@ NIL
 ((|constructor| (NIL "Heap implemented in a flexible array to allow for insertions")) (|heap| (($ (|List| |#1|)) "\\spad{heap(ls)} creates a heap of elements consisting of the elements of \\spad{ls}."))) 
 ((-4462 . T) (-4463 . T)) 
 ((-12 (|HasCategory| |#1| (QUOTE (-1119))) (|HasCategory| |#1| (LIST (QUOTE -319) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1119))) (-2781 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1119)))) (-2781 (-12 (|HasCategory| |#1| (QUOTE (-1119))) (|HasCategory| |#1| (LIST (QUOTE -319) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -625) (QUOTE (-874))))) (|HasCategory| |#1| (LIST (QUOTE -625) (QUOTE (-874)))) (|HasCategory| |#1| (QUOTE (-102)))) 
-(-497 -1967 UP UPUP R) 
+(-497 -1966 UP UPUP R) 
 ((|constructor| (NIL "This domains implements finite rational divisors on an hyperelliptic curve,{} that is finite formal sums SUM(\\spad{n} * \\spad{P}) where the \\spad{n}\\spad{'s} are integers and the \\spad{P}\\spad{'s} are finite rational points on the curve. The equation of the curve must be \\spad{y^2} = \\spad{f}(\\spad{x}) and \\spad{f} must have odd degree."))) 
 NIL 
 NIL 
@@ -1952,7 +1952,7 @@ NIL
 ((|constructor| (NIL "Category for the hyperbolic trigonometric functions.")) (|tanh| (($ $) "\\spad{tanh(x)} returns the hyperbolic tangent of \\spad{x}.")) (|sinh| (($ $) "\\spad{sinh(x)} returns the hyperbolic sine of \\spad{x}.")) (|sech| (($ $) "\\spad{sech(x)} returns the hyperbolic secant of \\spad{x}.")) (|csch| (($ $) "\\spad{csch(x)} returns the hyperbolic cosecant of \\spad{x}.")) (|coth| (($ $) "\\spad{coth(x)} returns the hyperbolic cotangent of \\spad{x}.")) (|cosh| (($ $) "\\spad{cosh(x)} returns the hyperbolic cosine of \\spad{x}."))) 
 NIL 
 NIL 
-(-506 -1967 UP |AlExt| |AlPol|) 
+(-506 -1966 UP |AlExt| |AlPol|) 
 ((|constructor| (NIL "Factorization of univariate polynomials with coefficients in an algebraic extension of a field over which we can factor UP\\spad{'s}.")) (|factor| (((|Factored| |#4|) |#4| (|Mapping| (|Factored| |#2|) |#2|)) "\\spad{factor(p, f)} returns a prime factorisation of \\spad{p}; \\spad{f} is a factorisation map for elements of UP."))) 
 NIL 
 NIL 
@@ -1972,7 +1972,7 @@ NIL
 ((|constructor| (NIL "\\indented{1}{Author: Clifton Williamson} Date Created: 9 August 1993 Date Last Updated: 3 December 1993 Basic Operations: chineseRemainder,{} factorList Related Domains: PAdicWildFunctionFieldIntegralBasis(\\spad{K},{}\\spad{R},{}UP,{}\\spad{F}) Also See: WildFunctionFieldIntegralBasis,{} FunctionFieldIntegralBasis AMS Classifications: Keywords: function field,{} finite field,{} integral basis Examples: References: Description:")) (|chineseRemainder| (((|Record| (|:| |basis| (|Matrix| |#2|)) (|:| |basisDen| |#2|) (|:| |basisInv| (|Matrix| |#2|))) (|List| |#3|) (|List| (|Record| (|:| |basis| (|Matrix| |#2|)) (|:| |basisDen| |#2|) (|:| |basisInv| (|Matrix| |#2|)))) (|NonNegativeInteger|)) "\\spad{chineseRemainder(lu,lr,n)} \\undocumented")) (|listConjugateBases| (((|List| (|Record| (|:| |basis| (|Matrix| |#2|)) (|:| |basisDen| |#2|) (|:| |basisInv| (|Matrix| |#2|)))) (|Record| (|:| |basis| (|Matrix| |#2|)) (|:| |basisDen| |#2|) (|:| |basisInv| (|Matrix| |#2|))) (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{listConjugateBases(bas,q,n)} returns the list \\spad{[bas,bas^Frob,bas^(Frob^2),...bas^(Frob^(n-1))]},{} where \\spad{Frob} raises the coefficients of all polynomials appearing in the basis \\spad{bas} to the \\spad{q}th power.")) (|factorList| (((|List| (|SparseUnivariatePolynomial| |#1|)) |#1| (|NonNegativeInteger|) (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{factorList(k,n,m,j)} \\undocumented"))) 
 NIL 
 NIL 
-(-511 R UP -1967) 
+(-511 R UP -1966) 
 ((|constructor| (NIL "This package contains functions used in the packages FunctionFieldIntegralBasis and NumberFieldIntegralBasis.")) (|moduleSum| (((|Record| (|:| |basis| (|Matrix| |#1|)) (|:| |basisDen| |#1|) (|:| |basisInv| (|Matrix| |#1|))) (|Record| (|:| |basis| (|Matrix| |#1|)) (|:| |basisDen| |#1|) (|:| |basisInv| (|Matrix| |#1|))) (|Record| (|:| |basis| (|Matrix| |#1|)) (|:| |basisDen| |#1|) (|:| |basisInv| (|Matrix| |#1|)))) "\\spad{moduleSum(m1,m2)} returns the sum of two modules in the framed algebra \\spad{F}. Each module \\spad{mi} is represented as follows: \\spad{F} is a framed algebra with \\spad{R}-module basis \\spad{w1,w2,...,wn} and \\spad{mi} is a record \\spad{[basis,basisDen,basisInv]}. If \\spad{basis} is the matrix \\spad{(aij, i = 1..n, j = 1..n)},{} then a basis \\spad{v1,...,vn} for \\spad{mi} is given by \\spad{vi = (1/basisDen) * sum(aij * wj, j = 1..n)},{} \\spadignore{i.e.} the \\spad{i}th row of 'basis' contains the coordinates of the \\spad{i}th basis vector. Similarly,{} the \\spad{i}th row of the matrix \\spad{basisInv} contains the coordinates of \\spad{wi} with respect to the basis \\spad{v1,...,vn}: if \\spad{basisInv} is the matrix \\spad{(bij, i = 1..n, j = 1..n)},{} then \\spad{wi = sum(bij * vj, j = 1..n)}.")) (|idealiserMatrix| (((|Matrix| |#1|) (|Matrix| |#1|) (|Matrix| |#1|)) "\\spad{idealiserMatrix(m1, m2)} returns the matrix representing the linear conditions on the Ring associatied with an ideal defined by \\spad{m1} and \\spad{m2}.")) (|idealiser| (((|Matrix| |#1|) (|Matrix| |#1|) (|Matrix| |#1|) |#1|) "\\spad{idealiser(m1,m2,d)} computes the order of an ideal defined by \\spad{m1} and \\spad{m2} where \\spad{d} is the known part of the denominator") (((|Matrix| |#1|) (|Matrix| |#1|) (|Matrix| |#1|)) "\\spad{idealiser(m1,m2)} computes the order of an ideal defined by \\spad{m1} and \\spad{m2}")) (|leastPower| (((|NonNegativeInteger|) (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{leastPower(p,n)} returns \\spad{e},{} where \\spad{e} is the smallest integer such that \\spad{p **e >= n}")) (|divideIfCan!| ((|#1| (|Matrix| |#1|) (|Matrix| |#1|) |#1| (|Integer|)) "\\spad{divideIfCan!(matrix,matrixOut,prime,n)} attempts to divide the entries of \\spad{matrix} by \\spad{prime} and store the result in \\spad{matrixOut}. If it is successful,{} 1 is returned and if not,{} \\spad{prime} is returned. Here both \\spad{matrix} and \\spad{matrixOut} are \\spad{n}-by-\\spad{n} upper triangular matrices.")) (|matrixGcd| ((|#1| (|Matrix| |#1|) |#1| (|NonNegativeInteger|)) "\\spad{matrixGcd(mat,sing,n)} is \\spad{gcd(sing,g)} where \\spad{g} is the \\spad{gcd} of the entries of the \\spad{n}-by-\\spad{n} upper-triangular matrix \\spad{mat}.")) (|diagonalProduct| ((|#1| (|Matrix| |#1|)) "\\spad{diagonalProduct(m)} returns the product of the elements on the diagonal of the matrix \\spad{m}")) (|squareFree| (((|Factored| $) $) "\\spad{squareFree(x)} returns a square-free factorisation of \\spad{x}"))) 
 NIL 
 NIL 
@@ -1992,7 +1992,7 @@ NIL
 ((|constructor| (NIL "InnerCommonDenominator provides functions to compute the common denominator of a finite linear aggregate of elements of the quotient field of an integral domain.")) (|splitDenominator| (((|Record| (|:| |num| |#3|) (|:| |den| |#1|)) |#4|) "\\spad{splitDenominator([q1,...,qn])} returns \\spad{[[p1,...,pn], d]} such that \\spad{qi = pi/d} and \\spad{d} is a common denominator for the \\spad{qi}\\spad{'s}.")) (|clearDenominator| ((|#3| |#4|) "\\spad{clearDenominator([q1,...,qn])} returns \\spad{[p1,...,pn]} such that \\spad{qi = pi/d} where \\spad{d} is a common denominator for the \\spad{qi}\\spad{'s}.")) (|commonDenominator| ((|#1| |#4|) "\\spad{commonDenominator([q1,...,qn])} returns a common denominator \\spad{d} for \\spad{q1},{}...,{}\\spad{qn}."))) 
 NIL 
 NIL 
-(-516 -1967 |Expon| |VarSet| |DPoly|) 
+(-516 -1966 |Expon| |VarSet| |DPoly|) 
 ((|constructor| (NIL "This domain represents polynomial ideals with coefficients in any field and supports the basic ideal operations,{} including intersection sum and quotient. An ideal is represented by a list of polynomials (the generators of the ideal) and a boolean that is \\spad{true} if the generators are a Groebner basis. The algorithms used are based on Groebner basis computations. The ordering is determined by the datatype of the input polynomials. Users may use refinements of total degree orderings.")) (|relationsIdeal| (((|SuchThat| (|List| (|Polynomial| |#1|)) (|List| (|Equation| (|Polynomial| |#1|)))) (|List| |#4|)) "\\spad{relationsIdeal(polyList)} returns the ideal of relations among the polynomials in \\spad{polyList}.")) (|saturate| (($ $ |#4| (|List| |#3|)) "\\spad{saturate(I,f,lvar)} is the saturation with respect to the prime principal ideal which is generated by \\spad{f} in the polynomial ring \\spad{F[lvar]}.") (($ $ |#4|) "\\spad{saturate(I,f)} is the saturation of the ideal \\spad{I} with respect to the multiplicative set generated by the polynomial \\spad{f}.")) (|coerce| (($ (|List| |#4|)) "\\spad{coerce(polyList)} converts the list of polynomials \\spad{polyList} to an ideal.")) (|generators| (((|List| |#4|) $) "\\spad{generators(I)} returns a list of generators for the ideal \\spad{I}.")) (|groebner?| (((|Boolean|) $) "\\spad{groebner?(I)} tests if the generators of the ideal \\spad{I} are a Groebner basis.")) (|groebnerIdeal| (($ (|List| |#4|)) "\\spad{groebnerIdeal(polyList)} constructs the ideal generated by the list of polynomials \\spad{polyList} which are assumed to be a Groebner basis. Note: this operation avoids a Groebner basis computation.")) (|ideal| (($ (|List| |#4|)) "\\spad{ideal(polyList)} constructs the ideal generated by the list of polynomials \\spad{polyList}.")) (|leadingIdeal| (($ $) "\\spad{leadingIdeal(I)} is the ideal generated by the leading terms of the elements of the ideal \\spad{I}.")) (|dimension| (((|Integer|) $) "\\spad{dimension(I)} gives the dimension of the ideal \\spad{I}. in the ring \\spad{F[lvar]},{} where lvar are the variables appearing in \\spad{I}") (((|Integer|) $ (|List| |#3|)) "\\spad{dimension(I,lvar)} gives the dimension of the ideal \\spad{I},{} in the ring \\spad{F[lvar]}")) (|backOldPos| (($ (|Record| (|:| |mval| (|Matrix| |#1|)) (|:| |invmval| (|Matrix| |#1|)) (|:| |genIdeal| $))) "\\spad{backOldPos(genPos)} takes the result produced by \\spadfunFrom{generalPosition}{PolynomialIdeals} and performs the inverse transformation,{} returning the original ideal \\spad{backOldPos(generalPosition(I,listvar))} = \\spad{I}.")) (|generalPosition| (((|Record| (|:| |mval| (|Matrix| |#1|)) (|:| |invmval| (|Matrix| |#1|)) (|:| |genIdeal| $)) $ (|List| |#3|)) "\\spad{generalPosition(I,listvar)} perform a random linear transformation on the variables in \\spad{listvar} and returns the transformed ideal along with the change of basis matrix.")) (|groebner| (($ $) "\\spad{groebner(I)} returns a set of generators of \\spad{I} that are a Groebner basis for \\spad{I}.")) (|quotient| (($ $ |#4|) "\\spad{quotient(I,f)} computes the quotient of the ideal \\spad{I} by the principal ideal generated by the polynomial \\spad{f},{} \\spad{(I:(f))}.") (($ $ $) "\\spad{quotient(I,J)} computes the quotient of the ideals \\spad{I} and \\spad{J},{} \\spad{(I:J)}.")) (|intersect| (($ (|List| $)) "\\spad{intersect(LI)} computes the intersection of the list of ideals \\spad{LI}.") (($ $ $) "\\spad{intersect(I,J)} computes the intersection of the ideals \\spad{I} and \\spad{J}.")) (|zeroDim?| (((|Boolean|) $) "\\spad{zeroDim?(I)} tests if the ideal \\spad{I} is zero dimensional,{} \\spadignore{i.e.} all its associated primes are maximal,{} in the ring \\spad{F[lvar]},{} where lvar are the variables appearing in \\spad{I}") (((|Boolean|) $ (|List| |#3|)) "\\spad{zeroDim?(I,lvar)} tests if the ideal \\spad{I} is zero dimensional,{} \\spadignore{i.e.} all its associated primes are maximal,{} in the ring \\spad{F[lvar]}")) (|inRadical?| (((|Boolean|) |#4| $) "\\spad{inRadical?(f,I)} tests if some power of the polynomial \\spad{f} belongs to the ideal \\spad{I}.")) (|in?| (((|Boolean|) $ $) "\\spad{in?(I,J)} tests if the ideal \\spad{I} is contained in the ideal \\spad{J}.")) (|element?| (((|Boolean|) |#4| $) "\\spad{element?(f,I)} tests whether the polynomial \\spad{f} belongs to the ideal \\spad{I}.")) (|zero?| (((|Boolean|) $) "\\spad{zero?(I)} tests whether the ideal \\spad{I} is the zero ideal")) (|one?| (((|Boolean|) $) "\\spad{one?(I)} tests whether the ideal \\spad{I} is the unit ideal,{} \\spadignore{i.e.} contains 1.")) (+ (($ $ $) "\\spad{I+J} computes the ideal generated by the union of \\spad{I} and \\spad{J}.")) (** (($ $ (|NonNegativeInteger|)) "\\spad{I**n} computes the \\spad{n}th power of the ideal \\spad{I}.")) (* (($ $ $) "\\spad{I*J} computes the product of the ideal \\spad{I} and \\spad{J}."))) 
 NIL 
 ((|HasCategory| |#3| (LIST (QUOTE -626) (QUOTE (-1195))))) 
@@ -2104,7 +2104,7 @@ NIL
 ((|constructor| (NIL "\\indented{2}{IndexedExponents of an ordered set of variables gives a representation} for the degree of polynomials in commuting variables. It gives an ordered pairing of non negative integer exponents with variables"))) 
 NIL 
 NIL 
-(-544 K -1967 |Par|) 
+(-544 K -1966 |Par|) 
 ((|constructor| (NIL "This package is the inner package to be used by NumericRealEigenPackage and NumericComplexEigenPackage for the computation of numeric eigenvalues and eigenvectors.")) (|innerEigenvectors| (((|List| (|Record| (|:| |outval| |#2|) (|:| |outmult| (|Integer|)) (|:| |outvect| (|List| (|Matrix| |#2|))))) (|Matrix| |#1|) |#3| (|Mapping| (|Factored| (|SparseUnivariatePolynomial| |#1|)) (|SparseUnivariatePolynomial| |#1|))) "\\spad{innerEigenvectors(m,eps,factor)} computes explicitly the eigenvalues and the correspondent eigenvectors of the matrix \\spad{m}. The parameter \\spad{eps} determines the type of the output,{} \\spad{factor} is the univariate factorizer to \\spad{br} used to reduce the characteristic polynomial into irreducible factors.")) (|solve1| (((|List| |#2|) (|SparseUnivariatePolynomial| |#1|) |#3|) "\\spad{solve1(pol, eps)} finds the roots of the univariate polynomial polynomial \\spad{pol} to precision eps. If \\spad{K} is \\spad{Fraction Integer} then only the real roots are returned,{} if \\spad{K} is \\spad{Complex Fraction Integer} then all roots are found.")) (|charpol| (((|SparseUnivariatePolynomial| |#1|) (|Matrix| |#1|)) "\\spad{charpol(m)} computes the characteristic polynomial of a matrix \\spad{m} with entries in \\spad{K}. This function returns a polynomial over \\spad{K},{} while the general one (that is in EiegenPackage) returns Fraction \\spad{P} \\spad{K}"))) 
 NIL 
 NIL 
@@ -2128,7 +2128,7 @@ NIL
 ((|constructor| (NIL "This package computes infinite products of univariate Taylor series over an integral domain of characteristic 0.")) (|generalInfiniteProduct| ((|#2| |#2| (|Integer|) (|Integer|)) "\\spad{generalInfiniteProduct(f(x),a,d)} computes \\spad{product(n=a,a+d,a+2*d,...,f(x**n))}. The series \\spad{f(x)} should have constant coefficient 1.")) (|oddInfiniteProduct| ((|#2| |#2|) "\\spad{oddInfiniteProduct(f(x))} computes \\spad{product(n=1,3,5...,f(x**n))}. The series \\spad{f(x)} should have constant coefficient 1.")) (|evenInfiniteProduct| ((|#2| |#2|) "\\spad{evenInfiniteProduct(f(x))} computes \\spad{product(n=2,4,6...,f(x**n))}. The series \\spad{f(x)} should have constant coefficient 1.")) (|infiniteProduct| ((|#2| |#2|) "\\spad{infiniteProduct(f(x))} computes \\spad{product(n=1,2,3...,f(x**n))}. The series \\spad{f(x)} should have constant coefficient 1."))) 
 NIL 
 NIL 
-(-550 K -1967 |Par|) 
+(-550 K -1966 |Par|) 
 ((|constructor| (NIL "This is an internal package for computing approximate solutions to systems of polynomial equations. The parameter \\spad{K} specifies the coefficient field of the input polynomials and must be either \\spad{Fraction(Integer)} or \\spad{Complex(Fraction Integer)}. The parameter \\spad{F} specifies where the solutions must lie and can be one of the following: \\spad{Float},{} \\spad{Fraction(Integer)},{} \\spad{Complex(Float)},{} \\spad{Complex(Fraction Integer)}. The last parameter specifies the type of the precision operand and must be either \\spad{Fraction(Integer)} or \\spad{Float}.")) (|makeEq| (((|List| (|Equation| (|Polynomial| |#2|))) (|List| |#2|) (|List| (|Symbol|))) "\\spad{makeEq(lsol,lvar)} returns a list of equations formed by corresponding members of \\spad{lvar} and \\spad{lsol}.")) (|innerSolve| (((|List| (|List| |#2|)) (|List| (|Polynomial| |#1|)) (|List| (|Polynomial| |#1|)) (|List| (|Symbol|)) |#3|) "\\spad{innerSolve(lnum,lden,lvar,eps)} returns a list of solutions of the system of polynomials \\spad{lnum},{} with the side condition that none of the members of \\spad{lden} vanish identically on any solution. Each solution is expressed as a list corresponding to the list of variables in \\spad{lvar} and with precision specified by \\spad{eps}.")) (|innerSolve1| (((|List| |#2|) (|Polynomial| |#1|) |#3|) "\\spad{innerSolve1(p,eps)} returns the list of the zeros of the polynomial \\spad{p} with precision \\spad{eps}.") (((|List| |#2|) (|SparseUnivariatePolynomial| |#1|) |#3|) "\\spad{innerSolve1(up,eps)} returns the list of the zeros of the univariate polynomial \\spad{up} with precision \\spad{eps}."))) 
 NIL 
 NIL 
@@ -2180,11 +2180,11 @@ NIL
 ((|constructor| (NIL "This domain is used to provide a conditional \"add\" domain for the implementation of \\spadtype{Table}."))) 
 ((-4462 . T) (-4463 . T)) 
 ((-12 (|HasCategory| (-2 (|:| -4300 |#1|) (|:| -4391 |#2|)) (QUOTE (-1119))) (|HasCategory| (-2 (|:| -4300 |#1|) (|:| -4391 |#2|)) (LIST (QUOTE -319) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -4300) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -4391) (|devaluate| |#2|)))))) (-2781 (|HasCategory| (-2 (|:| -4300 |#1|) (|:| -4391 |#2|)) (QUOTE (-1119))) (|HasCategory| |#2| (QUOTE (-1119)))) (-2781 (|HasCategory| (-2 (|:| -4300 |#1|) (|:| -4391 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -4300 |#1|) (|:| -4391 |#2|)) (QUOTE (-1119))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-1119)))) (-2781 (|HasCategory| (-2 (|:| -4300 |#1|) (|:| -4391 |#2|)) (QUOTE (-1119))) (|HasCategory| (-2 (|:| -4300 |#1|) (|:| -4391 |#2|)) (LIST (QUOTE -625) (QUOTE (-874)))) (|HasCategory| |#2| (QUOTE (-1119))) (|HasCategory| |#2| (LIST (QUOTE -625) (QUOTE (-874))))) (|HasCategory| (-2 (|:| -4300 |#1|) (|:| -4391 |#2|)) (LIST (QUOTE -626) (QUOTE (-548)))) (-12 (|HasCategory| |#2| (QUOTE (-1119))) (|HasCategory| |#2| (LIST (QUOTE -319) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -4300 |#1|) (|:| -4391 |#2|)) (QUOTE (-1119))) (|HasCategory| |#1| (QUOTE (-862))) (|HasCategory| |#2| (QUOTE (-1119))) (-2781 (|HasCategory| (-2 (|:| -4300 |#1|) (|:| -4391 |#2|)) (LIST (QUOTE -625) (QUOTE (-874)))) (|HasCategory| |#2| (LIST (QUOTE -625) (QUOTE (-874))))) (-2781 (|HasCategory| (-2 (|:| -4300 |#1|) (|:| -4391 |#2|)) (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-102)))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (LIST (QUOTE -625) (QUOTE (-874)))) (|HasCategory| (-2 (|:| -4300 |#1|) (|:| -4391 |#2|)) (LIST (QUOTE -625) (QUOTE (-874)))) (|HasCategory| (-2 (|:| -4300 |#1|) (|:| -4391 |#2|)) (QUOTE (-102)))) 
-(-563 R -1967) 
+(-563 R -1966) 
 ((|constructor| (NIL "This package provides functions for the integration of algebraic integrands over transcendental functions.")) (|algint| (((|IntegrationResult| |#2|) |#2| (|Kernel| |#2|) (|Kernel| |#2|) (|Mapping| (|SparseUnivariatePolynomial| |#2|) (|SparseUnivariatePolynomial| |#2|))) "\\spad{algint(f, x, y, d)} returns the integral of \\spad{f(x,y)dx} where \\spad{y} is an algebraic function of \\spad{x}; \\spad{d} is the derivation to use on \\spad{k[x]}."))) 
 NIL 
 NIL 
-(-564 R0 -1967 UP UPUP R) 
+(-564 R0 -1966 UP UPUP R) 
 ((|constructor| (NIL "This package provides functions for integrating a function on an algebraic curve.")) (|palginfieldint| (((|Union| |#5| "failed") |#5| (|Mapping| |#3| |#3|)) "\\spad{palginfieldint(f, d)} returns an algebraic function \\spad{g} such that \\spad{dg = f} if such a \\spad{g} exists,{} \"failed\" otherwise. Argument \\spad{f} must be a pure algebraic function.")) (|palgintegrate| (((|IntegrationResult| |#5|) |#5| (|Mapping| |#3| |#3|)) "\\spad{palgintegrate(f, d)} integrates \\spad{f} with respect to the derivation \\spad{d}. Argument \\spad{f} must be a pure algebraic function.")) (|algintegrate| (((|IntegrationResult| |#5|) |#5| (|Mapping| |#3| |#3|)) "\\spad{algintegrate(f, d)} integrates \\spad{f} with respect to the derivation \\spad{d}."))) 
 NIL 
 NIL 
@@ -2204,7 +2204,7 @@ NIL
 ((|constructor| (NIL "The category of commutative integral domains,{} \\spadignore{i.e.} commutative rings with no zero divisors. \\blankline Conditional attributes: \\indented{2}{canonicalUnitNormal\\tab{20}the canonical field is the same for all associates} \\indented{2}{canonicalsClosed\\tab{20}the product of two canonicals is itself canonical}")) (|unit?| (((|Boolean|) $) "\\spad{unit?(x)} tests whether \\spad{x} is a unit,{} \\spadignore{i.e.} is invertible.")) (|associates?| (((|Boolean|) $ $) "\\spad{associates?(x,y)} tests whether \\spad{x} and \\spad{y} are associates,{} \\spadignore{i.e.} differ by a unit factor.")) (|unitCanonical| (($ $) "\\spad{unitCanonical(x)} returns \\spad{unitNormal(x).canonical}.")) (|unitNormal| (((|Record| (|:| |unit| $) (|:| |canonical| $) (|:| |associate| $)) $) "\\spad{unitNormal(x)} tries to choose a canonical element from the associate class of \\spad{x}. The attribute canonicalUnitNormal,{} if asserted,{} means that the \"canonical\" element is the same across all associates of \\spad{x} if \\spad{unitNormal(x) = [u,c,a]} then \\spad{u*c = x},{} \\spad{a*u = 1}.")) (|exquo| (((|Union| $ "failed") $ $) "\\spad{exquo(a,b)} either returns an element \\spad{c} such that \\spad{c*b=a} or \"failed\" if no such element can be found."))) 
 ((-4455 . T) ((-4464 "*") . T) (-4456 . T) (-4457 . T) (-4459 . T)) 
 NIL 
-(-569 R -1967) 
+(-569 R -1966) 
 ((|constructor| (NIL "This package provides functions for integration,{} limited integration,{} extended integration and the risch differential equation for elemntary functions.")) (|lfextlimint| (((|Union| (|Record| (|:| |ratpart| |#2|) (|:| |coeff| |#2|)) "failed") |#2| (|Symbol|) (|Kernel| |#2|) (|List| (|Kernel| |#2|))) "\\spad{lfextlimint(f,x,k,[k1,...,kn])} returns functions \\spad{[h, c]} such that \\spad{dh/dx = f - c dk/dx}. Value \\spad{h} is looked for in a field containing \\spad{f} and \\spad{k1},{}...,{}\\spad{kn} (the \\spad{ki}\\spad{'s} must be logs).")) (|lfintegrate| (((|IntegrationResult| |#2|) |#2| (|Symbol|)) "\\spad{lfintegrate(f, x)} = \\spad{g} such that \\spad{dg/dx = f}.")) (|lfinfieldint| (((|Union| |#2| "failed") |#2| (|Symbol|)) "\\spad{lfinfieldint(f, x)} returns a function \\spad{g} such that \\spad{dg/dx = f} if \\spad{g} exists,{} \"failed\" otherwise.")) (|lflimitedint| (((|Union| (|Record| (|:| |mainpart| |#2|) (|:| |limitedlogs| (|List| (|Record| (|:| |coeff| |#2|) (|:| |logand| |#2|))))) "failed") |#2| (|Symbol|) (|List| |#2|)) "\\spad{lflimitedint(f,x,[g1,...,gn])} returns functions \\spad{[h,[[ci, gi]]]} such that the \\spad{gi}\\spad{'s} are among \\spad{[g1,...,gn]},{} and \\spad{d(h+sum(ci log(gi)))/dx = f},{} if possible,{} \"failed\" otherwise.")) (|lfextendedint| (((|Union| (|Record| (|:| |ratpart| |#2|) (|:| |coeff| |#2|)) "failed") |#2| (|Symbol|) |#2|) "\\spad{lfextendedint(f, x, g)} returns functions \\spad{[h, c]} such that \\spad{dh/dx = f - cg},{} if (\\spad{h},{} \\spad{c}) exist,{} \"failed\" otherwise."))) 
 NIL 
 NIL 
@@ -2216,7 +2216,7 @@ NIL
 ((|constructor| (NIL "\\blankline")) (|entry| (((|Record| (|:| |endPointContinuity| (|Union| (|:| |continuous| "Continuous at the end points") (|:| |lowerSingular| "There is a singularity at the lower end point") (|:| |upperSingular| "There is a singularity at the upper end point") (|:| |bothSingular| "There are singularities at both end points") (|:| |notEvaluated| "End point continuity not yet evaluated"))) (|:| |singularitiesStream| (|Union| (|:| |str| (|Stream| (|DoubleFloat|))) (|:| |notEvaluated| "Internal singularities not yet evaluated"))) (|:| |range| (|Union| (|:| |finite| "The range is finite") (|:| |lowerInfinite| "The bottom of range is infinite") (|:| |upperInfinite| "The top of range is infinite") (|:| |bothInfinite| "Both top and bottom points are infinite") (|:| |notEvaluated| "Range not yet evaluated")))) (|Record| (|:| |var| (|Symbol|)) (|:| |fn| (|Expression| (|DoubleFloat|))) (|:| |range| (|Segment| (|OrderedCompletion| (|DoubleFloat|)))) (|:| |abserr| (|DoubleFloat|)) (|:| |relerr| (|DoubleFloat|)))) "\\spad{entry(n)} \\undocumented{}")) (|entries| (((|List| (|Record| (|:| |key| (|Record| (|:| |var| (|Symbol|)) (|:| |fn| (|Expression| (|DoubleFloat|))) (|:| |range| (|Segment| (|OrderedCompletion| (|DoubleFloat|)))) (|:| |abserr| (|DoubleFloat|)) (|:| |relerr| (|DoubleFloat|)))) (|:| |entry| (|Record| (|:| |endPointContinuity| (|Union| (|:| |continuous| "Continuous at the end points") (|:| |lowerSingular| "There is a singularity at the lower end point") (|:| |upperSingular| "There is a singularity at the upper end point") (|:| |bothSingular| "There are singularities at both end points") (|:| |notEvaluated| "End point continuity not yet evaluated"))) (|:| |singularitiesStream| (|Union| (|:| |str| (|Stream| (|DoubleFloat|))) (|:| |notEvaluated| "Internal singularities not yet evaluated"))) (|:| |range| (|Union| (|:| |finite| "The range is finite") (|:| |lowerInfinite| "The bottom of range is infinite") (|:| |upperInfinite| "The top of range is infinite") (|:| |bothInfinite| "Both top and bottom points are infinite") (|:| |notEvaluated| "Range not yet evaluated"))))))) $) "\\spad{entries(x)} \\undocumented{}")) (|showAttributes| (((|Union| (|Record| (|:| |endPointContinuity| (|Union| (|:| |continuous| "Continuous at the end points") (|:| |lowerSingular| "There is a singularity at the lower end point") (|:| |upperSingular| "There is a singularity at the upper end point") (|:| |bothSingular| "There are singularities at both end points") (|:| |notEvaluated| "End point continuity not yet evaluated"))) (|:| |singularitiesStream| (|Union| (|:| |str| (|Stream| (|DoubleFloat|))) (|:| |notEvaluated| "Internal singularities not yet evaluated"))) (|:| |range| (|Union| (|:| |finite| "The range is finite") (|:| |lowerInfinite| "The bottom of range is infinite") (|:| |upperInfinite| "The top of range is infinite") (|:| |bothInfinite| "Both top and bottom points are infinite") (|:| |notEvaluated| "Range not yet evaluated")))) "failed") (|Record| (|:| |var| (|Symbol|)) (|:| |fn| (|Expression| (|DoubleFloat|))) (|:| |range| (|Segment| (|OrderedCompletion| (|DoubleFloat|)))) (|:| |abserr| (|DoubleFloat|)) (|:| |relerr| (|DoubleFloat|)))) "\\spad{showAttributes(x)} \\undocumented{}")) (|insert!| (($ (|Record| (|:| |key| (|Record| (|:| |var| (|Symbol|)) (|:| |fn| (|Expression| (|DoubleFloat|))) (|:| |range| (|Segment| (|OrderedCompletion| (|DoubleFloat|)))) (|:| |abserr| (|DoubleFloat|)) (|:| |relerr| (|DoubleFloat|)))) (|:| |entry| (|Record| (|:| |endPointContinuity| (|Union| (|:| |continuous| "Continuous at the end points") (|:| |lowerSingular| "There is a singularity at the lower end point") (|:| |upperSingular| "There is a singularity at the upper end point") (|:| |bothSingular| "There are singularities at both end points") (|:| |notEvaluated| "End point continuity not yet evaluated"))) (|:| |singularitiesStream| (|Union| (|:| |str| (|Stream| (|DoubleFloat|))) (|:| |notEvaluated| "Internal singularities not yet evaluated"))) (|:| |range| (|Union| (|:| |finite| "The range is finite") (|:| |lowerInfinite| "The bottom of range is infinite") (|:| |upperInfinite| "The top of range is infinite") (|:| |bothInfinite| "Both top and bottom points are infinite") (|:| |notEvaluated| "Range not yet evaluated"))))))) "\\spad{insert!(r)} inserts an entry \\spad{r} into theIFTable")) (|fTable| (($ (|List| (|Record| (|:| |key| (|Record| (|:| |var| (|Symbol|)) (|:| |fn| (|Expression| (|DoubleFloat|))) (|:| |range| (|Segment| (|OrderedCompletion| (|DoubleFloat|)))) (|:| |abserr| (|DoubleFloat|)) (|:| |relerr| (|DoubleFloat|)))) (|:| |entry| (|Record| (|:| |endPointContinuity| (|Union| (|:| |continuous| "Continuous at the end points") (|:| |lowerSingular| "There is a singularity at the lower end point") (|:| |upperSingular| "There is a singularity at the upper end point") (|:| |bothSingular| "There are singularities at both end points") (|:| |notEvaluated| "End point continuity not yet evaluated"))) (|:| |singularitiesStream| (|Union| (|:| |str| (|Stream| (|DoubleFloat|))) (|:| |notEvaluated| "Internal singularities not yet evaluated"))) (|:| |range| (|Union| (|:| |finite| "The range is finite") (|:| |lowerInfinite| "The bottom of range is infinite") (|:| |upperInfinite| "The top of range is infinite") (|:| |bothInfinite| "Both top and bottom points are infinite") (|:| |notEvaluated| "Range not yet evaluated")))))))) "\\spad{fTable(l)} creates a functions table from the elements of \\spad{l}.")) (|keys| (((|List| (|Record| (|:| |var| (|Symbol|)) (|:| |fn| (|Expression| (|DoubleFloat|))) (|:| |range| (|Segment| (|OrderedCompletion| (|DoubleFloat|)))) (|:| |abserr| (|DoubleFloat|)) (|:| |relerr| (|DoubleFloat|)))) $) "\\spad{keys(f)} returns the list of keys of \\spad{f}")) (|clearTheFTable| (((|Void|)) "\\spad{clearTheFTable()} clears the current table of functions.")) (|showTheFTable| (($) "\\spad{showTheFTable()} returns the current table of functions."))) 
 NIL 
 NIL 
-(-572 R -1967 L) 
+(-572 R -1966 L) 
 ((|constructor| (NIL "This internal package rationalises integrands on curves of the form: \\indented{2}{\\spad{y\\^2 = a x\\^2 + b x + c}} \\indented{2}{\\spad{y\\^2 = (a x + b) / (c x + d)}} \\indented{2}{\\spad{f(x, y) = 0} where \\spad{f} has degree 1 in \\spad{x}} The rationalization is done for integration,{} limited integration,{} extended integration and the risch differential equation.")) (|palgLODE0| (((|Record| (|:| |particular| (|Union| |#2| "failed")) (|:| |basis| (|List| |#2|))) |#3| |#2| (|Kernel| |#2|) (|Kernel| |#2|) (|Kernel| |#2|) |#2| (|Fraction| (|SparseUnivariatePolynomial| |#2|))) "\\spad{palgLODE0(op,g,x,y,z,t,c)} returns the solution of \\spad{op f = g} Argument \\spad{y} is an algebraic function of \\spad{x} satisfying \\spad{f(x,y)dx = c f(t,y) dy}; \\spad{c} and \\spad{t} are rational functions of \\spad{y}.") (((|Record| (|:| |particular| (|Union| |#2| "failed")) (|:| |basis| (|List| |#2|))) |#3| |#2| (|Kernel| |#2|) (|Kernel| |#2|) |#2| (|SparseUnivariatePolynomial| |#2|)) "\\spad{palgLODE0(op, g, x, y, d, p)} returns the solution of \\spad{op f = g}. Argument \\spad{y} is an algebraic function of \\spad{x} satisfying \\spad{d(x)\\^2y(x)\\^2 = P(x)}.")) (|lift| (((|SparseUnivariatePolynomial| (|Fraction| (|SparseUnivariatePolynomial| |#2|))) (|SparseUnivariatePolynomial| |#2|) (|Kernel| |#2|)) "\\spad{lift(u,k)} \\undocumented")) (|multivariate| ((|#2| (|SparseUnivariatePolynomial| (|Fraction| (|SparseUnivariatePolynomial| |#2|))) (|Kernel| |#2|) |#2|) "\\spad{multivariate(u,k,f)} \\undocumented")) (|univariate| (((|SparseUnivariatePolynomial| (|Fraction| (|SparseUnivariatePolynomial| |#2|))) |#2| (|Kernel| |#2|) (|Kernel| |#2|) (|SparseUnivariatePolynomial| |#2|)) "\\spad{univariate(f,k,k,p)} \\undocumented")) (|palgRDE0| (((|Union| |#2| "failed") |#2| |#2| (|Kernel| |#2|) (|Kernel| |#2|) (|Mapping| (|Union| |#2| "failed") |#2| |#2| (|Symbol|)) (|Kernel| |#2|) |#2| (|Fraction| (|SparseUnivariatePolynomial| |#2|))) "\\spad{palgRDE0(f, g, x, y, foo, t, c)} returns a function \\spad{z(x,y)} such that \\spad{dz/dx + n * df/dx z(x,y) = g(x,y)} if such a \\spad{z} exists,{} and \"failed\" otherwise. Argument \\spad{y} is an algebraic function of \\spad{x} satisfying \\spad{f(x,y)dx = c f(t,y) dy}; \\spad{c} and \\spad{t} are rational functions of \\spad{y}. Argument \\spad{foo},{} called by \\spad{foo(a, b, x)},{} is a function that solves \\spad{du/dx + n * da/dx u(x) = u(x)} for an unknown \\spad{u(x)} not involving \\spad{y}.") (((|Union| |#2| "failed") |#2| |#2| (|Kernel| |#2|) (|Kernel| |#2|) (|Mapping| (|Union| |#2| "failed") |#2| |#2| (|Symbol|)) |#2| (|SparseUnivariatePolynomial| |#2|)) "\\spad{palgRDE0(f, g, x, y, foo, d, p)} returns a function \\spad{z(x,y)} such that \\spad{dz/dx + n * df/dx z(x,y) = g(x,y)} if such a \\spad{z} exists,{} and \"failed\" otherwise. Argument \\spad{y} is an algebraic function of \\spad{x} satisfying \\spad{d(x)\\^2y(x)\\^2 = P(x)}. Argument \\spad{foo},{} called by \\spad{foo(a, b, x)},{} is a function that solves \\spad{du/dx + n * da/dx u(x) = u(x)} for an unknown \\spad{u(x)} not involving \\spad{y}.")) (|palglimint0| (((|Union| (|Record| (|:| |mainpart| |#2|) (|:| |limitedlogs| (|List| (|Record| (|:| |coeff| |#2|) (|:| |logand| |#2|))))) "failed") |#2| (|Kernel| |#2|) (|Kernel| |#2|) (|List| |#2|) (|Kernel| |#2|) |#2| (|Fraction| (|SparseUnivariatePolynomial| |#2|))) "\\spad{palglimint0(f, x, y, [u1,...,un], z, t, c)} returns functions \\spad{[h,[[ci, ui]]]} such that the \\spad{ui}\\spad{'s} are among \\spad{[u1,...,un]} and \\spad{d(h + sum(ci log(ui)))/dx = f(x,y)} if such functions exist,{} and \"failed\" otherwise. Argument \\spad{y} is an algebraic function of \\spad{x} satisfying \\spad{f(x,y)dx = c f(t,y) dy}; \\spad{c} and \\spad{t} are rational functions of \\spad{y}.") (((|Union| (|Record| (|:| |mainpart| |#2|) (|:| |limitedlogs| (|List| (|Record| (|:| |coeff| |#2|) (|:| |logand| |#2|))))) "failed") |#2| (|Kernel| |#2|) (|Kernel| |#2|) (|List| |#2|) |#2| (|SparseUnivariatePolynomial| |#2|)) "\\spad{palglimint0(f, x, y, [u1,...,un], d, p)} returns functions \\spad{[h,[[ci, ui]]]} such that the \\spad{ui}\\spad{'s} are among \\spad{[u1,...,un]} and \\spad{d(h + sum(ci log(ui)))/dx = f(x,y)} if such functions exist,{} and \"failed\" otherwise. Argument \\spad{y} is an algebraic function of \\spad{x} satisfying \\spad{d(x)\\^2y(x)\\^2 = P(x)}.")) (|palgextint0| (((|Union| (|Record| (|:| |ratpart| |#2|) (|:| |coeff| |#2|)) "failed") |#2| (|Kernel| |#2|) (|Kernel| |#2|) |#2| (|Kernel| |#2|) |#2| (|Fraction| (|SparseUnivariatePolynomial| |#2|))) "\\spad{palgextint0(f, x, y, g, z, t, c)} returns functions \\spad{[h, d]} such that \\spad{dh/dx = f(x,y) - d g},{} where \\spad{y} is an algebraic function of \\spad{x} satisfying \\spad{f(x,y)dx = c f(t,y) dy},{} and \\spad{c} and \\spad{t} are rational functions of \\spad{y}. Argument \\spad{z} is a dummy variable not appearing in \\spad{f(x,y)}. The operation returns \"failed\" if no such functions exist.") (((|Union| (|Record| (|:| |ratpart| |#2|) (|:| |coeff| |#2|)) "failed") |#2| (|Kernel| |#2|) (|Kernel| |#2|) |#2| |#2| (|SparseUnivariatePolynomial| |#2|)) "\\spad{palgextint0(f, x, y, g, d, p)} returns functions \\spad{[h, c]} such that \\spad{dh/dx = f(x,y) - c g},{} where \\spad{y} is an algebraic function of \\spad{x} satisfying \\spad{d(x)\\^2 y(x)\\^2 = P(x)},{} or \"failed\" if no such functions exist.")) (|palgint0| (((|IntegrationResult| |#2|) |#2| (|Kernel| |#2|) (|Kernel| |#2|) (|Kernel| |#2|) |#2| (|Fraction| (|SparseUnivariatePolynomial| |#2|))) "\\spad{palgint0(f, x, y, z, t, c)} returns the integral of \\spad{f(x,y)dx} where \\spad{y} is an algebraic function of \\spad{x} satisfying \\spad{f(x,y)dx = c f(t,y) dy}; \\spad{c} and \\spad{t} are rational functions of \\spad{y}. Argument \\spad{z} is a dummy variable not appearing in \\spad{f(x,y)}.") (((|IntegrationResult| |#2|) |#2| (|Kernel| |#2|) (|Kernel| |#2|) |#2| (|SparseUnivariatePolynomial| |#2|)) "\\spad{palgint0(f, x, y, d, p)} returns the integral of \\spad{f(x,y)dx} where \\spad{y} is an algebraic function of \\spad{x} satisfying \\spad{d(x)\\^2 y(x)\\^2 = P(x)}."))) 
 NIL 
 ((|HasCategory| |#3| (LIST (QUOTE -668) (|devaluate| |#2|)))) 
@@ -2224,11 +2224,11 @@ NIL
 ((|constructor| (NIL "This package provides various number theoretic functions on the integers.")) (|sumOfKthPowerDivisors| (((|Integer|) (|Integer|) (|NonNegativeInteger|)) "\\spad{sumOfKthPowerDivisors(n,k)} returns the sum of the \\spad{k}th powers of the integers between 1 and \\spad{n} (inclusive) which divide \\spad{n}. the sum of the \\spad{k}th powers of the divisors of \\spad{n} is often denoted by \\spad{sigma_k(n)}.")) (|sumOfDivisors| (((|Integer|) (|Integer|)) "\\spad{sumOfDivisors(n)} returns the sum of the integers between 1 and \\spad{n} (inclusive) which divide \\spad{n}. The sum of the divisors of \\spad{n} is often denoted by \\spad{sigma(n)}.")) (|numberOfDivisors| (((|Integer|) (|Integer|)) "\\spad{numberOfDivisors(n)} returns the number of integers between 1 and \\spad{n} (inclusive) which divide \\spad{n}. The number of divisors of \\spad{n} is often denoted by \\spad{tau(n)}.")) (|moebiusMu| (((|Integer|) (|Integer|)) "\\spad{moebiusMu(n)} returns the Moebius function \\spad{mu(n)}. \\spad{mu(n)} is either \\spad{-1},{}0 or 1 as follows: \\spad{mu(n) = 0} if \\spad{n} is divisible by a square > 1,{} \\spad{mu(n) = (-1)^k} if \\spad{n} is square-free and has \\spad{k} distinct prime divisors.")) (|legendre| (((|Integer|) (|Integer|) (|Integer|)) "\\spad{legendre(a,p)} returns the Legendre symbol \\spad{L(a/p)}. \\spad{L(a/p) = (-1)**((p-1)/2) mod p} (\\spad{p} prime),{} which is 0 if \\spad{a} is 0,{} 1 if \\spad{a} is a quadratic residue \\spad{mod p} and \\spad{-1} otherwise. Note: because the primality test is expensive,{} if it is known that \\spad{p} is prime then use \\spad{jacobi(a,p)}.")) (|jacobi| (((|Integer|) (|Integer|) (|Integer|)) "\\spad{jacobi(a,b)} returns the Jacobi symbol \\spad{J(a/b)}. When \\spad{b} is odd,{} \\spad{J(a/b) = product(L(a/p) for p in factor b )}. Note: by convention,{} 0 is returned if \\spad{gcd(a,b) ~= 1}. Iterative \\spad{O(log(b)^2)} version coded by Michael Monagan June 1987.")) (|harmonic| (((|Fraction| (|Integer|)) (|Integer|)) "\\spad{harmonic(n)} returns the \\spad{n}th harmonic number. This is \\spad{H[n] = sum(1/k,k=1..n)}.")) (|fibonacci| (((|Integer|) (|Integer|)) "\\spad{fibonacci(n)} returns the \\spad{n}th Fibonacci number. the Fibonacci numbers \\spad{F[n]} are defined by \\spad{F[0] = F[1] = 1} and \\spad{F[n] = F[n-1] + F[n-2]}. The algorithm has running time \\spad{O(log(n)^3)}. Reference: Knuth,{} The Art of Computer Programming Vol 2,{} Semi-Numerical Algorithms.")) (|eulerPhi| (((|Integer|) (|Integer|)) "\\spad{eulerPhi(n)} returns the number of integers between 1 and \\spad{n} (including 1) which are relatively prime to \\spad{n}. This is the Euler phi function \\spad{\\phi(n)} is also called the totient function.")) (|euler| (((|Integer|) (|Integer|)) "\\spad{euler(n)} returns the \\spad{n}th Euler number. This is \\spad{2^n E(n,1/2)},{} where \\spad{E(n,x)} is the \\spad{n}th Euler polynomial.")) (|divisors| (((|List| (|Integer|)) (|Integer|)) "\\spad{divisors(n)} returns a list of the divisors of \\spad{n}.")) (|chineseRemainder| (((|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Integer|)) "\\spad{chineseRemainder(x1,m1,x2,m2)} returns \\spad{w},{} where \\spad{w} is such that \\spad{w = x1 mod m1} and \\spad{w = x2 mod m2}. Note: \\spad{m1} and \\spad{m2} must be relatively prime.")) (|bernoulli| (((|Fraction| (|Integer|)) (|Integer|)) "\\spad{bernoulli(n)} returns the \\spad{n}th Bernoulli number. this is \\spad{B(n,0)},{} where \\spad{B(n,x)} is the \\spad{n}th Bernoulli polynomial."))) 
 NIL 
 NIL 
-(-574 -1967 UP UPUP R) 
+(-574 -1966 UP UPUP R) 
 ((|constructor| (NIL "algebraic Hermite redution.")) (|HermiteIntegrate| (((|Record| (|:| |answer| |#4|) (|:| |logpart| |#4|)) |#4| (|Mapping| |#2| |#2|)) "\\spad{HermiteIntegrate(f, ')} returns \\spad{[g,h]} such that \\spad{f = g' + h} and \\spad{h} has a only simple finite normal poles."))) 
 NIL 
 NIL 
-(-575 -1967 UP) 
+(-575 -1966 UP) 
 ((|constructor| (NIL "Hermite integration,{} transcendental case.")) (|HermiteIntegrate| (((|Record| (|:| |answer| (|Fraction| |#2|)) (|:| |logpart| (|Fraction| |#2|)) (|:| |specpart| (|Fraction| |#2|)) (|:| |polypart| |#2|)) (|Fraction| |#2|) (|Mapping| |#2| |#2|)) "\\spad{HermiteIntegrate(f, D)} returns \\spad{[g, h, s, p]} such that \\spad{f = Dg + h + s + p},{} \\spad{h} has a squarefree denominator normal \\spad{w}.\\spad{r}.\\spad{t}. \\spad{D},{} and all the squarefree factors of the denominator of \\spad{s} are special \\spad{w}.\\spad{r}.\\spad{t}. \\spad{D}. Furthermore,{} \\spad{h} and \\spad{s} have no polynomial parts. \\spad{D} is the derivation to use on \\spadtype{UP}."))) 
 NIL 
 NIL 
@@ -2240,15 +2240,15 @@ NIL
 ((|measure| (((|Record| (|:| |measure| (|Float|)) (|:| |name| (|String|)) (|:| |explanations| (|List| (|String|))) (|:| |extra| (|Result|))) (|NumericalIntegrationProblem|) (|RoutinesTable|)) "\\spad{measure(prob,R)} is a top level ANNA function for identifying the most appropriate numerical routine from those in the routines table provided for solving the numerical integration problem defined by \\axiom{\\spad{prob}}. \\blankline It calls each \\axiom{domain} listed in \\axiom{\\spad{R}} of \\axiom{category} \\axiomType{NumericalIntegrationCategory} in turn to calculate all measures and returns the best \\spadignore{i.e.} the name of the most appropriate domain and any other relevant information.") (((|Record| (|:| |measure| (|Float|)) (|:| |name| (|String|)) (|:| |explanations| (|List| (|String|))) (|:| |extra| (|Result|))) (|NumericalIntegrationProblem|)) "\\spad{measure(prob)} is a top level ANNA function for identifying the most appropriate numerical routine for solving the numerical integration problem defined by \\axiom{\\spad{prob}}. \\blankline It calls each \\axiom{domain} of \\axiom{category} \\axiomType{NumericalIntegrationCategory} in turn to calculate all measures and returns the best \\spadignore{i.e.} the name of the most appropriate domain and any other relevant information.")) (|integrate| (((|Union| (|Result|) "failed") (|Expression| (|Float|)) (|SegmentBinding| (|OrderedCompletion| (|Float|))) (|Symbol|)) "\\spad{integrate(exp, x = a..b, numerical)} is a top level ANNA function to integrate an expression,{} {\\spad{\\tt} \\spad{exp}},{} over a given range,{} {\\spad{\\tt} a} to {\\spad{\\tt} \\spad{b}}. \\blankline It iterates over the \\axiom{domains} of \\axiomType{NumericalIntegrationCategory} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline It then performs the integration of the given expression on that \\axiom{domain}.\\newline \\blankline Default values for the absolute and relative error are used. \\blankline It is an error if the last argument is not {\\spad{\\tt} numerical}.") (((|Union| (|Result|) "failed") (|Expression| (|Float|)) (|SegmentBinding| (|OrderedCompletion| (|Float|))) (|String|)) "\\spad{integrate(exp, x = a..b, \"numerical\")} is a top level ANNA function to integrate an expression,{} {\\spad{\\tt} \\spad{exp}},{} over a given range,{} {\\spad{\\tt} a} to {\\spad{\\tt} \\spad{b}}. \\blankline It iterates over the \\axiom{domains} of \\axiomType{NumericalIntegrationCategory} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline It then performs the integration of the given expression on that \\axiom{domain}.\\newline \\blankline Default values for the absolute and relative error are used. \\blankline It is an error of the last argument is not {\\spad{\\tt} \"numerical\"}.") (((|Result|) (|Expression| (|Float|)) (|List| (|Segment| (|OrderedCompletion| (|Float|)))) (|Float|) (|Float|) (|RoutinesTable|)) "\\spad{integrate(exp, [a..b,c..d,...], epsabs, epsrel, routines)} is a top level ANNA function to integrate a multivariate expression,{} {\\spad{\\tt} \\spad{exp}},{} over a given set of ranges to the required absolute and relative accuracy,{} using the routines available in the RoutinesTable provided. \\blankline It iterates over the \\axiom{domains} of \\axiomType{NumericalIntegrationCategory} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline It then performs the integration of the given expression on that \\axiom{domain}.") (((|Result|) (|Expression| (|Float|)) (|List| (|Segment| (|OrderedCompletion| (|Float|)))) (|Float|) (|Float|)) "\\spad{integrate(exp, [a..b,c..d,...], epsabs, epsrel)} is a top level ANNA function to integrate a multivariate expression,{} {\\spad{\\tt} \\spad{exp}},{} over a given set of ranges to the required absolute and relative accuracy. \\blankline It iterates over the \\axiom{domains} of \\axiomType{NumericalIntegrationCategory} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline It then performs the integration of the given expression on that \\axiom{domain}.") (((|Result|) (|Expression| (|Float|)) (|List| (|Segment| (|OrderedCompletion| (|Float|)))) (|Float|)) "\\spad{integrate(exp, [a..b,c..d,...], epsrel)} is a top level ANNA function to integrate a multivariate expression,{} {\\spad{\\tt} \\spad{exp}},{} over a given set of ranges to the required relative accuracy. \\blankline It iterates over the \\axiom{domains} of \\axiomType{NumericalIntegrationCategory} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline It then performs the integration of the given expression on that \\axiom{domain}. \\blankline If epsrel = 0,{} a default absolute accuracy is used.") (((|Result|) (|Expression| (|Float|)) (|List| (|Segment| (|OrderedCompletion| (|Float|))))) "\\spad{integrate(exp, [a..b,c..d,...])} is a top level ANNA function to integrate a multivariate expression,{} {\\spad{\\tt} \\spad{exp}},{} over a given set of ranges. \\blankline It iterates over the \\axiom{domains} of \\axiomType{NumericalIntegrationCategory} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline It then performs the integration of the given expression on that \\axiom{domain}. \\blankline Default values for the absolute and relative error are used.") (((|Result|) (|Expression| (|Float|)) (|Segment| (|OrderedCompletion| (|Float|)))) "\\spad{integrate(exp, a..b)} is a top level ANNA function to integrate an expression,{} {\\spad{\\tt} \\spad{exp}},{} over a given range {\\spad{\\tt} a} to {\\spad{\\tt} \\spad{b}}. \\blankline It iterates over the \\axiom{domains} of \\axiomType{NumericalIntegrationCategory} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline It then performs the integration of the given expression on that \\axiom{domain}. \\blankline Default values for the absolute and relative error are used.") (((|Result|) (|Expression| (|Float|)) (|Segment| (|OrderedCompletion| (|Float|))) (|Float|)) "\\spad{integrate(exp, a..b, epsrel)} is a top level ANNA function to integrate an expression,{} {\\spad{\\tt} \\spad{exp}},{} over a given range {\\spad{\\tt} a} to {\\spad{\\tt} \\spad{b}} to the required relative accuracy. \\blankline It iterates over the \\axiom{domains} of \\axiomType{NumericalIntegrationCategory} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline It then performs the integration of the given expression on that \\axiom{domain}. \\blankline If epsrel = 0,{} a default absolute accuracy is used.") (((|Result|) (|Expression| (|Float|)) (|Segment| (|OrderedCompletion| (|Float|))) (|Float|) (|Float|)) "\\spad{integrate(exp, a..b, epsabs, epsrel)} is a top level ANNA function to integrate an expression,{} {\\spad{\\tt} \\spad{exp}},{} over a given range {\\spad{\\tt} a} to {\\spad{\\tt} \\spad{b}} to the required absolute and relative accuracy. \\blankline It iterates over the \\axiom{domains} of \\axiomType{NumericalIntegrationCategory} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline It then performs the integration of the given expression on that \\axiom{domain}.") (((|Result|) (|NumericalIntegrationProblem|)) "\\spad{integrate(IntegrationProblem)} is a top level ANNA function to integrate an expression over a given range or ranges to the required absolute and relative accuracy. \\blankline It iterates over the \\axiom{domains} of \\axiomType{NumericalIntegrationCategory} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline It then performs the integration of the given expression on that \\axiom{domain}.") (((|Result|) (|Expression| (|Float|)) (|Segment| (|OrderedCompletion| (|Float|))) (|Float|) (|Float|) (|RoutinesTable|)) "\\spad{integrate(exp, a..b, epsrel, routines)} is a top level ANNA function to integrate an expression,{} {\\spad{\\tt} \\spad{exp}},{} over a given range {\\spad{\\tt} a} to {\\spad{\\tt} \\spad{b}} to the required absolute and relative accuracy using the routines available in the RoutinesTable provided. \\blankline It iterates over the \\axiom{domains} of \\axiomType{NumericalIntegrationCategory} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline It then performs the integration of the given expression on that \\axiom{domain}."))) 
 NIL 
 NIL 
-(-578 R -1967 L) 
+(-578 R -1966 L) 
 ((|constructor| (NIL "This package provides functions for integration,{} limited integration,{} extended integration and the risch differential equation for pure algebraic integrands.")) (|palgLODE| (((|Record| (|:| |particular| (|Union| |#2| "failed")) (|:| |basis| (|List| |#2|))) |#3| |#2| (|Kernel| |#2|) (|Kernel| |#2|) (|Symbol|)) "\\spad{palgLODE(op, g, kx, y, x)} returns the solution of \\spad{op f = g}. \\spad{y} is an algebraic function of \\spad{x}.")) (|palgRDE| (((|Union| |#2| "failed") |#2| |#2| |#2| (|Kernel| |#2|) (|Kernel| |#2|) (|Mapping| (|Union| |#2| "failed") |#2| |#2| (|Symbol|))) "\\spad{palgRDE(nfp, f, g, x, y, foo)} returns a function \\spad{z(x,y)} such that \\spad{dz/dx + n * df/dx z(x,y) = g(x,y)} if such a \\spad{z} exists,{} \"failed\" otherwise; \\spad{y} is an algebraic function of \\spad{x}; \\spad{foo(a, b, x)} is a function that solves \\spad{du/dx + n * da/dx u(x) = u(x)} for an unknown \\spad{u(x)} not involving \\spad{y}. \\spad{nfp} is \\spad{n * df/dx}.")) (|palglimint| (((|Union| (|Record| (|:| |mainpart| |#2|) (|:| |limitedlogs| (|List| (|Record| (|:| |coeff| |#2|) (|:| |logand| |#2|))))) "failed") |#2| (|Kernel| |#2|) (|Kernel| |#2|) (|List| |#2|)) "\\spad{palglimint(f, x, y, [u1,...,un])} returns functions \\spad{[h,[[ci, ui]]]} such that the \\spad{ui}\\spad{'s} are among \\spad{[u1,...,un]} and \\spad{d(h + sum(ci log(ui)))/dx = f(x,y)} if such functions exist,{} \"failed\" otherwise; \\spad{y} is an algebraic function of \\spad{x}.")) (|palgextint| (((|Union| (|Record| (|:| |ratpart| |#2|) (|:| |coeff| |#2|)) "failed") |#2| (|Kernel| |#2|) (|Kernel| |#2|) |#2|) "\\spad{palgextint(f, x, y, g)} returns functions \\spad{[h, c]} such that \\spad{dh/dx = f(x,y) - c g},{} where \\spad{y} is an algebraic function of \\spad{x}; returns \"failed\" if no such functions exist.")) (|palgint| (((|IntegrationResult| |#2|) |#2| (|Kernel| |#2|) (|Kernel| |#2|)) "\\spad{palgint(f, x, y)} returns the integral of \\spad{f(x,y)dx} where \\spad{y} is an algebraic function of \\spad{x}."))) 
 NIL 
 ((|HasCategory| |#3| (LIST (QUOTE -668) (|devaluate| |#2|)))) 
-(-579 R -1967) 
+(-579 R -1966) 
 ((|constructor| (NIL "\\spadtype{PatternMatchIntegration} provides functions that use the pattern matcher to find some indefinite and definite integrals involving special functions and found in the litterature.")) (|pmintegrate| (((|Union| |#2| "failed") |#2| (|Symbol|) (|OrderedCompletion| |#2|) (|OrderedCompletion| |#2|)) "\\spad{pmintegrate(f, x = a..b)} returns the integral of \\spad{f(x)dx} from a to \\spad{b} if it can be found by the built-in pattern matching rules.") (((|Union| (|Record| (|:| |special| |#2|) (|:| |integrand| |#2|)) "failed") |#2| (|Symbol|)) "\\spad{pmintegrate(f, x)} returns either \"failed\" or \\spad{[g,h]} such that \\spad{integrate(f,x) = g + integrate(h,x)}.")) (|pmComplexintegrate| (((|Union| (|Record| (|:| |special| |#2|) (|:| |integrand| |#2|)) "failed") |#2| (|Symbol|)) "\\spad{pmComplexintegrate(f, x)} returns either \"failed\" or \\spad{[g,h]} such that \\spad{integrate(f,x) = g + integrate(h,x)}. It only looks for special complex integrals that pmintegrate does not return.")) (|splitConstant| (((|Record| (|:| |const| |#2|) (|:| |nconst| |#2|)) |#2| (|Symbol|)) "\\spad{splitConstant(f, x)} returns \\spad{[c, g]} such that \\spad{f = c * g} and \\spad{c} does not involve \\spad{t}."))) 
 NIL 
 ((-12 (|HasCategory| |#1| (LIST (QUOTE -626) (LIST (QUOTE -905) (QUOTE (-576))))) (|HasCategory| |#1| (LIST (QUOTE -899) (QUOTE (-576)))) (|HasCategory| |#2| (QUOTE (-1158)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -626) (LIST (QUOTE -905) (QUOTE (-576))))) (|HasCategory| |#1| (LIST (QUOTE -899) (QUOTE (-576)))) (|HasCategory| |#2| (QUOTE (-641))))) 
-(-580 -1967 UP) 
+(-580 -1966 UP) 
 ((|constructor| (NIL "This package provides functions for the base case of the Risch algorithm.")) (|limitedint| (((|Union| (|Record| (|:| |mainpart| (|Fraction| |#2|)) (|:| |limitedlogs| (|List| (|Record| (|:| |coeff| (|Fraction| |#2|)) (|:| |logand| (|Fraction| |#2|)))))) "failed") (|Fraction| |#2|) (|List| (|Fraction| |#2|))) "\\spad{limitedint(f, [g1,...,gn])} returns fractions \\spad{[h,[[ci, gi]]]} such that the \\spad{gi}\\spad{'s} are among \\spad{[g1,...,gn]},{} \\spad{ci' = 0},{} and \\spad{(h+sum(ci log(gi)))' = f},{} if possible,{} \"failed\" otherwise.")) (|extendedint| (((|Union| (|Record| (|:| |ratpart| (|Fraction| |#2|)) (|:| |coeff| (|Fraction| |#2|))) "failed") (|Fraction| |#2|) (|Fraction| |#2|)) "\\spad{extendedint(f, g)} returns fractions \\spad{[h, c]} such that \\spad{c' = 0} and \\spad{h' = f - cg},{} if \\spad{(h, c)} exist,{} \"failed\" otherwise.")) (|infieldint| (((|Union| (|Fraction| |#2|) "failed") (|Fraction| |#2|)) "\\spad{infieldint(f)} returns \\spad{g} such that \\spad{g' = f} or \"failed\" if the integral of \\spad{f} is not a rational function.")) (|integrate| (((|IntegrationResult| (|Fraction| |#2|)) (|Fraction| |#2|)) "\\spad{integrate(f)} returns \\spad{g} such that \\spad{g' = f}."))) 
 NIL 
 NIL 
@@ -2256,7 +2256,7 @@ NIL
 ((|constructor| (NIL "Provides integer testing and retraction functions. Date Created: March 1990 Date Last Updated: 9 April 1991")) (|integerIfCan| (((|Union| (|Integer|) "failed") |#1|) "\\spad{integerIfCan(x)} returns \\spad{x} as an integer,{} \"failed\" if \\spad{x} is not an integer.")) (|integer?| (((|Boolean|) |#1|) "\\spad{integer?(x)} is \\spad{true} if \\spad{x} is an integer,{} \\spad{false} otherwise.")) (|integer| (((|Integer|) |#1|) "\\spad{integer(x)} returns \\spad{x} as an integer; error if \\spad{x} is not an integer."))) 
 NIL 
 NIL 
-(-582 -1967) 
+(-582 -1966) 
 ((|constructor| (NIL "This package provides functions for the integration of rational functions.")) (|extendedIntegrate| (((|Union| (|Record| (|:| |ratpart| (|Fraction| (|Polynomial| |#1|))) (|:| |coeff| (|Fraction| (|Polynomial| |#1|)))) "failed") (|Fraction| (|Polynomial| |#1|)) (|Symbol|) (|Fraction| (|Polynomial| |#1|))) "\\spad{extendedIntegrate(f, x, g)} returns fractions \\spad{[h, c]} such that \\spad{dc/dx = 0} and \\spad{dh/dx = f - cg},{} if \\spad{(h, c)} exist,{} \"failed\" otherwise.")) (|limitedIntegrate| (((|Union| (|Record| (|:| |mainpart| (|Fraction| (|Polynomial| |#1|))) (|:| |limitedlogs| (|List| (|Record| (|:| |coeff| (|Fraction| (|Polynomial| |#1|))) (|:| |logand| (|Fraction| (|Polynomial| |#1|))))))) "failed") (|Fraction| (|Polynomial| |#1|)) (|Symbol|) (|List| (|Fraction| (|Polynomial| |#1|)))) "\\spad{limitedIntegrate(f, x, [g1,...,gn])} returns fractions \\spad{[h, [[ci,gi]]]} such that the \\spad{gi}\\spad{'s} are among \\spad{[g1,...,gn]},{} \\spad{dci/dx = 0},{} and \\spad{d(h + sum(ci log(gi)))/dx = f} if possible,{} \"failed\" otherwise.")) (|infieldIntegrate| (((|Union| (|Fraction| (|Polynomial| |#1|)) "failed") (|Fraction| (|Polynomial| |#1|)) (|Symbol|)) "\\spad{infieldIntegrate(f, x)} returns a fraction \\spad{g} such that \\spad{dg/dx = f} if \\spad{g} exists,{} \"failed\" otherwise.")) (|internalIntegrate| (((|IntegrationResult| (|Fraction| (|Polynomial| |#1|))) (|Fraction| (|Polynomial| |#1|)) (|Symbol|)) "\\spad{internalIntegrate(f, x)} returns \\spad{g} such that \\spad{dg/dx = f}."))) 
 NIL 
 NIL 
@@ -2268,15 +2268,15 @@ NIL
 ((|constructor| (NIL "This package provides the implementation for the \\spadfun{solveLinearPolynomialEquation} operation over the integers. It uses a lifting technique from the package GenExEuclid")) (|solveLinearPolynomialEquation| (((|Union| (|List| (|SparseUnivariatePolynomial| (|Integer|))) "failed") (|List| (|SparseUnivariatePolynomial| (|Integer|))) (|SparseUnivariatePolynomial| (|Integer|))) "\\spad{solveLinearPolynomialEquation([f1, ..., fn], g)} (where the \\spad{fi} are relatively prime to each other) returns a list of \\spad{ai} such that \\spad{g/prod fi = sum ai/fi} or returns \"failed\" if no such list of \\spad{ai}\\spad{'s} exists."))) 
 NIL 
 NIL 
-(-585 R -1967) 
+(-585 R -1966) 
 ((|constructor| (NIL "\\indented{1}{Tools for the integrator} Author: Manuel Bronstein Date Created: 25 April 1990 Date Last Updated: 9 June 1993 Keywords: elementary,{} function,{} integration.")) (|intPatternMatch| (((|IntegrationResult| |#2|) |#2| (|Symbol|) (|Mapping| (|IntegrationResult| |#2|) |#2| (|Symbol|)) (|Mapping| (|Union| (|Record| (|:| |special| |#2|) (|:| |integrand| |#2|)) "failed") |#2| (|Symbol|))) "\\spad{intPatternMatch(f, x, int, pmint)} tries to integrate \\spad{f} first by using the integration function \\spad{int},{} and then by using the pattern match intetgration function \\spad{pmint} on any remaining unintegrable part.")) (|mkPrim| ((|#2| |#2| (|Symbol|)) "\\spad{mkPrim(f, x)} makes the logs in \\spad{f} which are linear in \\spad{x} primitive with respect to \\spad{x}.")) (|removeConstantTerm| ((|#2| |#2| (|Symbol|)) "\\spad{removeConstantTerm(f, x)} returns \\spad{f} minus any additive constant with respect to \\spad{x}.")) (|vark| (((|List| (|Kernel| |#2|)) (|List| |#2|) (|Symbol|)) "\\spad{vark([f1,...,fn],x)} returns the set-theoretic union of \\spad{(varselect(f1,x),...,varselect(fn,x))}.")) (|union| (((|List| (|Kernel| |#2|)) (|List| (|Kernel| |#2|)) (|List| (|Kernel| |#2|))) "\\spad{union(l1, l2)} returns set-theoretic union of \\spad{l1} and \\spad{l2}.")) (|ksec| (((|Kernel| |#2|) (|Kernel| |#2|) (|List| (|Kernel| |#2|)) (|Symbol|)) "\\spad{ksec(k, [k1,...,kn], x)} returns the second top-level \\spad{ki} after \\spad{k} involving \\spad{x}.")) (|kmax| (((|Kernel| |#2|) (|List| (|Kernel| |#2|))) "\\spad{kmax([k1,...,kn])} returns the top-level \\spad{ki} for integration.")) (|varselect| (((|List| (|Kernel| |#2|)) (|List| (|Kernel| |#2|)) (|Symbol|)) "\\spad{varselect([k1,...,kn], x)} returns the \\spad{ki} which involve \\spad{x}."))) 
 NIL 
 ((-12 (|HasCategory| |#1| (LIST (QUOTE -626) (LIST (QUOTE -905) (QUOTE (-576))))) (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (LIST (QUOTE -899) (QUOTE (-576)))) (|HasCategory| |#2| (QUOTE (-294))) (|HasCategory| |#2| (QUOTE (-641))) (|HasCategory| |#2| (LIST (QUOTE -1057) (QUOTE (-1195))))) (-12 (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#2| (QUOTE (-294)))) (|HasCategory| |#1| (QUOTE (-568)))) 
-(-586 -1967 UP) 
+(-586 -1966 UP) 
 ((|constructor| (NIL "This package provides functions for the transcendental case of the Risch algorithm.")) (|monomialIntPoly| (((|Record| (|:| |answer| |#2|) (|:| |polypart| |#2|)) |#2| (|Mapping| |#2| |#2|)) "\\spad{monomialIntPoly(p, ')} returns [\\spad{q},{} \\spad{r}] such that \\spad{p = q' + r} and \\spad{degree(r) < degree(t')}. Error if \\spad{degree(t') < 2}.")) (|monomialIntegrate| (((|Record| (|:| |ir| (|IntegrationResult| (|Fraction| |#2|))) (|:| |specpart| (|Fraction| |#2|)) (|:| |polypart| |#2|)) (|Fraction| |#2|) (|Mapping| |#2| |#2|)) "\\spad{monomialIntegrate(f, ')} returns \\spad{[ir, s, p]} such that \\spad{f = ir' + s + p} and all the squarefree factors of the denominator of \\spad{s} are special \\spad{w}.\\spad{r}.\\spad{t} the derivation '.")) (|expintfldpoly| (((|Union| (|LaurentPolynomial| |#1| |#2|) "failed") (|LaurentPolynomial| |#1| |#2|) (|Mapping| (|Record| (|:| |ans| |#1|) (|:| |right| |#1|) (|:| |sol?| (|Boolean|))) (|Integer|) |#1|)) "\\spad{expintfldpoly(p, foo)} returns \\spad{q} such that \\spad{p' = q} or \"failed\" if no such \\spad{q} exists. Argument foo is a Risch differential equation function on \\spad{F}.")) (|primintfldpoly| (((|Union| |#2| "failed") |#2| (|Mapping| (|Union| (|Record| (|:| |ratpart| |#1|) (|:| |coeff| |#1|)) "failed") |#1|) |#1|) "\\spad{primintfldpoly(p, ', t')} returns \\spad{q} such that \\spad{p' = q} or \"failed\" if no such \\spad{q} exists. Argument \\spad{t'} is the derivative of the primitive generating the extension.")) (|primlimintfrac| (((|Union| (|Record| (|:| |mainpart| (|Fraction| |#2|)) (|:| |limitedlogs| (|List| (|Record| (|:| |coeff| (|Fraction| |#2|)) (|:| |logand| (|Fraction| |#2|)))))) "failed") (|Fraction| |#2|) (|Mapping| |#2| |#2|) (|List| (|Fraction| |#2|))) "\\spad{primlimintfrac(f, ', [u1,...,un])} returns \\spad{[v, [c1,...,cn]]} such that \\spad{ci' = 0} and \\spad{f = v' + +/[ci * ui'/ui]}. Error: if \\spad{degree numer f >= degree denom f}.")) (|primextintfrac| (((|Union| (|Record| (|:| |ratpart| (|Fraction| |#2|)) (|:| |coeff| (|Fraction| |#2|))) "failed") (|Fraction| |#2|) (|Mapping| |#2| |#2|) (|Fraction| |#2|)) "\\spad{primextintfrac(f, ', g)} returns \\spad{[v, c]} such that \\spad{f = v' + c g} and \\spad{c' = 0}. Error: if \\spad{degree numer f >= degree denom f} or if \\spad{degree numer g >= degree denom g} or if \\spad{denom g} is not squarefree.")) (|explimitedint| (((|Union| (|Record| (|:| |answer| (|Record| (|:| |mainpart| (|Fraction| |#2|)) (|:| |limitedlogs| (|List| (|Record| (|:| |coeff| (|Fraction| |#2|)) (|:| |logand| (|Fraction| |#2|))))))) (|:| |a0| |#1|)) "failed") (|Fraction| |#2|) (|Mapping| |#2| |#2|) (|Mapping| (|Record| (|:| |ans| |#1|) (|:| |right| |#1|) (|:| |sol?| (|Boolean|))) (|Integer|) |#1|) (|List| (|Fraction| |#2|))) "\\spad{explimitedint(f, ', foo, [u1,...,un])} returns \\spad{[v, [c1,...,cn], a]} such that \\spad{ci' = 0},{} \\spad{f = v' + a + reduce(+,[ci * ui'/ui])},{} and \\spad{a = 0} or \\spad{a} has no integral in \\spad{F}. Returns \"failed\" if no such \\spad{v},{} \\spad{ci},{} a exist. Argument \\spad{foo} is a Risch differential equation function on \\spad{F}.")) (|primlimitedint| (((|Union| (|Record| (|:| |answer| (|Record| (|:| |mainpart| (|Fraction| |#2|)) (|:| |limitedlogs| (|List| (|Record| (|:| |coeff| (|Fraction| |#2|)) (|:| |logand| (|Fraction| |#2|))))))) (|:| |a0| |#1|)) "failed") (|Fraction| |#2|) (|Mapping| |#2| |#2|) (|Mapping| (|Union| (|Record| (|:| |ratpart| |#1|) (|:| |coeff| |#1|)) "failed") |#1|) (|List| (|Fraction| |#2|))) "\\spad{primlimitedint(f, ', foo, [u1,...,un])} returns \\spad{[v, [c1,...,cn], a]} such that \\spad{ci' = 0},{} \\spad{f = v' + a + reduce(+,[ci * ui'/ui])},{} and \\spad{a = 0} or \\spad{a} has no integral in UP. Returns \"failed\" if no such \\spad{v},{} \\spad{ci},{} a exist. Argument \\spad{foo} is an extended integration function on \\spad{F}.")) (|expextendedint| (((|Union| (|Record| (|:| |answer| (|Fraction| |#2|)) (|:| |a0| |#1|)) (|Record| (|:| |ratpart| (|Fraction| |#2|)) (|:| |coeff| (|Fraction| |#2|))) "failed") (|Fraction| |#2|) (|Mapping| |#2| |#2|) (|Mapping| (|Record| (|:| |ans| |#1|) (|:| |right| |#1|) (|:| |sol?| (|Boolean|))) (|Integer|) |#1|) (|Fraction| |#2|)) "\\spad{expextendedint(f, ', foo, g)} returns either \\spad{[v, c]} such that \\spad{f = v' + c g} and \\spad{c' = 0},{} or \\spad{[v, a]} such that \\spad{f = g' + a},{} and \\spad{a = 0} or \\spad{a} has no integral in \\spad{F}. Returns \"failed\" if neither case can hold. Argument \\spad{foo} is a Risch differential equation function on \\spad{F}.")) (|primextendedint| (((|Union| (|Record| (|:| |answer| (|Fraction| |#2|)) (|:| |a0| |#1|)) (|Record| (|:| |ratpart| (|Fraction| |#2|)) (|:| |coeff| (|Fraction| |#2|))) "failed") (|Fraction| |#2|) (|Mapping| |#2| |#2|) (|Mapping| (|Union| (|Record| (|:| |ratpart| |#1|) (|:| |coeff| |#1|)) "failed") |#1|) (|Fraction| |#2|)) "\\spad{primextendedint(f, ', foo, g)} returns either \\spad{[v, c]} such that \\spad{f = v' + c g} and \\spad{c' = 0},{} or \\spad{[v, a]} such that \\spad{f = g' + a},{} and \\spad{a = 0} or \\spad{a} has no integral in UP. Returns \"failed\" if neither case can hold. Argument \\spad{foo} is an extended integration function on \\spad{F}.")) (|tanintegrate| (((|Record| (|:| |answer| (|IntegrationResult| (|Fraction| |#2|))) (|:| |a0| |#1|)) (|Fraction| |#2|) (|Mapping| |#2| |#2|) (|Mapping| (|Union| (|List| |#1|) "failed") (|Integer|) |#1| |#1|)) "\\spad{tanintegrate(f, ', foo)} returns \\spad{[g, a]} such that \\spad{f = g' + a},{} and \\spad{a = 0} or \\spad{a} has no integral in \\spad{F}; Argument foo is a Risch differential system solver on \\spad{F}.")) (|expintegrate| (((|Record| (|:| |answer| (|IntegrationResult| (|Fraction| |#2|))) (|:| |a0| |#1|)) (|Fraction| |#2|) (|Mapping| |#2| |#2|) (|Mapping| (|Record| (|:| |ans| |#1|) (|:| |right| |#1|) (|:| |sol?| (|Boolean|))) (|Integer|) |#1|)) "\\spad{expintegrate(f, ', foo)} returns \\spad{[g, a]} such that \\spad{f = g' + a},{} and \\spad{a = 0} or \\spad{a} has no integral in \\spad{F}; Argument foo is a Risch differential equation solver on \\spad{F}.")) (|primintegrate| (((|Record| (|:| |answer| (|IntegrationResult| (|Fraction| |#2|))) (|:| |a0| |#1|)) (|Fraction| |#2|) (|Mapping| |#2| |#2|) (|Mapping| (|Union| (|Record| (|:| |ratpart| |#1|) (|:| |coeff| |#1|)) "failed") |#1|)) "\\spad{primintegrate(f, ', foo)} returns \\spad{[g, a]} such that \\spad{f = g' + a},{} and \\spad{a = 0} or \\spad{a} has no integral in UP. Argument foo is an extended integration function on \\spad{F}."))) 
 NIL 
 NIL 
-(-587 R -1967) 
+(-587 R -1966) 
 ((|constructor| (NIL "This package computes the inverse Laplace Transform.")) (|inverseLaplace| (((|Union| |#2| "failed") |#2| (|Symbol|) (|Symbol|)) "\\spad{inverseLaplace(f, s, t)} returns the Inverse Laplace transform of \\spad{f(s)} using \\spad{t} as the new variable or \"failed\" if unable to find a closed form."))) 
 NIL 
 NIL 
@@ -2308,11 +2308,11 @@ NIL
 ((|constructor| (NIL "A package to print strings without line-feed nor carriage-return.")) (|iprint| (((|Void|) (|String|)) "\\axiom{iprint(\\spad{s})} prints \\axiom{\\spad{s}} at the current position of the cursor."))) 
 NIL 
 NIL 
-(-595 R -1967) 
+(-595 R -1966) 
 ((|constructor| (NIL "This package allows a sum of logs over the roots of a polynomial to be expressed as explicit logarithms and arc tangents,{} provided that the indexing polynomial can be factored into quadratics.")) (|complexExpand| ((|#2| (|IntegrationResult| |#2|)) "\\spad{complexExpand(i)} returns the expanded complex function corresponding to \\spad{i}.")) (|expand| (((|List| |#2|) (|IntegrationResult| |#2|)) "\\spad{expand(i)} returns the list of possible real functions corresponding to \\spad{i}.")) (|split| (((|IntegrationResult| |#2|) (|IntegrationResult| |#2|)) "\\spad{split(u(x) + sum_{P(a)=0} Q(a,x))} returns \\spad{u(x) + sum_{P1(a)=0} Q(a,x) + ... + sum_{Pn(a)=0} Q(a,x)} where \\spad{P1},{}...,{}\\spad{Pn} are the factors of \\spad{P}."))) 
 NIL 
 NIL 
-(-596 E -1967) 
+(-596 E -1966) 
 ((|constructor| (NIL "\\indented{1}{Internally used by the integration packages} Author: Manuel Bronstein Date Created: 1987 Date Last Updated: 12 August 1992 Keywords: integration.")) (|map| (((|Union| (|Record| (|:| |mainpart| |#2|) (|:| |limitedlogs| (|List| (|Record| (|:| |coeff| |#2|) (|:| |logand| |#2|))))) "failed") (|Mapping| |#2| |#1|) (|Union| (|Record| (|:| |mainpart| |#1|) (|:| |limitedlogs| (|List| (|Record| (|:| |coeff| |#1|) (|:| |logand| |#1|))))) "failed")) "\\spad{map(f,ufe)} \\undocumented") (((|Union| |#2| "failed") (|Mapping| |#2| |#1|) (|Union| |#1| "failed")) "\\spad{map(f,ue)} \\undocumented") (((|Union| (|Record| (|:| |ratpart| |#2|) (|:| |coeff| |#2|)) "failed") (|Mapping| |#2| |#1|) (|Union| (|Record| (|:| |ratpart| |#1|) (|:| |coeff| |#1|)) "failed")) "\\spad{map(f,ure)} \\undocumented") (((|IntegrationResult| |#2|) (|Mapping| |#2| |#1|) (|IntegrationResult| |#1|)) "\\spad{map(f,ire)} \\undocumented"))) 
 NIL 
 NIL 
@@ -2320,7 +2320,7 @@ NIL
 ((|constructor| (NIL "This domain provides representations for the intermediate form data structure used by the Spad elaborator.")) (|irDef| (($ (|Identifier|) (|InternalTypeForm|) $) "\\spad{irDef(f,ts,e)} returns an IR representation for a definition of a function named \\spad{f},{} with signature \\spad{ts} and body \\spad{e}.")) (|irCtor| (($ (|Identifier|) (|InternalTypeForm|)) "\\spad{irCtor(n,t)} returns an IR for a constructor reference of type designated by the type form \\spad{t}")) (|irVar| (($ (|Identifier|) (|InternalTypeForm|)) "\\spad{irVar(x,t)} returns an IR for a variable reference of type designated by the type form \\spad{t}"))) 
 NIL 
 NIL 
-(-598 -1967) 
+(-598 -1966) 
 ((|constructor| (NIL "If a function \\spad{f} has an elementary integral \\spad{g},{} then \\spad{g} can be written in the form \\spad{g = h + c1 log(u1) + c2 log(u2) + ... + cn log(un)} where \\spad{h},{} which is in the same field than \\spad{f},{} is called the rational part of the integral,{} and \\spad{c1 log(u1) + ... cn log(un)} is called the logarithmic part of the integral. This domain manipulates integrals represented in that form,{} by keeping both parts separately. The logs are not explicitly computed.")) (|differentiate| ((|#1| $ (|Symbol|)) "\\spad{differentiate(ir,x)} differentiates \\spad{ir} with respect to \\spad{x}") ((|#1| $ (|Mapping| |#1| |#1|)) "\\spad{differentiate(ir,D)} differentiates \\spad{ir} with respect to the derivation \\spad{D}.")) (|integral| (($ |#1| (|Symbol|)) "\\spad{integral(f,x)} returns the formal integral of \\spad{f} with respect to \\spad{x}") (($ |#1| |#1|) "\\spad{integral(f,x)} returns the formal integral of \\spad{f} with respect to \\spad{x}")) (|elem?| (((|Boolean|) $) "\\spad{elem?(ir)} tests if an integration result is elementary over \\spad{F?}")) (|notelem| (((|List| (|Record| (|:| |integrand| |#1|) (|:| |intvar| |#1|))) $) "\\spad{notelem(ir)} returns the non-elementary part of an integration result")) (|logpart| (((|List| (|Record| (|:| |scalar| (|Fraction| (|Integer|))) (|:| |coeff| (|SparseUnivariatePolynomial| |#1|)) (|:| |logand| (|SparseUnivariatePolynomial| |#1|)))) $) "\\spad{logpart(ir)} returns the logarithmic part of an integration result")) (|ratpart| ((|#1| $) "\\spad{ratpart(ir)} returns the rational part of an integration result")) (|mkAnswer| (($ |#1| (|List| (|Record| (|:| |scalar| (|Fraction| (|Integer|))) (|:| |coeff| (|SparseUnivariatePolynomial| |#1|)) (|:| |logand| (|SparseUnivariatePolynomial| |#1|)))) (|List| (|Record| (|:| |integrand| |#1|) (|:| |intvar| |#1|)))) "\\spad{mkAnswer(r,l,ne)} creates an integration result from a rational part \\spad{r},{} a logarithmic part \\spad{l},{} and a non-elementary part \\spad{ne}."))) 
 ((-4457 . T) (-4456 . T)) 
 ((|HasCategory| |#1| (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasCategory| |#1| (LIST (QUOTE -1057) (QUOTE (-1195))))) 
@@ -2376,7 +2376,7 @@ NIL
 ((|constructor| (NIL "Functions defined on streams with entries in two sets.")) (|map| (((|Stream| |#3|) (|Mapping| |#3| |#1| |#2|) (|InfiniteTuple| |#1|) (|Stream| |#2|)) "\\spad{map(f,a,b)} \\undocumented") (((|Stream| |#3|) (|Mapping| |#3| |#1| |#2|) (|Stream| |#1|) (|InfiniteTuple| |#2|)) "\\spad{map(f,a,b)} \\undocumented") (((|InfiniteTuple| |#3|) (|Mapping| |#3| |#1| |#2|) (|InfiniteTuple| |#1|) (|InfiniteTuple| |#2|)) "\\spad{map(f,a,b)} \\undocumented"))) 
 NIL 
 NIL 
-(-612 R -1967 FG) 
+(-612 R -1966 FG) 
 ((|constructor| (NIL "This package provides transformations from trigonometric functions to exponentials and logarithms,{} and back. \\spad{F} and \\spad{FG} should be the same type of function space.")) (|trigs2explogs| ((|#3| |#3| (|List| (|Kernel| |#3|)) (|List| (|Symbol|))) "\\spad{trigs2explogs(f, [k1,...,kn], [x1,...,xm])} rewrites all the trigonometric functions appearing in \\spad{f} and involving one of the \\spad{xi's} in terms of complex logarithms and exponentials. A kernel of the form \\spad{tan(u)} is expressed using \\spad{exp(u)**2} if it is one of the \\spad{ki's},{} in terms of \\spad{exp(2*u)} otherwise.")) (|explogs2trigs| (((|Complex| |#2|) |#3|) "\\spad{explogs2trigs(f)} rewrites all the complex logs and exponentials appearing in \\spad{f} in terms of trigonometric functions.")) (F2FG ((|#3| |#2|) "\\spad{F2FG(a + sqrt(-1) b)} returns \\spad{a + i b}.")) (FG2F ((|#2| |#3|) "\\spad{FG2F(a + i b)} returns \\spad{a + sqrt(-1) b}.")) (GF2FG ((|#3| (|Complex| |#2|)) "\\spad{GF2FG(a + i b)} returns \\spad{a + i b} viewed as a function with the \\spad{i} pushed down into the coefficient domain."))) 
 NIL 
 NIL 
@@ -2406,7 +2406,7 @@ NIL
 NIL 
 (-619 R A) 
 ((|constructor| (NIL "\\indented{1}{AssociatedJordanAlgebra takes an algebra \\spad{A} and uses \\spadfun{*\\$A}} \\indented{1}{to define the new multiplications \\spad{a*b := (a *\\$A b + b *\\$A a)/2}} \\indented{1}{(anticommutator).} \\indented{1}{The usual notation \\spad{{a,b}_+} cannot be used due to} \\indented{1}{restrictions in the current language.} \\indented{1}{This domain only gives a Jordan algebra if the} \\indented{1}{Jordan-identity \\spad{(a*b)*c + (b*c)*a + (c*a)*b = 0} holds} \\indented{1}{for all \\spad{a},{}\\spad{b},{}\\spad{c} in \\spad{A}.} \\indented{1}{This relation can be checked by} \\indented{1}{\\spadfun{jordanAdmissible?()\\$A}.} \\blankline If the underlying algebra is of type \\spadtype{FramedNonAssociativeAlgebra(R)} (\\spadignore{i.e.} a non associative algebra over \\spad{R} which is a free \\spad{R}-module of finite rank,{} together with a fixed \\spad{R}-module basis),{} then the same is \\spad{true} for the associated Jordan algebra. Moreover,{} if the underlying algebra is of type \\spadtype{FiniteRankNonAssociativeAlgebra(R)} (\\spadignore{i.e.} a non associative algebra over \\spad{R} which is a free \\spad{R}-module of finite rank),{} then the same \\spad{true} for the associated Jordan algebra.")) (|coerce| (($ |#2|) "\\spad{coerce(a)} coerces the element \\spad{a} of the algebra \\spad{A} to an element of the Jordan algebra \\spadtype{AssociatedJordanAlgebra}(\\spad{R},{}A)."))) 
-((-4459 -2781 (-2696 (|has| |#2| (-378 |#1|)) (|has| |#1| (-568))) (-12 (|has| |#2| (-429 |#1|)) (|has| |#1| (-568)))) (-4457 . T) (-4456 . T)) 
+((-4459 -2781 (-2697 (|has| |#2| (-378 |#1|)) (|has| |#1| (-568))) (-12 (|has| |#2| (-429 |#1|)) (|has| |#1| (-568)))) (-4457 . T) (-4456 . T)) 
 ((-2781 (|HasCategory| |#2| (LIST (QUOTE -378) (|devaluate| |#1|))) (|HasCategory| |#2| (LIST (QUOTE -429) (|devaluate| |#1|)))) (|HasCategory| |#2| (LIST (QUOTE -429) (|devaluate| |#1|))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -429) (|devaluate| |#1|)))) (-2781 (-12 (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#2| (LIST (QUOTE -378) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#2| (LIST (QUOTE -429) (|devaluate| |#1|))))) (|HasCategory| |#2| (LIST (QUOTE -378) (|devaluate| |#1|)))) 
 (-620 |Entry|) 
 ((|constructor| (NIL "This domain allows a random access file to be viewed both as a table and as a file object.")) (|pack!| (($ $) "\\spad{pack!(f)} reorganizes the file \\spad{f} on disk to recover unused space."))) 
@@ -2436,7 +2436,7 @@ NIL
 ((|constructor| (NIL "A is convertible to \\spad{B} means any element of A can be converted into an element of \\spad{B},{} but not automatically by the interpreter.")) (|convert| ((|#1| $) "\\spad{convert(a)} transforms a into an element of \\spad{S}."))) 
 NIL 
 NIL 
-(-627 -1967 UP) 
+(-627 -1966 UP) 
 ((|constructor| (NIL "\\spadtype{Kovacic} provides a modified Kovacic\\spad{'s} algorithm for solving explicitely irreducible 2nd order linear ordinary differential equations.")) (|kovacic| (((|Union| (|SparseUnivariatePolynomial| (|Fraction| |#2|)) "failed") (|Fraction| |#2|) (|Fraction| |#2|) (|Fraction| |#2|) (|Mapping| (|Factored| |#2|) |#2|)) "\\spad{kovacic(a_0,a_1,a_2,ezfactor)} returns either \"failed\" or \\spad{P}(\\spad{u}) such that \\spad{\\$e^{\\int(-a_1/2a_2)} e^{\\int u}\\$} is a solution of \\indented{5}{\\spad{\\$a_2 y'' + a_1 y' + a0 y = 0\\$}} whenever \\spad{u} is a solution of \\spad{P u = 0}. The equation must be already irreducible over the rational functions. Argument \\spad{ezfactor} is a factorisation in \\spad{UP},{} not necessarily into irreducibles.") (((|Union| (|SparseUnivariatePolynomial| (|Fraction| |#2|)) "failed") (|Fraction| |#2|) (|Fraction| |#2|) (|Fraction| |#2|)) "\\spad{kovacic(a_0,a_1,a_2)} returns either \"failed\" or \\spad{P}(\\spad{u}) such that \\spad{\\$e^{\\int(-a_1/2a_2)} e^{\\int u}\\$} is a solution of \\indented{5}{\\spad{a_2 y'' + a_1 y' + a0 y = 0}} whenever \\spad{u} is a solution of \\spad{P u = 0}. The equation must be already irreducible over the rational functions."))) 
 NIL 
 NIL 
@@ -2464,7 +2464,7 @@ NIL
 ((|constructor| (NIL "LocalAlgebra produces the localization of an algebra,{} \\spadignore{i.e.} fractions whose numerators come from some \\spad{R} algebra.")) (|denom| ((|#3| $) "\\spad{denom x} returns the denominator of \\spad{x}.")) (|numer| ((|#1| $) "\\spad{numer x} returns the numerator of \\spad{x}.")) (/ (($ |#1| |#3|) "\\spad{a / d} divides the element \\spad{a} by \\spad{d}.") (($ $ |#3|) "\\spad{x / d} divides the element \\spad{x} by \\spad{d}."))) 
 ((-4456 . T) (-4457 . T) (-4459 . T)) 
 ((|HasCategory| |#1| (QUOTE (-860)))) 
-(-634 R -1967) 
+(-634 R -1966) 
 ((|constructor| (NIL "This package computes the forward Laplace Transform.")) (|laplace| ((|#2| |#2| (|Symbol|) (|Symbol|)) "\\spad{laplace(f, t, s)} returns the Laplace transform of \\spad{f(t)} using \\spad{s} as the new variable. This is \\spad{integral(exp(-s*t)*f(t), t = 0..\\%plusInfinity)}. Returns the formal object \\spad{laplace(f, t, s)} if it cannot compute the transform."))) 
 NIL 
 NIL 
@@ -2496,11 +2496,11 @@ NIL
 ((|constructor| (NIL "Category for the transcendental Liouvillian functions.")) (|erf| (($ $) "\\spad{erf(x)} returns the error function of \\spad{x},{} \\spadignore{i.e.} \\spad{2 / sqrt(\\%pi)} times the integral of \\spad{exp(-x**2) dx}.")) (|dilog| (($ $) "\\spad{dilog(x)} returns the dilogarithm of \\spad{x},{} \\spadignore{i.e.} the integral of \\spad{log(x) / (1 - x) dx}.")) (|li| (($ $) "\\spad{li(x)} returns the logarithmic integral of \\spad{x},{} \\spadignore{i.e.} the integral of \\spad{dx / log(x)}.")) (|Ci| (($ $) "\\spad{Ci(x)} returns the cosine integral of \\spad{x},{} \\spadignore{i.e.} the integral of \\spad{cos(x) / x dx}.")) (|Si| (($ $) "\\spad{Si(x)} returns the sine integral of \\spad{x},{} \\spadignore{i.e.} the integral of \\spad{sin(x) / x dx}.")) (|Ei| (($ $) "\\spad{Ei(x)} returns the exponential integral of \\spad{x},{} \\spadignore{i.e.} the integral of \\spad{exp(x)/x dx}."))) 
 NIL 
 NIL 
-(-642 R -1967) 
+(-642 R -1966) 
 ((|constructor| (NIL "This package provides liouvillian functions over an integral domain.")) (|integral| ((|#2| |#2| (|SegmentBinding| |#2|)) "\\spad{integral(f,x = a..b)} denotes the definite integral of \\spad{f} with respect to \\spad{x} from \\spad{a} to \\spad{b}.") ((|#2| |#2| (|Symbol|)) "\\spad{integral(f,x)} indefinite integral of \\spad{f} with respect to \\spad{x}.")) (|dilog| ((|#2| |#2|) "\\spad{dilog(f)} denotes the dilogarithm")) (|erf| ((|#2| |#2|) "\\spad{erf(f)} denotes the error function")) (|li| ((|#2| |#2|) "\\spad{li(f)} denotes the logarithmic integral")) (|Ci| ((|#2| |#2|) "\\spad{Ci(f)} denotes the cosine integral")) (|Si| ((|#2| |#2|) "\\spad{Si(f)} denotes the sine integral")) (|Ei| ((|#2| |#2|) "\\spad{Ei(f)} denotes the exponential integral")) (|operator| (((|BasicOperator|) (|BasicOperator|)) "\\spad{operator(op)} returns the Liouvillian operator based on \\spad{op}")) (|belong?| (((|Boolean|) (|BasicOperator|)) "\\spad{belong?(op)} checks if \\spad{op} is Liouvillian"))) 
 NIL 
 NIL 
-(-643 |lv| -1967) 
+(-643 |lv| -1966) 
 ((|constructor| (NIL "\\indented{1}{Given a Groebner basis \\spad{B} with respect to the total degree ordering for} a zero-dimensional ideal \\spad{I},{} compute a Groebner basis with respect to the lexicographical ordering by using linear algebra.")) (|transform| (((|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|) (|DistributedMultivariatePolynomial| |#1| |#2|)) "\\spad{transform }\\undocumented")) (|choosemon| (((|DistributedMultivariatePolynomial| |#1| |#2|) (|DistributedMultivariatePolynomial| |#1| |#2|) (|List| (|DistributedMultivariatePolynomial| |#1| |#2|))) "\\spad{choosemon }\\undocumented")) (|intcompBasis| (((|List| (|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|)) (|OrderedVariableList| |#1|) (|List| (|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|)) (|List| (|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|))) "\\spad{intcompBasis }\\undocumented")) (|anticoord| (((|DistributedMultivariatePolynomial| |#1| |#2|) (|List| |#2|) (|DistributedMultivariatePolynomial| |#1| |#2|) (|List| (|DistributedMultivariatePolynomial| |#1| |#2|))) "\\spad{anticoord }\\undocumented")) (|coord| (((|Vector| |#2|) (|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|) (|List| (|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|))) "\\spad{coord }\\undocumented")) (|computeBasis| (((|List| (|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|)) (|List| (|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|))) "\\spad{computeBasis }\\undocumented")) (|minPol| (((|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|) (|List| (|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|)) (|OrderedVariableList| |#1|)) "\\spad{minPol }\\undocumented") (((|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|) (|List| (|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|)) (|List| (|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|)) (|OrderedVariableList| |#1|)) "\\spad{minPol }\\undocumented")) (|totolex| (((|List| (|DistributedMultivariatePolynomial| |#1| |#2|)) (|List| (|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|))) "\\spad{totolex }\\undocumented")) (|groebgen| (((|Record| (|:| |glbase| (|List| (|DistributedMultivariatePolynomial| |#1| |#2|))) (|:| |glval| (|List| (|Integer|)))) (|List| (|DistributedMultivariatePolynomial| |#1| |#2|))) "\\spad{groebgen }\\undocumented")) (|linGenPos| (((|Record| (|:| |gblist| (|List| (|DistributedMultivariatePolynomial| |#1| |#2|))) (|:| |gvlist| (|List| (|Integer|)))) (|List| (|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|))) "\\spad{linGenPos }\\undocumented"))) 
 NIL 
 NIL 
@@ -2518,7 +2518,7 @@ NIL
 NIL 
 (-647 R A) 
 ((|constructor| (NIL "AssociatedLieAlgebra takes an algebra \\spad{A} and uses \\spadfun{*\\$A} to define the Lie bracket \\spad{a*b := (a *\\$A b - b *\\$A a)} (commutator). Note that the notation \\spad{[a,b]} cannot be used due to restrictions of the current compiler. This domain only gives a Lie algebra if the Jacobi-identity \\spad{(a*b)*c + (b*c)*a + (c*a)*b = 0} holds for all \\spad{a},{}\\spad{b},{}\\spad{c} in \\spad{A}. This relation can be checked by \\spad{lieAdmissible?()\\$A}. \\blankline If the underlying algebra is of type \\spadtype{FramedNonAssociativeAlgebra(R)} (\\spadignore{i.e.} a non associative algebra over \\spad{R} which is a free \\spad{R}-module of finite rank,{} together with a fixed \\spad{R}-module basis),{} then the same is \\spad{true} for the associated Lie algebra. Also,{} if the underlying algebra is of type \\spadtype{FiniteRankNonAssociativeAlgebra(R)} (\\spadignore{i.e.} a non associative algebra over \\spad{R} which is a free \\spad{R}-module of finite rank),{} then the same is \\spad{true} for the associated Lie algebra.")) (|coerce| (($ |#2|) "\\spad{coerce(a)} coerces the element \\spad{a} of the algebra \\spad{A} to an element of the Lie algebra \\spadtype{AssociatedLieAlgebra}(\\spad{R},{}A)."))) 
-((-4459 -2781 (-2696 (|has| |#2| (-378 |#1|)) (|has| |#1| (-568))) (-12 (|has| |#2| (-429 |#1|)) (|has| |#1| (-568)))) (-4457 . T) (-4456 . T)) 
+((-4459 -2781 (-2697 (|has| |#2| (-378 |#1|)) (|has| |#1| (-568))) (-12 (|has| |#2| (-429 |#1|)) (|has| |#1| (-568)))) (-4457 . T) (-4456 . T)) 
 ((-2781 (|HasCategory| |#2| (LIST (QUOTE -378) (|devaluate| |#1|))) (|HasCategory| |#2| (LIST (QUOTE -429) (|devaluate| |#1|)))) (|HasCategory| |#2| (LIST (QUOTE -429) (|devaluate| |#1|))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -429) (|devaluate| |#1|)))) (-2781 (-12 (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#2| (LIST (QUOTE -378) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#2| (LIST (QUOTE -429) (|devaluate| |#1|))))) (|HasCategory| |#2| (LIST (QUOTE -378) (|devaluate| |#1|)))) 
 (-648 R FE) 
 ((|constructor| (NIL "PowerSeriesLimitPackage implements limits of expressions in one or more variables as one of the variables approaches a limiting value. Included are two-sided limits,{} left- and right- hand limits,{} and limits at plus or minus infinity.")) (|complexLimit| (((|Union| (|OnePointCompletion| |#2|) "failed") |#2| (|Equation| (|OnePointCompletion| |#2|))) "\\spad{complexLimit(f(x),x = a)} computes the complex limit \\spad{lim(x -> a,f(x))}.")) (|limit| (((|Union| (|OrderedCompletion| |#2|) "failed") |#2| (|Equation| |#2|) (|String|)) "\\spad{limit(f(x),x=a,\"left\")} computes the left hand real limit \\spad{lim(x -> a-,f(x))}; \\spad{limit(f(x),x=a,\"right\")} computes the right hand real limit \\spad{lim(x -> a+,f(x))}.") (((|Union| (|OrderedCompletion| |#2|) (|Record| (|:| |leftHandLimit| (|Union| (|OrderedCompletion| |#2|) "failed")) (|:| |rightHandLimit| (|Union| (|OrderedCompletion| |#2|) "failed"))) "failed") |#2| (|Equation| (|OrderedCompletion| |#2|))) "\\spad{limit(f(x),x = a)} computes the real limit \\spad{lim(x -> a,f(x))}."))) 
@@ -2584,7 +2584,7 @@ NIL
 ((|constructor| (NIL "A linear aggregate is an aggregate whose elements are indexed by integers. Examples of linear aggregates are strings,{} lists,{} and arrays. Most of the exported operations for linear aggregates are non-destructive but are not always efficient for a particular aggregate. For example,{} \\spadfun{concat} of two lists needs only to copy its first argument,{} whereas \\spadfun{concat} of two arrays needs to copy both arguments. Most of the operations exported here apply to infinite objects (\\spadignore{e.g.} streams) as well to finite ones. For finite linear aggregates,{} see \\spadtype{FiniteLinearAggregate}.")) (|setelt| ((|#1| $ (|UniversalSegment| (|Integer|)) |#1|) "\\spad{setelt(u,i..j,x)} (also written: \\axiom{\\spad{u}(\\spad{i}..\\spad{j}) \\spad{:=} \\spad{x}}) destructively replaces each element in the segment \\axiom{\\spad{u}(\\spad{i}..\\spad{j})} by \\spad{x}. The value \\spad{x} is returned. Note: \\spad{u} is destructively change so that \\axiom{\\spad{u}.\\spad{k} \\spad{:=} \\spad{x} for \\spad{k} in \\spad{i}..\\spad{j}}; its length remains unchanged.")) (|insert| (($ $ $ (|Integer|)) "\\spad{insert(v,u,k)} returns a copy of \\spad{u} having \\spad{v} inserted beginning at the \\axiom{\\spad{i}}th element. Note: \\axiom{insert(\\spad{v},{}\\spad{u},{}\\spad{k}) = concat( \\spad{u}(0..\\spad{k}-1),{} \\spad{v},{} \\spad{u}(\\spad{k}..) )}.") (($ |#1| $ (|Integer|)) "\\spad{insert(x,u,i)} returns a copy of \\spad{u} having \\spad{x} as its \\axiom{\\spad{i}}th element. Note: \\axiom{insert(\\spad{x},{}a,{}\\spad{k}) = concat(concat(a(0..\\spad{k}-1),{}\\spad{x}),{}a(\\spad{k}..))}.")) (|delete| (($ $ (|UniversalSegment| (|Integer|))) "\\spad{delete(u,i..j)} returns a copy of \\spad{u} with the \\axiom{\\spad{i}}th through \\axiom{\\spad{j}}th element deleted. Note: \\axiom{delete(a,{}\\spad{i}..\\spad{j}) = concat(a(0..\\spad{i}-1),{}a(\\spad{j+1}..))}.") (($ $ (|Integer|)) "\\spad{delete(u,i)} returns a copy of \\spad{u} with the \\axiom{\\spad{i}}th element deleted. Note: for lists,{} \\axiom{delete(a,{}\\spad{i}) \\spad{==} concat(a(0..\\spad{i} - 1),{}a(\\spad{i} + 1,{}..))}.")) (|map| (($ (|Mapping| |#1| |#1| |#1|) $ $) "\\spad{map(f,u,v)} returns a new collection \\spad{w} with elements \\axiom{\\spad{z} = \\spad{f}(\\spad{x},{}\\spad{y})} for corresponding elements \\spad{x} and \\spad{y} from \\spad{u} and \\spad{v}. Note: for linear aggregates,{} \\axiom{\\spad{w}.\\spad{i} = \\spad{f}(\\spad{u}.\\spad{i},{}\\spad{v}.\\spad{i})}.")) (|concat| (($ (|List| $)) "\\spad{concat(u)},{} where \\spad{u} is a lists of aggregates \\axiom{[a,{}\\spad{b},{}...,{}\\spad{c}]},{} returns a single aggregate consisting of the elements of \\axiom{a} followed by those of \\spad{b} followed ... by the elements of \\spad{c}. Note: \\axiom{concat(a,{}\\spad{b},{}...,{}\\spad{c}) = concat(a,{}concat(\\spad{b},{}...,{}\\spad{c}))}.") (($ $ $) "\\spad{concat(u,v)} returns an aggregate consisting of the elements of \\spad{u} followed by the elements of \\spad{v}. Note: if \\axiom{\\spad{w} = concat(\\spad{u},{}\\spad{v})} then \\axiom{\\spad{w}.\\spad{i} = \\spad{u}.\\spad{i} for \\spad{i} in indices \\spad{u}} and \\axiom{\\spad{w}.(\\spad{j} + maxIndex \\spad{u}) = \\spad{v}.\\spad{j} for \\spad{j} in indices \\spad{v}}.") (($ |#1| $) "\\spad{concat(x,u)} returns aggregate \\spad{u} with additional element at the front. Note: for lists: \\axiom{concat(\\spad{x},{}\\spad{u}) \\spad{==} concat([\\spad{x}],{}\\spad{u})}.") (($ $ |#1|) "\\spad{concat(u,x)} returns aggregate \\spad{u} with additional element \\spad{x} at the end. Note: for lists,{} \\axiom{concat(\\spad{u},{}\\spad{x}) \\spad{==} concat(\\spad{u},{}[\\spad{x}])}")) (|new| (($ (|NonNegativeInteger|) |#1|) "\\spad{new(n,x)} returns \\axiom{fill!(new \\spad{n},{}\\spad{x})}."))) 
 NIL 
 NIL 
-(-664 R -1967 L) 
+(-664 R -1966 L) 
 ((|constructor| (NIL "\\spad{ElementaryFunctionLODESolver} provides the top-level functions for finding closed form solutions of linear ordinary differential equations and initial value problems.")) (|solve| (((|Union| |#2| "failed") |#3| |#2| (|Symbol|) |#2| (|List| |#2|)) "\\spad{solve(op, g, x, a, [y0,...,ym])} returns either the solution of the initial value problem \\spad{op y = g, y(a) = y0, y'(a) = y1,...} or \"failed\" if the solution cannot be found; \\spad{x} is the dependent variable.") (((|Union| (|Record| (|:| |particular| |#2|) (|:| |basis| (|List| |#2|))) "failed") |#3| |#2| (|Symbol|)) "\\spad{solve(op, g, x)} returns either a solution of the ordinary differential equation \\spad{op y = g} or \"failed\" if no non-trivial solution can be found; When found,{} the solution is returned in the form \\spad{[h, [b1,...,bm]]} where \\spad{h} is a particular solution and and \\spad{[b1,...bm]} are linearly independent solutions of the associated homogenuous equation \\spad{op y = 0}. A full basis for the solutions of the homogenuous equation is not always returned,{} only the solutions which were found; \\spad{x} is the dependent variable."))) 
 NIL 
 NIL 
@@ -2604,11 +2604,11 @@ NIL
 ((|constructor| (NIL "\\spad{LinearOrdinaryDifferentialOperatorCategory} is the category of differential operators with coefficients in a ring A with a given derivation. Multiplication of operators corresponds to functional composition: \\indented{4}{\\spad{(L1 * L2).(f) = L1 L2 f}}")) (|directSum| (($ $ $) "\\spad{directSum(a,b)} computes an operator \\spad{c} of minimal order such that the nullspace of \\spad{c} is generated by all the sums of a solution of \\spad{a} by a solution of \\spad{b}.")) (|symmetricSquare| (($ $) "\\spad{symmetricSquare(a)} computes \\spad{symmetricProduct(a,a)} using a more efficient method.")) (|symmetricPower| (($ $ (|NonNegativeInteger|)) "\\spad{symmetricPower(a,n)} computes an operator \\spad{c} of minimal order such that the nullspace of \\spad{c} is generated by all the products of \\spad{n} solutions of \\spad{a}.")) (|symmetricProduct| (($ $ $) "\\spad{symmetricProduct(a,b)} computes an operator \\spad{c} of minimal order such that the nullspace of \\spad{c} is generated by all the products of a solution of \\spad{a} by a solution of \\spad{b}.")) (|adjoint| (($ $) "\\spad{adjoint(a)} returns the adjoint operator of a.")) (D (($) "\\spad{D()} provides the operator corresponding to a derivation in the ring \\spad{A}."))) 
 ((-4456 . T) (-4457 . T) (-4459 . T)) 
 NIL 
-(-669 -1967 UP) 
+(-669 -1966 UP) 
 ((|constructor| (NIL "\\spadtype{LinearOrdinaryDifferentialOperatorFactorizer} provides a factorizer for linear ordinary differential operators whose coefficients are rational functions.")) (|factor1| (((|List| (|LinearOrdinaryDifferentialOperator1| (|Fraction| |#2|))) (|LinearOrdinaryDifferentialOperator1| (|Fraction| |#2|))) "\\spad{factor1(a)} returns the factorisation of a,{} assuming that a has no first-order right factor.")) (|factor| (((|List| (|LinearOrdinaryDifferentialOperator1| (|Fraction| |#2|))) (|LinearOrdinaryDifferentialOperator1| (|Fraction| |#2|))) "\\spad{factor(a)} returns the factorisation of a.") (((|List| (|LinearOrdinaryDifferentialOperator1| (|Fraction| |#2|))) (|LinearOrdinaryDifferentialOperator1| (|Fraction| |#2|)) (|Mapping| (|List| |#1|) |#2|)) "\\spad{factor(a, zeros)} returns the factorisation of a. \\spad{zeros} is a zero finder in \\spad{UP}."))) 
 NIL 
 ((|HasCategory| |#1| (QUOTE (-27)))) 
-(-670 A -4020) 
+(-670 A -4138) 
 ((|constructor| (NIL "\\spad{LinearOrdinaryDifferentialOperator} defines a ring of differential operators with coefficients in a ring A with a given derivation. Multiplication of operators corresponds to functional composition: \\indented{4}{\\spad{(L1 * L2).(f) = L1 L2 f}}"))) 
 ((-4456 . T) (-4457 . T) (-4459 . T)) 
 ((|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (LIST (QUOTE -1057) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| |#1| (LIST (QUOTE -1057) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-374)))) 
@@ -2644,11 +2644,11 @@ NIL
 ((|constructor| (NIL "A list aggregate is a model for a linked list data structure. A linked list is a versatile data structure. Insertion and deletion are efficient and searching is a linear operation.")) (|list| (($ |#1|) "\\spad{list(x)} returns the list of one element \\spad{x}."))) 
 ((-4463 . T) (-4462 . T)) 
 NIL 
-(-679 -1967) 
+(-679 -1966) 
 ((|constructor| (NIL "This package solves linear system in the matrix form \\spad{AX = B}. It is essentially a particular instantiation of the package \\spadtype{LinearSystemMatrixPackage} for Matrix and Vector. This package\\spad{'s} existence makes it easier to use \\spadfun{solve} in the AXIOM interpreter.")) (|rank| (((|NonNegativeInteger|) (|Matrix| |#1|) (|Vector| |#1|)) "\\spad{rank(A,B)} computes the rank of the complete matrix \\spad{(A|B)} of the linear system \\spad{AX = B}.")) (|hasSolution?| (((|Boolean|) (|Matrix| |#1|) (|Vector| |#1|)) "\\spad{hasSolution?(A,B)} tests if the linear system \\spad{AX = B} has a solution.")) (|particularSolution| (((|Union| (|Vector| |#1|) "failed") (|Matrix| |#1|) (|Vector| |#1|)) "\\spad{particularSolution(A,B)} finds a particular solution of the linear system \\spad{AX = B}.")) (|solve| (((|List| (|Record| (|:| |particular| (|Union| (|Vector| |#1|) "failed")) (|:| |basis| (|List| (|Vector| |#1|))))) (|List| (|List| |#1|)) (|List| (|Vector| |#1|))) "\\spad{solve(A,LB)} finds a particular soln of the systems \\spad{AX = B} and a basis of the associated homogeneous systems \\spad{AX = 0} where \\spad{B} varies in the list of column vectors \\spad{LB}.") (((|List| (|Record| (|:| |particular| (|Union| (|Vector| |#1|) "failed")) (|:| |basis| (|List| (|Vector| |#1|))))) (|Matrix| |#1|) (|List| (|Vector| |#1|))) "\\spad{solve(A,LB)} finds a particular soln of the systems \\spad{AX = B} and a basis of the associated homogeneous systems \\spad{AX = 0} where \\spad{B} varies in the list of column vectors \\spad{LB}.") (((|Record| (|:| |particular| (|Union| (|Vector| |#1|) "failed")) (|:| |basis| (|List| (|Vector| |#1|)))) (|List| (|List| |#1|)) (|Vector| |#1|)) "\\spad{solve(A,B)} finds a particular solution of the system \\spad{AX = B} and a basis of the associated homogeneous system \\spad{AX = 0}.") (((|Record| (|:| |particular| (|Union| (|Vector| |#1|) "failed")) (|:| |basis| (|List| (|Vector| |#1|)))) (|Matrix| |#1|) (|Vector| |#1|)) "\\spad{solve(A,B)} finds a particular solution of the system \\spad{AX = B} and a basis of the associated homogeneous system \\spad{AX = 0}."))) 
 NIL 
 NIL 
-(-680 -1967 |Row| |Col| M) 
+(-680 -1966 |Row| |Col| M) 
 ((|constructor| (NIL "This package solves linear system in the matrix form \\spad{AX = B}.")) (|rank| (((|NonNegativeInteger|) |#4| |#3|) "\\spad{rank(A,B)} computes the rank of the complete matrix \\spad{(A|B)} of the linear system \\spad{AX = B}.")) (|hasSolution?| (((|Boolean|) |#4| |#3|) "\\spad{hasSolution?(A,B)} tests if the linear system \\spad{AX = B} has a solution.")) (|particularSolution| (((|Union| |#3| "failed") |#4| |#3|) "\\spad{particularSolution(A,B)} finds a particular solution of the linear system \\spad{AX = B}.")) (|solve| (((|List| (|Record| (|:| |particular| (|Union| |#3| "failed")) (|:| |basis| (|List| |#3|)))) |#4| (|List| |#3|)) "\\spad{solve(A,LB)} finds a particular soln of the systems \\spad{AX = B} and a basis of the associated homogeneous systems \\spad{AX = 0} where \\spad{B} varies in the list of column vectors \\spad{LB}.") (((|Record| (|:| |particular| (|Union| |#3| "failed")) (|:| |basis| (|List| |#3|))) |#4| |#3|) "\\spad{solve(A,B)} finds a particular solution of the system \\spad{AX = B} and a basis of the associated homogeneous system \\spad{AX = 0}."))) 
 NIL 
 NIL 
@@ -2721,11 +2721,11 @@ NIL
 NIL 
 NIL 
 (-698 S R |Row| |Col|) 
-((|constructor| (NIL "\\spadtype{MatrixCategory} is a general matrix category which allows different representations and indexing schemes. Rows and columns may be extracted with rows returned as objects of type Row and colums returned as objects of type Col. A domain belonging to this category will be shallowly mutable. The index of the 'first' row may be obtained by calling the function \\spadfun{minRowIndex}. The index of the 'first' column may be obtained by calling the function \\spadfun{minColIndex}. The index of the first element of a Row is the same as the index of the first column in a matrix and vice versa.")) (|inverse| (((|Union| $ "failed") $) "\\spad{inverse(m)} returns the inverse of the matrix \\spad{m}. If the matrix is not invertible,{} \"failed\" is returned. Error: if the matrix is not square.")) (|minordet| ((|#2| $) "\\spad{minordet(m)} computes the determinant of the matrix \\spad{m} using minors. Error: if the matrix is not square.")) (|determinant| ((|#2| $) "\\spad{determinant(m)} returns the determinant of the matrix \\spad{m}. Error: if the matrix is not square.")) (|nullSpace| (((|List| |#4|) $) "\\spad{nullSpace(m)} returns a basis for the null space of the matrix \\spad{m}.")) (|nullity| (((|NonNegativeInteger|) $) "\\spad{nullity(m)} returns the nullity of the matrix \\spad{m}. This is the dimension of the null space of the matrix \\spad{m}.")) (|rank| (((|NonNegativeInteger|) $) "\\spad{rank(m)} returns the rank of the matrix \\spad{m}.")) (|rowEchelon| (($ $) "\\spad{rowEchelon(m)} returns the row echelon form of the matrix \\spad{m}.")) (/ (($ $ |#2|) "\\spad{m/r} divides the elements of \\spad{m} by \\spad{r}. Error: if \\spad{r = 0}.")) (|exquo| (((|Union| $ "failed") $ |#2|) "\\spad{exquo(m,r)} computes the exact quotient of the elements of \\spad{m} by \\spad{r},{} returning \\axiom{\"failed\"} if this is not possible.")) (** (($ $ (|Integer|)) "\\spad{m**n} computes an integral power of the matrix \\spad{m}. Error: if matrix is not square or if the matrix is square but not invertible.") (($ $ (|NonNegativeInteger|)) "\\spad{x ** n} computes a non-negative integral power of the matrix \\spad{x}. Error: if the matrix is not square.")) (* ((|#3| |#3| $) "\\spad{r * x} is the product of the row vector \\spad{r} and the matrix \\spad{x}. Error: if the dimensions are incompatible.") ((|#4| $ |#4|) "\\spad{x * c} is the product of the matrix \\spad{x} and the column vector \\spad{c}. Error: if the dimensions are incompatible.") (($ (|Integer|) $) "\\spad{n * x} is an integer multiple.") (($ $ |#2|) "\\spad{x * r} is the right scalar multiple of the scalar \\spad{r} and the matrix \\spad{x}.") (($ |#2| $) "\\spad{r*x} is the left scalar multiple of the scalar \\spad{r} and the matrix \\spad{x}.") (($ $ $) "\\spad{x * y} is the product of the matrices \\spad{x} and \\spad{y}. Error: if the dimensions are incompatible.")) (- (($ $) "\\spad{-x} returns the negative of the matrix \\spad{x}.") (($ $ $) "\\spad{x - y} is the difference of the matrices \\spad{x} and \\spad{y}. Error: if the dimensions are incompatible.")) (+ (($ $ $) "\\spad{x + y} is the sum of the matrices \\spad{x} and \\spad{y}. Error: if the dimensions are incompatible.")) (|setsubMatrix!| (($ $ (|Integer|) (|Integer|) $) "\\spad{setsubMatrix(x,i1,j1,y)} destructively alters the matrix \\spad{x}. Here \\spad{x(i,j)} is set to \\spad{y(i-i1+1,j-j1+1)} for \\spad{i = i1,...,i1-1+nrows y} and \\spad{j = j1,...,j1-1+ncols y}.")) (|subMatrix| (($ $ (|Integer|) (|Integer|) (|Integer|) (|Integer|)) "\\spad{subMatrix(x,i1,i2,j1,j2)} extracts the submatrix \\spad{[x(i,j)]} where the index \\spad{i} ranges from \\spad{i1} to \\spad{i2} and the index \\spad{j} ranges from \\spad{j1} to \\spad{j2}.")) (|swapColumns!| (($ $ (|Integer|) (|Integer|)) "\\spad{swapColumns!(m,i,j)} interchanges the \\spad{i}th and \\spad{j}th columns of \\spad{m}. This destructively alters the matrix.")) (|swapRows!| (($ $ (|Integer|) (|Integer|)) "\\spad{swapRows!(m,i,j)} interchanges the \\spad{i}th and \\spad{j}th rows of \\spad{m}. This destructively alters the matrix.")) (|setelt| (($ $ (|List| (|Integer|)) (|List| (|Integer|)) $) "\\spad{setelt(x,rowList,colList,y)} destructively alters the matrix \\spad{x}. If \\spad{y} is \\spad{m}-by-\\spad{n},{} \\spad{rowList = [i<1>,i<2>,...,i<m>]} and \\spad{colList = [j<1>,j<2>,...,j<n>]},{} then \\spad{x(i<k>,j<l>)} is set to \\spad{y(k,l)} for \\spad{k = 1,...,m} and \\spad{l = 1,...,n}.")) (|elt| (($ $ (|List| (|Integer|)) (|List| (|Integer|))) "\\spad{elt(x,rowList,colList)} returns an \\spad{m}-by-\\spad{n} matrix consisting of elements of \\spad{x},{} where \\spad{m = \\# rowList} and \\spad{n = \\# colList}. If \\spad{rowList = [i<1>,i<2>,...,i<m>]} and \\spad{colList = [j<1>,j<2>,...,j<n>]},{} then the \\spad{(k,l)}th entry of \\spad{elt(x,rowList,colList)} is \\spad{x(i<k>,j<l>)}.")) (|listOfLists| (((|List| (|List| |#2|)) $) "\\spad{listOfLists(m)} returns the rows of the matrix \\spad{m} as a list of lists.")) (|vertConcat| (($ $ $) "\\spad{vertConcat(x,y)} vertically concatenates two matrices with an equal number of columns. The entries of \\spad{y} appear below of the entries of \\spad{x}. Error: if the matrices do not have the same number of columns.")) (|horizConcat| (($ $ $) "\\spad{horizConcat(x,y)} horizontally concatenates two matrices with an equal number of rows. The entries of \\spad{y} appear to the right of the entries of \\spad{x}. Error: if the matrices do not have the same number of rows.")) (|squareTop| (($ $) "\\spad{squareTop(m)} returns an \\spad{n}-by-\\spad{n} matrix consisting of the first \\spad{n} rows of the \\spad{m}-by-\\spad{n} matrix \\spad{m}. Error: if \\spad{m < n}.")) (|transpose| (($ $) "\\spad{transpose(m)} returns the transpose of the matrix \\spad{m}.") (($ |#3|) "\\spad{transpose(r)} converts the row \\spad{r} to a row matrix.")) (|coerce| (($ |#4|) "\\spad{coerce(col)} converts the column \\spad{col} to a column matrix.")) (|diagonalMatrix| (($ (|List| $)) "\\spad{diagonalMatrix([m1,...,mk])} creates a block diagonal matrix \\spad{M} with block matrices {\\em m1},{}...,{}{\\em mk} down the diagonal,{} with 0 block matrices elsewhere. More precisly: if \\spad{ri := nrows mi},{} \\spad{ci := ncols mi},{} then \\spad{m} is an (\\spad{r1+}..\\spad{+rk}) by (\\spad{c1+}..\\spad{+ck}) - matrix with entries \\spad{m.i.j = ml.(i-r1-..-r(l-1)).(j-n1-..-n(l-1))},{} if \\spad{(r1+..+r(l-1)) < i <= r1+..+rl} and \\spad{(c1+..+c(l-1)) < i <= c1+..+cl},{} \\spad{m.i.j} = 0 otherwise.") (($ (|List| |#2|)) "\\spad{diagonalMatrix(l)} returns a diagonal matrix with the elements of \\spad{l} on the diagonal.")) (|scalarMatrix| (($ (|NonNegativeInteger|) |#2|) "\\spad{scalarMatrix(n,r)} returns an \\spad{n}-by-\\spad{n} matrix with \\spad{r}\\spad{'s} on the diagonal and zeroes elsewhere.")) (|matrix| (($ (|List| (|List| |#2|))) "\\spad{matrix(l)} converts the list of lists \\spad{l} to a matrix,{} where the list of lists is viewed as a list of the rows of the matrix.")) (|zero| (($ (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{zero(m,n)} returns an \\spad{m}-by-\\spad{n} zero matrix.")) (|antisymmetric?| (((|Boolean|) $) "\\spad{antisymmetric?(m)} returns \\spad{true} if the matrix \\spad{m} is square and antisymmetric (\\spadignore{i.e.} \\spad{m[i,j] = -m[j,i]} for all \\spad{i} and \\spad{j}) and \\spad{false} otherwise.")) (|symmetric?| (((|Boolean|) $) "\\spad{symmetric?(m)} returns \\spad{true} if the matrix \\spad{m} is square and symmetric (\\spadignore{i.e.} \\spad{m[i,j] = m[j,i]} for all \\spad{i} and \\spad{j}) and \\spad{false} otherwise.")) (|diagonal?| (((|Boolean|) $) "\\spad{diagonal?(m)} returns \\spad{true} if the matrix \\spad{m} is square and diagonal (\\spadignore{i.e.} all entries of \\spad{m} not on the diagonal are zero) and \\spad{false} otherwise.")) (|square?| (((|Boolean|) $) "\\spad{square?(m)} returns \\spad{true} if \\spad{m} is a square matrix (\\spadignore{i.e.} if \\spad{m} has the same number of rows as columns) and \\spad{false} otherwise.")) (|finiteAggregate| ((|attribute|) "matrices are finite")) (|shallowlyMutable| ((|attribute|) "One may destructively alter matrices"))) 
+((|constructor| (NIL "\\spadtype{MatrixCategory} is a general matrix category which allows different representations and indexing schemes. Rows and columns may be extracted with rows returned as objects of type Row and colums returned as objects of type Col. A domain belonging to this category will be shallowly mutable. The index of the 'first' row may be obtained by calling the function \\spadfun{minRowIndex}. The index of the 'first' column may be obtained by calling the function \\spadfun{minColIndex}. The index of the first element of a Row is the same as the index of the first column in a matrix and vice versa.")) (|inverse| (((|Union| $ "failed") $) "\\spad{inverse(m)} returns the inverse of the matrix \\spad{m}. If the matrix is not invertible,{} \"failed\" is returned. Error: if the matrix is not square.")) (|minordet| ((|#2| $) "\\spad{minordet(m)} computes the determinant of the matrix \\spad{m} using minors. Error: if the matrix is not square.")) (|determinant| ((|#2| $) "\\spad{determinant(m)} returns the determinant of the matrix \\spad{m}. Error: if the matrix is not square.")) (|nullSpace| (((|List| |#4|) $) "\\spad{nullSpace(m)} returns a basis for the null space of the matrix \\spad{m}.")) (|nullity| (((|NonNegativeInteger|) $) "\\spad{nullity(m)} returns the nullity of the matrix \\spad{m}. This is the dimension of the null space of the matrix \\spad{m}.")) (|rank| (((|NonNegativeInteger|) $) "\\spad{rank(m)} returns the rank of the matrix \\spad{m}.")) (|rowEchelon| (($ $) "\\spad{rowEchelon(m)} returns the row echelon form of the matrix \\spad{m}.")) (/ (($ $ |#2|) "\\spad{m/r} divides the elements of \\spad{m} by \\spad{r}. Error: if \\spad{r = 0}.")) (|exquo| (((|Union| $ "failed") $ |#2|) "\\spad{exquo(m,r)} computes the exact quotient of the elements of \\spad{m} by \\spad{r},{} returning \\axiom{\"failed\"} if this is not possible.")) (** (($ $ (|Integer|)) "\\spad{m**n} computes an integral power of the matrix \\spad{m}. Error: if matrix is not square or if the matrix is square but not invertible.") (($ $ (|NonNegativeInteger|)) "\\spad{x ** n} computes a non-negative integral power of the matrix \\spad{x}. Error: if the matrix is not square.")) (* ((|#3| |#3| $) "\\spad{r * x} is the product of the row vector \\spad{r} and the matrix \\spad{x}. Error: if the dimensions are incompatible.") ((|#4| $ |#4|) "\\spad{x * c} is the product of the matrix \\spad{x} and the column vector \\spad{c}. Error: if the dimensions are incompatible.") (($ (|Integer|) $) "\\spad{n * x} is an integer multiple.") (($ $ |#2|) "\\spad{x * r} is the right scalar multiple of the scalar \\spad{r} and the matrix \\spad{x}.") (($ |#2| $) "\\spad{r*x} is the left scalar multiple of the scalar \\spad{r} and the matrix \\spad{x}.") (($ $ $) "\\spad{x * y} is the product of the matrices \\spad{x} and \\spad{y}. Error: if the dimensions are incompatible.")) (- (($ $) "\\spad{-x} returns the negative of the matrix \\spad{x}.") (($ $ $) "\\spad{x - y} is the difference of the matrices \\spad{x} and \\spad{y}. Error: if the dimensions are incompatible.")) (+ (($ $ $) "\\spad{x + y} is the sum of the matrices \\spad{x} and \\spad{y}. Error: if the dimensions are incompatible.")) (|setsubMatrix!| (($ $ (|Integer|) (|Integer|) $) "\\spad{setsubMatrix(x,i1,j1,y)} destructively alters the matrix \\spad{x}. Here \\spad{x(i,j)} is set to \\spad{y(i-i1+1,j-j1+1)} for \\spad{i = i1,...,i1-1+nrows y} and \\spad{j = j1,...,j1-1+ncols y}.")) (|subMatrix| (($ $ (|Integer|) (|Integer|) (|Integer|) (|Integer|)) "\\spad{subMatrix(x,i1,i2,j1,j2)} extracts the submatrix \\spad{[x(i,j)]} where the index \\spad{i} ranges from \\spad{i1} to \\spad{i2} and the index \\spad{j} ranges from \\spad{j1} to \\spad{j2}.")) (|swapColumns!| (($ $ (|Integer|) (|Integer|)) "\\spad{swapColumns!(m,i,j)} interchanges the \\spad{i}th and \\spad{j}th columns of \\spad{m}. This destructively alters the matrix.")) (|swapRows!| (($ $ (|Integer|) (|Integer|)) "\\spad{swapRows!(m,i,j)} interchanges the \\spad{i}th and \\spad{j}th rows of \\spad{m}. This destructively alters the matrix.")) (|setelt| (($ $ (|List| (|Integer|)) (|List| (|Integer|)) $) "\\spad{setelt(x,rowList,colList,y)} destructively alters the matrix \\spad{x}. If \\spad{y} is \\spad{m}-by-\\spad{n},{} \\spad{rowList = [i<1>,i<2>,...,i<m>]} and \\spad{colList = [j<1>,j<2>,...,j<n>]},{} then \\spad{x(i<k>,j<l>)} is set to \\spad{y(k,l)} for \\spad{k = 1,...,m} and \\spad{l = 1,...,n}.")) (|elt| (($ $ (|List| (|Integer|)) (|List| (|Integer|))) "\\spad{elt(x,rowList,colList)} returns an \\spad{m}-by-\\spad{n} matrix consisting of elements of \\spad{x},{} where \\spad{m = \\# rowList} and \\spad{n = \\# colList}. If \\spad{rowList = [i<1>,i<2>,...,i<m>]} and \\spad{colList = [j<1>,j<2>,...,j<n>]},{} then the \\spad{(k,l)}th entry of \\spad{elt(x,rowList,colList)} is \\spad{x(i<k>,j<l>)}.")) (|listOfLists| (((|List| (|List| |#2|)) $) "\\spad{listOfLists(m)} returns the rows of the matrix \\spad{m} as a list of lists.")) (|vertConcat| (($ $ $) "\\spad{vertConcat(x,y)} vertically concatenates two matrices with an equal number of columns. The entries of \\spad{y} appear below of the entries of \\spad{x}. Error: if the matrices do not have the same number of columns.")) (|horizConcat| (($ $ $) "\\spad{horizConcat(x,y)} horizontally concatenates two matrices with an equal number of rows. The entries of \\spad{y} appear to the right of the entries of \\spad{x}. Error: if the matrices do not have the same number of rows.")) (|squareTop| (($ $) "\\spad{squareTop(m)} returns an \\spad{n}-by-\\spad{n} matrix consisting of the first \\spad{n} rows of the \\spad{m}-by-\\spad{n} matrix \\spad{m}. Error: if \\spad{m < n}.")) (|transpose| (($ $) "\\spad{transpose(m)} returns the transpose of the matrix \\spad{m}.") (($ |#3|) "\\spad{transpose(r)} converts the row \\spad{r} to a row matrix.")) (|coerce| (($ |#4|) "\\spad{coerce(col)} converts the column \\spad{col} to a column matrix.")) (|diagonalMatrix| (($ (|List| $)) "\\spad{diagonalMatrix([m1,...,mk])} creates a block diagonal matrix \\spad{M} with block matrices {\\em m1},{}...,{}{\\em mk} down the diagonal,{} with 0 block matrices elsewhere. More precisly: if \\spad{ri := nrows mi},{} \\spad{ci := ncols mi},{} then \\spad{m} is an (\\spad{r1+}..\\spad{+rk}) by (\\spad{c1+}..\\spad{+ck}) - matrix with entries \\spad{m.i.j = ml.(i-r1-..-r(l-1)).(j-n1-..-n(l-1))},{} if \\spad{(r1+..+r(l-1)) < i <= r1+..+rl} and \\spad{(c1+..+c(l-1)) < i <= c1+..+cl},{} \\spad{m.i.j} = 0 otherwise.") (($ (|List| |#2|)) "\\spad{diagonalMatrix(l)} returns a diagonal matrix with the elements of \\spad{l} on the diagonal.")) (|scalarMatrix| (($ (|NonNegativeInteger|) |#2|) "\\spad{scalarMatrix(n,r)} returns an \\spad{n}-by-\\spad{n} matrix with \\spad{r}\\spad{'s} on the diagonal and zeroes elsewhere.")) (|matrix| (($ (|NonNegativeInteger|) (|NonNegativeInteger|) (|Mapping| |#2| (|Integer|) (|Integer|))) "\\spad{matrix(n,m,f)} construcys and \\spad{n * m} matrix with the \\spad{(i,j)} entry equal to \\spad{f(i,j)}.") (($ (|List| (|List| |#2|))) "\\spad{matrix(l)} converts the list of lists \\spad{l} to a matrix,{} where the list of lists is viewed as a list of the rows of the matrix.")) (|zero| (($ (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{zero(m,n)} returns an \\spad{m}-by-\\spad{n} zero matrix.")) (|antisymmetric?| (((|Boolean|) $) "\\spad{antisymmetric?(m)} returns \\spad{true} if the matrix \\spad{m} is square and antisymmetric (\\spadignore{i.e.} \\spad{m[i,j] = -m[j,i]} for all \\spad{i} and \\spad{j}) and \\spad{false} otherwise.")) (|symmetric?| (((|Boolean|) $) "\\spad{symmetric?(m)} returns \\spad{true} if the matrix \\spad{m} is square and symmetric (\\spadignore{i.e.} \\spad{m[i,j] = m[j,i]} for all \\spad{i} and \\spad{j}) and \\spad{false} otherwise.")) (|diagonal?| (((|Boolean|) $) "\\spad{diagonal?(m)} returns \\spad{true} if the matrix \\spad{m} is square and diagonal (\\spadignore{i.e.} all entries of \\spad{m} not on the diagonal are zero) and \\spad{false} otherwise.")) (|square?| (((|Boolean|) $) "\\spad{square?(m)} returns \\spad{true} if \\spad{m} is a square matrix (\\spadignore{i.e.} if \\spad{m} has the same number of rows as columns) and \\spad{false} otherwise.")) (|finiteAggregate| ((|attribute|) "matrices are finite")) (|shallowlyMutable| ((|attribute|) "One may destructively alter matrices"))) 
 NIL 
 ((|HasAttribute| |#2| (QUOTE (-4464 "*"))) (|HasCategory| |#2| (QUOTE (-317))) (|HasCategory| |#2| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-568)))) 
 (-699 R |Row| |Col|) 
-((|constructor| (NIL "\\spadtype{MatrixCategory} is a general matrix category which allows different representations and indexing schemes. Rows and columns may be extracted with rows returned as objects of type Row and colums returned as objects of type Col. A domain belonging to this category will be shallowly mutable. The index of the 'first' row may be obtained by calling the function \\spadfun{minRowIndex}. The index of the 'first' column may be obtained by calling the function \\spadfun{minColIndex}. The index of the first element of a Row is the same as the index of the first column in a matrix and vice versa.")) (|inverse| (((|Union| $ "failed") $) "\\spad{inverse(m)} returns the inverse of the matrix \\spad{m}. If the matrix is not invertible,{} \"failed\" is returned. Error: if the matrix is not square.")) (|minordet| ((|#1| $) "\\spad{minordet(m)} computes the determinant of the matrix \\spad{m} using minors. Error: if the matrix is not square.")) (|determinant| ((|#1| $) "\\spad{determinant(m)} returns the determinant of the matrix \\spad{m}. Error: if the matrix is not square.")) (|nullSpace| (((|List| |#3|) $) "\\spad{nullSpace(m)} returns a basis for the null space of the matrix \\spad{m}.")) (|nullity| (((|NonNegativeInteger|) $) "\\spad{nullity(m)} returns the nullity of the matrix \\spad{m}. This is the dimension of the null space of the matrix \\spad{m}.")) (|rank| (((|NonNegativeInteger|) $) "\\spad{rank(m)} returns the rank of the matrix \\spad{m}.")) (|rowEchelon| (($ $) "\\spad{rowEchelon(m)} returns the row echelon form of the matrix \\spad{m}.")) (/ (($ $ |#1|) "\\spad{m/r} divides the elements of \\spad{m} by \\spad{r}. Error: if \\spad{r = 0}.")) (|exquo| (((|Union| $ "failed") $ |#1|) "\\spad{exquo(m,r)} computes the exact quotient of the elements of \\spad{m} by \\spad{r},{} returning \\axiom{\"failed\"} if this is not possible.")) (** (($ $ (|Integer|)) "\\spad{m**n} computes an integral power of the matrix \\spad{m}. Error: if matrix is not square or if the matrix is square but not invertible.") (($ $ (|NonNegativeInteger|)) "\\spad{x ** n} computes a non-negative integral power of the matrix \\spad{x}. Error: if the matrix is not square.")) (* ((|#2| |#2| $) "\\spad{r * x} is the product of the row vector \\spad{r} and the matrix \\spad{x}. Error: if the dimensions are incompatible.") ((|#3| $ |#3|) "\\spad{x * c} is the product of the matrix \\spad{x} and the column vector \\spad{c}. Error: if the dimensions are incompatible.") (($ (|Integer|) $) "\\spad{n * x} is an integer multiple.") (($ $ |#1|) "\\spad{x * r} is the right scalar multiple of the scalar \\spad{r} and the matrix \\spad{x}.") (($ |#1| $) "\\spad{r*x} is the left scalar multiple of the scalar \\spad{r} and the matrix \\spad{x}.") (($ $ $) "\\spad{x * y} is the product of the matrices \\spad{x} and \\spad{y}. Error: if the dimensions are incompatible.")) (- (($ $) "\\spad{-x} returns the negative of the matrix \\spad{x}.") (($ $ $) "\\spad{x - y} is the difference of the matrices \\spad{x} and \\spad{y}. Error: if the dimensions are incompatible.")) (+ (($ $ $) "\\spad{x + y} is the sum of the matrices \\spad{x} and \\spad{y}. Error: if the dimensions are incompatible.")) (|setsubMatrix!| (($ $ (|Integer|) (|Integer|) $) "\\spad{setsubMatrix(x,i1,j1,y)} destructively alters the matrix \\spad{x}. Here \\spad{x(i,j)} is set to \\spad{y(i-i1+1,j-j1+1)} for \\spad{i = i1,...,i1-1+nrows y} and \\spad{j = j1,...,j1-1+ncols y}.")) (|subMatrix| (($ $ (|Integer|) (|Integer|) (|Integer|) (|Integer|)) "\\spad{subMatrix(x,i1,i2,j1,j2)} extracts the submatrix \\spad{[x(i,j)]} where the index \\spad{i} ranges from \\spad{i1} to \\spad{i2} and the index \\spad{j} ranges from \\spad{j1} to \\spad{j2}.")) (|swapColumns!| (($ $ (|Integer|) (|Integer|)) "\\spad{swapColumns!(m,i,j)} interchanges the \\spad{i}th and \\spad{j}th columns of \\spad{m}. This destructively alters the matrix.")) (|swapRows!| (($ $ (|Integer|) (|Integer|)) "\\spad{swapRows!(m,i,j)} interchanges the \\spad{i}th and \\spad{j}th rows of \\spad{m}. This destructively alters the matrix.")) (|setelt| (($ $ (|List| (|Integer|)) (|List| (|Integer|)) $) "\\spad{setelt(x,rowList,colList,y)} destructively alters the matrix \\spad{x}. If \\spad{y} is \\spad{m}-by-\\spad{n},{} \\spad{rowList = [i<1>,i<2>,...,i<m>]} and \\spad{colList = [j<1>,j<2>,...,j<n>]},{} then \\spad{x(i<k>,j<l>)} is set to \\spad{y(k,l)} for \\spad{k = 1,...,m} and \\spad{l = 1,...,n}.")) (|elt| (($ $ (|List| (|Integer|)) (|List| (|Integer|))) "\\spad{elt(x,rowList,colList)} returns an \\spad{m}-by-\\spad{n} matrix consisting of elements of \\spad{x},{} where \\spad{m = \\# rowList} and \\spad{n = \\# colList}. If \\spad{rowList = [i<1>,i<2>,...,i<m>]} and \\spad{colList = [j<1>,j<2>,...,j<n>]},{} then the \\spad{(k,l)}th entry of \\spad{elt(x,rowList,colList)} is \\spad{x(i<k>,j<l>)}.")) (|listOfLists| (((|List| (|List| |#1|)) $) "\\spad{listOfLists(m)} returns the rows of the matrix \\spad{m} as a list of lists.")) (|vertConcat| (($ $ $) "\\spad{vertConcat(x,y)} vertically concatenates two matrices with an equal number of columns. The entries of \\spad{y} appear below of the entries of \\spad{x}. Error: if the matrices do not have the same number of columns.")) (|horizConcat| (($ $ $) "\\spad{horizConcat(x,y)} horizontally concatenates two matrices with an equal number of rows. The entries of \\spad{y} appear to the right of the entries of \\spad{x}. Error: if the matrices do not have the same number of rows.")) (|squareTop| (($ $) "\\spad{squareTop(m)} returns an \\spad{n}-by-\\spad{n} matrix consisting of the first \\spad{n} rows of the \\spad{m}-by-\\spad{n} matrix \\spad{m}. Error: if \\spad{m < n}.")) (|transpose| (($ $) "\\spad{transpose(m)} returns the transpose of the matrix \\spad{m}.") (($ |#2|) "\\spad{transpose(r)} converts the row \\spad{r} to a row matrix.")) (|coerce| (($ |#3|) "\\spad{coerce(col)} converts the column \\spad{col} to a column matrix.")) (|diagonalMatrix| (($ (|List| $)) "\\spad{diagonalMatrix([m1,...,mk])} creates a block diagonal matrix \\spad{M} with block matrices {\\em m1},{}...,{}{\\em mk} down the diagonal,{} with 0 block matrices elsewhere. More precisly: if \\spad{ri := nrows mi},{} \\spad{ci := ncols mi},{} then \\spad{m} is an (\\spad{r1+}..\\spad{+rk}) by (\\spad{c1+}..\\spad{+ck}) - matrix with entries \\spad{m.i.j = ml.(i-r1-..-r(l-1)).(j-n1-..-n(l-1))},{} if \\spad{(r1+..+r(l-1)) < i <= r1+..+rl} and \\spad{(c1+..+c(l-1)) < i <= c1+..+cl},{} \\spad{m.i.j} = 0 otherwise.") (($ (|List| |#1|)) "\\spad{diagonalMatrix(l)} returns a diagonal matrix with the elements of \\spad{l} on the diagonal.")) (|scalarMatrix| (($ (|NonNegativeInteger|) |#1|) "\\spad{scalarMatrix(n,r)} returns an \\spad{n}-by-\\spad{n} matrix with \\spad{r}\\spad{'s} on the diagonal and zeroes elsewhere.")) (|matrix| (($ (|List| (|List| |#1|))) "\\spad{matrix(l)} converts the list of lists \\spad{l} to a matrix,{} where the list of lists is viewed as a list of the rows of the matrix.")) (|zero| (($ (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{zero(m,n)} returns an \\spad{m}-by-\\spad{n} zero matrix.")) (|antisymmetric?| (((|Boolean|) $) "\\spad{antisymmetric?(m)} returns \\spad{true} if the matrix \\spad{m} is square and antisymmetric (\\spadignore{i.e.} \\spad{m[i,j] = -m[j,i]} for all \\spad{i} and \\spad{j}) and \\spad{false} otherwise.")) (|symmetric?| (((|Boolean|) $) "\\spad{symmetric?(m)} returns \\spad{true} if the matrix \\spad{m} is square and symmetric (\\spadignore{i.e.} \\spad{m[i,j] = m[j,i]} for all \\spad{i} and \\spad{j}) and \\spad{false} otherwise.")) (|diagonal?| (((|Boolean|) $) "\\spad{diagonal?(m)} returns \\spad{true} if the matrix \\spad{m} is square and diagonal (\\spadignore{i.e.} all entries of \\spad{m} not on the diagonal are zero) and \\spad{false} otherwise.")) (|square?| (((|Boolean|) $) "\\spad{square?(m)} returns \\spad{true} if \\spad{m} is a square matrix (\\spadignore{i.e.} if \\spad{m} has the same number of rows as columns) and \\spad{false} otherwise.")) (|finiteAggregate| ((|attribute|) "matrices are finite")) (|shallowlyMutable| ((|attribute|) "One may destructively alter matrices"))) 
+((|constructor| (NIL "\\spadtype{MatrixCategory} is a general matrix category which allows different representations and indexing schemes. Rows and columns may be extracted with rows returned as objects of type Row and colums returned as objects of type Col. A domain belonging to this category will be shallowly mutable. The index of the 'first' row may be obtained by calling the function \\spadfun{minRowIndex}. The index of the 'first' column may be obtained by calling the function \\spadfun{minColIndex}. The index of the first element of a Row is the same as the index of the first column in a matrix and vice versa.")) (|inverse| (((|Union| $ "failed") $) "\\spad{inverse(m)} returns the inverse of the matrix \\spad{m}. If the matrix is not invertible,{} \"failed\" is returned. Error: if the matrix is not square.")) (|minordet| ((|#1| $) "\\spad{minordet(m)} computes the determinant of the matrix \\spad{m} using minors. Error: if the matrix is not square.")) (|determinant| ((|#1| $) "\\spad{determinant(m)} returns the determinant of the matrix \\spad{m}. Error: if the matrix is not square.")) (|nullSpace| (((|List| |#3|) $) "\\spad{nullSpace(m)} returns a basis for the null space of the matrix \\spad{m}.")) (|nullity| (((|NonNegativeInteger|) $) "\\spad{nullity(m)} returns the nullity of the matrix \\spad{m}. This is the dimension of the null space of the matrix \\spad{m}.")) (|rank| (((|NonNegativeInteger|) $) "\\spad{rank(m)} returns the rank of the matrix \\spad{m}.")) (|rowEchelon| (($ $) "\\spad{rowEchelon(m)} returns the row echelon form of the matrix \\spad{m}.")) (/ (($ $ |#1|) "\\spad{m/r} divides the elements of \\spad{m} by \\spad{r}. Error: if \\spad{r = 0}.")) (|exquo| (((|Union| $ "failed") $ |#1|) "\\spad{exquo(m,r)} computes the exact quotient of the elements of \\spad{m} by \\spad{r},{} returning \\axiom{\"failed\"} if this is not possible.")) (** (($ $ (|Integer|)) "\\spad{m**n} computes an integral power of the matrix \\spad{m}. Error: if matrix is not square or if the matrix is square but not invertible.") (($ $ (|NonNegativeInteger|)) "\\spad{x ** n} computes a non-negative integral power of the matrix \\spad{x}. Error: if the matrix is not square.")) (* ((|#2| |#2| $) "\\spad{r * x} is the product of the row vector \\spad{r} and the matrix \\spad{x}. Error: if the dimensions are incompatible.") ((|#3| $ |#3|) "\\spad{x * c} is the product of the matrix \\spad{x} and the column vector \\spad{c}. Error: if the dimensions are incompatible.") (($ (|Integer|) $) "\\spad{n * x} is an integer multiple.") (($ $ |#1|) "\\spad{x * r} is the right scalar multiple of the scalar \\spad{r} and the matrix \\spad{x}.") (($ |#1| $) "\\spad{r*x} is the left scalar multiple of the scalar \\spad{r} and the matrix \\spad{x}.") (($ $ $) "\\spad{x * y} is the product of the matrices \\spad{x} and \\spad{y}. Error: if the dimensions are incompatible.")) (- (($ $) "\\spad{-x} returns the negative of the matrix \\spad{x}.") (($ $ $) "\\spad{x - y} is the difference of the matrices \\spad{x} and \\spad{y}. Error: if the dimensions are incompatible.")) (+ (($ $ $) "\\spad{x + y} is the sum of the matrices \\spad{x} and \\spad{y}. Error: if the dimensions are incompatible.")) (|setsubMatrix!| (($ $ (|Integer|) (|Integer|) $) "\\spad{setsubMatrix(x,i1,j1,y)} destructively alters the matrix \\spad{x}. Here \\spad{x(i,j)} is set to \\spad{y(i-i1+1,j-j1+1)} for \\spad{i = i1,...,i1-1+nrows y} and \\spad{j = j1,...,j1-1+ncols y}.")) (|subMatrix| (($ $ (|Integer|) (|Integer|) (|Integer|) (|Integer|)) "\\spad{subMatrix(x,i1,i2,j1,j2)} extracts the submatrix \\spad{[x(i,j)]} where the index \\spad{i} ranges from \\spad{i1} to \\spad{i2} and the index \\spad{j} ranges from \\spad{j1} to \\spad{j2}.")) (|swapColumns!| (($ $ (|Integer|) (|Integer|)) "\\spad{swapColumns!(m,i,j)} interchanges the \\spad{i}th and \\spad{j}th columns of \\spad{m}. This destructively alters the matrix.")) (|swapRows!| (($ $ (|Integer|) (|Integer|)) "\\spad{swapRows!(m,i,j)} interchanges the \\spad{i}th and \\spad{j}th rows of \\spad{m}. This destructively alters the matrix.")) (|setelt| (($ $ (|List| (|Integer|)) (|List| (|Integer|)) $) "\\spad{setelt(x,rowList,colList,y)} destructively alters the matrix \\spad{x}. If \\spad{y} is \\spad{m}-by-\\spad{n},{} \\spad{rowList = [i<1>,i<2>,...,i<m>]} and \\spad{colList = [j<1>,j<2>,...,j<n>]},{} then \\spad{x(i<k>,j<l>)} is set to \\spad{y(k,l)} for \\spad{k = 1,...,m} and \\spad{l = 1,...,n}.")) (|elt| (($ $ (|List| (|Integer|)) (|List| (|Integer|))) "\\spad{elt(x,rowList,colList)} returns an \\spad{m}-by-\\spad{n} matrix consisting of elements of \\spad{x},{} where \\spad{m = \\# rowList} and \\spad{n = \\# colList}. If \\spad{rowList = [i<1>,i<2>,...,i<m>]} and \\spad{colList = [j<1>,j<2>,...,j<n>]},{} then the \\spad{(k,l)}th entry of \\spad{elt(x,rowList,colList)} is \\spad{x(i<k>,j<l>)}.")) (|listOfLists| (((|List| (|List| |#1|)) $) "\\spad{listOfLists(m)} returns the rows of the matrix \\spad{m} as a list of lists.")) (|vertConcat| (($ $ $) "\\spad{vertConcat(x,y)} vertically concatenates two matrices with an equal number of columns. The entries of \\spad{y} appear below of the entries of \\spad{x}. Error: if the matrices do not have the same number of columns.")) (|horizConcat| (($ $ $) "\\spad{horizConcat(x,y)} horizontally concatenates two matrices with an equal number of rows. The entries of \\spad{y} appear to the right of the entries of \\spad{x}. Error: if the matrices do not have the same number of rows.")) (|squareTop| (($ $) "\\spad{squareTop(m)} returns an \\spad{n}-by-\\spad{n} matrix consisting of the first \\spad{n} rows of the \\spad{m}-by-\\spad{n} matrix \\spad{m}. Error: if \\spad{m < n}.")) (|transpose| (($ $) "\\spad{transpose(m)} returns the transpose of the matrix \\spad{m}.") (($ |#2|) "\\spad{transpose(r)} converts the row \\spad{r} to a row matrix.")) (|coerce| (($ |#3|) "\\spad{coerce(col)} converts the column \\spad{col} to a column matrix.")) (|diagonalMatrix| (($ (|List| $)) "\\spad{diagonalMatrix([m1,...,mk])} creates a block diagonal matrix \\spad{M} with block matrices {\\em m1},{}...,{}{\\em mk} down the diagonal,{} with 0 block matrices elsewhere. More precisly: if \\spad{ri := nrows mi},{} \\spad{ci := ncols mi},{} then \\spad{m} is an (\\spad{r1+}..\\spad{+rk}) by (\\spad{c1+}..\\spad{+ck}) - matrix with entries \\spad{m.i.j = ml.(i-r1-..-r(l-1)).(j-n1-..-n(l-1))},{} if \\spad{(r1+..+r(l-1)) < i <= r1+..+rl} and \\spad{(c1+..+c(l-1)) < i <= c1+..+cl},{} \\spad{m.i.j} = 0 otherwise.") (($ (|List| |#1|)) "\\spad{diagonalMatrix(l)} returns a diagonal matrix with the elements of \\spad{l} on the diagonal.")) (|scalarMatrix| (($ (|NonNegativeInteger|) |#1|) "\\spad{scalarMatrix(n,r)} returns an \\spad{n}-by-\\spad{n} matrix with \\spad{r}\\spad{'s} on the diagonal and zeroes elsewhere.")) (|matrix| (($ (|NonNegativeInteger|) (|NonNegativeInteger|) (|Mapping| |#1| (|Integer|) (|Integer|))) "\\spad{matrix(n,m,f)} construcys and \\spad{n * m} matrix with the \\spad{(i,j)} entry equal to \\spad{f(i,j)}.") (($ (|List| (|List| |#1|))) "\\spad{matrix(l)} converts the list of lists \\spad{l} to a matrix,{} where the list of lists is viewed as a list of the rows of the matrix.")) (|zero| (($ (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{zero(m,n)} returns an \\spad{m}-by-\\spad{n} zero matrix.")) (|antisymmetric?| (((|Boolean|) $) "\\spad{antisymmetric?(m)} returns \\spad{true} if the matrix \\spad{m} is square and antisymmetric (\\spadignore{i.e.} \\spad{m[i,j] = -m[j,i]} for all \\spad{i} and \\spad{j}) and \\spad{false} otherwise.")) (|symmetric?| (((|Boolean|) $) "\\spad{symmetric?(m)} returns \\spad{true} if the matrix \\spad{m} is square and symmetric (\\spadignore{i.e.} \\spad{m[i,j] = m[j,i]} for all \\spad{i} and \\spad{j}) and \\spad{false} otherwise.")) (|diagonal?| (((|Boolean|) $) "\\spad{diagonal?(m)} returns \\spad{true} if the matrix \\spad{m} is square and diagonal (\\spadignore{i.e.} all entries of \\spad{m} not on the diagonal are zero) and \\spad{false} otherwise.")) (|square?| (((|Boolean|) $) "\\spad{square?(m)} returns \\spad{true} if \\spad{m} is a square matrix (\\spadignore{i.e.} if \\spad{m} has the same number of rows as columns) and \\spad{false} otherwise.")) (|finiteAggregate| ((|attribute|) "matrices are finite")) (|shallowlyMutable| ((|attribute|) "One may destructively alter matrices"))) 
 ((-4462 . T) (-4463 . T)) 
 NIL 
 (-700 R |Row| |Col| M) 
@@ -2744,7 +2744,7 @@ NIL
 ((|constructor| (NIL "This domain implements the notion of optional value,{} where a computation may fail to produce expected value.")) (|nothing| (($) "\\spad{nothing} represents failure or absence of value.")) (|autoCoerce| ((|#1| $) "\\spad{autoCoerce} is a courtesy coercion function used by the compiler in case it knows that \\spad{`x'} really is a \\spadtype{T}.")) (|case| (((|Boolean|) $ (|[\|\|]| |nothing|)) "\\spad{x case nothing} holds if the value for \\spad{x} is missing.") (((|Boolean|) $ (|[\|\|]| |#1|)) "\\spad{x case T} returns \\spad{true} if \\spad{x} is actually a data of type \\spad{T}.")) (|just| (($ |#1|) "\\spad{just x} injects the value \\spad{`x'} into \\%."))) 
 NIL 
 NIL 
-(-704 S -1967 FLAF FLAS) 
+(-704 S -1966 FLAF FLAS) 
 ((|constructor| (NIL "\\indented{1}{\\spadtype{MultiVariableCalculusFunctions} Package provides several} \\indented{1}{functions for multivariable calculus.} These include gradient,{} hessian and jacobian,{} divergence and laplacian. Various forms for banded and sparse storage of matrices are included.")) (|bandedJacobian| (((|Matrix| |#2|) |#3| |#4| (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{bandedJacobian(vf,xlist,kl,ku)} computes the jacobian,{} the matrix of first partial derivatives,{} of the vector field \\spad{vf},{} \\spad{vf} a vector function of the variables listed in \\spad{xlist},{} \\spad{kl} is the number of nonzero subdiagonals,{} \\spad{ku} is the number of nonzero superdiagonals,{} kl+ku+1 being actual bandwidth. Stores the nonzero band in a matrix,{} dimensions kl+ku+1 by \\#xlist. The upper triangle is in the top \\spad{ku} rows,{} the diagonal is in row ku+1,{} the lower triangle in the last \\spad{kl} rows. Entries in a column in the band store correspond to entries in same column of full store. (The notation conforms to LAPACK/NAG-\\spad{F07} conventions.)")) (|jacobian| (((|Matrix| |#2|) |#3| |#4|) "\\spad{jacobian(vf,xlist)} computes the jacobian,{} the matrix of first partial derivatives,{} of the vector field \\spad{vf},{} \\spad{vf} a vector function of the variables listed in \\spad{xlist}.")) (|bandedHessian| (((|Matrix| |#2|) |#2| |#4| (|NonNegativeInteger|)) "\\spad{bandedHessian(v,xlist,k)} computes the hessian,{} the matrix of second partial derivatives,{} of the scalar field \\spad{v},{} \\spad{v} a function of the variables listed in \\spad{xlist},{} \\spad{k} is the semi-bandwidth,{} the number of nonzero subdiagonals,{} 2*k+1 being actual bandwidth. Stores the nonzero band in lower triangle in a matrix,{} dimensions \\spad{k+1} by \\#xlist,{} whose rows are the vectors formed by diagonal,{} subdiagonal,{} etc. of the real,{} full-matrix,{} hessian. (The notation conforms to LAPACK/NAG-\\spad{F07} conventions.)")) (|hessian| (((|Matrix| |#2|) |#2| |#4|) "\\spad{hessian(v,xlist)} computes the hessian,{} the matrix of second partial derivatives,{} of the scalar field \\spad{v},{} \\spad{v} a function of the variables listed in \\spad{xlist}.")) (|laplacian| ((|#2| |#2| |#4|) "\\spad{laplacian(v,xlist)} computes the laplacian of the scalar field \\spad{v},{} \\spad{v} a function of the variables listed in \\spad{xlist}.")) (|divergence| ((|#2| |#3| |#4|) "\\spad{divergence(vf,xlist)} computes the divergence of the vector field \\spad{vf},{} \\spad{vf} a vector function of the variables listed in \\spad{xlist}.")) (|gradient| (((|Vector| |#2|) |#2| |#4|) "\\spad{gradient(v,xlist)} computes the gradient,{} the vector of first partial derivatives,{} of the scalar field \\spad{v},{} \\spad{v} a function of the variables listed in \\spad{xlist}."))) 
 NIL 
 NIL 
@@ -2768,7 +2768,7 @@ NIL
 ((|constructor| (NIL "\\indented{1}{<description of package>} Author: Jim Wen Date Created: \\spad{??} Date Last Updated: October 1991 by Jon Steinbach Keywords: Examples: References:")) (|ptFunc| (((|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|))) "\\spad{ptFunc(a,b,c,d)} is an internal function exported in order to compile packages.")) (|meshPar1Var| (((|ThreeSpace| (|DoubleFloat|)) (|Expression| (|Integer|)) (|Expression| (|Integer|)) (|Expression| (|Integer|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|List| (|DrawOption|))) "\\spad{meshPar1Var(s,t,u,f,s1,l)} \\undocumented")) (|meshFun2Var| (((|ThreeSpace| (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) (|Union| (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) "undefined") (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|List| (|DrawOption|))) "\\spad{meshFun2Var(f,g,s1,s2,l)} \\undocumented")) (|meshPar2Var| (((|ThreeSpace| (|DoubleFloat|)) (|ThreeSpace| (|DoubleFloat|)) (|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|List| (|DrawOption|))) "\\spad{meshPar2Var(sp,f,s1,s2,l)} \\undocumented") (((|ThreeSpace| (|DoubleFloat|)) (|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|List| (|DrawOption|))) "\\spad{meshPar2Var(f,s1,s2,l)} \\undocumented") (((|ThreeSpace| (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) (|Union| (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) "undefined") (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|List| (|DrawOption|))) "\\spad{meshPar2Var(f,g,h,j,s1,s2,l)} \\undocumented"))) 
 NIL 
 NIL 
-(-710 OV E -1967 PG) 
+(-710 OV E -1966 PG) 
 ((|constructor| (NIL "Package for factorization of multivariate polynomials over finite fields.")) (|factor| (((|Factored| (|SparseUnivariatePolynomial| |#4|)) (|SparseUnivariatePolynomial| |#4|)) "\\spad{factor(p)} produces the complete factorization of the multivariate polynomial \\spad{p} over a finite field. \\spad{p} is represented as a univariate polynomial with multivariate coefficients over a finite field.") (((|Factored| |#4|) |#4|) "\\spad{factor(p)} produces the complete factorization of the multivariate polynomial \\spad{p} over a finite field."))) 
 NIL 
 NIL 
@@ -2820,7 +2820,7 @@ NIL
 ((|constructor| (NIL "\\spadtype{MathMLFormat} provides a coercion from \\spadtype{OutputForm} to MathML format.")) (|display| (((|Void|) (|String|)) "prints the string returned by coerce,{} adding <math ...> tags.")) (|exprex| (((|String|) (|OutputForm|)) "coverts \\spadtype{OutputForm} to \\spadtype{String} with the structure preserved with braces. Actually this is not quite accurate. The function \\spadfun{precondition} is first applied to the \\spadtype{OutputForm} expression before \\spadfun{exprex}. The raw \\spadtype{OutputForm} and the nature of the \\spadfun{precondition} function is still obscure to me at the time of this writing (2007-02-14).")) (|coerceL| (((|String|) (|OutputForm|)) "coerceS(\\spad{o}) changes \\spad{o} in the standard output format to MathML format and displays result as one long string.")) (|coerceS| (((|String|) (|OutputForm|)) "\\spad{coerceS(o)} changes \\spad{o} in the standard output format to MathML format and displays formatted result.")) (|coerce| (((|String|) (|OutputForm|)) "coerceS(\\spad{o}) changes \\spad{o} in the standard output format to MathML format."))) 
 NIL 
 NIL 
-(-723 R |Mod| -2679 -4168 |exactQuo|) 
+(-723 R |Mod| -3046 -1512 |exactQuo|) 
 ((|constructor| (NIL "\\indented{1}{These domains are used for the factorization and gcds} of univariate polynomials over the integers in order to work modulo different primes. See \\spadtype{ModularRing},{} \\spadtype{EuclideanModularRing}")) (|exQuo| (((|Union| $ "failed") $ $) "\\spad{exQuo(x,y)} \\undocumented")) (|reduce| (($ |#1| |#2|) "\\spad{reduce(r,m)} \\undocumented")) (|coerce| ((|#1| $) "\\spad{coerce(x)} \\undocumented")) (|modulus| ((|#2| $) "\\spad{modulus(x)} \\undocumented"))) 
 ((-4454 . T) (-4460 . T) (-4455 . T) ((-4464 "*") . T) (-4456 . T) (-4457 . T) (-4459 . T)) 
 NIL 
@@ -2836,7 +2836,7 @@ NIL
 ((|constructor| (NIL "Algebra of ADDITIVE operators on a module.")) (|makeop| (($ |#1| (|FreeGroup| (|BasicOperator|))) "\\spad{makeop should} be local but conditional")) (|opeval| ((|#2| (|BasicOperator|) |#2|) "\\spad{opeval should} be local but conditional")) (** (($ $ (|Integer|)) "\\spad{op**n} \\undocumented") (($ (|BasicOperator|) (|Integer|)) "\\spad{op**n} \\undocumented")) (|evaluateInverse| (($ $ (|Mapping| |#2| |#2|)) "\\spad{evaluateInverse(x,f)} \\undocumented")) (|evaluate| (($ $ (|Mapping| |#2| |#2|)) "\\spad{evaluate(f, u +-> g u)} attaches the map \\spad{g} to \\spad{f}. \\spad{f} must be a basic operator \\spad{g} MUST be additive,{} \\spadignore{i.e.} \\spad{g(a + b) = g(a) + g(b)} for any \\spad{a},{} \\spad{b} in \\spad{M}. This implies that \\spad{g(n a) = n g(a)} for any \\spad{a} in \\spad{M} and integer \\spad{n > 0}.")) (|conjug| ((|#1| |#1|) "\\spad{conjug(x)}should be local but conditional")) (|adjoint| (($ $ $) "\\spad{adjoint(op1, op2)} sets the adjoint of \\spad{op1} to be op2. \\spad{op1} must be a basic operator") (($ $) "\\spad{adjoint(op)} returns the adjoint of the operator \\spad{op}."))) 
 ((-4457 |has| |#1| (-174)) (-4456 |has| |#1| (-174)) (-4459 . T)) 
 ((|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148)))) 
-(-727 R |Mod| -2679 -4168 |exactQuo|) 
+(-727 R |Mod| -3046 -1512 |exactQuo|) 
 ((|constructor| (NIL "These domains are used for the factorization and gcds of univariate polynomials over the integers in order to work modulo different primes. See \\spadtype{EuclideanModularRing} ,{}\\spadtype{ModularField}")) (|inv| (($ $) "\\spad{inv(x)} \\undocumented")) (|recip| (((|Union| $ "failed") $) "\\spad{recip(x)} \\undocumented")) (|exQuo| (((|Union| $ "failed") $ $) "\\spad{exQuo(x,y)} \\undocumented")) (|reduce| (($ |#1| |#2|) "\\spad{reduce(r,m)} \\undocumented")) (|coerce| ((|#1| $) "\\spad{coerce(x)} \\undocumented")) (|modulus| ((|#2| $) "\\spad{modulus(x)} \\undocumented"))) 
 ((-4459 . T)) 
 NIL 
@@ -2848,7 +2848,7 @@ NIL
 ((|constructor| (NIL "The category of modules over a commutative ring. \\blankline"))) 
 ((-4457 . T) (-4456 . T)) 
 NIL 
-(-730 -1967) 
+(-730 -1966) 
 ((|constructor| (NIL "\\indented{1}{MoebiusTransform(\\spad{F}) is the domain of fractional linear (Moebius)} transformations over \\spad{F}.")) (|eval| (((|OnePointCompletion| |#1|) $ (|OnePointCompletion| |#1|)) "\\spad{eval(m,x)} returns \\spad{(a*x + b)/(c*x + d)} where \\spad{m = moebius(a,b,c,d)} (see \\spadfunFrom{moebius}{MoebiusTransform}).") ((|#1| $ |#1|) "\\spad{eval(m,x)} returns \\spad{(a*x + b)/(c*x + d)} where \\spad{m = moebius(a,b,c,d)} (see \\spadfunFrom{moebius}{MoebiusTransform}).")) (|recip| (($ $) "\\spad{recip(m)} = recip() * \\spad{m}") (($) "\\spad{recip()} returns \\spad{matrix [[0,1],[1,0]]} representing the map \\spad{x -> 1 / x}.")) (|scale| (($ $ |#1|) "\\spad{scale(m,h)} returns \\spad{scale(h) * m} (see \\spadfunFrom{shift}{MoebiusTransform}).") (($ |#1|) "\\spad{scale(k)} returns \\spad{matrix [[k,0],[0,1]]} representing the map \\spad{x -> k * x}.")) (|shift| (($ $ |#1|) "\\spad{shift(m,h)} returns \\spad{shift(h) * m} (see \\spadfunFrom{shift}{MoebiusTransform}).") (($ |#1|) "\\spad{shift(k)} returns \\spad{matrix [[1,k],[0,1]]} representing the map \\spad{x -> x + k}.")) (|moebius| (($ |#1| |#1| |#1| |#1|) "\\spad{moebius(a,b,c,d)} returns \\spad{matrix [[a,b],[c,d]]}."))) 
 ((-4459 . T)) 
 NIL 
@@ -2884,7 +2884,7 @@ NIL
 ((|constructor| (NIL "The class of multiplicative monoids,{} \\spadignore{i.e.} semigroups with a multiplicative identity element. \\blankline")) (|recip| (((|Union| $ "failed") $) "\\spad{recip(x)} tries to compute the multiplicative inverse for \\spad{x} or \"failed\" if it cannot find the inverse (see unitsKnown).")) (** (($ $ (|NonNegativeInteger|)) "\\spad{x**n} returns the repeated product of \\spad{x} \\spad{n} times,{} \\spadignore{i.e.} exponentiation.")) (|one?| (((|Boolean|) $) "\\spad{one?(x)} tests if \\spad{x} is equal to 1.")) (|sample| (($) "\\spad{sample yields} a value of type \\%")) ((|One|) (($) "1 is the multiplicative identity."))) 
 NIL 
 NIL 
-(-739 -1967 UP) 
+(-739 -1966 UP) 
 ((|constructor| (NIL "Tools for handling monomial extensions.")) (|decompose| (((|Record| (|:| |poly| |#2|) (|:| |normal| (|Fraction| |#2|)) (|:| |special| (|Fraction| |#2|))) (|Fraction| |#2|) (|Mapping| |#2| |#2|)) "\\spad{decompose(f, D)} returns \\spad{[p,n,s]} such that \\spad{f = p+n+s},{} all the squarefree factors of \\spad{denom(n)} are normal \\spad{w}.\\spad{r}.\\spad{t}. \\spad{D},{} \\spad{denom(s)} is special \\spad{w}.\\spad{r}.\\spad{t}. \\spad{D},{} and \\spad{n} and \\spad{s} are proper fractions (no pole at infinity). \\spad{D} is the derivation to use.")) (|normalDenom| ((|#2| (|Fraction| |#2|) (|Mapping| |#2| |#2|)) "\\spad{normalDenom(f, D)} returns the product of all the normal factors of \\spad{denom(f)}. \\spad{D} is the derivation to use.")) (|splitSquarefree| (((|Record| (|:| |normal| (|Factored| |#2|)) (|:| |special| (|Factored| |#2|))) |#2| (|Mapping| |#2| |#2|)) "\\spad{splitSquarefree(p, D)} returns \\spad{[n_1 n_2\\^2 ... n_m\\^m, s_1 s_2\\^2 ... s_q\\^q]} such that \\spad{p = n_1 n_2\\^2 ... n_m\\^m s_1 s_2\\^2 ... s_q\\^q},{} each \\spad{n_i} is normal \\spad{w}.\\spad{r}.\\spad{t}. \\spad{D} and each \\spad{s_i} is special \\spad{w}.\\spad{r}.\\spad{t} \\spad{D}. \\spad{D} is the derivation to use.")) (|split| (((|Record| (|:| |normal| |#2|) (|:| |special| |#2|)) |#2| (|Mapping| |#2| |#2|)) "\\spad{split(p, D)} returns \\spad{[n,s]} such that \\spad{p = n s},{} all the squarefree factors of \\spad{n} are normal \\spad{w}.\\spad{r}.\\spad{t}. \\spad{D},{} and \\spad{s} is special \\spad{w}.\\spad{r}.\\spad{t}. \\spad{D}. \\spad{D} is the derivation to use."))) 
 NIL 
 NIL 
@@ -3036,11 +3036,11 @@ NIL
 ((|constructor| (NIL "This package computes explicitly eigenvalues and eigenvectors of matrices with entries over the complex rational numbers. The results are expressed either as complex floating numbers or as complex rational numbers depending on the type of the precision parameter.")) (|complexEigenvectors| (((|List| (|Record| (|:| |outval| (|Complex| |#1|)) (|:| |outmult| (|Integer|)) (|:| |outvect| (|List| (|Matrix| (|Complex| |#1|)))))) (|Matrix| (|Complex| (|Fraction| (|Integer|)))) |#1|) "\\spad{complexEigenvectors(m,eps)} returns a list of records each one containing a complex eigenvalue,{} its algebraic multiplicity,{} and a list of associated eigenvectors. All these results are computed to precision \\spad{eps} and are expressed as complex floats or complex rational numbers depending on the type of \\spad{eps} (float or rational).")) (|complexEigenvalues| (((|List| (|Complex| |#1|)) (|Matrix| (|Complex| (|Fraction| (|Integer|)))) |#1|) "\\spad{complexEigenvalues(m,eps)} computes the eigenvalues of the matrix \\spad{m} to precision \\spad{eps}. The eigenvalues are expressed as complex floats or complex rational numbers depending on the type of \\spad{eps} (float or rational).")) (|characteristicPolynomial| (((|Polynomial| (|Complex| (|Fraction| (|Integer|)))) (|Matrix| (|Complex| (|Fraction| (|Integer|)))) (|Symbol|)) "\\spad{characteristicPolynomial(m,x)} returns the characteristic polynomial of the matrix \\spad{m} expressed as polynomial over Complex Rationals with variable \\spad{x}.") (((|Polynomial| (|Complex| (|Fraction| (|Integer|)))) (|Matrix| (|Complex| (|Fraction| (|Integer|))))) "\\spad{characteristicPolynomial(m)} returns the characteristic polynomial of the matrix \\spad{m} expressed as polynomial over complex rationals with a new symbol as variable."))) 
 NIL 
 NIL 
-(-777 -1967) 
+(-777 -1966) 
 ((|constructor| (NIL "\\spadtype{NumericContinuedFraction} provides functions \\indented{2}{for converting floating point numbers to continued fractions.}")) (|continuedFraction| (((|ContinuedFraction| (|Integer|)) |#1|) "\\spad{continuedFraction(f)} converts the floating point number \\spad{f} to a reduced continued fraction."))) 
 NIL 
 NIL 
-(-778 P -1967) 
+(-778 P -1966) 
 ((|constructor| (NIL "This package provides a division and related operations for \\spadtype{MonogenicLinearOperator}\\spad{s} over a \\spadtype{Field}. Since the multiplication is in general non-commutative,{} these operations all have left- and right-hand versions. This package provides the operations based on left-division.")) (|leftLcm| ((|#1| |#1| |#1|) "\\spad{leftLcm(a,b)} computes the value \\spad{m} of lowest degree such that \\spad{m = a*aa = b*bb} for some values \\spad{aa} and \\spad{bb}. The value \\spad{m} is computed using left-division.")) (|leftGcd| ((|#1| |#1| |#1|) "\\spad{leftGcd(a,b)} computes the value \\spad{g} of highest degree such that \\indented{3}{\\spad{a = aa*g}} \\indented{3}{\\spad{b = bb*g}} for some values \\spad{aa} and \\spad{bb}. The value \\spad{g} is computed using left-division.")) (|leftExactQuotient| (((|Union| |#1| "failed") |#1| |#1|) "\\spad{leftExactQuotient(a,b)} computes the value \\spad{q},{} if it exists,{} \\indented{1}{such that \\spad{a = b*q}.}")) (|leftRemainder| ((|#1| |#1| |#1|) "\\spad{leftRemainder(a,b)} computes the pair \\spad{[q,r]} such that \\spad{a = b*q + r} and the degree of \\spad{r} is less than the degree of \\spad{b}. The value \\spad{r} is returned.")) (|leftQuotient| ((|#1| |#1| |#1|) "\\spad{leftQuotient(a,b)} computes the pair \\spad{[q,r]} such that \\spad{a = b*q + r} and the degree of \\spad{r} is less than the degree of \\spad{b}. The value \\spad{q} is returned.")) (|leftDivide| (((|Record| (|:| |quotient| |#1|) (|:| |remainder| |#1|)) |#1| |#1|) "\\spad{leftDivide(a,b)} returns the pair \\spad{[q,r]} such that \\spad{a = b*q + r} and the degree of \\spad{r} is less than the degree of \\spad{b}. This process is called ``left division\\spad{''}."))) 
 NIL 
 NIL 
@@ -3048,7 +3048,7 @@ NIL
 NIL 
 NIL 
 NIL 
-(-780 UP -1967) 
+(-780 UP -1966) 
 ((|constructor| (NIL "In this package \\spad{F} is a framed algebra over the integers (typically \\spad{F = Z[a]} for some algebraic integer a). The package provides functions to compute the integral closure of \\spad{Z} in the quotient quotient field of \\spad{F}.")) (|localIntegralBasis| (((|Record| (|:| |basis| (|Matrix| (|Integer|))) (|:| |basisDen| (|Integer|)) (|:| |basisInv| (|Matrix| (|Integer|)))) (|Integer|)) "\\spad{integralBasis(p)} returns a record \\spad{[basis,basisDen,basisInv]} containing information regarding the local integral closure of \\spad{Z} at the prime \\spad{p} in the quotient field of \\spad{F},{} where \\spad{F} is a framed algebra with \\spad{Z}-module basis \\spad{w1,w2,...,wn}. If \\spad{basis} is the matrix \\spad{(aij, i = 1..n, j = 1..n)},{} then the \\spad{i}th element of the integral basis is \\spad{vi = (1/basisDen) * sum(aij * wj, j = 1..n)},{} \\spadignore{i.e.} the \\spad{i}th row of \\spad{basis} contains the coordinates of the \\spad{i}th basis vector. Similarly,{} the \\spad{i}th row of the matrix \\spad{basisInv} contains the coordinates of \\spad{wi} with respect to the basis \\spad{v1,...,vn}: if \\spad{basisInv} is the matrix \\spad{(bij, i = 1..n, j = 1..n)},{} then \\spad{wi = sum(bij * vj, j = 1..n)}.")) (|integralBasis| (((|Record| (|:| |basis| (|Matrix| (|Integer|))) (|:| |basisDen| (|Integer|)) (|:| |basisInv| (|Matrix| (|Integer|))))) "\\spad{integralBasis()} returns a record \\spad{[basis,basisDen,basisInv]} containing information regarding the integral closure of \\spad{Z} in the quotient field of \\spad{F},{} where \\spad{F} is a framed algebra with \\spad{Z}-module basis \\spad{w1,w2,...,wn}. If \\spad{basis} is the matrix \\spad{(aij, i = 1..n, j = 1..n)},{} then the \\spad{i}th element of the integral basis is \\spad{vi = (1/basisDen) * sum(aij * wj, j = 1..n)},{} \\spadignore{i.e.} the \\spad{i}th row of \\spad{basis} contains the coordinates of the \\spad{i}th basis vector. Similarly,{} the \\spad{i}th row of the matrix \\spad{basisInv} contains the coordinates of \\spad{wi} with respect to the basis \\spad{v1,...,vn}: if \\spad{basisInv} is the matrix \\spad{(bij, i = 1..n, j = 1..n)},{} then \\spad{wi = sum(bij * vj, j = 1..n)}.")) (|discriminant| (((|Integer|)) "\\spad{discriminant()} returns the discriminant of the integral closure of \\spad{Z} in the quotient field of the framed algebra \\spad{F}."))) 
 NIL 
 NIL 
@@ -3064,7 +3064,7 @@ NIL
 ((|constructor| (NIL "\\spadtype{NonNegativeInteger} provides functions for non \\indented{2}{negative integers.}")) (|commutative| ((|attribute| "*") "\\spad{commutative(\"*\")} means multiplication is commutative : \\spad{x*y = y*x}.")) (|random| (($ $) "\\spad{random(n)} returns a random integer from 0 to \\spad{n-1}.")) (|shift| (($ $ (|Integer|)) "\\spad{shift(a,i)} shift \\spad{a} by \\spad{i} bits.")) (|exquo| (((|Union| $ "failed") $ $) "\\spad{exquo(a,b)} returns the quotient of \\spad{a} and \\spad{b},{} or \"failed\" if \\spad{b} is zero or \\spad{a} rem \\spad{b} is zero.")) (|divide| (((|Record| (|:| |quotient| $) (|:| |remainder| $)) $ $) "\\spad{divide(a,b)} returns a record containing both remainder and quotient.")) (|gcd| (($ $ $) "\\spad{gcd(a,b)} computes the greatest common divisor of two non negative integers \\spad{a} and \\spad{b}.")) (|rem| (($ $ $) "\\spad{a rem b} returns the remainder of \\spad{a} and \\spad{b}.")) (|quo| (($ $ $) "\\spad{a quo b} returns the quotient of \\spad{a} and \\spad{b},{} forgetting the remainder."))) 
 (((-4464 "*") . T)) 
 NIL 
-(-784 R -1967) 
+(-784 R -1966) 
 ((|constructor| (NIL "NonLinearFirstOrderODESolver provides a function for finding closed form first integrals of nonlinear ordinary differential equations of order 1.")) (|solve| (((|Union| |#2| "failed") |#2| |#2| (|BasicOperator|) (|Symbol|)) "\\spad{solve(M(x,y), N(x,y), y, x)} returns \\spad{F(x,y)} such that \\spad{F(x,y) = c} for a constant \\spad{c} is a first integral of the equation \\spad{M(x,y) dx + N(x,y) dy = 0},{} or \"failed\" if no first-integral can be found."))) 
 NIL 
 NIL 
@@ -3084,7 +3084,7 @@ NIL
 ((|constructor| (NIL "A package for computing normalized assocites of univariate polynomials with coefficients in a tower of simple extensions of a field.\\newline References : \\indented{1}{[1] \\spad{D}. LAZARD \"A new method for solving algebraic systems of} \\indented{5}{positive dimension\" Discr. App. Math. 33:147-160,{}1991} \\indented{1}{[2] \\spad{M}. MORENO MAZA and \\spad{R}. RIOBOO \"Computations of \\spad{gcd} over} \\indented{5}{algebraic towers of simple extensions\" In proceedings of AAECC11} \\indented{5}{Paris,{} 1995.} \\indented{1}{[3] \\spad{M}. MORENO MAZA \"Calculs de pgcd au-dessus des tours} \\indented{5}{d'extensions simples et resolution des systemes d'equations} \\indented{5}{algebriques\" These,{} Universite \\spad{P}.etM. Curie,{} Paris,{} 1997.}")) (|normInvertible?| (((|List| (|Record| (|:| |val| (|Boolean|)) (|:| |tower| |#5|))) |#4| |#5|) "\\axiom{normInvertible?(\\spad{p},{}\\spad{ts})} is an internal subroutine,{} exported only for developement.")) (|outputArgs| (((|Void|) (|String|) (|String|) |#4| |#5|) "\\axiom{outputArgs(\\spad{s1},{}\\spad{s2},{}\\spad{p},{}\\spad{ts})} is an internal subroutine,{} exported only for developement.")) (|normalize| (((|List| (|Record| (|:| |val| |#4|) (|:| |tower| |#5|))) |#4| |#5|) "\\axiom{normalize(\\spad{p},{}\\spad{ts})} normalizes \\axiom{\\spad{p}} \\spad{w}.\\spad{r}.\\spad{t} \\spad{ts}.")) (|normalizedAssociate| ((|#4| |#4| |#5|) "\\axiom{normalizedAssociate(\\spad{p},{}\\spad{ts})} returns a normalized polynomial \\axiom{\\spad{n}} \\spad{w}.\\spad{r}.\\spad{t}. \\spad{ts} such that \\axiom{\\spad{n}} and \\axiom{\\spad{p}} are associates \\spad{w}.\\spad{r}.\\spad{t} \\spad{ts} and assuming that \\axiom{\\spad{p}} is invertible \\spad{w}.\\spad{r}.\\spad{t} \\spad{ts}.")) (|recip| (((|Record| (|:| |num| |#4|) (|:| |den| |#4|)) |#4| |#5|) "\\axiom{recip(\\spad{p},{}\\spad{ts})} returns the inverse of \\axiom{\\spad{p}} \\spad{w}.\\spad{r}.\\spad{t} \\spad{ts} assuming that \\axiom{\\spad{p}} is invertible \\spad{w}.\\spad{r}.\\spad{t} \\spad{ts}."))) 
 NIL 
 NIL 
-(-789 -1967 |ExtF| |SUEx| |ExtP| |n|) 
+(-789 -1966 |ExtF| |SUEx| |ExtP| |n|) 
 ((|constructor| (NIL "This package \\undocumented")) (|Frobenius| ((|#4| |#4|) "\\spad{Frobenius(x)} \\undocumented")) (|retractIfCan| (((|Union| (|SparseUnivariatePolynomial| (|SparseUnivariatePolynomial| |#1|)) "failed") |#4|) "\\spad{retractIfCan(x)} \\undocumented")) (|normFactors| (((|List| |#4|) |#4|) "\\spad{normFactors(x)} \\undocumented"))) 
 NIL 
 NIL 
@@ -3180,11 +3180,11 @@ NIL
 ((|ODESolve| (((|Result|) (|Record| (|:| |xinit| (|DoubleFloat|)) (|:| |xend| (|DoubleFloat|)) (|:| |fn| (|Vector| (|Expression| (|DoubleFloat|)))) (|:| |yinit| (|List| (|DoubleFloat|))) (|:| |intvals| (|List| (|DoubleFloat|))) (|:| |g| (|Expression| (|DoubleFloat|))) (|:| |abserr| (|DoubleFloat|)) (|:| |relerr| (|DoubleFloat|)))) "\\spad{ODESolve(args)} performs the integration of the function given the strategy or method returned by \\axiomFun{measure}.")) (|measure| (((|Record| (|:| |measure| (|Float|)) (|:| |explanations| (|String|))) (|RoutinesTable|) (|Record| (|:| |xinit| (|DoubleFloat|)) (|:| |xend| (|DoubleFloat|)) (|:| |fn| (|Vector| (|Expression| (|DoubleFloat|)))) (|:| |yinit| (|List| (|DoubleFloat|))) (|:| |intvals| (|List| (|DoubleFloat|))) (|:| |g| (|Expression| (|DoubleFloat|))) (|:| |abserr| (|DoubleFloat|)) (|:| |relerr| (|DoubleFloat|)))) "\\spad{measure(R,args)} calculates an estimate of the ability of a particular method to solve a problem. \\blankline This method may be either a specific NAG routine or a strategy (such as transforming the function from one which is difficult to one which is easier to solve). \\blankline It will call whichever agents are needed to perform analysis on the problem in order to calculate the measure. There is a parameter,{} labelled \\axiom{sofar},{} which would contain the best compatibility found so far."))) 
 NIL 
 NIL 
-(-813 R -1967 L) 
+(-813 R -1966 L) 
 ((|constructor| (NIL "Solution of linear ordinary differential equations,{} constant coefficient case.")) (|constDsolve| (((|Record| (|:| |particular| |#2|) (|:| |basis| (|List| |#2|))) |#3| |#2| (|Symbol|)) "\\spad{constDsolve(op, g, x)} returns \\spad{[f, [y1,...,ym]]} where \\spad{f} is a particular solution of the equation \\spad{op y = g},{} and the \\spad{yi}\\spad{'s} form a basis for the solutions of \\spad{op y = 0}."))) 
 NIL 
 NIL 
-(-814 R -1967) 
+(-814 R -1966) 
 ((|constructor| (NIL "\\spad{ElementaryFunctionODESolver} provides the top-level functions for finding closed form solutions of ordinary differential equations and initial value problems.")) (|solve| (((|Union| |#2| "failed") |#2| (|BasicOperator|) (|Equation| |#2|) (|List| |#2|)) "\\spad{solve(eq, y, x = a, [y0,...,ym])} returns either the solution of the initial value problem \\spad{eq, y(a) = y0, y'(a) = y1,...} or \"failed\" if the solution cannot be found; error if the equation is not one linear ordinary or of the form \\spad{dy/dx = f(x,y)}.") (((|Union| |#2| "failed") (|Equation| |#2|) (|BasicOperator|) (|Equation| |#2|) (|List| |#2|)) "\\spad{solve(eq, y, x = a, [y0,...,ym])} returns either the solution of the initial value problem \\spad{eq, y(a) = y0, y'(a) = y1,...} or \"failed\" if the solution cannot be found; error if the equation is not one linear ordinary or of the form \\spad{dy/dx = f(x,y)}.") (((|Union| (|Record| (|:| |particular| |#2|) (|:| |basis| (|List| |#2|))) |#2| "failed") |#2| (|BasicOperator|) (|Symbol|)) "\\spad{solve(eq, y, x)} returns either a solution of the ordinary differential equation \\spad{eq} or \"failed\" if no non-trivial solution can be found; If the equation is linear ordinary,{} a solution is of the form \\spad{[h, [b1,...,bm]]} where \\spad{h} is a particular solution and and \\spad{[b1,...bm]} are linearly independent solutions of the associated homogenuous equation \\spad{f(x,y) = 0}; A full basis for the solutions of the homogenuous equation is not always returned,{} only the solutions which were found; If the equation is of the form {dy/dx = \\spad{f}(\\spad{x},{}\\spad{y})},{} a solution is of the form \\spad{h(x,y)} where \\spad{h(x,y) = c} is a first integral of the equation for any constant \\spad{c}.") (((|Union| (|Record| (|:| |particular| |#2|) (|:| |basis| (|List| |#2|))) |#2| "failed") (|Equation| |#2|) (|BasicOperator|) (|Symbol|)) "\\spad{solve(eq, y, x)} returns either a solution of the ordinary differential equation \\spad{eq} or \"failed\" if no non-trivial solution can be found; If the equation is linear ordinary,{} a solution is of the form \\spad{[h, [b1,...,bm]]} where \\spad{h} is a particular solution and \\spad{[b1,...bm]} are linearly independent solutions of the associated homogenuous equation \\spad{f(x,y) = 0}; A full basis for the solutions of the homogenuous equation is not always returned,{} only the solutions which were found; If the equation is of the form {dy/dx = \\spad{f}(\\spad{x},{}\\spad{y})},{} a solution is of the form \\spad{h(x,y)} where \\spad{h(x,y) = c} is a first integral of the equation for any constant \\spad{c}; error if the equation is not one of those 2 forms.") (((|Union| (|Record| (|:| |particular| (|Vector| |#2|)) (|:| |basis| (|List| (|Vector| |#2|)))) "failed") (|List| |#2|) (|List| (|BasicOperator|)) (|Symbol|)) "\\spad{solve([eq_1,...,eq_n], [y_1,...,y_n], x)} returns either \"failed\" or,{} if the equations form a fist order linear system,{} a solution of the form \\spad{[y_p, [b_1,...,b_n]]} where \\spad{h_p} is a particular solution and \\spad{[b_1,...b_m]} are linearly independent solutions of the associated homogenuous system. error if the equations do not form a first order linear system") (((|Union| (|Record| (|:| |particular| (|Vector| |#2|)) (|:| |basis| (|List| (|Vector| |#2|)))) "failed") (|List| (|Equation| |#2|)) (|List| (|BasicOperator|)) (|Symbol|)) "\\spad{solve([eq_1,...,eq_n], [y_1,...,y_n], x)} returns either \"failed\" or,{} if the equations form a fist order linear system,{} a solution of the form \\spad{[y_p, [b_1,...,b_n]]} where \\spad{h_p} is a particular solution and \\spad{[b_1,...b_m]} are linearly independent solutions of the associated homogenuous system. error if the equations do not form a first order linear system") (((|Union| (|List| (|Vector| |#2|)) "failed") (|Matrix| |#2|) (|Symbol|)) "\\spad{solve(m, x)} returns a basis for the solutions of \\spad{D y = m y}. \\spad{x} is the dependent variable.") (((|Union| (|Record| (|:| |particular| (|Vector| |#2|)) (|:| |basis| (|List| (|Vector| |#2|)))) "failed") (|Matrix| |#2|) (|Vector| |#2|) (|Symbol|)) "\\spad{solve(m, v, x)} returns \\spad{[v_p, [v_1,...,v_m]]} such that the solutions of the system \\spad{D y = m y + v} are \\spad{v_p + c_1 v_1 + ... + c_m v_m} where the \\spad{c_i's} are constants,{} and the \\spad{v_i's} form a basis for the solutions of \\spad{D y = m y}. \\spad{x} is the dependent variable."))) 
 NIL 
 NIL 
@@ -3192,7 +3192,7 @@ NIL
 ((|constructor| (NIL "\\axiom{ODEIntensityFunctionsTable()} provides a dynamic table and a set of functions to store details found out about sets of ODE\\spad{'s}.")) (|showIntensityFunctions| (((|Union| (|Record| (|:| |stiffness| (|Float|)) (|:| |stability| (|Float|)) (|:| |expense| (|Float|)) (|:| |accuracy| (|Float|)) (|:| |intermediateResults| (|Float|))) "failed") (|Record| (|:| |xinit| (|DoubleFloat|)) (|:| |xend| (|DoubleFloat|)) (|:| |fn| (|Vector| (|Expression| (|DoubleFloat|)))) (|:| |yinit| (|List| (|DoubleFloat|))) (|:| |intvals| (|List| (|DoubleFloat|))) (|:| |g| (|Expression| (|DoubleFloat|))) (|:| |abserr| (|DoubleFloat|)) (|:| |relerr| (|DoubleFloat|)))) "\\spad{showIntensityFunctions(k)} returns the entries in the table of intensity functions \\spad{k}.")) (|insert!| (($ (|Record| (|:| |key| (|Record| (|:| |xinit| (|DoubleFloat|)) (|:| |xend| (|DoubleFloat|)) (|:| |fn| (|Vector| (|Expression| (|DoubleFloat|)))) (|:| |yinit| (|List| (|DoubleFloat|))) (|:| |intvals| (|List| (|DoubleFloat|))) (|:| |g| (|Expression| (|DoubleFloat|))) (|:| |abserr| (|DoubleFloat|)) (|:| |relerr| (|DoubleFloat|)))) (|:| |entry| (|Record| (|:| |stiffness| (|Float|)) (|:| |stability| (|Float|)) (|:| |expense| (|Float|)) (|:| |accuracy| (|Float|)) (|:| |intermediateResults| (|Float|)))))) "\\spad{insert!(r)} inserts an entry \\spad{r} into theIFTable")) (|iFTable| (($ (|List| (|Record| (|:| |key| (|Record| (|:| |xinit| (|DoubleFloat|)) (|:| |xend| (|DoubleFloat|)) (|:| |fn| (|Vector| (|Expression| (|DoubleFloat|)))) (|:| |yinit| (|List| (|DoubleFloat|))) (|:| |intvals| (|List| (|DoubleFloat|))) (|:| |g| (|Expression| (|DoubleFloat|))) (|:| |abserr| (|DoubleFloat|)) (|:| |relerr| (|DoubleFloat|)))) (|:| |entry| (|Record| (|:| |stiffness| (|Float|)) (|:| |stability| (|Float|)) (|:| |expense| (|Float|)) (|:| |accuracy| (|Float|)) (|:| |intermediateResults| (|Float|))))))) "\\spad{iFTable(l)} creates an intensity-functions table from the elements of \\spad{l}.")) (|keys| (((|List| (|Record| (|:| |xinit| (|DoubleFloat|)) (|:| |xend| (|DoubleFloat|)) (|:| |fn| (|Vector| (|Expression| (|DoubleFloat|)))) (|:| |yinit| (|List| (|DoubleFloat|))) (|:| |intvals| (|List| (|DoubleFloat|))) (|:| |g| (|Expression| (|DoubleFloat|))) (|:| |abserr| (|DoubleFloat|)) (|:| |relerr| (|DoubleFloat|)))) $) "\\spad{keys(tab)} returns the list of keys of \\spad{f}")) (|clearTheIFTable| (((|Void|)) "\\spad{clearTheIFTable()} clears the current table of intensity functions.")) (|showTheIFTable| (($) "\\spad{showTheIFTable()} returns the current table of intensity functions."))) 
 NIL 
 NIL 
-(-816 R -1967) 
+(-816 R -1966) 
 ((|constructor| (NIL "\\spadtype{ODEIntegration} provides an interface to the integrator. This package is intended for use by the differential equations solver but not at top-level.")) (|diff| (((|Mapping| |#2| |#2|) (|Symbol|)) "\\spad{diff(x)} returns the derivation with respect to \\spad{x}.")) (|expint| ((|#2| |#2| (|Symbol|)) "\\spad{expint(f, x)} returns e^{the integral of \\spad{f} with respect to \\spad{x}}.")) (|int| ((|#2| |#2| (|Symbol|)) "\\spad{int(f, x)} returns the integral of \\spad{f} with respect to \\spad{x}."))) 
 NIL 
 NIL 
@@ -3200,11 +3200,11 @@ NIL
 ((|measure| (((|Record| (|:| |measure| (|Float|)) (|:| |name| (|String|)) (|:| |explanations| (|List| (|String|)))) (|NumericalODEProblem|) (|RoutinesTable|)) "\\spad{measure(prob,R)} is a top level ANNA function for identifying the most appropriate numerical routine from those in the routines table provided for solving the numerical ODE problem defined by \\axiom{\\spad{prob}}. \\blankline It calls each \\axiom{domain} listed in \\axiom{\\spad{R}} of \\axiom{category} \\axiomType{OrdinaryDifferentialEquationsSolverCategory} in turn to calculate all measures and returns the best \\spadignore{i.e.} the name of the most appropriate domain and any other relevant information. It predicts the likely most effective NAG numerical Library routine to solve the input set of ODEs by checking various attributes of the system of ODEs and calculating a measure of compatibility of each routine to these attributes.") (((|Record| (|:| |measure| (|Float|)) (|:| |name| (|String|)) (|:| |explanations| (|List| (|String|)))) (|NumericalODEProblem|)) "\\spad{measure(prob)} is a top level ANNA function for identifying the most appropriate numerical routine from those in the routines table provided for solving the numerical ODE problem defined by \\axiom{\\spad{prob}}. \\blankline It calls each \\axiom{domain} of \\axiom{category} \\axiomType{OrdinaryDifferentialEquationsSolverCategory} in turn to calculate all measures and returns the best \\spadignore{i.e.} the name of the most appropriate domain and any other relevant information. It predicts the likely most effective NAG numerical Library routine to solve the input set of ODEs by checking various attributes of the system of ODEs and calculating a measure of compatibility of each routine to these attributes.")) (|solve| (((|Result|) (|Vector| (|Expression| (|Float|))) (|Float|) (|Float|) (|List| (|Float|)) (|Expression| (|Float|)) (|List| (|Float|)) (|Float|) (|Float|)) "\\spad{solve(f,xStart,xEnd,yInitial,G,intVals,epsabs,epsrel)} is a top level ANNA function to solve numerically a system of ordinary differential equations,{} \\axiom{\\spad{f}},{} \\spadignore{i.e.} equations for the derivatives \\spad{Y}[1]'..\\spad{Y}[\\spad{n}]' defined in terms of \\spad{X},{}\\spad{Y}[1]..\\spad{Y}[\\spad{n}] from \\axiom{\\spad{xStart}} to \\axiom{\\spad{xEnd}} with the initial values for \\spad{Y}[1]..\\spad{Y}[\\spad{n}] (\\axiom{\\spad{yInitial}}) to an absolute error requirement \\axiom{\\spad{epsabs}} and relative error \\axiom{\\spad{epsrel}}. The values of \\spad{Y}[1]..\\spad{Y}[\\spad{n}] will be output for the values of \\spad{X} in \\axiom{\\spad{intVals}}. The calculation will stop if the function \\spad{G}(\\spad{X},{}\\spad{Y}[1],{}..,{}\\spad{Y}[\\spad{n}]) evaluates to zero before \\spad{X} = \\spad{xEnd}. \\blankline It iterates over the \\axiom{domains} of \\axiomType{OrdinaryDifferentialEquationsSolverCategory} contained in the table of routines \\axiom{\\spad{R}} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline The method used to perform the numerical process will be one of the routines contained in the NAG numerical Library. The function predicts the likely most effective routine by checking various attributes of the system of ODE\\spad{'s} and calculating a measure of compatibility of each routine to these attributes. \\blankline It then calls the resulting `best' routine.") (((|Result|) (|Vector| (|Expression| (|Float|))) (|Float|) (|Float|) (|List| (|Float|)) (|Expression| (|Float|)) (|List| (|Float|)) (|Float|)) "\\spad{solve(f,xStart,xEnd,yInitial,G,intVals,tol)} is a top level ANNA function to solve numerically a system of ordinary differential equations,{} \\axiom{\\spad{f}},{} \\spadignore{i.e.} equations for the derivatives \\spad{Y}[1]'..\\spad{Y}[\\spad{n}]' defined in terms of \\spad{X},{}\\spad{Y}[1]..\\spad{Y}[\\spad{n}] from \\axiom{\\spad{xStart}} to \\axiom{\\spad{xEnd}} with the initial values for \\spad{Y}[1]..\\spad{Y}[\\spad{n}] (\\axiom{\\spad{yInitial}}) to a tolerance \\axiom{\\spad{tol}}. The values of \\spad{Y}[1]..\\spad{Y}[\\spad{n}] will be output for the values of \\spad{X} in \\axiom{\\spad{intVals}}. The calculation will stop if the function \\spad{G}(\\spad{X},{}\\spad{Y}[1],{}..,{}\\spad{Y}[\\spad{n}]) evaluates to zero before \\spad{X} = \\spad{xEnd}. \\blankline It iterates over the \\axiom{domains} of \\axiomType{OrdinaryDifferentialEquationsSolverCategory} contained in the table of routines \\axiom{\\spad{R}} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline The method used to perform the numerical process will be one of the routines contained in the NAG numerical Library. The function predicts the likely most effective routine by checking various attributes of the system of ODE\\spad{'s} and calculating a measure of compatibility of each routine to these attributes. \\blankline It then calls the resulting `best' routine.") (((|Result|) (|Vector| (|Expression| (|Float|))) (|Float|) (|Float|) (|List| (|Float|)) (|List| (|Float|)) (|Float|)) "\\spad{solve(f,xStart,xEnd,yInitial,intVals,tol)} is a top level ANNA function to solve numerically a system of ordinary differential equations,{} \\axiom{\\spad{f}},{} \\spadignore{i.e.} equations for the derivatives \\spad{Y}[1]'..\\spad{Y}[\\spad{n}]' defined in terms of \\spad{X},{}\\spad{Y}[1]..\\spad{Y}[\\spad{n}] from \\axiom{\\spad{xStart}} to \\axiom{\\spad{xEnd}} with the initial values for \\spad{Y}[1]..\\spad{Y}[\\spad{n}] (\\axiom{\\spad{yInitial}}) to a tolerance \\axiom{\\spad{tol}}. The values of \\spad{Y}[1]..\\spad{Y}[\\spad{n}] will be output for the values of \\spad{X} in \\axiom{\\spad{intVals}}. \\blankline It iterates over the \\axiom{domains} of \\axiomType{OrdinaryDifferentialEquationsSolverCategory} contained in the table of routines \\axiom{\\spad{R}} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline The method used to perform the numerical process will be one of the routines contained in the NAG numerical Library. The function predicts the likely most effective routine by checking various attributes of the system of ODE\\spad{'s} and calculating a measure of compatibility of each routine to these attributes. \\blankline It then calls the resulting `best' routine.") (((|Result|) (|Vector| (|Expression| (|Float|))) (|Float|) (|Float|) (|List| (|Float|)) (|Expression| (|Float|)) (|Float|)) "\\spad{solve(f,xStart,xEnd,yInitial,G,tol)} is a top level ANNA function to solve numerically a system of ordinary differential equations,{} \\axiom{\\spad{f}},{} \\spadignore{i.e.} equations for the derivatives \\spad{Y}[1]'..\\spad{Y}[\\spad{n}]' defined in terms of \\spad{X},{}\\spad{Y}[1]..\\spad{Y}[\\spad{n}] from \\axiom{\\spad{xStart}} to \\axiom{\\spad{xEnd}} with the initial values for \\spad{Y}[1]..\\spad{Y}[\\spad{n}] (\\axiom{\\spad{yInitial}}) to a tolerance \\axiom{\\spad{tol}}. The calculation will stop if the function \\spad{G}(\\spad{X},{}\\spad{Y}[1],{}..,{}\\spad{Y}[\\spad{n}]) evaluates to zero before \\spad{X} = \\spad{xEnd}. \\blankline It iterates over the \\axiom{domains} of \\axiomType{OrdinaryDifferentialEquationsSolverCategory} contained in the table of routines \\axiom{\\spad{R}} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline The method used to perform the numerical process will be one of the routines contained in the NAG numerical Library. The function predicts the likely most effective routine by checking various attributes of the system of ODE\\spad{'s} and calculating a measure of compatibility of each routine to these attributes. \\blankline It then calls the resulting `best' routine.") (((|Result|) (|Vector| (|Expression| (|Float|))) (|Float|) (|Float|) (|List| (|Float|)) (|Float|)) "\\spad{solve(f,xStart,xEnd,yInitial,tol)} is a top level ANNA function to solve numerically a system of ordinary differential equations,{} \\axiom{\\spad{f}},{} \\spadignore{i.e.} equations for the derivatives \\spad{Y}[1]'..\\spad{Y}[\\spad{n}]' defined in terms of \\spad{X},{}\\spad{Y}[1]..\\spad{Y}[\\spad{n}] from \\axiom{\\spad{xStart}} to \\axiom{\\spad{xEnd}} with the initial values for \\spad{Y}[1]..\\spad{Y}[\\spad{n}] (\\axiom{\\spad{yInitial}}) to a tolerance \\axiom{\\spad{tol}}. \\blankline It iterates over the \\axiom{domains} of \\axiomType{OrdinaryDifferentialEquationsSolverCategory} contained in the table of routines \\axiom{\\spad{R}} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline The method used to perform the numerical process will be one of the routines contained in the NAG numerical Library. The function predicts the likely most effective routine by checking various attributes of the system of ODE\\spad{'s} and calculating a measure of compatibility of each routine to these attributes. \\blankline It then calls the resulting `best' routine.") (((|Result|) (|Vector| (|Expression| (|Float|))) (|Float|) (|Float|) (|List| (|Float|))) "\\spad{solve(f,xStart,xEnd,yInitial)} is a top level ANNA function to solve numerically a system of ordinary differential equations \\spadignore{i.e.} equations for the derivatives \\spad{Y}[1]'..\\spad{Y}[\\spad{n}]' defined in terms of \\spad{X},{}\\spad{Y}[1]..\\spad{Y}[\\spad{n}],{} together with a starting value for \\spad{X} and \\spad{Y}[1]..\\spad{Y}[\\spad{n}] (called the initial conditions) and a final value of \\spad{X}. A default value is used for the accuracy requirement. \\blankline It iterates over the \\axiom{domains} of \\axiomType{OrdinaryDifferentialEquationsSolverCategory} contained in the table of routines \\axiom{\\spad{R}} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline The method used to perform the numerical process will be one of the routines contained in the NAG numerical Library. The function predicts the likely most effective routine by checking various attributes of the system of ODE\\spad{'s} and calculating a measure of compatibility of each routine to these attributes. \\blankline It then calls the resulting `best' routine.") (((|Result|) (|NumericalODEProblem|) (|RoutinesTable|)) "\\spad{solve(odeProblem,R)} is a top level ANNA function to solve numerically a system of ordinary differential equations \\spadignore{i.e.} equations for the derivatives \\spad{Y}[1]'..\\spad{Y}[\\spad{n}]' defined in terms of \\spad{X},{}\\spad{Y}[1]..\\spad{Y}[\\spad{n}],{} together with starting values for \\spad{X} and \\spad{Y}[1]..\\spad{Y}[\\spad{n}] (called the initial conditions),{} a final value of \\spad{X},{} an accuracy requirement and any intermediate points at which the result is required. \\blankline It iterates over the \\axiom{domains} of \\axiomType{OrdinaryDifferentialEquationsSolverCategory} contained in the table of routines \\axiom{\\spad{R}} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline The method used to perform the numerical process will be one of the routines contained in the NAG numerical Library. The function predicts the likely most effective routine by checking various attributes of the system of ODE\\spad{'s} and calculating a measure of compatibility of each routine to these attributes. \\blankline It then calls the resulting `best' routine.") (((|Result|) (|NumericalODEProblem|)) "\\spad{solve(odeProblem)} is a top level ANNA function to solve numerically a system of ordinary differential equations \\spadignore{i.e.} equations for the derivatives \\spad{Y}[1]'..\\spad{Y}[\\spad{n}]' defined in terms of \\spad{X},{}\\spad{Y}[1]..\\spad{Y}[\\spad{n}],{} together with starting values for \\spad{X} and \\spad{Y}[1]..\\spad{Y}[\\spad{n}] (called the initial conditions),{} a final value of \\spad{X},{} an accuracy requirement and any intermediate points at which the result is required. \\blankline It iterates over the \\axiom{domains} of \\axiomType{OrdinaryDifferentialEquationsSolverCategory} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline The method used to perform the numerical process will be one of the routines contained in the NAG numerical Library. The function predicts the likely most effective routine by checking various attributes of the system of ODE\\spad{'s} and calculating a measure of compatibility of each routine to these attributes. \\blankline It then calls the resulting `best' routine."))) 
 NIL 
 NIL 
-(-818 -1967 UP UPUP R) 
+(-818 -1966 UP UPUP R) 
 ((|constructor| (NIL "In-field solution of an linear ordinary differential equation,{} pure algebraic case.")) (|algDsolve| (((|Record| (|:| |particular| (|Union| |#4| "failed")) (|:| |basis| (|List| |#4|))) (|LinearOrdinaryDifferentialOperator1| |#4|) |#4|) "\\spad{algDsolve(op, g)} returns \\spad{[\"failed\", []]} if the equation \\spad{op y = g} has no solution in \\spad{R}. Otherwise,{} it returns \\spad{[f, [y1,...,ym]]} where \\spad{f} is a particular rational solution and the \\spad{y_i's} form a basis for the solutions in \\spad{R} of the homogeneous equation."))) 
 NIL 
 NIL 
-(-819 -1967 UP L LQ) 
+(-819 -1966 UP L LQ) 
 ((|constructor| (NIL "\\spad{PrimitiveRatDE} provides functions for in-field solutions of linear \\indented{1}{ordinary differential equations,{} in the transcendental case.} \\indented{1}{The derivation to use is given by the parameter \\spad{L}.}")) (|splitDenominator| (((|Record| (|:| |eq| |#3|) (|:| |rh| (|List| (|Fraction| |#2|)))) |#4| (|List| (|Fraction| |#2|))) "\\spad{splitDenominator(op, [g1,...,gm])} returns \\spad{op0, [h1,...,hm]} such that the equations \\spad{op y = c1 g1 + ... + cm gm} and \\spad{op0 y = c1 h1 + ... + cm hm} have the same solutions.")) (|indicialEquation| ((|#2| |#4| |#1|) "\\spad{indicialEquation(op, a)} returns the indicial equation of \\spad{op} at \\spad{a}.") ((|#2| |#3| |#1|) "\\spad{indicialEquation(op, a)} returns the indicial equation of \\spad{op} at \\spad{a}.")) (|indicialEquations| (((|List| (|Record| (|:| |center| |#2|) (|:| |equation| |#2|))) |#4| |#2|) "\\spad{indicialEquations(op, p)} returns \\spad{[[d1,e1],...,[dq,eq]]} where the \\spad{d_i}\\spad{'s} are the affine singularities of \\spad{op} above the roots of \\spad{p},{} and the \\spad{e_i}\\spad{'s} are the indicial equations at each \\spad{d_i}.") (((|List| (|Record| (|:| |center| |#2|) (|:| |equation| |#2|))) |#4|) "\\spad{indicialEquations op} returns \\spad{[[d1,e1],...,[dq,eq]]} where the \\spad{d_i}\\spad{'s} are the affine singularities of \\spad{op},{} and the \\spad{e_i}\\spad{'s} are the indicial equations at each \\spad{d_i}.") (((|List| (|Record| (|:| |center| |#2|) (|:| |equation| |#2|))) |#3| |#2|) "\\spad{indicialEquations(op, p)} returns \\spad{[[d1,e1],...,[dq,eq]]} where the \\spad{d_i}\\spad{'s} are the affine singularities of \\spad{op} above the roots of \\spad{p},{} and the \\spad{e_i}\\spad{'s} are the indicial equations at each \\spad{d_i}.") (((|List| (|Record| (|:| |center| |#2|) (|:| |equation| |#2|))) |#3|) "\\spad{indicialEquations op} returns \\spad{[[d1,e1],...,[dq,eq]]} where the \\spad{d_i}\\spad{'s} are the affine singularities of \\spad{op},{} and the \\spad{e_i}\\spad{'s} are the indicial equations at each \\spad{d_i}.")) (|denomLODE| ((|#2| |#3| (|List| (|Fraction| |#2|))) "\\spad{denomLODE(op, [g1,...,gm])} returns a polynomial \\spad{d} such that any rational solution of \\spad{op y = c1 g1 + ... + cm gm} is of the form \\spad{p/d} for some polynomial \\spad{p}.") (((|Union| |#2| "failed") |#3| (|Fraction| |#2|)) "\\spad{denomLODE(op, g)} returns a polynomial \\spad{d} such that any rational solution of \\spad{op y = g} is of the form \\spad{p/d} for some polynomial \\spad{p},{} and \"failed\",{} if the equation has no rational solution."))) 
 NIL 
 NIL 
@@ -3212,27 +3212,27 @@ NIL
 ((|retract| (((|Record| (|:| |xinit| (|DoubleFloat|)) (|:| |xend| (|DoubleFloat|)) (|:| |fn| (|Vector| (|Expression| (|DoubleFloat|)))) (|:| |yinit| (|List| (|DoubleFloat|))) (|:| |intvals| (|List| (|DoubleFloat|))) (|:| |g| (|Expression| (|DoubleFloat|))) (|:| |abserr| (|DoubleFloat|)) (|:| |relerr| (|DoubleFloat|))) $) "\\spad{retract(x)} \\undocumented{}")) (|coerce| (($ (|Record| (|:| |xinit| (|DoubleFloat|)) (|:| |xend| (|DoubleFloat|)) (|:| |fn| (|Vector| (|Expression| (|DoubleFloat|)))) (|:| |yinit| (|List| (|DoubleFloat|))) (|:| |intvals| (|List| (|DoubleFloat|))) (|:| |g| (|Expression| (|DoubleFloat|))) (|:| |abserr| (|DoubleFloat|)) (|:| |relerr| (|DoubleFloat|)))) "\\spad{coerce(x)} \\undocumented{}"))) 
 NIL 
 NIL 
-(-821 -1967 UP L LQ) 
+(-821 -1966 UP L LQ) 
 ((|constructor| (NIL "In-field solution of Riccati equations,{} primitive case.")) (|changeVar| ((|#3| |#3| (|Fraction| |#2|)) "\\spad{changeVar(+/[ai D^i], a)} returns the operator \\spad{+/[ai (D+a)^i]}.") ((|#3| |#3| |#2|) "\\spad{changeVar(+/[ai D^i], a)} returns the operator \\spad{+/[ai (D+a)^i]}.")) (|singRicDE| (((|List| (|Record| (|:| |frac| (|Fraction| |#2|)) (|:| |eq| |#3|))) |#3| (|Mapping| (|List| |#2|) |#2| (|SparseUnivariatePolynomial| |#2|)) (|Mapping| (|Factored| |#2|) |#2|)) "\\spad{singRicDE(op, zeros, ezfactor)} returns \\spad{[[f1, L1], [f2, L2], ... , [fk, Lk]]} such that the singular part of any rational solution of the associated Riccati equation of \\spad{op y=0} must be one of the \\spad{fi}\\spad{'s} (up to the constant coefficient),{} in which case the equation for \\spad{z=y e^{-int p}} is \\spad{Li z=0}. \\spad{zeros(C(x),H(x,y))} returns all the \\spad{P_i(x)}\\spad{'s} such that \\spad{H(x,P_i(x)) = 0 modulo C(x)}. Argument \\spad{ezfactor} is a factorisation in \\spad{UP},{} not necessarily into irreducibles.")) (|polyRicDE| (((|List| (|Record| (|:| |poly| |#2|) (|:| |eq| |#3|))) |#3| (|Mapping| (|List| |#1|) |#2|)) "\\spad{polyRicDE(op, zeros)} returns \\spad{[[p1, L1], [p2, L2], ... , [pk, Lk]]} such that the polynomial part of any rational solution of the associated Riccati equation of \\spad{op y=0} must be one of the \\spad{pi}\\spad{'s} (up to the constant coefficient),{} in which case the equation for \\spad{z=y e^{-int p}} is \\spad{Li z =0}. \\spad{zeros} is a zero finder in \\spad{UP}.")) (|constantCoefficientRicDE| (((|List| (|Record| (|:| |constant| |#1|) (|:| |eq| |#3|))) |#3| (|Mapping| (|List| |#1|) |#2|)) "\\spad{constantCoefficientRicDE(op, ric)} returns \\spad{[[a1, L1], [a2, L2], ... , [ak, Lk]]} such that any rational solution with no polynomial part of the associated Riccati equation of \\spad{op y = 0} must be one of the \\spad{ai}\\spad{'s} in which case the equation for \\spad{z = y e^{-int ai}} is \\spad{Li z = 0}. \\spad{ric} is a Riccati equation solver over \\spad{F},{} whose input is the associated linear equation.")) (|leadingCoefficientRicDE| (((|List| (|Record| (|:| |deg| (|NonNegativeInteger|)) (|:| |eq| |#2|))) |#3|) "\\spad{leadingCoefficientRicDE(op)} returns \\spad{[[m1, p1], [m2, p2], ... , [mk, pk]]} such that the polynomial part of any rational solution of the associated Riccati equation of \\spad{op y = 0} must have degree \\spad{mj} for some \\spad{j},{} and its leading coefficient is then a zero of \\spad{pj}. In addition,{}\\spad{m1>m2> ... >mk}.")) (|denomRicDE| ((|#2| |#3|) "\\spad{denomRicDE(op)} returns a polynomial \\spad{d} such that any rational solution of the associated Riccati equation of \\spad{op y = 0} is of the form \\spad{p/d + q'/q + r} for some polynomials \\spad{p} and \\spad{q} and a reduced \\spad{r}. Also,{} \\spad{deg(p) < deg(d)} and {\\spad{gcd}(\\spad{d},{}\\spad{q}) = 1}."))) 
 NIL 
 NIL 
-(-822 -1967 UP) 
+(-822 -1966 UP) 
 ((|constructor| (NIL "\\spad{RationalLODE} provides functions for in-field solutions of linear \\indented{1}{ordinary differential equations,{} in the rational case.}")) (|indicialEquationAtInfinity| ((|#2| (|LinearOrdinaryDifferentialOperator2| |#2| (|Fraction| |#2|))) "\\spad{indicialEquationAtInfinity op} returns the indicial equation of \\spad{op} at infinity.") ((|#2| (|LinearOrdinaryDifferentialOperator1| (|Fraction| |#2|))) "\\spad{indicialEquationAtInfinity op} returns the indicial equation of \\spad{op} at infinity.")) (|ratDsolve| (((|Record| (|:| |basis| (|List| (|Fraction| |#2|))) (|:| |mat| (|Matrix| |#1|))) (|LinearOrdinaryDifferentialOperator2| |#2| (|Fraction| |#2|)) (|List| (|Fraction| |#2|))) "\\spad{ratDsolve(op, [g1,...,gm])} returns \\spad{[[h1,...,hq], M]} such that any rational solution of \\spad{op y = c1 g1 + ... + cm gm} is of the form \\spad{d1 h1 + ... + dq hq} where \\spad{M [d1,...,dq,c1,...,cm] = 0}.") (((|Record| (|:| |particular| (|Union| (|Fraction| |#2|) "failed")) (|:| |basis| (|List| (|Fraction| |#2|)))) (|LinearOrdinaryDifferentialOperator2| |#2| (|Fraction| |#2|)) (|Fraction| |#2|)) "\\spad{ratDsolve(op, g)} returns \\spad{[\"failed\", []]} if the equation \\spad{op y = g} has no rational solution. Otherwise,{} it returns \\spad{[f, [y1,...,ym]]} where \\spad{f} is a particular rational solution and the \\spad{yi}\\spad{'s} form a basis for the rational solutions of the homogeneous equation.") (((|Record| (|:| |basis| (|List| (|Fraction| |#2|))) (|:| |mat| (|Matrix| |#1|))) (|LinearOrdinaryDifferentialOperator1| (|Fraction| |#2|)) (|List| (|Fraction| |#2|))) "\\spad{ratDsolve(op, [g1,...,gm])} returns \\spad{[[h1,...,hq], M]} such that any rational solution of \\spad{op y = c1 g1 + ... + cm gm} is of the form \\spad{d1 h1 + ... + dq hq} where \\spad{M [d1,...,dq,c1,...,cm] = 0}.") (((|Record| (|:| |particular| (|Union| (|Fraction| |#2|) "failed")) (|:| |basis| (|List| (|Fraction| |#2|)))) (|LinearOrdinaryDifferentialOperator1| (|Fraction| |#2|)) (|Fraction| |#2|)) "\\spad{ratDsolve(op, g)} returns \\spad{[\"failed\", []]} if the equation \\spad{op y = g} has no rational solution. Otherwise,{} it returns \\spad{[f, [y1,...,ym]]} where \\spad{f} is a particular rational solution and the \\spad{yi}\\spad{'s} form a basis for the rational solutions of the homogeneous equation."))) 
 NIL 
 NIL 
-(-823 -1967 L UP A LO) 
+(-823 -1966 L UP A LO) 
 ((|constructor| (NIL "Elimination of an algebraic from the coefficentss of a linear ordinary differential equation.")) (|reduceLODE| (((|Record| (|:| |mat| (|Matrix| |#2|)) (|:| |vec| (|Vector| |#1|))) |#5| |#4|) "\\spad{reduceLODE(op, g)} returns \\spad{[m, v]} such that any solution in \\spad{A} of \\spad{op z = g} is of the form \\spad{z = (z_1,...,z_m) . (b_1,...,b_m)} where the \\spad{b_i's} are the basis of \\spad{A} over \\spad{F} returned by \\spadfun{basis}() from \\spad{A},{} and the \\spad{z_i's} satisfy the differential system \\spad{M.z = v}."))) 
 NIL 
 NIL 
-(-824 -1967 UP) 
+(-824 -1966 UP) 
 ((|constructor| (NIL "In-field solution of Riccati equations,{} rational case.")) (|polyRicDE| (((|List| (|Record| (|:| |poly| |#2|) (|:| |eq| (|LinearOrdinaryDifferentialOperator2| |#2| (|Fraction| |#2|))))) (|LinearOrdinaryDifferentialOperator2| |#2| (|Fraction| |#2|)) (|Mapping| (|List| |#1|) |#2|)) "\\spad{polyRicDE(op, zeros)} returns \\spad{[[p1, L1], [p2, L2], ... , [pk,Lk]]} such that the polynomial part of any rational solution of the associated Riccati equation of \\spad{op y = 0} must be one of the \\spad{pi}\\spad{'s} (up to the constant coefficient),{} in which case the equation for \\spad{z = y e^{-int p}} is \\spad{Li z = 0}. \\spad{zeros} is a zero finder in \\spad{UP}.")) (|singRicDE| (((|List| (|Record| (|:| |frac| (|Fraction| |#2|)) (|:| |eq| (|LinearOrdinaryDifferentialOperator2| |#2| (|Fraction| |#2|))))) (|LinearOrdinaryDifferentialOperator2| |#2| (|Fraction| |#2|)) (|Mapping| (|Factored| |#2|) |#2|)) "\\spad{singRicDE(op, ezfactor)} returns \\spad{[[f1,L1], [f2,L2],..., [fk,Lk]]} such that the singular \\spad{++} part of any rational solution of the associated Riccati equation of \\spad{op y = 0} must be one of the \\spad{fi}\\spad{'s} (up to the constant coefficient),{} in which case the equation for \\spad{z = y e^{-int ai}} is \\spad{Li z = 0}. Argument \\spad{ezfactor} is a factorisation in \\spad{UP},{} not necessarily into irreducibles.")) (|ricDsolve| (((|List| (|Fraction| |#2|)) (|LinearOrdinaryDifferentialOperator2| |#2| (|Fraction| |#2|)) (|Mapping| (|Factored| |#2|) |#2|)) "\\spad{ricDsolve(op, ezfactor)} returns the rational solutions of the associated Riccati equation of \\spad{op y = 0}. Argument \\spad{ezfactor} is a factorisation in \\spad{UP},{} not necessarily into irreducibles.") (((|List| (|Fraction| |#2|)) (|LinearOrdinaryDifferentialOperator2| |#2| (|Fraction| |#2|))) "\\spad{ricDsolve(op)} returns the rational solutions of the associated Riccati equation of \\spad{op y = 0}.") (((|List| (|Fraction| |#2|)) (|LinearOrdinaryDifferentialOperator1| (|Fraction| |#2|)) (|Mapping| (|Factored| |#2|) |#2|)) "\\spad{ricDsolve(op, ezfactor)} returns the rational solutions of the associated Riccati equation of \\spad{op y = 0}. Argument \\spad{ezfactor} is a factorisation in \\spad{UP},{} not necessarily into irreducibles.") (((|List| (|Fraction| |#2|)) (|LinearOrdinaryDifferentialOperator1| (|Fraction| |#2|))) "\\spad{ricDsolve(op)} returns the rational solutions of the associated Riccati equation of \\spad{op y = 0}.") (((|List| (|Fraction| |#2|)) (|LinearOrdinaryDifferentialOperator2| |#2| (|Fraction| |#2|)) (|Mapping| (|List| |#1|) |#2|) (|Mapping| (|Factored| |#2|) |#2|)) "\\spad{ricDsolve(op, zeros, ezfactor)} returns the rational solutions of the associated Riccati equation of \\spad{op y = 0}. \\spad{zeros} is a zero finder in \\spad{UP}. Argument \\spad{ezfactor} is a factorisation in \\spad{UP},{} not necessarily into irreducibles.") (((|List| (|Fraction| |#2|)) (|LinearOrdinaryDifferentialOperator2| |#2| (|Fraction| |#2|)) (|Mapping| (|List| |#1|) |#2|)) "\\spad{ricDsolve(op, zeros)} returns the rational solutions of the associated Riccati equation of \\spad{op y = 0}. \\spad{zeros} is a zero finder in \\spad{UP}.") (((|List| (|Fraction| |#2|)) (|LinearOrdinaryDifferentialOperator1| (|Fraction| |#2|)) (|Mapping| (|List| |#1|) |#2|) (|Mapping| (|Factored| |#2|) |#2|)) "\\spad{ricDsolve(op, zeros, ezfactor)} returns the rational solutions of the associated Riccati equation of \\spad{op y = 0}. \\spad{zeros} is a zero finder in \\spad{UP}. Argument \\spad{ezfactor} is a factorisation in \\spad{UP},{} not necessarily into irreducibles.") (((|List| (|Fraction| |#2|)) (|LinearOrdinaryDifferentialOperator1| (|Fraction| |#2|)) (|Mapping| (|List| |#1|) |#2|)) "\\spad{ricDsolve(op, zeros)} returns the rational solutions of the associated Riccati equation of \\spad{op y = 0}. \\spad{zeros} is a zero finder in \\spad{UP}."))) 
 NIL 
 ((|HasCategory| |#1| (QUOTE (-27)))) 
-(-825 -1967 LO) 
+(-825 -1966 LO) 
 ((|constructor| (NIL "SystemODESolver provides tools for triangulating and solving some systems of linear ordinary differential equations.")) (|solveInField| (((|Record| (|:| |particular| (|Union| (|Vector| |#1|) "failed")) (|:| |basis| (|List| (|Vector| |#1|)))) (|Matrix| |#2|) (|Vector| |#1|) (|Mapping| (|Record| (|:| |particular| (|Union| |#1| "failed")) (|:| |basis| (|List| |#1|))) |#2| |#1|)) "\\spad{solveInField(m, v, solve)} returns \\spad{[[v_1,...,v_m], v_p]} such that the solutions in \\spad{F} of the system \\spad{m x = v} are \\spad{v_p + c_1 v_1 + ... + c_m v_m} where the \\spad{c_i's} are constants,{} and the \\spad{v_i's} form a basis for the solutions of \\spad{m x = 0}. Argument \\spad{solve} is a function for solving a single linear ordinary differential equation in \\spad{F}.")) (|solve| (((|Union| (|Record| (|:| |particular| (|Vector| |#1|)) (|:| |basis| (|Matrix| |#1|))) "failed") (|Matrix| |#1|) (|Vector| |#1|) (|Mapping| (|Union| (|Record| (|:| |particular| |#1|) (|:| |basis| (|List| |#1|))) "failed") |#2| |#1|)) "\\spad{solve(m, v, solve)} returns \\spad{[[v_1,...,v_m], v_p]} such that the solutions in \\spad{F} of the system \\spad{D x = m x + v} are \\spad{v_p + c_1 v_1 + ... + c_m v_m} where the \\spad{c_i's} are constants,{} and the \\spad{v_i's} form a basis for the solutions of \\spad{D x = m x}. Argument \\spad{solve} is a function for solving a single linear ordinary differential equation in \\spad{F}.")) (|triangulate| (((|Record| (|:| |mat| (|Matrix| |#2|)) (|:| |vec| (|Vector| |#1|))) (|Matrix| |#2|) (|Vector| |#1|)) "\\spad{triangulate(m, v)} returns \\spad{[m_0, v_0]} such that \\spad{m_0} is upper triangular and the system \\spad{m_0 x = v_0} is equivalent to \\spad{m x = v}.") (((|Record| (|:| A (|Matrix| |#1|)) (|:| |eqs| (|List| (|Record| (|:| C (|Matrix| |#1|)) (|:| |g| (|Vector| |#1|)) (|:| |eq| |#2|) (|:| |rh| |#1|))))) (|Matrix| |#1|) (|Vector| |#1|)) "\\spad{triangulate(M,v)} returns \\spad{A,[[C_1,g_1,L_1,h_1],...,[C_k,g_k,L_k,h_k]]} such that under the change of variable \\spad{y = A z},{} the first order linear system \\spad{D y = M y + v} is uncoupled as \\spad{D z_i = C_i z_i + g_i} and each \\spad{C_i} is a companion matrix corresponding to the scalar equation \\spad{L_i z_j = h_i}."))) 
 NIL 
 NIL 
-(-826 -1967 LODO) 
+(-826 -1966 LODO) 
 ((|constructor| (NIL "\\spad{ODETools} provides tools for the linear ODE solver.")) (|particularSolution| (((|Union| |#1| "failed") |#2| |#1| (|List| |#1|) (|Mapping| |#1| |#1|)) "\\spad{particularSolution(op, g, [f1,...,fm], I)} returns a particular solution \\spad{h} of the equation \\spad{op y = g} where \\spad{[f1,...,fm]} are linearly independent and \\spad{op(fi)=0}. The value \"failed\" is returned if no particular solution is found. Note: the method of variations of parameters is used.")) (|variationOfParameters| (((|Union| (|Vector| |#1|) "failed") |#2| |#1| (|List| |#1|)) "\\spad{variationOfParameters(op, g, [f1,...,fm])} returns \\spad{[u1,...,um]} such that a particular solution of the equation \\spad{op y = g} is \\spad{f1 int(u1) + ... + fm int(um)} where \\spad{[f1,...,fm]} are linearly independent and \\spad{op(fi)=0}. The value \"failed\" is returned if \\spad{m < n} and no particular solution is found.")) (|wronskianMatrix| (((|Matrix| |#1|) (|List| |#1|) (|NonNegativeInteger|)) "\\spad{wronskianMatrix([f1,...,fn], q, D)} returns the \\spad{q x n} matrix \\spad{m} whose i^th row is \\spad{[f1^(i-1),...,fn^(i-1)]}.") (((|Matrix| |#1|) (|List| |#1|)) "\\spad{wronskianMatrix([f1,...,fn])} returns the \\spad{n x n} matrix \\spad{m} whose i^th row is \\spad{[f1^(i-1),...,fn^(i-1)]}."))) 
 NIL 
 NIL 
@@ -3572,7 +3572,7 @@ NIL
 ((|PDESolve| (((|Result|) (|Record| (|:| |pde| (|List| (|Expression| (|DoubleFloat|)))) (|:| |constraints| (|List| (|Record| (|:| |start| (|DoubleFloat|)) (|:| |finish| (|DoubleFloat|)) (|:| |grid| (|NonNegativeInteger|)) (|:| |boundaryType| (|Integer|)) (|:| |dStart| (|Matrix| (|DoubleFloat|))) (|:| |dFinish| (|Matrix| (|DoubleFloat|)))))) (|:| |f| (|List| (|List| (|Expression| (|DoubleFloat|))))) (|:| |st| (|String|)) (|:| |tol| (|DoubleFloat|)))) "\\spad{PDESolve(args)} performs the integration of the function given the strategy or method returned by \\axiomFun{measure}.")) (|measure| (((|Record| (|:| |measure| (|Float|)) (|:| |explanations| (|String|))) (|RoutinesTable|) (|Record| (|:| |pde| (|List| (|Expression| (|DoubleFloat|)))) (|:| |constraints| (|List| (|Record| (|:| |start| (|DoubleFloat|)) (|:| |finish| (|DoubleFloat|)) (|:| |grid| (|NonNegativeInteger|)) (|:| |boundaryType| (|Integer|)) (|:| |dStart| (|Matrix| (|DoubleFloat|))) (|:| |dFinish| (|Matrix| (|DoubleFloat|)))))) (|:| |f| (|List| (|List| (|Expression| (|DoubleFloat|))))) (|:| |st| (|String|)) (|:| |tol| (|DoubleFloat|)))) "\\spad{measure(R,args)} calculates an estimate of the ability of a particular method to solve a problem. \\blankline This method may be either a specific NAG routine or a strategy (such as transforming the function from one which is difficult to one which is easier to solve). \\blankline It will call whichever agents are needed to perform analysis on the problem in order to calculate the measure. There is a parameter,{} labelled \\axiom{sofar},{} which would contain the best compatibility found so far."))) 
 NIL 
 NIL 
-(-911 UP -1967) 
+(-911 UP -1966) 
 ((|constructor| (NIL "This package \\undocumented")) (|rightFactorCandidate| ((|#1| |#1| (|NonNegativeInteger|)) "\\spad{rightFactorCandidate(p,n)} \\undocumented")) (|leftFactor| (((|Union| |#1| "failed") |#1| |#1|) "\\spad{leftFactor(p,q)} \\undocumented")) (|decompose| (((|Union| (|Record| (|:| |left| |#1|) (|:| |right| |#1|)) "failed") |#1| (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{decompose(up,m,n)} \\undocumented") (((|List| |#1|) |#1|) "\\spad{decompose(up)} \\undocumented"))) 
 NIL 
 NIL 
@@ -3640,7 +3640,7 @@ NIL
 ((|constructor| (NIL "PrimeField(\\spad{p}) implements the field with \\spad{p} elements if \\spad{p} is a prime number. Error: if \\spad{p} is not prime. Note: this domain does not check that argument is a prime."))) 
 ((-4454 . T) (-4460 . T) (-4455 . T) ((-4464 "*") . T) (-4456 . T) (-4457 . T) (-4459 . T)) 
 ((|HasCategory| $ (QUOTE (-148))) (|HasCategory| $ (QUOTE (-146))) (|HasCategory| $ (QUOTE (-379)))) 
-(-928 R0 -1967 UP UPUP R) 
+(-928 R0 -1966 UP UPUP R) 
 ((|constructor| (NIL "This package provides function for testing whether a divisor on a curve is a torsion divisor.")) (|torsionIfCan| (((|Union| (|Record| (|:| |order| (|NonNegativeInteger|)) (|:| |function| |#5|)) "failed") (|FiniteDivisor| |#2| |#3| |#4| |#5|)) "\\spad{torsionIfCan(f)}\\\\ undocumented")) (|torsion?| (((|Boolean|) (|FiniteDivisor| |#2| |#3| |#4| |#5|)) "\\spad{torsion?(f)} \\undocumented")) (|order| (((|Union| (|NonNegativeInteger|) "failed") (|FiniteDivisor| |#2| |#3| |#4| |#5|)) "\\spad{order(f)} \\undocumented"))) 
 NIL 
 NIL 
@@ -3668,7 +3668,7 @@ NIL
 ((|constructor| (NIL "PermutationGroupExamples provides permutation groups for some classes of groups: symmetric,{} alternating,{} dihedral,{} cyclic,{} direct products of cyclic,{} which are in fact the finite abelian groups of symmetric groups called Young subgroups. Furthermore,{} Rubik\\spad{'s} group as permutation group of 48 integers and a list of sporadic simple groups derived from the atlas of finite groups.")) (|youngGroup| (((|PermutationGroup| (|Integer|)) (|Partition|)) "\\spad{youngGroup(lambda)} constructs the direct product of the symmetric groups given by the parts of the partition {\\em lambda}.") (((|PermutationGroup| (|Integer|)) (|List| (|Integer|))) "\\spad{youngGroup([n1,...,nk])} constructs the direct product of the symmetric groups {\\em Sn1},{}...,{}{\\em Snk}.")) (|rubiksGroup| (((|PermutationGroup| (|Integer|))) "\\spad{rubiksGroup constructs} the permutation group representing Rubic\\spad{'s} Cube acting on integers {\\em 10*i+j} for {\\em 1 <= i <= 6},{} {\\em 1 <= j <= 8}. The faces of Rubik\\spad{'s} Cube are labelled in the obvious way Front,{} Right,{} Up,{} Down,{} Left,{} Back and numbered from 1 to 6 in this given ordering,{} the pieces on each face (except the unmoveable center piece) are clockwise numbered from 1 to 8 starting with the piece in the upper left corner. The moves of the cube are represented as permutations on these pieces,{} represented as a two digit integer {\\em ij} where \\spad{i} is the numer of theface (1 to 6) and \\spad{j} is the number of the piece on this face. The remaining ambiguities are resolved by looking at the 6 generators,{} which represent a 90 degree turns of the faces,{} or from the following pictorial description. Permutation group representing Rubic\\spad{'s} Cube acting on integers 10*i+j for 1 \\spad{<=} \\spad{i} \\spad{<=} 6,{} 1 \\spad{<=} \\spad{j} \\spad{<=8}. \\blankline\\begin{verbatim}Rubik's Cube:   +-----+ +-- B   where: marks Side # :               / U   /|/              /     / |         F(ront)    <->    1      L -->  +-----+ R|         R(ight)    <->    2             |     |  +         U(p)       <->    3             |  F  | /          D(own)     <->    4             |     |/           L(eft)     <->    5             +-----+            B(ack)     <->    6                ^                |                DThe Cube's surface:                               The pieces on each side            +---+              (except the unmoveable center            |567|              piece) are clockwise numbered            |4U8|              from 1 to 8 starting with the            |321|              piece in the upper left        +---+---+---+          corner (see figure on the        |781|123|345|          left).  The moves of the cube        |6L2|8F4|2R6|          are represented as        |543|765|187|          permutations on these pieces.        +---+---+---+          Each of the pieces is            |123|              represented as a two digit            |8D4|              integer ij where i is the            |765|              # of the side ( 1 to 6 for            +---+              F to B (see table above ))            |567|              and j is the # of the piece.            |4B8|            |321|            +---+\\end{verbatim}")) (|janko2| (((|PermutationGroup| (|Integer|))) "\\spad{janko2 constructs} the janko group acting on the integers 1,{}...,{}100.") (((|PermutationGroup| (|Integer|)) (|List| (|Integer|))) "\\spad{janko2(li)} constructs the janko group acting on the 100 integers given in the list {\\em li}. Note: duplicates in the list will be removed. Error: if {\\em li} has less or more than 100 different entries")) (|mathieu24| (((|PermutationGroup| (|Integer|))) "\\spad{mathieu24 constructs} the mathieu group acting on the integers 1,{}...,{}24.") (((|PermutationGroup| (|Integer|)) (|List| (|Integer|))) "\\spad{mathieu24(li)} constructs the mathieu group acting on the 24 integers given in the list {\\em li}. Note: duplicates in the list will be removed. Error: if {\\em li} has less or more than 24 different entries.")) (|mathieu23| (((|PermutationGroup| (|Integer|))) "\\spad{mathieu23 constructs} the mathieu group acting on the integers 1,{}...,{}23.") (((|PermutationGroup| (|Integer|)) (|List| (|Integer|))) "\\spad{mathieu23(li)} constructs the mathieu group acting on the 23 integers given in the list {\\em li}. Note: duplicates in the list will be removed. Error: if {\\em li} has less or more than 23 different entries.")) (|mathieu22| (((|PermutationGroup| (|Integer|))) "\\spad{mathieu22 constructs} the mathieu group acting on the integers 1,{}...,{}22.") (((|PermutationGroup| (|Integer|)) (|List| (|Integer|))) "\\spad{mathieu22(li)} constructs the mathieu group acting on the 22 integers given in the list {\\em li}. Note: duplicates in the list will be removed. Error: if {\\em li} has less or more than 22 different entries.")) (|mathieu12| (((|PermutationGroup| (|Integer|))) "\\spad{mathieu12 constructs} the mathieu group acting on the integers 1,{}...,{}12.") (((|PermutationGroup| (|Integer|)) (|List| (|Integer|))) "\\spad{mathieu12(li)} constructs the mathieu group acting on the 12 integers given in the list {\\em li}. Note: duplicates in the list will be removed Error: if {\\em li} has less or more than 12 different entries.")) (|mathieu11| (((|PermutationGroup| (|Integer|))) "\\spad{mathieu11 constructs} the mathieu group acting on the integers 1,{}...,{}11.") (((|PermutationGroup| (|Integer|)) (|List| (|Integer|))) "\\spad{mathieu11(li)} constructs the mathieu group acting on the 11 integers given in the list {\\em li}. Note: duplicates in the list will be removed. error,{} if {\\em li} has less or more than 11 different entries.")) (|dihedralGroup| (((|PermutationGroup| (|Integer|)) (|List| (|Integer|))) "\\spad{dihedralGroup([i1,...,ik])} constructs the dihedral group of order 2k acting on the integers out of {\\em i1},{}...,{}{\\em ik}. Note: duplicates in the list will be removed.") (((|PermutationGroup| (|Integer|)) (|PositiveInteger|)) "\\spad{dihedralGroup(n)} constructs the dihedral group of order 2n acting on integers 1,{}...,{}\\spad{N}.")) (|cyclicGroup| (((|PermutationGroup| (|Integer|)) (|List| (|Integer|))) "\\spad{cyclicGroup([i1,...,ik])} constructs the cyclic group of order \\spad{k} acting on the integers {\\em i1},{}...,{}{\\em ik}. Note: duplicates in the list will be removed.") (((|PermutationGroup| (|Integer|)) (|PositiveInteger|)) "\\spad{cyclicGroup(n)} constructs the cyclic group of order \\spad{n} acting on the integers 1,{}...,{}\\spad{n}.")) (|abelianGroup| (((|PermutationGroup| (|Integer|)) (|List| (|PositiveInteger|))) "\\spad{abelianGroup([n1,...,nk])} constructs the abelian group that is the direct product of cyclic groups with order {\\em ni}.")) (|alternatingGroup| (((|PermutationGroup| (|Integer|)) (|List| (|Integer|))) "\\spad{alternatingGroup(li)} constructs the alternating group acting on the integers in the list {\\em li},{} generators are in general the {\\em n-2}-cycle {\\em (li.3,...,li.n)} and the 3-cycle {\\em (li.1,li.2,li.3)},{} if \\spad{n} is odd and product of the 2-cycle {\\em (li.1,li.2)} with {\\em n-2}-cycle {\\em (li.3,...,li.n)} and the 3-cycle {\\em (li.1,li.2,li.3)},{} if \\spad{n} is even. Note: duplicates in the list will be removed.") (((|PermutationGroup| (|Integer|)) (|PositiveInteger|)) "\\spad{alternatingGroup(n)} constructs the alternating group {\\em An} acting on the integers 1,{}...,{}\\spad{n},{} generators are in general the {\\em n-2}-cycle {\\em (3,...,n)} and the 3-cycle {\\em (1,2,3)} if \\spad{n} is odd and the product of the 2-cycle {\\em (1,2)} with {\\em n-2}-cycle {\\em (3,...,n)} and the 3-cycle {\\em (1,2,3)} if \\spad{n} is even.")) (|symmetricGroup| (((|PermutationGroup| (|Integer|)) (|List| (|Integer|))) "\\spad{symmetricGroup(li)} constructs the symmetric group acting on the integers in the list {\\em li},{} generators are the cycle given by {\\em li} and the 2-cycle {\\em (li.1,li.2)}. Note: duplicates in the list will be removed.") (((|PermutationGroup| (|Integer|)) (|PositiveInteger|)) "\\spad{symmetricGroup(n)} constructs the symmetric group {\\em Sn} acting on the integers 1,{}...,{}\\spad{n},{} generators are the {\\em n}-cycle {\\em (1,...,n)} and the 2-cycle {\\em (1,2)}."))) 
 NIL 
 NIL 
-(-935 -1967) 
+(-935 -1966) 
 ((|constructor| (NIL "Groebner functions for \\spad{P} \\spad{F} \\indented{2}{This package is an interface package to the groebner basis} package which allows you to compute groebner bases for polynomials in either lexicographic ordering or total degree ordering refined by reverse lex. The input is the ordinary polynomial type which is internally converted to a type with the required ordering. The resulting grobner basis is converted back to ordinary polynomials. The ordering among the variables is controlled by an explicit list of variables which is passed as a second argument. The coefficient domain is allowed to be any \\spad{gcd} domain,{} but the groebner basis is computed as if the polynomials were over a field.")) (|totalGroebner| (((|List| (|Polynomial| |#1|)) (|List| (|Polynomial| |#1|)) (|List| (|Symbol|))) "\\spad{totalGroebner(lp,lv)} computes Groebner basis for the list of polynomials \\spad{lp} with the terms ordered first by total degree and then refined by reverse lexicographic ordering. The variables are ordered by their position in the list \\spad{lv}.")) (|lexGroebner| (((|List| (|Polynomial| |#1|)) (|List| (|Polynomial| |#1|)) (|List| (|Symbol|))) "\\spad{lexGroebner(lp,lv)} computes Groebner basis for the list of polynomials \\spad{lp} in lexicographic order. The variables are ordered by their position in the list \\spad{lv}."))) 
 NIL 
 NIL 
@@ -3684,11 +3684,11 @@ NIL
 ((|constructor| (NIL "\\spadtype{PositiveInteger} provides functions for \\indented{2}{positive integers.}")) (|commutative| ((|attribute| "*") "\\spad{commutative(\"*\")} means multiplication is commutative : x*y = \\spad{y*x}")) (|gcd| (($ $ $) "\\spad{gcd(a,b)} computes the greatest common divisor of two positive integers \\spad{a} and \\spad{b}."))) 
 (((-4464 "*") . T)) 
 NIL 
-(-939 -1967 P) 
+(-939 -1966 P) 
 ((|constructor| (NIL "This package exports interpolation algorithms")) (|LagrangeInterpolation| ((|#2| (|List| |#1|) (|List| |#1|)) "\\spad{LagrangeInterpolation(l1,l2)} \\undocumented"))) 
 NIL 
 NIL 
-(-940 |xx| -1967) 
+(-940 |xx| -1966) 
 ((|constructor| (NIL "This package exports interpolation algorithms")) (|interpolate| (((|SparseUnivariatePolynomial| |#2|) (|List| |#2|) (|List| |#2|)) "\\spad{interpolate(lf,lg)} \\undocumented") (((|UnivariatePolynomial| |#1| |#2|) (|UnivariatePolynomial| |#1| |#2|) (|List| |#2|) (|List| |#2|)) "\\spad{interpolate(u,lf,lg)} \\undocumented"))) 
 NIL 
 NIL 
@@ -3712,7 +3712,7 @@ NIL
 ((|constructor| (NIL "This package exports plotting tools")) (|calcRanges| (((|List| (|Segment| (|DoubleFloat|))) (|List| (|List| (|Point| (|DoubleFloat|))))) "\\spad{calcRanges(l)} \\undocumented"))) 
 NIL 
 NIL 
-(-946 R -1967) 
+(-946 R -1966) 
 ((|constructor| (NIL "Attaching assertions to symbols for pattern matching; Date Created: 21 Mar 1989 Date Last Updated: 23 May 1990")) (|multiple| ((|#2| |#2|) "\\spad{multiple(x)} tells the pattern matcher that \\spad{x} should preferably match a multi-term quantity in a sum or product. For matching on lists,{} multiple(\\spad{x}) tells the pattern matcher that \\spad{x} should match a list instead of an element of a list. Error: if \\spad{x} is not a symbol.")) (|optional| ((|#2| |#2|) "\\spad{optional(x)} tells the pattern matcher that \\spad{x} can match an identity (0 in a sum,{} 1 in a product or exponentiation). Error: if \\spad{x} is not a symbol.")) (|constant| ((|#2| |#2|) "\\spad{constant(x)} tells the pattern matcher that \\spad{x} should match only the symbol \\spad{'x} and no other quantity. Error: if \\spad{x} is not a symbol.")) (|assert| ((|#2| |#2| (|Identifier|)) "\\spad{assert(x, s)} makes the assertion \\spad{s} about \\spad{x}. Error: if \\spad{x} is not a symbol."))) 
 NIL 
 NIL 
@@ -3724,7 +3724,7 @@ NIL
 ((|constructor| (NIL "This packages provides tools for matching recursively in type towers.")) (|patternMatch| (((|PatternMatchResult| |#1| |#3|) |#2| (|Pattern| |#1|) (|PatternMatchResult| |#1| |#3|)) "\\spad{patternMatch(expr, pat, res)} matches the pattern \\spad{pat} to the expression \\spad{expr}; res contains the variables of \\spad{pat} which are already matched and their matches. Note: this function handles type towers by changing the predicates and calling the matching function provided by \\spad{A}.")) (|fixPredicate| (((|Mapping| (|Boolean|) |#2|) (|Mapping| (|Boolean|) |#3|)) "\\spad{fixPredicate(f)} returns \\spad{g} defined by \\spad{g}(a) = \\spad{f}(a::B)."))) 
 NIL 
 NIL 
-(-949 S R -1967) 
+(-949 S R -1966) 
 ((|constructor| (NIL "This package provides pattern matching functions on function spaces.")) (|patternMatch| (((|PatternMatchResult| |#1| |#3|) |#3| (|Pattern| |#1|) (|PatternMatchResult| |#1| |#3|)) "\\spad{patternMatch(expr, pat, res)} matches the pattern \\spad{pat} to the expression \\spad{expr}; res contains the variables of \\spad{pat} which are already matched and their matches."))) 
 NIL 
 NIL 
@@ -3744,7 +3744,7 @@ NIL
 ((|constructor| (NIL "This package provides pattern matching functions on polynomials.")) (|patternMatch| (((|PatternMatchResult| |#1| |#5|) |#5| (|Pattern| |#1|) (|PatternMatchResult| |#1| |#5|)) "\\spad{patternMatch(p, pat, res)} matches the pattern \\spad{pat} to the polynomial \\spad{p}; res contains the variables of \\spad{pat} which are already matched and their matches.") (((|PatternMatchResult| |#1| |#5|) |#5| (|Pattern| |#1|) (|PatternMatchResult| |#1| |#5|) (|Mapping| (|PatternMatchResult| |#1| |#5|) |#3| (|Pattern| |#1|) (|PatternMatchResult| |#1| |#5|))) "\\spad{patternMatch(p, pat, res, vmatch)} matches the pattern \\spad{pat} to the polynomial \\spad{p}. \\spad{res} contains the variables of \\spad{pat} which are already matched and their matches; vmatch is the matching function to use on the variables."))) 
 NIL 
 ((|HasCategory| |#3| (LIST (QUOTE -899) (|devaluate| |#1|)))) 
-(-954 R -1967 -1992) 
+(-954 R -1966 -1992) 
 ((|constructor| (NIL "Attaching predicates to symbols for pattern matching. Date Created: 21 Mar 1989 Date Last Updated: 23 May 1990")) (|suchThat| ((|#2| |#2| (|List| (|Mapping| (|Boolean|) |#3|))) "\\spad{suchThat(x, [f1, f2, ..., fn])} attaches the predicate \\spad{f1} and \\spad{f2} and ... and \\spad{fn} to \\spad{x}. Error: if \\spad{x} is not a symbol.") ((|#2| |#2| (|Mapping| (|Boolean|) |#3|)) "\\spad{suchThat(x, foo)} attaches the predicate foo to \\spad{x}; error if \\spad{x} is not a symbol."))) 
 NIL 
 NIL 
@@ -3796,7 +3796,7 @@ NIL
 ((|constructor| (NIL "The category for general multi-variate polynomials over a ring \\spad{R},{} in variables from VarSet,{} with exponents from the \\spadtype{OrderedAbelianMonoidSup}.")) (|canonicalUnitNormal| ((|attribute|) "we can choose a unique representative for each associate class. This normalization is chosen to be normalization of leading coefficient (by default).")) (|squareFreePart| (($ $) "\\spad{squareFreePart(p)} returns product of all the irreducible factors of polynomial \\spad{p} each taken with multiplicity one.")) (|squareFree| (((|Factored| $) $) "\\spad{squareFree(p)} returns the square free factorization of the polynomial \\spad{p}.")) (|primitivePart| (($ $ |#3|) "\\spad{primitivePart(p,v)} returns the unitCanonical associate of the polynomial \\spad{p} with its content with respect to the variable \\spad{v} divided out.") (($ $) "\\spad{primitivePart(p)} returns the unitCanonical associate of the polynomial \\spad{p} with its content divided out.")) (|content| (($ $ |#3|) "\\spad{content(p,v)} is the \\spad{gcd} of the coefficients of the polynomial \\spad{p} when \\spad{p} is viewed as a univariate polynomial with respect to the variable \\spad{v}. Thus,{} for polynomial 7*x**2*y + 14*x*y**2,{} the \\spad{gcd} of the coefficients with respect to \\spad{x} is 7*y.")) (|discriminant| (($ $ |#3|) "\\spad{discriminant(p,v)} returns the disriminant of the polynomial \\spad{p} with respect to the variable \\spad{v}.")) (|resultant| (($ $ $ |#3|) "\\spad{resultant(p,q,v)} returns the resultant of the polynomials \\spad{p} and \\spad{q} with respect to the variable \\spad{v}.")) (|primitiveMonomials| (((|List| $) $) "\\spad{primitiveMonomials(p)} gives the list of monomials of the polynomial \\spad{p} with their coefficients removed. Note: \\spad{primitiveMonomials(sum(a_(i) X^(i))) = [X^(1),...,X^(n)]}.")) (|variables| (((|List| |#3|) $) "\\spad{variables(p)} returns the list of those variables actually appearing in the polynomial \\spad{p}.")) (|totalDegree| (((|NonNegativeInteger|) $ (|List| |#3|)) "\\spad{totalDegree(p, lv)} returns the maximum sum (over all monomials of polynomial \\spad{p}) of the variables in the list \\spad{lv}.") (((|NonNegativeInteger|) $) "\\spad{totalDegree(p)} returns the largest sum over all monomials of all exponents of a monomial.")) (|isExpt| (((|Union| (|Record| (|:| |var| |#3|) (|:| |exponent| (|NonNegativeInteger|))) "failed") $) "\\spad{isExpt(p)} returns \\spad{[x, n]} if polynomial \\spad{p} has the form \\spad{x**n} and \\spad{n > 0}.")) (|isTimes| (((|Union| (|List| $) "failed") $) "\\spad{isTimes(p)} returns \\spad{[a1,...,an]} if polynomial \\spad{p = a1 ... an} and \\spad{n >= 2},{} and,{} for each \\spad{i},{} \\spad{ai} is either a nontrivial constant in \\spad{R} or else of the form \\spad{x**e},{} where \\spad{e > 0} is an integer and \\spad{x} in a member of VarSet.")) (|isPlus| (((|Union| (|List| $) "failed") $) "\\spad{isPlus(p)} returns \\spad{[m1,...,mn]} if polynomial \\spad{p = m1 + ... + mn} and \\spad{n >= 2} and each \\spad{mi} is a nonzero monomial.")) (|multivariate| (($ (|SparseUnivariatePolynomial| $) |#3|) "\\spad{multivariate(sup,v)} converts an anonymous univariable polynomial \\spad{sup} to a polynomial in the variable \\spad{v}.") (($ (|SparseUnivariatePolynomial| |#1|) |#3|) "\\spad{multivariate(sup,v)} converts an anonymous univariable polynomial \\spad{sup} to a polynomial in the variable \\spad{v}.")) (|monomial| (($ $ (|List| |#3|) (|List| (|NonNegativeInteger|))) "\\spad{monomial(a,[v1..vn],[e1..en])} returns \\spad{a*prod(vi**ei)}.") (($ $ |#3| (|NonNegativeInteger|)) "\\spad{monomial(a,x,n)} creates the monomial \\spad{a*x**n} where \\spad{a} is a polynomial,{} \\spad{x} is a variable and \\spad{n} is a nonnegative integer.")) (|monicDivide| (((|Record| (|:| |quotient| $) (|:| |remainder| $)) $ $ |#3|) "\\spad{monicDivide(a,b,v)} divides the polynomial a by the polynomial \\spad{b},{} with each viewed as a univariate polynomial in \\spad{v} returning both the quotient and remainder. Error: if \\spad{b} is not monic with respect to \\spad{v}.")) (|minimumDegree| (((|List| (|NonNegativeInteger|)) $ (|List| |#3|)) "\\spad{minimumDegree(p, lv)} gives the list of minimum degrees of the polynomial \\spad{p} with respect to each of the variables in the list \\spad{lv}") (((|NonNegativeInteger|) $ |#3|) "\\spad{minimumDegree(p,v)} gives the minimum degree of polynomial \\spad{p} with respect to \\spad{v},{} \\spadignore{i.e.} viewed a univariate polynomial in \\spad{v}")) (|mainVariable| (((|Union| |#3| "failed") $) "\\spad{mainVariable(p)} returns the biggest variable which actually occurs in the polynomial \\spad{p},{} or \"failed\" if no variables are present. fails precisely if polynomial satisfies ground?")) (|univariate| (((|SparseUnivariatePolynomial| |#1|) $) "\\spad{univariate(p)} converts the multivariate polynomial \\spad{p},{} which should actually involve only one variable,{} into a univariate polynomial in that variable,{} whose coefficients are in the ground ring. Error: if polynomial is genuinely multivariate") (((|SparseUnivariatePolynomial| $) $ |#3|) "\\spad{univariate(p,v)} converts the multivariate polynomial \\spad{p} into a univariate polynomial in \\spad{v},{} whose coefficients are still multivariate polynomials (in all the other variables).")) (|monomials| (((|List| $) $) "\\spad{monomials(p)} returns the list of non-zero monomials of polynomial \\spad{p},{} \\spadignore{i.e.} \\spad{monomials(sum(a_(i) X^(i))) = [a_(1) X^(1),...,a_(n) X^(n)]}.")) (|coefficient| (($ $ (|List| |#3|) (|List| (|NonNegativeInteger|))) "\\spad{coefficient(p, lv, ln)} views the polynomial \\spad{p} as a polynomial in the variables of \\spad{lv} and returns the coefficient of the term \\spad{lv**ln},{} \\spadignore{i.e.} \\spad{prod(lv_i ** ln_i)}.") (($ $ |#3| (|NonNegativeInteger|)) "\\spad{coefficient(p,v,n)} views the polynomial \\spad{p} as a univariate polynomial in \\spad{v} and returns the coefficient of the \\spad{v**n} term.")) (|degree| (((|List| (|NonNegativeInteger|)) $ (|List| |#3|)) "\\spad{degree(p,lv)} gives the list of degrees of polynomial \\spad{p} with respect to each of the variables in the list \\spad{lv}.") (((|NonNegativeInteger|) $ |#3|) "\\spad{degree(p,v)} gives the degree of polynomial \\spad{p} with respect to the variable \\spad{v}."))) 
 (((-4464 "*") |has| |#1| (-174)) (-4455 |has| |#1| (-568)) (-4460 |has| |#1| (-6 -4460)) (-4457 . T) (-4456 . T) (-4459 . T)) 
 NIL 
-(-967 E V R P -1967) 
+(-967 E V R P -1966) 
 ((|constructor| (NIL "This package transforms multivariate polynomials or fractions into univariate polynomials or fractions,{} and back.")) (|isPower| (((|Union| (|Record| (|:| |val| |#5|) (|:| |exponent| (|Integer|))) "failed") |#5|) "\\spad{isPower(p)} returns \\spad{[x, n]} if \\spad{p = x**n} and \\spad{n <> 0},{} \"failed\" otherwise.")) (|isExpt| (((|Union| (|Record| (|:| |var| |#2|) (|:| |exponent| (|Integer|))) "failed") |#5|) "\\spad{isExpt(p)} returns \\spad{[x, n]} if \\spad{p = x**n} and \\spad{n <> 0},{} \"failed\" otherwise.")) (|isTimes| (((|Union| (|List| |#5|) "failed") |#5|) "\\spad{isTimes(p)} returns \\spad{[a1,...,an]} if \\spad{p = a1 ... an} and \\spad{n > 1},{} \"failed\" otherwise.")) (|isPlus| (((|Union| (|List| |#5|) "failed") |#5|) "\\spad{isPlus(p)} returns [\\spad{m1},{}...,{}\\spad{mn}] if \\spad{p = m1 + ... + mn} and \\spad{n > 1},{} \"failed\" otherwise.")) (|multivariate| ((|#5| (|Fraction| (|SparseUnivariatePolynomial| |#5|)) |#2|) "\\spad{multivariate(f, v)} applies both the numerator and denominator of \\spad{f} to \\spad{v}.")) (|univariate| (((|SparseUnivariatePolynomial| |#5|) |#5| |#2| (|SparseUnivariatePolynomial| |#5|)) "\\spad{univariate(f, x, p)} returns \\spad{f} viewed as a univariate polynomial in \\spad{x},{} using the side-condition \\spad{p(x) = 0}.") (((|Fraction| (|SparseUnivariatePolynomial| |#5|)) |#5| |#2|) "\\spad{univariate(f, v)} returns \\spad{f} viewed as a univariate rational function in \\spad{v}.")) (|mainVariable| (((|Union| |#2| "failed") |#5|) "\\spad{mainVariable(f)} returns the highest variable appearing in the numerator or the denominator of \\spad{f},{} \"failed\" if \\spad{f} has no variables.")) (|variables| (((|List| |#2|) |#5|) "\\spad{variables(f)} returns the list of variables appearing in the numerator or the denominator of \\spad{f}."))) 
 NIL 
 NIL 
@@ -3808,7 +3808,7 @@ NIL
 ((|constructor| (NIL "\\indented{2}{This type is the basic representation of sparse recursive multivariate} polynomials whose variables are arbitrary symbols. The ordering is alphabetic determined by the Symbol type. The coefficient ring may be non commutative,{} but the variables are assumed to commute.")) (|integrate| (($ $ (|Symbol|)) "\\spad{integrate(p,x)} computes the integral of \\spad{p*dx},{} \\spadignore{i.e.} integrates the polynomial \\spad{p} with respect to the variable \\spad{x}."))) 
 (((-4464 "*") |has| |#1| (-174)) (-4455 |has| |#1| (-568)) (-4460 |has| |#1| (-6 -4460)) (-4457 . T) (-4456 . T) (-4459 . T)) 
 ((|HasCategory| |#1| (QUOTE (-926))) (-2781 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-926)))) (-2781 (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-926)))) (-2781 (|HasCategory| |#1| (QUOTE (-464))) (|HasCategory| |#1| (QUOTE (-926)))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-174))) (-2781 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-568)))) (-12 (|HasCategory| (-1195) (LIST (QUOTE -899) (QUOTE (-390)))) (|HasCategory| |#1| (LIST (QUOTE -899) (QUOTE (-390))))) (-12 (|HasCategory| (-1195) (LIST (QUOTE -899) (QUOTE (-576)))) (|HasCategory| |#1| (LIST (QUOTE -899) (QUOTE (-576))))) (-12 (|HasCategory| (-1195) (LIST (QUOTE -626) (LIST (QUOTE -905) (QUOTE (-390))))) (|HasCategory| |#1| (LIST (QUOTE -626) (LIST (QUOTE -905) (QUOTE (-390)))))) (-12 (|HasCategory| (-1195) (LIST (QUOTE -626) (LIST (QUOTE -905) (QUOTE (-576))))) (|HasCategory| |#1| (LIST (QUOTE -626) (LIST (QUOTE -905) (QUOTE (-576)))))) (-12 (|HasCategory| (-1195) (LIST (QUOTE -626) (QUOTE (-548)))) (|HasCategory| |#1| (LIST (QUOTE -626) (QUOTE (-548))))) (|HasCategory| |#1| (LIST (QUOTE -651) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| |#1| (LIST (QUOTE -1057) (QUOTE (-576)))) (-2781 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| |#1| (LIST (QUOTE -1057) (LIST (QUOTE -419) (QUOTE (-576)))))) (|HasCategory| |#1| (LIST (QUOTE -1057) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| |#1| (QUOTE (-374))) (|HasAttribute| |#1| (QUOTE -4460)) (|HasCategory| |#1| (QUOTE (-464))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-926)))) (-2781 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-926)))) (|HasCategory| |#1| (QUOTE (-146))))) 
-(-970 E V R P -1967) 
+(-970 E V R P -1966) 
 ((|constructor| (NIL "computes \\spad{n}-th roots of quotients of multivariate polynomials")) (|nthr| (((|Record| (|:| |exponent| (|NonNegativeInteger|)) (|:| |coef| |#4|) (|:| |radicand| (|List| |#4|))) |#4| (|NonNegativeInteger|)) "\\spad{nthr(p,n)} should be local but conditional")) (|froot| (((|Record| (|:| |exponent| (|NonNegativeInteger|)) (|:| |coef| |#5|) (|:| |radicand| |#5|)) |#5| (|NonNegativeInteger|)) "\\spad{froot(f, n)} returns \\spad{[m,c,r]} such that \\spad{f**(1/n) = c * r**(1/m)}.")) (|qroot| (((|Record| (|:| |exponent| (|NonNegativeInteger|)) (|:| |coef| |#5|) (|:| |radicand| |#5|)) (|Fraction| (|Integer|)) (|NonNegativeInteger|)) "\\spad{qroot(f, n)} returns \\spad{[m,c,r]} such that \\spad{f**(1/n) = c * r**(1/m)}.")) (|rroot| (((|Record| (|:| |exponent| (|NonNegativeInteger|)) (|:| |coef| |#5|) (|:| |radicand| |#5|)) |#3| (|NonNegativeInteger|)) "\\spad{rroot(f, n)} returns \\spad{[m,c,r]} such that \\spad{f**(1/n) = c * r**(1/m)}.")) (|denom| ((|#4| $) "\\spad{denom(x)} \\undocumented")) (|numer| ((|#4| $) "\\spad{numer(x)} \\undocumented"))) 
 NIL 
 ((|HasCategory| |#3| (QUOTE (-464)))) 
@@ -3836,7 +3836,7 @@ NIL
 ((|constructor| (NIL "Category for the functions defined by integrals.")) (|integral| (($ $ (|SegmentBinding| $)) "\\spad{integral(f, x = a..b)} returns the formal definite integral of \\spad{f} \\spad{dx} for \\spad{x} between \\spad{a} and \\spad{b}.") (($ $ (|Symbol|)) "\\spad{integral(f, x)} returns the formal integral of \\spad{f} \\spad{dx}."))) 
 NIL 
 NIL 
-(-977 -1967) 
+(-977 -1966) 
 ((|constructor| (NIL "PrimitiveElement provides functions to compute primitive elements in algebraic extensions.")) (|primitiveElement| (((|Record| (|:| |coef| (|List| (|Integer|))) (|:| |poly| (|List| (|SparseUnivariatePolynomial| |#1|))) (|:| |prim| (|SparseUnivariatePolynomial| |#1|))) (|List| (|Polynomial| |#1|)) (|List| (|Symbol|)) (|Symbol|)) "\\spad{primitiveElement([p1,...,pn], [a1,...,an], a)} returns \\spad{[[c1,...,cn], [q1,...,qn], q]} such that then \\spad{k(a1,...,an) = k(a)},{} where \\spad{a = a1 c1 + ... + an cn},{} \\spad{ai = qi(a)},{} and \\spad{q(a) = 0}. The \\spad{pi}\\spad{'s} are the defining polynomials for the \\spad{ai}\\spad{'s}. This operation uses the technique of \\spadglossSee{groebner bases}{Groebner basis}.") (((|Record| (|:| |coef| (|List| (|Integer|))) (|:| |poly| (|List| (|SparseUnivariatePolynomial| |#1|))) (|:| |prim| (|SparseUnivariatePolynomial| |#1|))) (|List| (|Polynomial| |#1|)) (|List| (|Symbol|))) "\\spad{primitiveElement([p1,...,pn], [a1,...,an])} returns \\spad{[[c1,...,cn], [q1,...,qn], q]} such that then \\spad{k(a1,...,an) = k(a)},{} where \\spad{a = a1 c1 + ... + an cn},{} \\spad{ai = qi(a)},{} and \\spad{q(a) = 0}. The \\spad{pi}\\spad{'s} are the defining polynomials for the \\spad{ai}\\spad{'s}. This operation uses the technique of \\spadglossSee{groebner bases}{Groebner basis}.") (((|Record| (|:| |coef1| (|Integer|)) (|:| |coef2| (|Integer|)) (|:| |prim| (|SparseUnivariatePolynomial| |#1|))) (|Polynomial| |#1|) (|Symbol|) (|Polynomial| |#1|) (|Symbol|)) "\\spad{primitiveElement(p1, a1, p2, a2)} returns \\spad{[c1, c2, q]} such that \\spad{k(a1, a2) = k(a)} where \\spad{a = c1 a1 + c2 a2, and q(a) = 0}. The \\spad{pi}\\spad{'s} are the defining polynomials for the \\spad{ai}\\spad{'s}. The \\spad{p2} may involve \\spad{a1},{} but \\spad{p1} must not involve a2. This operation uses \\spadfun{resultant}."))) 
 NIL 
 NIL 
@@ -3944,7 +3944,7 @@ NIL
 ((|constructor| (NIL "This package \\undocumented{}")) (|map| ((|#4| (|Mapping| |#4| (|Polynomial| |#1|)) |#4|) "\\spad{map(f,p)} \\undocumented{}")) (|pushup| ((|#4| |#4| (|List| |#3|)) "\\spad{pushup(p,lv)} \\undocumented{}") ((|#4| |#4| |#3|) "\\spad{pushup(p,v)} \\undocumented{}")) (|pushdown| ((|#4| |#4| (|List| |#3|)) "\\spad{pushdown(p,lv)} \\undocumented{}") ((|#4| |#4| |#3|) "\\spad{pushdown(p,v)} \\undocumented{}")) (|variable| (((|Union| $ "failed") (|Symbol|)) "\\spad{variable(s)} makes an element from symbol \\spad{s} or fails")) (|convert| (((|Symbol|) $) "\\spad{convert(x)} converts \\spad{x} to a symbol"))) 
 NIL 
 NIL 
-(-1004 K R UP -1967) 
+(-1004 K R UP -1966) 
 ((|constructor| (NIL "In this package \\spad{K} is a finite field,{} \\spad{R} is a ring of univariate polynomials over \\spad{K},{} and \\spad{F} is a monogenic algebra over \\spad{R}. We require that \\spad{F} is monogenic,{} \\spadignore{i.e.} that \\spad{F = K[x,y]/(f(x,y))},{} because the integral basis algorithm used will factor the polynomial \\spad{f(x,y)}. The package provides a function to compute the integral closure of \\spad{R} in the quotient field of \\spad{F} as well as a function to compute a \"local integral basis\" at a specific prime.")) (|reducedDiscriminant| ((|#2| |#3|) "\\spad{reducedDiscriminant(up)} \\undocumented")) (|localIntegralBasis| (((|Record| (|:| |basis| (|Matrix| |#2|)) (|:| |basisDen| |#2|) (|:| |basisInv| (|Matrix| |#2|))) |#2|) "\\spad{integralBasis(p)} returns a record \\spad{[basis,basisDen,basisInv] } containing information regarding the local integral closure of \\spad{R} at the prime \\spad{p} in the quotient field of the framed algebra \\spad{F}. \\spad{F} is a framed algebra with \\spad{R}-module basis \\spad{w1,w2,...,wn}. If 'basis' is the matrix \\spad{(aij, i = 1..n, j = 1..n)},{} then the \\spad{i}th element of the local integral basis is \\spad{vi = (1/basisDen) * sum(aij * wj, j = 1..n)},{} \\spadignore{i.e.} the \\spad{i}th row of 'basis' contains the coordinates of the \\spad{i}th basis vector. Similarly,{} the \\spad{i}th row of the matrix 'basisInv' contains the coordinates of \\spad{wi} with respect to the basis \\spad{v1,...,vn}: if 'basisInv' is the matrix \\spad{(bij, i = 1..n, j = 1..n)},{} then \\spad{wi = sum(bij * vj, j = 1..n)}.")) (|integralBasis| (((|Record| (|:| |basis| (|Matrix| |#2|)) (|:| |basisDen| |#2|) (|:| |basisInv| (|Matrix| |#2|)))) "\\spad{integralBasis()} returns a record \\spad{[basis,basisDen,basisInv] } containing information regarding the integral closure of \\spad{R} in the quotient field of the framed algebra \\spad{F}. \\spad{F} is a framed algebra with \\spad{R}-module basis \\spad{w1,w2,...,wn}. If 'basis' is the matrix \\spad{(aij, i = 1..n, j = 1..n)},{} then the \\spad{i}th element of the integral basis is \\spad{vi = (1/basisDen) * sum(aij * wj, j = 1..n)},{} \\spadignore{i.e.} the \\spad{i}th row of 'basis' contains the coordinates of the \\spad{i}th basis vector. Similarly,{} the \\spad{i}th row of the matrix 'basisInv' contains the coordinates of \\spad{wi} with respect to the basis \\spad{v1,...,vn}: if 'basisInv' is the matrix \\spad{(bij, i = 1..n, j = 1..n)},{} then \\spad{wi = sum(bij * vj, j = 1..n)}."))) 
 NIL 
 NIL 
@@ -4016,7 +4016,7 @@ NIL
 ((|constructor| (NIL "The \\spad{RadicalCategory} is a model for the rational numbers.")) (** (($ $ (|Fraction| (|Integer|))) "\\spad{x ** y} is the rational exponentiation of \\spad{x} by the power \\spad{y}.")) (|nthRoot| (($ $ (|Integer|)) "\\spad{nthRoot(x,n)} returns the \\spad{n}th root of \\spad{x}.")) (|sqrt| (($ $) "\\spad{sqrt(x)} returns the square root of \\spad{x}."))) 
 NIL 
 NIL 
-(-1022 -1967 UP UPUP |radicnd| |n|) 
+(-1022 -1966 UP UPUP |radicnd| |n|) 
 ((|constructor| (NIL "Function field defined by y**n = \\spad{f}(\\spad{x})."))) 
 ((-4455 |has| (-419 |#2|) (-374)) (-4460 |has| (-419 |#2|) (-374)) (-4454 |has| (-419 |#2|) (-374)) ((-4464 "*") . T) (-4456 . T) (-4457 . T) (-4459 . T)) 
 ((|HasCategory| (-419 |#2|) (QUOTE (-146))) (|HasCategory| (-419 |#2|) (QUOTE (-148))) (|HasCategory| (-419 |#2|) (QUOTE (-360))) (-2781 (|HasCategory| (-419 |#2|) (QUOTE (-374))) (|HasCategory| (-419 |#2|) (QUOTE (-360)))) (|HasCategory| (-419 |#2|) (QUOTE (-374))) (|HasCategory| (-419 |#2|) (QUOTE (-379))) (-2781 (-12 (|HasCategory| (-419 |#2|) (QUOTE (-238))) (|HasCategory| (-419 |#2|) (QUOTE (-374)))) (|HasCategory| (-419 |#2|) (QUOTE (-360)))) (-2781 (-12 (|HasCategory| (-419 |#2|) (QUOTE (-238))) (|HasCategory| (-419 |#2|) (QUOTE (-374)))) (-12 (|HasCategory| (-419 |#2|) (QUOTE (-237))) (|HasCategory| (-419 |#2|) (QUOTE (-374)))) (|HasCategory| (-419 |#2|) (QUOTE (-360)))) (-2781 (-12 (|HasCategory| (-419 |#2|) (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasCategory| (-419 |#2|) (QUOTE (-374)))) (-12 (|HasCategory| (-419 |#2|) (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasCategory| (-419 |#2|) (QUOTE (-360))))) (-2781 (-12 (|HasCategory| (-419 |#2|) (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasCategory| (-419 |#2|) (QUOTE (-374)))) (-12 (|HasCategory| (-419 |#2|) (LIST (QUOTE -917) (QUOTE (-1195)))) (|HasCategory| (-419 |#2|) (QUOTE (-374))))) (|HasCategory| (-419 |#2|) (LIST (QUOTE -651) (QUOTE (-576)))) (-2781 (|HasCategory| (-419 |#2|) (LIST (QUOTE -1057) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| (-419 |#2|) (QUOTE (-374)))) (|HasCategory| (-419 |#2|) (LIST (QUOTE -1057) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| (-419 |#2|) (LIST (QUOTE -1057) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#1| (QUOTE (-379))) (-12 (|HasCategory| (-419 |#2|) (QUOTE (-237))) (|HasCategory| (-419 |#2|) (QUOTE (-374)))) (-12 (|HasCategory| (-419 |#2|) (LIST (QUOTE -917) (QUOTE (-1195)))) (|HasCategory| (-419 |#2|) (QUOTE (-374)))) (-12 (|HasCategory| (-419 |#2|) (QUOTE (-238))) (|HasCategory| (-419 |#2|) (QUOTE (-374)))) (-12 (|HasCategory| (-419 |#2|) (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasCategory| (-419 |#2|) (QUOTE (-374))))) 
@@ -4056,19 +4056,19 @@ NIL
 ((|constructor| (NIL "\\axiomType{RealClosedField} provides common acces functions for all real closed fields.")) (|approximate| (((|Fraction| (|Integer|)) $ $) "\\axiom{approximate(\\spad{n},{}\\spad{p})} gives an approximation of \\axiom{\\spad{n}} that has precision \\axiom{\\spad{p}}")) (|rename| (($ $ (|OutputForm|)) "\\axiom{rename(\\spad{x},{}name)} gives a new number that prints as name")) (|rename!| (($ $ (|OutputForm|)) "\\axiom{rename!(\\spad{x},{}name)} changes the way \\axiom{\\spad{x}} is printed")) (|sqrt| (($ (|Integer|)) "\\axiom{sqrt(\\spad{x})} is \\axiom{\\spad{x} \\spad{**} (1/2)}") (($ (|Fraction| (|Integer|))) "\\axiom{sqrt(\\spad{x})} is \\axiom{\\spad{x} \\spad{**} (1/2)}") (($ $) "\\axiom{sqrt(\\spad{x})} is \\axiom{\\spad{x} \\spad{**} (1/2)}") (($ $ (|PositiveInteger|)) "\\axiom{sqrt(\\spad{x},{}\\spad{n})} is \\axiom{\\spad{x} \\spad{**} (1/n)}")) (|allRootsOf| (((|List| $) (|Polynomial| (|Integer|))) "\\axiom{allRootsOf(pol)} creates all the roots of \\axiom{pol} naming each uniquely") (((|List| $) (|Polynomial| (|Fraction| (|Integer|)))) "\\axiom{allRootsOf(pol)} creates all the roots of \\axiom{pol} naming each uniquely") (((|List| $) (|Polynomial| $)) "\\axiom{allRootsOf(pol)} creates all the roots of \\axiom{pol} naming each uniquely") (((|List| $) (|SparseUnivariatePolynomial| (|Integer|))) "\\axiom{allRootsOf(pol)} creates all the roots of \\axiom{pol} naming each uniquely") (((|List| $) (|SparseUnivariatePolynomial| (|Fraction| (|Integer|)))) "\\axiom{allRootsOf(pol)} creates all the roots of \\axiom{pol} naming each uniquely") (((|List| $) (|SparseUnivariatePolynomial| $)) "\\axiom{allRootsOf(pol)} creates all the roots of \\axiom{pol} naming each uniquely")) (|rootOf| (((|Union| $ "failed") (|SparseUnivariatePolynomial| $) (|PositiveInteger|)) "\\axiom{rootOf(pol,{}\\spad{n})} creates the \\spad{n}th root for the order of \\axiom{pol} and gives it unique name") (((|Union| $ "failed") (|SparseUnivariatePolynomial| $) (|PositiveInteger|) (|OutputForm|)) "\\axiom{rootOf(pol,{}\\spad{n},{}name)} creates the \\spad{n}th root for the order of \\axiom{pol} and names it \\axiom{name}")) (|mainValue| (((|Union| (|SparseUnivariatePolynomial| $) "failed") $) "\\axiom{mainValue(\\spad{x})} is the expression of \\axiom{\\spad{x}} in terms of \\axiom{SparseUnivariatePolynomial(\\$)}")) (|mainDefiningPolynomial| (((|Union| (|SparseUnivariatePolynomial| $) "failed") $) "\\axiom{mainDefiningPolynomial(\\spad{x})} is the defining polynomial for the main algebraic quantity of \\axiom{\\spad{x}}")) (|mainForm| (((|Union| (|OutputForm|) "failed") $) "\\axiom{mainForm(\\spad{x})} is the main algebraic quantity name of \\axiom{\\spad{x}}"))) 
 ((-4455 . T) (-4460 . T) (-4454 . T) (-4457 . T) (-4456 . T) ((-4464 "*") . T) (-4459 . T)) 
 NIL 
-(-1032 R -1967) 
+(-1032 R -1966) 
 ((|constructor| (NIL "\\indented{1}{Risch differential equation,{} elementary case.} Author: Manuel Bronstein Date Created: 1 February 1988 Date Last Updated: 2 November 1995 Keywords: elementary,{} function,{} integration.")) (|rischDE| (((|Record| (|:| |ans| |#2|) (|:| |right| |#2|) (|:| |sol?| (|Boolean|))) (|Integer|) |#2| |#2| (|Symbol|) (|Mapping| (|Union| (|Record| (|:| |mainpart| |#2|) (|:| |limitedlogs| (|List| (|Record| (|:| |coeff| |#2|) (|:| |logand| |#2|))))) "failed") |#2| (|List| |#2|)) (|Mapping| (|Union| (|Record| (|:| |ratpart| |#2|) (|:| |coeff| |#2|)) "failed") |#2| |#2|)) "\\spad{rischDE(n, f, g, x, lim, ext)} returns \\spad{[y, h, b]} such that \\spad{dy/dx + n df/dx y = h} and \\spad{b := h = g}. The equation \\spad{dy/dx + n df/dx y = g} has no solution if \\spad{h \\~~= g} (\\spad{y} is a partial solution in that case). Notes: \\spad{lim} is a limited integration function,{} and ext is an extended integration function."))) 
 NIL 
 NIL 
-(-1033 R -1967) 
+(-1033 R -1966) 
 ((|constructor| (NIL "\\indented{1}{Risch differential equation,{} elementary case.} Author: Manuel Bronstein Date Created: 12 August 1992 Date Last Updated: 17 August 1992 Keywords: elementary,{} function,{} integration.")) (|rischDEsys| (((|Union| (|List| |#2|) "failed") (|Integer|) |#2| |#2| |#2| (|Symbol|) (|Mapping| (|Union| (|Record| (|:| |mainpart| |#2|) (|:| |limitedlogs| (|List| (|Record| (|:| |coeff| |#2|) (|:| |logand| |#2|))))) "failed") |#2| (|List| |#2|)) (|Mapping| (|Union| (|Record| (|:| |ratpart| |#2|) (|:| |coeff| |#2|)) "failed") |#2| |#2|)) "\\spad{rischDEsys(n, f, g_1, g_2, x,lim,ext)} returns \\spad{y_1.y_2} such that \\spad{(dy1/dx,dy2/dx) + ((0, - n df/dx),(n df/dx,0)) (y1,y2) = (g1,g2)} if \\spad{y_1,y_2} exist,{} \"failed\" otherwise. \\spad{lim} is a limited integration function,{} \\spad{ext} is an extended integration function."))) 
 NIL 
 NIL 
-(-1034 -1967 UP) 
+(-1034 -1966 UP) 
 ((|constructor| (NIL "\\indented{1}{Risch differential equation,{} transcendental case.} Author: Manuel Bronstein Date Created: Jan 1988 Date Last Updated: 2 November 1995")) (|polyRDE| (((|Union| (|:| |ans| (|Record| (|:| |ans| |#2|) (|:| |nosol| (|Boolean|)))) (|:| |eq| (|Record| (|:| |b| |#2|) (|:| |c| |#2|) (|:| |m| (|Integer|)) (|:| |alpha| |#2|) (|:| |beta| |#2|)))) |#2| |#2| |#2| (|Integer|) (|Mapping| |#2| |#2|)) "\\spad{polyRDE(a, B, C, n, D)} returns either: 1. \\spad{[Q, b]} such that \\spad{degree(Q) <= n} and \\indented{3}{\\spad{a Q'+ B Q = C} if \\spad{b = true},{} \\spad{Q} is a partial solution} \\indented{3}{otherwise.} 2. \\spad{[B1, C1, m, \\alpha, \\beta]} such that any polynomial solution \\indented{3}{of degree at most \\spad{n} of \\spad{A Q' + BQ = C} must be of the form} \\indented{3}{\\spad{Q = \\alpha H + \\beta} where \\spad{degree(H) <= m} and} \\indented{3}{\\spad{H} satisfies \\spad{H' + B1 H = C1}.} \\spad{D} is the derivation to use.")) (|baseRDE| (((|Record| (|:| |ans| (|Fraction| |#2|)) (|:| |nosol| (|Boolean|))) (|Fraction| |#2|) (|Fraction| |#2|)) "\\spad{baseRDE(f, g)} returns a \\spad{[y, b]} such that \\spad{y' + fy = g} if \\spad{b = true},{} \\spad{y} is a partial solution otherwise (no solution in that case). \\spad{D} is the derivation to use.")) (|monomRDE| (((|Union| (|Record| (|:| |a| |#2|) (|:| |b| (|Fraction| |#2|)) (|:| |c| (|Fraction| |#2|)) (|:| |t| |#2|)) "failed") (|Fraction| |#2|) (|Fraction| |#2|) (|Mapping| |#2| |#2|)) "\\spad{monomRDE(f,g,D)} returns \\spad{[A, B, C, T]} such that \\spad{y' + f y = g} has a solution if and only if \\spad{y = Q / T},{} where \\spad{Q} satisfies \\spad{A Q' + B Q = C} and has no normal pole. A and \\spad{T} are polynomials and \\spad{B} and \\spad{C} have no normal poles. \\spad{D} is the derivation to use."))) 
 NIL 
 NIL 
-(-1035 -1967 UP) 
+(-1035 -1966 UP) 
 ((|constructor| (NIL "\\indented{1}{Risch differential equation system,{} transcendental case.} Author: Manuel Bronstein Date Created: 17 August 1992 Date Last Updated: 3 February 1994")) (|baseRDEsys| (((|Union| (|List| (|Fraction| |#2|)) "failed") (|Fraction| |#2|) (|Fraction| |#2|) (|Fraction| |#2|)) "\\spad{baseRDEsys(f, g1, g2)} returns fractions \\spad{y_1.y_2} such that \\spad{(y1', y2') + ((0, -f), (f, 0)) (y1,y2) = (g1,g2)} if \\spad{y_1,y_2} exist,{} \"failed\" otherwise.")) (|monomRDEsys| (((|Union| (|Record| (|:| |a| |#2|) (|:| |b| (|Fraction| |#2|)) (|:| |h| |#2|) (|:| |c1| (|Fraction| |#2|)) (|:| |c2| (|Fraction| |#2|)) (|:| |t| |#2|)) "failed") (|Fraction| |#2|) (|Fraction| |#2|) (|Fraction| |#2|) (|Mapping| |#2| |#2|)) "\\spad{monomRDEsys(f,g1,g2,D)} returns \\spad{[A, B, H, C1, C2, T]} such that \\spad{(y1', y2') + ((0, -f), (f, 0)) (y1,y2) = (g1,g2)} has a solution if and only if \\spad{y1 = Q1 / T, y2 = Q2 / T},{} where \\spad{B,C1,C2,Q1,Q2} have no normal poles and satisfy A \\spad{(Q1', Q2') + ((H, -B), (B, H)) (Q1,Q2) = (C1,C2)} \\spad{D} is the derivation to use."))) 
 NIL 
 NIL 
@@ -4104,7 +4104,7 @@ NIL
 ((|constructor| (NIL "This domain implements the real closure of an ordered field.")) (|relativeApprox| (((|Fraction| (|Integer|)) $ $) "\\axiom{relativeApprox(\\spad{n},{}\\spad{p})} gives a relative approximation of \\axiom{\\spad{n}} that has precision \\axiom{\\spad{p}}")) (|mainCharacterization| (((|Union| (|RightOpenIntervalRootCharacterization| $ (|SparseUnivariatePolynomial| $)) "failed") $) "\\axiom{mainCharacterization(\\spad{x})} is the main algebraic quantity of \\axiom{\\spad{x}} (\\axiom{SEG})")) (|algebraicOf| (($ (|RightOpenIntervalRootCharacterization| $ (|SparseUnivariatePolynomial| $)) (|OutputForm|)) "\\axiom{algebraicOf(char)} is the external number"))) 
 ((-4455 . T) (-4460 . T) (-4454 . T) (-4457 . T) (-4456 . T) ((-4464 "*") . T) (-4459 . T)) 
 ((-2781 (|HasCategory| (-419 (-576)) (LIST (QUOTE -1057) (QUOTE (-576)))) (|HasCategory| |#1| (LIST (QUOTE -1057) (QUOTE (-576))))) (|HasCategory| |#1| (LIST (QUOTE -1057) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| |#1| (LIST (QUOTE -1057) (QUOTE (-576)))) (|HasCategory| (-419 (-576)) (LIST (QUOTE -1057) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| (-419 (-576)) (LIST (QUOTE -1057) (QUOTE (-576))))) 
-(-1044 -1967 L) 
+(-1044 -1966 L) 
 ((|constructor| (NIL "\\spadtype{ReductionOfOrder} provides functions for reducing the order of linear ordinary differential equations once some solutions are known.")) (|ReduceOrder| (((|Record| (|:| |eq| |#2|) (|:| |op| (|List| |#1|))) |#2| (|List| |#1|)) "\\spad{ReduceOrder(op, [f1,...,fk])} returns \\spad{[op1,[g1,...,gk]]} such that for any solution \\spad{z} of \\spad{op1 z = 0},{} \\spad{y = gk \\int(g_{k-1} \\int(... \\int(g1 \\int z)...)} is a solution of \\spad{op y = 0}. Each \\spad{fi} must satisfy \\spad{op fi = 0}.") ((|#2| |#2| |#1|) "\\spad{ReduceOrder(op, s)} returns \\spad{op1} such that for any solution \\spad{z} of \\spad{op1 z = 0},{} \\spad{y = s \\int z} is a solution of \\spad{op y = 0}. \\spad{s} must satisfy \\spad{op s = 0}."))) 
 NIL 
 NIL 
@@ -4140,7 +4140,7 @@ NIL
 ((|constructor| (NIL "This package provides coercions for the special types \\spadtype{Exit} and \\spadtype{Void}.")) (|coerce| ((|#1| (|Exit|)) "\\spad{coerce(e)} is never really evaluated. This coercion is used for formal type correctness when a function will not return directly to its caller.") (((|Void|) |#1|) "\\spad{coerce(s)} throws all information about \\spad{s} away. This coercion allows values of any type to appear in contexts where they will not be used. For example,{} it allows the resolution of different types in the \\spad{then} and \\spad{else} branches when an \\spad{if} is in a context where the resulting value is not used."))) 
 NIL 
 NIL 
-(-1053 -1967 |Expon| |VarSet| |FPol| |LFPol|) 
+(-1053 -1966 |Expon| |VarSet| |FPol| |LFPol|) 
 ((|constructor| (NIL "ResidueRing is the quotient of a polynomial ring by an ideal. The ideal is given as a list of generators. The elements of the domain are equivalence classes expressed in terms of reduced elements")) (|lift| ((|#4| $) "\\spad{lift(x)} return the canonical representative of the equivalence class \\spad{x}")) (|coerce| (($ |#4|) "\\spad{coerce(f)} produces the equivalence class of \\spad{f} in the residue ring")) (|reduce| (($ |#4|) "\\spad{reduce(f)} produces the equivalence class of \\spad{f} in the residue ring"))) 
 (((-4464 "*") . T) (-4456 . T) (-4457 . T) (-4459 . T)) 
 NIL 
@@ -4204,7 +4204,7 @@ NIL
 ((|constructor| (NIL "The category of rings with unity,{} always associative,{} but not necessarily commutative.")) (|unitsKnown| ((|attribute|) "recip truly yields reciprocal or \"failed\" if not a unit. Note: \\spad{recip(0) = \"failed\"}.")) (|characteristic| (((|NonNegativeInteger|)) "\\spad{characteristic()} returns the characteristic of the ring this is the smallest positive integer \\spad{n} such that \\spad{n*x=0} for all \\spad{x} in the ring,{} or zero if no such \\spad{n} exists."))) 
 ((-4459 . T)) 
 NIL 
-(-1069 |xx| -1967) 
+(-1069 |xx| -1966) 
 ((|constructor| (NIL "This package exports rational interpolation algorithms"))) 
 NIL 
 NIL 
@@ -4308,11 +4308,11 @@ NIL
 ((|constructor| (NIL "This domain implements named rules")) (|name| (((|Symbol|) $) "\\spad{name(x)} returns the symbol"))) 
 NIL 
 NIL 
-(-1095 |Base| R -1967) 
+(-1095 |Base| R -1966) 
 ((|constructor| (NIL "\\indented{1}{Rules for the pattern matcher} Author: Manuel Bronstein Date Created: 24 Oct 1988 Date Last Updated: 26 October 1993 Keywords: pattern,{} matching,{} rule.")) (|quotedOperators| (((|List| (|Symbol|)) $) "\\spad{quotedOperators(r)} returns the list of operators on the right hand side of \\spad{r} that are considered quoted,{} that is they are not evaluated during any rewrite,{} but just applied formally to their arguments.")) (|elt| ((|#3| $ |#3| (|PositiveInteger|)) "\\spad{elt(r,f,n)} or \\spad{r}(\\spad{f},{} \\spad{n}) applies the rule \\spad{r} to \\spad{f} at most \\spad{n} times.")) (|rhs| ((|#3| $) "\\spad{rhs(r)} returns the right hand side of the rule \\spad{r}.")) (|lhs| ((|#3| $) "\\spad{lhs(r)} returns the left hand side of the rule \\spad{r}.")) (|pattern| (((|Pattern| |#1|) $) "\\spad{pattern(r)} returns the pattern corresponding to the left hand side of the rule \\spad{r}.")) (|suchThat| (($ $ (|List| (|Symbol|)) (|Mapping| (|Boolean|) (|List| |#3|))) "\\spad{suchThat(r, [a1,...,an], f)} returns the rewrite rule \\spad{r} with the predicate \\spad{f(a1,...,an)} attached to it.")) (|rule| (($ |#3| |#3| (|List| (|Symbol|))) "\\spad{rule(f, g, [f1,...,fn])} creates the rewrite rule \\spad{f == eval(eval(g, g is f), [f1,...,fn])},{} that is a rule with left-hand side \\spad{f} and right-hand side \\spad{g}; The symbols \\spad{f1},{}...,{}\\spad{fn} are the operators that are considered quoted,{} that is they are not evaluated during any rewrite,{} but just applied formally to their arguments.") (($ |#3| |#3|) "\\spad{rule(f, g)} creates the rewrite rule: \\spad{f == eval(g, g is f)},{} with left-hand side \\spad{f} and right-hand side \\spad{g}."))) 
 NIL 
 NIL 
-(-1096 |Base| R -1967) 
+(-1096 |Base| R -1966) 
 ((|constructor| (NIL "A ruleset is a set of pattern matching rules grouped together.")) (|elt| ((|#3| $ |#3| (|PositiveInteger|)) "\\spad{elt(r,f,n)} or \\spad{r}(\\spad{f},{} \\spad{n}) applies all the rules of \\spad{r} to \\spad{f} at most \\spad{n} times.")) (|rules| (((|List| (|RewriteRule| |#1| |#2| |#3|)) $) "\\spad{rules(r)} returns the rules contained in \\spad{r}.")) (|ruleset| (($ (|List| (|RewriteRule| |#1| |#2| |#3|))) "\\spad{ruleset([r1,...,rn])} creates the rule set \\spad{{r1,...,rn}}."))) 
 NIL 
 NIL 
@@ -4468,7 +4468,7 @@ NIL
 ((|constructor| (NIL "This domain represents a signature AST. A signature AST \\indented{2}{is a description of an exported operation,{} \\spadignore{e.g.} its name,{} result} \\indented{2}{type,{} and the list of its argument types.}")) (|signature| (((|Signature|) $) "\\spad{signature(s)} returns AST of the declared signature for \\spad{`s'}.")) (|name| (((|Identifier|) $) "\\spad{name(s)} returns the name of the signature \\spad{`s'}.")) (|signatureAst| (($ (|Identifier|) (|Signature|)) "\\spad{signatureAst(n,s,t)} builds the signature AST \\spad{n:} \\spad{s} \\spad{->} \\spad{t}"))) 
 NIL 
 NIL 
-(-1135 R -1967) 
+(-1135 R -1966) 
 ((|constructor| (NIL "This package provides functions to determine the sign of an elementary function around a point or infinity.")) (|sign| (((|Union| (|Integer|) "failed") |#2| (|Symbol|) |#2| (|String|)) "\\spad{sign(f, x, a, s)} returns the sign of \\spad{f} as \\spad{x} nears \\spad{a} from below if \\spad{s} is \"left\",{} or above if \\spad{s} is \"right\".") (((|Union| (|Integer|) "failed") |#2| (|Symbol|) (|OrderedCompletion| |#2|)) "\\spad{sign(f, x, a)} returns the sign of \\spad{f} as \\spad{x} nears \\spad{a},{} from both sides if \\spad{a} is finite.") (((|Union| (|Integer|) "failed") |#2|) "\\spad{sign(f)} returns the sign of \\spad{f} if it is constant everywhere."))) 
 NIL 
 NIL 
@@ -4516,7 +4516,7 @@ NIL
 ((|constructor| (NIL "The category of square-free and normalized triangular sets. Thus,{} up to the primitivity axiom of [1],{} these sets are Lazard triangular sets.\\newline References : \\indented{1}{[1] \\spad{D}. LAZARD \"A new method for solving algebraic systems of} \\indented{5}{positive dimension\" Discr. App. Math. 33:147-160,{}1991}"))) 
 ((-4463 . T) (-4462 . T)) 
 NIL 
-(-1147 UP -1967) 
+(-1147 UP -1966) 
 ((|constructor| (NIL "This package factors the formulas out of the general solve code,{} allowing their recursive use over different domains. Care is taken to introduce few radicals so that radical extension domains can more easily simplify the results.")) (|aQuartic| ((|#2| |#2| |#2| |#2| |#2| |#2|) "\\spad{aQuartic(f,g,h,i,k)} \\undocumented")) (|aCubic| ((|#2| |#2| |#2| |#2| |#2|) "\\spad{aCubic(f,g,h,j)} \\undocumented")) (|aQuadratic| ((|#2| |#2| |#2| |#2|) "\\spad{aQuadratic(f,g,h)} \\undocumented")) (|aLinear| ((|#2| |#2| |#2|) "\\spad{aLinear(f,g)} \\undocumented")) (|quartic| (((|List| |#2|) |#2| |#2| |#2| |#2| |#2|) "\\spad{quartic(f,g,h,i,j)} \\undocumented") (((|List| |#2|) |#1|) "\\spad{quartic(u)} \\undocumented")) (|cubic| (((|List| |#2|) |#2| |#2| |#2| |#2|) "\\spad{cubic(f,g,h,i)} \\undocumented") (((|List| |#2|) |#1|) "\\spad{cubic(u)} \\undocumented")) (|quadratic| (((|List| |#2|) |#2| |#2| |#2|) "\\spad{quadratic(f,g,h)} \\undocumented") (((|List| |#2|) |#1|) "\\spad{quadratic(u)} \\undocumented")) (|linear| (((|List| |#2|) |#2| |#2|) "\\spad{linear(f,g)} \\undocumented") (((|List| |#2|) |#1|) "\\spad{linear(u)} \\undocumented")) (|mapSolve| (((|Record| (|:| |solns| (|List| |#2|)) (|:| |maps| (|List| (|Record| (|:| |arg| |#2|) (|:| |res| |#2|))))) |#1| (|Mapping| |#2| |#2|)) "\\spad{mapSolve(u,f)} \\undocumented")) (|particularSolution| ((|#2| |#1|) "\\spad{particularSolution(u)} \\undocumented")) (|solve| (((|List| |#2|) |#1|) "\\spad{solve(u)} \\undocumented"))) 
 NIL 
 NIL 
@@ -4674,9 +4674,9 @@ NIL
 NIL 
 (-1186 |Coef| |var| |cen|) 
 ((|constructor| (NIL "Sparse Laurent series in one variable \\indented{2}{\\spadtype{SparseUnivariateLaurentSeries} is a domain representing Laurent} \\indented{2}{series in one variable with coefficients in an arbitrary ring.\\space{2}The} \\indented{2}{parameters of the type specify the coefficient ring,{} the power series} \\indented{2}{variable,{} and the center of the power series expansion.\\space{2}For example,{}} \\indented{2}{\\spad{SparseUnivariateLaurentSeries(Integer,x,3)} represents Laurent} \\indented{2}{series in \\spad{(x - 3)} with integer coefficients.}")) (|integrate| (($ $ (|Variable| |#2|)) "\\spad{integrate(f(x))} returns an anti-derivative of the power series \\spad{f(x)} with constant coefficient 0. We may integrate a series when we can divide coefficients by integers.")) (|coerce| (($ (|Variable| |#2|)) "\\spad{coerce(var)} converts the series variable \\spad{var} into a Laurent series."))) 
-(((-4464 "*") -2781 (-2696 (|has| |#1| (-374)) (|has| (-1193 |#1| |#2| |#3|) (-832))) (|has| |#1| (-174)) (-2696 (|has| |#1| (-374)) (|has| (-1193 |#1| |#2| |#3|) (-926)))) (-4455 -2781 (-2696 (|has| |#1| (-374)) (|has| (-1193 |#1| |#2| |#3|) (-832))) (|has| |#1| (-568)) (-2696 (|has| |#1| (-374)) (|has| (-1193 |#1| |#2| |#3|) (-926)))) (-4460 |has| |#1| (-374)) (-4454 |has| |#1| (-374)) (-4456 . T) (-4457 . T) (-4459 . T)) 
-((-2781 (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-832))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-862))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-926))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-1041))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-1171))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -626) (QUOTE (-548)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -626) (LIST (QUOTE -905) (QUOTE (-390))))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -626) (LIST (QUOTE -905) (QUOTE (-576))))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -296) (LIST (QUOTE -1193) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1193) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -319) (LIST (QUOTE -1193) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -526) (QUOTE (-1195)) (LIST (QUOTE -1193) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -651) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -899) (QUOTE (-390)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -899) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -1057) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -1057) (QUOTE (-1195)))) (|HasCategory| |#1| (QUOTE (-374)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576)))))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-174))) (-2781 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-568)))) (-2781 (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-374)))) (|HasCategory| |#1| (QUOTE (-146)))) (-2781 (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-374)))) (|HasCategory| |#1| (QUOTE (-148)))) (-2781 (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-576)) (|devaluate| |#1|)))))) (-2781 (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -917) (QUOTE (-1195)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-576)) (|devaluate| |#1|)))))) (-2781 (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-238))) (|HasCategory| |#1| (QUOTE (-374)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-576)) (|devaluate| |#1|))))) (-2781 (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-238))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-237))) (|HasCategory| |#1| (QUOTE (-374)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-576)) (|devaluate| |#1|))))) (|HasCategory| (-576) (QUOTE (-1131))) (-2781 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#1| (QUOTE (-568)))) (|HasCategory| |#1| (QUOTE (-374))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-926))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -1057) (QUOTE (-1195)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -626) (QUOTE (-548)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-1041))) (|HasCategory| |#1| (QUOTE (-374)))) (-2781 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#1| (QUOTE (-568)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-832))) (|HasCategory| |#1| (QUOTE (-374)))) (-2781 (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-832))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-862))) (|HasCategory| |#1| (QUOTE (-374))))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -1057) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-1171))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -296) (LIST (QUOTE -1193) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1193) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -319) (LIST (QUOTE -1193) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -526) (QUOTE (-1195)) (LIST (QUOTE -1193) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -651) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -626) (LIST (QUOTE -905) (QUOTE (-576))))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -626) (LIST (QUOTE -905) (QUOTE (-390))))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -899) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -899) (QUOTE (-390)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-576))))) (|HasSignature| |#1| (LIST (QUOTE -3581) (LIST (|devaluate| |#1|) (QUOTE (-1195)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-576))))) (-2781 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-976))) (|HasCategory| |#1| (QUOTE (-1221))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasSignature| |#1| (LIST (QUOTE -3009) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1195))))) (|HasSignature| |#1| (LIST (QUOTE -1935) (LIST (LIST (QUOTE -656) (QUOTE (-1195))) (|devaluate| |#1|)))))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-557))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-317))) (|HasCategory| |#1| (QUOTE (-374)))) (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-926))) (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-146))) (-2781 (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-832))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-926))) (|HasCategory| |#1| (QUOTE (-374)))) (|HasCategory| |#1| (QUOTE (-568)))) (-2781 (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -1057) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-374)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576)))))) (-2781 (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-832))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-926))) (|HasCategory| |#1| (QUOTE (-374)))) (|HasCategory| |#1| (QUOTE (-174)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -917) (QUOTE (-1195)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-237))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-862))) (|HasCategory| |#1| (QUOTE (-374)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576))))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-926))) (|HasCategory| |#1| (QUOTE (-374)))) (-2781 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-926))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-374)))) (|HasCategory| |#1| (QUOTE (-146))))) 
-(-1187 R -1967) 
+(((-4464 "*") -2781 (-2697 (|has| |#1| (-374)) (|has| (-1193 |#1| |#2| |#3|) (-832))) (|has| |#1| (-174)) (-2697 (|has| |#1| (-374)) (|has| (-1193 |#1| |#2| |#3|) (-926)))) (-4455 -2781 (-2697 (|has| |#1| (-374)) (|has| (-1193 |#1| |#2| |#3|) (-832))) (|has| |#1| (-568)) (-2697 (|has| |#1| (-374)) (|has| (-1193 |#1| |#2| |#3|) (-926)))) (-4460 |has| |#1| (-374)) (-4454 |has| |#1| (-374)) (-4456 . T) (-4457 . T) (-4459 . T)) 
+((-2781 (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-832))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-862))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-926))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-1041))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-1171))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -626) (QUOTE (-548)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -626) (LIST (QUOTE -905) (QUOTE (-390))))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -626) (LIST (QUOTE -905) (QUOTE (-576))))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -296) (LIST (QUOTE -1193) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1193) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -319) (LIST (QUOTE -1193) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -526) (QUOTE (-1195)) (LIST (QUOTE -1193) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -651) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -899) (QUOTE (-390)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -899) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -1057) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -1057) (QUOTE (-1195)))) (|HasCategory| |#1| (QUOTE (-374)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576)))))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-174))) (-2781 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-568)))) (-2781 (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-374)))) (|HasCategory| |#1| (QUOTE (-146)))) (-2781 (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-374)))) (|HasCategory| |#1| (QUOTE (-148)))) (-2781 (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-576)) (|devaluate| |#1|)))))) (-2781 (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -917) (QUOTE (-1195)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-576)) (|devaluate| |#1|)))))) (-2781 (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-238))) (|HasCategory| |#1| (QUOTE (-374)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-576)) (|devaluate| |#1|))))) (-2781 (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-238))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-237))) (|HasCategory| |#1| (QUOTE (-374)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-576)) (|devaluate| |#1|))))) (|HasCategory| (-576) (QUOTE (-1131))) (-2781 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#1| (QUOTE (-568)))) (|HasCategory| |#1| (QUOTE (-374))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-926))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -1057) (QUOTE (-1195)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -626) (QUOTE (-548)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-1041))) (|HasCategory| |#1| (QUOTE (-374)))) (-2781 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#1| (QUOTE (-568)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-832))) (|HasCategory| |#1| (QUOTE (-374)))) (-2781 (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-832))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-862))) (|HasCategory| |#1| (QUOTE (-374))))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -1057) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-1171))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -296) (LIST (QUOTE -1193) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1193) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -319) (LIST (QUOTE -1193) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -526) (QUOTE (-1195)) (LIST (QUOTE -1193) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -651) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -626) (LIST (QUOTE -905) (QUOTE (-576))))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -626) (LIST (QUOTE -905) (QUOTE (-390))))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -899) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -899) (QUOTE (-390)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-576))))) (|HasSignature| |#1| (LIST (QUOTE -3581) (LIST (|devaluate| |#1|) (QUOTE (-1195)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-576))))) (-2781 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-976))) (|HasCategory| |#1| (QUOTE (-1221))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasSignature| |#1| (LIST (QUOTE -4121) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1195))))) (|HasSignature| |#1| (LIST (QUOTE -1934) (LIST (LIST (QUOTE -656) (QUOTE (-1195))) (|devaluate| |#1|)))))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-557))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-317))) (|HasCategory| |#1| (QUOTE (-374)))) (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-926))) (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-146))) (-2781 (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-832))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-926))) (|HasCategory| |#1| (QUOTE (-374)))) (|HasCategory| |#1| (QUOTE (-568)))) (-2781 (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -1057) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-374)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576)))))) (-2781 (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-832))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-926))) (|HasCategory| |#1| (QUOTE (-374)))) (|HasCategory| |#1| (QUOTE (-174)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (LIST (QUOTE -917) (QUOTE (-1195)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-237))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-862))) (|HasCategory| |#1| (QUOTE (-374)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576))))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-926))) (|HasCategory| |#1| (QUOTE (-374)))) (-2781 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-926))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1193 |#1| |#2| |#3|) (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-374)))) (|HasCategory| |#1| (QUOTE (-146))))) 
+(-1187 R -1966) 
 ((|constructor| (NIL "computes sums of top-level expressions.")) (|sum| ((|#2| |#2| (|SegmentBinding| |#2|)) "\\spad{sum(f(n), n = a..b)} returns \\spad{f}(a) + \\spad{f}(a+1) + ... + \\spad{f}(\\spad{b}).") ((|#2| |#2| (|Symbol|)) "\\spad{sum(a(n), n)} returns A(\\spad{n}) such that A(\\spad{n+1}) - A(\\spad{n}) = a(\\spad{n})."))) 
 NIL 
 NIL 
@@ -4699,11 +4699,11 @@ NIL
 (-1192 |Coef| |var| |cen|) 
 ((|constructor| (NIL "Sparse Puiseux series in one variable \\indented{2}{\\spadtype{SparseUnivariatePuiseuxSeries} is a domain representing Puiseux} \\indented{2}{series in one variable with coefficients in an arbitrary ring.\\space{2}The} \\indented{2}{parameters of the type specify the coefficient ring,{} the power series} \\indented{2}{variable,{} and the center of the power series expansion.\\space{2}For example,{}} \\indented{2}{\\spad{SparseUnivariatePuiseuxSeries(Integer,x,3)} represents Puiseux} \\indented{2}{series in \\spad{(x - 3)} with \\spadtype{Integer} coefficients.}")) (|integrate| (($ $ (|Variable| |#2|)) "\\spad{integrate(f(x))} returns an anti-derivative of the power series \\spad{f(x)} with constant coefficient 0. We may integrate a series when we can divide coefficients by integers."))) 
 (((-4464 "*") |has| |#1| (-174)) (-4455 |has| |#1| (-568)) (-4460 |has| |#1| (-374)) (-4454 |has| |#1| (-374)) (-4456 . T) (-4457 . T) (-4459 . T)) 
-((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-174))) (-2781 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-568)))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (-12 (|HasCategory| |#1| (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -419) (QUOTE (-576))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -419) (QUOTE (-576))) (|devaluate| |#1|)))) (|HasCategory| (-419 (-576)) (QUOTE (-1131))) (|HasCategory| |#1| (QUOTE (-374))) (-2781 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#1| (QUOTE (-568)))) (-2781 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#1| (QUOTE (-568)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -419) (QUOTE (-576)))))) (|HasSignature| |#1| (LIST (QUOTE -3581) (LIST (|devaluate| |#1|) (QUOTE (-1195)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -419) (QUOTE (-576)))))) (-2781 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-976))) (|HasCategory| |#1| (QUOTE (-1221))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasSignature| |#1| (LIST (QUOTE -3009) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1195))))) (|HasSignature| |#1| (LIST (QUOTE -1935) (LIST (LIST (QUOTE -656) (QUOTE (-1195))) (|devaluate| |#1|))))))) 
+((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-174))) (-2781 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-568)))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (-12 (|HasCategory| |#1| (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -419) (QUOTE (-576))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -419) (QUOTE (-576))) (|devaluate| |#1|)))) (|HasCategory| (-419 (-576)) (QUOTE (-1131))) (|HasCategory| |#1| (QUOTE (-374))) (-2781 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#1| (QUOTE (-568)))) (-2781 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#1| (QUOTE (-568)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -419) (QUOTE (-576)))))) (|HasSignature| |#1| (LIST (QUOTE -3581) (LIST (|devaluate| |#1|) (QUOTE (-1195)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -419) (QUOTE (-576)))))) (-2781 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-976))) (|HasCategory| |#1| (QUOTE (-1221))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasSignature| |#1| (LIST (QUOTE -4121) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1195))))) (|HasSignature| |#1| (LIST (QUOTE -1934) (LIST (LIST (QUOTE -656) (QUOTE (-1195))) (|devaluate| |#1|))))))) 
 (-1193 |Coef| |var| |cen|) 
 ((|constructor| (NIL "Sparse Taylor series in one variable \\indented{2}{\\spadtype{SparseUnivariateTaylorSeries} is a domain representing Taylor} \\indented{2}{series in one variable with coefficients in an arbitrary ring.\\space{2}The} \\indented{2}{parameters of the type specify the coefficient ring,{} the power series} \\indented{2}{variable,{} and the center of the power series expansion.\\space{2}For example,{}} \\indented{2}{\\spadtype{SparseUnivariateTaylorSeries}(Integer,{}\\spad{x},{}3) represents Taylor} \\indented{2}{series in \\spad{(x - 3)} with \\spadtype{Integer} coefficients.}")) (|integrate| (($ $ (|Variable| |#2|)) "\\spad{integrate(f(x),x)} returns an anti-derivative of the power series \\spad{f(x)} with constant coefficient 0. We may integrate a series when we can divide coefficients by integers.")) (|univariatePolynomial| (((|UnivariatePolynomial| |#2| |#1|) $ (|NonNegativeInteger|)) "\\spad{univariatePolynomial(f,k)} returns a univariate polynomial \\indented{1}{consisting of the sum of all terms of \\spad{f} of degree \\spad{<= k}.}")) (|coerce| (($ (|Variable| |#2|)) "\\spad{coerce(var)} converts the series variable \\spad{var} into a \\indented{1}{Taylor series.}") (($ (|UnivariatePolynomial| |#2| |#1|)) "\\spad{coerce(p)} converts a univariate polynomial \\spad{p} in the variable \\spad{var} to a univariate Taylor series in \\spad{var}."))) 
 (((-4464 "*") |has| |#1| (-174)) (-4455 |has| |#1| (-568)) (-4456 . T) (-4457 . T) (-4459 . T)) 
-((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| |#1| (QUOTE (-568))) (-2781 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-568)))) (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (-12 (|HasCategory| |#1| (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-783)) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-783)) (|devaluate| |#1|)))) (|HasCategory| (-783) (QUOTE (-1131))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-783))))) (|HasSignature| |#1| (LIST (QUOTE -3581) (LIST (|devaluate| |#1|) (QUOTE (-1195)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-783))))) (|HasCategory| |#1| (QUOTE (-374))) (-2781 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-976))) (|HasCategory| |#1| (QUOTE (-1221))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasSignature| |#1| (LIST (QUOTE -3009) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1195))))) (|HasSignature| |#1| (LIST (QUOTE -1935) (LIST (LIST (QUOTE -656) (QUOTE (-1195))) (|devaluate| |#1|))))))) 
+((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| |#1| (QUOTE (-568))) (-2781 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-568)))) (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (-12 (|HasCategory| |#1| (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-783)) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-783)) (|devaluate| |#1|)))) (|HasCategory| (-783) (QUOTE (-1131))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-783))))) (|HasSignature| |#1| (LIST (QUOTE -3581) (LIST (|devaluate| |#1|) (QUOTE (-1195)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-783))))) (|HasCategory| |#1| (QUOTE (-374))) (-2781 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-976))) (|HasCategory| |#1| (QUOTE (-1221))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasSignature| |#1| (LIST (QUOTE -4121) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1195))))) (|HasSignature| |#1| (LIST (QUOTE -1934) (LIST (LIST (QUOTE -656) (QUOTE (-1195))) (|devaluate| |#1|))))))) 
 (-1194) 
 ((|constructor| (NIL "This domain builds representations of boolean expressions for use with the \\axiomType{FortranCode} domain.")) (NOT (($ $) "\\spad{NOT(x)} returns the \\axiomType{Switch} expression representing \\spad{\\~~x}.") (($ (|Union| (|:| I (|Expression| (|Integer|))) (|:| F (|Expression| (|Float|))) (|:| CF (|Expression| (|Complex| (|Float|)))) (|:| |switch| $))) "\\spad{NOT(x)} returns the \\axiomType{Switch} expression representing \\spad{\\~~x}.")) (AND (($ (|Union| (|:| I (|Expression| (|Integer|))) (|:| F (|Expression| (|Float|))) (|:| CF (|Expression| (|Complex| (|Float|)))) (|:| |switch| $)) (|Union| (|:| I (|Expression| (|Integer|))) (|:| F (|Expression| (|Float|))) (|:| CF (|Expression| (|Complex| (|Float|)))) (|:| |switch| $))) "\\spad{AND(x,y)} returns the \\axiomType{Switch} expression representing \\spad{x and y}.")) (EQ (($ (|Union| (|:| I (|Expression| (|Integer|))) (|:| F (|Expression| (|Float|))) (|:| CF (|Expression| (|Complex| (|Float|)))) (|:| |switch| $)) (|Union| (|:| I (|Expression| (|Integer|))) (|:| F (|Expression| (|Float|))) (|:| CF (|Expression| (|Complex| (|Float|)))) (|:| |switch| $))) "\\spad{EQ(x,y)} returns the \\axiomType{Switch} expression representing \\spad{x = y}.")) (OR (($ (|Union| (|:| I (|Expression| (|Integer|))) (|:| F (|Expression| (|Float|))) (|:| CF (|Expression| (|Complex| (|Float|)))) (|:| |switch| $)) (|Union| (|:| I (|Expression| (|Integer|))) (|:| F (|Expression| (|Float|))) (|:| CF (|Expression| (|Complex| (|Float|)))) (|:| |switch| $))) "\\spad{OR(x,y)} returns the \\axiomType{Switch} expression representing \\spad{x or y}.")) (GE (($ (|Union| (|:| I (|Expression| (|Integer|))) (|:| F (|Expression| (|Float|))) (|:| CF (|Expression| (|Complex| (|Float|)))) (|:| |switch| $)) (|Union| (|:| I (|Expression| (|Integer|))) (|:| F (|Expression| (|Float|))) (|:| CF (|Expression| (|Complex| (|Float|)))) (|:| |switch| $))) "\\spad{GE(x,y)} returns the \\axiomType{Switch} expression representing \\spad{x>=y}.")) (LE (($ (|Union| (|:| I (|Expression| (|Integer|))) (|:| F (|Expression| (|Float|))) (|:| CF (|Expression| (|Complex| (|Float|)))) (|:| |switch| $)) (|Union| (|:| I (|Expression| (|Integer|))) (|:| F (|Expression| (|Float|))) (|:| CF (|Expression| (|Complex| (|Float|)))) (|:| |switch| $))) "\\spad{LE(x,y)} returns the \\axiomType{Switch} expression representing \\spad{x<=y}.")) (GT (($ (|Union| (|:| I (|Expression| (|Integer|))) (|:| F (|Expression| (|Float|))) (|:| CF (|Expression| (|Complex| (|Float|)))) (|:| |switch| $)) (|Union| (|:| I (|Expression| (|Integer|))) (|:| F (|Expression| (|Float|))) (|:| CF (|Expression| (|Complex| (|Float|)))) (|:| |switch| $))) "\\spad{GT(x,y)} returns the \\axiomType{Switch} expression representing \\spad{x>y}.")) (LT (($ (|Union| (|:| I (|Expression| (|Integer|))) (|:| F (|Expression| (|Float|))) (|:| CF (|Expression| (|Complex| (|Float|)))) (|:| |switch| $)) (|Union| (|:| I (|Expression| (|Integer|))) (|:| F (|Expression| (|Float|))) (|:| CF (|Expression| (|Complex| (|Float|)))) (|:| |switch| $))) "\\spad{LT(x,y)} returns the \\axiomType{Switch} expression representing \\spad{x<y}.")) (|coerce| (($ (|Symbol|)) "\\spad{coerce(s)} \\undocumented{}"))) 
 NIL 
@@ -4828,7 +4828,7 @@ NIL
 ((|constructor| (NIL "Category for the trigonometric functions.")) (|tan| (($ $) "\\spad{tan(x)} returns the tangent of \\spad{x}.")) (|sin| (($ $) "\\spad{sin(x)} returns the sine of \\spad{x}.")) (|sec| (($ $) "\\spad{sec(x)} returns the secant of \\spad{x}.")) (|csc| (($ $) "\\spad{csc(x)} returns the cosecant of \\spad{x}.")) (|cot| (($ $) "\\spad{cot(x)} returns the cotangent of \\spad{x}.")) (|cos| (($ $) "\\spad{cos(x)} returns the cosine of \\spad{x}."))) 
 NIL 
 NIL 
-(-1225 R -1967) 
+(-1225 R -1966) 
 ((|constructor| (NIL "\\spadtype{TrigonometricManipulations} provides transformations from trigonometric functions to complex exponentials and logarithms,{} and back.")) (|complexForm| (((|Complex| |#2|) |#2|) "\\spad{complexForm(f)} returns \\spad{[real f, imag f]}.")) (|real?| (((|Boolean|) |#2|) "\\spad{real?(f)} returns \\spad{true} if \\spad{f = real f}.")) (|imag| ((|#2| |#2|) "\\spad{imag(f)} returns the imaginary part of \\spad{f} where \\spad{f} is a complex function.")) (|real| ((|#2| |#2|) "\\spad{real(f)} returns the real part of \\spad{f} where \\spad{f} is a complex function.")) (|trigs| ((|#2| |#2|) "\\spad{trigs(f)} rewrites all the complex logs and exponentials appearing in \\spad{f} in terms of trigonometric functions.")) (|complexElementary| ((|#2| |#2| (|Symbol|)) "\\spad{complexElementary(f, x)} rewrites the kernels of \\spad{f} involving \\spad{x} in terms of the 2 fundamental complex transcendental elementary functions: \\spad{log, exp}.") ((|#2| |#2|) "\\spad{complexElementary(f)} rewrites \\spad{f} in terms of the 2 fundamental complex transcendental elementary functions: \\spad{log, exp}.")) (|complexNormalize| ((|#2| |#2| (|Symbol|)) "\\spad{complexNormalize(f, x)} rewrites \\spad{f} using the least possible number of complex independent kernels involving \\spad{x}.") ((|#2| |#2|) "\\spad{complexNormalize(f)} rewrites \\spad{f} using the least possible number of complex independent kernels."))) 
 NIL 
 NIL 
@@ -4836,7 +4836,7 @@ NIL
 ((|constructor| (NIL "This package provides functions that compute \"fraction-free\" inverses of upper and lower triangular matrices over a integral domain. By \"fraction-free inverses\" we mean the following: given a matrix \\spad{B} with entries in \\spad{R} and an element \\spad{d} of \\spad{R} such that \\spad{d} * inv(\\spad{B}) also has entries in \\spad{R},{} we return \\spad{d} * inv(\\spad{B}). Thus,{} it is not necessary to pass to the quotient field in any of our computations.")) (|LowTriBddDenomInv| ((|#4| |#4| |#1|) "\\spad{LowTriBddDenomInv(B,d)} returns \\spad{M},{} where \\spad{B} is a non-singular lower triangular matrix and \\spad{d} is an element of \\spad{R} such that \\spad{M = d * inv(B)} has entries in \\spad{R}.")) (|UpTriBddDenomInv| ((|#4| |#4| |#1|) "\\spad{UpTriBddDenomInv(B,d)} returns \\spad{M},{} where \\spad{B} is a non-singular upper triangular matrix and \\spad{d} is an element of \\spad{R} such that \\spad{M = d * inv(B)} has entries in \\spad{R}."))) 
 NIL 
 NIL 
-(-1227 R -1967) 
+(-1227 R -1966) 
 ((|constructor| (NIL "TranscendentalManipulations provides functions to simplify and expand expressions involving transcendental operators.")) (|expandTrigProducts| ((|#2| |#2|) "\\spad{expandTrigProducts(e)} replaces \\axiom{sin(\\spad{x})*sin(\\spad{y})} by \\spad{(cos(x-y)-cos(x+y))/2},{} \\axiom{cos(\\spad{x})*cos(\\spad{y})} by \\spad{(cos(x-y)+cos(x+y))/2},{} and \\axiom{sin(\\spad{x})*cos(\\spad{y})} by \\spad{(sin(x-y)+sin(x+y))/2}. Note that this operation uses the pattern matcher and so is relatively expensive. To avoid getting into an infinite loop the transformations are applied at most ten times.")) (|removeSinhSq| ((|#2| |#2|) "\\spad{removeSinhSq(f)} converts every \\spad{sinh(u)**2} appearing in \\spad{f} into \\spad{1 - cosh(x)**2},{} and also reduces higher powers of \\spad{sinh(u)} with that formula.")) (|removeCoshSq| ((|#2| |#2|) "\\spad{removeCoshSq(f)} converts every \\spad{cosh(u)**2} appearing in \\spad{f} into \\spad{1 - sinh(x)**2},{} and also reduces higher powers of \\spad{cosh(u)} with that formula.")) (|removeSinSq| ((|#2| |#2|) "\\spad{removeSinSq(f)} converts every \\spad{sin(u)**2} appearing in \\spad{f} into \\spad{1 - cos(x)**2},{} and also reduces higher powers of \\spad{sin(u)} with that formula.")) (|removeCosSq| ((|#2| |#2|) "\\spad{removeCosSq(f)} converts every \\spad{cos(u)**2} appearing in \\spad{f} into \\spad{1 - sin(x)**2},{} and also reduces higher powers of \\spad{cos(u)} with that formula.")) (|coth2tanh| ((|#2| |#2|) "\\spad{coth2tanh(f)} converts every \\spad{coth(u)} appearing in \\spad{f} into \\spad{1/tanh(u)}.")) (|cot2tan| ((|#2| |#2|) "\\spad{cot2tan(f)} converts every \\spad{cot(u)} appearing in \\spad{f} into \\spad{1/tan(u)}.")) (|tanh2coth| ((|#2| |#2|) "\\spad{tanh2coth(f)} converts every \\spad{tanh(u)} appearing in \\spad{f} into \\spad{1/coth(u)}.")) (|tan2cot| ((|#2| |#2|) "\\spad{tan2cot(f)} converts every \\spad{tan(u)} appearing in \\spad{f} into \\spad{1/cot(u)}.")) (|tanh2trigh| ((|#2| |#2|) "\\spad{tanh2trigh(f)} converts every \\spad{tanh(u)} appearing in \\spad{f} into \\spad{sinh(u)/cosh(u)}.")) (|tan2trig| ((|#2| |#2|) "\\spad{tan2trig(f)} converts every \\spad{tan(u)} appearing in \\spad{f} into \\spad{sin(u)/cos(u)}.")) (|sinh2csch| ((|#2| |#2|) "\\spad{sinh2csch(f)} converts every \\spad{sinh(u)} appearing in \\spad{f} into \\spad{1/csch(u)}.")) (|sin2csc| ((|#2| |#2|) "\\spad{sin2csc(f)} converts every \\spad{sin(u)} appearing in \\spad{f} into \\spad{1/csc(u)}.")) (|sech2cosh| ((|#2| |#2|) "\\spad{sech2cosh(f)} converts every \\spad{sech(u)} appearing in \\spad{f} into \\spad{1/cosh(u)}.")) (|sec2cos| ((|#2| |#2|) "\\spad{sec2cos(f)} converts every \\spad{sec(u)} appearing in \\spad{f} into \\spad{1/cos(u)}.")) (|csch2sinh| ((|#2| |#2|) "\\spad{csch2sinh(f)} converts every \\spad{csch(u)} appearing in \\spad{f} into \\spad{1/sinh(u)}.")) (|csc2sin| ((|#2| |#2|) "\\spad{csc2sin(f)} converts every \\spad{csc(u)} appearing in \\spad{f} into \\spad{1/sin(u)}.")) (|coth2trigh| ((|#2| |#2|) "\\spad{coth2trigh(f)} converts every \\spad{coth(u)} appearing in \\spad{f} into \\spad{cosh(u)/sinh(u)}.")) (|cot2trig| ((|#2| |#2|) "\\spad{cot2trig(f)} converts every \\spad{cot(u)} appearing in \\spad{f} into \\spad{cos(u)/sin(u)}.")) (|cosh2sech| ((|#2| |#2|) "\\spad{cosh2sech(f)} converts every \\spad{cosh(u)} appearing in \\spad{f} into \\spad{1/sech(u)}.")) (|cos2sec| ((|#2| |#2|) "\\spad{cos2sec(f)} converts every \\spad{cos(u)} appearing in \\spad{f} into \\spad{1/sec(u)}.")) (|expandLog| ((|#2| |#2|) "\\spad{expandLog(f)} converts every \\spad{log(a/b)} appearing in \\spad{f} into \\spad{log(a) - log(b)},{} and every \\spad{log(a*b)} into \\spad{log(a) + log(b)}..")) (|expandPower| ((|#2| |#2|) "\\spad{expandPower(f)} converts every power \\spad{(a/b)**c} appearing in \\spad{f} into \\spad{a**c * b**(-c)}.")) (|simplifyLog| ((|#2| |#2|) "\\spad{simplifyLog(f)} converts every \\spad{log(a) - log(b)} appearing in \\spad{f} into \\spad{log(a/b)},{} every \\spad{log(a) + log(b)} into \\spad{log(a*b)} and every \\spad{n*log(a)} into \\spad{log(a^n)}.")) (|simplifyExp| ((|#2| |#2|) "\\spad{simplifyExp(f)} converts every product \\spad{exp(a)*exp(b)} appearing in \\spad{f} into \\spad{exp(a+b)}.")) (|htrigs| ((|#2| |#2|) "\\spad{htrigs(f)} converts all the exponentials in \\spad{f} into hyperbolic sines and cosines.")) (|simplify| ((|#2| |#2|) "\\spad{simplify(f)} performs the following simplifications on \\spad{f:}\\begin{items} \\item 1. rewrites trigs and hyperbolic trigs in terms of \\spad{sin} ,{}\\spad{cos},{} \\spad{sinh},{} \\spad{cosh}. \\item 2. rewrites \\spad{sin**2} and \\spad{sinh**2} in terms of \\spad{cos} and \\spad{cosh},{} \\item 3. rewrites \\spad{exp(a)*exp(b)} as \\spad{exp(a+b)}. \\item 4. rewrites \\spad{(a**(1/n))**m * (a**(1/s))**t} as a single power of a single radical of \\spad{a}. \\end{items}")) (|expand| ((|#2| |#2|) "\\spad{expand(f)} performs the following expansions on \\spad{f:}\\begin{items} \\item 1. logs of products are expanded into sums of logs,{} \\item 2. trigonometric and hyperbolic trigonometric functions of sums are expanded into sums of products of trigonometric and hyperbolic trigonometric functions. \\item 3. formal powers of the form \\spad{(a/b)**c} are expanded into \\spad{a**c * b**(-c)}. \\end{items}"))) 
 NIL 
 ((-12 (|HasCategory| |#1| (LIST (QUOTE -626) (LIST (QUOTE -905) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -899) (|devaluate| |#1|))) (|HasCategory| |#2| (LIST (QUOTE -626) (LIST (QUOTE -905) (|devaluate| |#1|)))) (|HasCategory| |#2| (LIST (QUOTE -899) (|devaluate| |#1|))))) 
@@ -4864,7 +4864,7 @@ NIL
 ((|constructor| (NIL "\\indented{1}{This domain is used to interface with the interpreter\\spad{'s} notion} of comma-delimited sequences of values.")) (|length| (((|NonNegativeInteger|) $) "\\spad{length(x)} returns the number of elements in tuple \\spad{x}")) (|select| ((|#1| $ (|NonNegativeInteger|)) "\\spad{select(x,n)} returns the \\spad{n}-th element of tuple \\spad{x}. tuples are 0-based"))) 
 NIL 
 ((|HasCategory| |#1| (QUOTE (-1119))) (|HasCategory| |#1| (LIST (QUOTE -625) (QUOTE (-874))))) 
-(-1234 -1967) 
+(-1234 -1966) 
 ((|constructor| (NIL "A basic package for the factorization of bivariate polynomials over a finite field. The functions here represent the base step for the multivariate factorizer.")) (|twoFactor| (((|Factored| (|SparseUnivariatePolynomial| (|SparseUnivariatePolynomial| |#1|))) (|SparseUnivariatePolynomial| (|SparseUnivariatePolynomial| |#1|)) (|Integer|)) "\\spad{twoFactor(p,n)} returns the factorisation of polynomial \\spad{p},{} a sparse univariate polynomial (sup) over a sup over \\spad{F}. Also,{} \\spad{p} is assumed primitive and square-free and \\spad{n} is the degree of the inner variable of \\spad{p} (maximum of the degrees of the coefficients of \\spad{p}).")) (|generalSqFr| (((|Factored| (|SparseUnivariatePolynomial| (|SparseUnivariatePolynomial| |#1|))) (|SparseUnivariatePolynomial| (|SparseUnivariatePolynomial| |#1|))) "\\spad{generalSqFr(p)} returns the square-free factorisation of polynomial \\spad{p},{} a sparse univariate polynomial (sup) over a sup over \\spad{F}.")) (|generalTwoFactor| (((|Factored| (|SparseUnivariatePolynomial| (|SparseUnivariatePolynomial| |#1|))) (|SparseUnivariatePolynomial| (|SparseUnivariatePolynomial| |#1|))) "\\spad{generalTwoFactor(p)} returns the factorisation of polynomial \\spad{p},{} a sparse univariate polynomial (sup) over a sup over \\spad{F}."))) 
 NIL 
 NIL 
@@ -4927,11 +4927,11 @@ NIL
 (-1249 |Coef| UTS) 
 ((|constructor| (NIL "This package enables one to construct a univariate Laurent series domain from a univariate Taylor series domain. Univariate Laurent series are represented by a pair \\spad{[n,f(x)]},{} where \\spad{n} is an arbitrary integer and \\spad{f(x)} is a Taylor series. This pair represents the Laurent series \\spad{x**n * f(x)}."))) 
 (((-4464 "*") |has| |#1| (-174)) (-4455 |has| |#1| (-568)) (-4460 |has| |#1| (-374)) (-4454 |has| |#1| (-374)) (-4456 . T) (-4457 . T) (-4459 . T)) 
-((-2781 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -296) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -526) (QUOTE (-1195)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-832)))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-862)))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-926)))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-1041)))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-1171)))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-548))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -319) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -1057) (QUOTE (-576))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -1057) (QUOTE (-1195)))))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-174))) (-2781 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-568)))) (-2781 (|HasCategory| |#1| (QUOTE (-146))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-146))))) (-2781 (|HasCategory| |#1| (QUOTE (-148))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-148))))) (-2781 (-12 (|HasCategory| |#1| (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-576)) (|devaluate| |#1|))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -915) (QUOTE (-1195)))))) (-2781 (-12 (|HasCategory| |#1| (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-576)) (|devaluate| |#1|))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -915) (QUOTE (-1195))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -917) (QUOTE (-1195)))))) (-2781 (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-238)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-576)) (|devaluate| |#1|))))) (-2781 (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-238)))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-237)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-576)) (|devaluate| |#1|))))) (|HasCategory| (-576) (QUOTE (-1131))) (-2781 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#1| (QUOTE (-568)))) (|HasCategory| |#1| (QUOTE (-374))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-926)))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -1057) (QUOTE (-1195))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-548))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-1041)))) (-2781 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#1| (QUOTE (-568)))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-832)))) (-2781 (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-832)))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-862))))) (-2781 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -626) (LIST (QUOTE -905) (QUOTE (-390)))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -626) (LIST (QUOTE -905) (QUOTE (-576)))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -296) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -526) (QUOTE (-1195)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -651) (QUOTE (-576))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-832)))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-862)))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-926)))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-1041)))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-1171)))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-548))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -319) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -899) (QUOTE (-390))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -899) (QUOTE (-576))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -1057) (QUOTE (-576))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -1057) (QUOTE (-1195)))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -1057) (QUOTE (-576))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-1171)))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -296) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -319) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -526) (QUOTE (-1195)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -651) (QUOTE (-576))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -626) (LIST (QUOTE -905) (QUOTE (-576)))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -626) (LIST (QUOTE -905) (QUOTE (-390)))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -899) (QUOTE (-576))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -899) (QUOTE (-390))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-576))))) (|HasSignature| |#1| (LIST (QUOTE -3581) (LIST (|devaluate| |#1|) (QUOTE (-1195)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-576))))) (-2781 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-976))) (|HasCategory| |#1| (QUOTE (-1221))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasSignature| |#1| (LIST (QUOTE -3009) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1195))))) (|HasSignature| |#1| (LIST (QUOTE -1935) (LIST (LIST (QUOTE -656) (QUOTE (-1195))) (|devaluate| |#1|)))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-862)))) (|HasCategory| |#2| (QUOTE (-926))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-557)))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-317)))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#2| (QUOTE (-146))) (-2781 (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-237)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-576)) (|devaluate| |#1|))))) (-2781 (-12 (|HasCategory| |#1| (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-576)) (|devaluate| |#1|))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -917) (QUOTE (-1195)))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -917) (QUOTE (-1195))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-237)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576))))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-926)))) (-2781 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-926)))) (|HasCategory| |#1| (QUOTE (-146))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-146)))))) 
+((-2781 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -296) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -526) (QUOTE (-1195)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-832)))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-862)))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-926)))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-1041)))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-1171)))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-548))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -319) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -1057) (QUOTE (-576))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -1057) (QUOTE (-1195)))))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-174))) (-2781 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-568)))) (-2781 (|HasCategory| |#1| (QUOTE (-146))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-146))))) (-2781 (|HasCategory| |#1| (QUOTE (-148))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-148))))) (-2781 (-12 (|HasCategory| |#1| (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-576)) (|devaluate| |#1|))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -915) (QUOTE (-1195)))))) (-2781 (-12 (|HasCategory| |#1| (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-576)) (|devaluate| |#1|))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -915) (QUOTE (-1195))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -917) (QUOTE (-1195)))))) (-2781 (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-238)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-576)) (|devaluate| |#1|))))) (-2781 (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-238)))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-237)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-576)) (|devaluate| |#1|))))) (|HasCategory| (-576) (QUOTE (-1131))) (-2781 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#1| (QUOTE (-568)))) (|HasCategory| |#1| (QUOTE (-374))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-926)))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -1057) (QUOTE (-1195))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-548))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-1041)))) (-2781 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#1| (QUOTE (-568)))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-832)))) (-2781 (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-832)))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-862))))) (-2781 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -626) (LIST (QUOTE -905) (QUOTE (-390)))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -626) (LIST (QUOTE -905) (QUOTE (-576)))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -296) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -526) (QUOTE (-1195)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -651) (QUOTE (-576))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-832)))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-862)))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-926)))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-1041)))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-1171)))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -626) (QUOTE (-548))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -319) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -899) (QUOTE (-390))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -899) (QUOTE (-576))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -1057) (QUOTE (-576))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -1057) (QUOTE (-1195)))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -1057) (QUOTE (-576))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-1171)))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -296) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -319) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -526) (QUOTE (-1195)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -651) (QUOTE (-576))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -626) (LIST (QUOTE -905) (QUOTE (-576)))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -626) (LIST (QUOTE -905) (QUOTE (-390)))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -899) (QUOTE (-576))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -899) (QUOTE (-390))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-576))))) (|HasSignature| |#1| (LIST (QUOTE -3581) (LIST (|devaluate| |#1|) (QUOTE (-1195)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-576))))) (-2781 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-976))) (|HasCategory| |#1| (QUOTE (-1221))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasSignature| |#1| (LIST (QUOTE -4121) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1195))))) (|HasSignature| |#1| (LIST (QUOTE -1934) (LIST (LIST (QUOTE -656) (QUOTE (-1195))) (|devaluate| |#1|)))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-862)))) (|HasCategory| |#2| (QUOTE (-926))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-557)))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-317)))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#2| (QUOTE (-146))) (-2781 (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-237)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-576)) (|devaluate| |#1|))))) (-2781 (-12 (|HasCategory| |#1| (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-576)) (|devaluate| |#1|))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -917) (QUOTE (-1195)))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (LIST (QUOTE -917) (QUOTE (-1195))))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-237)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576))))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-926)))) (-2781 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-926)))) (|HasCategory| |#1| (QUOTE (-146))) (-12 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#2| (QUOTE (-146)))))) 
 (-1250 |Coef| |var| |cen|) 
 ((|constructor| (NIL "Dense Laurent series in one variable \\indented{2}{\\spadtype{UnivariateLaurentSeries} is a domain representing Laurent} \\indented{2}{series in one variable with coefficients in an arbitrary ring.\\space{2}The} \\indented{2}{parameters of the type specify the coefficient ring,{} the power series} \\indented{2}{variable,{} and the center of the power series expansion.\\space{2}For example,{}} \\indented{2}{\\spad{UnivariateLaurentSeries(Integer,x,3)} represents Laurent series in} \\indented{2}{\\spad{(x - 3)} with integer coefficients.}")) (|integrate| (($ $ (|Variable| |#2|)) "\\spad{integrate(f(x))} returns an anti-derivative of the power series \\spad{f(x)} with constant coefficient 0. We may integrate a series when we can divide coefficients by integers.")) (|coerce| (($ (|Variable| |#2|)) "\\spad{coerce(var)} converts the series variable \\spad{var} into a Laurent series."))) 
-(((-4464 "*") -2781 (-2696 (|has| |#1| (-374)) (|has| (-1278 |#1| |#2| |#3|) (-832))) (|has| |#1| (-174)) (-2696 (|has| |#1| (-374)) (|has| (-1278 |#1| |#2| |#3|) (-926)))) (-4455 -2781 (-2696 (|has| |#1| (-374)) (|has| (-1278 |#1| |#2| |#3|) (-832))) (|has| |#1| (-568)) (-2696 (|has| |#1| (-374)) (|has| (-1278 |#1| |#2| |#3|) (-926)))) (-4460 |has| |#1| (-374)) (-4454 |has| |#1| (-374)) (-4456 . T) (-4457 . T) (-4459 . T)) 
-((-2781 (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-832))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-862))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-926))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-1041))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-1171))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -626) (QUOTE (-548)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -626) (LIST (QUOTE -905) (QUOTE (-390))))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -626) (LIST (QUOTE -905) (QUOTE (-576))))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -296) (LIST (QUOTE -1278) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1278) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -319) (LIST (QUOTE -1278) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -526) (QUOTE (-1195)) (LIST (QUOTE -1278) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -651) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -899) (QUOTE (-390)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -899) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -1057) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -1057) (QUOTE (-1195)))) (|HasCategory| |#1| (QUOTE (-374)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576)))))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-174))) (-2781 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-568)))) (-2781 (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-374)))) (|HasCategory| |#1| (QUOTE (-146)))) (-2781 (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-374)))) (|HasCategory| |#1| (QUOTE (-148)))) (-2781 (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-576)) (|devaluate| |#1|)))))) (-2781 (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -917) (QUOTE (-1195)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-576)) (|devaluate| |#1|)))))) (-2781 (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-238))) (|HasCategory| |#1| (QUOTE (-374)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-576)) (|devaluate| |#1|))))) (-2781 (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-238))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-237))) (|HasCategory| |#1| (QUOTE (-374)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-576)) (|devaluate| |#1|))))) (|HasCategory| (-576) (QUOTE (-1131))) (-2781 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#1| (QUOTE (-568)))) (|HasCategory| |#1| (QUOTE (-374))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-926))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -1057) (QUOTE (-1195)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -626) (QUOTE (-548)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-1041))) (|HasCategory| |#1| (QUOTE (-374)))) (-2781 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#1| (QUOTE (-568)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-832))) (|HasCategory| |#1| (QUOTE (-374)))) (-2781 (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-832))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-862))) (|HasCategory| |#1| (QUOTE (-374))))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -1057) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-1171))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -296) (LIST (QUOTE -1278) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1278) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -319) (LIST (QUOTE -1278) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -526) (QUOTE (-1195)) (LIST (QUOTE -1278) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -651) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -626) (LIST (QUOTE -905) (QUOTE (-576))))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -626) (LIST (QUOTE -905) (QUOTE (-390))))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -899) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -899) (QUOTE (-390)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-576))))) (|HasSignature| |#1| (LIST (QUOTE -3581) (LIST (|devaluate| |#1|) (QUOTE (-1195)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-576))))) (-2781 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-976))) (|HasCategory| |#1| (QUOTE (-1221))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasSignature| |#1| (LIST (QUOTE -3009) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1195))))) (|HasSignature| |#1| (LIST (QUOTE -1935) (LIST (LIST (QUOTE -656) (QUOTE (-1195))) (|devaluate| |#1|)))))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-557))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-317))) (|HasCategory| |#1| (QUOTE (-374)))) (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-926))) (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-146))) (-2781 (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-832))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-926))) (|HasCategory| |#1| (QUOTE (-374)))) (|HasCategory| |#1| (QUOTE (-568)))) (-2781 (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -1057) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-374)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576)))))) (-2781 (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-832))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-926))) (|HasCategory| |#1| (QUOTE (-374)))) (|HasCategory| |#1| (QUOTE (-174)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -917) (QUOTE (-1195)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-237))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-862))) (|HasCategory| |#1| (QUOTE (-374)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576))))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-926))) (|HasCategory| |#1| (QUOTE (-374)))) (-2781 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-926))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-374)))) (|HasCategory| |#1| (QUOTE (-146))))) 
+(((-4464 "*") -2781 (-2697 (|has| |#1| (-374)) (|has| (-1278 |#1| |#2| |#3|) (-832))) (|has| |#1| (-174)) (-2697 (|has| |#1| (-374)) (|has| (-1278 |#1| |#2| |#3|) (-926)))) (-4455 -2781 (-2697 (|has| |#1| (-374)) (|has| (-1278 |#1| |#2| |#3|) (-832))) (|has| |#1| (-568)) (-2697 (|has| |#1| (-374)) (|has| (-1278 |#1| |#2| |#3|) (-926)))) (-4460 |has| |#1| (-374)) (-4454 |has| |#1| (-374)) (-4456 . T) (-4457 . T) (-4459 . T)) 
+((-2781 (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-832))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-862))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-926))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-1041))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-1171))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -626) (QUOTE (-548)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -626) (LIST (QUOTE -905) (QUOTE (-390))))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -626) (LIST (QUOTE -905) (QUOTE (-576))))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -296) (LIST (QUOTE -1278) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1278) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -319) (LIST (QUOTE -1278) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -526) (QUOTE (-1195)) (LIST (QUOTE -1278) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -651) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -899) (QUOTE (-390)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -899) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -1057) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -1057) (QUOTE (-1195)))) (|HasCategory| |#1| (QUOTE (-374)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576)))))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-174))) (-2781 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-568)))) (-2781 (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-374)))) (|HasCategory| |#1| (QUOTE (-146)))) (-2781 (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-374)))) (|HasCategory| |#1| (QUOTE (-148)))) (-2781 (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-576)) (|devaluate| |#1|)))))) (-2781 (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -917) (QUOTE (-1195)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-576)) (|devaluate| |#1|)))))) (-2781 (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-238))) (|HasCategory| |#1| (QUOTE (-374)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-576)) (|devaluate| |#1|))))) (-2781 (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-238))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-237))) (|HasCategory| |#1| (QUOTE (-374)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-576)) (|devaluate| |#1|))))) (|HasCategory| (-576) (QUOTE (-1131))) (-2781 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#1| (QUOTE (-568)))) (|HasCategory| |#1| (QUOTE (-374))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-926))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -1057) (QUOTE (-1195)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -626) (QUOTE (-548)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-1041))) (|HasCategory| |#1| (QUOTE (-374)))) (-2781 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#1| (QUOTE (-568)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-832))) (|HasCategory| |#1| (QUOTE (-374)))) (-2781 (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-832))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-862))) (|HasCategory| |#1| (QUOTE (-374))))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -1057) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-1171))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -296) (LIST (QUOTE -1278) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1278) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -319) (LIST (QUOTE -1278) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -526) (QUOTE (-1195)) (LIST (QUOTE -1278) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -651) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -626) (LIST (QUOTE -905) (QUOTE (-576))))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -626) (LIST (QUOTE -905) (QUOTE (-390))))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -899) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -899) (QUOTE (-390)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-576))))) (|HasSignature| |#1| (LIST (QUOTE -3581) (LIST (|devaluate| |#1|) (QUOTE (-1195)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-576))))) (-2781 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-976))) (|HasCategory| |#1| (QUOTE (-1221))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasSignature| |#1| (LIST (QUOTE -4121) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1195))))) (|HasSignature| |#1| (LIST (QUOTE -1934) (LIST (LIST (QUOTE -656) (QUOTE (-1195))) (|devaluate| |#1|)))))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-557))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-317))) (|HasCategory| |#1| (QUOTE (-374)))) (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-926))) (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-146))) (-2781 (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-832))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-926))) (|HasCategory| |#1| (QUOTE (-374)))) (|HasCategory| |#1| (QUOTE (-568)))) (-2781 (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -1057) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-374)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576)))))) (-2781 (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-832))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-926))) (|HasCategory| |#1| (QUOTE (-374)))) (|HasCategory| |#1| (QUOTE (-174)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (LIST (QUOTE -917) (QUOTE (-1195)))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-237))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-862))) (|HasCategory| |#1| (QUOTE (-374)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576))))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-926))) (|HasCategory| |#1| (QUOTE (-374)))) (-2781 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-926))) (|HasCategory| |#1| (QUOTE (-374)))) (-12 (|HasCategory| (-1278 |#1| |#2| |#3|) (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-374)))) (|HasCategory| |#1| (QUOTE (-146))))) 
 (-1251 ZP) 
 ((|constructor| (NIL "Package for the factorization of univariate polynomials with integer coefficients. The factorization is done by \"lifting\" (HENSEL) the factorization over a finite field.")) (|henselFact| (((|Record| (|:| |contp| (|Integer|)) (|:| |factors| (|List| (|Record| (|:| |irr| |#1|) (|:| |pow| (|Integer|)))))) |#1| (|Boolean|)) "\\spad{henselFact(m,flag)} returns the factorization of \\spad{m},{} FinalFact is a Record \\spad{s}.\\spad{t}. FinalFact.contp=content \\spad{m},{} FinalFact.factors=List of irreducible factors of \\spad{m} with exponent ,{} if \\spad{flag} =true the polynomial is assumed square free.")) (|factorSquareFree| (((|Factored| |#1|) |#1|) "\\spad{factorSquareFree(m)} returns the factorization of \\spad{m} square free polynomial")) (|factor| (((|Factored| |#1|) |#1|) "\\spad{factor(m)} returns the factorization of \\spad{m}"))) 
 NIL 
@@ -5011,11 +5011,11 @@ NIL
 (-1270 |Coef| ULS) 
 ((|constructor| (NIL "This package enables one to construct a univariate Puiseux series domain from a univariate Laurent series domain. Univariate Puiseux series are represented by a pair \\spad{[r,f(x)]},{} where \\spad{r} is a positive rational number and \\spad{f(x)} is a Laurent series. This pair represents the Puiseux series \\spad{f(x^r)}."))) 
 (((-4464 "*") |has| |#1| (-174)) (-4455 |has| |#1| (-568)) (-4460 |has| |#1| (-374)) (-4454 |has| |#1| (-374)) (-4456 . T) (-4457 . T) (-4459 . T)) 
-((|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-174))) (-2781 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-568)))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (-12 (|HasCategory| |#1| (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -419) (QUOTE (-576))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -419) (QUOTE (-576))) (|devaluate| |#1|)))) (|HasCategory| (-419 (-576)) (QUOTE (-1131))) (|HasCategory| |#1| (QUOTE (-374))) (-2781 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#1| (QUOTE (-568)))) (-2781 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#1| (QUOTE (-568)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -419) (QUOTE (-576)))))) (|HasSignature| |#1| (LIST (QUOTE -3581) (LIST (|devaluate| |#1|) (QUOTE (-1195)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -419) (QUOTE (-576)))))) (-2781 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-976))) (|HasCategory| |#1| (QUOTE (-1221))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasSignature| |#1| (LIST (QUOTE -3009) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1195))))) (|HasSignature| |#1| (LIST (QUOTE -1935) (LIST (LIST (QUOTE -656) (QUOTE (-1195))) (|devaluate| |#1|)))))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576)))))) 
+((|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-174))) (-2781 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-568)))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (-12 (|HasCategory| |#1| (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -419) (QUOTE (-576))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -419) (QUOTE (-576))) (|devaluate| |#1|)))) (|HasCategory| (-419 (-576)) (QUOTE (-1131))) (|HasCategory| |#1| (QUOTE (-374))) (-2781 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#1| (QUOTE (-568)))) (-2781 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#1| (QUOTE (-568)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -419) (QUOTE (-576)))))) (|HasSignature| |#1| (LIST (QUOTE -3581) (LIST (|devaluate| |#1|) (QUOTE (-1195)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -419) (QUOTE (-576)))))) (-2781 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-976))) (|HasCategory| |#1| (QUOTE (-1221))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasSignature| |#1| (LIST (QUOTE -4121) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1195))))) (|HasSignature| |#1| (LIST (QUOTE -1934) (LIST (LIST (QUOTE -656) (QUOTE (-1195))) (|devaluate| |#1|)))))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576)))))) 
 (-1271 |Coef| |var| |cen|) 
 ((|constructor| (NIL "Dense Puiseux series in one variable \\indented{2}{\\spadtype{UnivariatePuiseuxSeries} is a domain representing Puiseux} \\indented{2}{series in one variable with coefficients in an arbitrary ring.\\space{2}The} \\indented{2}{parameters of the type specify the coefficient ring,{} the power series} \\indented{2}{variable,{} and the center of the power series expansion.\\space{2}For example,{}} \\indented{2}{\\spad{UnivariatePuiseuxSeries(Integer,x,3)} represents Puiseux series in} \\indented{2}{\\spad{(x - 3)} with \\spadtype{Integer} coefficients.}")) (|integrate| (($ $ (|Variable| |#2|)) "\\spad{integrate(f(x))} returns an anti-derivative of the power series \\spad{f(x)} with constant coefficient 0. We may integrate a series when we can divide coefficients by integers."))) 
 (((-4464 "*") |has| |#1| (-174)) (-4455 |has| |#1| (-568)) (-4460 |has| |#1| (-374)) (-4454 |has| |#1| (-374)) (-4456 . T) (-4457 . T) (-4459 . T)) 
-((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-174))) (-2781 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-568)))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (-12 (|HasCategory| |#1| (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -419) (QUOTE (-576))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -419) (QUOTE (-576))) (|devaluate| |#1|)))) (|HasCategory| (-419 (-576)) (QUOTE (-1131))) (|HasCategory| |#1| (QUOTE (-374))) (-2781 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#1| (QUOTE (-568)))) (-2781 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#1| (QUOTE (-568)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -419) (QUOTE (-576)))))) (|HasSignature| |#1| (LIST (QUOTE -3581) (LIST (|devaluate| |#1|) (QUOTE (-1195)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -419) (QUOTE (-576)))))) (-2781 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-976))) (|HasCategory| |#1| (QUOTE (-1221))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasSignature| |#1| (LIST (QUOTE -3009) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1195))))) (|HasSignature| |#1| (LIST (QUOTE -1935) (LIST (LIST (QUOTE -656) (QUOTE (-1195))) (|devaluate| |#1|))))))) 
+((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| |#1| (QUOTE (-568))) (|HasCategory| |#1| (QUOTE (-174))) (-2781 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-568)))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (-12 (|HasCategory| |#1| (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -419) (QUOTE (-576))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -419) (QUOTE (-576))) (|devaluate| |#1|)))) (|HasCategory| (-419 (-576)) (QUOTE (-1131))) (|HasCategory| |#1| (QUOTE (-374))) (-2781 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#1| (QUOTE (-568)))) (-2781 (|HasCategory| |#1| (QUOTE (-374))) (|HasCategory| |#1| (QUOTE (-568)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -419) (QUOTE (-576)))))) (|HasSignature| |#1| (LIST (QUOTE -3581) (LIST (|devaluate| |#1|) (QUOTE (-1195)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -419) (QUOTE (-576)))))) (-2781 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-976))) (|HasCategory| |#1| (QUOTE (-1221))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasSignature| |#1| (LIST (QUOTE -4121) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1195))))) (|HasSignature| |#1| (LIST (QUOTE -1934) (LIST (LIST (QUOTE -656) (QUOTE (-1195))) (|devaluate| |#1|))))))) 
 (-1272 R FE |var| |cen|) 
 ((|constructor| (NIL "UnivariatePuiseuxSeriesWithExponentialSingularity is a domain used to represent functions with essential singularities. Objects in this domain are sums,{} where each term in the sum is a univariate Puiseux series times the exponential of a univariate Puiseux series. Thus,{} the elements of this domain are sums of expressions of the form \\spad{g(x) * exp(f(x))},{} where \\spad{g}(\\spad{x}) is a univariate Puiseux series and \\spad{f}(\\spad{x}) is a univariate Puiseux series with no terms of non-negative degree.")) (|dominantTerm| (((|Union| (|Record| (|:| |%term| (|Record| (|:| |%coef| (|UnivariatePuiseuxSeries| |#2| |#3| |#4|)) (|:| |%expon| (|ExponentialOfUnivariatePuiseuxSeries| |#2| |#3| |#4|)) (|:| |%expTerms| (|List| (|Record| (|:| |k| (|Fraction| (|Integer|))) (|:| |c| |#2|)))))) (|:| |%type| (|String|))) "failed") $) "\\spad{dominantTerm(f(var))} returns the term that dominates the limiting behavior of \\spad{f(var)} as \\spad{var -> cen+} together with a \\spadtype{String} which briefly describes that behavior. The value of the \\spadtype{String} will be \\spad{\"zero\"} (resp. \\spad{\"infinity\"}) if the term tends to zero (resp. infinity) exponentially and will \\spad{\"series\"} if the term is a Puiseux series.")) (|limitPlus| (((|Union| (|OrderedCompletion| |#2|) "failed") $) "\\spad{limitPlus(f(var))} returns \\spad{limit(var -> cen+,f(var))}."))) 
 (((-4464 "*") |has| (-1271 |#2| |#3| |#4|) (-174)) (-4455 |has| (-1271 |#2| |#3| |#4|) (-568)) (-4456 . T) (-4457 . T) (-4459 . T)) 
@@ -5035,7 +5035,7 @@ NIL
 (-1276 S |Coef|) 
 ((|constructor| (NIL "\\spadtype{UnivariateTaylorSeriesCategory} is the category of Taylor series in one variable.")) (|integrate| (($ $ (|Symbol|)) "\\spad{integrate(f(x),y)} returns an anti-derivative of the power series \\spad{f(x)} with respect to the variable \\spad{y}.") (($ $ (|Symbol|)) "\\spad{integrate(f(x),y)} returns an anti-derivative of the power series \\spad{f(x)} with respect to the variable \\spad{y}.") (($ $) "\\spad{integrate(f(x))} returns an anti-derivative of the power series \\spad{f(x)} with constant coefficient 0. We may integrate a series when we can divide coefficients by integers.")) (** (($ $ |#2|) "\\spad{f(x) ** a} computes a power of a power series. When the coefficient ring is a field,{} we may raise a series to an exponent from the coefficient ring provided that the constant coefficient of the series is 1.")) (|polynomial| (((|Polynomial| |#2|) $ (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{polynomial(f,k1,k2)} returns a polynomial consisting of the sum of all terms of \\spad{f} of degree \\spad{d} with \\spad{k1 <= d <= k2}.") (((|Polynomial| |#2|) $ (|NonNegativeInteger|)) "\\spad{polynomial(f,k)} returns a polynomial consisting of the sum of all terms of \\spad{f} of degree \\spad{<= k}.")) (|multiplyCoefficients| (($ (|Mapping| |#2| (|Integer|)) $) "\\spad{multiplyCoefficients(f,sum(n = 0..infinity,a[n] * x**n))} returns \\spad{sum(n = 0..infinity,f(n) * a[n] * x**n)}. This function is used when Laurent series are represented by a Taylor series and an order.")) (|quoByVar| (($ $) "\\spad{quoByVar(a0 + a1 x + a2 x**2 + ...)} returns \\spad{a1 + a2 x + a3 x**2 + ...} Thus,{} this function substracts the constant term and divides by the series variable. This function is used when Laurent series are represented by a Taylor series and an order.")) (|coefficients| (((|Stream| |#2|) $) "\\spad{coefficients(a0 + a1 x + a2 x**2 + ...)} returns a stream of coefficients: \\spad{[a0,a1,a2,...]}. The entries of the stream may be zero.")) (|series| (($ (|Stream| |#2|)) "\\spad{series([a0,a1,a2,...])} is the Taylor series \\spad{a0 + a1 x + a2 x**2 + ...}.") (($ (|Stream| (|Record| (|:| |k| (|NonNegativeInteger|)) (|:| |c| |#2|)))) "\\spad{series(st)} creates a series from a stream of non-zero terms,{} where a term is an exponent-coefficient pair. The terms in the stream should be ordered by increasing order of exponents."))) 
 NIL 
-((|HasCategory| |#2| (LIST (QUOTE -29) (QUOTE (-576)))) (|HasCategory| |#2| (QUOTE (-976))) (|HasCategory| |#2| (QUOTE (-1221))) (|HasSignature| |#2| (LIST (QUOTE -1935) (LIST (LIST (QUOTE -656) (QUOTE (-1195))) (|devaluate| |#2|)))) (|HasSignature| |#2| (LIST (QUOTE -3009) (LIST (|devaluate| |#2|) (|devaluate| |#2|) (QUOTE (-1195))))) (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| |#2| (QUOTE (-374)))) 
+((|HasCategory| |#2| (LIST (QUOTE -29) (QUOTE (-576)))) (|HasCategory| |#2| (QUOTE (-976))) (|HasCategory| |#2| (QUOTE (-1221))) (|HasSignature| |#2| (LIST (QUOTE -1934) (LIST (LIST (QUOTE -656) (QUOTE (-1195))) (|devaluate| |#2|)))) (|HasSignature| |#2| (LIST (QUOTE -4121) (LIST (|devaluate| |#2|) (|devaluate| |#2|) (QUOTE (-1195))))) (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| |#2| (QUOTE (-374)))) 
 (-1277 |Coef|) 
 ((|constructor| (NIL "\\spadtype{UnivariateTaylorSeriesCategory} is the category of Taylor series in one variable.")) (|integrate| (($ $ (|Symbol|)) "\\spad{integrate(f(x),y)} returns an anti-derivative of the power series \\spad{f(x)} with respect to the variable \\spad{y}.") (($ $ (|Symbol|)) "\\spad{integrate(f(x),y)} returns an anti-derivative of the power series \\spad{f(x)} with respect to the variable \\spad{y}.") (($ $) "\\spad{integrate(f(x))} returns an anti-derivative of the power series \\spad{f(x)} with constant coefficient 0. We may integrate a series when we can divide coefficients by integers.")) (** (($ $ |#1|) "\\spad{f(x) ** a} computes a power of a power series. When the coefficient ring is a field,{} we may raise a series to an exponent from the coefficient ring provided that the constant coefficient of the series is 1.")) (|polynomial| (((|Polynomial| |#1|) $ (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{polynomial(f,k1,k2)} returns a polynomial consisting of the sum of all terms of \\spad{f} of degree \\spad{d} with \\spad{k1 <= d <= k2}.") (((|Polynomial| |#1|) $ (|NonNegativeInteger|)) "\\spad{polynomial(f,k)} returns a polynomial consisting of the sum of all terms of \\spad{f} of degree \\spad{<= k}.")) (|multiplyCoefficients| (($ (|Mapping| |#1| (|Integer|)) $) "\\spad{multiplyCoefficients(f,sum(n = 0..infinity,a[n] * x**n))} returns \\spad{sum(n = 0..infinity,f(n) * a[n] * x**n)}. This function is used when Laurent series are represented by a Taylor series and an order.")) (|quoByVar| (($ $) "\\spad{quoByVar(a0 + a1 x + a2 x**2 + ...)} returns \\spad{a1 + a2 x + a3 x**2 + ...} Thus,{} this function substracts the constant term and divides by the series variable. This function is used when Laurent series are represented by a Taylor series and an order.")) (|coefficients| (((|Stream| |#1|) $) "\\spad{coefficients(a0 + a1 x + a2 x**2 + ...)} returns a stream of coefficients: \\spad{[a0,a1,a2,...]}. The entries of the stream may be zero.")) (|series| (($ (|Stream| |#1|)) "\\spad{series([a0,a1,a2,...])} is the Taylor series \\spad{a0 + a1 x + a2 x**2 + ...}.") (($ (|Stream| (|Record| (|:| |k| (|NonNegativeInteger|)) (|:| |c| |#1|)))) "\\spad{series(st)} creates a series from a stream of non-zero terms,{} where a term is an exponent-coefficient pair. The terms in the stream should be ordered by increasing order of exponents."))) 
 (((-4464 "*") |has| |#1| (-174)) (-4455 |has| |#1| (-568)) (-4456 . T) (-4457 . T) (-4459 . T)) 
@@ -5043,12 +5043,12 @@ NIL
 (-1278 |Coef| |var| |cen|) 
 ((|constructor| (NIL "Dense Taylor series in one variable \\spadtype{UnivariateTaylorSeries} is a domain representing Taylor series in one variable with coefficients in an arbitrary ring. The parameters of the type specify the coefficient ring,{} the power series variable,{} and the center of the power series expansion. For example,{} \\spadtype{UnivariateTaylorSeries}(Integer,{}\\spad{x},{}3) represents Taylor series in \\spad{(x - 3)} with \\spadtype{Integer} coefficients.")) (|integrate| (($ $ (|Variable| |#2|)) "\\spad{integrate(f(x),x)} returns an anti-derivative of the power series \\spad{f(x)} with constant coefficient 0. We may integrate a series when we can divide coefficients by integers.")) (|invmultisect| (($ (|Integer|) (|Integer|) $) "\\spad{invmultisect(a,b,f(x))} substitutes \\spad{x^((a+b)*n)} \\indented{1}{for \\spad{x^n} and multiples by \\spad{x^b}.}")) (|multisect| (($ (|Integer|) (|Integer|) $) "\\spad{multisect(a,b,f(x))} selects the coefficients of \\indented{1}{\\spad{x^((a+b)*n+a)},{} and changes this monomial to \\spad{x^n}.}")) (|revert| (($ $) "\\spad{revert(f(x))} returns a Taylor series \\spad{g(x)} such that \\spad{f(g(x)) = g(f(x)) = x}. Series \\spad{f(x)} should have constant coefficient 0 and invertible 1st order coefficient.")) (|generalLambert| (($ $ (|Integer|) (|Integer|)) "\\spad{generalLambert(f(x),a,d)} returns \\spad{f(x^a) + f(x^(a + d)) + \\indented{1}{f(x^(a + 2 d)) + ... }. \\spad{f(x)} should have zero constant} \\indented{1}{coefficient and \\spad{a} and \\spad{d} should be positive.}")) (|evenlambert| (($ $) "\\spad{evenlambert(f(x))} returns \\spad{f(x^2) + f(x^4) + f(x^6) + ...}. \\indented{1}{\\spad{f(x)} should have a zero constant coefficient.} \\indented{1}{This function is used for computing infinite products.} \\indented{1}{If \\spad{f(x)} is a Taylor series with constant term 1,{} then} \\indented{1}{\\spad{product(n=1..infinity,f(x^(2*n))) = exp(log(evenlambert(f(x))))}.}")) (|oddlambert| (($ $) "\\spad{oddlambert(f(x))} returns \\spad{f(x) + f(x^3) + f(x^5) + ...}. \\indented{1}{\\spad{f(x)} should have a zero constant coefficient.} \\indented{1}{This function is used for computing infinite products.} \\indented{1}{If \\spad{f(x)} is a Taylor series with constant term 1,{} then} \\indented{1}{\\spad{product(n=1..infinity,f(x^(2*n-1)))=exp(log(oddlambert(f(x))))}.}")) (|lambert| (($ $) "\\spad{lambert(f(x))} returns \\spad{f(x) + f(x^2) + f(x^3) + ...}. \\indented{1}{This function is used for computing infinite products.} \\indented{1}{\\spad{f(x)} should have zero constant coefficient.} \\indented{1}{If \\spad{f(x)} is a Taylor series with constant term 1,{} then} \\indented{1}{\\spad{product(n = 1..infinity,f(x^n)) = exp(log(lambert(f(x))))}.}")) (|lagrange| (($ $) "\\spad{lagrange(g(x))} produces the Taylor series for \\spad{f(x)} \\indented{1}{where \\spad{f(x)} is implicitly defined as \\spad{f(x) = x*g(f(x))}.}")) (|univariatePolynomial| (((|UnivariatePolynomial| |#2| |#1|) $ (|NonNegativeInteger|)) "\\spad{univariatePolynomial(f,k)} returns a univariate polynomial \\indented{1}{consisting of the sum of all terms of \\spad{f} of degree \\spad{<= k}.}")) (|coerce| (($ (|Variable| |#2|)) "\\spad{coerce(var)} converts the series variable \\spad{var} into a \\indented{1}{Taylor series.}") (($ (|UnivariatePolynomial| |#2| |#1|)) "\\spad{coerce(p)} converts a univariate polynomial \\spad{p} in the variable \\spad{var} to a univariate Taylor series in \\spad{var}."))) 
 (((-4464 "*") |has| |#1| (-174)) (-4455 |has| |#1| (-568)) (-4456 . T) (-4457 . T) (-4459 . T)) 
-((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| |#1| (QUOTE (-568))) (-2781 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-568)))) (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (-12 (|HasCategory| |#1| (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-783)) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-783)) (|devaluate| |#1|)))) (|HasCategory| (-783) (QUOTE (-1131))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-783))))) (|HasSignature| |#1| (LIST (QUOTE -3581) (LIST (|devaluate| |#1|) (QUOTE (-1195)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-783))))) (|HasCategory| |#1| (QUOTE (-374))) (-2781 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-976))) (|HasCategory| |#1| (QUOTE (-1221))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasSignature| |#1| (LIST (QUOTE -3009) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1195))))) (|HasSignature| |#1| (LIST (QUOTE -1935) (LIST (LIST (QUOTE -656) (QUOTE (-1195))) (|devaluate| |#1|))))))) 
+((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasCategory| |#1| (QUOTE (-568))) (-2781 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-568)))) (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (-12 (|HasCategory| |#1| (LIST (QUOTE -915) (QUOTE (-1195)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-783)) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-783)) (|devaluate| |#1|)))) (|HasCategory| (-783) (QUOTE (-1131))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-783))))) (|HasSignature| |#1| (LIST (QUOTE -3581) (LIST (|devaluate| |#1|) (QUOTE (-1195)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-783))))) (|HasCategory| |#1| (QUOTE (-374))) (-2781 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-576)))) (|HasCategory| |#1| (QUOTE (-976))) (|HasCategory| |#1| (QUOTE (-1221))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -419) (QUOTE (-576))))) (|HasSignature| |#1| (LIST (QUOTE -4121) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1195))))) (|HasSignature| |#1| (LIST (QUOTE -1934) (LIST (LIST (QUOTE -656) (QUOTE (-1195))) (|devaluate| |#1|))))))) 
 (-1279 |Coef| UTS) 
 ((|constructor| (NIL "\\indented{1}{This package provides Taylor series solutions to regular} linear or non-linear ordinary differential equations of arbitrary order.")) (|mpsode| (((|List| |#2|) (|List| |#1|) (|List| (|Mapping| |#2| (|List| |#2|)))) "\\spad{mpsode(r,f)} solves the system of differential equations \\spad{dy[i]/dx =f[i] [x,y[1],y[2],...,y[n]]},{} \\spad{y[i](a) = r[i]} for \\spad{i} in 1..\\spad{n}.")) (|ode| ((|#2| (|Mapping| |#2| (|List| |#2|)) (|List| |#1|)) "\\spad{ode(f,cl)} is the solution to \\spad{y<n>=f(y,y',..,y<n-1>)} such that \\spad{y<i>(a) = cl.i} for \\spad{i} in 1..\\spad{n}.")) (|ode2| ((|#2| (|Mapping| |#2| |#2| |#2|) |#1| |#1|) "\\spad{ode2(f,c0,c1)} is the solution to \\spad{y'' = f(y,y')} such that \\spad{y(a) = c0} and \\spad{y'(a) = c1}.")) (|ode1| ((|#2| (|Mapping| |#2| |#2|) |#1|) "\\spad{ode1(f,c)} is the solution to \\spad{y' = f(y)} such that \\spad{y(a) = c}.")) (|fixedPointExquo| ((|#2| |#2| |#2|) "\\spad{fixedPointExquo(f,g)} computes the exact quotient of \\spad{f} and \\spad{g} using a fixed point computation.")) (|stFuncN| (((|Mapping| (|Stream| |#1|) (|List| (|Stream| |#1|))) (|Mapping| |#2| (|List| |#2|))) "\\spad{stFuncN(f)} is a local function xported due to compiler problem. This function is of no interest to the top-level user.")) (|stFunc2| (((|Mapping| (|Stream| |#1|) (|Stream| |#1|) (|Stream| |#1|)) (|Mapping| |#2| |#2| |#2|)) "\\spad{stFunc2(f)} is a local function exported due to compiler problem. This function is of no interest to the top-level user.")) (|stFunc1| (((|Mapping| (|Stream| |#1|) (|Stream| |#1|)) (|Mapping| |#2| |#2|)) "\\spad{stFunc1(f)} is a local function exported due to compiler problem. This function is of no interest to the top-level user."))) 
 NIL 
 NIL 
-(-1280 -1967 UP L UTS) 
+(-1280 -1966 UP L UTS) 
 ((|constructor| (NIL "\\spad{RUTSodetools} provides tools to interface with the series \\indented{1}{ODE solver when presented with linear ODEs.}")) (RF2UTS ((|#4| (|Fraction| |#2|)) "\\spad{RF2UTS(f)} converts \\spad{f} to a Taylor series.")) (LODO2FUN (((|Mapping| |#4| (|List| |#4|)) |#3|) "\\spad{LODO2FUN(op)} returns the function to pass to the series ODE solver in order to solve \\spad{op y = 0}.")) (UTS2UP ((|#2| |#4| (|NonNegativeInteger|)) "\\spad{UTS2UP(s, n)} converts the first \\spad{n} terms of \\spad{s} to a univariate polynomial.")) (UP2UTS ((|#4| |#2|) "\\spad{UP2UTS(p)} converts \\spad{p} to a Taylor series."))) 
 NIL 
 ((|HasCategory| |#1| (QUOTE (-568)))) 
@@ -5108,7 +5108,7 @@ NIL
 ((|constructor| (NIL "This package implements the Weierstrass preparation theorem \\spad{f} or multivariate power series. weierstrass(\\spad{v},{}\\spad{p}) where \\spad{v} is a variable,{} and \\spad{p} is a TaylorSeries(\\spad{R}) in which the terms of lowest degree \\spad{s} must include c*v**s where \\spad{c} is a constant,{}\\spad{s>0},{} is a list of TaylorSeries coefficients A[\\spad{i}] of the equivalent polynomial A = A[0] + A[1]\\spad{*v} + A[2]*v**2 + ... + A[\\spad{s}-1]*v**(\\spad{s}-1) + v**s such that p=A*B ,{} \\spad{B} being a TaylorSeries of minimum degree 0")) (|qqq| (((|Mapping| (|Stream| (|TaylorSeries| |#1|)) (|Stream| (|TaylorSeries| |#1|))) (|NonNegativeInteger|) (|TaylorSeries| |#1|) (|Stream| (|TaylorSeries| |#1|))) "\\spad{qqq(n,s,st)} is used internally.")) (|weierstrass| (((|List| (|TaylorSeries| |#1|)) (|Symbol|) (|TaylorSeries| |#1|)) "\\spad{weierstrass(v,ts)} where \\spad{v} is a variable and \\spad{ts} is \\indented{1}{a TaylorSeries,{} impements the Weierstrass Preparation} \\indented{1}{Theorem. The result is a list of TaylorSeries that} \\indented{1}{are the coefficients of the equivalent series.}")) (|clikeUniv| (((|Mapping| (|SparseUnivariatePolynomial| (|Polynomial| |#1|)) (|Polynomial| |#1|)) (|Symbol|)) "\\spad{clikeUniv(v)} is used internally.")) (|sts2stst| (((|Stream| (|Stream| (|Polynomial| |#1|))) (|Symbol|) (|Stream| (|Polynomial| |#1|))) "\\spad{sts2stst(v,s)} is used internally.")) (|cfirst| (((|Mapping| (|Stream| (|Polynomial| |#1|)) (|Stream| (|Polynomial| |#1|))) (|NonNegativeInteger|)) "\\spad{cfirst n} is used internally.")) (|crest| (((|Mapping| (|Stream| (|Polynomial| |#1|)) (|Stream| (|Polynomial| |#1|))) (|NonNegativeInteger|)) "\\spad{crest n} is used internally."))) 
 NIL 
 NIL 
-(-1295 K R UP -1967) 
+(-1295 K R UP -1966) 
 ((|constructor| (NIL "In this package \\spad{K} is a finite field,{} \\spad{R} is a ring of univariate polynomials over \\spad{K},{} and \\spad{F} is a framed algebra over \\spad{R}. The package provides a function to compute the integral closure of \\spad{R} in the quotient field of \\spad{F} as well as a function to compute a \"local integral basis\" at a specific prime.")) (|localIntegralBasis| (((|Record| (|:| |basis| (|Matrix| |#2|)) (|:| |basisDen| |#2|) (|:| |basisInv| (|Matrix| |#2|))) |#2|) "\\spad{integralBasis(p)} returns a record \\spad{[basis,basisDen,basisInv]} containing information regarding the local integral closure of \\spad{R} at the prime \\spad{p} in the quotient field of \\spad{F},{} where \\spad{F} is a framed algebra with \\spad{R}-module basis \\spad{w1,w2,...,wn}. If \\spad{basis} is the matrix \\spad{(aij, i = 1..n, j = 1..n)},{} then the \\spad{i}th element of the local integral basis is \\spad{vi = (1/basisDen) * sum(aij * wj, j = 1..n)},{} \\spadignore{i.e.} the \\spad{i}th row of \\spad{basis} contains the coordinates of the \\spad{i}th basis vector. Similarly,{} the \\spad{i}th row of the matrix \\spad{basisInv} contains the coordinates of \\spad{wi} with respect to the basis \\spad{v1,...,vn}: if \\spad{basisInv} is the matrix \\spad{(bij, i = 1..n, j = 1..n)},{} then \\spad{wi = sum(bij * vj, j = 1..n)}.")) (|integralBasis| (((|Record| (|:| |basis| (|Matrix| |#2|)) (|:| |basisDen| |#2|) (|:| |basisInv| (|Matrix| |#2|)))) "\\spad{integralBasis()} returns a record \\spad{[basis,basisDen,basisInv]} containing information regarding the integral closure of \\spad{R} in the quotient field of \\spad{F},{} where \\spad{F} is a framed algebra with \\spad{R}-module basis \\spad{w1,w2,...,wn}. If \\spad{basis} is the matrix \\spad{(aij, i = 1..n, j = 1..n)},{} then the \\spad{i}th element of the integral basis is \\spad{vi = (1/basisDen) * sum(aij * wj, j = 1..n)},{} \\spadignore{i.e.} the \\spad{i}th row of \\spad{basis} contains the coordinates of the \\spad{i}th basis vector. Similarly,{} the \\spad{i}th row of the matrix \\spad{basisInv} contains the coordinates of \\spad{wi} with respect to the basis \\spad{v1,...,vn}: if \\spad{basisInv} is the matrix \\spad{(bij, i = 1..n, j = 1..n)},{} then \\spad{wi = sum(bij * vj, j = 1..n)}."))) 
 NIL 
 NIL 
@@ -5144,11 +5144,11 @@ NIL
 ((|constructor| (NIL "This category specifies opeations for polynomials and formal series with non-commutative variables.")) (|varList| (((|List| |#1|) $) "\\spad{varList(x)} returns the list of variables which appear in \\spad{x}.")) (|map| (($ (|Mapping| |#2| |#2|) $) "\\spad{map(fn,x)} returns \\spad{Sum(fn(r_i) w_i)} if \\spad{x} writes \\spad{Sum(r_i w_i)}.")) (|sh| (($ $ (|NonNegativeInteger|)) "\\spad{sh(x,n)} returns the shuffle power of \\spad{x} to the \\spad{n}.") (($ $ $) "\\spad{sh(x,y)} returns the shuffle-product of \\spad{x} by \\spad{y}. This multiplication is associative and commutative.")) (|quasiRegular| (($ $) "\\spad{quasiRegular(x)} return \\spad{x} minus its constant term.")) (|quasiRegular?| (((|Boolean|) $) "\\spad{quasiRegular?(x)} return \\spad{true} if \\spad{constant(x)} is zero.")) (|constant| ((|#2| $) "\\spad{constant(x)} returns the constant term of \\spad{x}.")) (|constant?| (((|Boolean|) $) "\\spad{constant?(x)} returns \\spad{true} if \\spad{x} is constant.")) (|coerce| (($ |#1|) "\\spad{coerce(v)} returns \\spad{v}.")) (|mirror| (($ $) "\\spad{mirror(x)} returns \\spad{Sum(r_i mirror(w_i))} if \\spad{x} writes \\spad{Sum(r_i w_i)}.")) (|monomial?| (((|Boolean|) $) "\\spad{monomial?(x)} returns \\spad{true} if \\spad{x} is a monomial")) (|monom| (($ (|OrderedFreeMonoid| |#1|) |#2|) "\\spad{monom(w,r)} returns the product of the word \\spad{w} by the coefficient \\spad{r}.")) (|rquo| (($ $ $) "\\spad{rquo(x,y)} returns the right simplification of \\spad{x} by \\spad{y}.") (($ $ (|OrderedFreeMonoid| |#1|)) "\\spad{rquo(x,w)} returns the right simplification of \\spad{x} by \\spad{w}.") (($ $ |#1|) "\\spad{rquo(x,v)} returns the right simplification of \\spad{x} by the variable \\spad{v}.")) (|lquo| (($ $ $) "\\spad{lquo(x,y)} returns the left simplification of \\spad{x} by \\spad{y}.") (($ $ (|OrderedFreeMonoid| |#1|)) "\\spad{lquo(x,w)} returns the left simplification of \\spad{x} by the word \\spad{w}.") (($ $ |#1|) "\\spad{lquo(x,v)} returns the left simplification of \\spad{x} by the variable \\spad{v}.")) (|coef| ((|#2| $ $) "\\spad{coef(x,y)} returns scalar product of \\spad{x} by \\spad{y},{} the set of words being regarded as an orthogonal basis.") ((|#2| $ (|OrderedFreeMonoid| |#1|)) "\\spad{coef(x,w)} returns the coefficient of the word \\spad{w} in \\spad{x}.")) (|mindegTerm| (((|Record| (|:| |k| (|OrderedFreeMonoid| |#1|)) (|:| |c| |#2|)) $) "\\spad{mindegTerm(x)} returns the term whose word is \\spad{mindeg(x)}.")) (|mindeg| (((|OrderedFreeMonoid| |#1|) $) "\\spad{mindeg(x)} returns the little word which appears in \\spad{x}. Error if \\spad{x=0}.")) (* (($ $ |#2|) "\\spad{x * r} returns the product of \\spad{x} by \\spad{r}. Usefull if \\spad{R} is a non-commutative Ring.") (($ |#1| $) "\\spad{v * x} returns the product of a variable \\spad{x} by \\spad{x}."))) 
 ((-4455 |has| |#2| (-6 -4455)) (-4457 . T) (-4456 . T) (-4459 . T)) 
 NIL 
-(-1304 S -1967) 
+(-1304 S -1966) 
 ((|constructor| (NIL "ExtensionField {\\em F} is the category of fields which extend the field \\spad{F}")) (|Frobenius| (($ $ (|NonNegativeInteger|)) "\\spad{Frobenius(a,s)} returns \\spad{a**(q**s)} where \\spad{q} is the size()\\$\\spad{F}.") (($ $) "\\spad{Frobenius(a)} returns \\spad{a ** q} where \\spad{q} is the \\spad{size()\\$F}.")) (|transcendenceDegree| (((|NonNegativeInteger|)) "\\spad{transcendenceDegree()} returns the transcendence degree of the field extension,{} 0 if the extension is algebraic.")) (|extensionDegree| (((|OnePointCompletion| (|PositiveInteger|))) "\\spad{extensionDegree()} returns the degree of the field extension if the extension is algebraic,{} and \\spad{infinity} if it is not.")) (|degree| (((|OnePointCompletion| (|PositiveInteger|)) $) "\\spad{degree(a)} returns the degree of minimal polynomial of an element \\spad{a} if \\spad{a} is algebraic with respect to the ground field \\spad{F},{} and \\spad{infinity} otherwise.")) (|inGroundField?| (((|Boolean|) $) "\\spad{inGroundField?(a)} tests whether an element \\spad{a} is already in the ground field \\spad{F}.")) (|transcendent?| (((|Boolean|) $) "\\spad{transcendent?(a)} tests whether an element \\spad{a} is transcendent with respect to the ground field \\spad{F}.")) (|algebraic?| (((|Boolean|) $) "\\spad{algebraic?(a)} tests whether an element \\spad{a} is algebraic with respect to the ground field \\spad{F}."))) 
 NIL 
 ((|HasCategory| |#2| (QUOTE (-379))) (|HasCategory| |#2| (QUOTE (-146))) (|HasCategory| |#2| (QUOTE (-148)))) 
-(-1305 -1967) 
+(-1305 -1966) 
 ((|constructor| (NIL "ExtensionField {\\em F} is the category of fields which extend the field \\spad{F}")) (|Frobenius| (($ $ (|NonNegativeInteger|)) "\\spad{Frobenius(a,s)} returns \\spad{a**(q**s)} where \\spad{q} is the size()\\$\\spad{F}.") (($ $) "\\spad{Frobenius(a)} returns \\spad{a ** q} where \\spad{q} is the \\spad{size()\\$F}.")) (|transcendenceDegree| (((|NonNegativeInteger|)) "\\spad{transcendenceDegree()} returns the transcendence degree of the field extension,{} 0 if the extension is algebraic.")) (|extensionDegree| (((|OnePointCompletion| (|PositiveInteger|))) "\\spad{extensionDegree()} returns the degree of the field extension if the extension is algebraic,{} and \\spad{infinity} if it is not.")) (|degree| (((|OnePointCompletion| (|PositiveInteger|)) $) "\\spad{degree(a)} returns the degree of minimal polynomial of an element \\spad{a} if \\spad{a} is algebraic with respect to the ground field \\spad{F},{} and \\spad{infinity} otherwise.")) (|inGroundField?| (((|Boolean|) $) "\\spad{inGroundField?(a)} tests whether an element \\spad{a} is already in the ground field \\spad{F}.")) (|transcendent?| (((|Boolean|) $) "\\spad{transcendent?(a)} tests whether an element \\spad{a} is transcendent with respect to the ground field \\spad{F}.")) (|algebraic?| (((|Boolean|) $) "\\spad{algebraic?(a)} tests whether an element \\spad{a} is algebraic with respect to the ground field \\spad{F}."))) 
 ((-4454 . T) (-4460 . T) (-4455 . T) ((-4464 "*") . T) (-4456 . T) (-4457 . T) (-4459 . T)) 
 NIL 
@@ -5208,4 +5208,4 @@ NIL
 NIL 
 NIL 
 NIL 
-((-3 NIL 2292758 2292763 2292768 2292773) (-2 NIL 2292738 2292743 2292748 2292753) (-1 NIL 2292718 2292723 2292728 2292733) (0 NIL 2292698 2292703 2292708 2292713) (-1315 "ZMOD.spad" 2292507 2292520 2292636 2292693) (-1314 "ZLINDEP.spad" 2291573 2291584 2292497 2292502) (-1313 "ZDSOLVE.spad" 2281518 2281540 2291563 2291568) (-1312 "YSTREAM.spad" 2281013 2281024 2281508 2281513) (-1311 "YDIAGRAM.spad" 2280647 2280656 2281003 2281008) (-1310 "XRPOLY.spad" 2279867 2279887 2280503 2280572) (-1309 "XPR.spad" 2277662 2277675 2279585 2279684) (-1308 "XPOLY.spad" 2277217 2277228 2277518 2277587) (-1307 "XPOLYC.spad" 2276536 2276552 2277143 2277212) (-1306 "XPBWPOLY.spad" 2274973 2274993 2276316 2276385) (-1305 "XF.spad" 2273436 2273451 2274875 2274968) (-1304 "XF.spad" 2271879 2271896 2273320 2273325) (-1303 "XFALG.spad" 2268927 2268943 2271805 2271874) (-1302 "XEXPPKG.spad" 2268178 2268204 2268917 2268922) (-1301 "XDPOLY.spad" 2267792 2267808 2268034 2268103) (-1300 "XALG.spad" 2267452 2267463 2267748 2267787) (-1299 "WUTSET.spad" 2263255 2263272 2267062 2267089) (-1298 "WP.spad" 2262454 2262498 2263113 2263180) (-1297 "WHILEAST.spad" 2262252 2262261 2262444 2262449) (-1296 "WHEREAST.spad" 2261923 2261932 2262242 2262247) (-1295 "WFFINTBS.spad" 2259586 2259608 2261913 2261918) (-1294 "WEIER.spad" 2257808 2257819 2259576 2259581) (-1293 "VSPACE.spad" 2257481 2257492 2257776 2257803) (-1292 "VSPACE.spad" 2257174 2257187 2257471 2257476) (-1291 "VOID.spad" 2256851 2256860 2257164 2257169) (-1290 "VIEW.spad" 2254531 2254540 2256841 2256846) (-1289 "VIEWDEF.spad" 2249732 2249741 2254521 2254526) (-1288 "VIEW3D.spad" 2233693 2233702 2249722 2249727) (-1287 "VIEW2D.spad" 2221584 2221593 2233683 2233688) (-1286 "VECTOR.spad" 2220105 2220116 2220356 2220383) (-1285 "VECTOR2.spad" 2218744 2218757 2220095 2220100) (-1284 "VECTCAT.spad" 2216648 2216659 2218712 2218739) (-1283 "VECTCAT.spad" 2214359 2214372 2216425 2216430) (-1282 "VARIABLE.spad" 2214139 2214154 2214349 2214354) (-1281 "UTYPE.spad" 2213783 2213792 2214129 2214134) (-1280 "UTSODETL.spad" 2213078 2213102 2213739 2213744) (-1279 "UTSODE.spad" 2211294 2211314 2213068 2213073) (-1278 "UTS.spad" 2206241 2206269 2209761 2209858) (-1277 "UTSCAT.spad" 2203720 2203736 2206139 2206236) (-1276 "UTSCAT.spad" 2200843 2200861 2203264 2203269) (-1275 "UTS2.spad" 2200438 2200473 2200833 2200838) (-1274 "URAGG.spad" 2195111 2195122 2200428 2200433) (-1273 "URAGG.spad" 2189748 2189761 2195067 2195072) (-1272 "UPXSSING.spad" 2187393 2187419 2188829 2188962) (-1271 "UPXS.spad" 2184689 2184717 2185525 2185674) (-1270 "UPXSCONS.spad" 2182448 2182468 2182821 2182970) (-1269 "UPXSCCA.spad" 2181019 2181039 2182294 2182443) (-1268 "UPXSCCA.spad" 2179732 2179754 2181009 2181014) (-1267 "UPXSCAT.spad" 2178321 2178337 2179578 2179727) (-1266 "UPXS2.spad" 2177864 2177917 2178311 2178316) (-1265 "UPSQFREE.spad" 2176278 2176292 2177854 2177859) (-1264 "UPSCAT.spad" 2174065 2174089 2176176 2176273) (-1263 "UPSCAT.spad" 2171558 2171584 2173671 2173676) (-1262 "UPOLYC.spad" 2166598 2166609 2171400 2171553) (-1261 "UPOLYC.spad" 2161530 2161543 2166334 2166339) (-1260 "UPOLYC2.spad" 2161001 2161020 2161520 2161525) (-1259 "UP.spad" 2158107 2158122 2158494 2158647) (-1258 "UPMP.spad" 2157007 2157020 2158097 2158102) (-1257 "UPDIVP.spad" 2156572 2156586 2156997 2157002) (-1256 "UPDECOMP.spad" 2154817 2154831 2156562 2156567) (-1255 "UPCDEN.spad" 2154026 2154042 2154807 2154812) (-1254 "UP2.spad" 2153390 2153411 2154016 2154021) (-1253 "UNISEG.spad" 2152743 2152754 2153309 2153314) (-1252 "UNISEG2.spad" 2152240 2152253 2152699 2152704) (-1251 "UNIFACT.spad" 2151343 2151355 2152230 2152235) (-1250 "ULS.spad" 2141127 2141155 2142072 2142501) (-1249 "ULSCONS.spad" 2132261 2132281 2132631 2132780) (-1248 "ULSCCAT.spad" 2129998 2130018 2132107 2132256) (-1247 "ULSCCAT.spad" 2127843 2127865 2129954 2129959) (-1246 "ULSCAT.spad" 2126075 2126091 2127689 2127838) (-1245 "ULS2.spad" 2125589 2125642 2126065 2126070) (-1244 "UINT8.spad" 2125466 2125475 2125579 2125584) (-1243 "UINT64.spad" 2125342 2125351 2125456 2125461) (-1242 "UINT32.spad" 2125218 2125227 2125332 2125337) (-1241 "UINT16.spad" 2125094 2125103 2125208 2125213) (-1240 "UFD.spad" 2124159 2124168 2125020 2125089) (-1239 "UFD.spad" 2123286 2123297 2124149 2124154) (-1238 "UDVO.spad" 2122167 2122176 2123276 2123281) (-1237 "UDPO.spad" 2119660 2119671 2122123 2122128) (-1236 "TYPE.spad" 2119592 2119601 2119650 2119655) (-1235 "TYPEAST.spad" 2119511 2119520 2119582 2119587) (-1234 "TWOFACT.spad" 2118163 2118178 2119501 2119506) (-1233 "TUPLE.spad" 2117649 2117660 2118062 2118067) (-1232 "TUBETOOL.spad" 2114516 2114525 2117639 2117644) (-1231 "TUBE.spad" 2113163 2113180 2114506 2114511) (-1230 "TS.spad" 2111762 2111778 2112728 2112825) (-1229 "TSETCAT.spad" 2098889 2098906 2111730 2111757) (-1228 "TSETCAT.spad" 2086002 2086021 2098845 2098850) (-1227 "TRMANIP.spad" 2080368 2080385 2085708 2085713) (-1226 "TRIMAT.spad" 2079331 2079356 2080358 2080363) (-1225 "TRIGMNIP.spad" 2077858 2077875 2079321 2079326) (-1224 "TRIGCAT.spad" 2077370 2077379 2077848 2077853) (-1223 "TRIGCAT.spad" 2076880 2076891 2077360 2077365) (-1222 "TREE.spad" 2075338 2075349 2076370 2076397) (-1221 "TRANFUN.spad" 2075177 2075186 2075328 2075333) (-1220 "TRANFUN.spad" 2075014 2075025 2075167 2075172) (-1219 "TOPSP.spad" 2074688 2074697 2075004 2075009) (-1218 "TOOLSIGN.spad" 2074351 2074362 2074678 2074683) (-1217 "TEXTFILE.spad" 2072912 2072921 2074341 2074346) (-1216 "TEX.spad" 2070058 2070067 2072902 2072907) (-1215 "TEX1.spad" 2069614 2069625 2070048 2070053) (-1214 "TEMUTL.spad" 2069169 2069178 2069604 2069609) (-1213 "TBCMPPK.spad" 2067262 2067285 2069159 2069164) (-1212 "TBAGG.spad" 2066312 2066335 2067242 2067257) (-1211 "TBAGG.spad" 2065370 2065395 2066302 2066307) (-1210 "TANEXP.spad" 2064778 2064789 2065360 2065365) (-1209 "TALGOP.spad" 2064502 2064513 2064768 2064773) (-1208 "TABLE.spad" 2062471 2062494 2062741 2062768) (-1207 "TABLEAU.spad" 2061952 2061963 2062461 2062466) (-1206 "TABLBUMP.spad" 2058755 2058766 2061942 2061947) (-1205 "SYSTEM.spad" 2057983 2057992 2058745 2058750) (-1204 "SYSSOLP.spad" 2055466 2055477 2057973 2057978) (-1203 "SYSPTR.spad" 2055365 2055374 2055456 2055461) (-1202 "SYSNNI.spad" 2054547 2054558 2055355 2055360) (-1201 "SYSINT.spad" 2053951 2053962 2054537 2054542) (-1200 "SYNTAX.spad" 2050157 2050166 2053941 2053946) (-1199 "SYMTAB.spad" 2048225 2048234 2050147 2050152) (-1198 "SYMS.spad" 2044248 2044257 2048215 2048220) (-1197 "SYMPOLY.spad" 2043255 2043266 2043337 2043464) (-1196 "SYMFUNC.spad" 2042756 2042767 2043245 2043250) (-1195 "SYMBOL.spad" 2040259 2040268 2042746 2042751) (-1194 "SWITCH.spad" 2037030 2037039 2040249 2040254) (-1193 "SUTS.spad" 2034078 2034106 2035497 2035594) (-1192 "SUPXS.spad" 2031361 2031389 2032210 2032359) (-1191 "SUP.spad" 2028081 2028092 2028854 2029007) (-1190 "SUPFRACF.spad" 2027186 2027204 2028071 2028076) (-1189 "SUP2.spad" 2026578 2026591 2027176 2027181) (-1188 "SUMRF.spad" 2025552 2025563 2026568 2026573) (-1187 "SUMFS.spad" 2025189 2025206 2025542 2025547) (-1186 "SULS.spad" 2014960 2014988 2015918 2016347) (-1185 "SUCHTAST.spad" 2014729 2014738 2014950 2014955) (-1184 "SUCH.spad" 2014411 2014426 2014719 2014724) (-1183 "SUBSPACE.spad" 2006526 2006541 2014401 2014406) (-1182 "SUBRESP.spad" 2005696 2005710 2006482 2006487) (-1181 "STTF.spad" 2001795 2001811 2005686 2005691) (-1180 "STTFNC.spad" 1998263 1998279 2001785 2001790) (-1179 "STTAYLOR.spad" 1990898 1990909 1998144 1998149) (-1178 "STRTBL.spad" 1988949 1988966 1989098 1989125) (-1177 "STRING.spad" 1987736 1987745 1987957 1987984) (-1176 "STREAM.spad" 1984537 1984548 1987144 1987159) (-1175 "STREAM3.spad" 1984110 1984125 1984527 1984532) (-1174 "STREAM2.spad" 1983238 1983251 1984100 1984105) (-1173 "STREAM1.spad" 1982944 1982955 1983228 1983233) (-1172 "STINPROD.spad" 1981880 1981896 1982934 1982939) (-1171 "STEP.spad" 1981081 1981090 1981870 1981875) (-1170 "STEPAST.spad" 1980315 1980324 1981071 1981076) (-1169 "STBL.spad" 1978399 1978427 1978566 1978581) (-1168 "STAGG.spad" 1977474 1977485 1978389 1978394) (-1167 "STAGG.spad" 1976547 1976560 1977464 1977469) (-1166 "STACK.spad" 1975787 1975798 1976037 1976064) (-1165 "SREGSET.spad" 1973455 1973472 1975397 1975424) (-1164 "SRDCMPK.spad" 1972016 1972036 1973445 1973450) (-1163 "SRAGG.spad" 1967159 1967168 1971984 1972011) (-1162 "SRAGG.spad" 1962322 1962333 1967149 1967154) (-1161 "SQMATRIX.spad" 1959865 1959883 1960781 1960868) (-1160 "SPLTREE.spad" 1954261 1954274 1959145 1959172) (-1159 "SPLNODE.spad" 1950849 1950862 1954251 1954256) (-1158 "SPFCAT.spad" 1949658 1949667 1950839 1950844) (-1157 "SPECOUT.spad" 1948210 1948219 1949648 1949653) (-1156 "SPADXPT.spad" 1939805 1939814 1948200 1948205) (-1155 "spad-parser.spad" 1939270 1939279 1939795 1939800) (-1154 "SPADAST.spad" 1938971 1938980 1939260 1939265) (-1153 "SPACEC.spad" 1923170 1923181 1938961 1938966) (-1152 "SPACE3.spad" 1922946 1922957 1923160 1923165) (-1151 "SORTPAK.spad" 1922495 1922508 1922902 1922907) (-1150 "SOLVETRA.spad" 1920258 1920269 1922485 1922490) (-1149 "SOLVESER.spad" 1918786 1918797 1920248 1920253) (-1148 "SOLVERAD.spad" 1914812 1914823 1918776 1918781) (-1147 "SOLVEFOR.spad" 1913274 1913292 1914802 1914807) (-1146 "SNTSCAT.spad" 1912874 1912891 1913242 1913269) (-1145 "SMTS.spad" 1911146 1911172 1912439 1912536) (-1144 "SMP.spad" 1908621 1908641 1909011 1909138) (-1143 "SMITH.spad" 1907466 1907491 1908611 1908616) (-1142 "SMATCAT.spad" 1905576 1905606 1907410 1907461) (-1141 "SMATCAT.spad" 1903618 1903650 1905454 1905459) (-1140 "SKAGG.spad" 1902581 1902592 1903586 1903613) (-1139 "SINT.spad" 1901521 1901530 1902447 1902576) (-1138 "SIMPAN.spad" 1901249 1901258 1901511 1901516) (-1137 "SIG.spad" 1900579 1900588 1901239 1901244) (-1136 "SIGNRF.spad" 1899697 1899708 1900569 1900574) (-1135 "SIGNEF.spad" 1898976 1898993 1899687 1899692) (-1134 "SIGAST.spad" 1898361 1898370 1898966 1898971) (-1133 "SHP.spad" 1896289 1896304 1898317 1898322) (-1132 "SHDP.spad" 1883967 1883994 1884476 1884575) (-1131 "SGROUP.spad" 1883575 1883584 1883957 1883962) (-1130 "SGROUP.spad" 1883181 1883192 1883565 1883570) (-1129 "SGCF.spad" 1876320 1876329 1883171 1883176) (-1128 "SFRTCAT.spad" 1875250 1875267 1876288 1876315) (-1127 "SFRGCD.spad" 1874313 1874333 1875240 1875245) (-1126 "SFQCMPK.spad" 1868950 1868970 1874303 1874308) (-1125 "SFORT.spad" 1868389 1868403 1868940 1868945) (-1124 "SEXOF.spad" 1868232 1868272 1868379 1868384) (-1123 "SEX.spad" 1868124 1868133 1868222 1868227) (-1122 "SEXCAT.spad" 1865896 1865936 1868114 1868119) (-1121 "SET.spad" 1864184 1864195 1865281 1865320) (-1120 "SETMN.spad" 1862634 1862651 1864174 1864179) (-1119 "SETCAT.spad" 1861956 1861965 1862624 1862629) (-1118 "SETCAT.spad" 1861276 1861287 1861946 1861951) (-1117 "SETAGG.spad" 1857825 1857836 1861256 1861271) (-1116 "SETAGG.spad" 1854382 1854395 1857815 1857820) (-1115 "SEQAST.spad" 1854085 1854094 1854372 1854377) (-1114 "SEGXCAT.spad" 1853241 1853254 1854075 1854080) (-1113 "SEG.spad" 1853054 1853065 1853160 1853165) (-1112 "SEGCAT.spad" 1851979 1851990 1853044 1853049) (-1111 "SEGBIND.spad" 1851737 1851748 1851926 1851931) (-1110 "SEGBIND2.spad" 1851435 1851448 1851727 1851732) (-1109 "SEGAST.spad" 1851149 1851158 1851425 1851430) (-1108 "SEG2.spad" 1850584 1850597 1851105 1851110) (-1107 "SDVAR.spad" 1849860 1849871 1850574 1850579) (-1106 "SDPOL.spad" 1847193 1847204 1847484 1847611) (-1105 "SCPKG.spad" 1845282 1845293 1847183 1847188) (-1104 "SCOPE.spad" 1844435 1844444 1845272 1845277) (-1103 "SCACHE.spad" 1843131 1843142 1844425 1844430) (-1102 "SASTCAT.spad" 1843040 1843049 1843121 1843126) (-1101 "SAOS.spad" 1842912 1842921 1843030 1843035) (-1100 "SAERFFC.spad" 1842625 1842645 1842902 1842907) (-1099 "SAE.spad" 1840095 1840111 1840706 1840841) (-1098 "SAEFACT.spad" 1839796 1839816 1840085 1840090) (-1097 "RURPK.spad" 1837455 1837471 1839786 1839791) (-1096 "RULESET.spad" 1836908 1836932 1837445 1837450) (-1095 "RULE.spad" 1835148 1835172 1836898 1836903) (-1094 "RULECOLD.spad" 1835000 1835013 1835138 1835143) (-1093 "RTVALUE.spad" 1834735 1834744 1834990 1834995) (-1092 "RSTRCAST.spad" 1834452 1834461 1834725 1834730) (-1091 "RSETGCD.spad" 1830830 1830850 1834442 1834447) (-1090 "RSETCAT.spad" 1820766 1820783 1830798 1830825) (-1089 "RSETCAT.spad" 1810722 1810741 1820756 1820761) (-1088 "RSDCMPK.spad" 1809174 1809194 1810712 1810717) (-1087 "RRCC.spad" 1807558 1807588 1809164 1809169) (-1086 "RRCC.spad" 1805940 1805972 1807548 1807553) (-1085 "RPTAST.spad" 1805642 1805651 1805930 1805935) (-1084 "RPOLCAT.spad" 1785002 1785017 1805510 1805637) (-1083 "RPOLCAT.spad" 1764075 1764092 1784585 1784590) (-1082 "ROUTINE.spad" 1759496 1759505 1762260 1762287) (-1081 "ROMAN.spad" 1758824 1758833 1759362 1759491) (-1080 "ROIRC.spad" 1757904 1757936 1758814 1758819) (-1079 "RNS.spad" 1756807 1756816 1757806 1757899) (-1078 "RNS.spad" 1755796 1755807 1756797 1756802) (-1077 "RNG.spad" 1755531 1755540 1755786 1755791) (-1076 "RNGBIND.spad" 1754691 1754705 1755486 1755491) (-1075 "RMODULE.spad" 1754456 1754467 1754681 1754686) (-1074 "RMCAT2.spad" 1753876 1753933 1754446 1754451) (-1073 "RMATRIX.spad" 1752664 1752683 1753007 1753046) (-1072 "RMATCAT.spad" 1748243 1748274 1752620 1752659) (-1071 "RMATCAT.spad" 1743712 1743745 1748091 1748096) (-1070 "RLINSET.spad" 1743416 1743427 1743702 1743707) (-1069 "RINTERP.spad" 1743304 1743324 1743406 1743411) (-1068 "RING.spad" 1742774 1742783 1743284 1743299) (-1067 "RING.spad" 1742252 1742263 1742764 1742769) (-1066 "RIDIST.spad" 1741644 1741653 1742242 1742247) (-1065 "RGCHAIN.spad" 1740172 1740188 1741074 1741101) (-1064 "RGBCSPC.spad" 1739953 1739965 1740162 1740167) (-1063 "RGBCMDL.spad" 1739483 1739495 1739943 1739948) (-1062 "RF.spad" 1737125 1737136 1739473 1739478) (-1061 "RFFACTOR.spad" 1736587 1736598 1737115 1737120) (-1060 "RFFACT.spad" 1736322 1736334 1736577 1736582) (-1059 "RFDIST.spad" 1735318 1735327 1736312 1736317) (-1058 "RETSOL.spad" 1734737 1734750 1735308 1735313) (-1057 "RETRACT.spad" 1734165 1734176 1734727 1734732) (-1056 "RETRACT.spad" 1733591 1733604 1734155 1734160) (-1055 "RETAST.spad" 1733403 1733412 1733581 1733586) (-1054 "RESULT.spad" 1731001 1731010 1731588 1731615) (-1053 "RESRING.spad" 1730348 1730395 1730939 1730996) (-1052 "RESLATC.spad" 1729672 1729683 1730338 1730343) (-1051 "REPSQ.spad" 1729403 1729414 1729662 1729667) (-1050 "REP.spad" 1726957 1726966 1729393 1729398) (-1049 "REPDB.spad" 1726664 1726675 1726947 1726952) (-1048 "REP2.spad" 1716322 1716333 1726506 1726511) (-1047 "REP1.spad" 1710518 1710529 1716272 1716277) (-1046 "REGSET.spad" 1708279 1708296 1710128 1710155) (-1045 "REF.spad" 1707614 1707625 1708234 1708239) (-1044 "REDORDER.spad" 1706820 1706837 1707604 1707609) (-1043 "RECLOS.spad" 1705603 1705623 1706307 1706400) (-1042 "REALSOLV.spad" 1704743 1704752 1705593 1705598) (-1041 "REAL.spad" 1704615 1704624 1704733 1704738) (-1040 "REAL0Q.spad" 1701913 1701928 1704605 1704610) (-1039 "REAL0.spad" 1698757 1698772 1701903 1701908) (-1038 "RDUCEAST.spad" 1698478 1698487 1698747 1698752) (-1037 "RDIV.spad" 1698133 1698158 1698468 1698473) (-1036 "RDIST.spad" 1697700 1697711 1698123 1698128) (-1035 "RDETRS.spad" 1696564 1696582 1697690 1697695) (-1034 "RDETR.spad" 1694703 1694721 1696554 1696559) (-1033 "RDEEFS.spad" 1693802 1693819 1694693 1694698) (-1032 "RDEEF.spad" 1692812 1692829 1693792 1693797) (-1031 "RCFIELD.spad" 1689998 1690007 1692714 1692807) (-1030 "RCFIELD.spad" 1687270 1687281 1689988 1689993) (-1029 "RCAGG.spad" 1685198 1685209 1687260 1687265) (-1028 "RCAGG.spad" 1683053 1683066 1685117 1685122) (-1027 "RATRET.spad" 1682413 1682424 1683043 1683048) (-1026 "RATFACT.spad" 1682105 1682117 1682403 1682408) (-1025 "RANDSRC.spad" 1681424 1681433 1682095 1682100) (-1024 "RADUTIL.spad" 1681180 1681189 1681414 1681419) (-1023 "RADIX.spad" 1678004 1678018 1679550 1679643) (-1022 "RADFF.spad" 1675743 1675780 1675862 1676018) (-1021 "RADCAT.spad" 1675338 1675347 1675733 1675738) (-1020 "RADCAT.spad" 1674931 1674942 1675328 1675333) (-1019 "QUEUE.spad" 1674162 1674173 1674421 1674448) (-1018 "QUAT.spad" 1672650 1672661 1672993 1673058) (-1017 "QUATCT2.spad" 1672270 1672289 1672640 1672645) (-1016 "QUATCAT.spad" 1670440 1670451 1672200 1672265) (-1015 "QUATCAT.spad" 1668361 1668374 1670123 1670128) (-1014 "QUAGG.spad" 1667188 1667199 1668329 1668356) (-1013 "QQUTAST.spad" 1666956 1666965 1667178 1667183) (-1012 "QFORM.spad" 1666574 1666589 1666946 1666951) (-1011 "QFCAT.spad" 1665276 1665287 1666476 1666569) (-1010 "QFCAT.spad" 1663569 1663582 1664771 1664776) (-1009 "QFCAT2.spad" 1663261 1663278 1663559 1663564) (-1008 "QEQUAT.spad" 1662819 1662828 1663251 1663256) (-1007 "QCMPACK.spad" 1657565 1657585 1662809 1662814) (-1006 "QALGSET.spad" 1653643 1653676 1657479 1657484) (-1005 "QALGSET2.spad" 1651638 1651657 1653633 1653638) (-1004 "PWFFINTB.spad" 1649053 1649075 1651628 1651633) (-1003 "PUSHVAR.spad" 1648391 1648411 1649043 1649048) (-1002 "PTRANFN.spad" 1644518 1644529 1648381 1648386) (-1001 "PTPACK.spad" 1641605 1641616 1644508 1644513) (-1000 "PTFUNC2.spad" 1641427 1641442 1641595 1641600) (-999 "PTCAT.spad" 1640682 1640692 1641395 1641422) (-998 "PSQFR.spad" 1639989 1640013 1640672 1640677) (-997 "PSEUDLIN.spad" 1638875 1638885 1639979 1639984) (-996 "PSETPK.spad" 1624308 1624324 1638753 1638758) (-995 "PSETCAT.spad" 1618228 1618251 1624288 1624303) (-994 "PSETCAT.spad" 1612122 1612147 1618184 1618189) (-993 "PSCURVE.spad" 1611105 1611113 1612112 1612117) (-992 "PSCAT.spad" 1609888 1609917 1611003 1611100) (-991 "PSCAT.spad" 1608761 1608792 1609878 1609883) (-990 "PRTITION.spad" 1607459 1607467 1608751 1608756) (-989 "PRTDAST.spad" 1607178 1607186 1607449 1607454) (-988 "PRS.spad" 1596740 1596757 1607134 1607139) (-987 "PRQAGG.spad" 1596175 1596185 1596708 1596735) (-986 "PROPLOG.spad" 1595747 1595755 1596165 1596170) (-985 "PROPFUN2.spad" 1595370 1595383 1595737 1595742) (-984 "PROPFUN1.spad" 1594768 1594779 1595360 1595365) (-983 "PROPFRML.spad" 1593336 1593347 1594758 1594763) (-982 "PROPERTY.spad" 1592824 1592832 1593326 1593331) (-981 "PRODUCT.spad" 1590506 1590518 1590790 1590845) (-980 "PR.spad" 1588898 1588910 1589597 1589724) (-979 "PRINT.spad" 1588650 1588658 1588888 1588893) (-978 "PRIMES.spad" 1586903 1586913 1588640 1588645) (-977 "PRIMELT.spad" 1584984 1584998 1586893 1586898) (-976 "PRIMCAT.spad" 1584611 1584619 1584974 1584979) (-975 "PRIMARR.spad" 1583463 1583473 1583641 1583668) (-974 "PRIMARR2.spad" 1582230 1582242 1583453 1583458) (-973 "PREASSOC.spad" 1581612 1581624 1582220 1582225) (-972 "PPCURVE.spad" 1580749 1580757 1581602 1581607) (-971 "PORTNUM.spad" 1580524 1580532 1580739 1580744) (-970 "POLYROOT.spad" 1579373 1579395 1580480 1580485) (-969 "POLY.spad" 1576708 1576718 1577223 1577350) (-968 "POLYLIFT.spad" 1575973 1575996 1576698 1576703) (-967 "POLYCATQ.spad" 1574091 1574113 1575963 1575968) (-966 "POLYCAT.spad" 1567561 1567582 1573959 1574086) (-965 "POLYCAT.spad" 1560369 1560392 1566769 1566774) (-964 "POLY2UP.spad" 1559821 1559835 1560359 1560364) (-963 "POLY2.spad" 1559418 1559430 1559811 1559816) (-962 "POLUTIL.spad" 1558359 1558388 1559374 1559379) (-961 "POLTOPOL.spad" 1557107 1557122 1558349 1558354) (-960 "POINT.spad" 1555792 1555802 1555879 1555906) (-959 "PNTHEORY.spad" 1552494 1552502 1555782 1555787) (-958 "PMTOOLS.spad" 1551269 1551283 1552484 1552489) (-957 "PMSYM.spad" 1550818 1550828 1551259 1551264) (-956 "PMQFCAT.spad" 1550409 1550423 1550808 1550813) (-955 "PMPRED.spad" 1549888 1549902 1550399 1550404) (-954 "PMPREDFS.spad" 1549342 1549364 1549878 1549883) (-953 "PMPLCAT.spad" 1548422 1548440 1549274 1549279) (-952 "PMLSAGG.spad" 1548007 1548021 1548412 1548417) (-951 "PMKERNEL.spad" 1547586 1547598 1547997 1548002) (-950 "PMINS.spad" 1547166 1547176 1547576 1547581) (-949 "PMFS.spad" 1546743 1546761 1547156 1547161) (-948 "PMDOWN.spad" 1546033 1546047 1546733 1546738) (-947 "PMASS.spad" 1545043 1545051 1546023 1546028) (-946 "PMASSFS.spad" 1544010 1544026 1545033 1545038) (-945 "PLOTTOOL.spad" 1543790 1543798 1544000 1544005) (-944 "PLOT.spad" 1538713 1538721 1543780 1543785) (-943 "PLOT3D.spad" 1535177 1535185 1538703 1538708) (-942 "PLOT1.spad" 1534334 1534344 1535167 1535172) (-941 "PLEQN.spad" 1521624 1521651 1534324 1534329) (-940 "PINTERP.spad" 1521246 1521265 1521614 1521619) (-939 "PINTERPA.spad" 1521030 1521046 1521236 1521241) (-938 "PI.spad" 1520639 1520647 1521004 1521025) (-937 "PID.spad" 1519609 1519617 1520565 1520634) (-936 "PICOERCE.spad" 1519266 1519276 1519599 1519604) (-935 "PGROEB.spad" 1517867 1517881 1519256 1519261) (-934 "PGE.spad" 1509484 1509492 1517857 1517862) (-933 "PGCD.spad" 1508374 1508391 1509474 1509479) (-932 "PFRPAC.spad" 1507523 1507533 1508364 1508369) (-931 "PFR.spad" 1504186 1504196 1507425 1507518) (-930 "PFOTOOLS.spad" 1503444 1503460 1504176 1504181) (-929 "PFOQ.spad" 1502814 1502832 1503434 1503439) (-928 "PFO.spad" 1502233 1502260 1502804 1502809) (-927 "PF.spad" 1501807 1501819 1502038 1502131) (-926 "PFECAT.spad" 1499489 1499497 1501733 1501802) (-925 "PFECAT.spad" 1497199 1497209 1499445 1499450) (-924 "PFBRU.spad" 1495087 1495099 1497189 1497194) (-923 "PFBR.spad" 1492647 1492670 1495077 1495082) (-922 "PERM.spad" 1488454 1488464 1492477 1492492) (-921 "PERMGRP.spad" 1483224 1483234 1488444 1488449) (-920 "PERMCAT.spad" 1481885 1481895 1483204 1483219) (-919 "PERMAN.spad" 1480417 1480431 1481875 1481880) (-918 "PENDTREE.spad" 1479641 1479651 1479929 1479934) (-917 "PDSPC.spad" 1478454 1478464 1479631 1479636) (-916 "PDSPC.spad" 1477265 1477277 1478444 1478449) (-915 "PDRING.spad" 1477107 1477117 1477245 1477260) (-914 "PDMOD.spad" 1476923 1476935 1477075 1477102) (-913 "PDEPROB.spad" 1475938 1475946 1476913 1476918) (-912 "PDEPACK.spad" 1469978 1469986 1475928 1475933) (-911 "PDECOMP.spad" 1469448 1469465 1469968 1469973) (-910 "PDECAT.spad" 1467804 1467812 1469438 1469443) (-909 "PDDOM.spad" 1467242 1467255 1467794 1467799) (-908 "PDDOM.spad" 1466678 1466693 1467232 1467237) (-907 "PCOMP.spad" 1466531 1466544 1466668 1466673) (-906 "PBWLB.spad" 1465119 1465136 1466521 1466526) (-905 "PATTERN.spad" 1459658 1459668 1465109 1465114) (-904 "PATTERN2.spad" 1459396 1459408 1459648 1459653) (-903 "PATTERN1.spad" 1457732 1457748 1459386 1459391) (-902 "PATRES.spad" 1455307 1455319 1457722 1457727) (-901 "PATRES2.spad" 1454979 1454993 1455297 1455302) (-900 "PATMATCH.spad" 1453176 1453207 1454687 1454692) (-899 "PATMAB.spad" 1452605 1452615 1453166 1453171) (-898 "PATLRES.spad" 1451691 1451705 1452595 1452600) (-897 "PATAB.spad" 1451455 1451465 1451681 1451686) (-896 "PARTPERM.spad" 1449463 1449471 1451445 1451450) (-895 "PARSURF.spad" 1448897 1448925 1449453 1449458) (-894 "PARSU2.spad" 1448694 1448710 1448887 1448892) (-893 "script-parser.spad" 1448214 1448222 1448684 1448689) (-892 "PARSCURV.spad" 1447648 1447676 1448204 1448209) (-891 "PARSC2.spad" 1447439 1447455 1447638 1447643) (-890 "PARPCURV.spad" 1446901 1446929 1447429 1447434) (-889 "PARPC2.spad" 1446692 1446708 1446891 1446896) (-888 "PARAMAST.spad" 1445820 1445828 1446682 1446687) (-887 "PAN2EXPR.spad" 1445232 1445240 1445810 1445815) (-886 "PALETTE.spad" 1444202 1444210 1445222 1445227) (-885 "PAIR.spad" 1443189 1443202 1443790 1443795) (-884 "PADICRC.spad" 1440430 1440448 1441601 1441694) (-883 "PADICRAT.spad" 1438338 1438350 1438559 1438652) (-882 "PADIC.spad" 1438033 1438045 1438264 1438333) (-881 "PADICCT.spad" 1436582 1436594 1437959 1438028) (-880 "PADEPAC.spad" 1435271 1435290 1436572 1436577) (-879 "PADE.spad" 1434023 1434039 1435261 1435266) (-878 "OWP.spad" 1433263 1433293 1433881 1433948) (-877 "OVERSET.spad" 1432836 1432844 1433253 1433258) (-876 "OVAR.spad" 1432617 1432640 1432826 1432831) (-875 "OUT.spad" 1431703 1431711 1432607 1432612) (-874 "OUTFORM.spad" 1421095 1421103 1431693 1431698) (-873 "OUTBFILE.spad" 1420513 1420521 1421085 1421090) (-872 "OUTBCON.spad" 1419519 1419527 1420503 1420508) (-871 "OUTBCON.spad" 1418523 1418533 1419509 1419514) (-870 "OSI.spad" 1417998 1418006 1418513 1418518) (-869 "OSGROUP.spad" 1417916 1417924 1417988 1417993) (-868 "ORTHPOL.spad" 1416401 1416411 1417833 1417838) (-867 "OREUP.spad" 1415854 1415882 1416081 1416120) (-866 "ORESUP.spad" 1415155 1415179 1415534 1415573) (-865 "OREPCTO.spad" 1413012 1413024 1415075 1415080) (-864 "OREPCAT.spad" 1407159 1407169 1412968 1413007) (-863 "OREPCAT.spad" 1401196 1401208 1407007 1407012) (-862 "ORDSET.spad" 1400368 1400376 1401186 1401191) (-861 "ORDSET.spad" 1399538 1399548 1400358 1400363) (-860 "ORDRING.spad" 1398928 1398936 1399518 1399533) (-859 "ORDRING.spad" 1398326 1398336 1398918 1398923) (-858 "ORDMON.spad" 1398181 1398189 1398316 1398321) (-857 "ORDFUNS.spad" 1397313 1397329 1398171 1398176) (-856 "ORDFIN.spad" 1397133 1397141 1397303 1397308) (-855 "ORDCOMP.spad" 1395598 1395608 1396680 1396709) (-854 "ORDCOMP2.spad" 1394891 1394903 1395588 1395593) (-853 "OPTPROB.spad" 1393529 1393537 1394881 1394886) (-852 "OPTPACK.spad" 1385938 1385946 1393519 1393524) (-851 "OPTCAT.spad" 1383617 1383625 1385928 1385933) (-850 "OPSIG.spad" 1383271 1383279 1383607 1383612) (-849 "OPQUERY.spad" 1382820 1382828 1383261 1383266) (-848 "OP.spad" 1382562 1382572 1382642 1382709) (-847 "OPERCAT.spad" 1382028 1382038 1382552 1382557) (-846 "OPERCAT.spad" 1381492 1381504 1382018 1382023) (-845 "ONECOMP.spad" 1380237 1380247 1381039 1381068) (-844 "ONECOMP2.spad" 1379661 1379673 1380227 1380232) (-843 "OMSERVER.spad" 1378667 1378675 1379651 1379656) (-842 "OMSAGG.spad" 1378455 1378465 1378623 1378662) (-841 "OMPKG.spad" 1377071 1377079 1378445 1378450) (-840 "OM.spad" 1376044 1376052 1377061 1377066) (-839 "OMLO.spad" 1375469 1375481 1375930 1375969) (-838 "OMEXPR.spad" 1375303 1375313 1375459 1375464) (-837 "OMERR.spad" 1374848 1374856 1375293 1375298) (-836 "OMERRK.spad" 1373882 1373890 1374838 1374843) (-835 "OMENC.spad" 1373226 1373234 1373872 1373877) (-834 "OMDEV.spad" 1367535 1367543 1373216 1373221) (-833 "OMCONN.spad" 1366944 1366952 1367525 1367530) (-832 "OINTDOM.spad" 1366707 1366715 1366870 1366939) (-831 "OFMONOID.spad" 1364830 1364840 1366663 1366668) (-830 "ODVAR.spad" 1364091 1364101 1364820 1364825) (-829 "ODR.spad" 1363735 1363761 1363903 1364052) (-828 "ODPOL.spad" 1361024 1361034 1361364 1361491) (-827 "ODP.spad" 1348838 1348858 1349211 1349310) (-826 "ODETOOLS.spad" 1347487 1347506 1348828 1348833) (-825 "ODESYS.spad" 1345181 1345198 1347477 1347482) (-824 "ODERTRIC.spad" 1341190 1341207 1345138 1345143) (-823 "ODERED.spad" 1340589 1340613 1341180 1341185) (-822 "ODERAT.spad" 1338204 1338221 1340579 1340584) (-821 "ODEPRRIC.spad" 1335241 1335263 1338194 1338199) (-820 "ODEPROB.spad" 1334498 1334506 1335231 1335236) (-819 "ODEPRIM.spad" 1331832 1331854 1334488 1334493) (-818 "ODEPAL.spad" 1331218 1331242 1331822 1331827) (-817 "ODEPACK.spad" 1317884 1317892 1331208 1331213) (-816 "ODEINT.spad" 1317319 1317335 1317874 1317879) (-815 "ODEIFTBL.spad" 1314714 1314722 1317309 1317314) (-814 "ODEEF.spad" 1310205 1310221 1314704 1314709) (-813 "ODECONST.spad" 1309742 1309760 1310195 1310200) (-812 "ODECAT.spad" 1308340 1308348 1309732 1309737) (-811 "OCT.spad" 1306476 1306486 1307190 1307229) (-810 "OCTCT2.spad" 1306122 1306143 1306466 1306471) (-809 "OC.spad" 1303918 1303928 1306078 1306117) (-808 "OC.spad" 1301439 1301451 1303601 1303606) (-807 "OCAMON.spad" 1301287 1301295 1301429 1301434) (-806 "OASGP.spad" 1301102 1301110 1301277 1301282) (-805 "OAMONS.spad" 1300624 1300632 1301092 1301097) (-804 "OAMON.spad" 1300485 1300493 1300614 1300619) (-803 "OAGROUP.spad" 1300347 1300355 1300475 1300480) (-802 "NUMTUBE.spad" 1299938 1299954 1300337 1300342) (-801 "NUMQUAD.spad" 1287914 1287922 1299928 1299933) (-800 "NUMODE.spad" 1279268 1279276 1287904 1287909) (-799 "NUMINT.spad" 1276834 1276842 1279258 1279263) (-798 "NUMFMT.spad" 1275674 1275682 1276824 1276829) (-797 "NUMERIC.spad" 1267788 1267798 1275479 1275484) (-796 "NTSCAT.spad" 1266296 1266312 1267756 1267783) (-795 "NTPOLFN.spad" 1265847 1265857 1266213 1266218) (-794 "NSUP.spad" 1258800 1258810 1263340 1263493) (-793 "NSUP2.spad" 1258192 1258204 1258790 1258795) (-792 "NSMP.spad" 1254422 1254441 1254730 1254857) (-791 "NREP.spad" 1252800 1252814 1254412 1254417) (-790 "NPCOEF.spad" 1252046 1252066 1252790 1252795) (-789 "NORMRETR.spad" 1251644 1251683 1252036 1252041) (-788 "NORMPK.spad" 1249546 1249565 1251634 1251639) (-787 "NORMMA.spad" 1249234 1249260 1249536 1249541) (-786 "NONE.spad" 1248975 1248983 1249224 1249229) (-785 "NONE1.spad" 1248651 1248661 1248965 1248970) (-784 "NODE1.spad" 1248138 1248154 1248641 1248646) (-783 "NNI.spad" 1247033 1247041 1248112 1248133) (-782 "NLINSOL.spad" 1245659 1245669 1247023 1247028) (-781 "NIPROB.spad" 1244200 1244208 1245649 1245654) (-780 "NFINTBAS.spad" 1241760 1241777 1244190 1244195) (-779 "NETCLT.spad" 1241734 1241745 1241750 1241755) (-778 "NCODIV.spad" 1239950 1239966 1241724 1241729) (-777 "NCNTFRAC.spad" 1239592 1239606 1239940 1239945) (-776 "NCEP.spad" 1237758 1237772 1239582 1239587) (-775 "NASRING.spad" 1237354 1237362 1237748 1237753) (-774 "NASRING.spad" 1236948 1236958 1237344 1237349) (-773 "NARNG.spad" 1236300 1236308 1236938 1236943) (-772 "NARNG.spad" 1235650 1235660 1236290 1236295) (-771 "NAGSP.spad" 1234727 1234735 1235640 1235645) (-770 "NAGS.spad" 1224388 1224396 1234717 1234722) (-769 "NAGF07.spad" 1222819 1222827 1224378 1224383) (-768 "NAGF04.spad" 1217221 1217229 1222809 1222814) (-767 "NAGF02.spad" 1211290 1211298 1217211 1217216) (-766 "NAGF01.spad" 1207051 1207059 1211280 1211285) (-765 "NAGE04.spad" 1200751 1200759 1207041 1207046) (-764 "NAGE02.spad" 1191411 1191419 1200741 1200746) (-763 "NAGE01.spad" 1187413 1187421 1191401 1191406) (-762 "NAGD03.spad" 1185417 1185425 1187403 1187408) (-761 "NAGD02.spad" 1178164 1178172 1185407 1185412) (-760 "NAGD01.spad" 1172457 1172465 1178154 1178159) (-759 "NAGC06.spad" 1168332 1168340 1172447 1172452) (-758 "NAGC05.spad" 1166833 1166841 1168322 1168327) (-757 "NAGC02.spad" 1166100 1166108 1166823 1166828) (-756 "NAALG.spad" 1165641 1165651 1166068 1166095) (-755 "NAALG.spad" 1165202 1165214 1165631 1165636) (-754 "MULTSQFR.spad" 1162160 1162177 1165192 1165197) (-753 "MULTFACT.spad" 1161543 1161560 1162150 1162155) (-752 "MTSCAT.spad" 1159637 1159658 1161441 1161538) (-751 "MTHING.spad" 1159296 1159306 1159627 1159632) (-750 "MSYSCMD.spad" 1158730 1158738 1159286 1159291) (-749 "MSET.spad" 1156652 1156662 1158400 1158439) (-748 "MSETAGG.spad" 1156497 1156507 1156620 1156647) (-747 "MRING.spad" 1153474 1153486 1156205 1156272) (-746 "MRF2.spad" 1153044 1153058 1153464 1153469) (-745 "MRATFAC.spad" 1152590 1152607 1153034 1153039) (-744 "MPRFF.spad" 1150630 1150649 1152580 1152585) (-743 "MPOLY.spad" 1148101 1148116 1148460 1148587) (-742 "MPCPF.spad" 1147365 1147384 1148091 1148096) (-741 "MPC3.spad" 1147182 1147222 1147355 1147360) (-740 "MPC2.spad" 1146828 1146861 1147172 1147177) (-739 "MONOTOOL.spad" 1145179 1145196 1146818 1146823) (-738 "MONOID.spad" 1144498 1144506 1145169 1145174) (-737 "MONOID.spad" 1143815 1143825 1144488 1144493) (-736 "MONOGEN.spad" 1142563 1142576 1143675 1143810) (-735 "MONOGEN.spad" 1141333 1141348 1142447 1142452) (-734 "MONADWU.spad" 1139363 1139371 1141323 1141328) (-733 "MONADWU.spad" 1137391 1137401 1139353 1139358) (-732 "MONAD.spad" 1136551 1136559 1137381 1137386) (-731 "MONAD.spad" 1135709 1135719 1136541 1136546) (-730 "MOEBIUS.spad" 1134445 1134459 1135689 1135704) (-729 "MODULE.spad" 1134315 1134325 1134413 1134440) (-728 "MODULE.spad" 1134205 1134217 1134305 1134310) (-727 "MODRING.spad" 1133540 1133579 1134185 1134200) (-726 "MODOP.spad" 1132205 1132217 1133362 1133429) (-725 "MODMONOM.spad" 1131936 1131954 1132195 1132200) (-724 "MODMON.spad" 1128638 1128654 1129357 1129510) (-723 "MODFIELD.spad" 1128000 1128039 1128540 1128633) (-722 "MMLFORM.spad" 1126860 1126868 1127990 1127995) (-721 "MMAP.spad" 1126602 1126636 1126850 1126855) (-720 "MLO.spad" 1125061 1125071 1126558 1126597) (-719 "MLIFT.spad" 1123673 1123690 1125051 1125056) (-718 "MKUCFUNC.spad" 1123208 1123226 1123663 1123668) (-717 "MKRECORD.spad" 1122812 1122825 1123198 1123203) (-716 "MKFUNC.spad" 1122219 1122229 1122802 1122807) (-715 "MKFLCFN.spad" 1121187 1121197 1122209 1122214) (-714 "MKBCFUNC.spad" 1120682 1120700 1121177 1121182) (-713 "MINT.spad" 1120121 1120129 1120584 1120677) (-712 "MHROWRED.spad" 1118632 1118642 1120111 1120116) (-711 "MFLOAT.spad" 1117152 1117160 1118522 1118627) (-710 "MFINFACT.spad" 1116552 1116574 1117142 1117147) (-709 "MESH.spad" 1114334 1114342 1116542 1116547) (-708 "MDDFACT.spad" 1112545 1112555 1114324 1114329) (-707 "MDAGG.spad" 1111836 1111846 1112525 1112540) (-706 "MCMPLX.spad" 1107267 1107275 1107881 1108082) (-705 "MCDEN.spad" 1106477 1106489 1107257 1107262) (-704 "MCALCFN.spad" 1103599 1103625 1106467 1106472) (-703 "MAYBE.spad" 1102883 1102894 1103589 1103594) (-702 "MATSTOR.spad" 1100191 1100201 1102873 1102878) (-701 "MATRIX.spad" 1098778 1098788 1099262 1099289) (-700 "MATLIN.spad" 1096122 1096146 1098662 1098667) (-699 "MATCAT.spad" 1087851 1087873 1096090 1096117) (-698 "MATCAT.spad" 1079452 1079476 1087693 1087698) (-697 "MATCAT2.spad" 1078734 1078782 1079442 1079447) (-696 "MAPPKG3.spad" 1077649 1077663 1078724 1078729) (-695 "MAPPKG2.spad" 1076987 1076999 1077639 1077644) (-694 "MAPPKG1.spad" 1075815 1075825 1076977 1076982) (-693 "MAPPAST.spad" 1075130 1075138 1075805 1075810) (-692 "MAPHACK3.spad" 1074942 1074956 1075120 1075125) (-691 "MAPHACK2.spad" 1074711 1074723 1074932 1074937) (-690 "MAPHACK1.spad" 1074355 1074365 1074701 1074706) (-689 "MAGMA.spad" 1072145 1072162 1074345 1074350) (-688 "MACROAST.spad" 1071724 1071732 1072135 1072140) (-687 "M3D.spad" 1069327 1069337 1070985 1070990) (-686 "LZSTAGG.spad" 1066565 1066575 1069317 1069322) (-685 "LZSTAGG.spad" 1063801 1063813 1066555 1066560) (-684 "LWORD.spad" 1060506 1060523 1063791 1063796) (-683 "LSTAST.spad" 1060290 1060298 1060496 1060501) (-682 "LSQM.spad" 1058447 1058461 1058841 1058892) (-681 "LSPP.spad" 1057982 1057999 1058437 1058442) (-680 "LSMP.spad" 1056832 1056860 1057972 1057977) (-679 "LSMP1.spad" 1054650 1054664 1056822 1056827) (-678 "LSAGG.spad" 1054319 1054329 1054618 1054645) (-677 "LSAGG.spad" 1054008 1054020 1054309 1054314) (-676 "LPOLY.spad" 1052962 1052981 1053864 1053933) (-675 "LPEFRAC.spad" 1052233 1052243 1052952 1052957) (-674 "LO.spad" 1051634 1051648 1052167 1052194) (-673 "LOGIC.spad" 1051236 1051244 1051624 1051629) (-672 "LOGIC.spad" 1050836 1050846 1051226 1051231) (-671 "LODOOPS.spad" 1049766 1049778 1050826 1050831) (-670 "LODO.spad" 1049150 1049166 1049446 1049485) (-669 "LODOF.spad" 1048196 1048213 1049107 1049112) (-668 "LODOCAT.spad" 1046862 1046872 1048152 1048191) (-667 "LODOCAT.spad" 1045526 1045538 1046818 1046823) (-666 "LODO2.spad" 1044799 1044811 1045206 1045245) (-665 "LODO1.spad" 1044199 1044209 1044479 1044518) (-664 "LODEEF.spad" 1043001 1043019 1044189 1044194) (-663 "LNAGG.spad" 1039148 1039158 1042991 1042996) (-662 "LNAGG.spad" 1035259 1035271 1039104 1039109) (-661 "LMOPS.spad" 1032027 1032044 1035249 1035254) (-660 "LMODULE.spad" 1031795 1031805 1032017 1032022) (-659 "LMDICT.spad" 1030965 1030975 1031229 1031256) (-658 "LLINSET.spad" 1030672 1030682 1030955 1030960) (-657 "LITERAL.spad" 1030578 1030589 1030662 1030667) (-656 "LIST.spad" 1028160 1028170 1029572 1029599) (-655 "LIST3.spad" 1027471 1027485 1028150 1028155) (-654 "LIST2.spad" 1026173 1026185 1027461 1027466) (-653 "LIST2MAP.spad" 1023076 1023088 1026163 1026168) (-652 "LINSET.spad" 1022855 1022865 1023066 1023071) (-651 "LINEXP.spad" 1021598 1021608 1022845 1022850) (-650 "LINDEP.spad" 1020407 1020419 1021510 1021515) (-649 "LIMITRF.spad" 1018335 1018345 1020397 1020402) (-648 "LIMITPS.spad" 1017238 1017251 1018325 1018330) (-647 "LIE.spad" 1015254 1015266 1016528 1016673) (-646 "LIECAT.spad" 1014730 1014740 1015180 1015249) (-645 "LIECAT.spad" 1014234 1014246 1014686 1014691) (-644 "LIB.spad" 1011985 1011993 1012431 1012446) (-643 "LGROBP.spad" 1009338 1009357 1011975 1011980) (-642 "LF.spad" 1008293 1008309 1009328 1009333) (-641 "LFCAT.spad" 1007352 1007360 1008283 1008288) (-640 "LEXTRIPK.spad" 1002855 1002870 1007342 1007347) (-639 "LEXP.spad" 1000858 1000885 1002835 1002850) (-638 "LETAST.spad" 1000557 1000565 1000848 1000853) (-637 "LEADCDET.spad" 998955 998972 1000547 1000552) (-636 "LAZM3PK.spad" 997659 997681 998945 998950) (-635 "LAUPOL.spad" 996259 996272 997159 997228) (-634 "LAPLACE.spad" 995842 995858 996249 996254) (-633 "LA.spad" 995282 995296 995764 995803) (-632 "LALG.spad" 995058 995068 995262 995277) (-631 "LALG.spad" 994842 994854 995048 995053) (-630 "KVTFROM.spad" 994577 994587 994832 994837) (-629 "KTVLOGIC.spad" 994089 994097 994567 994572) (-628 "KRCFROM.spad" 993827 993837 994079 994084) (-627 "KOVACIC.spad" 992550 992567 993817 993822) (-626 "KONVERT.spad" 992272 992282 992540 992545) (-625 "KOERCE.spad" 992009 992019 992262 992267) (-624 "KERNEL.spad" 990664 990674 991793 991798) (-623 "KERNEL2.spad" 990367 990379 990654 990659) (-622 "KDAGG.spad" 989476 989498 990347 990362) (-621 "KDAGG.spad" 988593 988617 989466 989471) (-620 "KAFILE.spad" 987447 987463 987682 987709) (-619 "JORDAN.spad" 985276 985288 986737 986882) (-618 "JOINAST.spad" 984970 984978 985266 985271) (-617 "JAVACODE.spad" 984836 984844 984960 984965) (-616 "IXAGG.spad" 982969 982993 984826 984831) (-615 "IXAGG.spad" 980957 980983 982816 982821) (-614 "IVECTOR.spad" 979574 979589 979729 979756) (-613 "ITUPLE.spad" 978735 978745 979564 979569) (-612 "ITRIGMNP.spad" 977574 977593 978725 978730) (-611 "ITFUN3.spad" 977080 977094 977564 977569) (-610 "ITFUN2.spad" 976824 976836 977070 977075) (-609 "ITFORM.spad" 976179 976187 976814 976819) (-608 "ITAYLOR.spad" 974173 974188 976043 976140) (-607 "ISUPS.spad" 966610 966625 973147 973244) (-606 "ISUMP.spad" 966111 966127 966600 966605) (-605 "ISTRING.spad" 965038 965051 965119 965146) (-604 "ISAST.spad" 964757 964765 965028 965033) (-603 "IRURPK.spad" 963474 963493 964747 964752) (-602 "IRSN.spad" 961446 961454 963464 963469) (-601 "IRRF2F.spad" 959931 959941 961402 961407) (-600 "IRREDFFX.spad" 959532 959543 959921 959926) (-599 "IROOT.spad" 957871 957881 959522 959527) (-598 "IR.spad" 955672 955686 957726 957753) (-597 "IRFORM.spad" 954996 955004 955662 955667) (-596 "IR2.spad" 954024 954040 954986 954991) (-595 "IR2F.spad" 953230 953246 954014 954019) (-594 "IPRNTPK.spad" 952990 952998 953220 953225) (-593 "IPF.spad" 952555 952567 952795 952888) (-592 "IPADIC.spad" 952316 952342 952481 952550) (-591 "IP4ADDR.spad" 951873 951881 952306 952311) (-590 "IOMODE.spad" 951395 951403 951863 951868) (-589 "IOBFILE.spad" 950756 950764 951385 951390) (-588 "IOBCON.spad" 950621 950629 950746 950751) (-587 "INVLAPLA.spad" 950270 950286 950611 950616) (-586 "INTTR.spad" 943652 943669 950260 950265) (-585 "INTTOOLS.spad" 941407 941423 943226 943231) (-584 "INTSLPE.spad" 940727 940735 941397 941402) (-583 "INTRVL.spad" 940293 940303 940641 940722) (-582 "INTRF.spad" 938717 938731 940283 940288) (-581 "INTRET.spad" 938149 938159 938707 938712) (-580 "INTRAT.spad" 936876 936893 938139 938144) (-579 "INTPM.spad" 935261 935277 936519 936524) (-578 "INTPAF.spad" 933125 933143 935193 935198) (-577 "INTPACK.spad" 923499 923507 933115 933120) (-576 "INT.spad" 922947 922955 923353 923494) (-575 "INTHERTR.spad" 922221 922238 922937 922942) (-574 "INTHERAL.spad" 921891 921915 922211 922216) (-573 "INTHEORY.spad" 918330 918338 921881 921886) (-572 "INTG0.spad" 912063 912081 918262 918267) (-571 "INTFTBL.spad" 906092 906100 912053 912058) (-570 "INTFACT.spad" 905151 905161 906082 906087) (-569 "INTEF.spad" 903536 903552 905141 905146) (-568 "INTDOM.spad" 902159 902167 903462 903531) (-567 "INTDOM.spad" 900844 900854 902149 902154) (-566 "INTCAT.spad" 899103 899113 900758 900839) (-565 "INTBIT.spad" 898610 898618 899093 899098) (-564 "INTALG.spad" 897798 897825 898600 898605) (-563 "INTAF.spad" 897298 897314 897788 897793) (-562 "INTABL.spad" 895374 895405 895537 895564) (-561 "INT8.spad" 895254 895262 895364 895369) (-560 "INT64.spad" 895133 895141 895244 895249) (-559 "INT32.spad" 895012 895020 895123 895128) (-558 "INT16.spad" 894891 894899 895002 895007) (-557 "INS.spad" 892394 892402 894793 894886) (-556 "INS.spad" 889983 889993 892384 892389) (-555 "INPSIGN.spad" 889431 889444 889973 889978) (-554 "INPRODPF.spad" 888527 888546 889421 889426) (-553 "INPRODFF.spad" 887615 887639 888517 888522) (-552 "INNMFACT.spad" 886590 886607 887605 887610) (-551 "INMODGCD.spad" 886078 886108 886580 886585) (-550 "INFSP.spad" 884375 884397 886068 886073) (-549 "INFPROD0.spad" 883455 883474 884365 884370) (-548 "INFORM.spad" 880654 880662 883445 883450) (-547 "INFORM1.spad" 880279 880289 880644 880649) (-546 "INFINITY.spad" 879831 879839 880269 880274) (-545 "INETCLTS.spad" 879808 879816 879821 879826) (-544 "INEP.spad" 878346 878368 879798 879803) (-543 "INDE.spad" 878075 878092 878336 878341) (-542 "INCRMAPS.spad" 877496 877506 878065 878070) (-541 "INBFILE.spad" 876568 876576 877486 877491) (-540 "INBFF.spad" 872362 872373 876558 876563) (-539 "INBCON.spad" 870652 870660 872352 872357) (-538 "INBCON.spad" 868940 868950 870642 870647) (-537 "INAST.spad" 868601 868609 868930 868935) (-536 "IMPTAST.spad" 868309 868317 868591 868596) (-535 "IMATRIX.spad" 867137 867163 867649 867676) (-534 "IMATQF.spad" 866231 866275 867093 867098) (-533 "IMATLIN.spad" 864836 864860 866187 866192) (-532 "ILIST.spad" 863341 863356 863866 863893) (-531 "IIARRAY2.spad" 862612 862650 862831 862858) (-530 "IFF.spad" 862022 862038 862293 862386) (-529 "IFAST.spad" 861636 861644 862012 862017) (-528 "IFARRAY.spad" 858976 858991 860666 860693) (-527 "IFAMON.spad" 858838 858855 858932 858937) (-526 "IEVALAB.spad" 858243 858255 858828 858833) (-525 "IEVALAB.spad" 857646 857660 858233 858238) (-524 "IDPO.spad" 857444 857456 857636 857641) (-523 "IDPOAMS.spad" 857200 857212 857434 857439) (-522 "IDPOAM.spad" 856920 856932 857190 857195) (-521 "IDPC.spad" 855858 855870 856910 856915) (-520 "IDPAM.spad" 855603 855615 855848 855853) (-519 "IDPAG.spad" 855350 855362 855593 855598) (-518 "IDENT.spad" 855000 855008 855340 855345) (-517 "IDECOMP.spad" 852239 852257 854990 854995) (-516 "IDEAL.spad" 847188 847227 852174 852179) (-515 "ICDEN.spad" 846377 846393 847178 847183) (-514 "ICARD.spad" 845568 845576 846367 846372) (-513 "IBPTOOLS.spad" 844175 844192 845558 845563) (-512 "IBITS.spad" 843340 843353 843773 843800) (-511 "IBATOOL.spad" 840317 840336 843330 843335) (-510 "IBACHIN.spad" 838824 838839 840307 840312) (-509 "IARRAY2.spad" 837695 837721 838314 838341) (-508 "IARRAY1.spad" 836587 836602 836725 836752) (-507 "IAN.spad" 834810 834818 836403 836496) (-506 "IALGFACT.spad" 834413 834446 834800 834805) (-505 "HYPCAT.spad" 833837 833845 834403 834408) (-504 "HYPCAT.spad" 833259 833269 833827 833832) (-503 "HOSTNAME.spad" 833067 833075 833249 833254) (-502 "HOMOTOP.spad" 832810 832820 833057 833062) (-501 "HOAGG.spad" 830092 830102 832800 832805) (-500 "HOAGG.spad" 827113 827125 829823 829828) (-499 "HEXADEC.spad" 825118 825126 825483 825576) (-498 "HEUGCD.spad" 824153 824164 825108 825113) (-497 "HELLFDIV.spad" 823743 823767 824143 824148) (-496 "HEAP.spad" 823018 823028 823233 823260) (-495 "HEADAST.spad" 822551 822559 823008 823013) (-494 "HDP.spad" 810361 810377 810738 810837) (-493 "HDMP.spad" 807575 807590 808191 808318) (-492 "HB.spad" 805826 805834 807565 807570) (-491 "HASHTBL.spad" 803854 803885 804065 804092) (-490 "HASAST.spad" 803570 803578 803844 803849) (-489 "HACKPI.spad" 803061 803069 803472 803565) (-488 "GTSET.spad" 801964 801980 802671 802698) (-487 "GSTBL.spad" 800041 800076 800215 800230) (-486 "GSERIES.spad" 797354 797381 798173 798322) (-485 "GROUP.spad" 796627 796635 797334 797349) (-484 "GROUP.spad" 795908 795918 796617 796622) (-483 "GROEBSOL.spad" 794402 794423 795898 795903) (-482 "GRMOD.spad" 792973 792985 794392 794397) (-481 "GRMOD.spad" 791542 791556 792963 792968) (-480 "GRIMAGE.spad" 784431 784439 791532 791537) (-479 "GRDEF.spad" 782810 782818 784421 784426) (-478 "GRAY.spad" 781273 781281 782800 782805) (-477 "GRALG.spad" 780350 780362 781263 781268) (-476 "GRALG.spad" 779425 779439 780340 780345) (-475 "GPOLSET.spad" 778843 778866 779071 779098) (-474 "GOSPER.spad" 778112 778130 778833 778838) (-473 "GMODPOL.spad" 777260 777287 778080 778107) (-472 "GHENSEL.spad" 776343 776357 777250 777255) (-471 "GENUPS.spad" 772636 772649 776333 776338) (-470 "GENUFACT.spad" 772213 772223 772626 772631) (-469 "GENPGCD.spad" 771799 771816 772203 772208) (-468 "GENMFACT.spad" 771251 771270 771789 771794) (-467 "GENEEZ.spad" 769202 769215 771241 771246) (-466 "GDMP.spad" 766258 766275 767032 767159) (-465 "GCNAALG.spad" 760181 760208 766052 766119) (-464 "GCDDOM.spad" 759357 759365 760107 760176) (-463 "GCDDOM.spad" 758595 758605 759347 759352) (-462 "GB.spad" 756121 756159 758551 758556) (-461 "GBINTERN.spad" 752141 752179 756111 756116) (-460 "GBF.spad" 747908 747946 752131 752136) (-459 "GBEUCLID.spad" 745790 745828 747898 747903) (-458 "GAUSSFAC.spad" 745103 745111 745780 745785) (-457 "GALUTIL.spad" 743429 743439 745059 745064) (-456 "GALPOLYU.spad" 741883 741896 743419 743424) (-455 "GALFACTU.spad" 740056 740075 741873 741878) (-454 "GALFACT.spad" 730245 730256 740046 740051) (-453 "FVFUN.spad" 727268 727276 730235 730240) (-452 "FVC.spad" 726320 726328 727258 727263) (-451 "FUNDESC.spad" 725998 726006 726310 726315) (-450 "FUNCTION.spad" 725847 725859 725988 725993) (-449 "FT.spad" 724144 724152 725837 725842) (-448 "FTEM.spad" 723309 723317 724134 724139) (-447 "FSUPFACT.spad" 722209 722228 723245 723250) (-446 "FST.spad" 720295 720303 722199 722204) (-445 "FSRED.spad" 719775 719791 720285 720290) (-444 "FSPRMELT.spad" 718657 718673 719732 719737) (-443 "FSPECF.spad" 716748 716764 718647 718652) (-442 "FS.spad" 711016 711026 716523 716743) (-441 "FS.spad" 705062 705074 710571 710576) (-440 "FSINT.spad" 704722 704738 705052 705057) (-439 "FSERIES.spad" 703913 703925 704542 704641) (-438 "FSCINT.spad" 703230 703246 703903 703908) (-437 "FSAGG.spad" 702347 702357 703186 703225) (-436 "FSAGG.spad" 701426 701438 702267 702272) (-435 "FSAGG2.spad" 700169 700185 701416 701421) (-434 "FS2UPS.spad" 694660 694694 700159 700164) (-433 "FS2.spad" 694307 694323 694650 694655) (-432 "FS2EXPXP.spad" 693432 693455 694297 694302) (-431 "FRUTIL.spad" 692386 692396 693422 693427) (-430 "FR.spad" 686009 686019 691317 691386) (-429 "FRNAALG.spad" 681278 681288 685951 686004) (-428 "FRNAALG.spad" 676559 676571 681234 681239) (-427 "FRNAAF2.spad" 676015 676033 676549 676554) (-426 "FRMOD.spad" 675425 675455 675946 675951) (-425 "FRIDEAL.spad" 674650 674671 675405 675420) (-424 "FRIDEAL2.spad" 674254 674286 674640 674645) (-423 "FRETRCT.spad" 673765 673775 674244 674249) (-422 "FRETRCT.spad" 673142 673154 673623 673628) (-421 "FRAMALG.spad" 671490 671503 673098 673137) (-420 "FRAMALG.spad" 669870 669885 671480 671485) (-419 "FRAC.spad" 666876 666886 667279 667452) (-418 "FRAC2.spad" 666481 666493 666866 666871) (-417 "FR2.spad" 665817 665829 666471 666476) (-416 "FPS.spad" 662632 662640 665707 665812) (-415 "FPS.spad" 659475 659485 662552 662557) (-414 "FPC.spad" 658521 658529 659377 659470) (-413 "FPC.spad" 657653 657663 658511 658516) (-412 "FPATMAB.spad" 657415 657425 657643 657648) (-411 "FPARFRAC.spad" 656265 656282 657405 657410) (-410 "FORTRAN.spad" 654771 654814 656255 656260) (-409 "FORT.spad" 653720 653728 654761 654766) (-408 "FORTFN.spad" 650890 650898 653710 653715) (-407 "FORTCAT.spad" 650574 650582 650880 650885) (-406 "FORMULA.spad" 648048 648056 650564 650569) (-405 "FORMULA1.spad" 647527 647537 648038 648043) (-404 "FORDER.spad" 647218 647242 647517 647522) (-403 "FOP.spad" 646419 646427 647208 647213) (-402 "FNLA.spad" 645843 645865 646387 646414) (-401 "FNCAT.spad" 644438 644446 645833 645838) (-400 "FNAME.spad" 644330 644338 644428 644433) (-399 "FMTC.spad" 644128 644136 644256 644325) (-398 "FMONOID.spad" 643793 643803 644084 644089) (-397 "FMONCAT.spad" 640946 640956 643783 643788) (-396 "FM.spad" 640641 640653 640880 640907) (-395 "FMFUN.spad" 637671 637679 640631 640636) (-394 "FMC.spad" 636723 636731 637661 637666) (-393 "FMCAT.spad" 634391 634409 636691 636718) (-392 "FM1.spad" 633748 633760 634325 634352) (-391 "FLOATRP.spad" 631483 631497 633738 633743) (-390 "FLOAT.spad" 624797 624805 631349 631478) (-389 "FLOATCP.spad" 622228 622242 624787 624792) (-388 "FLINEXP.spad" 621950 621960 622218 622223) (-387 "FLINEXP.spad" 621616 621628 621886 621891) (-386 "FLASORT.spad" 620942 620954 621606 621611) (-385 "FLALG.spad" 618588 618607 620868 620937) (-384 "FLAGG.spad" 615630 615640 618568 618583) (-383 "FLAGG.spad" 612573 612585 615513 615518) (-382 "FLAGG2.spad" 611298 611314 612563 612568) (-381 "FINRALG.spad" 609359 609372 611254 611293) (-380 "FINRALG.spad" 607346 607361 609243 609248) (-379 "FINITE.spad" 606498 606506 607336 607341) (-378 "FINAALG.spad" 595619 595629 606440 606493) (-377 "FINAALG.spad" 584752 584764 595575 595580) (-376 "FILE.spad" 584335 584345 584742 584747) (-375 "FILECAT.spad" 582861 582878 584325 584330) (-374 "FIELD.spad" 582267 582275 582763 582856) (-373 "FIELD.spad" 581759 581769 582257 582262) (-372 "FGROUP.spad" 580406 580416 581739 581754) (-371 "FGLMICPK.spad" 579193 579208 580396 580401) (-370 "FFX.spad" 578568 578583 578909 579002) (-369 "FFSLPE.spad" 578071 578092 578558 578563) (-368 "FFPOLY.spad" 569333 569344 578061 578066) (-367 "FFPOLY2.spad" 568393 568410 569323 569328) (-366 "FFP.spad" 567790 567810 568109 568202) (-365 "FF.spad" 567238 567254 567471 567564) (-364 "FFNBX.spad" 565750 565770 566954 567047) (-363 "FFNBP.spad" 564263 564280 565466 565559) (-362 "FFNB.spad" 562728 562749 563944 564037) (-361 "FFINTBAS.spad" 560242 560261 562718 562723) (-360 "FFIELDC.spad" 557819 557827 560144 560237) (-359 "FFIELDC.spad" 555482 555492 557809 557814) (-358 "FFHOM.spad" 554230 554247 555472 555477) (-357 "FFF.spad" 551665 551676 554220 554225) (-356 "FFCGX.spad" 550512 550532 551381 551474) (-355 "FFCGP.spad" 549401 549421 550228 550321) (-354 "FFCG.spad" 548193 548214 549082 549175) (-353 "FFCAT.spad" 541366 541388 548032 548188) (-352 "FFCAT.spad" 534618 534642 541286 541291) (-351 "FFCAT2.spad" 534365 534405 534608 534613) (-350 "FEXPR.spad" 526082 526128 534121 534160) (-349 "FEVALAB.spad" 525790 525800 526072 526077) (-348 "FEVALAB.spad" 525283 525295 525567 525572) (-347 "FDIV.spad" 524725 524749 525273 525278) (-346 "FDIVCAT.spad" 522789 522813 524715 524720) (-345 "FDIVCAT.spad" 520851 520877 522779 522784) (-344 "FDIV2.spad" 520507 520547 520841 520846) (-343 "FCTRDATA.spad" 519515 519523 520497 520502) (-342 "FCPAK1.spad" 518082 518090 519505 519510) (-341 "FCOMP.spad" 517461 517471 518072 518077) (-340 "FC.spad" 507468 507476 517451 517456) (-339 "FAXF.spad" 500439 500453 507370 507463) (-338 "FAXF.spad" 493462 493478 500395 500400) (-337 "FARRAY.spad" 491459 491469 492492 492519) (-336 "FAMR.spad" 489595 489607 491357 491454) (-335 "FAMR.spad" 487715 487729 489479 489484) (-334 "FAMONOID.spad" 487383 487393 487669 487674) (-333 "FAMONC.spad" 485679 485691 487373 487378) (-332 "FAGROUP.spad" 485303 485313 485575 485602) (-331 "FACUTIL.spad" 483507 483524 485293 485298) (-330 "FACTFUNC.spad" 482701 482711 483497 483502) (-329 "EXPUPXS.spad" 479534 479557 480833 480982) (-328 "EXPRTUBE.spad" 476822 476830 479524 479529) (-327 "EXPRODE.spad" 473982 473998 476812 476817) (-326 "EXPR.spad" 469157 469167 469871 470166) (-325 "EXPR2UPS.spad" 465279 465292 469147 469152) (-324 "EXPR2.spad" 464984 464996 465269 465274) (-323 "EXPEXPAN.spad" 461785 461810 462417 462510) (-322 "EXIT.spad" 461456 461464 461775 461780) (-321 "EXITAST.spad" 461192 461200 461446 461451) (-320 "EVALCYC.spad" 460652 460666 461182 461187) (-319 "EVALAB.spad" 460224 460234 460642 460647) (-318 "EVALAB.spad" 459794 459806 460214 460219) (-317 "EUCDOM.spad" 457368 457376 459720 459789) (-316 "EUCDOM.spad" 455004 455014 457358 457363) (-315 "ESTOOLS.spad" 446850 446858 454994 454999) (-314 "ESTOOLS2.spad" 446453 446467 446840 446845) (-313 "ESTOOLS1.spad" 446138 446149 446443 446448) (-312 "ES.spad" 438953 438961 446128 446133) (-311 "ES.spad" 431674 431684 438851 438856) (-310 "ESCONT.spad" 428467 428475 431664 431669) (-309 "ESCONT1.spad" 428216 428228 428457 428462) (-308 "ES2.spad" 427721 427737 428206 428211) (-307 "ES1.spad" 427291 427307 427711 427716) (-306 "ERROR.spad" 424618 424626 427281 427286) (-305 "EQTBL.spad" 422648 422670 422857 422884) (-304 "EQ.spad" 417453 417463 420240 420352) (-303 "EQ2.spad" 417171 417183 417443 417448) (-302 "EP.spad" 413497 413507 417161 417166) (-301 "ENV.spad" 412175 412183 413487 413492) (-300 "ENTIRER.spad" 411843 411851 412119 412170) (-299 "EMR.spad" 411131 411172 411769 411838) (-298 "ELTAGG.spad" 409385 409404 411121 411126) (-297 "ELTAGG.spad" 407603 407624 409341 409346) (-296 "ELTAB.spad" 407078 407091 407593 407598) (-295 "ELFUTS.spad" 406465 406484 407068 407073) (-294 "ELEMFUN.spad" 406154 406162 406455 406460) (-293 "ELEMFUN.spad" 405841 405851 406144 406149) (-292 "ELAGG.spad" 403812 403822 405821 405836) (-291 "ELAGG.spad" 401720 401732 403731 403736) (-290 "ELABOR.spad" 401066 401074 401710 401715) (-289 "ELABEXPR.spad" 399998 400006 401056 401061) (-288 "EFUPXS.spad" 396774 396804 399954 399959) (-287 "EFULS.spad" 393610 393633 396730 396735) (-286 "EFSTRUC.spad" 391625 391641 393600 393605) (-285 "EF.spad" 386401 386417 391615 391620) (-284 "EAB.spad" 384677 384685 386391 386396) (-283 "E04UCFA.spad" 384213 384221 384667 384672) (-282 "E04NAFA.spad" 383790 383798 384203 384208) (-281 "E04MBFA.spad" 383370 383378 383780 383785) (-280 "E04JAFA.spad" 382906 382914 383360 383365) (-279 "E04GCFA.spad" 382442 382450 382896 382901) (-278 "E04FDFA.spad" 381978 381986 382432 382437) (-277 "E04DGFA.spad" 381514 381522 381968 381973) (-276 "E04AGNT.spad" 377364 377372 381504 381509) (-275 "DVARCAT.spad" 374254 374264 377354 377359) (-274 "DVARCAT.spad" 371142 371154 374244 374249) (-273 "DSMP.spad" 368516 368530 368821 368948) (-272 "DSEXT.spad" 367818 367828 368506 368511) (-271 "DSEXT.spad" 367027 367039 367717 367722) (-270 "DROPT.spad" 360986 360994 367017 367022) (-269 "DROPT1.spad" 360651 360661 360976 360981) (-268 "DROPT0.spad" 355508 355516 360641 360646) (-267 "DRAWPT.spad" 353681 353689 355498 355503) (-266 "DRAW.spad" 346557 346570 353671 353676) (-265 "DRAWHACK.spad" 345865 345875 346547 346552) (-264 "DRAWCX.spad" 343335 343343 345855 345860) (-263 "DRAWCURV.spad" 342882 342897 343325 343330) (-262 "DRAWCFUN.spad" 332414 332422 342872 342877) (-261 "DQAGG.spad" 330592 330602 332382 332409) (-260 "DPOLCAT.spad" 325941 325957 330460 330587) (-259 "DPOLCAT.spad" 321376 321394 325897 325902) (-258 "DPMO.spad" 313136 313152 313274 313487) (-257 "DPMM.spad" 304909 304927 305034 305247) (-256 "DOMTMPLT.spad" 304680 304688 304899 304904) (-255 "DOMCTOR.spad" 304435 304443 304670 304675) (-254 "DOMAIN.spad" 303522 303530 304425 304430) (-253 "DMP.spad" 300782 300797 301352 301479) (-252 "DMEXT.spad" 300649 300659 300750 300777) (-251 "DLP.spad" 300001 300011 300639 300644) (-250 "DLIST.spad" 298427 298437 299031 299058) (-249 "DLAGG.spad" 296844 296854 298417 298422) (-248 "DIVRING.spad" 296386 296394 296788 296839) (-247 "DIVRING.spad" 295972 295982 296376 296381) (-246 "DISPLAY.spad" 294162 294170 295962 295967) (-245 "DIRPROD.spad" 281709 281725 282349 282448) (-244 "DIRPROD2.spad" 280527 280545 281699 281704) (-243 "DIRPCAT.spad" 279720 279736 280423 280522) (-242 "DIRPCAT.spad" 278540 278558 279245 279250) (-241 "DIOSP.spad" 277365 277373 278530 278535) (-240 "DIOPS.spad" 276361 276371 277345 277360) (-239 "DIOPS.spad" 275331 275343 276317 276322) (-238 "DIFRING.spad" 275169 275177 275311 275326) (-237 "DIFFSPC.spad" 274748 274756 275159 275164) (-236 "DIFFSPC.spad" 274325 274335 274738 274743) (-235 "DIFFMOD.spad" 273814 273824 274293 274320) (-234 "DIFFDOM.spad" 272979 272990 273804 273809) (-233 "DIFFDOM.spad" 272142 272155 272969 272974) (-232 "DIFEXT.spad" 271961 271971 272122 272137) (-231 "DIAGG.spad" 271591 271601 271941 271956) (-230 "DIAGG.spad" 271229 271241 271581 271586) (-229 "DHMATRIX.spad" 269424 269434 270569 270596) (-228 "DFSFUN.spad" 263064 263072 269414 269419) (-227 "DFLOAT.spad" 259795 259803 262954 263059) (-226 "DFINTTLS.spad" 258026 258042 259785 259790) (-225 "DERHAM.spad" 255940 255972 258006 258021) (-224 "DEQUEUE.spad" 255147 255157 255430 255457) (-223 "DEGRED.spad" 254764 254778 255137 255142) (-222 "DEFINTRF.spad" 252301 252311 254754 254759) (-221 "DEFINTEF.spad" 250811 250827 252291 252296) (-220 "DEFAST.spad" 250179 250187 250801 250806) (-219 "DECIMAL.spad" 248188 248196 248549 248642) (-218 "DDFACT.spad" 246001 246018 248178 248183) (-217 "DBLRESP.spad" 245601 245625 245991 245996) (-216 "DBASE.spad" 244265 244275 245591 245596) (-215 "DATAARY.spad" 243727 243740 244255 244260) (-214 "D03FAFA.spad" 243555 243563 243717 243722) (-213 "D03EEFA.spad" 243375 243383 243545 243550) (-212 "D03AGNT.spad" 242461 242469 243365 243370) (-211 "D02EJFA.spad" 241923 241931 242451 242456) (-210 "D02CJFA.spad" 241401 241409 241913 241918) (-209 "D02BHFA.spad" 240891 240899 241391 241396) (-208 "D02BBFA.spad" 240381 240389 240881 240886) (-207 "D02AGNT.spad" 235195 235203 240371 240376) (-206 "D01WGTS.spad" 233514 233522 235185 235190) (-205 "D01TRNS.spad" 233491 233499 233504 233509) (-204 "D01GBFA.spad" 233013 233021 233481 233486) (-203 "D01FCFA.spad" 232535 232543 233003 233008) (-202 "D01ASFA.spad" 232003 232011 232525 232530) (-201 "D01AQFA.spad" 231449 231457 231993 231998) (-200 "D01APFA.spad" 230873 230881 231439 231444) (-199 "D01ANFA.spad" 230367 230375 230863 230868) (-198 "D01AMFA.spad" 229877 229885 230357 230362) (-197 "D01ALFA.spad" 229417 229425 229867 229872) (-196 "D01AKFA.spad" 228943 228951 229407 229412) (-195 "D01AJFA.spad" 228466 228474 228933 228938) (-194 "D01AGNT.spad" 224533 224541 228456 228461) (-193 "CYCLOTOM.spad" 224039 224047 224523 224528) (-192 "CYCLES.spad" 220831 220839 224029 224034) (-191 "CVMP.spad" 220248 220258 220821 220826) (-190 "CTRIGMNP.spad" 218748 218764 220238 220243) (-189 "CTOR.spad" 218439 218447 218738 218743) (-188 "CTORKIND.spad" 218042 218050 218429 218434) (-187 "CTORCAT.spad" 217291 217299 218032 218037) (-186 "CTORCAT.spad" 216538 216548 217281 217286) (-185 "CTORCALL.spad" 216127 216137 216528 216533) (-184 "CSTTOOLS.spad" 215372 215385 216117 216122) (-183 "CRFP.spad" 209096 209109 215362 215367) (-182 "CRCEAST.spad" 208816 208824 209086 209091) (-181 "CRAPACK.spad" 207867 207877 208806 208811) (-180 "CPMATCH.spad" 207371 207386 207792 207797) (-179 "CPIMA.spad" 207076 207095 207361 207366) (-178 "COORDSYS.spad" 202085 202095 207066 207071) (-177 "CONTOUR.spad" 201496 201504 202075 202080) (-176 "CONTFRAC.spad" 197246 197256 201398 201491) (-175 "CONDUIT.spad" 197004 197012 197236 197241) (-174 "COMRING.spad" 196678 196686 196942 196999) (-173 "COMPPROP.spad" 196196 196204 196668 196673) (-172 "COMPLPAT.spad" 195963 195978 196186 196191) (-171 "COMPLEX.spad" 191340 191350 191584 191845) (-170 "COMPLEX2.spad" 191055 191067 191330 191335) (-169 "COMPILER.spad" 190604 190612 191045 191050) (-168 "COMPFACT.spad" 190206 190220 190594 190599) (-167 "COMPCAT.spad" 188278 188288 189940 190201) (-166 "COMPCAT.spad" 186078 186090 187742 187747) (-165 "COMMUPC.spad" 185826 185844 186068 186073) (-164 "COMMONOP.spad" 185359 185367 185816 185821) (-163 "COMM.spad" 185170 185178 185349 185354) (-162 "COMMAAST.spad" 184933 184941 185160 185165) (-161 "COMBOPC.spad" 183848 183856 184923 184928) (-160 "COMBINAT.spad" 182615 182625 183838 183843) (-159 "COMBF.spad" 179997 180013 182605 182610) (-158 "COLOR.spad" 178834 178842 179987 179992) (-157 "COLONAST.spad" 178500 178508 178824 178829) (-156 "CMPLXRT.spad" 178211 178228 178490 178495) (-155 "CLLCTAST.spad" 177873 177881 178201 178206) (-154 "CLIP.spad" 173981 173989 177863 177868) (-153 "CLIF.spad" 172636 172652 173937 173976) (-152 "CLAGG.spad" 169141 169151 172626 172631) (-151 "CLAGG.spad" 165517 165529 169004 169009) (-150 "CINTSLPE.spad" 164848 164861 165507 165512) (-149 "CHVAR.spad" 162986 163008 164838 164843) (-148 "CHARZ.spad" 162901 162909 162966 162981) (-147 "CHARPOL.spad" 162411 162421 162891 162896) (-146 "CHARNZ.spad" 162164 162172 162391 162406) (-145 "CHAR.spad" 160038 160046 162154 162159) (-144 "CFCAT.spad" 159366 159374 160028 160033) (-143 "CDEN.spad" 158562 158576 159356 159361) (-142 "CCLASS.spad" 156673 156681 157935 157974) (-141 "CATEGORY.spad" 155715 155723 156663 156668) (-140 "CATCTOR.spad" 155606 155614 155705 155710) (-139 "CATAST.spad" 155224 155232 155596 155601) (-138 "CASEAST.spad" 154938 154946 155214 155219) (-137 "CARTEN.spad" 150305 150329 154928 154933) (-136 "CARTEN2.spad" 149695 149722 150295 150300) (-135 "CARD.spad" 146990 146998 149669 149690) (-134 "CAPSLAST.spad" 146764 146772 146980 146985) (-133 "CACHSET.spad" 146388 146396 146754 146759) (-132 "CABMON.spad" 145943 145951 146378 146383) (-131 "BYTEORD.spad" 145618 145626 145933 145938) (-130 "BYTE.spad" 145045 145053 145608 145613) (-129 "BYTEBUF.spad" 142743 142751 144053 144080) (-128 "BTREE.spad" 141699 141709 142233 142260) (-127 "BTOURN.spad" 140587 140597 141189 141216) (-126 "BTCAT.spad" 139979 139989 140555 140582) (-125 "BTCAT.spad" 139391 139403 139969 139974) (-124 "BTAGG.spad" 138857 138865 139359 139386) (-123 "BTAGG.spad" 138343 138353 138847 138852) (-122 "BSTREE.spad" 136967 136977 137833 137860) (-121 "BRILL.spad" 135164 135175 136957 136962) (-120 "BRAGG.spad" 134104 134114 135154 135159) (-119 "BRAGG.spad" 133008 133020 134060 134065) (-118 "BPADICRT.spad" 130882 130894 131137 131230) (-117 "BPADIC.spad" 130546 130558 130808 130877) (-116 "BOUNDZRO.spad" 130202 130219 130536 130541) (-115 "BOP.spad" 125384 125392 130192 130197) (-114 "BOP1.spad" 122850 122860 125374 125379) (-113 "BOOLE.spad" 122500 122508 122840 122845) (-112 "BOOLEAN.spad" 121938 121946 122490 122495) (-111 "BMODULE.spad" 121650 121662 121906 121933) (-110 "BITS.spad" 121033 121041 121248 121275) (-109 "BINDING.spad" 120446 120454 121023 121028) (-108 "BINARY.spad" 118460 118468 118816 118909) (-107 "BGAGG.spad" 117665 117675 118440 118455) (-106 "BGAGG.spad" 116878 116890 117655 117660) (-105 "BFUNCT.spad" 116442 116450 116858 116873) (-104 "BEZOUT.spad" 115582 115609 116392 116397) (-103 "BBTREE.spad" 112310 112320 115072 115099) (-102 "BASTYPE.spad" 111982 111990 112300 112305) (-101 "BASTYPE.spad" 111652 111662 111972 111977) (-100 "BALFACT.spad" 111111 111124 111642 111647) (-99 "AUTOMOR.spad" 110562 110571 111091 111106) (-98 "ATTREG.spad" 107285 107292 110314 110557) (-97 "ATTRBUT.spad" 103308 103315 107265 107280) (-96 "ATTRAST.spad" 103025 103032 103298 103303) (-95 "ATRIG.spad" 102495 102502 103015 103020) (-94 "ATRIG.spad" 101963 101972 102485 102490) (-93 "ASTCAT.spad" 101867 101874 101953 101958) (-92 "ASTCAT.spad" 101769 101778 101857 101862) (-91 "ASTACK.spad" 100991 101000 101259 101286) (-90 "ASSOCEQ.spad" 99817 99828 100947 100952) (-89 "ASP9.spad" 98898 98911 99807 99812) (-88 "ASP8.spad" 97941 97954 98888 98893) (-87 "ASP80.spad" 97263 97276 97931 97936) (-86 "ASP7.spad" 96423 96436 97253 97258) (-85 "ASP78.spad" 95874 95887 96413 96418) (-84 "ASP77.spad" 95243 95256 95864 95869) (-83 "ASP74.spad" 94335 94348 95233 95238) (-82 "ASP73.spad" 93606 93619 94325 94330) (-81 "ASP6.spad" 92473 92486 93596 93601) (-80 "ASP55.spad" 90982 90995 92463 92468) (-79 "ASP50.spad" 88799 88812 90972 90977) (-78 "ASP4.spad" 88094 88107 88789 88794) (-77 "ASP49.spad" 87093 87106 88084 88089) (-76 "ASP42.spad" 85500 85539 87083 87088) (-75 "ASP41.spad" 84079 84118 85490 85495) (-74 "ASP35.spad" 83067 83080 84069 84074) (-73 "ASP34.spad" 82368 82381 83057 83062) (-72 "ASP33.spad" 81928 81941 82358 82363) (-71 "ASP31.spad" 81068 81081 81918 81923) (-70 "ASP30.spad" 79960 79973 81058 81063) (-69 "ASP29.spad" 79426 79439 79950 79955) (-68 "ASP28.spad" 70699 70712 79416 79421) (-67 "ASP27.spad" 69596 69609 70689 70694) (-66 "ASP24.spad" 68683 68696 69586 69591) (-65 "ASP20.spad" 68147 68160 68673 68678) (-64 "ASP1.spad" 67528 67541 68137 68142) (-63 "ASP19.spad" 62214 62227 67518 67523) (-62 "ASP12.spad" 61628 61641 62204 62209) (-61 "ASP10.spad" 60899 60912 61618 61623) (-60 "ARRAY2.spad" 60142 60151 60389 60416) (-59 "ARRAY1.spad" 58826 58835 59172 59199) (-58 "ARRAY12.spad" 57539 57550 58816 58821) (-57 "ARR2CAT.spad" 53313 53334 57507 57534) (-56 "ARR2CAT.spad" 49107 49130 53303 53308) (-55 "ARITY.spad" 48479 48486 49097 49102) (-54 "APPRULE.spad" 47739 47761 48469 48474) (-53 "APPLYORE.spad" 47358 47371 47729 47734) (-52 "ANY.spad" 46217 46224 47348 47353) (-51 "ANY1.spad" 45288 45297 46207 46212) (-50 "ANTISYM.spad" 43733 43749 45268 45283) (-49 "ANON.spad" 43426 43433 43723 43728) (-48 "AN.spad" 41735 41742 43242 43335) (-47 "AMR.spad" 39920 39931 41633 41730) (-46 "AMR.spad" 37942 37955 39657 39662) (-45 "ALIST.spad" 34842 34863 35192 35219) (-44 "ALGSC.spad" 33977 34003 34714 34767) (-43 "ALGPKG.spad" 29760 29771 33933 33938) (-42 "ALGMFACT.spad" 28953 28967 29750 29755) (-41 "ALGMANIP.spad" 26427 26442 28786 28791) (-40 "ALGFF.spad" 24068 24095 24285 24441) (-39 "ALGFACT.spad" 23195 23205 24058 24063) (-38 "ALGEBRA.spad" 23028 23037 23151 23190) (-37 "ALGEBRA.spad" 22893 22904 23018 23023) (-36 "ALAGG.spad" 22405 22426 22861 22888) (-35 "AHYP.spad" 21786 21793 22395 22400) (-34 "AGG.spad" 20103 20110 21776 21781) (-33 "AGG.spad" 18384 18393 20059 20064) (-32 "AF.spad" 16815 16830 18319 18324) (-31 "ADDAST.spad" 16493 16500 16805 16810) (-30 "ACPLOT.spad" 15084 15091 16483 16488) (-29 "ACFS.spad" 12893 12902 14986 15079) (-28 "ACFS.spad" 10788 10799 12883 12888) (-27 "ACF.spad" 7470 7477 10690 10783) (-26 "ACF.spad" 4238 4247 7460 7465) (-25 "ABELSG.spad" 3779 3786 4228 4233) (-24 "ABELSG.spad" 3318 3327 3769 3774) (-23 "ABELMON.spad" 2861 2868 3308 3313) (-22 "ABELMON.spad" 2402 2411 2851 2856) (-21 "ABELGRP.spad" 2067 2074 2392 2397) (-20 "ABELGRP.spad" 1730 1739 2057 2062) (-19 "A1AGG.spad" 870 879 1698 1725) (-18 "A1AGG.spad" 30 41 860 865)) 
-\ No newline at end of file
+((-3 NIL 2293172 2293177 2293182 2293187) (-2 NIL 2293152 2293157 2293162 2293167) (-1 NIL 2293132 2293137 2293142 2293147) (0 NIL 2293112 2293117 2293122 2293127) (-1315 "ZMOD.spad" 2292921 2292934 2293050 2293107) (-1314 "ZLINDEP.spad" 2291987 2291998 2292911 2292916) (-1313 "ZDSOLVE.spad" 2281932 2281954 2291977 2291982) (-1312 "YSTREAM.spad" 2281427 2281438 2281922 2281927) (-1311 "YDIAGRAM.spad" 2281061 2281070 2281417 2281422) (-1310 "XRPOLY.spad" 2280281 2280301 2280917 2280986) (-1309 "XPR.spad" 2278076 2278089 2279999 2280098) (-1308 "XPOLY.spad" 2277631 2277642 2277932 2278001) (-1307 "XPOLYC.spad" 2276950 2276966 2277557 2277626) (-1306 "XPBWPOLY.spad" 2275387 2275407 2276730 2276799) (-1305 "XF.spad" 2273850 2273865 2275289 2275382) (-1304 "XF.spad" 2272293 2272310 2273734 2273739) (-1303 "XFALG.spad" 2269341 2269357 2272219 2272288) (-1302 "XEXPPKG.spad" 2268592 2268618 2269331 2269336) (-1301 "XDPOLY.spad" 2268206 2268222 2268448 2268517) (-1300 "XALG.spad" 2267866 2267877 2268162 2268201) (-1299 "WUTSET.spad" 2263669 2263686 2267476 2267503) (-1298 "WP.spad" 2262868 2262912 2263527 2263594) (-1297 "WHILEAST.spad" 2262666 2262675 2262858 2262863) (-1296 "WHEREAST.spad" 2262337 2262346 2262656 2262661) (-1295 "WFFINTBS.spad" 2260000 2260022 2262327 2262332) (-1294 "WEIER.spad" 2258222 2258233 2259990 2259995) (-1293 "VSPACE.spad" 2257895 2257906 2258190 2258217) (-1292 "VSPACE.spad" 2257588 2257601 2257885 2257890) (-1291 "VOID.spad" 2257265 2257274 2257578 2257583) (-1290 "VIEW.spad" 2254945 2254954 2257255 2257260) (-1289 "VIEWDEF.spad" 2250146 2250155 2254935 2254940) (-1288 "VIEW3D.spad" 2234107 2234116 2250136 2250141) (-1287 "VIEW2D.spad" 2221998 2222007 2234097 2234102) (-1286 "VECTOR.spad" 2220519 2220530 2220770 2220797) (-1285 "VECTOR2.spad" 2219158 2219171 2220509 2220514) (-1284 "VECTCAT.spad" 2217062 2217073 2219126 2219153) (-1283 "VECTCAT.spad" 2214773 2214786 2216839 2216844) (-1282 "VARIABLE.spad" 2214553 2214568 2214763 2214768) (-1281 "UTYPE.spad" 2214197 2214206 2214543 2214548) (-1280 "UTSODETL.spad" 2213492 2213516 2214153 2214158) (-1279 "UTSODE.spad" 2211708 2211728 2213482 2213487) (-1278 "UTS.spad" 2206655 2206683 2210175 2210272) (-1277 "UTSCAT.spad" 2204134 2204150 2206553 2206650) (-1276 "UTSCAT.spad" 2201257 2201275 2203678 2203683) (-1275 "UTS2.spad" 2200852 2200887 2201247 2201252) (-1274 "URAGG.spad" 2195525 2195536 2200842 2200847) (-1273 "URAGG.spad" 2190162 2190175 2195481 2195486) (-1272 "UPXSSING.spad" 2187807 2187833 2189243 2189376) (-1271 "UPXS.spad" 2185103 2185131 2185939 2186088) (-1270 "UPXSCONS.spad" 2182862 2182882 2183235 2183384) (-1269 "UPXSCCA.spad" 2181433 2181453 2182708 2182857) (-1268 "UPXSCCA.spad" 2180146 2180168 2181423 2181428) (-1267 "UPXSCAT.spad" 2178735 2178751 2179992 2180141) (-1266 "UPXS2.spad" 2178278 2178331 2178725 2178730) (-1265 "UPSQFREE.spad" 2176692 2176706 2178268 2178273) (-1264 "UPSCAT.spad" 2174479 2174503 2176590 2176687) (-1263 "UPSCAT.spad" 2171972 2171998 2174085 2174090) (-1262 "UPOLYC.spad" 2167012 2167023 2171814 2171967) (-1261 "UPOLYC.spad" 2161944 2161957 2166748 2166753) (-1260 "UPOLYC2.spad" 2161415 2161434 2161934 2161939) (-1259 "UP.spad" 2158521 2158536 2158908 2159061) (-1258 "UPMP.spad" 2157421 2157434 2158511 2158516) (-1257 "UPDIVP.spad" 2156986 2157000 2157411 2157416) (-1256 "UPDECOMP.spad" 2155231 2155245 2156976 2156981) (-1255 "UPCDEN.spad" 2154440 2154456 2155221 2155226) (-1254 "UP2.spad" 2153804 2153825 2154430 2154435) (-1253 "UNISEG.spad" 2153157 2153168 2153723 2153728) (-1252 "UNISEG2.spad" 2152654 2152667 2153113 2153118) (-1251 "UNIFACT.spad" 2151757 2151769 2152644 2152649) (-1250 "ULS.spad" 2141541 2141569 2142486 2142915) (-1249 "ULSCONS.spad" 2132675 2132695 2133045 2133194) (-1248 "ULSCCAT.spad" 2130412 2130432 2132521 2132670) (-1247 "ULSCCAT.spad" 2128257 2128279 2130368 2130373) (-1246 "ULSCAT.spad" 2126489 2126505 2128103 2128252) (-1245 "ULS2.spad" 2126003 2126056 2126479 2126484) (-1244 "UINT8.spad" 2125880 2125889 2125993 2125998) (-1243 "UINT64.spad" 2125756 2125765 2125870 2125875) (-1242 "UINT32.spad" 2125632 2125641 2125746 2125751) (-1241 "UINT16.spad" 2125508 2125517 2125622 2125627) (-1240 "UFD.spad" 2124573 2124582 2125434 2125503) (-1239 "UFD.spad" 2123700 2123711 2124563 2124568) (-1238 "UDVO.spad" 2122581 2122590 2123690 2123695) (-1237 "UDPO.spad" 2120074 2120085 2122537 2122542) (-1236 "TYPE.spad" 2120006 2120015 2120064 2120069) (-1235 "TYPEAST.spad" 2119925 2119934 2119996 2120001) (-1234 "TWOFACT.spad" 2118577 2118592 2119915 2119920) (-1233 "TUPLE.spad" 2118063 2118074 2118476 2118481) (-1232 "TUBETOOL.spad" 2114930 2114939 2118053 2118058) (-1231 "TUBE.spad" 2113577 2113594 2114920 2114925) (-1230 "TS.spad" 2112176 2112192 2113142 2113239) (-1229 "TSETCAT.spad" 2099303 2099320 2112144 2112171) (-1228 "TSETCAT.spad" 2086416 2086435 2099259 2099264) (-1227 "TRMANIP.spad" 2080782 2080799 2086122 2086127) (-1226 "TRIMAT.spad" 2079745 2079770 2080772 2080777) (-1225 "TRIGMNIP.spad" 2078272 2078289 2079735 2079740) (-1224 "TRIGCAT.spad" 2077784 2077793 2078262 2078267) (-1223 "TRIGCAT.spad" 2077294 2077305 2077774 2077779) (-1222 "TREE.spad" 2075752 2075763 2076784 2076811) (-1221 "TRANFUN.spad" 2075591 2075600 2075742 2075747) (-1220 "TRANFUN.spad" 2075428 2075439 2075581 2075586) (-1219 "TOPSP.spad" 2075102 2075111 2075418 2075423) (-1218 "TOOLSIGN.spad" 2074765 2074776 2075092 2075097) (-1217 "TEXTFILE.spad" 2073326 2073335 2074755 2074760) (-1216 "TEX.spad" 2070472 2070481 2073316 2073321) (-1215 "TEX1.spad" 2070028 2070039 2070462 2070467) (-1214 "TEMUTL.spad" 2069583 2069592 2070018 2070023) (-1213 "TBCMPPK.spad" 2067676 2067699 2069573 2069578) (-1212 "TBAGG.spad" 2066726 2066749 2067656 2067671) (-1211 "TBAGG.spad" 2065784 2065809 2066716 2066721) (-1210 "TANEXP.spad" 2065192 2065203 2065774 2065779) (-1209 "TALGOP.spad" 2064916 2064927 2065182 2065187) (-1208 "TABLE.spad" 2062885 2062908 2063155 2063182) (-1207 "TABLEAU.spad" 2062366 2062377 2062875 2062880) (-1206 "TABLBUMP.spad" 2059169 2059180 2062356 2062361) (-1205 "SYSTEM.spad" 2058397 2058406 2059159 2059164) (-1204 "SYSSOLP.spad" 2055880 2055891 2058387 2058392) (-1203 "SYSPTR.spad" 2055779 2055788 2055870 2055875) (-1202 "SYSNNI.spad" 2054961 2054972 2055769 2055774) (-1201 "SYSINT.spad" 2054365 2054376 2054951 2054956) (-1200 "SYNTAX.spad" 2050571 2050580 2054355 2054360) (-1199 "SYMTAB.spad" 2048639 2048648 2050561 2050566) (-1198 "SYMS.spad" 2044662 2044671 2048629 2048634) (-1197 "SYMPOLY.spad" 2043669 2043680 2043751 2043878) (-1196 "SYMFUNC.spad" 2043170 2043181 2043659 2043664) (-1195 "SYMBOL.spad" 2040673 2040682 2043160 2043165) (-1194 "SWITCH.spad" 2037444 2037453 2040663 2040668) (-1193 "SUTS.spad" 2034492 2034520 2035911 2036008) (-1192 "SUPXS.spad" 2031775 2031803 2032624 2032773) (-1191 "SUP.spad" 2028495 2028506 2029268 2029421) (-1190 "SUPFRACF.spad" 2027600 2027618 2028485 2028490) (-1189 "SUP2.spad" 2026992 2027005 2027590 2027595) (-1188 "SUMRF.spad" 2025966 2025977 2026982 2026987) (-1187 "SUMFS.spad" 2025603 2025620 2025956 2025961) (-1186 "SULS.spad" 2015374 2015402 2016332 2016761) (-1185 "SUCHTAST.spad" 2015143 2015152 2015364 2015369) (-1184 "SUCH.spad" 2014825 2014840 2015133 2015138) (-1183 "SUBSPACE.spad" 2006940 2006955 2014815 2014820) (-1182 "SUBRESP.spad" 2006110 2006124 2006896 2006901) (-1181 "STTF.spad" 2002209 2002225 2006100 2006105) (-1180 "STTFNC.spad" 1998677 1998693 2002199 2002204) (-1179 "STTAYLOR.spad" 1991312 1991323 1998558 1998563) (-1178 "STRTBL.spad" 1989363 1989380 1989512 1989539) (-1177 "STRING.spad" 1988150 1988159 1988371 1988398) (-1176 "STREAM.spad" 1984951 1984962 1987558 1987573) (-1175 "STREAM3.spad" 1984524 1984539 1984941 1984946) (-1174 "STREAM2.spad" 1983652 1983665 1984514 1984519) (-1173 "STREAM1.spad" 1983358 1983369 1983642 1983647) (-1172 "STINPROD.spad" 1982294 1982310 1983348 1983353) (-1171 "STEP.spad" 1981495 1981504 1982284 1982289) (-1170 "STEPAST.spad" 1980729 1980738 1981485 1981490) (-1169 "STBL.spad" 1978813 1978841 1978980 1978995) (-1168 "STAGG.spad" 1977888 1977899 1978803 1978808) (-1167 "STAGG.spad" 1976961 1976974 1977878 1977883) (-1166 "STACK.spad" 1976201 1976212 1976451 1976478) (-1165 "SREGSET.spad" 1973869 1973886 1975811 1975838) (-1164 "SRDCMPK.spad" 1972430 1972450 1973859 1973864) (-1163 "SRAGG.spad" 1967573 1967582 1972398 1972425) (-1162 "SRAGG.spad" 1962736 1962747 1967563 1967568) (-1161 "SQMATRIX.spad" 1960279 1960297 1961195 1961282) (-1160 "SPLTREE.spad" 1954675 1954688 1959559 1959586) (-1159 "SPLNODE.spad" 1951263 1951276 1954665 1954670) (-1158 "SPFCAT.spad" 1950072 1950081 1951253 1951258) (-1157 "SPECOUT.spad" 1948624 1948633 1950062 1950067) (-1156 "SPADXPT.spad" 1940219 1940228 1948614 1948619) (-1155 "spad-parser.spad" 1939684 1939693 1940209 1940214) (-1154 "SPADAST.spad" 1939385 1939394 1939674 1939679) (-1153 "SPACEC.spad" 1923584 1923595 1939375 1939380) (-1152 "SPACE3.spad" 1923360 1923371 1923574 1923579) (-1151 "SORTPAK.spad" 1922909 1922922 1923316 1923321) (-1150 "SOLVETRA.spad" 1920672 1920683 1922899 1922904) (-1149 "SOLVESER.spad" 1919200 1919211 1920662 1920667) (-1148 "SOLVERAD.spad" 1915226 1915237 1919190 1919195) (-1147 "SOLVEFOR.spad" 1913688 1913706 1915216 1915221) (-1146 "SNTSCAT.spad" 1913288 1913305 1913656 1913683) (-1145 "SMTS.spad" 1911560 1911586 1912853 1912950) (-1144 "SMP.spad" 1909035 1909055 1909425 1909552) (-1143 "SMITH.spad" 1907880 1907905 1909025 1909030) (-1142 "SMATCAT.spad" 1905990 1906020 1907824 1907875) (-1141 "SMATCAT.spad" 1904032 1904064 1905868 1905873) (-1140 "SKAGG.spad" 1902995 1903006 1904000 1904027) (-1139 "SINT.spad" 1901935 1901944 1902861 1902990) (-1138 "SIMPAN.spad" 1901663 1901672 1901925 1901930) (-1137 "SIG.spad" 1900993 1901002 1901653 1901658) (-1136 "SIGNRF.spad" 1900111 1900122 1900983 1900988) (-1135 "SIGNEF.spad" 1899390 1899407 1900101 1900106) (-1134 "SIGAST.spad" 1898775 1898784 1899380 1899385) (-1133 "SHP.spad" 1896703 1896718 1898731 1898736) (-1132 "SHDP.spad" 1884381 1884408 1884890 1884989) (-1131 "SGROUP.spad" 1883989 1883998 1884371 1884376) (-1130 "SGROUP.spad" 1883595 1883606 1883979 1883984) (-1129 "SGCF.spad" 1876734 1876743 1883585 1883590) (-1128 "SFRTCAT.spad" 1875664 1875681 1876702 1876729) (-1127 "SFRGCD.spad" 1874727 1874747 1875654 1875659) (-1126 "SFQCMPK.spad" 1869364 1869384 1874717 1874722) (-1125 "SFORT.spad" 1868803 1868817 1869354 1869359) (-1124 "SEXOF.spad" 1868646 1868686 1868793 1868798) (-1123 "SEX.spad" 1868538 1868547 1868636 1868641) (-1122 "SEXCAT.spad" 1866310 1866350 1868528 1868533) (-1121 "SET.spad" 1864598 1864609 1865695 1865734) (-1120 "SETMN.spad" 1863048 1863065 1864588 1864593) (-1119 "SETCAT.spad" 1862370 1862379 1863038 1863043) (-1118 "SETCAT.spad" 1861690 1861701 1862360 1862365) (-1117 "SETAGG.spad" 1858239 1858250 1861670 1861685) (-1116 "SETAGG.spad" 1854796 1854809 1858229 1858234) (-1115 "SEQAST.spad" 1854499 1854508 1854786 1854791) (-1114 "SEGXCAT.spad" 1853655 1853668 1854489 1854494) (-1113 "SEG.spad" 1853468 1853479 1853574 1853579) (-1112 "SEGCAT.spad" 1852393 1852404 1853458 1853463) (-1111 "SEGBIND.spad" 1852151 1852162 1852340 1852345) (-1110 "SEGBIND2.spad" 1851849 1851862 1852141 1852146) (-1109 "SEGAST.spad" 1851563 1851572 1851839 1851844) (-1108 "SEG2.spad" 1850998 1851011 1851519 1851524) (-1107 "SDVAR.spad" 1850274 1850285 1850988 1850993) (-1106 "SDPOL.spad" 1847607 1847618 1847898 1848025) (-1105 "SCPKG.spad" 1845696 1845707 1847597 1847602) (-1104 "SCOPE.spad" 1844849 1844858 1845686 1845691) (-1103 "SCACHE.spad" 1843545 1843556 1844839 1844844) (-1102 "SASTCAT.spad" 1843454 1843463 1843535 1843540) (-1101 "SAOS.spad" 1843326 1843335 1843444 1843449) (-1100 "SAERFFC.spad" 1843039 1843059 1843316 1843321) (-1099 "SAE.spad" 1840509 1840525 1841120 1841255) (-1098 "SAEFACT.spad" 1840210 1840230 1840499 1840504) (-1097 "RURPK.spad" 1837869 1837885 1840200 1840205) (-1096 "RULESET.spad" 1837322 1837346 1837859 1837864) (-1095 "RULE.spad" 1835562 1835586 1837312 1837317) (-1094 "RULECOLD.spad" 1835414 1835427 1835552 1835557) (-1093 "RTVALUE.spad" 1835149 1835158 1835404 1835409) (-1092 "RSTRCAST.spad" 1834866 1834875 1835139 1835144) (-1091 "RSETGCD.spad" 1831244 1831264 1834856 1834861) (-1090 "RSETCAT.spad" 1821180 1821197 1831212 1831239) (-1089 "RSETCAT.spad" 1811136 1811155 1821170 1821175) (-1088 "RSDCMPK.spad" 1809588 1809608 1811126 1811131) (-1087 "RRCC.spad" 1807972 1808002 1809578 1809583) (-1086 "RRCC.spad" 1806354 1806386 1807962 1807967) (-1085 "RPTAST.spad" 1806056 1806065 1806344 1806349) (-1084 "RPOLCAT.spad" 1785416 1785431 1805924 1806051) (-1083 "RPOLCAT.spad" 1764489 1764506 1784999 1785004) (-1082 "ROUTINE.spad" 1759910 1759919 1762674 1762701) (-1081 "ROMAN.spad" 1759238 1759247 1759776 1759905) (-1080 "ROIRC.spad" 1758318 1758350 1759228 1759233) (-1079 "RNS.spad" 1757221 1757230 1758220 1758313) (-1078 "RNS.spad" 1756210 1756221 1757211 1757216) (-1077 "RNG.spad" 1755945 1755954 1756200 1756205) (-1076 "RNGBIND.spad" 1755105 1755119 1755900 1755905) (-1075 "RMODULE.spad" 1754870 1754881 1755095 1755100) (-1074 "RMCAT2.spad" 1754290 1754347 1754860 1754865) (-1073 "RMATRIX.spad" 1753078 1753097 1753421 1753460) (-1072 "RMATCAT.spad" 1748657 1748688 1753034 1753073) (-1071 "RMATCAT.spad" 1744126 1744159 1748505 1748510) (-1070 "RLINSET.spad" 1743830 1743841 1744116 1744121) (-1069 "RINTERP.spad" 1743718 1743738 1743820 1743825) (-1068 "RING.spad" 1743188 1743197 1743698 1743713) (-1067 "RING.spad" 1742666 1742677 1743178 1743183) (-1066 "RIDIST.spad" 1742058 1742067 1742656 1742661) (-1065 "RGCHAIN.spad" 1740586 1740602 1741488 1741515) (-1064 "RGBCSPC.spad" 1740367 1740379 1740576 1740581) (-1063 "RGBCMDL.spad" 1739897 1739909 1740357 1740362) (-1062 "RF.spad" 1737539 1737550 1739887 1739892) (-1061 "RFFACTOR.spad" 1737001 1737012 1737529 1737534) (-1060 "RFFACT.spad" 1736736 1736748 1736991 1736996) (-1059 "RFDIST.spad" 1735732 1735741 1736726 1736731) (-1058 "RETSOL.spad" 1735151 1735164 1735722 1735727) (-1057 "RETRACT.spad" 1734579 1734590 1735141 1735146) (-1056 "RETRACT.spad" 1734005 1734018 1734569 1734574) (-1055 "RETAST.spad" 1733817 1733826 1733995 1734000) (-1054 "RESULT.spad" 1731415 1731424 1732002 1732029) (-1053 "RESRING.spad" 1730762 1730809 1731353 1731410) (-1052 "RESLATC.spad" 1730086 1730097 1730752 1730757) (-1051 "REPSQ.spad" 1729817 1729828 1730076 1730081) (-1050 "REP.spad" 1727371 1727380 1729807 1729812) (-1049 "REPDB.spad" 1727078 1727089 1727361 1727366) (-1048 "REP2.spad" 1716736 1716747 1726920 1726925) (-1047 "REP1.spad" 1710932 1710943 1716686 1716691) (-1046 "REGSET.spad" 1708693 1708710 1710542 1710569) (-1045 "REF.spad" 1708028 1708039 1708648 1708653) (-1044 "REDORDER.spad" 1707234 1707251 1708018 1708023) (-1043 "RECLOS.spad" 1706017 1706037 1706721 1706814) (-1042 "REALSOLV.spad" 1705157 1705166 1706007 1706012) (-1041 "REAL.spad" 1705029 1705038 1705147 1705152) (-1040 "REAL0Q.spad" 1702327 1702342 1705019 1705024) (-1039 "REAL0.spad" 1699171 1699186 1702317 1702322) (-1038 "RDUCEAST.spad" 1698892 1698901 1699161 1699166) (-1037 "RDIV.spad" 1698547 1698572 1698882 1698887) (-1036 "RDIST.spad" 1698114 1698125 1698537 1698542) (-1035 "RDETRS.spad" 1696978 1696996 1698104 1698109) (-1034 "RDETR.spad" 1695117 1695135 1696968 1696973) (-1033 "RDEEFS.spad" 1694216 1694233 1695107 1695112) (-1032 "RDEEF.spad" 1693226 1693243 1694206 1694211) (-1031 "RCFIELD.spad" 1690412 1690421 1693128 1693221) (-1030 "RCFIELD.spad" 1687684 1687695 1690402 1690407) (-1029 "RCAGG.spad" 1685612 1685623 1687674 1687679) (-1028 "RCAGG.spad" 1683467 1683480 1685531 1685536) (-1027 "RATRET.spad" 1682827 1682838 1683457 1683462) (-1026 "RATFACT.spad" 1682519 1682531 1682817 1682822) (-1025 "RANDSRC.spad" 1681838 1681847 1682509 1682514) (-1024 "RADUTIL.spad" 1681594 1681603 1681828 1681833) (-1023 "RADIX.spad" 1678418 1678432 1679964 1680057) (-1022 "RADFF.spad" 1676157 1676194 1676276 1676432) (-1021 "RADCAT.spad" 1675752 1675761 1676147 1676152) (-1020 "RADCAT.spad" 1675345 1675356 1675742 1675747) (-1019 "QUEUE.spad" 1674576 1674587 1674835 1674862) (-1018 "QUAT.spad" 1673064 1673075 1673407 1673472) (-1017 "QUATCT2.spad" 1672684 1672703 1673054 1673059) (-1016 "QUATCAT.spad" 1670854 1670865 1672614 1672679) (-1015 "QUATCAT.spad" 1668775 1668788 1670537 1670542) (-1014 "QUAGG.spad" 1667602 1667613 1668743 1668770) (-1013 "QQUTAST.spad" 1667370 1667379 1667592 1667597) (-1012 "QFORM.spad" 1666988 1667003 1667360 1667365) (-1011 "QFCAT.spad" 1665690 1665701 1666890 1666983) (-1010 "QFCAT.spad" 1663983 1663996 1665185 1665190) (-1009 "QFCAT2.spad" 1663675 1663692 1663973 1663978) (-1008 "QEQUAT.spad" 1663233 1663242 1663665 1663670) (-1007 "QCMPACK.spad" 1657979 1657999 1663223 1663228) (-1006 "QALGSET.spad" 1654057 1654090 1657893 1657898) (-1005 "QALGSET2.spad" 1652052 1652071 1654047 1654052) (-1004 "PWFFINTB.spad" 1649467 1649489 1652042 1652047) (-1003 "PUSHVAR.spad" 1648805 1648825 1649457 1649462) (-1002 "PTRANFN.spad" 1644932 1644943 1648795 1648800) (-1001 "PTPACK.spad" 1642019 1642030 1644922 1644927) (-1000 "PTFUNC2.spad" 1641841 1641856 1642009 1642014) (-999 "PTCAT.spad" 1641096 1641106 1641809 1641836) (-998 "PSQFR.spad" 1640403 1640427 1641086 1641091) (-997 "PSEUDLIN.spad" 1639289 1639299 1640393 1640398) (-996 "PSETPK.spad" 1624722 1624738 1639167 1639172) (-995 "PSETCAT.spad" 1618642 1618665 1624702 1624717) (-994 "PSETCAT.spad" 1612536 1612561 1618598 1618603) (-993 "PSCURVE.spad" 1611519 1611527 1612526 1612531) (-992 "PSCAT.spad" 1610302 1610331 1611417 1611514) (-991 "PSCAT.spad" 1609175 1609206 1610292 1610297) (-990 "PRTITION.spad" 1607873 1607881 1609165 1609170) (-989 "PRTDAST.spad" 1607592 1607600 1607863 1607868) (-988 "PRS.spad" 1597154 1597171 1607548 1607553) (-987 "PRQAGG.spad" 1596589 1596599 1597122 1597149) (-986 "PROPLOG.spad" 1596161 1596169 1596579 1596584) (-985 "PROPFUN2.spad" 1595784 1595797 1596151 1596156) (-984 "PROPFUN1.spad" 1595182 1595193 1595774 1595779) (-983 "PROPFRML.spad" 1593750 1593761 1595172 1595177) (-982 "PROPERTY.spad" 1593238 1593246 1593740 1593745) (-981 "PRODUCT.spad" 1590920 1590932 1591204 1591259) (-980 "PR.spad" 1589312 1589324 1590011 1590138) (-979 "PRINT.spad" 1589064 1589072 1589302 1589307) (-978 "PRIMES.spad" 1587317 1587327 1589054 1589059) (-977 "PRIMELT.spad" 1585398 1585412 1587307 1587312) (-976 "PRIMCAT.spad" 1585025 1585033 1585388 1585393) (-975 "PRIMARR.spad" 1583877 1583887 1584055 1584082) (-974 "PRIMARR2.spad" 1582644 1582656 1583867 1583872) (-973 "PREASSOC.spad" 1582026 1582038 1582634 1582639) (-972 "PPCURVE.spad" 1581163 1581171 1582016 1582021) (-971 "PORTNUM.spad" 1580938 1580946 1581153 1581158) (-970 "POLYROOT.spad" 1579787 1579809 1580894 1580899) (-969 "POLY.spad" 1577122 1577132 1577637 1577764) (-968 "POLYLIFT.spad" 1576387 1576410 1577112 1577117) (-967 "POLYCATQ.spad" 1574505 1574527 1576377 1576382) (-966 "POLYCAT.spad" 1567975 1567996 1574373 1574500) (-965 "POLYCAT.spad" 1560783 1560806 1567183 1567188) (-964 "POLY2UP.spad" 1560235 1560249 1560773 1560778) (-963 "POLY2.spad" 1559832 1559844 1560225 1560230) (-962 "POLUTIL.spad" 1558773 1558802 1559788 1559793) (-961 "POLTOPOL.spad" 1557521 1557536 1558763 1558768) (-960 "POINT.spad" 1556206 1556216 1556293 1556320) (-959 "PNTHEORY.spad" 1552908 1552916 1556196 1556201) (-958 "PMTOOLS.spad" 1551683 1551697 1552898 1552903) (-957 "PMSYM.spad" 1551232 1551242 1551673 1551678) (-956 "PMQFCAT.spad" 1550823 1550837 1551222 1551227) (-955 "PMPRED.spad" 1550302 1550316 1550813 1550818) (-954 "PMPREDFS.spad" 1549756 1549778 1550292 1550297) (-953 "PMPLCAT.spad" 1548836 1548854 1549688 1549693) (-952 "PMLSAGG.spad" 1548421 1548435 1548826 1548831) (-951 "PMKERNEL.spad" 1548000 1548012 1548411 1548416) (-950 "PMINS.spad" 1547580 1547590 1547990 1547995) (-949 "PMFS.spad" 1547157 1547175 1547570 1547575) (-948 "PMDOWN.spad" 1546447 1546461 1547147 1547152) (-947 "PMASS.spad" 1545457 1545465 1546437 1546442) (-946 "PMASSFS.spad" 1544424 1544440 1545447 1545452) (-945 "PLOTTOOL.spad" 1544204 1544212 1544414 1544419) (-944 "PLOT.spad" 1539127 1539135 1544194 1544199) (-943 "PLOT3D.spad" 1535591 1535599 1539117 1539122) (-942 "PLOT1.spad" 1534748 1534758 1535581 1535586) (-941 "PLEQN.spad" 1522038 1522065 1534738 1534743) (-940 "PINTERP.spad" 1521660 1521679 1522028 1522033) (-939 "PINTERPA.spad" 1521444 1521460 1521650 1521655) (-938 "PI.spad" 1521053 1521061 1521418 1521439) (-937 "PID.spad" 1520023 1520031 1520979 1521048) (-936 "PICOERCE.spad" 1519680 1519690 1520013 1520018) (-935 "PGROEB.spad" 1518281 1518295 1519670 1519675) (-934 "PGE.spad" 1509898 1509906 1518271 1518276) (-933 "PGCD.spad" 1508788 1508805 1509888 1509893) (-932 "PFRPAC.spad" 1507937 1507947 1508778 1508783) (-931 "PFR.spad" 1504600 1504610 1507839 1507932) (-930 "PFOTOOLS.spad" 1503858 1503874 1504590 1504595) (-929 "PFOQ.spad" 1503228 1503246 1503848 1503853) (-928 "PFO.spad" 1502647 1502674 1503218 1503223) (-927 "PF.spad" 1502221 1502233 1502452 1502545) (-926 "PFECAT.spad" 1499903 1499911 1502147 1502216) (-925 "PFECAT.spad" 1497613 1497623 1499859 1499864) (-924 "PFBRU.spad" 1495501 1495513 1497603 1497608) (-923 "PFBR.spad" 1493061 1493084 1495491 1495496) (-922 "PERM.spad" 1488868 1488878 1492891 1492906) (-921 "PERMGRP.spad" 1483638 1483648 1488858 1488863) (-920 "PERMCAT.spad" 1482299 1482309 1483618 1483633) (-919 "PERMAN.spad" 1480831 1480845 1482289 1482294) (-918 "PENDTREE.spad" 1480055 1480065 1480343 1480348) (-917 "PDSPC.spad" 1478868 1478878 1480045 1480050) (-916 "PDSPC.spad" 1477679 1477691 1478858 1478863) (-915 "PDRING.spad" 1477521 1477531 1477659 1477674) (-914 "PDMOD.spad" 1477337 1477349 1477489 1477516) (-913 "PDEPROB.spad" 1476352 1476360 1477327 1477332) (-912 "PDEPACK.spad" 1470392 1470400 1476342 1476347) (-911 "PDECOMP.spad" 1469862 1469879 1470382 1470387) (-910 "PDECAT.spad" 1468218 1468226 1469852 1469857) (-909 "PDDOM.spad" 1467656 1467669 1468208 1468213) (-908 "PDDOM.spad" 1467092 1467107 1467646 1467651) (-907 "PCOMP.spad" 1466945 1466958 1467082 1467087) (-906 "PBWLB.spad" 1465533 1465550 1466935 1466940) (-905 "PATTERN.spad" 1460072 1460082 1465523 1465528) (-904 "PATTERN2.spad" 1459810 1459822 1460062 1460067) (-903 "PATTERN1.spad" 1458146 1458162 1459800 1459805) (-902 "PATRES.spad" 1455721 1455733 1458136 1458141) (-901 "PATRES2.spad" 1455393 1455407 1455711 1455716) (-900 "PATMATCH.spad" 1453590 1453621 1455101 1455106) (-899 "PATMAB.spad" 1453019 1453029 1453580 1453585) (-898 "PATLRES.spad" 1452105 1452119 1453009 1453014) (-897 "PATAB.spad" 1451869 1451879 1452095 1452100) (-896 "PARTPERM.spad" 1449877 1449885 1451859 1451864) (-895 "PARSURF.spad" 1449311 1449339 1449867 1449872) (-894 "PARSU2.spad" 1449108 1449124 1449301 1449306) (-893 "script-parser.spad" 1448628 1448636 1449098 1449103) (-892 "PARSCURV.spad" 1448062 1448090 1448618 1448623) (-891 "PARSC2.spad" 1447853 1447869 1448052 1448057) (-890 "PARPCURV.spad" 1447315 1447343 1447843 1447848) (-889 "PARPC2.spad" 1447106 1447122 1447305 1447310) (-888 "PARAMAST.spad" 1446234 1446242 1447096 1447101) (-887 "PAN2EXPR.spad" 1445646 1445654 1446224 1446229) (-886 "PALETTE.spad" 1444616 1444624 1445636 1445641) (-885 "PAIR.spad" 1443603 1443616 1444204 1444209) (-884 "PADICRC.spad" 1440844 1440862 1442015 1442108) (-883 "PADICRAT.spad" 1438752 1438764 1438973 1439066) (-882 "PADIC.spad" 1438447 1438459 1438678 1438747) (-881 "PADICCT.spad" 1436996 1437008 1438373 1438442) (-880 "PADEPAC.spad" 1435685 1435704 1436986 1436991) (-879 "PADE.spad" 1434437 1434453 1435675 1435680) (-878 "OWP.spad" 1433677 1433707 1434295 1434362) (-877 "OVERSET.spad" 1433250 1433258 1433667 1433672) (-876 "OVAR.spad" 1433031 1433054 1433240 1433245) (-875 "OUT.spad" 1432117 1432125 1433021 1433026) (-874 "OUTFORM.spad" 1421509 1421517 1432107 1432112) (-873 "OUTBFILE.spad" 1420927 1420935 1421499 1421504) (-872 "OUTBCON.spad" 1419933 1419941 1420917 1420922) (-871 "OUTBCON.spad" 1418937 1418947 1419923 1419928) (-870 "OSI.spad" 1418412 1418420 1418927 1418932) (-869 "OSGROUP.spad" 1418330 1418338 1418402 1418407) (-868 "ORTHPOL.spad" 1416815 1416825 1418247 1418252) (-867 "OREUP.spad" 1416268 1416296 1416495 1416534) (-866 "ORESUP.spad" 1415569 1415593 1415948 1415987) (-865 "OREPCTO.spad" 1413426 1413438 1415489 1415494) (-864 "OREPCAT.spad" 1407573 1407583 1413382 1413421) (-863 "OREPCAT.spad" 1401610 1401622 1407421 1407426) (-862 "ORDSET.spad" 1400782 1400790 1401600 1401605) (-861 "ORDSET.spad" 1399952 1399962 1400772 1400777) (-860 "ORDRING.spad" 1399342 1399350 1399932 1399947) (-859 "ORDRING.spad" 1398740 1398750 1399332 1399337) (-858 "ORDMON.spad" 1398595 1398603 1398730 1398735) (-857 "ORDFUNS.spad" 1397727 1397743 1398585 1398590) (-856 "ORDFIN.spad" 1397547 1397555 1397717 1397722) (-855 "ORDCOMP.spad" 1396012 1396022 1397094 1397123) (-854 "ORDCOMP2.spad" 1395305 1395317 1396002 1396007) (-853 "OPTPROB.spad" 1393943 1393951 1395295 1395300) (-852 "OPTPACK.spad" 1386352 1386360 1393933 1393938) (-851 "OPTCAT.spad" 1384031 1384039 1386342 1386347) (-850 "OPSIG.spad" 1383685 1383693 1384021 1384026) (-849 "OPQUERY.spad" 1383234 1383242 1383675 1383680) (-848 "OP.spad" 1382976 1382986 1383056 1383123) (-847 "OPERCAT.spad" 1382442 1382452 1382966 1382971) (-846 "OPERCAT.spad" 1381906 1381918 1382432 1382437) (-845 "ONECOMP.spad" 1380651 1380661 1381453 1381482) (-844 "ONECOMP2.spad" 1380075 1380087 1380641 1380646) (-843 "OMSERVER.spad" 1379081 1379089 1380065 1380070) (-842 "OMSAGG.spad" 1378869 1378879 1379037 1379076) (-841 "OMPKG.spad" 1377485 1377493 1378859 1378864) (-840 "OM.spad" 1376458 1376466 1377475 1377480) (-839 "OMLO.spad" 1375883 1375895 1376344 1376383) (-838 "OMEXPR.spad" 1375717 1375727 1375873 1375878) (-837 "OMERR.spad" 1375262 1375270 1375707 1375712) (-836 "OMERRK.spad" 1374296 1374304 1375252 1375257) (-835 "OMENC.spad" 1373640 1373648 1374286 1374291) (-834 "OMDEV.spad" 1367949 1367957 1373630 1373635) (-833 "OMCONN.spad" 1367358 1367366 1367939 1367944) (-832 "OINTDOM.spad" 1367121 1367129 1367284 1367353) (-831 "OFMONOID.spad" 1365244 1365254 1367077 1367082) (-830 "ODVAR.spad" 1364505 1364515 1365234 1365239) (-829 "ODR.spad" 1364149 1364175 1364317 1364466) (-828 "ODPOL.spad" 1361438 1361448 1361778 1361905) (-827 "ODP.spad" 1349252 1349272 1349625 1349724) (-826 "ODETOOLS.spad" 1347901 1347920 1349242 1349247) (-825 "ODESYS.spad" 1345595 1345612 1347891 1347896) (-824 "ODERTRIC.spad" 1341604 1341621 1345552 1345557) (-823 "ODERED.spad" 1341003 1341027 1341594 1341599) (-822 "ODERAT.spad" 1338618 1338635 1340993 1340998) (-821 "ODEPRRIC.spad" 1335655 1335677 1338608 1338613) (-820 "ODEPROB.spad" 1334912 1334920 1335645 1335650) (-819 "ODEPRIM.spad" 1332246 1332268 1334902 1334907) (-818 "ODEPAL.spad" 1331632 1331656 1332236 1332241) (-817 "ODEPACK.spad" 1318298 1318306 1331622 1331627) (-816 "ODEINT.spad" 1317733 1317749 1318288 1318293) (-815 "ODEIFTBL.spad" 1315128 1315136 1317723 1317728) (-814 "ODEEF.spad" 1310619 1310635 1315118 1315123) (-813 "ODECONST.spad" 1310156 1310174 1310609 1310614) (-812 "ODECAT.spad" 1308754 1308762 1310146 1310151) (-811 "OCT.spad" 1306890 1306900 1307604 1307643) (-810 "OCTCT2.spad" 1306536 1306557 1306880 1306885) (-809 "OC.spad" 1304332 1304342 1306492 1306531) (-808 "OC.spad" 1301853 1301865 1304015 1304020) (-807 "OCAMON.spad" 1301701 1301709 1301843 1301848) (-806 "OASGP.spad" 1301516 1301524 1301691 1301696) (-805 "OAMONS.spad" 1301038 1301046 1301506 1301511) (-804 "OAMON.spad" 1300899 1300907 1301028 1301033) (-803 "OAGROUP.spad" 1300761 1300769 1300889 1300894) (-802 "NUMTUBE.spad" 1300352 1300368 1300751 1300756) (-801 "NUMQUAD.spad" 1288328 1288336 1300342 1300347) (-800 "NUMODE.spad" 1279682 1279690 1288318 1288323) (-799 "NUMINT.spad" 1277248 1277256 1279672 1279677) (-798 "NUMFMT.spad" 1276088 1276096 1277238 1277243) (-797 "NUMERIC.spad" 1268202 1268212 1275893 1275898) (-796 "NTSCAT.spad" 1266710 1266726 1268170 1268197) (-795 "NTPOLFN.spad" 1266261 1266271 1266627 1266632) (-794 "NSUP.spad" 1259214 1259224 1263754 1263907) (-793 "NSUP2.spad" 1258606 1258618 1259204 1259209) (-792 "NSMP.spad" 1254836 1254855 1255144 1255271) (-791 "NREP.spad" 1253214 1253228 1254826 1254831) (-790 "NPCOEF.spad" 1252460 1252480 1253204 1253209) (-789 "NORMRETR.spad" 1252058 1252097 1252450 1252455) (-788 "NORMPK.spad" 1249960 1249979 1252048 1252053) (-787 "NORMMA.spad" 1249648 1249674 1249950 1249955) (-786 "NONE.spad" 1249389 1249397 1249638 1249643) (-785 "NONE1.spad" 1249065 1249075 1249379 1249384) (-784 "NODE1.spad" 1248552 1248568 1249055 1249060) (-783 "NNI.spad" 1247447 1247455 1248526 1248547) (-782 "NLINSOL.spad" 1246073 1246083 1247437 1247442) (-781 "NIPROB.spad" 1244614 1244622 1246063 1246068) (-780 "NFINTBAS.spad" 1242174 1242191 1244604 1244609) (-779 "NETCLT.spad" 1242148 1242159 1242164 1242169) (-778 "NCODIV.spad" 1240364 1240380 1242138 1242143) (-777 "NCNTFRAC.spad" 1240006 1240020 1240354 1240359) (-776 "NCEP.spad" 1238172 1238186 1239996 1240001) (-775 "NASRING.spad" 1237768 1237776 1238162 1238167) (-774 "NASRING.spad" 1237362 1237372 1237758 1237763) (-773 "NARNG.spad" 1236714 1236722 1237352 1237357) (-772 "NARNG.spad" 1236064 1236074 1236704 1236709) (-771 "NAGSP.spad" 1235141 1235149 1236054 1236059) (-770 "NAGS.spad" 1224802 1224810 1235131 1235136) (-769 "NAGF07.spad" 1223233 1223241 1224792 1224797) (-768 "NAGF04.spad" 1217635 1217643 1223223 1223228) (-767 "NAGF02.spad" 1211704 1211712 1217625 1217630) (-766 "NAGF01.spad" 1207465 1207473 1211694 1211699) (-765 "NAGE04.spad" 1201165 1201173 1207455 1207460) (-764 "NAGE02.spad" 1191825 1191833 1201155 1201160) (-763 "NAGE01.spad" 1187827 1187835 1191815 1191820) (-762 "NAGD03.spad" 1185831 1185839 1187817 1187822) (-761 "NAGD02.spad" 1178578 1178586 1185821 1185826) (-760 "NAGD01.spad" 1172871 1172879 1178568 1178573) (-759 "NAGC06.spad" 1168746 1168754 1172861 1172866) (-758 "NAGC05.spad" 1167247 1167255 1168736 1168741) (-757 "NAGC02.spad" 1166514 1166522 1167237 1167242) (-756 "NAALG.spad" 1166055 1166065 1166482 1166509) (-755 "NAALG.spad" 1165616 1165628 1166045 1166050) (-754 "MULTSQFR.spad" 1162574 1162591 1165606 1165611) (-753 "MULTFACT.spad" 1161957 1161974 1162564 1162569) (-752 "MTSCAT.spad" 1160051 1160072 1161855 1161952) (-751 "MTHING.spad" 1159710 1159720 1160041 1160046) (-750 "MSYSCMD.spad" 1159144 1159152 1159700 1159705) (-749 "MSET.spad" 1157066 1157076 1158814 1158853) (-748 "MSETAGG.spad" 1156911 1156921 1157034 1157061) (-747 "MRING.spad" 1153888 1153900 1156619 1156686) (-746 "MRF2.spad" 1153458 1153472 1153878 1153883) (-745 "MRATFAC.spad" 1153004 1153021 1153448 1153453) (-744 "MPRFF.spad" 1151044 1151063 1152994 1152999) (-743 "MPOLY.spad" 1148515 1148530 1148874 1149001) (-742 "MPCPF.spad" 1147779 1147798 1148505 1148510) (-741 "MPC3.spad" 1147596 1147636 1147769 1147774) (-740 "MPC2.spad" 1147242 1147275 1147586 1147591) (-739 "MONOTOOL.spad" 1145593 1145610 1147232 1147237) (-738 "MONOID.spad" 1144912 1144920 1145583 1145588) (-737 "MONOID.spad" 1144229 1144239 1144902 1144907) (-736 "MONOGEN.spad" 1142977 1142990 1144089 1144224) (-735 "MONOGEN.spad" 1141747 1141762 1142861 1142866) (-734 "MONADWU.spad" 1139777 1139785 1141737 1141742) (-733 "MONADWU.spad" 1137805 1137815 1139767 1139772) (-732 "MONAD.spad" 1136965 1136973 1137795 1137800) (-731 "MONAD.spad" 1136123 1136133 1136955 1136960) (-730 "MOEBIUS.spad" 1134859 1134873 1136103 1136118) (-729 "MODULE.spad" 1134729 1134739 1134827 1134854) (-728 "MODULE.spad" 1134619 1134631 1134719 1134724) (-727 "MODRING.spad" 1133954 1133993 1134599 1134614) (-726 "MODOP.spad" 1132619 1132631 1133776 1133843) (-725 "MODMONOM.spad" 1132350 1132368 1132609 1132614) (-724 "MODMON.spad" 1129052 1129068 1129771 1129924) (-723 "MODFIELD.spad" 1128414 1128453 1128954 1129047) (-722 "MMLFORM.spad" 1127274 1127282 1128404 1128409) (-721 "MMAP.spad" 1127016 1127050 1127264 1127269) (-720 "MLO.spad" 1125475 1125485 1126972 1127011) (-719 "MLIFT.spad" 1124087 1124104 1125465 1125470) (-718 "MKUCFUNC.spad" 1123622 1123640 1124077 1124082) (-717 "MKRECORD.spad" 1123226 1123239 1123612 1123617) (-716 "MKFUNC.spad" 1122633 1122643 1123216 1123221) (-715 "MKFLCFN.spad" 1121601 1121611 1122623 1122628) (-714 "MKBCFUNC.spad" 1121096 1121114 1121591 1121596) (-713 "MINT.spad" 1120535 1120543 1120998 1121091) (-712 "MHROWRED.spad" 1119046 1119056 1120525 1120530) (-711 "MFLOAT.spad" 1117566 1117574 1118936 1119041) (-710 "MFINFACT.spad" 1116966 1116988 1117556 1117561) (-709 "MESH.spad" 1114748 1114756 1116956 1116961) (-708 "MDDFACT.spad" 1112959 1112969 1114738 1114743) (-707 "MDAGG.spad" 1112250 1112260 1112939 1112954) (-706 "MCMPLX.spad" 1107681 1107689 1108295 1108496) (-705 "MCDEN.spad" 1106891 1106903 1107671 1107676) (-704 "MCALCFN.spad" 1104013 1104039 1106881 1106886) (-703 "MAYBE.spad" 1103297 1103308 1104003 1104008) (-702 "MATSTOR.spad" 1100605 1100615 1103287 1103292) (-701 "MATRIX.spad" 1099192 1099202 1099676 1099703) (-700 "MATLIN.spad" 1096536 1096560 1099076 1099081) (-699 "MATCAT.spad" 1088058 1088080 1096504 1096531) (-698 "MATCAT.spad" 1079452 1079476 1087900 1087905) (-697 "MATCAT2.spad" 1078734 1078782 1079442 1079447) (-696 "MAPPKG3.spad" 1077649 1077663 1078724 1078729) (-695 "MAPPKG2.spad" 1076987 1076999 1077639 1077644) (-694 "MAPPKG1.spad" 1075815 1075825 1076977 1076982) (-693 "MAPPAST.spad" 1075130 1075138 1075805 1075810) (-692 "MAPHACK3.spad" 1074942 1074956 1075120 1075125) (-691 "MAPHACK2.spad" 1074711 1074723 1074932 1074937) (-690 "MAPHACK1.spad" 1074355 1074365 1074701 1074706) (-689 "MAGMA.spad" 1072145 1072162 1074345 1074350) (-688 "MACROAST.spad" 1071724 1071732 1072135 1072140) (-687 "M3D.spad" 1069327 1069337 1070985 1070990) (-686 "LZSTAGG.spad" 1066565 1066575 1069317 1069322) (-685 "LZSTAGG.spad" 1063801 1063813 1066555 1066560) (-684 "LWORD.spad" 1060506 1060523 1063791 1063796) (-683 "LSTAST.spad" 1060290 1060298 1060496 1060501) (-682 "LSQM.spad" 1058447 1058461 1058841 1058892) (-681 "LSPP.spad" 1057982 1057999 1058437 1058442) (-680 "LSMP.spad" 1056832 1056860 1057972 1057977) (-679 "LSMP1.spad" 1054650 1054664 1056822 1056827) (-678 "LSAGG.spad" 1054319 1054329 1054618 1054645) (-677 "LSAGG.spad" 1054008 1054020 1054309 1054314) (-676 "LPOLY.spad" 1052962 1052981 1053864 1053933) (-675 "LPEFRAC.spad" 1052233 1052243 1052952 1052957) (-674 "LO.spad" 1051634 1051648 1052167 1052194) (-673 "LOGIC.spad" 1051236 1051244 1051624 1051629) (-672 "LOGIC.spad" 1050836 1050846 1051226 1051231) (-671 "LODOOPS.spad" 1049766 1049778 1050826 1050831) (-670 "LODO.spad" 1049150 1049166 1049446 1049485) (-669 "LODOF.spad" 1048196 1048213 1049107 1049112) (-668 "LODOCAT.spad" 1046862 1046872 1048152 1048191) (-667 "LODOCAT.spad" 1045526 1045538 1046818 1046823) (-666 "LODO2.spad" 1044799 1044811 1045206 1045245) (-665 "LODO1.spad" 1044199 1044209 1044479 1044518) (-664 "LODEEF.spad" 1043001 1043019 1044189 1044194) (-663 "LNAGG.spad" 1039148 1039158 1042991 1042996) (-662 "LNAGG.spad" 1035259 1035271 1039104 1039109) (-661 "LMOPS.spad" 1032027 1032044 1035249 1035254) (-660 "LMODULE.spad" 1031795 1031805 1032017 1032022) (-659 "LMDICT.spad" 1030965 1030975 1031229 1031256) (-658 "LLINSET.spad" 1030672 1030682 1030955 1030960) (-657 "LITERAL.spad" 1030578 1030589 1030662 1030667) (-656 "LIST.spad" 1028160 1028170 1029572 1029599) (-655 "LIST3.spad" 1027471 1027485 1028150 1028155) (-654 "LIST2.spad" 1026173 1026185 1027461 1027466) (-653 "LIST2MAP.spad" 1023076 1023088 1026163 1026168) (-652 "LINSET.spad" 1022855 1022865 1023066 1023071) (-651 "LINEXP.spad" 1021598 1021608 1022845 1022850) (-650 "LINDEP.spad" 1020407 1020419 1021510 1021515) (-649 "LIMITRF.spad" 1018335 1018345 1020397 1020402) (-648 "LIMITPS.spad" 1017238 1017251 1018325 1018330) (-647 "LIE.spad" 1015254 1015266 1016528 1016673) (-646 "LIECAT.spad" 1014730 1014740 1015180 1015249) (-645 "LIECAT.spad" 1014234 1014246 1014686 1014691) (-644 "LIB.spad" 1011985 1011993 1012431 1012446) (-643 "LGROBP.spad" 1009338 1009357 1011975 1011980) (-642 "LF.spad" 1008293 1008309 1009328 1009333) (-641 "LFCAT.spad" 1007352 1007360 1008283 1008288) (-640 "LEXTRIPK.spad" 1002855 1002870 1007342 1007347) (-639 "LEXP.spad" 1000858 1000885 1002835 1002850) (-638 "LETAST.spad" 1000557 1000565 1000848 1000853) (-637 "LEADCDET.spad" 998955 998972 1000547 1000552) (-636 "LAZM3PK.spad" 997659 997681 998945 998950) (-635 "LAUPOL.spad" 996259 996272 997159 997228) (-634 "LAPLACE.spad" 995842 995858 996249 996254) (-633 "LA.spad" 995282 995296 995764 995803) (-632 "LALG.spad" 995058 995068 995262 995277) (-631 "LALG.spad" 994842 994854 995048 995053) (-630 "KVTFROM.spad" 994577 994587 994832 994837) (-629 "KTVLOGIC.spad" 994089 994097 994567 994572) (-628 "KRCFROM.spad" 993827 993837 994079 994084) (-627 "KOVACIC.spad" 992550 992567 993817 993822) (-626 "KONVERT.spad" 992272 992282 992540 992545) (-625 "KOERCE.spad" 992009 992019 992262 992267) (-624 "KERNEL.spad" 990664 990674 991793 991798) (-623 "KERNEL2.spad" 990367 990379 990654 990659) (-622 "KDAGG.spad" 989476 989498 990347 990362) (-621 "KDAGG.spad" 988593 988617 989466 989471) (-620 "KAFILE.spad" 987447 987463 987682 987709) (-619 "JORDAN.spad" 985276 985288 986737 986882) (-618 "JOINAST.spad" 984970 984978 985266 985271) (-617 "JAVACODE.spad" 984836 984844 984960 984965) (-616 "IXAGG.spad" 982969 982993 984826 984831) (-615 "IXAGG.spad" 980957 980983 982816 982821) (-614 "IVECTOR.spad" 979574 979589 979729 979756) (-613 "ITUPLE.spad" 978735 978745 979564 979569) (-612 "ITRIGMNP.spad" 977574 977593 978725 978730) (-611 "ITFUN3.spad" 977080 977094 977564 977569) (-610 "ITFUN2.spad" 976824 976836 977070 977075) (-609 "ITFORM.spad" 976179 976187 976814 976819) (-608 "ITAYLOR.spad" 974173 974188 976043 976140) (-607 "ISUPS.spad" 966610 966625 973147 973244) (-606 "ISUMP.spad" 966111 966127 966600 966605) (-605 "ISTRING.spad" 965038 965051 965119 965146) (-604 "ISAST.spad" 964757 964765 965028 965033) (-603 "IRURPK.spad" 963474 963493 964747 964752) (-602 "IRSN.spad" 961446 961454 963464 963469) (-601 "IRRF2F.spad" 959931 959941 961402 961407) (-600 "IRREDFFX.spad" 959532 959543 959921 959926) (-599 "IROOT.spad" 957871 957881 959522 959527) (-598 "IR.spad" 955672 955686 957726 957753) (-597 "IRFORM.spad" 954996 955004 955662 955667) (-596 "IR2.spad" 954024 954040 954986 954991) (-595 "IR2F.spad" 953230 953246 954014 954019) (-594 "IPRNTPK.spad" 952990 952998 953220 953225) (-593 "IPF.spad" 952555 952567 952795 952888) (-592 "IPADIC.spad" 952316 952342 952481 952550) (-591 "IP4ADDR.spad" 951873 951881 952306 952311) (-590 "IOMODE.spad" 951395 951403 951863 951868) (-589 "IOBFILE.spad" 950756 950764 951385 951390) (-588 "IOBCON.spad" 950621 950629 950746 950751) (-587 "INVLAPLA.spad" 950270 950286 950611 950616) (-586 "INTTR.spad" 943652 943669 950260 950265) (-585 "INTTOOLS.spad" 941407 941423 943226 943231) (-584 "INTSLPE.spad" 940727 940735 941397 941402) (-583 "INTRVL.spad" 940293 940303 940641 940722) (-582 "INTRF.spad" 938717 938731 940283 940288) (-581 "INTRET.spad" 938149 938159 938707 938712) (-580 "INTRAT.spad" 936876 936893 938139 938144) (-579 "INTPM.spad" 935261 935277 936519 936524) (-578 "INTPAF.spad" 933125 933143 935193 935198) (-577 "INTPACK.spad" 923499 923507 933115 933120) (-576 "INT.spad" 922947 922955 923353 923494) (-575 "INTHERTR.spad" 922221 922238 922937 922942) (-574 "INTHERAL.spad" 921891 921915 922211 922216) (-573 "INTHEORY.spad" 918330 918338 921881 921886) (-572 "INTG0.spad" 912063 912081 918262 918267) (-571 "INTFTBL.spad" 906092 906100 912053 912058) (-570 "INTFACT.spad" 905151 905161 906082 906087) (-569 "INTEF.spad" 903536 903552 905141 905146) (-568 "INTDOM.spad" 902159 902167 903462 903531) (-567 "INTDOM.spad" 900844 900854 902149 902154) (-566 "INTCAT.spad" 899103 899113 900758 900839) (-565 "INTBIT.spad" 898610 898618 899093 899098) (-564 "INTALG.spad" 897798 897825 898600 898605) (-563 "INTAF.spad" 897298 897314 897788 897793) (-562 "INTABL.spad" 895374 895405 895537 895564) (-561 "INT8.spad" 895254 895262 895364 895369) (-560 "INT64.spad" 895133 895141 895244 895249) (-559 "INT32.spad" 895012 895020 895123 895128) (-558 "INT16.spad" 894891 894899 895002 895007) (-557 "INS.spad" 892394 892402 894793 894886) (-556 "INS.spad" 889983 889993 892384 892389) (-555 "INPSIGN.spad" 889431 889444 889973 889978) (-554 "INPRODPF.spad" 888527 888546 889421 889426) (-553 "INPRODFF.spad" 887615 887639 888517 888522) (-552 "INNMFACT.spad" 886590 886607 887605 887610) (-551 "INMODGCD.spad" 886078 886108 886580 886585) (-550 "INFSP.spad" 884375 884397 886068 886073) (-549 "INFPROD0.spad" 883455 883474 884365 884370) (-548 "INFORM.spad" 880654 880662 883445 883450) (-547 "INFORM1.spad" 880279 880289 880644 880649) (-546 "INFINITY.spad" 879831 879839 880269 880274) (-545 "INETCLTS.spad" 879808 879816 879821 879826) (-544 "INEP.spad" 878346 878368 879798 879803) (-543 "INDE.spad" 878075 878092 878336 878341) (-542 "INCRMAPS.spad" 877496 877506 878065 878070) (-541 "INBFILE.spad" 876568 876576 877486 877491) (-540 "INBFF.spad" 872362 872373 876558 876563) (-539 "INBCON.spad" 870652 870660 872352 872357) (-538 "INBCON.spad" 868940 868950 870642 870647) (-537 "INAST.spad" 868601 868609 868930 868935) (-536 "IMPTAST.spad" 868309 868317 868591 868596) (-535 "IMATRIX.spad" 867137 867163 867649 867676) (-534 "IMATQF.spad" 866231 866275 867093 867098) (-533 "IMATLIN.spad" 864836 864860 866187 866192) (-532 "ILIST.spad" 863341 863356 863866 863893) (-531 "IIARRAY2.spad" 862612 862650 862831 862858) (-530 "IFF.spad" 862022 862038 862293 862386) (-529 "IFAST.spad" 861636 861644 862012 862017) (-528 "IFARRAY.spad" 858976 858991 860666 860693) (-527 "IFAMON.spad" 858838 858855 858932 858937) (-526 "IEVALAB.spad" 858243 858255 858828 858833) (-525 "IEVALAB.spad" 857646 857660 858233 858238) (-524 "IDPO.spad" 857444 857456 857636 857641) (-523 "IDPOAMS.spad" 857200 857212 857434 857439) (-522 "IDPOAM.spad" 856920 856932 857190 857195) (-521 "IDPC.spad" 855858 855870 856910 856915) (-520 "IDPAM.spad" 855603 855615 855848 855853) (-519 "IDPAG.spad" 855350 855362 855593 855598) (-518 "IDENT.spad" 855000 855008 855340 855345) (-517 "IDECOMP.spad" 852239 852257 854990 854995) (-516 "IDEAL.spad" 847188 847227 852174 852179) (-515 "ICDEN.spad" 846377 846393 847178 847183) (-514 "ICARD.spad" 845568 845576 846367 846372) (-513 "IBPTOOLS.spad" 844175 844192 845558 845563) (-512 "IBITS.spad" 843340 843353 843773 843800) (-511 "IBATOOL.spad" 840317 840336 843330 843335) (-510 "IBACHIN.spad" 838824 838839 840307 840312) (-509 "IARRAY2.spad" 837695 837721 838314 838341) (-508 "IARRAY1.spad" 836587 836602 836725 836752) (-507 "IAN.spad" 834810 834818 836403 836496) (-506 "IALGFACT.spad" 834413 834446 834800 834805) (-505 "HYPCAT.spad" 833837 833845 834403 834408) (-504 "HYPCAT.spad" 833259 833269 833827 833832) (-503 "HOSTNAME.spad" 833067 833075 833249 833254) (-502 "HOMOTOP.spad" 832810 832820 833057 833062) (-501 "HOAGG.spad" 830092 830102 832800 832805) (-500 "HOAGG.spad" 827113 827125 829823 829828) (-499 "HEXADEC.spad" 825118 825126 825483 825576) (-498 "HEUGCD.spad" 824153 824164 825108 825113) (-497 "HELLFDIV.spad" 823743 823767 824143 824148) (-496 "HEAP.spad" 823018 823028 823233 823260) (-495 "HEADAST.spad" 822551 822559 823008 823013) (-494 "HDP.spad" 810361 810377 810738 810837) (-493 "HDMP.spad" 807575 807590 808191 808318) (-492 "HB.spad" 805826 805834 807565 807570) (-491 "HASHTBL.spad" 803854 803885 804065 804092) (-490 "HASAST.spad" 803570 803578 803844 803849) (-489 "HACKPI.spad" 803061 803069 803472 803565) (-488 "GTSET.spad" 801964 801980 802671 802698) (-487 "GSTBL.spad" 800041 800076 800215 800230) (-486 "GSERIES.spad" 797354 797381 798173 798322) (-485 "GROUP.spad" 796627 796635 797334 797349) (-484 "GROUP.spad" 795908 795918 796617 796622) (-483 "GROEBSOL.spad" 794402 794423 795898 795903) (-482 "GRMOD.spad" 792973 792985 794392 794397) (-481 "GRMOD.spad" 791542 791556 792963 792968) (-480 "GRIMAGE.spad" 784431 784439 791532 791537) (-479 "GRDEF.spad" 782810 782818 784421 784426) (-478 "GRAY.spad" 781273 781281 782800 782805) (-477 "GRALG.spad" 780350 780362 781263 781268) (-476 "GRALG.spad" 779425 779439 780340 780345) (-475 "GPOLSET.spad" 778843 778866 779071 779098) (-474 "GOSPER.spad" 778112 778130 778833 778838) (-473 "GMODPOL.spad" 777260 777287 778080 778107) (-472 "GHENSEL.spad" 776343 776357 777250 777255) (-471 "GENUPS.spad" 772636 772649 776333 776338) (-470 "GENUFACT.spad" 772213 772223 772626 772631) (-469 "GENPGCD.spad" 771799 771816 772203 772208) (-468 "GENMFACT.spad" 771251 771270 771789 771794) (-467 "GENEEZ.spad" 769202 769215 771241 771246) (-466 "GDMP.spad" 766258 766275 767032 767159) (-465 "GCNAALG.spad" 760181 760208 766052 766119) (-464 "GCDDOM.spad" 759357 759365 760107 760176) (-463 "GCDDOM.spad" 758595 758605 759347 759352) (-462 "GB.spad" 756121 756159 758551 758556) (-461 "GBINTERN.spad" 752141 752179 756111 756116) (-460 "GBF.spad" 747908 747946 752131 752136) (-459 "GBEUCLID.spad" 745790 745828 747898 747903) (-458 "GAUSSFAC.spad" 745103 745111 745780 745785) (-457 "GALUTIL.spad" 743429 743439 745059 745064) (-456 "GALPOLYU.spad" 741883 741896 743419 743424) (-455 "GALFACTU.spad" 740056 740075 741873 741878) (-454 "GALFACT.spad" 730245 730256 740046 740051) (-453 "FVFUN.spad" 727268 727276 730235 730240) (-452 "FVC.spad" 726320 726328 727258 727263) (-451 "FUNDESC.spad" 725998 726006 726310 726315) (-450 "FUNCTION.spad" 725847 725859 725988 725993) (-449 "FT.spad" 724144 724152 725837 725842) (-448 "FTEM.spad" 723309 723317 724134 724139) (-447 "FSUPFACT.spad" 722209 722228 723245 723250) (-446 "FST.spad" 720295 720303 722199 722204) (-445 "FSRED.spad" 719775 719791 720285 720290) (-444 "FSPRMELT.spad" 718657 718673 719732 719737) (-443 "FSPECF.spad" 716748 716764 718647 718652) (-442 "FS.spad" 711016 711026 716523 716743) (-441 "FS.spad" 705062 705074 710571 710576) (-440 "FSINT.spad" 704722 704738 705052 705057) (-439 "FSERIES.spad" 703913 703925 704542 704641) (-438 "FSCINT.spad" 703230 703246 703903 703908) (-437 "FSAGG.spad" 702347 702357 703186 703225) (-436 "FSAGG.spad" 701426 701438 702267 702272) (-435 "FSAGG2.spad" 700169 700185 701416 701421) (-434 "FS2UPS.spad" 694660 694694 700159 700164) (-433 "FS2.spad" 694307 694323 694650 694655) (-432 "FS2EXPXP.spad" 693432 693455 694297 694302) (-431 "FRUTIL.spad" 692386 692396 693422 693427) (-430 "FR.spad" 686009 686019 691317 691386) (-429 "FRNAALG.spad" 681278 681288 685951 686004) (-428 "FRNAALG.spad" 676559 676571 681234 681239) (-427 "FRNAAF2.spad" 676015 676033 676549 676554) (-426 "FRMOD.spad" 675425 675455 675946 675951) (-425 "FRIDEAL.spad" 674650 674671 675405 675420) (-424 "FRIDEAL2.spad" 674254 674286 674640 674645) (-423 "FRETRCT.spad" 673765 673775 674244 674249) (-422 "FRETRCT.spad" 673142 673154 673623 673628) (-421 "FRAMALG.spad" 671490 671503 673098 673137) (-420 "FRAMALG.spad" 669870 669885 671480 671485) (-419 "FRAC.spad" 666876 666886 667279 667452) (-418 "FRAC2.spad" 666481 666493 666866 666871) (-417 "FR2.spad" 665817 665829 666471 666476) (-416 "FPS.spad" 662632 662640 665707 665812) (-415 "FPS.spad" 659475 659485 662552 662557) (-414 "FPC.spad" 658521 658529 659377 659470) (-413 "FPC.spad" 657653 657663 658511 658516) (-412 "FPATMAB.spad" 657415 657425 657643 657648) (-411 "FPARFRAC.spad" 656265 656282 657405 657410) (-410 "FORTRAN.spad" 654771 654814 656255 656260) (-409 "FORT.spad" 653720 653728 654761 654766) (-408 "FORTFN.spad" 650890 650898 653710 653715) (-407 "FORTCAT.spad" 650574 650582 650880 650885) (-406 "FORMULA.spad" 648048 648056 650564 650569) (-405 "FORMULA1.spad" 647527 647537 648038 648043) (-404 "FORDER.spad" 647218 647242 647517 647522) (-403 "FOP.spad" 646419 646427 647208 647213) (-402 "FNLA.spad" 645843 645865 646387 646414) (-401 "FNCAT.spad" 644438 644446 645833 645838) (-400 "FNAME.spad" 644330 644338 644428 644433) (-399 "FMTC.spad" 644128 644136 644256 644325) (-398 "FMONOID.spad" 643793 643803 644084 644089) (-397 "FMONCAT.spad" 640946 640956 643783 643788) (-396 "FM.spad" 640641 640653 640880 640907) (-395 "FMFUN.spad" 637671 637679 640631 640636) (-394 "FMC.spad" 636723 636731 637661 637666) (-393 "FMCAT.spad" 634391 634409 636691 636718) (-392 "FM1.spad" 633748 633760 634325 634352) (-391 "FLOATRP.spad" 631483 631497 633738 633743) (-390 "FLOAT.spad" 624797 624805 631349 631478) (-389 "FLOATCP.spad" 622228 622242 624787 624792) (-388 "FLINEXP.spad" 621950 621960 622218 622223) (-387 "FLINEXP.spad" 621616 621628 621886 621891) (-386 "FLASORT.spad" 620942 620954 621606 621611) (-385 "FLALG.spad" 618588 618607 620868 620937) (-384 "FLAGG.spad" 615630 615640 618568 618583) (-383 "FLAGG.spad" 612573 612585 615513 615518) (-382 "FLAGG2.spad" 611298 611314 612563 612568) (-381 "FINRALG.spad" 609359 609372 611254 611293) (-380 "FINRALG.spad" 607346 607361 609243 609248) (-379 "FINITE.spad" 606498 606506 607336 607341) (-378 "FINAALG.spad" 595619 595629 606440 606493) (-377 "FINAALG.spad" 584752 584764 595575 595580) (-376 "FILE.spad" 584335 584345 584742 584747) (-375 "FILECAT.spad" 582861 582878 584325 584330) (-374 "FIELD.spad" 582267 582275 582763 582856) (-373 "FIELD.spad" 581759 581769 582257 582262) (-372 "FGROUP.spad" 580406 580416 581739 581754) (-371 "FGLMICPK.spad" 579193 579208 580396 580401) (-370 "FFX.spad" 578568 578583 578909 579002) (-369 "FFSLPE.spad" 578071 578092 578558 578563) (-368 "FFPOLY.spad" 569333 569344 578061 578066) (-367 "FFPOLY2.spad" 568393 568410 569323 569328) (-366 "FFP.spad" 567790 567810 568109 568202) (-365 "FF.spad" 567238 567254 567471 567564) (-364 "FFNBX.spad" 565750 565770 566954 567047) (-363 "FFNBP.spad" 564263 564280 565466 565559) (-362 "FFNB.spad" 562728 562749 563944 564037) (-361 "FFINTBAS.spad" 560242 560261 562718 562723) (-360 "FFIELDC.spad" 557819 557827 560144 560237) (-359 "FFIELDC.spad" 555482 555492 557809 557814) (-358 "FFHOM.spad" 554230 554247 555472 555477) (-357 "FFF.spad" 551665 551676 554220 554225) (-356 "FFCGX.spad" 550512 550532 551381 551474) (-355 "FFCGP.spad" 549401 549421 550228 550321) (-354 "FFCG.spad" 548193 548214 549082 549175) (-353 "FFCAT.spad" 541366 541388 548032 548188) (-352 "FFCAT.spad" 534618 534642 541286 541291) (-351 "FFCAT2.spad" 534365 534405 534608 534613) (-350 "FEXPR.spad" 526082 526128 534121 534160) (-349 "FEVALAB.spad" 525790 525800 526072 526077) (-348 "FEVALAB.spad" 525283 525295 525567 525572) (-347 "FDIV.spad" 524725 524749 525273 525278) (-346 "FDIVCAT.spad" 522789 522813 524715 524720) (-345 "FDIVCAT.spad" 520851 520877 522779 522784) (-344 "FDIV2.spad" 520507 520547 520841 520846) (-343 "FCTRDATA.spad" 519515 519523 520497 520502) (-342 "FCPAK1.spad" 518082 518090 519505 519510) (-341 "FCOMP.spad" 517461 517471 518072 518077) (-340 "FC.spad" 507468 507476 517451 517456) (-339 "FAXF.spad" 500439 500453 507370 507463) (-338 "FAXF.spad" 493462 493478 500395 500400) (-337 "FARRAY.spad" 491459 491469 492492 492519) (-336 "FAMR.spad" 489595 489607 491357 491454) (-335 "FAMR.spad" 487715 487729 489479 489484) (-334 "FAMONOID.spad" 487383 487393 487669 487674) (-333 "FAMONC.spad" 485679 485691 487373 487378) (-332 "FAGROUP.spad" 485303 485313 485575 485602) (-331 "FACUTIL.spad" 483507 483524 485293 485298) (-330 "FACTFUNC.spad" 482701 482711 483497 483502) (-329 "EXPUPXS.spad" 479534 479557 480833 480982) (-328 "EXPRTUBE.spad" 476822 476830 479524 479529) (-327 "EXPRODE.spad" 473982 473998 476812 476817) (-326 "EXPR.spad" 469157 469167 469871 470166) (-325 "EXPR2UPS.spad" 465279 465292 469147 469152) (-324 "EXPR2.spad" 464984 464996 465269 465274) (-323 "EXPEXPAN.spad" 461785 461810 462417 462510) (-322 "EXIT.spad" 461456 461464 461775 461780) (-321 "EXITAST.spad" 461192 461200 461446 461451) (-320 "EVALCYC.spad" 460652 460666 461182 461187) (-319 "EVALAB.spad" 460224 460234 460642 460647) (-318 "EVALAB.spad" 459794 459806 460214 460219) (-317 "EUCDOM.spad" 457368 457376 459720 459789) (-316 "EUCDOM.spad" 455004 455014 457358 457363) (-315 "ESTOOLS.spad" 446850 446858 454994 454999) (-314 "ESTOOLS2.spad" 446453 446467 446840 446845) (-313 "ESTOOLS1.spad" 446138 446149 446443 446448) (-312 "ES.spad" 438953 438961 446128 446133) (-311 "ES.spad" 431674 431684 438851 438856) (-310 "ESCONT.spad" 428467 428475 431664 431669) (-309 "ESCONT1.spad" 428216 428228 428457 428462) (-308 "ES2.spad" 427721 427737 428206 428211) (-307 "ES1.spad" 427291 427307 427711 427716) (-306 "ERROR.spad" 424618 424626 427281 427286) (-305 "EQTBL.spad" 422648 422670 422857 422884) (-304 "EQ.spad" 417453 417463 420240 420352) (-303 "EQ2.spad" 417171 417183 417443 417448) (-302 "EP.spad" 413497 413507 417161 417166) (-301 "ENV.spad" 412175 412183 413487 413492) (-300 "ENTIRER.spad" 411843 411851 412119 412170) (-299 "EMR.spad" 411131 411172 411769 411838) (-298 "ELTAGG.spad" 409385 409404 411121 411126) (-297 "ELTAGG.spad" 407603 407624 409341 409346) (-296 "ELTAB.spad" 407078 407091 407593 407598) (-295 "ELFUTS.spad" 406465 406484 407068 407073) (-294 "ELEMFUN.spad" 406154 406162 406455 406460) (-293 "ELEMFUN.spad" 405841 405851 406144 406149) (-292 "ELAGG.spad" 403812 403822 405821 405836) (-291 "ELAGG.spad" 401720 401732 403731 403736) (-290 "ELABOR.spad" 401066 401074 401710 401715) (-289 "ELABEXPR.spad" 399998 400006 401056 401061) (-288 "EFUPXS.spad" 396774 396804 399954 399959) (-287 "EFULS.spad" 393610 393633 396730 396735) (-286 "EFSTRUC.spad" 391625 391641 393600 393605) (-285 "EF.spad" 386401 386417 391615 391620) (-284 "EAB.spad" 384677 384685 386391 386396) (-283 "E04UCFA.spad" 384213 384221 384667 384672) (-282 "E04NAFA.spad" 383790 383798 384203 384208) (-281 "E04MBFA.spad" 383370 383378 383780 383785) (-280 "E04JAFA.spad" 382906 382914 383360 383365) (-279 "E04GCFA.spad" 382442 382450 382896 382901) (-278 "E04FDFA.spad" 381978 381986 382432 382437) (-277 "E04DGFA.spad" 381514 381522 381968 381973) (-276 "E04AGNT.spad" 377364 377372 381504 381509) (-275 "DVARCAT.spad" 374254 374264 377354 377359) (-274 "DVARCAT.spad" 371142 371154 374244 374249) (-273 "DSMP.spad" 368516 368530 368821 368948) (-272 "DSEXT.spad" 367818 367828 368506 368511) (-271 "DSEXT.spad" 367027 367039 367717 367722) (-270 "DROPT.spad" 360986 360994 367017 367022) (-269 "DROPT1.spad" 360651 360661 360976 360981) (-268 "DROPT0.spad" 355508 355516 360641 360646) (-267 "DRAWPT.spad" 353681 353689 355498 355503) (-266 "DRAW.spad" 346557 346570 353671 353676) (-265 "DRAWHACK.spad" 345865 345875 346547 346552) (-264 "DRAWCX.spad" 343335 343343 345855 345860) (-263 "DRAWCURV.spad" 342882 342897 343325 343330) (-262 "DRAWCFUN.spad" 332414 332422 342872 342877) (-261 "DQAGG.spad" 330592 330602 332382 332409) (-260 "DPOLCAT.spad" 325941 325957 330460 330587) (-259 "DPOLCAT.spad" 321376 321394 325897 325902) (-258 "DPMO.spad" 313136 313152 313274 313487) (-257 "DPMM.spad" 304909 304927 305034 305247) (-256 "DOMTMPLT.spad" 304680 304688 304899 304904) (-255 "DOMCTOR.spad" 304435 304443 304670 304675) (-254 "DOMAIN.spad" 303522 303530 304425 304430) (-253 "DMP.spad" 300782 300797 301352 301479) (-252 "DMEXT.spad" 300649 300659 300750 300777) (-251 "DLP.spad" 300001 300011 300639 300644) (-250 "DLIST.spad" 298427 298437 299031 299058) (-249 "DLAGG.spad" 296844 296854 298417 298422) (-248 "DIVRING.spad" 296386 296394 296788 296839) (-247 "DIVRING.spad" 295972 295982 296376 296381) (-246 "DISPLAY.spad" 294162 294170 295962 295967) (-245 "DIRPROD.spad" 281709 281725 282349 282448) (-244 "DIRPROD2.spad" 280527 280545 281699 281704) (-243 "DIRPCAT.spad" 279720 279736 280423 280522) (-242 "DIRPCAT.spad" 278540 278558 279245 279250) (-241 "DIOSP.spad" 277365 277373 278530 278535) (-240 "DIOPS.spad" 276361 276371 277345 277360) (-239 "DIOPS.spad" 275331 275343 276317 276322) (-238 "DIFRING.spad" 275169 275177 275311 275326) (-237 "DIFFSPC.spad" 274748 274756 275159 275164) (-236 "DIFFSPC.spad" 274325 274335 274738 274743) (-235 "DIFFMOD.spad" 273814 273824 274293 274320) (-234 "DIFFDOM.spad" 272979 272990 273804 273809) (-233 "DIFFDOM.spad" 272142 272155 272969 272974) (-232 "DIFEXT.spad" 271961 271971 272122 272137) (-231 "DIAGG.spad" 271591 271601 271941 271956) (-230 "DIAGG.spad" 271229 271241 271581 271586) (-229 "DHMATRIX.spad" 269424 269434 270569 270596) (-228 "DFSFUN.spad" 263064 263072 269414 269419) (-227 "DFLOAT.spad" 259795 259803 262954 263059) (-226 "DFINTTLS.spad" 258026 258042 259785 259790) (-225 "DERHAM.spad" 255940 255972 258006 258021) (-224 "DEQUEUE.spad" 255147 255157 255430 255457) (-223 "DEGRED.spad" 254764 254778 255137 255142) (-222 "DEFINTRF.spad" 252301 252311 254754 254759) (-221 "DEFINTEF.spad" 250811 250827 252291 252296) (-220 "DEFAST.spad" 250179 250187 250801 250806) (-219 "DECIMAL.spad" 248188 248196 248549 248642) (-218 "DDFACT.spad" 246001 246018 248178 248183) (-217 "DBLRESP.spad" 245601 245625 245991 245996) (-216 "DBASE.spad" 244265 244275 245591 245596) (-215 "DATAARY.spad" 243727 243740 244255 244260) (-214 "D03FAFA.spad" 243555 243563 243717 243722) (-213 "D03EEFA.spad" 243375 243383 243545 243550) (-212 "D03AGNT.spad" 242461 242469 243365 243370) (-211 "D02EJFA.spad" 241923 241931 242451 242456) (-210 "D02CJFA.spad" 241401 241409 241913 241918) (-209 "D02BHFA.spad" 240891 240899 241391 241396) (-208 "D02BBFA.spad" 240381 240389 240881 240886) (-207 "D02AGNT.spad" 235195 235203 240371 240376) (-206 "D01WGTS.spad" 233514 233522 235185 235190) (-205 "D01TRNS.spad" 233491 233499 233504 233509) (-204 "D01GBFA.spad" 233013 233021 233481 233486) (-203 "D01FCFA.spad" 232535 232543 233003 233008) (-202 "D01ASFA.spad" 232003 232011 232525 232530) (-201 "D01AQFA.spad" 231449 231457 231993 231998) (-200 "D01APFA.spad" 230873 230881 231439 231444) (-199 "D01ANFA.spad" 230367 230375 230863 230868) (-198 "D01AMFA.spad" 229877 229885 230357 230362) (-197 "D01ALFA.spad" 229417 229425 229867 229872) (-196 "D01AKFA.spad" 228943 228951 229407 229412) (-195 "D01AJFA.spad" 228466 228474 228933 228938) (-194 "D01AGNT.spad" 224533 224541 228456 228461) (-193 "CYCLOTOM.spad" 224039 224047 224523 224528) (-192 "CYCLES.spad" 220831 220839 224029 224034) (-191 "CVMP.spad" 220248 220258 220821 220826) (-190 "CTRIGMNP.spad" 218748 218764 220238 220243) (-189 "CTOR.spad" 218439 218447 218738 218743) (-188 "CTORKIND.spad" 218042 218050 218429 218434) (-187 "CTORCAT.spad" 217291 217299 218032 218037) (-186 "CTORCAT.spad" 216538 216548 217281 217286) (-185 "CTORCALL.spad" 216127 216137 216528 216533) (-184 "CSTTOOLS.spad" 215372 215385 216117 216122) (-183 "CRFP.spad" 209096 209109 215362 215367) (-182 "CRCEAST.spad" 208816 208824 209086 209091) (-181 "CRAPACK.spad" 207867 207877 208806 208811) (-180 "CPMATCH.spad" 207371 207386 207792 207797) (-179 "CPIMA.spad" 207076 207095 207361 207366) (-178 "COORDSYS.spad" 202085 202095 207066 207071) (-177 "CONTOUR.spad" 201496 201504 202075 202080) (-176 "CONTFRAC.spad" 197246 197256 201398 201491) (-175 "CONDUIT.spad" 197004 197012 197236 197241) (-174 "COMRING.spad" 196678 196686 196942 196999) (-173 "COMPPROP.spad" 196196 196204 196668 196673) (-172 "COMPLPAT.spad" 195963 195978 196186 196191) (-171 "COMPLEX.spad" 191340 191350 191584 191845) (-170 "COMPLEX2.spad" 191055 191067 191330 191335) (-169 "COMPILER.spad" 190604 190612 191045 191050) (-168 "COMPFACT.spad" 190206 190220 190594 190599) (-167 "COMPCAT.spad" 188278 188288 189940 190201) (-166 "COMPCAT.spad" 186078 186090 187742 187747) (-165 "COMMUPC.spad" 185826 185844 186068 186073) (-164 "COMMONOP.spad" 185359 185367 185816 185821) (-163 "COMM.spad" 185170 185178 185349 185354) (-162 "COMMAAST.spad" 184933 184941 185160 185165) (-161 "COMBOPC.spad" 183848 183856 184923 184928) (-160 "COMBINAT.spad" 182615 182625 183838 183843) (-159 "COMBF.spad" 179997 180013 182605 182610) (-158 "COLOR.spad" 178834 178842 179987 179992) (-157 "COLONAST.spad" 178500 178508 178824 178829) (-156 "CMPLXRT.spad" 178211 178228 178490 178495) (-155 "CLLCTAST.spad" 177873 177881 178201 178206) (-154 "CLIP.spad" 173981 173989 177863 177868) (-153 "CLIF.spad" 172636 172652 173937 173976) (-152 "CLAGG.spad" 169141 169151 172626 172631) (-151 "CLAGG.spad" 165517 165529 169004 169009) (-150 "CINTSLPE.spad" 164848 164861 165507 165512) (-149 "CHVAR.spad" 162986 163008 164838 164843) (-148 "CHARZ.spad" 162901 162909 162966 162981) (-147 "CHARPOL.spad" 162411 162421 162891 162896) (-146 "CHARNZ.spad" 162164 162172 162391 162406) (-145 "CHAR.spad" 160038 160046 162154 162159) (-144 "CFCAT.spad" 159366 159374 160028 160033) (-143 "CDEN.spad" 158562 158576 159356 159361) (-142 "CCLASS.spad" 156673 156681 157935 157974) (-141 "CATEGORY.spad" 155715 155723 156663 156668) (-140 "CATCTOR.spad" 155606 155614 155705 155710) (-139 "CATAST.spad" 155224 155232 155596 155601) (-138 "CASEAST.spad" 154938 154946 155214 155219) (-137 "CARTEN.spad" 150305 150329 154928 154933) (-136 "CARTEN2.spad" 149695 149722 150295 150300) (-135 "CARD.spad" 146990 146998 149669 149690) (-134 "CAPSLAST.spad" 146764 146772 146980 146985) (-133 "CACHSET.spad" 146388 146396 146754 146759) (-132 "CABMON.spad" 145943 145951 146378 146383) (-131 "BYTEORD.spad" 145618 145626 145933 145938) (-130 "BYTE.spad" 145045 145053 145608 145613) (-129 "BYTEBUF.spad" 142743 142751 144053 144080) (-128 "BTREE.spad" 141699 141709 142233 142260) (-127 "BTOURN.spad" 140587 140597 141189 141216) (-126 "BTCAT.spad" 139979 139989 140555 140582) (-125 "BTCAT.spad" 139391 139403 139969 139974) (-124 "BTAGG.spad" 138857 138865 139359 139386) (-123 "BTAGG.spad" 138343 138353 138847 138852) (-122 "BSTREE.spad" 136967 136977 137833 137860) (-121 "BRILL.spad" 135164 135175 136957 136962) (-120 "BRAGG.spad" 134104 134114 135154 135159) (-119 "BRAGG.spad" 133008 133020 134060 134065) (-118 "BPADICRT.spad" 130882 130894 131137 131230) (-117 "BPADIC.spad" 130546 130558 130808 130877) (-116 "BOUNDZRO.spad" 130202 130219 130536 130541) (-115 "BOP.spad" 125384 125392 130192 130197) (-114 "BOP1.spad" 122850 122860 125374 125379) (-113 "BOOLE.spad" 122500 122508 122840 122845) (-112 "BOOLEAN.spad" 121938 121946 122490 122495) (-111 "BMODULE.spad" 121650 121662 121906 121933) (-110 "BITS.spad" 121033 121041 121248 121275) (-109 "BINDING.spad" 120446 120454 121023 121028) (-108 "BINARY.spad" 118460 118468 118816 118909) (-107 "BGAGG.spad" 117665 117675 118440 118455) (-106 "BGAGG.spad" 116878 116890 117655 117660) (-105 "BFUNCT.spad" 116442 116450 116858 116873) (-104 "BEZOUT.spad" 115582 115609 116392 116397) (-103 "BBTREE.spad" 112310 112320 115072 115099) (-102 "BASTYPE.spad" 111982 111990 112300 112305) (-101 "BASTYPE.spad" 111652 111662 111972 111977) (-100 "BALFACT.spad" 111111 111124 111642 111647) (-99 "AUTOMOR.spad" 110562 110571 111091 111106) (-98 "ATTREG.spad" 107285 107292 110314 110557) (-97 "ATTRBUT.spad" 103308 103315 107265 107280) (-96 "ATTRAST.spad" 103025 103032 103298 103303) (-95 "ATRIG.spad" 102495 102502 103015 103020) (-94 "ATRIG.spad" 101963 101972 102485 102490) (-93 "ASTCAT.spad" 101867 101874 101953 101958) (-92 "ASTCAT.spad" 101769 101778 101857 101862) (-91 "ASTACK.spad" 100991 101000 101259 101286) (-90 "ASSOCEQ.spad" 99817 99828 100947 100952) (-89 "ASP9.spad" 98898 98911 99807 99812) (-88 "ASP8.spad" 97941 97954 98888 98893) (-87 "ASP80.spad" 97263 97276 97931 97936) (-86 "ASP7.spad" 96423 96436 97253 97258) (-85 "ASP78.spad" 95874 95887 96413 96418) (-84 "ASP77.spad" 95243 95256 95864 95869) (-83 "ASP74.spad" 94335 94348 95233 95238) (-82 "ASP73.spad" 93606 93619 94325 94330) (-81 "ASP6.spad" 92473 92486 93596 93601) (-80 "ASP55.spad" 90982 90995 92463 92468) (-79 "ASP50.spad" 88799 88812 90972 90977) (-78 "ASP4.spad" 88094 88107 88789 88794) (-77 "ASP49.spad" 87093 87106 88084 88089) (-76 "ASP42.spad" 85500 85539 87083 87088) (-75 "ASP41.spad" 84079 84118 85490 85495) (-74 "ASP35.spad" 83067 83080 84069 84074) (-73 "ASP34.spad" 82368 82381 83057 83062) (-72 "ASP33.spad" 81928 81941 82358 82363) (-71 "ASP31.spad" 81068 81081 81918 81923) (-70 "ASP30.spad" 79960 79973 81058 81063) (-69 "ASP29.spad" 79426 79439 79950 79955) (-68 "ASP28.spad" 70699 70712 79416 79421) (-67 "ASP27.spad" 69596 69609 70689 70694) (-66 "ASP24.spad" 68683 68696 69586 69591) (-65 "ASP20.spad" 68147 68160 68673 68678) (-64 "ASP1.spad" 67528 67541 68137 68142) (-63 "ASP19.spad" 62214 62227 67518 67523) (-62 "ASP12.spad" 61628 61641 62204 62209) (-61 "ASP10.spad" 60899 60912 61618 61623) (-60 "ARRAY2.spad" 60142 60151 60389 60416) (-59 "ARRAY1.spad" 58826 58835 59172 59199) (-58 "ARRAY12.spad" 57539 57550 58816 58821) (-57 "ARR2CAT.spad" 53313 53334 57507 57534) (-56 "ARR2CAT.spad" 49107 49130 53303 53308) (-55 "ARITY.spad" 48479 48486 49097 49102) (-54 "APPRULE.spad" 47739 47761 48469 48474) (-53 "APPLYORE.spad" 47358 47371 47729 47734) (-52 "ANY.spad" 46217 46224 47348 47353) (-51 "ANY1.spad" 45288 45297 46207 46212) (-50 "ANTISYM.spad" 43733 43749 45268 45283) (-49 "ANON.spad" 43426 43433 43723 43728) (-48 "AN.spad" 41735 41742 43242 43335) (-47 "AMR.spad" 39920 39931 41633 41730) (-46 "AMR.spad" 37942 37955 39657 39662) (-45 "ALIST.spad" 34842 34863 35192 35219) (-44 "ALGSC.spad" 33977 34003 34714 34767) (-43 "ALGPKG.spad" 29760 29771 33933 33938) (-42 "ALGMFACT.spad" 28953 28967 29750 29755) (-41 "ALGMANIP.spad" 26427 26442 28786 28791) (-40 "ALGFF.spad" 24068 24095 24285 24441) (-39 "ALGFACT.spad" 23195 23205 24058 24063) (-38 "ALGEBRA.spad" 23028 23037 23151 23190) (-37 "ALGEBRA.spad" 22893 22904 23018 23023) (-36 "ALAGG.spad" 22405 22426 22861 22888) (-35 "AHYP.spad" 21786 21793 22395 22400) (-34 "AGG.spad" 20103 20110 21776 21781) (-33 "AGG.spad" 18384 18393 20059 20064) (-32 "AF.spad" 16815 16830 18319 18324) (-31 "ADDAST.spad" 16493 16500 16805 16810) (-30 "ACPLOT.spad" 15084 15091 16483 16488) (-29 "ACFS.spad" 12893 12902 14986 15079) (-28 "ACFS.spad" 10788 10799 12883 12888) (-27 "ACF.spad" 7470 7477 10690 10783) (-26 "ACF.spad" 4238 4247 7460 7465) (-25 "ABELSG.spad" 3779 3786 4228 4233) (-24 "ABELSG.spad" 3318 3327 3769 3774) (-23 "ABELMON.spad" 2861 2868 3308 3313) (-22 "ABELMON.spad" 2402 2411 2851 2856) (-21 "ABELGRP.spad" 2067 2074 2392 2397) (-20 "ABELGRP.spad" 1730 1739 2057 2062) (-19 "A1AGG.spad" 870 879 1698 1725) (-18 "A1AGG.spad" 30 41 860 865)) 
+\ No newline at end of file
author	dos-reis <gdr@axiomatics.org>	2010-06-27 20:40:42 +0000
committer	dos-reis <gdr@axiomatics.org>	2010-06-27 20:40:42 +0000
commit	c18c464e8da9c36f71e468d52f3090a13acb4fa9 (patch)
tree	6d2ad504471ca0e911acc1e6ba3b41ee71755ee9 /src/share/algebra/browse.daase
parent	29325dbb1fed9b472690b8541ef038f138070aea (diff)
download	open-axiom-c18c464e8da9c36f71e468d52f3090a13acb4fa9.tar.gz