* algebra/net.spad.pamphlet (resolve$Hostname): Return a Maybe %.

	(connectot$NetworkClientSocket): Likewise.
	(connectot$InetClientStreamSocket): Likewise.

1 files changed, 153 insertions, 153 deletions

diff --git a/src/share/algebra/browse.daase b/src/share/algebra/browse.daase
index 81ffe67b..d3719ea1 100644
--- a/src/share/algebra/browse.daase
+++ b/src/share/algebra/browse.daase
@@ -1,5 +1,5 @@
 
-(2276389 . 3440274381)       
+(2276380 . 3440285145)       
 (-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 -3198) 
+(-32 R -3199) 
 ((|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 -1028) (QUOTE (-558))))) 
@@ -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 -3198 UP UPUP -1783) 
+(-40 -3199 UP UPUP -2522) 
 ((|constructor| (NIL "Function field defined by \\spad{f}(\\spad{x},{} \\spad{y}) = 0.")) (|knownInfBasis| (((|Void|) (|NonNegativeInteger|)) "\\spad{knownInfBasis(n)} \\undocumented{}"))) 
 ((-4376 |has| (-406 |#2|) (-362)) (-4381 |has| (-406 |#2|) (-362)) (-4375 |has| (-406 |#2|) (-362)) ((-4385 "*") . T) (-4377 . T) (-4378 . T) (-4380 . T)) 
 ((|HasCategory| (-406 |#2|) (QUOTE (-144))) (|HasCategory| (-406 |#2|) (QUOTE (-146))) (|HasCategory| (-406 |#2|) (QUOTE (-348))) (-3996 (|HasCategory| (-406 |#2|) (QUOTE (-362))) (|HasCategory| (-406 |#2|) (QUOTE (-348)))) (|HasCategory| (-406 |#2|) (QUOTE (-362))) (|HasCategory| (-406 |#2|) (QUOTE (-367))) (-3996 (-12 (|HasCategory| (-406 |#2|) (QUOTE (-232))) (|HasCategory| (-406 |#2|) (QUOTE (-362)))) (|HasCategory| (-406 |#2|) (QUOTE (-348)))) (-3996 (-12 (|HasCategory| (-406 |#2|) (LIST (QUOTE -890) (QUOTE (-1163)))) (|HasCategory| (-406 |#2|) (QUOTE (-362)))) (-12 (|HasCategory| (-406 |#2|) (LIST (QUOTE -890) (QUOTE (-1163)))) (|HasCategory| (-406 |#2|) (QUOTE (-348))))) (|HasCategory| (-406 |#2|) (LIST (QUOTE -631) (QUOTE (-558)))) (-3996 (|HasCategory| (-406 |#2|) (LIST (QUOTE -1028) (LIST (QUOTE -406) (QUOTE (-558))))) (|HasCategory| (-406 |#2|) (QUOTE (-362)))) (|HasCategory| (-406 |#2|) (LIST (QUOTE -1028) (LIST (QUOTE -406) (QUOTE (-558))))) (|HasCategory| (-406 |#2|) (LIST (QUOTE -1028) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-367))) (-12 (|HasCategory| (-406 |#2|) (LIST (QUOTE -890) (QUOTE (-1163)))) (|HasCategory| (-406 |#2|) (QUOTE (-362)))) (-12 (|HasCategory| (-406 |#2|) (QUOTE (-232))) (|HasCategory| (-406 |#2|) (QUOTE (-362))))) 
-(-41 R -3198) 
+(-41 R -3199) 
 ((|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 (-450))) (|HasCategory| |#1| (QUOTE (-841))) (|HasCategory| |#1| (LIST (QUOTE -1028) (QUOTE (-558)))) (|HasCategory| |#2| (LIST (QUOTE -429) (|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 -3198) 
+(-54 |Base| R -3199) 
 ((|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 
@@ -388,7 +388,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| (($ $ (|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| (((|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!| (($ $ (|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| (($ $ (|String|)) "\\spad{assert(op,{} s)} attaches property \\spad{s} to \\spad{op}. Argument \\spad{op} is modified \"in place\",{} \\spadignore{i.e.} no copy is made.")) (|has?| (((|Boolean|) $ (|String|)) "\\spad{has?(op,{} s)} tests if property \\spad{s} is attached to \\spad{op}.")) (|is?| (((|Boolean|) $ (|Symbol|)) "\\spad{is?(op,{} s)} tests if the name of \\spad{op} is \\spad{s}.")) (|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.")) (|arity| (((|Union| (|NonNegativeInteger|) "failed") $) "\\spad{arity(op)} returns \\spad{n} if \\spad{op} is \\spad{n}-ary,{} and \"failed\" if \\spad{op} has arbitrary arity.")) (|operator| (($ (|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}.")) (|name| (((|Symbol|) $) "\\spad{name(op)} returns the name of \\spad{op}."))) 
 NIL 
 NIL 
-(-115 -3198 UP) 
+(-115 -3199 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 
@@ -516,7 +516,7 @@ NIL
 ((|constructor| (NIL "Rings of Characteristic Zero."))) 
 ((-4380 . T)) 
 NIL 
-(-147 -3198 UP UPUP) 
+(-147 -3199 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 
@@ -556,7 +556,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 
-(-157 R -3198) 
+(-157 R -3199) 
 ((|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 
@@ -676,7 +676,7 @@ NIL
 ((|constructor| (NIL "This domain provides implementations for constructors."))) 
 NIL 
 NIL 
-(-187 R -3198) 
+(-187 R -3199) 
 ((|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 
@@ -784,11 +784,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 
-(-214 -3198 UP UPUP R) 
+(-214 -3199 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 
-(-215 -3198 FP) 
+(-215 -3199 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 
@@ -800,7 +800,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 
-(-218 R -3198) 
+(-218 R -3199) 
 ((|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 
@@ -820,13 +820,13 @@ 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}."))) 
 ((-4380 . T)) 
 NIL 
-(-223 R -3198) 
+(-223 R -3199) 
 ((|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 
 (-224) 
 ((|constructor| (NIL "\\indented{1}{\\spadtype{DoubleFloat} is intended to make accessible} hardware floating point arithmetic in \\Language{},{} either native double precision,{} or IEEE. On most machines,{} there will be hardware support for the arithmetic operations: \\spadfunFrom{+}{DoubleFloat},{} \\spadfunFrom{*}{DoubleFloat},{} \\spadfunFrom{/}{DoubleFloat} and possibly also the \\spadfunFrom{sqrt}{DoubleFloat} operation. The operations \\spadfunFrom{exp}{DoubleFloat},{} \\spadfunFrom{log}{DoubleFloat},{} \\spadfunFrom{sin}{DoubleFloat},{} \\spadfunFrom{cos}{DoubleFloat},{} \\spadfunFrom{atan}{DoubleFloat} are normally coded in software based on minimax polynomial/rational approximations. Note that under Lisp/VM,{} \\spadfunFrom{atan}{DoubleFloat} is not available at this time. Some general comments about the accuracy of the operations: the operations \\spadfunFrom{+}{DoubleFloat},{} \\spadfunFrom{*}{DoubleFloat},{} \\spadfunFrom{/}{DoubleFloat} and \\spadfunFrom{sqrt}{DoubleFloat} are expected to be fully accurate. The operations \\spadfunFrom{exp}{DoubleFloat},{} \\spadfunFrom{log}{DoubleFloat},{} \\spadfunFrom{sin}{DoubleFloat},{} \\spadfunFrom{cos}{DoubleFloat} and \\spadfunFrom{atan}{DoubleFloat} are not expected to be fully accurate. In particular,{} \\spadfunFrom{sin}{DoubleFloat} and \\spadfunFrom{cos}{DoubleFloat} will lose all precision for large arguments. \\blankline The \\spadtype{Float} domain provides an alternative to the \\spad{DoubleFloat} domain. It provides an arbitrary precision model of floating point arithmetic. This means that accuracy problems like those above are eliminated by increasing the working precision where necessary. \\spadtype{Float} provides some special functions such as \\spadfunFrom{erf}{DoubleFloat},{} the error function in addition to the elementary functions. The disadvantage of \\spadtype{Float} is that it is much more expensive than small floats when the latter can be used.")) (|rationalApproximation| (((|Fraction| (|Integer|)) $ (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{rationalApproximation(f,{} n,{} b)} computes a rational approximation \\spad{r} to \\spad{f} with relative error \\spad{< b**(-n)} (that is,{} \\spad{|(r-f)/f| < b**(-n)}).") (((|Fraction| (|Integer|)) $ (|NonNegativeInteger|)) "\\spad{rationalApproximation(f,{} n)} computes a rational approximation \\spad{r} to \\spad{f} with relative error \\spad{< 10**(-n)}.")) (|Beta| (($ $ $) "\\spad{Beta(x,{}y)} is \\spad{Gamma(x) * Gamma(y)/Gamma(x+y)}.")) (|Gamma| (($ $) "\\spad{Gamma(x)} is the Euler Gamma function.")) (|atan| (($ $ $) "\\spad{atan(x,{}y)} computes the arc tangent from \\spad{x} with phase \\spad{y}.")) (|log10| (($ $) "\\spad{log10(x)} computes the logarithm with base 10 for \\spad{x}.")) (|log2| (($ $) "\\spad{log2(x)} computes the logarithm with base 2 for \\spad{x}.")) (|exp1| (($) "\\spad{exp1()} returns the natural log base \\spad{2.718281828...}.")) (** (($ $ $) "\\spad{x ** y} returns the \\spad{y}th power of \\spad{x} (equal to \\spad{exp(y log x)}).")) (/ (($ $ (|Integer|)) "\\spad{x / i} computes the division from \\spad{x} by an integer \\spad{i}."))) 
-((-1394 . T) (-4375 . T) (-4381 . T) (-4376 . T) ((-4385 "*") . T) (-4377 . T) (-4378 . T) (-4380 . T)) 
+((-1395 . T) (-4375 . T) (-4381 . T) (-4376 . T) ((-4385 "*") . T) (-4377 . T) (-4378 . T) (-4380 . T)) 
 NIL 
 (-225) 
 ((|constructor| (NIL "This package provides special functions for double precision real and complex floating point.")) (|hypergeometric0F1| (((|Complex| (|DoubleFloat|)) (|Complex| (|DoubleFloat|)) (|Complex| (|DoubleFloat|))) "\\spad{hypergeometric0F1(c,{}z)} is the hypergeometric function \\spad{0F1(; c; z)}.") (((|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) "\\spad{hypergeometric0F1(c,{}z)} is the hypergeometric function \\spad{0F1(; c; z)}.")) (|airyBi| (((|Complex| (|DoubleFloat|)) (|Complex| (|DoubleFloat|))) "\\spad{airyBi(x)} is the Airy function \\spad{\\spad{Bi}(x)}. This function satisfies the differential equation: \\indented{2}{\\spad{\\spad{Bi}''(x) - x * \\spad{Bi}(x) = 0}.}") (((|DoubleFloat|) (|DoubleFloat|)) "\\spad{airyBi(x)} is the Airy function \\spad{\\spad{Bi}(x)}. This function satisfies the differential equation: \\indented{2}{\\spad{\\spad{Bi}''(x) - x * \\spad{Bi}(x) = 0}.}")) (|airyAi| (((|DoubleFloat|) (|DoubleFloat|)) "\\spad{airyAi(x)} is the Airy function \\spad{\\spad{Ai}(x)}. This function satisfies the differential equation: \\indented{2}{\\spad{\\spad{Ai}''(x) - x * \\spad{Ai}(x) = 0}.}") (((|Complex| (|DoubleFloat|)) (|Complex| (|DoubleFloat|))) "\\spad{airyAi(x)} is the Airy function \\spad{\\spad{Ai}(x)}. This function satisfies the differential equation: \\indented{2}{\\spad{\\spad{Ai}''(x) - x * \\spad{Ai}(x) = 0}.}")) (|besselK| (((|Complex| (|DoubleFloat|)) (|Complex| (|DoubleFloat|)) (|Complex| (|DoubleFloat|))) "\\spad{besselK(v,{}x)} is the modified Bessel function of the first kind,{} \\spad{K(v,{}x)}. This function satisfies the differential equation: \\indented{2}{\\spad{x^2 w''(x) + x w'(x) - (x^2+v^2)w(x) = 0}.} Note: The default implmentation uses the relation \\indented{2}{\\spad{K(v,{}x) = \\%pi/2*(I(-v,{}x) - I(v,{}x))/sin(v*\\%\\spad{pi})}} so is not valid for integer values of \\spad{v}.") (((|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) "\\spad{besselK(v,{}x)} is the modified Bessel function of the first kind,{} \\spad{K(v,{}x)}. This function satisfies the differential equation: \\indented{2}{\\spad{x^2 w''(x) + x w'(x) - (x^2+v^2)w(x) = 0}.} Note: The default implmentation uses the relation \\indented{2}{\\spad{K(v,{}x) = \\%pi/2*(I(-v,{}x) - I(v,{}x))/sin(v*\\%\\spad{pi})}.} so is not valid for integer values of \\spad{v}.")) (|besselI| (((|Complex| (|DoubleFloat|)) (|Complex| (|DoubleFloat|)) (|Complex| (|DoubleFloat|))) "\\spad{besselI(v,{}x)} is the modified Bessel function of the first kind,{} \\spad{I(v,{}x)}. This function satisfies the differential equation: \\indented{2}{\\spad{x^2 w''(x) + x w'(x) - (x^2+v^2)w(x) = 0}.}") (((|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) "\\spad{besselI(v,{}x)} is the modified Bessel function of the first kind,{} \\spad{I(v,{}x)}. This function satisfies the differential equation: \\indented{2}{\\spad{x^2 w''(x) + x w'(x) - (x^2+v^2)w(x) = 0}.}")) (|besselY| (((|Complex| (|DoubleFloat|)) (|Complex| (|DoubleFloat|)) (|Complex| (|DoubleFloat|))) "\\spad{besselY(v,{}x)} is the Bessel function of the second kind,{} \\spad{Y(v,{}x)}. This function satisfies the differential equation: \\indented{2}{\\spad{x^2 w''(x) + x w'(x) + (x^2-v^2)w(x) = 0}.} Note: The default implmentation uses the relation \\indented{2}{\\spad{Y(v,{}x) = (J(v,{}x) cos(v*\\%\\spad{pi}) - J(-v,{}x))/sin(v*\\%\\spad{pi})}} so is not valid for integer values of \\spad{v}.") (((|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) "\\spad{besselY(v,{}x)} is the Bessel function of the second kind,{} \\spad{Y(v,{}x)}. This function satisfies the differential equation: \\indented{2}{\\spad{x^2 w''(x) + x w'(x) + (x^2-v^2)w(x) = 0}.} Note: The default implmentation uses the relation \\indented{2}{\\spad{Y(v,{}x) = (J(v,{}x) cos(v*\\%\\spad{pi}) - J(-v,{}x))/sin(v*\\%\\spad{pi})}} so is not valid for integer values of \\spad{v}.")) (|besselJ| (((|Complex| (|DoubleFloat|)) (|Complex| (|DoubleFloat|)) (|Complex| (|DoubleFloat|))) "\\spad{besselJ(v,{}x)} is the Bessel function of the first kind,{} \\spad{J(v,{}x)}. This function satisfies the differential equation: \\indented{2}{\\spad{x^2 w''(x) + x w'(x) + (x^2-v^2)w(x) = 0}.}") (((|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) "\\spad{besselJ(v,{}x)} is the Bessel function of the first kind,{} \\spad{J(v,{}x)}. This function satisfies the differential equation: \\indented{2}{\\spad{x^2 w''(x) + x w'(x) + (x^2-v^2)w(x) = 0}.}")) (|polygamma| (((|Complex| (|DoubleFloat|)) (|NonNegativeInteger|) (|Complex| (|DoubleFloat|))) "\\spad{polygamma(n,{} x)} is the \\spad{n}-th derivative of \\spad{digamma(x)}.") (((|DoubleFloat|) (|NonNegativeInteger|) (|DoubleFloat|)) "\\spad{polygamma(n,{} x)} is the \\spad{n}-th derivative of \\spad{digamma(x)}.")) (|digamma| (((|Complex| (|DoubleFloat|)) (|Complex| (|DoubleFloat|))) "\\spad{digamma(x)} is the function,{} \\spad{psi(x)},{} defined by \\indented{2}{\\spad{psi(x) = Gamma'(x)/Gamma(x)}.}") (((|DoubleFloat|) (|DoubleFloat|)) "\\spad{digamma(x)} is the function,{} \\spad{psi(x)},{} defined by \\indented{2}{\\spad{psi(x) = Gamma'(x)/Gamma(x)}.}")) (|logGamma| (((|Complex| (|DoubleFloat|)) (|Complex| (|DoubleFloat|))) "\\spad{logGamma(x)} is the natural log of \\spad{Gamma(x)}. This can often be computed even if \\spad{Gamma(x)} cannot.") (((|DoubleFloat|) (|DoubleFloat|)) "\\spad{logGamma(x)} is the natural log of \\spad{Gamma(x)}. This can often be computed even if \\spad{Gamma(x)} cannot.")) (|Beta| (((|Complex| (|DoubleFloat|)) (|Complex| (|DoubleFloat|)) (|Complex| (|DoubleFloat|))) "\\spad{Beta(x,{} y)} is the Euler beta function,{} \\spad{B(x,{}y)},{} defined by \\indented{2}{\\spad{Beta(x,{}y) = integrate(t^(x-1)*(1-t)^(y-1),{} t=0..1)}.} This is related to \\spad{Gamma(x)} by \\indented{2}{\\spad{Beta(x,{}y) = Gamma(x)*Gamma(y) / Gamma(x + y)}.}") (((|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) "\\spad{Beta(x,{} y)} is the Euler beta function,{} \\spad{B(x,{}y)},{} defined by \\indented{2}{\\spad{Beta(x,{}y) = integrate(t^(x-1)*(1-t)^(y-1),{} t=0..1)}.} This is related to \\spad{Gamma(x)} by \\indented{2}{\\spad{Beta(x,{}y) = Gamma(x)*Gamma(y) / Gamma(x + y)}.}")) (|Gamma| (((|Complex| (|DoubleFloat|)) (|Complex| (|DoubleFloat|))) "\\spad{Gamma(x)} is the Euler gamma function,{} \\spad{Gamma(x)},{} defined by \\indented{2}{\\spad{Gamma(x) = integrate(t^(x-1)*exp(-t),{} t=0..\\%infinity)}.}") (((|DoubleFloat|) (|DoubleFloat|)) "\\spad{Gamma(x)} is the Euler gamma function,{} \\spad{Gamma(x)},{} defined by \\indented{2}{\\spad{Gamma(x) = integrate(t^(x-1)*exp(-t),{} t=0..\\%infinity)}.}"))) 
@@ -1028,11 +1028,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 
-(-275 R -3198) 
+(-275 R -3199) 
 ((|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{\\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 
-(-276 R -3198) 
+(-276 R -3199) 
 ((|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{\\spad{ki}} was rewritten as \\spad{\\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 
@@ -1080,7 +1080,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 
-(-288 S R |Mod| -4160 -3743 |exactQuo|) 
+(-288 S R |Mod| -1783 -2297 |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}")) (|elt| ((|#2| $ |#2|) "\\spad{elt(x,{}r)} or \\spad{x}.\\spad{r} \\undocumented")) (|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"))) 
 ((-4376 . T) ((-4385 "*") . T) (-4377 . T) (-4378 . T) (-4380 . T)) 
 NIL 
@@ -1112,11 +1112,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 
-(-296 -3198 S) 
+(-296 -3199 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 
-(-297 E -3198) 
+(-297 E -3199) 
 ((|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 
@@ -1164,7 +1164,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 
-(-309 -3198) 
+(-309 -3199) 
 ((|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 
@@ -1192,7 +1192,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."))) 
 ((-4380 -3996 (-2113 (|has| |#1| (-1039)) (|has| |#1| (-631 (-558)))) (-12 (|has| |#1| (-550)) (-3996 (-2113 (|has| |#1| (-1039)) (|has| |#1| (-631 (-558)))) (|has| |#1| (-1039)) (|has| |#1| (-471)))) (|has| |#1| (-1039)) (|has| |#1| (-471))) (-4378 |has| |#1| (-171)) (-4377 |has| |#1| (-171)) ((-4385 "*") |has| |#1| (-550)) (-4376 |has| |#1| (-550)) (-4381 |has| |#1| (-550)) (-4375 |has| |#1| (-550))) 
 ((-3996 (|HasCategory| |#1| (LIST (QUOTE -1028) (LIST (QUOTE -406) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (QUOTE (-550))) (|HasCategory| |#1| (LIST (QUOTE -1028) (QUOTE (-558)))))) (|HasCategory| |#1| (QUOTE (-550))) (-3996 (|HasCategory| |#1| (QUOTE (-550))) (|HasCategory| |#1| (QUOTE (-1039)))) (-3996 (|HasCategory| |#1| (LIST (QUOTE -1028) (LIST (QUOTE -406) (QUOTE (-558))))) (|HasCategory| |#1| (QUOTE (-550)))) (|HasCategory| |#1| (QUOTE (-171))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-1039))) (|HasCategory| |#1| (LIST (QUOTE -631) (QUOTE (-558)))) (-3996 (|HasCategory| |#1| (QUOTE (-471))) (|HasCategory| |#1| (QUOTE (-1099)))) (|HasCategory| |#1| (QUOTE (-471))) (|HasCategory| |#1| (LIST (QUOTE -606) (QUOTE (-534)))) (-3996 (|HasCategory| |#1| (QUOTE (-1039))) (|HasCategory| |#1| (LIST (QUOTE -1028) (QUOTE (-558))))) (|HasCategory| |#1| (LIST (QUOTE -1028) (QUOTE (-558)))) (|HasCategory| |#1| (LIST (QUOTE -876) (QUOTE (-378)))) (|HasCategory| |#1| (LIST (QUOTE -876) (QUOTE (-558)))) (|HasCategory| |#1| (LIST (QUOTE -606) (LIST (QUOTE -882) (QUOTE (-378))))) (|HasCategory| |#1| (LIST (QUOTE -606) (LIST (QUOTE -882) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (QUOTE (-550))) (|HasCategory| |#1| (LIST (QUOTE -1028) (QUOTE (-558))))) (-3996 (|HasCategory| |#1| (LIST (QUOTE -631) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-171))) (|HasCategory| |#1| (QUOTE (-550))) (|HasCategory| |#1| (QUOTE (-1039)))) (-3996 (|HasCategory| |#1| (LIST (QUOTE -631) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-171))) (|HasCategory| |#1| (QUOTE (-550))) (|HasCategory| |#1| (QUOTE (-1039)))) (-3996 (|HasCategory| |#1| (LIST (QUOTE -631) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-171))) (|HasCategory| |#1| (QUOTE (-550))) (|HasCategory| |#1| (QUOTE (-1039)))) (-12 (|HasCategory| |#1| (QUOTE (-450))) (|HasCategory| |#1| (QUOTE (-550)))) (-3996 (|HasCategory| |#1| (QUOTE (-471))) (|HasCategory| |#1| (QUOTE (-550)))) (-12 (|HasCategory| |#1| (QUOTE (-1039))) (|HasCategory| |#1| (LIST (QUOTE -631) (QUOTE (-558))))) (-3996 (-12 (|HasCategory| |#1| (QUOTE (-1039))) (|HasCategory| |#1| (LIST (QUOTE -631) (QUOTE (-558))))) (|HasCategory| |#1| (QUOTE (-1099)))) (-3996 (|HasCategory| |#1| (QUOTE (-21))) (-12 (|HasCategory| |#1| (QUOTE (-1039))) (|HasCategory| |#1| (LIST (QUOTE -631) (QUOTE (-558)))))) (-3996 (|HasCategory| |#1| (QUOTE (-25))) (-12 (|HasCategory| |#1| (QUOTE (-1039))) (|HasCategory| |#1| (LIST (QUOTE -631) (QUOTE (-558))))) (|HasCategory| |#1| (QUOTE (-1099)))) (-3996 (|HasCategory| |#1| (QUOTE (-25))) (-12 (|HasCategory| |#1| (QUOTE (-1039))) (|HasCategory| |#1| (LIST (QUOTE -631) (QUOTE (-558)))))) (-3996 (|HasCategory| |#1| (QUOTE (-471))) (|HasCategory| |#1| (QUOTE (-1039)))) (-3996 (-12 (|HasCategory| |#1| (LIST (QUOTE -1028) (LIST (QUOTE -406) (QUOTE (-558))))) (|HasCategory| |#1| (QUOTE (-550)))) (-12 (|HasCategory| |#1| (QUOTE (-550))) (|HasCategory| |#1| (LIST (QUOTE -1028) (QUOTE (-558)))))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-1099))) (|HasCategory| |#1| (LIST (QUOTE -1028) (LIST (QUOTE -406) (QUOTE (-558))))) (|HasCategory| $ (QUOTE (-1039))) (|HasCategory| $ (LIST (QUOTE -1028) (QUOTE (-558))))) 
-(-316 R -3198) 
+(-316 R -3199) 
 ((|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{\\spad{yi}(a) = \\spad{bi}}. Note: eqi must be of the form \\spad{\\spad{fi}(x,{} y1 x,{} y2 x,{}...,{} yn x) y1'(x) + \\spad{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 
@@ -1203,7 +1203,7 @@ NIL
 (-318 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."))) 
 (((-4385 "*") |has| |#1| (-171)) (-4376 |has| |#1| (-550)) (-4381 |has| |#1| (-362)) (-4375 |has| |#1| (-362)) (-4377 . T) (-4378 . T) (-4380 . T)) 
-((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558))))) (|HasCategory| |#1| (QUOTE (-550))) (|HasCategory| |#1| (QUOTE (-171))) (-3996 (|HasCategory| |#1| (QUOTE (-171))) (|HasCategory| |#1| (QUOTE (-550)))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-146))) (-12 (|HasCategory| |#1| (LIST (QUOTE -890) (QUOTE (-1163)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -406) (QUOTE (-558))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -406) (QUOTE (-558))) (|devaluate| |#1|)))) (|HasCategory| (-406 (-558)) (QUOTE (-1099))) (|HasCategory| |#1| (QUOTE (-362))) (-3996 (|HasCategory| |#1| (QUOTE (-171))) (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-550)))) (-3996 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-550)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -406) (QUOTE (-558)))))) (|HasSignature| |#1| (LIST (QUOTE -2560) (LIST (|devaluate| |#1|) (QUOTE (-1163)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -406) (QUOTE (-558)))))) (-3996 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-949))) (|HasCategory| |#1| (QUOTE (-1185))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558))))) (|HasSignature| |#1| (LIST (QUOTE -3710) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1163))))) (|HasSignature| |#1| (LIST (QUOTE -2664) (LIST (LIST (QUOTE -635) (QUOTE (-1163))) (|devaluate| |#1|))))))) 
+((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558))))) (|HasCategory| |#1| (QUOTE (-550))) (|HasCategory| |#1| (QUOTE (-171))) (-3996 (|HasCategory| |#1| (QUOTE (-171))) (|HasCategory| |#1| (QUOTE (-550)))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-146))) (-12 (|HasCategory| |#1| (LIST (QUOTE -890) (QUOTE (-1163)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -406) (QUOTE (-558))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -406) (QUOTE (-558))) (|devaluate| |#1|)))) (|HasCategory| (-406 (-558)) (QUOTE (-1099))) (|HasCategory| |#1| (QUOTE (-362))) (-3996 (|HasCategory| |#1| (QUOTE (-171))) (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-550)))) (-3996 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-550)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -406) (QUOTE (-558)))))) (|HasSignature| |#1| (LIST (QUOTE -2560) (LIST (|devaluate| |#1|) (QUOTE (-1163)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -406) (QUOTE (-558)))))) (-3996 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-949))) (|HasCategory| |#1| (QUOTE (-1185))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558))))) (|HasSignature| |#1| (LIST (QUOTE -3221) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1163))))) (|HasSignature| |#1| (LIST (QUOTE -2664) (LIST (LIST (QUOTE -635) (QUOTE (-1163))) (|devaluate| |#1|))))))) 
 (-319 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 
@@ -1236,11 +1236,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."))) 
 ((-4384 . T) (-4383 . T)) 
 ((-3996 (-12 (|HasCategory| |#1| (QUOTE (-841))) (|HasCategory| |#1| (LIST (QUOTE -308) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1087))) (|HasCategory| |#1| (LIST (QUOTE -308) (|devaluate| |#1|))))) (-3996 (-12 (|HasCategory| |#1| (QUOTE (-1087))) (|HasCategory| |#1| (LIST (QUOTE -308) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -605) (QUOTE (-853))))) (|HasCategory| |#1| (LIST (QUOTE -606) (QUOTE (-534)))) (-3996 (|HasCategory| |#1| (QUOTE (-841))) (|HasCategory| |#1| (QUOTE (-1087)))) (|HasCategory| |#1| (QUOTE (-841))) (|HasCategory| (-558) (QUOTE (-841))) (|HasCategory| |#1| (QUOTE (-1087))) (|HasCategory| |#1| (LIST (QUOTE -605) (QUOTE (-853)))) (-12 (|HasCategory| |#1| (QUOTE (-1087))) (|HasCategory| |#1| (LIST (QUOTE -308) (|devaluate| |#1|))))) 
-(-327 S -3198) 
+(-327 S -3199) 
 ((|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 (-367)))) 
-(-328 -3198) 
+(-328 -3199) 
 ((|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."))) 
 ((-4375 . T) (-4381 . T) (-4376 . T) ((-4385 "*") . T) (-4377 . T) (-4378 . T) (-4380 . T)) 
 NIL 
@@ -1260,15 +1260,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 
-(-333 S -3198 UP UPUP R) 
+(-333 S -3199 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 
-(-334 -3198 UP UPUP R) 
+(-334 -3199 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 
-(-335 -3198 UP UPUP R) 
+(-335 -3199 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 
@@ -1288,11 +1288,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 
-(-340 S -3198 UP UPUP) 
+(-340 S -3199 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(\\spad{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 (-367))) (|HasCategory| |#2| (QUOTE (-362)))) 
-(-341 -3198 UP UPUP) 
+(-341 -3199 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(\\spad{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."))) 
 ((-4376 |has| (-406 |#2|) (-362)) (-4381 |has| (-406 |#2|) (-362)) (-4375 |has| (-406 |#2|) (-362)) ((-4385 "*") . T) (-4377 . T) (-4378 . T) (-4380 . T)) 
 NIL 
@@ -1324,7 +1324,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."))) 
 ((-4375 . T) (-4381 . T) (-4376 . T) ((-4385 "*") . T) (-4377 . T) (-4378 . T) (-4380 . T)) 
 NIL 
-(-349 R UP -3198) 
+(-349 R UP -3199) 
 ((|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{\\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{\\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{\\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{\\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{\\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{\\spad{wi} = sum(bij * vj,{} j = 1..n)}.")) (|squareFree| (((|Factored| $) $) "\\spad{squareFree(x)} returns a square-free factorisation of \\spad{x}"))) 
 NIL 
 NIL 
@@ -1348,7 +1348,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."))) 
 ((-4375 . T) (-4381 . T) (-4376 . T) ((-4385 "*") . T) (-4377 . T) (-4378 . T) (-4380 . T)) 
 ((-3996 (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-367)))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-367))) (|HasCategory| |#1| (QUOTE (-144)))) 
-(-355 -3198 GF) 
+(-355 -3199 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 
@@ -1356,7 +1356,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 
-(-357 -3198 FP FPP) 
+(-357 -3199 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 \\spad{fi} = sum ai/fi} or returns \"failed\" if no such list of \\spad{ai}\\spad{'s} exists."))) 
 NIL 
 NIL 
@@ -1442,7 +1442,7 @@ NIL
 NIL 
 (-378) 
 ((|constructor| (NIL "\\spadtype{Float} implements arbitrary precision floating point arithmetic. The number of significant digits of each operation can be set to an arbitrary value (the default is 20 decimal digits). The operation \\spad{float(mantissa,{}exponent,{}\\spadfunFrom{base}{FloatingPointSystem})} for integer \\spad{mantissa},{} \\spad{exponent} specifies the number \\spad{mantissa * \\spadfunFrom{base}{FloatingPointSystem} ** exponent} The underlying representation for floats is binary not decimal. The implications of this are described below. \\blankline The model adopted is that arithmetic operations are rounded to to nearest unit in the last place,{} that is,{} accurate to within \\spad{2**(-\\spadfunFrom{bits}{FloatingPointSystem})}. Also,{} the elementary functions and constants are accurate to one unit in the last place. A float is represented as a record of two integers,{} the mantissa and the exponent. The \\spadfunFrom{base}{FloatingPointSystem} of the representation is binary,{} hence a \\spad{Record(m:mantissa,{}e:exponent)} represents the number \\spad{m * 2 ** e}. Though it is not assumed that the underlying integers are represented with a binary \\spadfunFrom{base}{FloatingPointSystem},{} the code will be most efficient when this is the the case (this is \\spad{true} in most implementations of Lisp). The decision to choose the \\spadfunFrom{base}{FloatingPointSystem} to be binary has some unfortunate consequences. First,{} decimal numbers like 0.3 cannot be represented exactly. Second,{} there is a further loss of accuracy during conversion to decimal for output. To compensate for this,{} if \\spad{d} digits of precision are specified,{} \\spad{1 + ceiling(log2 d)} bits are used. Two numbers that are displayed identically may therefore be not equal. On the other hand,{} a significant efficiency loss would be incurred if we chose to use a decimal \\spadfunFrom{base}{FloatingPointSystem} when the underlying integer base is binary. \\blankline Algorithms used: For the elementary functions,{} the general approach is to apply identities so that the taylor series can be used,{} and,{} so that it will converge within \\spad{O( sqrt n )} steps. For example,{} using the identity \\spad{exp(x) = exp(x/2)**2},{} we can compute \\spad{exp(1/3)} to \\spad{n} digits of precision as follows. We have \\spad{exp(1/3) = exp(2 ** (-sqrt s) / 3) ** (2 ** sqrt s)}. The taylor series will converge in less than sqrt \\spad{n} steps and the exponentiation requires sqrt \\spad{n} multiplications for a total of \\spad{2 sqrt n} multiplications. Assuming integer multiplication costs \\spad{O( n**2 )} the overall running time is \\spad{O( sqrt(n) n**2 )}. This approach is the best known approach for precisions up to about 10,{}000 digits at which point the methods of Brent which are \\spad{O( log(n) n**2 )} become competitive. Note also that summing the terms of the taylor series for the elementary functions is done using integer operations. This avoids the overhead of floating point operations and results in efficient code at low precisions. This implementation makes no attempt to reuse storage,{} relying on the underlying system to do \\spadgloss{garbage collection}. \\spad{I} estimate that the efficiency of this package at low precisions could be improved by a factor of 2 if in-place operations were available. \\blankline Running times: in the following,{} \\spad{n} is the number of bits of precision \\indented{5}{\\spad{*},{} \\spad{/},{} \\spad{sqrt},{} \\spad{\\spad{pi}},{} \\spad{exp1},{} \\spad{log2},{} \\spad{log10}: \\spad{ O( n**2 )}} \\indented{5}{\\spad{exp},{} \\spad{log},{} \\spad{sin},{} \\spad{atan}:\\space{2}\\spad{ O( sqrt(n) n**2 )}} The other elementary functions are coded in terms of the ones above.")) (|outputSpacing| (((|Void|) (|NonNegativeInteger|)) "\\spad{outputSpacing(n)} inserts a space after \\spad{n} (default 10) digits on output; outputSpacing(0) means no spaces are inserted.")) (|outputGeneral| (((|Void|) (|NonNegativeInteger|)) "\\spad{outputGeneral(n)} sets the output mode to general notation with \\spad{n} significant digits displayed.") (((|Void|)) "\\spad{outputGeneral()} sets the output mode (default mode) to general notation; numbers will be displayed in either fixed or floating (scientific) notation depending on the magnitude.")) (|outputFixed| (((|Void|) (|NonNegativeInteger|)) "\\spad{outputFixed(n)} sets the output mode to fixed point notation,{} with \\spad{n} digits displayed after the decimal point.") (((|Void|)) "\\spad{outputFixed()} sets the output mode to fixed point notation; the output will contain a decimal point.")) (|outputFloating| (((|Void|) (|NonNegativeInteger|)) "\\spad{outputFloating(n)} sets the output mode to floating (scientific) notation with \\spad{n} significant digits displayed after the decimal point.") (((|Void|)) "\\spad{outputFloating()} sets the output mode to floating (scientific) notation,{} \\spadignore{i.e.} \\spad{mantissa * 10 exponent} is displayed as \\spad{0.mantissa E exponent}.")) (|atan| (($ $ $) "\\spad{atan(x,{}y)} computes the arc tangent from \\spad{x} with phase \\spad{y}.")) (|exp1| (($) "\\spad{exp1()} returns exp 1: \\spad{2.7182818284...}.")) (|log10| (($ $) "\\spad{log10(x)} computes the logarithm for \\spad{x} to base 10.") (($) "\\spad{log10()} returns \\spad{ln 10}: \\spad{2.3025809299...}.")) (|log2| (($ $) "\\spad{log2(x)} computes the logarithm for \\spad{x} to base 2.") (($) "\\spad{log2()} returns \\spad{ln 2},{} \\spadignore{i.e.} \\spad{0.6931471805...}.")) (|rationalApproximation| (((|Fraction| (|Integer|)) $ (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{rationalApproximation(f,{} n,{} b)} computes a rational approximation \\spad{r} to \\spad{f} with relative error \\spad{< b**(-n)},{} that is \\spad{|(r-f)/f| < b**(-n)}.") (((|Fraction| (|Integer|)) $ (|NonNegativeInteger|)) "\\spad{rationalApproximation(f,{} n)} computes a rational approximation \\spad{r} to \\spad{f} with relative error \\spad{< 10**(-n)}.")) (|shift| (($ $ (|Integer|)) "\\spad{shift(x,{}n)} adds \\spad{n} to the exponent of float \\spad{x}.")) (|relerror| (((|Integer|) $ $) "\\spad{relerror(x,{}y)} computes the absolute value of \\spad{x - y} divided by \\spad{y},{} when \\spad{y \\~= 0}.")) (|normalize| (($ $) "\\spad{normalize(x)} normalizes \\spad{x} at current precision.")) (** (($ $ $) "\\spad{x ** y} computes \\spad{exp(y log x)} where \\spad{x >= 0}.")) (/ (($ $ (|Integer|)) "\\spad{x / i} computes the division from \\spad{x} by an integer \\spad{i}."))) 
-((-4366 . T) (-4374 . T) (-1394 . T) (-4375 . T) (-4381 . T) (-4376 . T) ((-4385 "*") . T) (-4377 . T) (-4378 . T) (-4380 . T)) 
+((-4366 . T) (-4374 . T) (-1395 . T) (-4375 . T) (-4381 . T) (-4376 . T) ((-4385 "*") . T) (-4377 . T) (-4378 . T) (-4380 . T)) 
 NIL 
 (-379 |Par|) 
 ((|constructor| (NIL "\\indented{3}{This is a package for the approximation of real solutions for} systems of polynomial equations over the rational numbers. The results are expressed as either rational numbers or floats depending on the type of the precision parameter which can be either a rational number or a floating point number.")) (|realRoots| (((|List| |#1|) (|Fraction| (|Polynomial| (|Integer|))) |#1|) "\\spad{realRoots(rf,{} eps)} finds the real zeros of a univariate rational function with precision given by eps.") (((|List| (|List| |#1|)) (|List| (|Fraction| (|Polynomial| (|Integer|)))) (|List| (|Symbol|)) |#1|) "\\spad{realRoots(lp,{}lv,{}eps)} computes the list of the real solutions of the list \\spad{lp} of rational functions with rational coefficients with respect to the variables in \\spad{lv},{} with precision \\spad{eps}. Each solution is expressed as a list of numbers in order corresponding to the variables in \\spad{lv}.")) (|solve| (((|List| (|Equation| (|Polynomial| |#1|))) (|Equation| (|Fraction| (|Polynomial| (|Integer|)))) |#1|) "\\spad{solve(eq,{}eps)} finds all of the real solutions of the univariate equation \\spad{eq} of rational functions with respect to the unique variables appearing in \\spad{eq},{} with precision \\spad{eps}.") (((|List| (|Equation| (|Polynomial| |#1|))) (|Fraction| (|Polynomial| (|Integer|))) |#1|) "\\spad{solve(p,{}eps)} finds all of the real solutions of the univariate rational function \\spad{p} with rational coefficients with respect to the unique variable appearing in \\spad{p},{} with precision \\spad{eps}.") (((|List| (|List| (|Equation| (|Polynomial| |#1|)))) (|List| (|Equation| (|Fraction| (|Polynomial| (|Integer|))))) |#1|) "\\spad{solve(leq,{}eps)} finds all of the real solutions of the system \\spad{leq} of equationas of rational functions with respect to all the variables appearing in \\spad{lp},{} with precision \\spad{eps}.") (((|List| (|List| (|Equation| (|Polynomial| |#1|)))) (|List| (|Fraction| (|Polynomial| (|Integer|)))) |#1|) "\\spad{solve(lp,{}eps)} finds all of the real solutions of the system \\spad{lp} of rational functions over the rational numbers with respect to all the variables appearing in \\spad{lp},{} with precision \\spad{eps}."))) 
@@ -1492,7 +1492,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 
-(-391 -3198 UP UPUP R) 
+(-391 -3199 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 
@@ -1516,11 +1516,11 @@ NIL
 ((|constructor| (NIL "provides an interface to the boot code for calling Fortran")) (|setLegalFortranSourceExtensions| (((|List| (|String|)) (|List| (|String|))) "\\spad{setLegalFortranSourceExtensions(l)} \\undocumented{}")) (|outputAsFortran| (((|Void|) (|FileName|)) "\\spad{outputAsFortran(fn)} \\undocumented{}")) (|linkToFortran| (((|SExpression|) (|Symbol|) (|List| (|Symbol|)) (|TheSymbolTable|) (|List| (|Symbol|))) "\\spad{linkToFortran(s,{}l,{}t,{}lv)} \\undocumented{}") (((|SExpression|) (|Symbol|) (|List| (|Union| (|:| |array| (|List| (|Symbol|))) (|:| |scalar| (|Symbol|)))) (|List| (|List| (|Union| (|:| |array| (|List| (|Symbol|))) (|:| |scalar| (|Symbol|))))) (|List| (|Symbol|)) (|Symbol|)) "\\spad{linkToFortran(s,{}l,{}ll,{}lv,{}t)} \\undocumented{}") (((|SExpression|) (|Symbol|) (|List| (|Union| (|:| |array| (|List| (|Symbol|))) (|:| |scalar| (|Symbol|)))) (|List| (|List| (|Union| (|:| |array| (|List| (|Symbol|))) (|:| |scalar| (|Symbol|))))) (|List| (|Symbol|))) "\\spad{linkToFortran(s,{}l,{}ll,{}lv)} \\undocumented{}"))) 
 NIL 
 NIL 
-(-397 -3149 |returnType| -1315 |symbols|) 
+(-397 -3149 |returnType| -1314 |symbols|) 
 ((|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 
-(-398 -3198 UP) 
+(-398 -3199 UP) 
 ((|constructor| (NIL "\\indented{1}{Full partial fraction expansion of rational functions} Author: Manuel Bronstein Date Created: 9 December 1992 Date Last Updated: 6 October 1993 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.}")) (D (($ $ (|NonNegativeInteger|)) "\\spad{D(f,{} n)} returns the \\spad{n}-th derivative of \\spad{f}.") (($ $) "\\spad{D(f)} returns the derivative of \\spad{f}.")) (|differentiate| (($ $ (|NonNegativeInteger|)) "\\spad{differentiate(f,{} n)} returns the \\spad{n}-th derivative of \\spad{f}.") (($ $) "\\spad{differentiate(f)} returns the derivative of \\spad{f}.")) (|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 
@@ -1542,7 +1542,7 @@ NIL
 ((|HasAttribute| |#1| (QUOTE -4366)) (|HasAttribute| |#1| (QUOTE -4374))) 
 (-403) 
 ((|constructor| (NIL "This category is intended as a model for floating point systems. A floating point system is a model for the real numbers. In fact,{} it is an approximation in the sense that not all real numbers are exactly representable by floating point numbers. A floating point system is characterized by the following: \\blankline \\indented{2}{1: \\spadfunFrom{base}{FloatingPointSystem} of the \\spadfunFrom{exponent}{FloatingPointSystem}.} \\indented{9}{(actual implemenations are usually binary or decimal)} \\indented{2}{2: \\spadfunFrom{precision}{FloatingPointSystem} of the \\spadfunFrom{mantissa}{FloatingPointSystem} (arbitrary or fixed)} \\indented{2}{3: rounding error for operations} \\blankline Because a Float is an approximation to the real numbers,{} even though it is defined to be a join of a Field and OrderedRing,{} some of the attributes do not hold. In particular associative(\\spad{\"+\"}) does not hold. Algorithms defined over a field need special considerations when the field is a floating point system.")) (|max| (($) "\\spad{max()} returns the maximum floating point number.")) (|min| (($) "\\spad{min()} returns the minimum floating point number.")) (|decreasePrecision| (((|PositiveInteger|) (|Integer|)) "\\spad{decreasePrecision(n)} decreases the current \\spadfunFrom{precision}{FloatingPointSystem} precision by \\spad{n} decimal digits.")) (|increasePrecision| (((|PositiveInteger|) (|Integer|)) "\\spad{increasePrecision(n)} increases the current \\spadfunFrom{precision}{FloatingPointSystem} by \\spad{n} decimal digits.")) (|precision| (((|PositiveInteger|) (|PositiveInteger|)) "\\spad{precision(n)} set the precision in the base to \\spad{n} decimal digits.") (((|PositiveInteger|)) "\\spad{precision()} returns the precision in digits base.")) (|digits| (((|PositiveInteger|) (|PositiveInteger|)) "\\spad{digits(d)} set the \\spadfunFrom{precision}{FloatingPointSystem} to \\spad{d} digits.") (((|PositiveInteger|)) "\\spad{digits()} returns ceiling\\spad{'s} precision in decimal digits.")) (|bits| (((|PositiveInteger|) (|PositiveInteger|)) "\\spad{bits(n)} set the \\spadfunFrom{precision}{FloatingPointSystem} to \\spad{n} bits.") (((|PositiveInteger|)) "\\spad{bits()} returns ceiling\\spad{'s} precision in bits.")) (|mantissa| (((|Integer|) $) "\\spad{mantissa(x)} returns the mantissa part of \\spad{x}.")) (|exponent| (((|Integer|) $) "\\spad{exponent(x)} returns the \\spadfunFrom{exponent}{FloatingPointSystem} part of \\spad{x}.")) (|base| (((|PositiveInteger|)) "\\spad{base()} returns the base of the \\spadfunFrom{exponent}{FloatingPointSystem}.")) (|order| (((|Integer|) $) "\\spad{order x} is the order of magnitude of \\spad{x}. Note: \\spad{base ** order x <= |x| < base ** (1 + order x)}.")) (|float| (($ (|Integer|) (|Integer|) (|PositiveInteger|)) "\\spad{float(a,{}e,{}b)} returns \\spad{a * b ** e}.") (($ (|Integer|) (|Integer|)) "\\spad{float(a,{}e)} returns \\spad{a * base() ** e}.")) (|approximate| ((|attribute|) "\\spad{approximate} means \"is an approximation to the real numbers\"."))) 
-((-1394 . T) (-4375 . T) (-4381 . T) (-4376 . T) ((-4385 "*") . T) (-4377 . T) (-4378 . T) (-4380 . T)) 
+((-1395 . T) (-4375 . T) (-4381 . T) (-4376 . T) ((-4385 "*") . T) (-4377 . T) (-4378 . T) (-4380 . T)) 
 NIL 
 (-404 R S) 
 ((|constructor| (NIL "\\spadtype{FactoredFunctions2} contains functions that involve factored objects whose underlying domains may not be the same. For example,{} \\spadfun{map} might be used to coerce an object of type \\spadtype{Factored(Integer)} to \\spadtype{Factored(Complex(Integer))}.")) (|map| (((|Factored| |#2|) (|Mapping| |#2| |#1|) (|Factored| |#1|)) "\\spad{map(fn,{}u)} is used to apply the function \\userfun{\\spad{fn}} to every factor of \\spadvar{\\spad{u}}. The new factored object will have all its information flags set to \"nil\". This function is used,{} for example,{} to coerce every factor base to another type."))) 
@@ -1576,11 +1576,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 
-(-412 R -3198 UP A) 
+(-412 R -3199 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)}."))) 
 ((-4380 . T)) 
 NIL 
-(-413 R -3198 UP A |ibasis|) 
+(-413 R -3199 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 -1028) (|devaluate| |#2|)))) 
@@ -1628,7 +1628,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}."))) 
 ((-4383 . T) (-4373 . T) (-4384 . T)) 
 NIL 
-(-425 R -3198) 
+(-425 R -3199) 
 ((|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 
@@ -1636,7 +1636,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"))) 
 ((-4370 -12 (|has| |#1| (-6 -4370)) (|has| |#2| (-6 -4370))) (-4377 . T) (-4378 . T) (-4380 . T)) 
 ((-12 (|HasAttribute| |#1| (QUOTE -4370)) (|HasAttribute| |#2| (QUOTE -4370)))) 
-(-427 R -3198) 
+(-427 R -3199) 
 ((|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 
@@ -1648,15 +1648,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{\\spad{si}(a1,{}...,{}an)**ni} in \\spad{x} by \\spad{\\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{\\spad{si}(a)**ni} in \\spad{x} by \\spad{\\spad{fi}(a)} for any \\spad{a}.") (($ $ (|List| (|BasicOperator|)) (|List| $) (|Symbol|)) "\\spad{eval(x,{} [s1,{}...,{}sm],{} [f1,{}...,{}fm],{} y)} replaces every \\spad{\\spad{si}(a)} in \\spad{x} by \\spad{\\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}."))) 
 ((-4380 -3996 (|has| |#1| (-1039)) (|has| |#1| (-471))) (-4378 |has| |#1| (-171)) (-4377 |has| |#1| (-171)) ((-4385 "*") |has| |#1| (-550)) (-4376 |has| |#1| (-550)) (-4381 |has| |#1| (-550)) (-4375 |has| |#1| (-550))) 
 NIL 
-(-430 R -3198) 
+(-430 R -3199) 
 ((|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 
-(-431 R -3198) 
+(-431 R -3199) 
 ((|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{\\spad{ai} = \\spad{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{\\spad{ai} = \\spad{qi}(a)},{} and \\spad{q(a) = 0}. This operation uses the technique of \\spadglossSee{groebner bases}{Groebner basis}."))) 
 NIL 
 ((|HasCategory| |#2| (QUOTE (-27)))) 
-(-432 R -3198) 
+(-432 R -3199) 
 ((|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 
@@ -1664,7 +1664,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 
-(-434 R -3198 UP) 
+(-434 R -3199 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 -1028) (QUOTE (-48))))) 
@@ -1692,7 +1692,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 
-(-441 R UP -3198) 
+(-441 R UP -3199) 
 ((|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 
@@ -1804,7 +1804,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 
-(-469 |lv| -3198 R) 
+(-469 |lv| -3199 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 
@@ -1819,7 +1819,7 @@ NIL
 (-472 |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.")) (|differentiate| (($ $ (|Variable| |#2|)) "\\spad{differentiate(f(x),{}x)} returns the derivative of \\spad{f(x)} with respect to \\spad{x}.")) (|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."))) 
 (((-4385 "*") |has| |#1| (-171)) (-4376 |has| |#1| (-550)) (-4381 |has| |#1| (-362)) (-4375 |has| |#1| (-362)) (-4377 . T) (-4378 . T) (-4380 . T)) 
-((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558))))) (|HasCategory| |#1| (QUOTE (-550))) (|HasCategory| |#1| (QUOTE (-171))) (-3996 (|HasCategory| |#1| (QUOTE (-171))) (|HasCategory| |#1| (QUOTE (-550)))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-146))) (-12 (|HasCategory| |#1| (LIST (QUOTE -890) (QUOTE (-1163)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -406) (QUOTE (-558))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -406) (QUOTE (-558))) (|devaluate| |#1|)))) (|HasCategory| (-406 (-558)) (QUOTE (-1099))) (|HasCategory| |#1| (QUOTE (-362))) (-3996 (|HasCategory| |#1| (QUOTE (-171))) (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-550)))) (-3996 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-550)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -406) (QUOTE (-558)))))) (|HasSignature| |#1| (LIST (QUOTE -2560) (LIST (|devaluate| |#1|) (QUOTE (-1163)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -406) (QUOTE (-558)))))) (-3996 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-949))) (|HasCategory| |#1| (QUOTE (-1185))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558))))) (|HasSignature| |#1| (LIST (QUOTE -3710) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1163))))) (|HasSignature| |#1| (LIST (QUOTE -2664) (LIST (LIST (QUOTE -635) (QUOTE (-1163))) (|devaluate| |#1|))))))) 
+((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558))))) (|HasCategory| |#1| (QUOTE (-550))) (|HasCategory| |#1| (QUOTE (-171))) (-3996 (|HasCategory| |#1| (QUOTE (-171))) (|HasCategory| |#1| (QUOTE (-550)))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-146))) (-12 (|HasCategory| |#1| (LIST (QUOTE -890) (QUOTE (-1163)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -406) (QUOTE (-558))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -406) (QUOTE (-558))) (|devaluate| |#1|)))) (|HasCategory| (-406 (-558)) (QUOTE (-1099))) (|HasCategory| |#1| (QUOTE (-362))) (-3996 (|HasCategory| |#1| (QUOTE (-171))) (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-550)))) (-3996 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-550)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -406) (QUOTE (-558)))))) (|HasSignature| |#1| (LIST (QUOTE -2560) (LIST (|devaluate| |#1|) (QUOTE (-1163)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -406) (QUOTE (-558)))))) (-3996 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-949))) (|HasCategory| |#1| (QUOTE (-1185))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558))))) (|HasSignature| |#1| (LIST (QUOTE -3221) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1163))))) (|HasSignature| |#1| (LIST (QUOTE -2664) (LIST (LIST (QUOTE -635) (QUOTE (-1163))) (|devaluate| |#1|))))))) 
 (-473 |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."))) 
 ((-4384 . T)) 
@@ -1860,7 +1860,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}."))) 
 ((-4383 . T) (-4384 . T)) 
 ((-12 (|HasCategory| |#1| (QUOTE (-1087))) (|HasCategory| |#1| (LIST (QUOTE -308) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1087))) (-3996 (-12 (|HasCategory| |#1| (QUOTE (-1087))) (|HasCategory| |#1| (LIST (QUOTE -308) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -605) (QUOTE (-853))))) (|HasCategory| |#1| (LIST (QUOTE -605) (QUOTE (-853))))) 
-(-483 -3198 UP UPUP R) 
+(-483 -3199 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 
@@ -1896,7 +1896,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 
-(-492 -3198 UP |AlExt| |AlPol|) 
+(-492 -3199 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 
@@ -1916,7 +1916,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 
-(-497 R UP -3198) 
+(-497 R UP -3199) 
 ((|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{\\spad{mi}} is represented as follows: \\spad{F} is a framed algebra with \\spad{R}-module basis \\spad{w1,{}w2,{}...,{}wn} and \\spad{\\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{\\spad{mi}} is given by \\spad{\\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{\\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{\\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 
@@ -1936,7 +1936,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{\\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{\\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 
-(-502 -3198 |Expon| |VarSet| |DPoly|) 
+(-502 -3199 |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 -606) (QUOTE (-1163))))) 
@@ -2048,7 +2048,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 
-(-530 K -3198 |Par|) 
+(-530 K -3199 |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 
@@ -2072,7 +2072,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 
-(-536 K -3198 |Par|) 
+(-536 K -3199 |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 
@@ -2108,11 +2108,11 @@ NIL
 ((|constructor| (NIL "This domain is used to provide a conditional \"add\" domain for the implementation of \\spadtype{Table}."))) 
 ((-4383 . T) (-4384 . T)) 
 ((-12 (|HasCategory| (-2 (|:| -2055 |#1|) (|:| -3528 |#2|)) (QUOTE (-1087))) (|HasCategory| (-2 (|:| -2055 |#1|) (|:| -3528 |#2|)) (LIST (QUOTE -308) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2055) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3528) (|devaluate| |#2|)))))) (-3996 (|HasCategory| (-2 (|:| -2055 |#1|) (|:| -3528 |#2|)) (QUOTE (-1087))) (|HasCategory| |#2| (QUOTE (-1087)))) (-3996 (|HasCategory| (-2 (|:| -2055 |#1|) (|:| -3528 |#2|)) (QUOTE (-1087))) (|HasCategory| (-2 (|:| -2055 |#1|) (|:| -3528 |#2|)) (LIST (QUOTE -605) (QUOTE (-853)))) (|HasCategory| |#2| (QUOTE (-1087))) (|HasCategory| |#2| (LIST (QUOTE -605) (QUOTE (-853))))) (|HasCategory| (-2 (|:| -2055 |#1|) (|:| -3528 |#2|)) (LIST (QUOTE -606) (QUOTE (-534)))) (-12 (|HasCategory| |#2| (QUOTE (-1087))) (|HasCategory| |#2| (LIST (QUOTE -308) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -2055 |#1|) (|:| -3528 |#2|)) (QUOTE (-1087))) (|HasCategory| |#1| (QUOTE (-841))) (|HasCategory| |#2| (QUOTE (-1087))) (-3996 (|HasCategory| (-2 (|:| -2055 |#1|) (|:| -3528 |#2|)) (LIST (QUOTE -605) (QUOTE (-853)))) (|HasCategory| |#2| (LIST (QUOTE -605) (QUOTE (-853))))) (|HasCategory| |#2| (LIST (QUOTE -605) (QUOTE (-853)))) (|HasCategory| (-2 (|:| -2055 |#1|) (|:| -3528 |#2|)) (LIST (QUOTE -605) (QUOTE (-853))))) 
-(-545 R -3198) 
+(-545 R -3199) 
 ((|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 
-(-546 R0 -3198 UP UPUP R) 
+(-546 R0 -3199 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 
@@ -2122,7 +2122,7 @@ NIL
 NIL 
 (-548 R) 
 ((|constructor| (NIL "\\indented{1}{+ Author: Mike Dewar} + Date Created: November 1996 + Date Last Updated: + Basic Functions: + Related Constructors: + Also See: + AMS Classifications: + Keywords: + References: + Description: + This category implements of interval arithmetic and transcendental + functions over intervals.")) (|contains?| (((|Boolean|) $ |#1|) "\\spad{contains?(i,{}f)} returns \\spad{true} if \\axiom{\\spad{f}} is contained within the interval \\axiom{\\spad{i}},{} \\spad{false} otherwise.")) (|negative?| (((|Boolean|) $) "\\spad{negative?(u)} returns \\axiom{\\spad{true}} if every element of \\spad{u} is negative,{} \\axiom{\\spad{false}} otherwise.")) (|positive?| (((|Boolean|) $) "\\spad{positive?(u)} returns \\axiom{\\spad{true}} if every element of \\spad{u} is positive,{} \\axiom{\\spad{false}} otherwise.")) (|width| ((|#1| $) "\\spad{width(u)} returns \\axiom{sup(\\spad{u}) - inf(\\spad{u})}.")) (|sup| ((|#1| $) "\\spad{sup(u)} returns the supremum of \\axiom{\\spad{u}}.")) (|inf| ((|#1| $) "\\spad{inf(u)} returns the infinum of \\axiom{\\spad{u}}.")) (|qinterval| (($ |#1| |#1|) "\\spad{qinterval(inf,{}sup)} creates a new interval \\axiom{[\\spad{inf},{}\\spad{sup}]},{} without checking the ordering on the elements.")) (|interval| (($ (|Fraction| (|Integer|))) "\\spad{interval(f)} creates a new interval around \\spad{f}.") (($ |#1|) "\\spad{interval(f)} creates a new interval around \\spad{f}.") (($ |#1| |#1|) "\\spad{interval(inf,{}sup)} creates a new interval,{} either \\axiom{[\\spad{inf},{}\\spad{sup}]} if \\axiom{\\spad{inf} \\spad{<=} \\spad{sup}} or \\axiom{[\\spad{sup},{}in]} otherwise."))) 
-((-1394 . T) (-4376 . T) ((-4385 "*") . T) (-4377 . T) (-4378 . T) (-4380 . T)) 
+((-1395 . T) (-4376 . T) ((-4385 "*") . T) (-4377 . T) (-4378 . T) (-4380 . T)) 
 NIL 
 (-549 S) 
 ((|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."))) 
@@ -2132,7 +2132,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."))) 
 ((-4376 . T) ((-4385 "*") . T) (-4377 . T) (-4378 . T) (-4380 . T)) 
 NIL 
-(-551 R -3198) 
+(-551 R -3199) 
 ((|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,{}[[\\spad{ci},{} \\spad{gi}]]]} such that the \\spad{gi}\\spad{'s} are among \\spad{[g1,{}...,{}gn]},{} and \\spad{d(h+sum(\\spad{ci} log(\\spad{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 
@@ -2144,7 +2144,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 
-(-554 R -3198 L) 
+(-554 R -3199 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,{}[[\\spad{ci},{} \\spad{ui}]]]} such that the \\spad{ui}\\spad{'s} are among \\spad{[u1,{}...,{}un]} and \\spad{d(h + sum(\\spad{ci} log(\\spad{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,{}[[\\spad{ci},{} \\spad{ui}]]]} such that the \\spad{ui}\\spad{'s} are among \\spad{[u1,{}...,{}un]} and \\spad{d(h + sum(\\spad{ci} log(\\spad{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 -646) (|devaluate| |#2|)))) 
@@ -2152,11 +2152,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 
-(-556 -3198 UP UPUP R) 
+(-556 -3199 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 
-(-557 -3198 UP) 
+(-557 -3199 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 
@@ -2168,15 +2168,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 
-(-560 R -3198 L) 
+(-560 R -3199 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,{}[[\\spad{ci},{} \\spad{ui}]]]} such that the \\spad{ui}\\spad{'s} are among \\spad{[u1,{}...,{}un]} and \\spad{d(h + sum(\\spad{ci} log(\\spad{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 -646) (|devaluate| |#2|)))) 
-(-561 R -3198) 
+(-561 R -3199) 
 ((|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 -606) (LIST (QUOTE -882) (QUOTE (-558))))) (|HasCategory| |#1| (LIST (QUOTE -876) (QUOTE (-558)))) (|HasCategory| |#2| (QUOTE (-1126)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -606) (LIST (QUOTE -882) (QUOTE (-558))))) (|HasCategory| |#1| (LIST (QUOTE -876) (QUOTE (-558)))) (|HasCategory| |#2| (QUOTE (-621))))) 
-(-562 -3198 UP) 
+(-562 -3199 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,{}[[\\spad{ci},{} \\spad{gi}]]]} such that the \\spad{gi}\\spad{'s} are among \\spad{[g1,{}...,{}gn]},{} \\spad{ci' = 0},{} and \\spad{(h+sum(\\spad{ci} log(\\spad{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 
@@ -2184,27 +2184,27 @@ 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 
-(-564 -3198) 
+(-564 -3199) 
 ((|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,{} [[\\spad{ci},{}\\spad{gi}]]]} such that the \\spad{gi}\\spad{'s} are among \\spad{[g1,{}...,{}gn]},{} \\spad{dci/dx = 0},{} and \\spad{d(h + sum(\\spad{ci} log(\\spad{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 
 (-565 R) 
 ((|constructor| (NIL "\\indented{1}{+ Author: Mike Dewar} + Date Created: November 1996 + Date Last Updated: + Basic Functions: + Related Constructors: + Also See: + AMS Classifications: + Keywords: + References: + Description: + This domain is an implementation of interval arithmetic and transcendental + functions over intervals."))) 
-((-1394 . T) (-4376 . T) ((-4385 "*") . T) (-4377 . T) (-4378 . T) (-4380 . T)) 
+((-1395 . T) (-4376 . T) ((-4385 "*") . T) (-4377 . T) (-4378 . T) (-4380 . T)) 
 NIL 
 (-566) 
 ((|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 \\spad{fi} = sum ai/fi} or returns \"failed\" if no such list of \\spad{ai}\\spad{'s} exists."))) 
 NIL 
 NIL 
-(-567 R -3198) 
+(-567 R -3199) 
 ((|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 -606) (LIST (QUOTE -882) (QUOTE (-558))))) (|HasCategory| |#1| (QUOTE (-450))) (|HasCategory| |#1| (LIST (QUOTE -876) (QUOTE (-558)))) (|HasCategory| |#2| (QUOTE (-283))) (|HasCategory| |#2| (QUOTE (-621))) (|HasCategory| |#2| (LIST (QUOTE -1028) (QUOTE (-1163))))) (-12 (|HasCategory| |#1| (QUOTE (-450))) (|HasCategory| |#2| (QUOTE (-283)))) (|HasCategory| |#1| (QUOTE (-550)))) 
-(-568 -3198 UP) 
+(-568 -3199 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' + +/[\\spad{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(+,{}[\\spad{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(+,{}[\\spad{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 
-(-569 R -3198) 
+(-569 R -3199) 
 ((|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 
@@ -2221,7 +2221,7 @@ NIL
 NIL 
 NIL 
 (-573) 
-((|constructor| (NIL "This domain provides representation for ARPA Internet IP4 addresses.")) (|resolve| (((|Union| $ "failed") (|Hostname|)) "\\spad{resolve(h)} returns the IP4 address of host \\spad{`h'}.")) (|bytes| (((|DataArray| 4 (|Byte|)) $) "\\spad{bytes(x)} returns the bytes of the numeric address \\spad{`x'}.")) (|ip4Address| (($ (|String|)) "\\spad{ip4Address(a)} builds a numeric address out of the ASCII form `a'."))) 
+((|constructor| (NIL "This domain provides representation for ARPA Internet IP4 addresses.")) (|resolve| (((|Maybe| $) (|Hostname|)) "\\spad{resolve(h)} returns the IP4 address of host \\spad{`h'}.")) (|bytes| (((|DataArray| 4 (|Byte|)) $) "\\spad{bytes(x)} returns the bytes of the numeric address \\spad{`x'}.")) (|ip4Address| (($ (|String|)) "\\spad{ip4Address(a)} builds a numeric address out of the ASCII form `a'."))) 
 NIL 
 NIL 
 (-574 |p| |unBalanced?|) 
@@ -2236,15 +2236,15 @@ 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 
-(-577 R -3198) 
+(-577 R -3199) 
 ((|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 
-(-578 E -3198) 
+(-578 E -3199) 
 ((|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 
-(-579 -3198) 
+(-579 -3199) 
 ((|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}."))) 
 ((-4378 . T) (-4377 . T)) 
 ((|HasCategory| |#1| (LIST (QUOTE -890) (QUOTE (-1163)))) (|HasCategory| |#1| (LIST (QUOTE -1028) (QUOTE (-1163))))) 
@@ -2296,7 +2296,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 
-(-592 R -3198 FG) 
+(-592 R -3199 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{\\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{\\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 
@@ -2356,7 +2356,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 
-(-607 -3198 UP) 
+(-607 -3199 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 
@@ -2384,7 +2384,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}."))) 
 ((-4377 . T) (-4378 . T) (-4380 . T)) 
 ((|HasCategory| |#1| (QUOTE (-839)))) 
-(-614 R -3198) 
+(-614 R -3199) 
 ((|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 
@@ -2416,11 +2416,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(\\%\\spad{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{\\spad{li}(x)} returns the logarithmic integral of \\spad{x},{} \\spadignore{i.e.} the integral of \\spad{dx / log(x)}.")) (|Ci| (($ $) "\\spad{\\spad{Ci}(x)} returns the cosine integral of \\spad{x},{} \\spadignore{i.e.} the integral of \\spad{cos(x) / x dx}.")) (|Si| (($ $) "\\spad{\\spad{Si}(x)} returns the sine integral of \\spad{x},{} \\spadignore{i.e.} the integral of \\spad{sin(x) / x dx}.")) (|Ei| (($ $) "\\spad{\\spad{Ei}(x)} returns the exponential integral of \\spad{x},{} \\spadignore{i.e.} the integral of \\spad{exp(x)/x dx}."))) 
 NIL 
 NIL 
-(-622 R -3198) 
+(-622 R -3199) 
 ((|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{\\spad{li}(f)} denotes the logarithmic integral")) (|Ci| ((|#2| |#2|) "\\spad{\\spad{Ci}(f)} denotes the cosine integral")) (|Si| ((|#2| |#2|) "\\spad{\\spad{Si}(f)} denotes the sine integral")) (|Ei| ((|#2| |#2|) "\\spad{\\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 
-(-623 |lv| -3198) 
+(-623 |lv| -3199) 
 ((|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 
@@ -2496,7 +2496,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,{}..))}.")) (|elt| (($ $ (|UniversalSegment| (|Integer|))) "\\spad{elt(u,{}i..j)} (also written: \\axiom{a(\\spad{i}..\\spad{j})}) returns the aggregate of elements \\axiom{\\spad{u}} for \\spad{k} from \\spad{i} to \\spad{j} in that order. Note: in general,{} \\axiom{a.\\spad{s} = [a.\\spad{k} for \\spad{i} in \\spad{s}]}.")) (|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 
-(-642 R -3198 L) 
+(-642 R -3199 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 
@@ -2516,11 +2516,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}."))) 
 ((-4377 . T) (-4378 . T) (-4380 . T)) 
 NIL 
-(-647 -3198 UP) 
+(-647 -3199 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)))) 
-(-648 A -2680) 
+(-648 A -2181) 
 ((|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}}"))) 
 ((-4377 . T) (-4378 . T) (-4380 . T)) 
 ((|HasCategory| |#1| (QUOTE (-171))) (|HasCategory| |#1| (LIST (QUOTE -1028) (LIST (QUOTE -406) (QUOTE (-558))))) (|HasCategory| |#1| (LIST (QUOTE -1028) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-550))) (|HasCategory| |#1| (QUOTE (-450))) (|HasCategory| |#1| (QUOTE (-362)))) 
@@ -2556,11 +2556,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}."))) 
 ((-4384 . T) (-4383 . T)) 
 NIL 
-(-657 -3198) 
+(-657 -3199) 
 ((|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 
-(-658 -3198 |Row| |Col| M) 
+(-658 -3199 |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 
@@ -2656,7 +2656,7 @@ NIL
 ((|constructor| (NIL "This domain implements the notion of optional value,{} where a computation may fail to produce expected value.")) (|nothing| (($) "represents failure.")) (|autoCoerce| ((|#1| $) "autoCoerce is a courtesy coercion function used by the compiler in case it knows that \\spad{`x'} really is a \\spad{T}.")) (|case| (((|Boolean|) $ (|[\|\|]| |nothing|)) "\\spad{x case nothing} evaluates \\spad{true} 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|) "maybe(\\spad{x}) injects the value \\spad{`x'} into \\%."))) 
 NIL 
 NIL 
-(-682 S -3198 FLAF FLAS) 
+(-682 S -3199 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 
@@ -2680,13 +2680,13 @@ 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 
-(-688 OV E -3198 PG) 
+(-688 OV E -3199 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 
 (-689) 
 ((|constructor| (NIL "A domain which models the floating point representation used by machines in the AXIOM-NAG link.")) (|changeBase| (($ (|Integer|) (|Integer|) (|PositiveInteger|)) "\\spad{changeBase(exp,{}man,{}base)} \\undocumented{}")) (|exponent| (((|Integer|) $) "\\spad{exponent(u)} returns the exponent of \\spad{u}")) (|mantissa| (((|Integer|) $) "\\spad{mantissa(u)} returns the mantissa of \\spad{u}")) (|coerce| (($ (|MachineInteger|)) "\\spad{coerce(u)} transforms a MachineInteger into a MachineFloat") (((|Float|) $) "\\spad{coerce(u)} transforms a MachineFloat to a standard Float")) (|minimumExponent| (((|Integer|)) "\\spad{minimumExponent()} returns the minimum exponent in the model") (((|Integer|) (|Integer|)) "\\spad{minimumExponent(e)} sets the minimum exponent in the model to \\spad{e}")) (|maximumExponent| (((|Integer|)) "\\spad{maximumExponent()} returns the maximum exponent in the model") (((|Integer|) (|Integer|)) "\\spad{maximumExponent(e)} sets the maximum exponent in the model to \\spad{e}")) (|base| (((|PositiveInteger|) (|PositiveInteger|)) "\\spad{base(b)} sets the base of the model to \\spad{b}")) (|precision| (((|PositiveInteger|)) "\\spad{precision()} returns the number of digits in the model") (((|PositiveInteger|) (|PositiveInteger|)) "\\spad{precision(p)} sets the number of digits in the model to \\spad{p}"))) 
-((-1394 . T) (-4375 . T) (-4381 . T) (-4376 . T) ((-4385 "*") . T) (-4377 . T) (-4378 . T) (-4380 . T)) 
+((-1395 . T) (-4375 . T) (-4381 . T) (-4376 . T) ((-4385 "*") . T) (-4377 . T) (-4378 . T) (-4380 . T)) 
 NIL 
 (-690 R) 
 ((|constructor| (NIL "\\indented{1}{Modular hermitian row reduction.} Author: Manuel Bronstein Date Created: 22 February 1989 Date Last Updated: 24 November 1993 Keywords: matrix,{} reduction.")) (|normalizedDivide| (((|Record| (|:| |quotient| |#1|) (|:| |remainder| |#1|)) |#1| |#1|) "\\spad{normalizedDivide(n,{}d)} returns a normalized quotient and remainder such that consistently unique representatives for the residue class are chosen,{} \\spadignore{e.g.} positive remainders")) (|rowEchelonLocal| (((|Matrix| |#1|) (|Matrix| |#1|) |#1| |#1|) "\\spad{rowEchelonLocal(m,{} d,{} p)} computes the row-echelon form of \\spad{m} concatenated with \\spad{d} times the identity matrix over a local ring where \\spad{p} is the only prime.")) (|rowEchLocal| (((|Matrix| |#1|) (|Matrix| |#1|) |#1|) "\\spad{rowEchLocal(m,{}p)} computes a modular row-echelon form of \\spad{m},{} finding an appropriate modulus over a local ring where \\spad{p} is the only prime.")) (|rowEchelon| (((|Matrix| |#1|) (|Matrix| |#1|) |#1|) "\\spad{rowEchelon(m,{} d)} computes a modular row-echelon form mod \\spad{d} of \\indented{3}{[\\spad{d}\\space{5}]} \\indented{3}{[\\space{2}\\spad{d}\\space{3}]} \\indented{3}{[\\space{4}. ]} \\indented{3}{[\\space{5}\\spad{d}]} \\indented{3}{[\\space{3}\\spad{M}\\space{2}]} where \\spad{M = m mod d}.")) (|rowEch| (((|Matrix| |#1|) (|Matrix| |#1|)) "\\spad{rowEch(m)} computes a modular row-echelon form of \\spad{m},{} finding an appropriate modulus."))) 
@@ -2716,7 +2716,7 @@ NIL
 ((|constructor| (NIL "MakeRecord is used internally by the interpreter to create record types which are used for doing parallel iterations on streams.")) (|makeRecord| (((|Record| (|:| |part1| |#1|) (|:| |part2| |#2|)) |#1| |#2|) "\\spad{makeRecord(a,{}b)} creates a record object with type Record(part1:S,{} part2:R),{} where part1 is \\spad{a} and part2 is \\spad{b}."))) 
 NIL 
 NIL 
-(-697 S -2922 I) 
+(-697 S -2921 I) 
 ((|constructor| (NIL "transforms top-level objects into compiled functions.")) (|compiledFunction| (((|Mapping| |#3| |#2|) |#1| (|Symbol|)) "\\spad{compiledFunction(expr,{} x)} returns a function \\spad{f: D -> I} defined by \\spad{f(x) == expr}. Function \\spad{f} is compiled and directly applicable to objects of type \\spad{D}.")) (|unaryFunction| (((|Mapping| |#3| |#2|) (|Symbol|)) "\\spad{unaryFunction(a)} is a local function"))) 
 NIL 
 NIL 
@@ -2736,7 +2736,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 
-(-702 R |Mod| -4160 -3743 |exactQuo|) 
+(-702 R |Mod| -1783 -2297 |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"))) 
 ((-4375 . T) (-4381 . T) (-4376 . T) ((-4385 "*") . T) (-4377 . T) (-4378 . T) (-4380 . T)) 
 NIL 
@@ -2752,7 +2752,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}."))) 
 ((-4378 |has| |#1| (-171)) (-4377 |has| |#1| (-171)) (-4380 . T)) 
 ((|HasCategory| |#1| (QUOTE (-171))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-146)))) 
-(-706 R |Mod| -4160 -3743 |exactQuo|) 
+(-706 R |Mod| -1783 -2297 |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"))) 
 ((-4380 . T)) 
 NIL 
@@ -2764,7 +2764,7 @@ NIL
 ((|constructor| (NIL "The category of modules over a commutative ring. \\blankline"))) 
 ((-4378 . T) (-4377 . T)) 
 NIL 
-(-709 -3198) 
+(-709 -3199) 
 ((|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]]}."))) 
 ((-4380 . T)) 
 NIL 
@@ -2800,7 +2800,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 
-(-718 -3198 UP) 
+(-718 -3199 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 
@@ -2952,11 +2952,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 
-(-756 -3198) 
+(-756 -3199) 
 ((|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 
-(-757 P -3198) 
+(-757 P -3199) 
 ((|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 
@@ -2964,7 +2964,7 @@ NIL
 NIL 
 NIL 
 NIL 
-(-759 UP -3198) 
+(-759 UP -3199) 
 ((|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{\\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{\\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{\\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{\\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{\\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{\\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 
@@ -2980,7 +2980,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."))) 
 (((-4385 "*") . T)) 
 NIL 
-(-763 R -3198) 
+(-763 R -3199) 
 ((|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 
@@ -3000,7 +3000,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 
-(-768 -3198 |ExtF| |SUEx| |ExtP| |n|) 
+(-768 -3199 |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 
@@ -3096,11 +3096,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 
-(-792 R -3198 L) 
+(-792 R -3199 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{\\spad{yi}}\\spad{'s} form a basis for the solutions of \\spad{op y = 0}."))) 
 NIL 
 NIL 
-(-793 R -3198) 
+(-793 R -3199) 
 ((|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 
@@ -3108,7 +3108,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 
-(-795 R -3198) 
+(-795 R -3199) 
 ((|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 
@@ -3116,11 +3116,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 
-(-797 -3198 UP UPUP R) 
+(-797 -3199 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 
-(-798 -3198 UP L LQ) 
+(-798 -3199 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 
@@ -3128,27 +3128,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 
-(-800 -3198 UP L LQ) 
+(-800 -3199 UP L LQ) 
 ((|constructor| (NIL "In-field solution of Riccati equations,{} primitive case.")) (|changeVar| ((|#3| |#3| (|Fraction| |#2|)) "\\spad{changeVar(+/[\\spad{ai} D^i],{} a)} returns the operator \\spad{+/[\\spad{ai} (D+a)\\spad{^i}]}.") ((|#3| |#3| |#2|) "\\spad{changeVar(+/[\\spad{ai} D^i],{} a)} returns the operator \\spad{+/[\\spad{ai} (D+a)\\spad{^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{\\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{\\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 \\spad{ai}}} is \\spad{\\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 
-(-801 -3198 UP) 
+(-801 -3199 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 
-(-802 -3198 L UP A LO) 
+(-802 -3199 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 
-(-803 -3198 UP) 
+(-803 -3199 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{\\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 \\spad{ai}}} is \\spad{\\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)))) 
-(-804 -3198 LO) 
+(-804 -3199 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 
-(-805 -3198 LODO) 
+(-805 -3199 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(\\spad{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(\\spad{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 
@@ -3308,11 +3308,11 @@ NIL
 ((|constructor| (NIL "\\spad{UnivariateSkewPolynomialCategoryOps} provides products and \\indented{1}{divisions of univariate skew polynomials.}")) (|rightDivide| (((|Record| (|:| |quotient| |#2|) (|:| |remainder| |#2|)) |#2| |#2| (|Automorphism| |#1|)) "\\spad{rightDivide(a,{} b,{} sigma)} returns the pair \\spad{[q,{}r]} such that \\spad{a = q*b + r} and the degree of \\spad{r} is less than the degree of \\spad{b}. This process is called ``right division\\spad{''}. \\spad{\\sigma} is the morphism to use.")) (|leftDivide| (((|Record| (|:| |quotient| |#2|) (|:| |remainder| |#2|)) |#2| |#2| (|Automorphism| |#1|)) "\\spad{leftDivide(a,{} b,{} sigma)} 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{''}. \\spad{\\sigma} is the morphism to use.")) (|monicRightDivide| (((|Record| (|:| |quotient| |#2|) (|:| |remainder| |#2|)) |#2| |#2| (|Automorphism| |#1|)) "\\spad{monicRightDivide(a,{} b,{} sigma)} returns the pair \\spad{[q,{}r]} such that \\spad{a = q*b + r} and the degree of \\spad{r} is less than the degree of \\spad{b}. \\spad{b} must be monic. This process is called ``right division\\spad{''}. \\spad{\\sigma} is the morphism to use.")) (|monicLeftDivide| (((|Record| (|:| |quotient| |#2|) (|:| |remainder| |#2|)) |#2| |#2| (|Automorphism| |#1|)) "\\spad{monicLeftDivide(a,{} b,{} sigma)} 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}. \\spad{b} must be monic. This process is called ``left division\\spad{''}. \\spad{\\sigma} is the morphism to use.")) (|apply| ((|#1| |#2| |#1| |#1| (|Automorphism| |#1|) (|Mapping| |#1| |#1|)) "\\spad{apply(p,{} c,{} m,{} sigma,{} delta)} returns \\spad{p(m)} where the action is given by \\spad{x m = c sigma(m) + delta(m)}.")) (|times| ((|#2| |#2| |#2| (|Automorphism| |#1|) (|Mapping| |#1| |#1|)) "\\spad{times(p,{} q,{} sigma,{} delta)} returns \\spad{p * q}. \\spad{\\sigma} and \\spad{\\delta} are the maps to use."))) 
 NIL 
 ((|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-550)))) 
-(-845 R |sigma| -4151) 
+(-845 R |sigma| -4150) 
 ((|constructor| (NIL "This is the domain of sparse univariate skew polynomials over an Ore coefficient field. The multiplication is given by \\spad{x a = \\sigma(a) x + \\delta a}.")) (|outputForm| (((|OutputForm|) $ (|OutputForm|)) "\\spad{outputForm(p,{} x)} returns the output form of \\spad{p} using \\spad{x} for the otherwise anonymous variable."))) 
 ((-4377 . T) (-4378 . T) (-4380 . T)) 
 ((|HasCategory| |#1| (QUOTE (-171))) (|HasCategory| |#1| (LIST (QUOTE -1028) (LIST (QUOTE -406) (QUOTE (-558))))) (|HasCategory| |#1| (LIST (QUOTE -1028) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-550))) (|HasCategory| |#1| (QUOTE (-450))) (|HasCategory| |#1| (QUOTE (-362)))) 
-(-846 |x| R |sigma| -4151) 
+(-846 |x| R |sigma| -4150) 
 ((|constructor| (NIL "This is the domain of univariate skew polynomials over an Ore coefficient field in a named variable. The multiplication is given by \\spad{x a = \\sigma(a) x + \\delta a}."))) 
 ((-4377 . T) (-4378 . T) (-4380 . T)) 
 ((|HasCategory| |#2| (QUOTE (-171))) (|HasCategory| |#2| (LIST (QUOTE -1028) (LIST (QUOTE -406) (QUOTE (-558))))) (|HasCategory| |#2| (LIST (QUOTE -1028) (QUOTE (-558)))) (|HasCategory| |#2| (QUOTE (-550))) (|HasCategory| |#2| (QUOTE (-450))) (|HasCategory| |#2| (QUOTE (-362)))) 
@@ -3448,7 +3448,7 @@ NIL
 ((|constructor| (NIL "A PatternMatchResult is an object internally returned by the pattern matcher; It is either a failed match,{} or a list of matches of the form (var,{} expr) meaning that the variable var matches the expression expr.")) (|satisfy?| (((|Union| (|Boolean|) "failed") $ (|Pattern| |#1|)) "\\spad{satisfy?(r,{} p)} returns \\spad{true} if the matches satisfy the top-level predicate of \\spad{p},{} \\spad{false} if they don\\spad{'t},{} and \"failed\" if not enough variables of \\spad{p} are matched in \\spad{r} to decide.")) (|construct| (($ (|List| (|Record| (|:| |key| (|Symbol|)) (|:| |entry| |#2|)))) "\\spad{construct([v1,{}e1],{}...,{}[vn,{}en])} returns the match result containing the matches (\\spad{v1},{}e1),{}...,{}(\\spad{vn},{}en).")) (|destruct| (((|List| (|Record| (|:| |key| (|Symbol|)) (|:| |entry| |#2|))) $) "\\spad{destruct(r)} returns the list of matches (var,{} expr) in \\spad{r}. Error: if \\spad{r} is a failed match.")) (|addMatchRestricted| (($ (|Pattern| |#1|) |#2| $ |#2|) "\\spad{addMatchRestricted(var,{} expr,{} r,{} val)} adds the match (\\spad{var},{} \\spad{expr}) in \\spad{r},{} provided that \\spad{expr} satisfies the predicates attached to \\spad{var},{} that \\spad{var} is not matched to another expression already,{} and that either \\spad{var} is an optional pattern variable or that \\spad{expr} is not equal to val (usually an identity).")) (|insertMatch| (($ (|Pattern| |#1|) |#2| $) "\\spad{insertMatch(var,{} expr,{} r)} adds the match (\\spad{var},{} \\spad{expr}) in \\spad{r},{} without checking predicates or previous matches for \\spad{var}.")) (|addMatch| (($ (|Pattern| |#1|) |#2| $) "\\spad{addMatch(var,{} expr,{} r)} adds the match (\\spad{var},{} \\spad{expr}) in \\spad{r},{} provided that \\spad{expr} satisfies the predicates attached to \\spad{var},{} and that \\spad{var} is not matched to another expression already.")) (|getMatch| (((|Union| |#2| "failed") (|Pattern| |#1|) $) "\\spad{getMatch(var,{} r)} returns the expression that \\spad{var} matches in the result \\spad{r},{} and \"failed\" if \\spad{var} is not matched in \\spad{r}.")) (|union| (($ $ $) "\\spad{union(a,{} b)} makes the set-union of two match results.")) (|new| (($) "\\spad{new()} returns a new empty match result.")) (|failed| (($) "\\spad{failed()} returns a failed match.")) (|failed?| (((|Boolean|) $) "\\spad{failed?(r)} tests if \\spad{r} is a failed match."))) 
 NIL 
 NIL 
-(-880 R -2922) 
+(-880 R -2921) 
 ((|constructor| (NIL "Tools for patterns.")) (|badValues| (((|List| |#2|) (|Pattern| |#1|)) "\\spad{badValues(p)} returns the list of \"bad values\" for \\spad{p}; \\spad{p} is not allowed to match any of its \"bad values\".")) (|addBadValue| (((|Pattern| |#1|) (|Pattern| |#1|) |#2|) "\\spad{addBadValue(p,{} v)} adds \\spad{v} to the list of \"bad values\" for \\spad{p}; \\spad{p} is not allowed to match any of its \"bad values\".")) (|satisfy?| (((|Boolean|) (|List| |#2|) (|Pattern| |#1|)) "\\spad{satisfy?([v1,{}...,{}vn],{} p)} returns \\spad{f(v1,{}...,{}vn)} where \\spad{f} is the top-level predicate attached to \\spad{p}.") (((|Boolean|) |#2| (|Pattern| |#1|)) "\\spad{satisfy?(v,{} p)} returns \\spad{f}(\\spad{v}) where \\spad{f} is the predicate attached to \\spad{p}.")) (|predicate| (((|Mapping| (|Boolean|) |#2|) (|Pattern| |#1|)) "\\spad{predicate(p)} returns the predicate attached to \\spad{p},{} the constant function \\spad{true} if \\spad{p} has no predicates attached to it.")) (|suchThat| (((|Pattern| |#1|) (|Pattern| |#1|) (|List| (|Symbol|)) (|Mapping| (|Boolean|) (|List| |#2|))) "\\spad{suchThat(p,{} [a1,{}...,{}an],{} f)} returns a copy of \\spad{p} with the top-level predicate set to \\spad{f(a1,{}...,{}an)}.") (((|Pattern| |#1|) (|Pattern| |#1|) (|List| (|Mapping| (|Boolean|) |#2|))) "\\spad{suchThat(p,{} [f1,{}...,{}fn])} makes a copy of \\spad{p} and adds the predicate \\spad{f1} and ... and \\spad{fn} to the copy,{} which is returned.") (((|Pattern| |#1|) (|Pattern| |#1|) (|Mapping| (|Boolean|) |#2|)) "\\spad{suchThat(p,{} f)} makes a copy of \\spad{p} and adds the predicate \\spad{f} to the copy,{} which is returned."))) 
 NIL 
 NIL 
@@ -3472,7 +3472,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 
-(-886 UP -3198) 
+(-886 UP -3199) 
 ((|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 
@@ -3532,7 +3532,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."))) 
 ((-4375 . T) (-4381 . T) (-4376 . T) ((-4385 "*") . T) (-4377 . T) (-4378 . T) (-4380 . T)) 
 ((|HasCategory| $ (QUOTE (-146))) (|HasCategory| $ (QUOTE (-144))) (|HasCategory| $ (QUOTE (-367)))) 
-(-901 R0 -3198 UP UPUP R) 
+(-901 R0 -3199 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 
@@ -3560,7 +3560,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(\\spad{li})} constructs the janko group acting on the 100 integers given in the list {\\em \\spad{li}}. Note: duplicates in the list will be removed. Error: if {\\em \\spad{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(\\spad{li})} constructs the mathieu group acting on the 24 integers given in the list {\\em \\spad{li}}. Note: duplicates in the list will be removed. Error: if {\\em \\spad{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(\\spad{li})} constructs the mathieu group acting on the 23 integers given in the list {\\em \\spad{li}}. Note: duplicates in the list will be removed. Error: if {\\em \\spad{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(\\spad{li})} constructs the mathieu group acting on the 22 integers given in the list {\\em \\spad{li}}. Note: duplicates in the list will be removed. Error: if {\\em \\spad{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(\\spad{li})} constructs the mathieu group acting on the 12 integers given in the list {\\em \\spad{li}}. Note: duplicates in the list will be removed Error: if {\\em \\spad{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(\\spad{li})} constructs the mathieu group acting on the 11 integers given in the list {\\em \\spad{li}}. Note: duplicates in the list will be removed. error,{} if {\\em \\spad{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 \\spad{ni}}.")) (|alternatingGroup| (((|PermutationGroup| (|Integer|)) (|List| (|Integer|))) "\\spad{alternatingGroup(\\spad{li})} constructs the alternating group acting on the integers in the list {\\em \\spad{li}},{} generators are in general the {\\em n-2}-cycle {\\em (\\spad{li}.3,{}...,{}\\spad{li}.n)} and the 3-cycle {\\em (\\spad{li}.1,{}\\spad{li}.2,{}\\spad{li}.3)},{} if \\spad{n} is odd and product of the 2-cycle {\\em (\\spad{li}.1,{}\\spad{li}.2)} with {\\em n-2}-cycle {\\em (\\spad{li}.3,{}...,{}\\spad{li}.n)} and the 3-cycle {\\em (\\spad{li}.1,{}\\spad{li}.2,{}\\spad{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(\\spad{li})} constructs the symmetric group acting on the integers in the list {\\em \\spad{li}},{} generators are the cycle given by {\\em \\spad{li}} and the 2-cycle {\\em (\\spad{li}.1,{}\\spad{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 
-(-908 -3198) 
+(-908 -3199) 
 ((|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 
@@ -3576,11 +3576,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}."))) 
 (((-4385 "*") . T)) 
 NIL 
-(-912 -3198 P) 
+(-912 -3199 P) 
 ((|constructor| (NIL "This package exports interpolation algorithms")) (|LagrangeInterpolation| ((|#2| (|List| |#1|) (|List| |#1|)) "\\spad{LagrangeInterpolation(l1,{}l2)} \\undocumented"))) 
 NIL 
 NIL 
-(-913 |xx| -3198) 
+(-913 |xx| -3199) 
 ((|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 
@@ -3604,7 +3604,7 @@ NIL
 ((|constructor| (NIL "This package exports plotting tools")) (|calcRanges| (((|List| (|Segment| (|DoubleFloat|))) (|List| (|List| (|Point| (|DoubleFloat|))))) "\\spad{calcRanges(l)} \\undocumented"))) 
 NIL 
 NIL 
-(-919 R -3198) 
+(-919 R -3199) 
 ((|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| (|String|)) "\\spad{assert(x,{} s)} makes the assertion \\spad{s} about \\spad{x}. Error: if \\spad{x} is not a symbol."))) 
 NIL 
 NIL 
@@ -3616,7 +3616,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 
-(-922 S R -3198) 
+(-922 S R -3199) 
 ((|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 
@@ -3636,11 +3636,11 @@ 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 -876) (|devaluate| |#1|)))) 
-(-927 R -3198 -2922) 
+(-927 R -3199 -2921) 
 ((|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 
-(-928 -2922) 
+(-928 -2921) 
 ((|constructor| (NIL "Attaching predicates to symbols for pattern matching. Date Created: 21 Mar 1989 Date Last Updated: 23 May 1990")) (|suchThat| (((|Expression| (|Integer|)) (|Symbol|) (|List| (|Mapping| (|Boolean|) |#1|))) "\\spad{suchThat(x,{} [f1,{} f2,{} ...,{} fn])} attaches the predicate \\spad{f1} and \\spad{f2} and ... and \\spad{fn} to \\spad{x}.") (((|Expression| (|Integer|)) (|Symbol|) (|Mapping| (|Boolean|) |#1|)) "\\spad{suchThat(x,{} foo)} attaches the predicate foo to \\spad{x}."))) 
 NIL 
 NIL 
@@ -3688,7 +3688,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}."))) 
 (((-4385 "*") |has| |#1| (-171)) (-4376 |has| |#1| (-550)) (-4381 |has| |#1| (-6 -4381)) (-4378 . T) (-4377 . T) (-4380 . T)) 
 NIL 
-(-940 E V R P -3198) 
+(-940 E V R P -3199) 
 ((|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 
@@ -3700,7 +3700,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}."))) 
 (((-4385 "*") |has| |#1| (-171)) (-4376 |has| |#1| (-550)) (-4381 |has| |#1| (-6 -4381)) (-4378 . T) (-4377 . T) (-4380 . T)) 
 ((|HasCategory| |#1| (QUOTE (-899))) (-3996 (|HasCategory| |#1| (QUOTE (-171))) (|HasCategory| |#1| (QUOTE (-450))) (|HasCategory| |#1| (QUOTE (-550))) (|HasCategory| |#1| (QUOTE (-899)))) (-3996 (|HasCategory| |#1| (QUOTE (-450))) (|HasCategory| |#1| (QUOTE (-550))) (|HasCategory| |#1| (QUOTE (-899)))) (-3996 (|HasCategory| |#1| (QUOTE (-450))) (|HasCategory| |#1| (QUOTE (-899)))) (|HasCategory| |#1| (QUOTE (-550))) (|HasCategory| |#1| (QUOTE (-171))) (-3996 (|HasCategory| |#1| (QUOTE (-171))) (|HasCategory| |#1| (QUOTE (-550)))) (-12 (|HasCategory| (-1163) (LIST (QUOTE -876) (QUOTE (-378)))) (|HasCategory| |#1| (LIST (QUOTE -876) (QUOTE (-378))))) (-12 (|HasCategory| (-1163) (LIST (QUOTE -876) (QUOTE (-558)))) (|HasCategory| |#1| (LIST (QUOTE -876) (QUOTE (-558))))) (-12 (|HasCategory| (-1163) (LIST (QUOTE -606) (LIST (QUOTE -882) (QUOTE (-378))))) (|HasCategory| |#1| (LIST (QUOTE -606) (LIST (QUOTE -882) (QUOTE (-378)))))) (-12 (|HasCategory| (-1163) (LIST (QUOTE -606) (LIST (QUOTE -882) (QUOTE (-558))))) (|HasCategory| |#1| (LIST (QUOTE -606) (LIST (QUOTE -882) (QUOTE (-558)))))) (-12 (|HasCategory| (-1163) (LIST (QUOTE -606) (QUOTE (-534)))) (|HasCategory| |#1| (LIST (QUOTE -606) (QUOTE (-534))))) (|HasCategory| |#1| (QUOTE (-841))) (|HasCategory| |#1| (LIST (QUOTE -631) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558))))) (|HasCategory| |#1| (LIST (QUOTE -1028) (QUOTE (-558)))) (-3996 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558))))) (|HasCategory| |#1| (LIST (QUOTE -1028) (LIST (QUOTE -406) (QUOTE (-558)))))) (|HasCategory| |#1| (LIST (QUOTE -1028) (LIST (QUOTE -406) (QUOTE (-558))))) (|HasCategory| |#1| (QUOTE (-362))) (|HasAttribute| |#1| (QUOTE -4381)) (|HasCategory| |#1| (QUOTE (-450))) (-12 (|HasCategory| $ (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-899)))) (-3996 (-12 (|HasCategory| $ (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-899)))) (|HasCategory| |#1| (QUOTE (-144))))) 
-(-943 E V R P -3198) 
+(-943 E V R P -3199) 
 ((|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 (-450)))) 
@@ -3728,7 +3728,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 
-(-950 -3198) 
+(-950 -3199) 
 ((|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{\\spad{ai} = \\spad{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{\\spad{ai} = \\spad{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 
@@ -3828,7 +3828,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 
-(-975 K R UP -3198) 
+(-975 K R UP -3199) 
 ((|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{\\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{\\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{\\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{\\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{\\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{\\spad{wi} = sum(bij * vj,{} j = 1..n)}."))) 
 NIL 
 NIL 
@@ -3900,7 +3900,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 
-(-993 -3198 UP UPUP |radicnd| |n|) 
+(-993 -3199 UP UPUP |radicnd| |n|) 
 ((|constructor| (NIL "Function field defined by y**n = \\spad{f}(\\spad{x})."))) 
 ((-4376 |has| (-406 |#2|) (-362)) (-4381 |has| (-406 |#2|) (-362)) (-4375 |has| (-406 |#2|) (-362)) ((-4385 "*") . T) (-4377 . T) (-4378 . T) (-4380 . T)) 
 ((|HasCategory| (-406 |#2|) (QUOTE (-144))) (|HasCategory| (-406 |#2|) (QUOTE (-146))) (|HasCategory| (-406 |#2|) (QUOTE (-348))) (-3996 (|HasCategory| (-406 |#2|) (QUOTE (-362))) (|HasCategory| (-406 |#2|) (QUOTE (-348)))) (|HasCategory| (-406 |#2|) (QUOTE (-362))) (|HasCategory| (-406 |#2|) (QUOTE (-367))) (-3996 (-12 (|HasCategory| (-406 |#2|) (QUOTE (-232))) (|HasCategory| (-406 |#2|) (QUOTE (-362)))) (|HasCategory| (-406 |#2|) (QUOTE (-348)))) (-3996 (-12 (|HasCategory| (-406 |#2|) (LIST (QUOTE -890) (QUOTE (-1163)))) (|HasCategory| (-406 |#2|) (QUOTE (-362)))) (-12 (|HasCategory| (-406 |#2|) (LIST (QUOTE -890) (QUOTE (-1163)))) (|HasCategory| (-406 |#2|) (QUOTE (-348))))) (|HasCategory| (-406 |#2|) (LIST (QUOTE -631) (QUOTE (-558)))) (-3996 (|HasCategory| (-406 |#2|) (LIST (QUOTE -1028) (LIST (QUOTE -406) (QUOTE (-558))))) (|HasCategory| (-406 |#2|) (QUOTE (-362)))) (|HasCategory| (-406 |#2|) (LIST (QUOTE -1028) (LIST (QUOTE -406) (QUOTE (-558))))) (|HasCategory| (-406 |#2|) (LIST (QUOTE -1028) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-367))) (-12 (|HasCategory| (-406 |#2|) (LIST (QUOTE -890) (QUOTE (-1163)))) (|HasCategory| (-406 |#2|) (QUOTE (-362)))) (-12 (|HasCategory| (-406 |#2|) (QUOTE (-232))) (|HasCategory| (-406 |#2|) (QUOTE (-362))))) 
@@ -3940,19 +3940,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}}"))) 
 ((-4376 . T) (-4381 . T) (-4375 . T) (-4378 . T) (-4377 . T) ((-4385 "*") . T) (-4380 . T)) 
 NIL 
-(-1003 R -3198) 
+(-1003 R -3199) 
 ((|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 
-(-1004 R -3198) 
+(-1004 R -3199) 
 ((|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 
-(-1005 -3198 UP) 
+(-1005 -3199 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 
-(-1006 -3198 UP) 
+(-1006 -3199 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 
@@ -3988,7 +3988,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"))) 
 ((-4376 . T) (-4381 . T) (-4375 . T) (-4378 . T) (-4377 . T) ((-4385 "*") . T) (-4380 . T)) 
 ((-3996 (|HasCategory| (-406 (-558)) (LIST (QUOTE -1028) (QUOTE (-558)))) (|HasCategory| |#1| (LIST (QUOTE -1028) (QUOTE (-558))))) (|HasCategory| |#1| (LIST (QUOTE -1028) (LIST (QUOTE -406) (QUOTE (-558))))) (|HasCategory| |#1| (LIST (QUOTE -1028) (QUOTE (-558)))) (|HasCategory| (-406 (-558)) (LIST (QUOTE -1028) (LIST (QUOTE -406) (QUOTE (-558))))) (|HasCategory| (-406 (-558)) (LIST (QUOTE -1028) (QUOTE (-558))))) 
-(-1015 -3198 L) 
+(-1015 -3199 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{\\spad{fi}} must satisfy \\spad{op \\spad{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 
@@ -4024,7 +4024,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 
-(-1024 -3198 |Expon| |VarSet| |FPol| |LFPol|) 
+(-1024 -3199 |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"))) 
 (((-4385 "*") . T) (-4377 . T) (-4378 . T) (-4380 . T)) 
 NIL 
@@ -4088,7 +4088,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."))) 
 ((-4380 . T)) 
 NIL 
-(-1040 |xx| -3198) 
+(-1040 |xx| -3199) 
 ((|constructor| (NIL "This package exports rational interpolation algorithms"))) 
 NIL 
 NIL 
@@ -4180,11 +4180,11 @@ NIL
 ((|constructor| (NIL "This domain implements named rules")) (|name| (((|Symbol|) $) "\\spad{name(x)} returns the symbol"))) 
 NIL 
 NIL 
-(-1063 |Base| R -3198) 
+(-1063 |Base| R -3199) 
 ((|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 
-(-1064 |Base| R -3198) 
+(-1064 |Base| R -3199) 
 ((|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 
@@ -4340,7 +4340,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 
-(-1103 R -3198) 
+(-1103 R -3199) 
 ((|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 
@@ -4388,7 +4388,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}"))) 
 ((-4384 . T) (-4383 . T)) 
 NIL 
-(-1115 UP -3198) 
+(-1115 UP -3199) 
 ((|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 
@@ -4547,8 +4547,8 @@ NIL
 (-1154 |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.")) (|differentiate| (($ $ (|Variable| |#2|)) "\\spad{differentiate(f(x),{}x)} returns the derivative of \\spad{f(x)} with respect to \\spad{x}.")) (|coerce| (($ (|Variable| |#2|)) "\\spad{coerce(var)} converts the series variable \\spad{var} into a Laurent series."))) 
 (((-4385 "*") -3996 (-2113 (|has| |#1| (-362)) (|has| (-1161 |#1| |#2| |#3|) (-811))) (|has| |#1| (-171)) (-2113 (|has| |#1| (-362)) (|has| (-1161 |#1| |#2| |#3|) (-899)))) (-4376 -3996 (-2113 (|has| |#1| (-362)) (|has| (-1161 |#1| |#2| |#3|) (-811))) (|has| |#1| (-550)) (-2113 (|has| |#1| (-362)) (|has| (-1161 |#1| |#2| |#3|) (-899)))) (-4381 |has| |#1| (-362)) (-4375 |has| |#1| (-362)) (-4377 . T) (-4378 . T) (-4380 . T)) 
-((-3996 (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-811))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-841))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-899))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-1012))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-1138))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (LIST (QUOTE -606) (QUOTE (-534)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (LIST (QUOTE -606) (LIST (QUOTE -882) (QUOTE (-378))))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (LIST (QUOTE -606) (LIST (QUOTE -882) (QUOTE (-558))))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (LIST (QUOTE -285) (LIST (QUOTE -1161) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1161) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (LIST (QUOTE -308) (LIST (QUOTE -1161) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (LIST (QUOTE -512) (QUOTE (-1163)) (LIST (QUOTE -1161) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (LIST (QUOTE -631) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (LIST (QUOTE -876) (QUOTE (-378)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (LIST (QUOTE -876) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (LIST (QUOTE -1028) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (LIST (QUOTE -1028) (QUOTE (-1163)))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558)))))) (|HasCategory| |#1| (QUOTE (-550))) (|HasCategory| |#1| (QUOTE (-171))) (-3996 (|HasCategory| |#1| (QUOTE (-171))) (|HasCategory| |#1| (QUOTE (-550)))) (-3996 (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasCategory| |#1| (QUOTE (-144)))) (-3996 (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasCategory| |#1| (QUOTE (-146)))) (-3996 (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (LIST (QUOTE -890) (QUOTE (-1163)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -890) (QUOTE (-1163)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-558)) (|devaluate| |#1|)))))) (-3996 (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-232))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-558)) (|devaluate| |#1|))))) (|HasCategory| (-558) (QUOTE (-1099))) (-3996 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-550)))) (|HasCategory| |#1| (QUOTE (-362))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-899))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (LIST (QUOTE -1028) (QUOTE (-1163)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (LIST (QUOTE -606) (QUOTE (-534)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-1012))) (|HasCategory| |#1| (QUOTE (-362)))) (-3996 (|HasCategory| |#1| (QUOTE (-171))) (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-550)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-811))) (|HasCategory| |#1| (QUOTE (-362)))) (-3996 (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-811))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-841))) (|HasCategory| |#1| (QUOTE (-362))))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (LIST (QUOTE -1028) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-1138))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (LIST (QUOTE -285) (LIST (QUOTE -1161) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1161) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (LIST (QUOTE -308) (LIST (QUOTE -1161) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (LIST (QUOTE -512) (QUOTE (-1163)) (LIST (QUOTE -1161) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (LIST (QUOTE -631) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (LIST (QUOTE -606) (LIST (QUOTE -882) (QUOTE (-558))))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (LIST (QUOTE -606) (LIST (QUOTE -882) (QUOTE (-378))))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (LIST (QUOTE -876) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (LIST (QUOTE -876) (QUOTE (-378)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-558))))) (|HasSignature| |#1| (LIST (QUOTE -2560) (LIST (|devaluate| |#1|) (QUOTE (-1163)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-558))))) (-3996 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-949))) (|HasCategory| |#1| (QUOTE (-1185))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558))))) (|HasSignature| |#1| (LIST (QUOTE -3710) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1163))))) (|HasSignature| |#1| (LIST (QUOTE -2664) (LIST (LIST (QUOTE -635) (QUOTE (-1163))) (|devaluate| |#1|)))))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-543))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-306))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-899))) (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-144))) (-3996 (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-811))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-899))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasCategory| |#1| (QUOTE (-550)))) (-3996 (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (LIST (QUOTE -1028) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558)))))) (-3996 (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-811))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-899))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasCategory| |#1| (QUOTE (-171)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-841))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558))))) (-12 (|HasCategory| $ (QUOTE (-144))) (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-899))) (|HasCategory| |#1| (QUOTE (-362)))) (-3996 (-12 (|HasCategory| $ (QUOTE (-144))) (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-899))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasCategory| |#1| (QUOTE (-144))))) 
-(-1155 R -3198) 
+((-3996 (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-811))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-841))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-899))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-1012))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-1138))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (LIST (QUOTE -606) (QUOTE (-534)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (LIST (QUOTE -606) (LIST (QUOTE -882) (QUOTE (-378))))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (LIST (QUOTE -606) (LIST (QUOTE -882) (QUOTE (-558))))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (LIST (QUOTE -285) (LIST (QUOTE -1161) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1161) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (LIST (QUOTE -308) (LIST (QUOTE -1161) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (LIST (QUOTE -512) (QUOTE (-1163)) (LIST (QUOTE -1161) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (LIST (QUOTE -631) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (LIST (QUOTE -876) (QUOTE (-378)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (LIST (QUOTE -876) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (LIST (QUOTE -1028) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (LIST (QUOTE -1028) (QUOTE (-1163)))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558)))))) (|HasCategory| |#1| (QUOTE (-550))) (|HasCategory| |#1| (QUOTE (-171))) (-3996 (|HasCategory| |#1| (QUOTE (-171))) (|HasCategory| |#1| (QUOTE (-550)))) (-3996 (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasCategory| |#1| (QUOTE (-144)))) (-3996 (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasCategory| |#1| (QUOTE (-146)))) (-3996 (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (LIST (QUOTE -890) (QUOTE (-1163)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -890) (QUOTE (-1163)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-558)) (|devaluate| |#1|)))))) (-3996 (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-232))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-558)) (|devaluate| |#1|))))) (|HasCategory| (-558) (QUOTE (-1099))) (-3996 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-550)))) (|HasCategory| |#1| (QUOTE (-362))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-899))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (LIST (QUOTE -1028) (QUOTE (-1163)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (LIST (QUOTE -606) (QUOTE (-534)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-1012))) (|HasCategory| |#1| (QUOTE (-362)))) (-3996 (|HasCategory| |#1| (QUOTE (-171))) (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-550)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-811))) (|HasCategory| |#1| (QUOTE (-362)))) (-3996 (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-811))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-841))) (|HasCategory| |#1| (QUOTE (-362))))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (LIST (QUOTE -1028) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-1138))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (LIST (QUOTE -285) (LIST (QUOTE -1161) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1161) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (LIST (QUOTE -308) (LIST (QUOTE -1161) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (LIST (QUOTE -512) (QUOTE (-1163)) (LIST (QUOTE -1161) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (LIST (QUOTE -631) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (LIST (QUOTE -606) (LIST (QUOTE -882) (QUOTE (-558))))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (LIST (QUOTE -606) (LIST (QUOTE -882) (QUOTE (-378))))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (LIST (QUOTE -876) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (LIST (QUOTE -876) (QUOTE (-378)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-558))))) (|HasSignature| |#1| (LIST (QUOTE -2560) (LIST (|devaluate| |#1|) (QUOTE (-1163)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-558))))) (-3996 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-949))) (|HasCategory| |#1| (QUOTE (-1185))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558))))) (|HasSignature| |#1| (LIST (QUOTE -3221) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1163))))) (|HasSignature| |#1| (LIST (QUOTE -2664) (LIST (LIST (QUOTE -635) (QUOTE (-1163))) (|devaluate| |#1|)))))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-543))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-306))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-899))) (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-144))) (-3996 (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-811))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-899))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasCategory| |#1| (QUOTE (-550)))) (-3996 (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (LIST (QUOTE -1028) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558)))))) (-3996 (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-811))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-899))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasCategory| |#1| (QUOTE (-171)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-841))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558))))) (-12 (|HasCategory| $ (QUOTE (-144))) (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-899))) (|HasCategory| |#1| (QUOTE (-362)))) (-3996 (-12 (|HasCategory| $ (QUOTE (-144))) (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-899))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1161 |#1| |#2| |#3|) (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasCategory| |#1| (QUOTE (-144))))) 
+(-1155 R -3199) 
 ((|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 
@@ -4571,11 +4571,11 @@ NIL
 (-1160 |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.")) (|differentiate| (($ $ (|Variable| |#2|)) "\\spad{differentiate(f(x),{}x)} returns the derivative of \\spad{f(x)} with respect to \\spad{x}."))) 
 (((-4385 "*") |has| |#1| (-171)) (-4376 |has| |#1| (-550)) (-4381 |has| |#1| (-362)) (-4375 |has| |#1| (-362)) (-4377 . T) (-4378 . T) (-4380 . T)) 
-((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558))))) (|HasCategory| |#1| (QUOTE (-550))) (|HasCategory| |#1| (QUOTE (-171))) (-3996 (|HasCategory| |#1| (QUOTE (-171))) (|HasCategory| |#1| (QUOTE (-550)))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-146))) (-12 (|HasCategory| |#1| (LIST (QUOTE -890) (QUOTE (-1163)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -406) (QUOTE (-558))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -406) (QUOTE (-558))) (|devaluate| |#1|)))) (|HasCategory| (-406 (-558)) (QUOTE (-1099))) (|HasCategory| |#1| (QUOTE (-362))) (-3996 (|HasCategory| |#1| (QUOTE (-171))) (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-550)))) (-3996 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-550)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -406) (QUOTE (-558)))))) (|HasSignature| |#1| (LIST (QUOTE -2560) (LIST (|devaluate| |#1|) (QUOTE (-1163)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -406) (QUOTE (-558)))))) (-3996 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-949))) (|HasCategory| |#1| (QUOTE (-1185))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558))))) (|HasSignature| |#1| (LIST (QUOTE -3710) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1163))))) (|HasSignature| |#1| (LIST (QUOTE -2664) (LIST (LIST (QUOTE -635) (QUOTE (-1163))) (|devaluate| |#1|))))))) 
+((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558))))) (|HasCategory| |#1| (QUOTE (-550))) (|HasCategory| |#1| (QUOTE (-171))) (-3996 (|HasCategory| |#1| (QUOTE (-171))) (|HasCategory| |#1| (QUOTE (-550)))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-146))) (-12 (|HasCategory| |#1| (LIST (QUOTE -890) (QUOTE (-1163)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -406) (QUOTE (-558))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -406) (QUOTE (-558))) (|devaluate| |#1|)))) (|HasCategory| (-406 (-558)) (QUOTE (-1099))) (|HasCategory| |#1| (QUOTE (-362))) (-3996 (|HasCategory| |#1| (QUOTE (-171))) (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-550)))) (-3996 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-550)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -406) (QUOTE (-558)))))) (|HasSignature| |#1| (LIST (QUOTE -2560) (LIST (|devaluate| |#1|) (QUOTE (-1163)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -406) (QUOTE (-558)))))) (-3996 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-949))) (|HasCategory| |#1| (QUOTE (-1185))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558))))) (|HasSignature| |#1| (LIST (QUOTE -3221) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1163))))) (|HasSignature| |#1| (LIST (QUOTE -2664) (LIST (LIST (QUOTE -635) (QUOTE (-1163))) (|devaluate| |#1|))))))) 
 (-1161 |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.")) (|differentiate| (($ $ (|Variable| |#2|)) "\\spad{differentiate(f(x),{}x)} computes the derivative of \\spad{f(x)} with respect to \\spad{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}."))) 
 (((-4385 "*") |has| |#1| (-171)) (-4376 |has| |#1| (-550)) (-4377 . T) (-4378 . T) (-4380 . T)) 
-((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558))))) (|HasCategory| |#1| (QUOTE (-550))) (-3996 (|HasCategory| |#1| (QUOTE (-171))) (|HasCategory| |#1| (QUOTE (-550)))) (|HasCategory| |#1| (QUOTE (-171))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-146))) (-12 (|HasCategory| |#1| (LIST (QUOTE -890) (QUOTE (-1163)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-762)) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-762)) (|devaluate| |#1|)))) (|HasCategory| (-762) (QUOTE (-1099))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-762))))) (|HasSignature| |#1| (LIST (QUOTE -2560) (LIST (|devaluate| |#1|) (QUOTE (-1163)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-762))))) (|HasCategory| |#1| (QUOTE (-362))) (-3996 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-949))) (|HasCategory| |#1| (QUOTE (-1185))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558))))) (|HasSignature| |#1| (LIST (QUOTE -3710) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1163))))) (|HasSignature| |#1| (LIST (QUOTE -2664) (LIST (LIST (QUOTE -635) (QUOTE (-1163))) (|devaluate| |#1|))))))) 
+((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558))))) (|HasCategory| |#1| (QUOTE (-550))) (-3996 (|HasCategory| |#1| (QUOTE (-171))) (|HasCategory| |#1| (QUOTE (-550)))) (|HasCategory| |#1| (QUOTE (-171))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-146))) (-12 (|HasCategory| |#1| (LIST (QUOTE -890) (QUOTE (-1163)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-762)) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-762)) (|devaluate| |#1|)))) (|HasCategory| (-762) (QUOTE (-1099))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-762))))) (|HasSignature| |#1| (LIST (QUOTE -2560) (LIST (|devaluate| |#1|) (QUOTE (-1163)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-762))))) (|HasCategory| |#1| (QUOTE (-362))) (-3996 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-949))) (|HasCategory| |#1| (QUOTE (-1185))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558))))) (|HasSignature| |#1| (LIST (QUOTE -3221) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1163))))) (|HasSignature| |#1| (LIST (QUOTE -2664) (LIST (LIST (QUOTE -635) (QUOTE (-1163))) (|devaluate| |#1|))))))) 
 (-1162) 
 ((|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 
@@ -4684,7 +4684,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 
-(-1189 R -3198) 
+(-1189 R -3199) 
 ((|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 
@@ -4692,7 +4692,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 
-(-1191 R -3198) 
+(-1191 R -3199) 
 ((|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 -606) (LIST (QUOTE -882) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -876) (|devaluate| |#1|))) (|HasCategory| |#2| (LIST (QUOTE -606) (LIST (QUOTE -882) (|devaluate| |#1|)))) (|HasCategory| |#2| (LIST (QUOTE -876) (|devaluate| |#1|))))) 
@@ -4720,7 +4720,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 (-1087))) (|HasCategory| |#1| (LIST (QUOTE -605) (QUOTE (-853))))) 
-(-1198 -3198) 
+(-1198 -3199) 
 ((|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 
@@ -4767,11 +4767,11 @@ NIL
 (-1209 |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)}."))) 
 (((-4385 "*") |has| |#1| (-171)) (-4376 |has| |#1| (-550)) (-4381 |has| |#1| (-362)) (-4375 |has| |#1| (-362)) (-4377 . T) (-4378 . T) (-4380 . T)) 
-((-3996 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -285) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -512) (QUOTE (-1163)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-811)))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-841)))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-899)))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-1012)))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-1138)))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -606) (QUOTE (-534))))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -308) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -1028) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -1028) (QUOTE (-1163)))))) (|HasCategory| |#1| (QUOTE (-550))) (|HasCategory| |#1| (QUOTE (-171))) (-3996 (|HasCategory| |#1| (QUOTE (-171))) (|HasCategory| |#1| (QUOTE (-550)))) (-3996 (|HasCategory| |#1| (QUOTE (-144))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-144))))) (-3996 (|HasCategory| |#1| (QUOTE (-146))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-146))))) (-3996 (-12 (|HasCategory| |#1| (LIST (QUOTE -890) (QUOTE (-1163)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-558)) (|devaluate| |#1|))))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -890) (QUOTE (-1163)))))) (-3996 (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-232)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-558)) (|devaluate| |#1|))))) (|HasCategory| (-558) (QUOTE (-1099))) (-3996 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-550)))) (|HasCategory| |#1| (QUOTE (-362))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-899)))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -1028) (QUOTE (-1163))))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -606) (QUOTE (-534))))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-1012)))) (-3996 (|HasCategory| |#1| (QUOTE (-171))) (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-550)))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-811)))) (-3996 (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-811)))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-841))))) (-3996 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -606) (LIST (QUOTE -882) (QUOTE (-378)))))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -606) (LIST (QUOTE -882) (QUOTE (-558)))))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -285) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -512) (QUOTE (-1163)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -631) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-811)))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-841)))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-899)))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-1012)))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-1138)))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -606) (QUOTE (-534))))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -308) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -876) (QUOTE (-378))))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -876) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -1028) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -1028) (QUOTE (-1163)))))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -1028) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-1138)))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -285) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -308) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -512) (QUOTE (-1163)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -631) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -606) (LIST (QUOTE -882) (QUOTE (-558)))))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -606) (LIST (QUOTE -882) (QUOTE (-378)))))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -876) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -876) (QUOTE (-378))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-558))))) (|HasSignature| |#1| (LIST (QUOTE -2560) (LIST (|devaluate| |#1|) (QUOTE (-1163)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-558))))) (-3996 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-949))) (|HasCategory| |#1| (QUOTE (-1185))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558))))) (|HasSignature| |#1| (LIST (QUOTE -3710) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1163))))) (|HasSignature| |#1| (LIST (QUOTE -2664) (LIST (LIST (QUOTE -635) (QUOTE (-1163))) (|devaluate| |#1|)))))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-841)))) (|HasCategory| |#2| (QUOTE (-899))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-543)))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-306)))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#2| (QUOTE (-144))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558))))) (-12 (|HasCategory| $ (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-899)))) (-3996 (-12 (|HasCategory| $ (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-899)))) (|HasCategory| |#1| (QUOTE (-144))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-144)))))) 
+((-3996 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -285) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -512) (QUOTE (-1163)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-811)))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-841)))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-899)))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-1012)))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-1138)))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -606) (QUOTE (-534))))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -308) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -1028) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -1028) (QUOTE (-1163)))))) (|HasCategory| |#1| (QUOTE (-550))) (|HasCategory| |#1| (QUOTE (-171))) (-3996 (|HasCategory| |#1| (QUOTE (-171))) (|HasCategory| |#1| (QUOTE (-550)))) (-3996 (|HasCategory| |#1| (QUOTE (-144))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-144))))) (-3996 (|HasCategory| |#1| (QUOTE (-146))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-146))))) (-3996 (-12 (|HasCategory| |#1| (LIST (QUOTE -890) (QUOTE (-1163)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-558)) (|devaluate| |#1|))))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -890) (QUOTE (-1163)))))) (-3996 (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-232)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-558)) (|devaluate| |#1|))))) (|HasCategory| (-558) (QUOTE (-1099))) (-3996 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-550)))) (|HasCategory| |#1| (QUOTE (-362))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-899)))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -1028) (QUOTE (-1163))))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -606) (QUOTE (-534))))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-1012)))) (-3996 (|HasCategory| |#1| (QUOTE (-171))) (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-550)))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-811)))) (-3996 (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-811)))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-841))))) (-3996 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -606) (LIST (QUOTE -882) (QUOTE (-378)))))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -606) (LIST (QUOTE -882) (QUOTE (-558)))))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -285) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -512) (QUOTE (-1163)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -631) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-811)))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-841)))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-899)))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-1012)))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-1138)))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -606) (QUOTE (-534))))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -308) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -876) (QUOTE (-378))))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -876) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -1028) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -1028) (QUOTE (-1163)))))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -1028) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-1138)))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -285) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -308) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -512) (QUOTE (-1163)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -631) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -606) (LIST (QUOTE -882) (QUOTE (-558)))))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -606) (LIST (QUOTE -882) (QUOTE (-378)))))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -876) (QUOTE (-558))))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (LIST (QUOTE -876) (QUOTE (-378))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-558))))) (|HasSignature| |#1| (LIST (QUOTE -2560) (LIST (|devaluate| |#1|) (QUOTE (-1163)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-558))))) (-3996 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-949))) (|HasCategory| |#1| (QUOTE (-1185))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558))))) (|HasSignature| |#1| (LIST (QUOTE -3221) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1163))))) (|HasSignature| |#1| (LIST (QUOTE -2664) (LIST (LIST (QUOTE -635) (QUOTE (-1163))) (|devaluate| |#1|)))))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-841)))) (|HasCategory| |#2| (QUOTE (-899))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-543)))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-306)))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#2| (QUOTE (-144))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558))))) (-12 (|HasCategory| $ (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-899)))) (-3996 (-12 (|HasCategory| $ (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-899)))) (|HasCategory| |#1| (QUOTE (-144))) (-12 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#2| (QUOTE (-144)))))) 
 (-1210 |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.")) (|differentiate| (($ $ (|Variable| |#2|)) "\\spad{differentiate(f(x),{}x)} returns the derivative of \\spad{f(x)} with respect to \\spad{x}.")) (|coerce| (($ (|Variable| |#2|)) "\\spad{coerce(var)} converts the series variable \\spad{var} into a Laurent series."))) 
 (((-4385 "*") -3996 (-2113 (|has| |#1| (-362)) (|has| (-1238 |#1| |#2| |#3|) (-811))) (|has| |#1| (-171)) (-2113 (|has| |#1| (-362)) (|has| (-1238 |#1| |#2| |#3|) (-899)))) (-4376 -3996 (-2113 (|has| |#1| (-362)) (|has| (-1238 |#1| |#2| |#3|) (-811))) (|has| |#1| (-550)) (-2113 (|has| |#1| (-362)) (|has| (-1238 |#1| |#2| |#3|) (-899)))) (-4381 |has| |#1| (-362)) (-4375 |has| |#1| (-362)) (-4377 . T) (-4378 . T) (-4380 . T)) 
-((-3996 (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-811))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-841))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-899))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-1012))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-1138))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (LIST (QUOTE -606) (QUOTE (-534)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (LIST (QUOTE -606) (LIST (QUOTE -882) (QUOTE (-378))))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (LIST (QUOTE -606) (LIST (QUOTE -882) (QUOTE (-558))))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (LIST (QUOTE -285) (LIST (QUOTE -1238) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1238) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (LIST (QUOTE -308) (LIST (QUOTE -1238) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (LIST (QUOTE -512) (QUOTE (-1163)) (LIST (QUOTE -1238) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (LIST (QUOTE -631) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (LIST (QUOTE -876) (QUOTE (-378)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (LIST (QUOTE -876) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (LIST (QUOTE -1028) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (LIST (QUOTE -1028) (QUOTE (-1163)))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558)))))) (|HasCategory| |#1| (QUOTE (-550))) (|HasCategory| |#1| (QUOTE (-171))) (-3996 (|HasCategory| |#1| (QUOTE (-171))) (|HasCategory| |#1| (QUOTE (-550)))) (-3996 (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasCategory| |#1| (QUOTE (-144)))) (-3996 (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasCategory| |#1| (QUOTE (-146)))) (-3996 (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (LIST (QUOTE -890) (QUOTE (-1163)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -890) (QUOTE (-1163)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-558)) (|devaluate| |#1|)))))) (-3996 (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-232))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-558)) (|devaluate| |#1|))))) (|HasCategory| (-558) (QUOTE (-1099))) (-3996 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-550)))) (|HasCategory| |#1| (QUOTE (-362))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-899))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (LIST (QUOTE -1028) (QUOTE (-1163)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (LIST (QUOTE -606) (QUOTE (-534)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-1012))) (|HasCategory| |#1| (QUOTE (-362)))) (-3996 (|HasCategory| |#1| (QUOTE (-171))) (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-550)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-811))) (|HasCategory| |#1| (QUOTE (-362)))) (-3996 (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-811))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-841))) (|HasCategory| |#1| (QUOTE (-362))))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (LIST (QUOTE -1028) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-1138))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (LIST (QUOTE -285) (LIST (QUOTE -1238) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1238) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (LIST (QUOTE -308) (LIST (QUOTE -1238) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (LIST (QUOTE -512) (QUOTE (-1163)) (LIST (QUOTE -1238) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (LIST (QUOTE -631) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (LIST (QUOTE -606) (LIST (QUOTE -882) (QUOTE (-558))))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (LIST (QUOTE -606) (LIST (QUOTE -882) (QUOTE (-378))))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (LIST (QUOTE -876) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (LIST (QUOTE -876) (QUOTE (-378)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-558))))) (|HasSignature| |#1| (LIST (QUOTE -2560) (LIST (|devaluate| |#1|) (QUOTE (-1163)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-558))))) (-3996 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-949))) (|HasCategory| |#1| (QUOTE (-1185))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558))))) (|HasSignature| |#1| (LIST (QUOTE -3710) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1163))))) (|HasSignature| |#1| (LIST (QUOTE -2664) (LIST (LIST (QUOTE -635) (QUOTE (-1163))) (|devaluate| |#1|)))))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-543))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-306))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-899))) (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-144))) (-3996 (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-811))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-899))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasCategory| |#1| (QUOTE (-550)))) (-3996 (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (LIST (QUOTE -1028) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558)))))) (-3996 (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-811))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-899))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasCategory| |#1| (QUOTE (-171)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-841))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558))))) (-12 (|HasCategory| $ (QUOTE (-144))) (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-899))) (|HasCategory| |#1| (QUOTE (-362)))) (-3996 (-12 (|HasCategory| $ (QUOTE (-144))) (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-899))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasCategory| |#1| (QUOTE (-144))))) 
+((-3996 (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-811))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-841))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-899))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-1012))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-1138))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (LIST (QUOTE -606) (QUOTE (-534)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (LIST (QUOTE -606) (LIST (QUOTE -882) (QUOTE (-378))))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (LIST (QUOTE -606) (LIST (QUOTE -882) (QUOTE (-558))))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (LIST (QUOTE -285) (LIST (QUOTE -1238) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1238) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (LIST (QUOTE -308) (LIST (QUOTE -1238) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (LIST (QUOTE -512) (QUOTE (-1163)) (LIST (QUOTE -1238) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (LIST (QUOTE -631) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (LIST (QUOTE -876) (QUOTE (-378)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (LIST (QUOTE -876) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (LIST (QUOTE -1028) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (LIST (QUOTE -1028) (QUOTE (-1163)))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558)))))) (|HasCategory| |#1| (QUOTE (-550))) (|HasCategory| |#1| (QUOTE (-171))) (-3996 (|HasCategory| |#1| (QUOTE (-171))) (|HasCategory| |#1| (QUOTE (-550)))) (-3996 (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasCategory| |#1| (QUOTE (-144)))) (-3996 (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasCategory| |#1| (QUOTE (-146)))) (-3996 (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (LIST (QUOTE -890) (QUOTE (-1163)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -890) (QUOTE (-1163)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-558)) (|devaluate| |#1|)))))) (-3996 (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-232))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-558)) (|devaluate| |#1|))))) (|HasCategory| (-558) (QUOTE (-1099))) (-3996 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-550)))) (|HasCategory| |#1| (QUOTE (-362))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-899))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (LIST (QUOTE -1028) (QUOTE (-1163)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (LIST (QUOTE -606) (QUOTE (-534)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-1012))) (|HasCategory| |#1| (QUOTE (-362)))) (-3996 (|HasCategory| |#1| (QUOTE (-171))) (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-550)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-811))) (|HasCategory| |#1| (QUOTE (-362)))) (-3996 (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-811))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-841))) (|HasCategory| |#1| (QUOTE (-362))))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (LIST (QUOTE -1028) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-1138))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (LIST (QUOTE -285) (LIST (QUOTE -1238) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1238) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (LIST (QUOTE -308) (LIST (QUOTE -1238) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (LIST (QUOTE -512) (QUOTE (-1163)) (LIST (QUOTE -1238) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (LIST (QUOTE -631) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (LIST (QUOTE -606) (LIST (QUOTE -882) (QUOTE (-558))))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (LIST (QUOTE -606) (LIST (QUOTE -882) (QUOTE (-378))))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (LIST (QUOTE -876) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (LIST (QUOTE -876) (QUOTE (-378)))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-558))))) (|HasSignature| |#1| (LIST (QUOTE -2560) (LIST (|devaluate| |#1|) (QUOTE (-1163)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-558))))) (-3996 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-949))) (|HasCategory| |#1| (QUOTE (-1185))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558))))) (|HasSignature| |#1| (LIST (QUOTE -3221) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1163))))) (|HasSignature| |#1| (LIST (QUOTE -2664) (LIST (LIST (QUOTE -635) (QUOTE (-1163))) (|devaluate| |#1|)))))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-543))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-306))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-899))) (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-144))) (-3996 (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-811))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-899))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasCategory| |#1| (QUOTE (-550)))) (-3996 (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (LIST (QUOTE -1028) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558)))))) (-3996 (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-811))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-899))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasCategory| |#1| (QUOTE (-171)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-841))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558))))) (-12 (|HasCategory| $ (QUOTE (-144))) (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-899))) (|HasCategory| |#1| (QUOTE (-362)))) (-3996 (-12 (|HasCategory| $ (QUOTE (-144))) (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-899))) (|HasCategory| |#1| (QUOTE (-362)))) (-12 (|HasCategory| (-1238 |#1| |#2| |#3|) (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-362)))) (|HasCategory| |#1| (QUOTE (-144))))) 
 (-1211 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 
@@ -4851,11 +4851,11 @@ NIL
 (-1230 |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)}."))) 
 (((-4385 "*") |has| |#1| (-171)) (-4376 |has| |#1| (-550)) (-4381 |has| |#1| (-362)) (-4375 |has| |#1| (-362)) (-4377 . T) (-4378 . T) (-4380 . T)) 
-((|HasCategory| |#1| (QUOTE (-550))) (|HasCategory| |#1| (QUOTE (-171))) (-3996 (|HasCategory| |#1| (QUOTE (-171))) (|HasCategory| |#1| (QUOTE (-550)))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-146))) (-12 (|HasCategory| |#1| (LIST (QUOTE -890) (QUOTE (-1163)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -406) (QUOTE (-558))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -406) (QUOTE (-558))) (|devaluate| |#1|)))) (|HasCategory| (-406 (-558)) (QUOTE (-1099))) (|HasCategory| |#1| (QUOTE (-362))) (-3996 (|HasCategory| |#1| (QUOTE (-171))) (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-550)))) (-3996 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-550)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -406) (QUOTE (-558)))))) (|HasSignature| |#1| (LIST (QUOTE -2560) (LIST (|devaluate| |#1|) (QUOTE (-1163)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -406) (QUOTE (-558)))))) (-3996 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-949))) (|HasCategory| |#1| (QUOTE (-1185))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558))))) (|HasSignature| |#1| (LIST (QUOTE -3710) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1163))))) (|HasSignature| |#1| (LIST (QUOTE -2664) (LIST (LIST (QUOTE -635) (QUOTE (-1163))) (|devaluate| |#1|)))))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558)))))) 
+((|HasCategory| |#1| (QUOTE (-550))) (|HasCategory| |#1| (QUOTE (-171))) (-3996 (|HasCategory| |#1| (QUOTE (-171))) (|HasCategory| |#1| (QUOTE (-550)))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-146))) (-12 (|HasCategory| |#1| (LIST (QUOTE -890) (QUOTE (-1163)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -406) (QUOTE (-558))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -406) (QUOTE (-558))) (|devaluate| |#1|)))) (|HasCategory| (-406 (-558)) (QUOTE (-1099))) (|HasCategory| |#1| (QUOTE (-362))) (-3996 (|HasCategory| |#1| (QUOTE (-171))) (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-550)))) (-3996 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-550)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -406) (QUOTE (-558)))))) (|HasSignature| |#1| (LIST (QUOTE -2560) (LIST (|devaluate| |#1|) (QUOTE (-1163)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -406) (QUOTE (-558)))))) (-3996 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-949))) (|HasCategory| |#1| (QUOTE (-1185))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558))))) (|HasSignature| |#1| (LIST (QUOTE -3221) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1163))))) (|HasSignature| |#1| (LIST (QUOTE -2664) (LIST (LIST (QUOTE -635) (QUOTE (-1163))) (|devaluate| |#1|)))))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558)))))) 
 (-1231 |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.")) (|differentiate| (($ $ (|Variable| |#2|)) "\\spad{differentiate(f(x),{}x)} returns the derivative of \\spad{f(x)} with respect to \\spad{x}."))) 
 (((-4385 "*") |has| |#1| (-171)) (-4376 |has| |#1| (-550)) (-4381 |has| |#1| (-362)) (-4375 |has| |#1| (-362)) (-4377 . T) (-4378 . T) (-4380 . T)) 
-((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558))))) (|HasCategory| |#1| (QUOTE (-550))) (|HasCategory| |#1| (QUOTE (-171))) (-3996 (|HasCategory| |#1| (QUOTE (-171))) (|HasCategory| |#1| (QUOTE (-550)))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-146))) (-12 (|HasCategory| |#1| (LIST (QUOTE -890) (QUOTE (-1163)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -406) (QUOTE (-558))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -406) (QUOTE (-558))) (|devaluate| |#1|)))) (|HasCategory| (-406 (-558)) (QUOTE (-1099))) (|HasCategory| |#1| (QUOTE (-362))) (-3996 (|HasCategory| |#1| (QUOTE (-171))) (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-550)))) (-3996 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-550)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -406) (QUOTE (-558)))))) (|HasSignature| |#1| (LIST (QUOTE -2560) (LIST (|devaluate| |#1|) (QUOTE (-1163)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -406) (QUOTE (-558)))))) (-3996 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-949))) (|HasCategory| |#1| (QUOTE (-1185))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558))))) (|HasSignature| |#1| (LIST (QUOTE -3710) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1163))))) (|HasSignature| |#1| (LIST (QUOTE -2664) (LIST (LIST (QUOTE -635) (QUOTE (-1163))) (|devaluate| |#1|))))))) 
+((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558))))) (|HasCategory| |#1| (QUOTE (-550))) (|HasCategory| |#1| (QUOTE (-171))) (-3996 (|HasCategory| |#1| (QUOTE (-171))) (|HasCategory| |#1| (QUOTE (-550)))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-146))) (-12 (|HasCategory| |#1| (LIST (QUOTE -890) (QUOTE (-1163)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -406) (QUOTE (-558))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -406) (QUOTE (-558))) (|devaluate| |#1|)))) (|HasCategory| (-406 (-558)) (QUOTE (-1099))) (|HasCategory| |#1| (QUOTE (-362))) (-3996 (|HasCategory| |#1| (QUOTE (-171))) (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-550)))) (-3996 (|HasCategory| |#1| (QUOTE (-362))) (|HasCategory| |#1| (QUOTE (-550)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -406) (QUOTE (-558)))))) (|HasSignature| |#1| (LIST (QUOTE -2560) (LIST (|devaluate| |#1|) (QUOTE (-1163)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -406) (QUOTE (-558)))))) (-3996 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-949))) (|HasCategory| |#1| (QUOTE (-1185))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558))))) (|HasSignature| |#1| (LIST (QUOTE -3221) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1163))))) (|HasSignature| |#1| (LIST (QUOTE -2664) (LIST (LIST (QUOTE -635) (QUOTE (-1163))) (|devaluate| |#1|))))))) 
 (-1232 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))}."))) 
 (((-4385 "*") |has| (-1231 |#2| |#3| |#4|) (-171)) (-4376 |has| (-1231 |#2| |#3| |#4|) (-550)) (-4377 . T) (-4378 . T) (-4380 . T)) 
@@ -4875,7 +4875,7 @@ NIL
 (-1236 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 (-558)))) (|HasCategory| |#2| (QUOTE (-949))) (|HasCategory| |#2| (QUOTE (-1185))) (|HasSignature| |#2| (LIST (QUOTE -2664) (LIST (LIST (QUOTE -635) (QUOTE (-1163))) (|devaluate| |#2|)))) (|HasSignature| |#2| (LIST (QUOTE -3710) (LIST (|devaluate| |#2|) (|devaluate| |#2|) (QUOTE (-1163))))) (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558))))) (|HasCategory| |#2| (QUOTE (-362)))) 
+((|HasCategory| |#2| (LIST (QUOTE -29) (QUOTE (-558)))) (|HasCategory| |#2| (QUOTE (-949))) (|HasCategory| |#2| (QUOTE (-1185))) (|HasSignature| |#2| (LIST (QUOTE -2664) (LIST (LIST (QUOTE -635) (QUOTE (-1163))) (|devaluate| |#2|)))) (|HasSignature| |#2| (LIST (QUOTE -3221) (LIST (|devaluate| |#2|) (|devaluate| |#2|) (QUOTE (-1163))))) (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558))))) (|HasCategory| |#2| (QUOTE (-362)))) 
 (-1237 |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."))) 
 (((-4385 "*") |has| |#1| (-171)) (-4376 |has| |#1| (-550)) (-4377 . T) (-4378 . T) (-4380 . T)) 
@@ -4883,12 +4883,12 @@ NIL
 (-1238 |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 1st order coefficient 1.")) (|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))}.}")) (|differentiate| (($ $ (|Variable| |#2|)) "\\spad{differentiate(f(x),{}x)} computes the derivative of \\spad{f(x)} with respect to \\spad{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}."))) 
 (((-4385 "*") |has| |#1| (-171)) (-4376 |has| |#1| (-550)) (-4377 . T) (-4378 . T) (-4380 . T)) 
-((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558))))) (|HasCategory| |#1| (QUOTE (-550))) (-3996 (|HasCategory| |#1| (QUOTE (-171))) (|HasCategory| |#1| (QUOTE (-550)))) (|HasCategory| |#1| (QUOTE (-171))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-146))) (-12 (|HasCategory| |#1| (LIST (QUOTE -890) (QUOTE (-1163)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-762)) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-762)) (|devaluate| |#1|)))) (|HasCategory| (-762) (QUOTE (-1099))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-762))))) (|HasSignature| |#1| (LIST (QUOTE -2560) (LIST (|devaluate| |#1|) (QUOTE (-1163)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-762))))) (|HasCategory| |#1| (QUOTE (-362))) (-3996 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-949))) (|HasCategory| |#1| (QUOTE (-1185))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558))))) (|HasSignature| |#1| (LIST (QUOTE -3710) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1163))))) (|HasSignature| |#1| (LIST (QUOTE -2664) (LIST (LIST (QUOTE -635) (QUOTE (-1163))) (|devaluate| |#1|))))))) 
+((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558))))) (|HasCategory| |#1| (QUOTE (-550))) (-3996 (|HasCategory| |#1| (QUOTE (-171))) (|HasCategory| |#1| (QUOTE (-550)))) (|HasCategory| |#1| (QUOTE (-171))) (|HasCategory| |#1| (QUOTE (-144))) (|HasCategory| |#1| (QUOTE (-146))) (-12 (|HasCategory| |#1| (LIST (QUOTE -890) (QUOTE (-1163)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-762)) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-762)) (|devaluate| |#1|)))) (|HasCategory| (-762) (QUOTE (-1099))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-762))))) (|HasSignature| |#1| (LIST (QUOTE -2560) (LIST (|devaluate| |#1|) (QUOTE (-1163)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-762))))) (|HasCategory| |#1| (QUOTE (-362))) (-3996 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-558)))) (|HasCategory| |#1| (QUOTE (-949))) (|HasCategory| |#1| (QUOTE (-1185))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -406) (QUOTE (-558))))) (|HasSignature| |#1| (LIST (QUOTE -3221) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1163))))) (|HasSignature| |#1| (LIST (QUOTE -2664) (LIST (LIST (QUOTE -635) (QUOTE (-1163))) (|devaluate| |#1|))))))) 
 (-1239 |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 
-(-1240 -3198 UP L UTS) 
+(-1240 -3199 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 (-550)))) 
@@ -4948,7 +4948,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 
-(-1255 K R UP -3198) 
+(-1255 K R UP -3199) 
 ((|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{\\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{\\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{\\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{\\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{\\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{\\spad{wi} = sum(bij * vj,{} j = 1..n)}."))) 
 NIL 
 NIL 
@@ -4984,11 +4984,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}."))) 
 ((-4376 |has| |#2| (-6 -4376)) (-4378 . T) (-4377 . T) (-4380 . T)) 
 NIL 
-(-1264 S -3198) 
+(-1264 S -3199) 
 ((|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 (-367))) (|HasCategory| |#2| (QUOTE (-144))) (|HasCategory| |#2| (QUOTE (-146)))) 
-(-1265 -3198) 
+(-1265 -3199) 
 ((|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}."))) 
 ((-4375 . T) (-4381 . T) (-4376 . T) ((-4385 "*") . T) (-4377 . T) (-4378 . T) (-4380 . T)) 
 NIL 
@@ -5044,4 +5044,4 @@ NIL
 NIL 
 NIL 
 NIL 
-((-3 NIL 2276369 2276374 2276379 2276384) (-2 NIL 2276349 2276354 2276359 2276364) (-1 NIL 2276329 2276334 2276339 2276344) (0 NIL 2276309 2276314 2276319 2276324) (-1274 "ZMOD.spad" 2276118 2276131 2276247 2276304) (-1273 "ZLINDEP.spad" 2275162 2275173 2276108 2276113) (-1272 "ZDSOLVE.spad" 2265011 2265033 2275152 2275157) (-1271 "YSTREAM.spad" 2264504 2264515 2265001 2265006) (-1270 "XRPOLY.spad" 2263724 2263744 2264360 2264429) (-1269 "XPR.spad" 2261515 2261528 2263442 2263541) (-1268 "XPOLY.spad" 2261070 2261081 2261371 2261440) (-1267 "XPOLYC.spad" 2260387 2260403 2260996 2261065) (-1266 "XPBWPOLY.spad" 2258824 2258844 2260167 2260236) (-1265 "XF.spad" 2257285 2257300 2258726 2258819) (-1264 "XF.spad" 2255726 2255743 2257169 2257174) (-1263 "XFALG.spad" 2252750 2252766 2255652 2255721) (-1262 "XEXPPKG.spad" 2252001 2252027 2252740 2252745) (-1261 "XDPOLY.spad" 2251615 2251631 2251857 2251926) (-1260 "XALG.spad" 2251275 2251286 2251571 2251610) (-1259 "WUTSET.spad" 2247114 2247131 2250921 2250948) (-1258 "WP.spad" 2246313 2246357 2246972 2247039) (-1257 "WHILEAST.spad" 2246111 2246120 2246303 2246308) (-1256 "WHEREAST.spad" 2245782 2245791 2246101 2246106) (-1255 "WFFINTBS.spad" 2243345 2243367 2245772 2245777) (-1254 "WEIER.spad" 2241559 2241570 2243335 2243340) (-1253 "VSPACE.spad" 2241232 2241243 2241527 2241554) (-1252 "VSPACE.spad" 2240925 2240938 2241222 2241227) (-1251 "VOID.spad" 2240602 2240611 2240915 2240920) (-1250 "VIEW.spad" 2238224 2238233 2240592 2240597) (-1249 "VIEWDEF.spad" 2233421 2233430 2238214 2238219) (-1248 "VIEW3D.spad" 2217256 2217265 2233411 2233416) (-1247 "VIEW2D.spad" 2204993 2205002 2217246 2217251) (-1246 "VECTOR.spad" 2203668 2203679 2203919 2203946) (-1245 "VECTOR2.spad" 2202295 2202308 2203658 2203663) (-1244 "VECTCAT.spad" 2200195 2200206 2202263 2202290) (-1243 "VECTCAT.spad" 2197903 2197916 2199973 2199978) (-1242 "VARIABLE.spad" 2197683 2197698 2197893 2197898) (-1241 "UTYPE.spad" 2197327 2197336 2197673 2197678) (-1240 "UTSODETL.spad" 2196620 2196644 2197283 2197288) (-1239 "UTSODE.spad" 2194808 2194828 2196610 2196615) (-1238 "UTS.spad" 2189597 2189625 2193275 2193372) (-1237 "UTSCAT.spad" 2187048 2187064 2189495 2189592) (-1236 "UTSCAT.spad" 2184143 2184161 2186592 2186597) (-1235 "UTS2.spad" 2183736 2183771 2184133 2184138) (-1234 "URAGG.spad" 2178368 2178379 2183726 2183731) (-1233 "URAGG.spad" 2172964 2172977 2178324 2178329) (-1232 "UPXSSING.spad" 2170607 2170633 2172045 2172178) (-1231 "UPXS.spad" 2167755 2167783 2168739 2168888) (-1230 "UPXSCONS.spad" 2165512 2165532 2165887 2166036) (-1229 "UPXSCCA.spad" 2164077 2164097 2165358 2165507) (-1228 "UPXSCCA.spad" 2162784 2162806 2164067 2164072) (-1227 "UPXSCAT.spad" 2161365 2161381 2162630 2162779) (-1226 "UPXS2.spad" 2160906 2160959 2161355 2161360) (-1225 "UPSQFREE.spad" 2159318 2159332 2160896 2160901) (-1224 "UPSCAT.spad" 2156911 2156935 2159216 2159313) (-1223 "UPSCAT.spad" 2154210 2154236 2156517 2156522) (-1222 "UPOLYC.spad" 2149188 2149199 2154052 2154205) (-1221 "UPOLYC.spad" 2144058 2144071 2148924 2148929) (-1220 "UPOLYC2.spad" 2143527 2143546 2144048 2144053) (-1219 "UP.spad" 2140684 2140699 2141077 2141230) (-1218 "UPMP.spad" 2139574 2139587 2140674 2140679) (-1217 "UPDIVP.spad" 2139137 2139151 2139564 2139569) (-1216 "UPDECOMP.spad" 2137374 2137388 2139127 2139132) (-1215 "UPCDEN.spad" 2136581 2136597 2137364 2137369) (-1214 "UP2.spad" 2135943 2135964 2136571 2136576) (-1213 "UNISEG.spad" 2135296 2135307 2135862 2135867) (-1212 "UNISEG2.spad" 2134789 2134802 2135252 2135257) (-1211 "UNIFACT.spad" 2133890 2133902 2134779 2134784) (-1210 "ULS.spad" 2124442 2124470 2125535 2125964) (-1209 "ULSCONS.spad" 2116836 2116856 2117208 2117357) (-1208 "ULSCCAT.spad" 2114565 2114585 2116682 2116831) (-1207 "ULSCCAT.spad" 2112402 2112424 2114521 2114526) (-1206 "ULSCAT.spad" 2110618 2110634 2112248 2112397) (-1205 "ULS2.spad" 2110130 2110183 2110608 2110613) (-1204 "UFD.spad" 2109195 2109204 2110056 2110125) (-1203 "UFD.spad" 2108322 2108333 2109185 2109190) (-1202 "UDVO.spad" 2107169 2107178 2108312 2108317) (-1201 "UDPO.spad" 2104596 2104607 2107125 2107130) (-1200 "TYPE.spad" 2104528 2104537 2104586 2104591) (-1199 "TYPEAST.spad" 2104447 2104456 2104518 2104523) (-1198 "TWOFACT.spad" 2103097 2103112 2104437 2104442) (-1197 "TUPLE.spad" 2102581 2102592 2102996 2103001) (-1196 "TUBETOOL.spad" 2099418 2099427 2102571 2102576) (-1195 "TUBE.spad" 2098059 2098076 2099408 2099413) (-1194 "TS.spad" 2096648 2096664 2097624 2097721) (-1193 "TSETCAT.spad" 2083775 2083792 2096616 2096643) (-1192 "TSETCAT.spad" 2070888 2070907 2083731 2083736) (-1191 "TRMANIP.spad" 2065254 2065271 2070594 2070599) (-1190 "TRIMAT.spad" 2064213 2064238 2065244 2065249) (-1189 "TRIGMNIP.spad" 2062730 2062747 2064203 2064208) (-1188 "TRIGCAT.spad" 2062242 2062251 2062720 2062725) (-1187 "TRIGCAT.spad" 2061752 2061763 2062232 2062237) (-1186 "TREE.spad" 2060323 2060334 2061359 2061386) (-1185 "TRANFUN.spad" 2060154 2060163 2060313 2060318) (-1184 "TRANFUN.spad" 2059983 2059994 2060144 2060149) (-1183 "TOPSP.spad" 2059657 2059666 2059973 2059978) (-1182 "TOOLSIGN.spad" 2059320 2059331 2059647 2059652) (-1181 "TEXTFILE.spad" 2057877 2057886 2059310 2059315) (-1180 "TEX.spad" 2055009 2055018 2057867 2057872) (-1179 "TEX1.spad" 2054565 2054576 2054999 2055004) (-1178 "TEMUTL.spad" 2054120 2054129 2054555 2054560) (-1177 "TBCMPPK.spad" 2052213 2052236 2054110 2054115) (-1176 "TBAGG.spad" 2051249 2051272 2052193 2052208) (-1175 "TBAGG.spad" 2050293 2050318 2051239 2051244) (-1174 "TANEXP.spad" 2049669 2049680 2050283 2050288) (-1173 "TABLE.spad" 2048080 2048103 2048350 2048377) (-1172 "TABLEAU.spad" 2047561 2047572 2048070 2048075) (-1171 "TABLBUMP.spad" 2044344 2044355 2047551 2047556) (-1170 "SYSTEM.spad" 2043618 2043627 2044334 2044339) (-1169 "SYSSOLP.spad" 2041091 2041102 2043608 2043613) (-1168 "SYNTAX.spad" 2037361 2037370 2041081 2041086) (-1167 "SYMTAB.spad" 2035417 2035426 2037351 2037356) (-1166 "SYMS.spad" 2031402 2031411 2035407 2035412) (-1165 "SYMPOLY.spad" 2030409 2030420 2030491 2030618) (-1164 "SYMFUNC.spad" 2029884 2029895 2030399 2030404) (-1163 "SYMBOL.spad" 2027311 2027320 2029874 2029879) (-1162 "SWITCH.spad" 2024068 2024077 2027301 2027306) (-1161 "SUTS.spad" 2020967 2020995 2022535 2022632) (-1160 "SUPXS.spad" 2018102 2018130 2019099 2019248) (-1159 "SUP.spad" 2014871 2014882 2015652 2015805) (-1158 "SUPFRACF.spad" 2013976 2013994 2014861 2014866) (-1157 "SUP2.spad" 2013366 2013379 2013966 2013971) (-1156 "SUMRF.spad" 2012332 2012343 2013356 2013361) (-1155 "SUMFS.spad" 2011965 2011982 2012322 2012327) (-1154 "SULS.spad" 2002504 2002532 2003610 2004039) (-1153 "SUCHTAST.spad" 2002273 2002282 2002494 2002499) (-1152 "SUCH.spad" 2001953 2001968 2002263 2002268) (-1151 "SUBSPACE.spad" 1993960 1993975 2001943 2001948) (-1150 "SUBRESP.spad" 1993120 1993134 1993916 1993921) (-1149 "STTF.spad" 1989219 1989235 1993110 1993115) (-1148 "STTFNC.spad" 1985687 1985703 1989209 1989214) (-1147 "STTAYLOR.spad" 1978085 1978096 1985568 1985573) (-1146 "STRTBL.spad" 1976590 1976607 1976739 1976766) (-1145 "STRING.spad" 1975999 1976008 1976013 1976040) (-1144 "STRICAT.spad" 1975787 1975796 1975967 1975994) (-1143 "STREAM.spad" 1972645 1972656 1975312 1975327) (-1142 "STREAM3.spad" 1972190 1972205 1972635 1972640) (-1141 "STREAM2.spad" 1971258 1971271 1972180 1972185) (-1140 "STREAM1.spad" 1970962 1970973 1971248 1971253) (-1139 "STINPROD.spad" 1969868 1969884 1970952 1970957) (-1138 "STEP.spad" 1969069 1969078 1969858 1969863) (-1137 "STBL.spad" 1967595 1967623 1967762 1967777) (-1136 "STAGG.spad" 1966670 1966681 1967585 1967590) (-1135 "STAGG.spad" 1965743 1965756 1966660 1966665) (-1134 "STACK.spad" 1965094 1965105 1965350 1965377) (-1133 "SREGSET.spad" 1962798 1962815 1964740 1964767) (-1132 "SRDCMPK.spad" 1961343 1961363 1962788 1962793) (-1131 "SRAGG.spad" 1956440 1956449 1961311 1961338) (-1130 "SRAGG.spad" 1951557 1951568 1956430 1956435) (-1129 "SQMATRIX.spad" 1949173 1949191 1950089 1950176) (-1128 "SPLTREE.spad" 1943725 1943738 1948609 1948636) (-1127 "SPLNODE.spad" 1940313 1940326 1943715 1943720) (-1126 "SPFCAT.spad" 1939090 1939099 1940303 1940308) (-1125 "SPECOUT.spad" 1937640 1937649 1939080 1939085) (-1124 "SPADXPT.spad" 1929779 1929788 1937630 1937635) (-1123 "spad-parser.spad" 1929244 1929253 1929769 1929774) (-1122 "SPADAST.spad" 1928945 1928954 1929234 1929239) (-1121 "SPACEC.spad" 1912958 1912969 1928935 1928940) (-1120 "SPACE3.spad" 1912734 1912745 1912948 1912953) (-1119 "SORTPAK.spad" 1912279 1912292 1912690 1912695) (-1118 "SOLVETRA.spad" 1910036 1910047 1912269 1912274) (-1117 "SOLVESER.spad" 1908556 1908567 1910026 1910031) (-1116 "SOLVERAD.spad" 1904566 1904577 1908546 1908551) (-1115 "SOLVEFOR.spad" 1902986 1903004 1904556 1904561) (-1114 "SNTSCAT.spad" 1902586 1902603 1902954 1902981) (-1113 "SMTS.spad" 1900846 1900872 1902151 1902248) (-1112 "SMP.spad" 1898285 1898305 1898675 1898802) (-1111 "SMITH.spad" 1897128 1897153 1898275 1898280) (-1110 "SMATCAT.spad" 1895238 1895268 1897072 1897123) (-1109 "SMATCAT.spad" 1893280 1893312 1895116 1895121) (-1108 "SKAGG.spad" 1892241 1892252 1893248 1893275) (-1107 "SINT.spad" 1891067 1891076 1892107 1892236) (-1106 "SIMPAN.spad" 1890795 1890804 1891057 1891062) (-1105 "SIG.spad" 1890123 1890132 1890785 1890790) (-1104 "SIGNRF.spad" 1889231 1889242 1890113 1890118) (-1103 "SIGNEF.spad" 1888500 1888517 1889221 1889226) (-1102 "SIGAST.spad" 1887881 1887890 1888490 1888495) (-1101 "SHP.spad" 1885799 1885814 1887837 1887842) (-1100 "SHDP.spad" 1875510 1875537 1876019 1876150) (-1099 "SGROUP.spad" 1875118 1875127 1875500 1875505) (-1098 "SGROUP.spad" 1874724 1874735 1875108 1875113) (-1097 "SGCF.spad" 1867605 1867614 1874714 1874719) (-1096 "SFRTCAT.spad" 1866533 1866550 1867573 1867600) (-1095 "SFRGCD.spad" 1865596 1865616 1866523 1866528) (-1094 "SFQCMPK.spad" 1860233 1860253 1865586 1865591) (-1093 "SFORT.spad" 1859668 1859682 1860223 1860228) (-1092 "SEXOF.spad" 1859511 1859551 1859658 1859663) (-1091 "SEX.spad" 1859403 1859412 1859501 1859506) (-1090 "SEXCAT.spad" 1856954 1856994 1859393 1859398) (-1089 "SET.spad" 1855254 1855265 1856375 1856414) (-1088 "SETMN.spad" 1853688 1853705 1855244 1855249) (-1087 "SETCAT.spad" 1853173 1853182 1853678 1853683) (-1086 "SETCAT.spad" 1852656 1852667 1853163 1853168) (-1085 "SETAGG.spad" 1849177 1849188 1852636 1852651) (-1084 "SETAGG.spad" 1845706 1845719 1849167 1849172) (-1083 "SEQAST.spad" 1845409 1845418 1845696 1845701) (-1082 "SEGXCAT.spad" 1844531 1844544 1845399 1845404) (-1081 "SEG.spad" 1844344 1844355 1844450 1844455) (-1080 "SEGCAT.spad" 1843251 1843262 1844334 1844339) (-1079 "SEGBIND.spad" 1842323 1842334 1843206 1843211) (-1078 "SEGBIND2.spad" 1842019 1842032 1842313 1842318) (-1077 "SEGAST.spad" 1841733 1841742 1842009 1842014) (-1076 "SEG2.spad" 1841158 1841171 1841689 1841694) (-1075 "SDVAR.spad" 1840434 1840445 1841148 1841153) (-1074 "SDPOL.spad" 1837824 1837835 1838115 1838242) (-1073 "SCPKG.spad" 1835903 1835914 1837814 1837819) (-1072 "SCOPE.spad" 1835048 1835057 1835893 1835898) (-1071 "SCACHE.spad" 1833730 1833741 1835038 1835043) (-1070 "SASTCAT.spad" 1833639 1833648 1833720 1833725) (-1069 "SAOS.spad" 1833511 1833520 1833629 1833634) (-1068 "SAERFFC.spad" 1833224 1833244 1833501 1833506) (-1067 "SAE.spad" 1831399 1831415 1832010 1832145) (-1066 "SAEFACT.spad" 1831100 1831120 1831389 1831394) (-1065 "RURPK.spad" 1828741 1828757 1831090 1831095) (-1064 "RULESET.spad" 1828182 1828206 1828731 1828736) (-1063 "RULE.spad" 1826386 1826410 1828172 1828177) (-1062 "RULECOLD.spad" 1826238 1826251 1826376 1826381) (-1061 "RSTRCAST.spad" 1825955 1825964 1826228 1826233) (-1060 "RSETGCD.spad" 1822333 1822353 1825945 1825950) (-1059 "RSETCAT.spad" 1812117 1812134 1822301 1822328) (-1058 "RSETCAT.spad" 1801921 1801940 1812107 1812112) (-1057 "RSDCMPK.spad" 1800373 1800393 1801911 1801916) (-1056 "RRCC.spad" 1798757 1798787 1800363 1800368) (-1055 "RRCC.spad" 1797139 1797171 1798747 1798752) (-1054 "RPTAST.spad" 1796841 1796850 1797129 1797134) (-1053 "RPOLCAT.spad" 1776201 1776216 1796709 1796836) (-1052 "RPOLCAT.spad" 1755275 1755292 1775785 1775790) (-1051 "ROUTINE.spad" 1751138 1751147 1753922 1753949) (-1050 "ROMAN.spad" 1750466 1750475 1751004 1751133) (-1049 "ROIRC.spad" 1749546 1749578 1750456 1750461) (-1048 "RNS.spad" 1748449 1748458 1749448 1749541) (-1047 "RNS.spad" 1747438 1747449 1748439 1748444) (-1046 "RNG.spad" 1747173 1747182 1747428 1747433) (-1045 "RMODULE.spad" 1746811 1746822 1747163 1747168) (-1044 "RMCAT2.spad" 1746219 1746276 1746801 1746806) (-1043 "RMATRIX.spad" 1745043 1745062 1745386 1745425) (-1042 "RMATCAT.spad" 1740576 1740607 1744999 1745038) (-1041 "RMATCAT.spad" 1735999 1736032 1740424 1740429) (-1040 "RINTERP.spad" 1735887 1735907 1735989 1735994) (-1039 "RING.spad" 1735357 1735366 1735867 1735882) (-1038 "RING.spad" 1734835 1734846 1735347 1735352) (-1037 "RIDIST.spad" 1734219 1734228 1734825 1734830) (-1036 "RGCHAIN.spad" 1732798 1732814 1733704 1733731) (-1035 "RGBCSPC.spad" 1732579 1732591 1732788 1732793) (-1034 "RGBCMDL.spad" 1732109 1732121 1732569 1732574) (-1033 "RF.spad" 1729723 1729734 1732099 1732104) (-1032 "RFFACTOR.spad" 1729185 1729196 1729713 1729718) (-1031 "RFFACT.spad" 1728920 1728932 1729175 1729180) (-1030 "RFDIST.spad" 1727908 1727917 1728910 1728915) (-1029 "RETSOL.spad" 1727325 1727338 1727898 1727903) (-1028 "RETRACT.spad" 1726753 1726764 1727315 1727320) (-1027 "RETRACT.spad" 1726179 1726192 1726743 1726748) (-1026 "RETAST.spad" 1725991 1726000 1726169 1726174) (-1025 "RESULT.spad" 1724051 1724060 1724638 1724665) (-1024 "RESRING.spad" 1723398 1723445 1723989 1724046) (-1023 "RESLATC.spad" 1722722 1722733 1723388 1723393) (-1022 "REPSQ.spad" 1722451 1722462 1722712 1722717) (-1021 "REP.spad" 1720003 1720012 1722441 1722446) (-1020 "REPDB.spad" 1719708 1719719 1719993 1719998) (-1019 "REP2.spad" 1709280 1709291 1719550 1719555) (-1018 "REP1.spad" 1703270 1703281 1709230 1709235) (-1017 "REGSET.spad" 1701067 1701084 1702916 1702943) (-1016 "REF.spad" 1700396 1700407 1701022 1701027) (-1015 "REDORDER.spad" 1699572 1699589 1700386 1700391) (-1014 "RECLOS.spad" 1698355 1698375 1699059 1699152) (-1013 "REALSOLV.spad" 1697487 1697496 1698345 1698350) (-1012 "REAL.spad" 1697359 1697368 1697477 1697482) (-1011 "REAL0Q.spad" 1694641 1694656 1697349 1697354) (-1010 "REAL0.spad" 1691469 1691484 1694631 1694636) (-1009 "RDUCEAST.spad" 1691190 1691199 1691459 1691464) (-1008 "RDIV.spad" 1690841 1690866 1691180 1691185) (-1007 "RDIST.spad" 1690404 1690415 1690831 1690836) (-1006 "RDETRS.spad" 1689200 1689218 1690394 1690399) (-1005 "RDETR.spad" 1687307 1687325 1689190 1689195) (-1004 "RDEEFS.spad" 1686380 1686397 1687297 1687302) (-1003 "RDEEF.spad" 1685376 1685393 1686370 1686375) (-1002 "RCFIELD.spad" 1682562 1682571 1685278 1685371) (-1001 "RCFIELD.spad" 1679834 1679845 1682552 1682557) (-1000 "RCAGG.spad" 1677746 1677757 1679824 1679829) (-999 "RCAGG.spad" 1675586 1675598 1677665 1677670) (-998 "RATRET.spad" 1674947 1674957 1675576 1675581) (-997 "RATFACT.spad" 1674640 1674651 1674937 1674942) (-996 "RANDSRC.spad" 1673960 1673968 1674630 1674635) (-995 "RADUTIL.spad" 1673715 1673723 1673950 1673955) (-994 "RADIX.spad" 1670617 1670630 1672182 1672275) (-993 "RADFF.spad" 1669031 1669067 1669149 1669305) (-992 "RADCAT.spad" 1668625 1668633 1669021 1669026) (-991 "RADCAT.spad" 1668217 1668227 1668615 1668620) (-990 "QUEUE.spad" 1667560 1667570 1667824 1667851) (-989 "QUAT.spad" 1666142 1666152 1666484 1666549) (-988 "QUATCT2.spad" 1665761 1665779 1666132 1666137) (-987 "QUATCAT.spad" 1663926 1663936 1665691 1665756) (-986 "QUATCAT.spad" 1661842 1661854 1663609 1663614) (-985 "QUAGG.spad" 1660668 1660678 1661810 1661837) (-984 "QQUTAST.spad" 1660437 1660445 1660658 1660663) (-983 "QFORM.spad" 1659900 1659914 1660427 1660432) (-982 "QFCAT.spad" 1658603 1658613 1659802 1659895) (-981 "QFCAT.spad" 1656897 1656909 1658098 1658103) (-980 "QFCAT2.spad" 1656588 1656604 1656887 1656892) (-979 "QEQUAT.spad" 1656145 1656153 1656578 1656583) (-978 "QCMPACK.spad" 1650892 1650911 1656135 1656140) (-977 "QALGSET.spad" 1646967 1646999 1650806 1650811) (-976 "QALGSET2.spad" 1644963 1644981 1646957 1646962) (-975 "PWFFINTB.spad" 1642273 1642294 1644953 1644958) (-974 "PUSHVAR.spad" 1641602 1641621 1642263 1642268) (-973 "PTRANFN.spad" 1637728 1637738 1641592 1641597) (-972 "PTPACK.spad" 1634816 1634826 1637718 1637723) (-971 "PTFUNC2.spad" 1634637 1634651 1634806 1634811) (-970 "PTCAT.spad" 1633886 1633896 1634605 1634632) (-969 "PSQFR.spad" 1633193 1633217 1633876 1633881) (-968 "PSEUDLIN.spad" 1632051 1632061 1633183 1633188) (-967 "PSETPK.spad" 1617484 1617500 1631929 1631934) (-966 "PSETCAT.spad" 1611404 1611427 1617464 1617479) (-965 "PSETCAT.spad" 1605298 1605323 1611360 1611365) (-964 "PSCURVE.spad" 1604281 1604289 1605288 1605293) (-963 "PSCAT.spad" 1603048 1603077 1604179 1604276) (-962 "PSCAT.spad" 1601905 1601936 1603038 1603043) (-961 "PRTITION.spad" 1600850 1600858 1601895 1601900) (-960 "PRTDAST.spad" 1600569 1600577 1600840 1600845) (-959 "PRS.spad" 1590131 1590148 1600525 1600530) (-958 "PRQAGG.spad" 1589562 1589572 1590099 1590126) (-957 "PROPLOG.spad" 1588965 1588973 1589552 1589557) (-956 "PROPFRML.spad" 1586883 1586894 1588955 1588960) (-955 "PROPERTY.spad" 1586377 1586385 1586873 1586878) (-954 "PRODUCT.spad" 1584057 1584069 1584343 1584398) (-953 "PR.spad" 1582443 1582455 1583148 1583275) (-952 "PRINT.spad" 1582195 1582203 1582433 1582438) (-951 "PRIMES.spad" 1580446 1580456 1582185 1582190) (-950 "PRIMELT.spad" 1578427 1578441 1580436 1580441) (-949 "PRIMCAT.spad" 1578050 1578058 1578417 1578422) (-948 "PRIMARR.spad" 1577055 1577065 1577233 1577260) (-947 "PRIMARR2.spad" 1575778 1575790 1577045 1577050) (-946 "PREASSOC.spad" 1575150 1575162 1575768 1575773) (-945 "PPCURVE.spad" 1574287 1574295 1575140 1575145) (-944 "PORTNUM.spad" 1574062 1574070 1574277 1574282) (-943 "POLYROOT.spad" 1572891 1572913 1574018 1574023) (-942 "POLY.spad" 1570188 1570198 1570705 1570832) (-941 "POLYLIFT.spad" 1569449 1569472 1570178 1570183) (-940 "POLYCATQ.spad" 1567551 1567573 1569439 1569444) (-939 "POLYCAT.spad" 1560957 1560978 1567419 1567546) (-938 "POLYCAT.spad" 1553665 1553688 1560129 1560134) (-937 "POLY2UP.spad" 1553113 1553127 1553655 1553660) (-936 "POLY2.spad" 1552708 1552720 1553103 1553108) (-935 "POLUTIL.spad" 1551649 1551678 1552664 1552669) (-934 "POLTOPOL.spad" 1550397 1550412 1551639 1551644) (-933 "POINT.spad" 1549236 1549246 1549323 1549350) (-932 "PNTHEORY.spad" 1545902 1545910 1549226 1549231) (-931 "PMTOOLS.spad" 1544659 1544673 1545892 1545897) (-930 "PMSYM.spad" 1544204 1544214 1544649 1544654) (-929 "PMQFCAT.spad" 1543791 1543805 1544194 1544199) (-928 "PMPRED.spad" 1543260 1543274 1543781 1543786) (-927 "PMPREDFS.spad" 1542704 1542726 1543250 1543255) (-926 "PMPLCAT.spad" 1541774 1541792 1542636 1542641) (-925 "PMLSAGG.spad" 1541355 1541369 1541764 1541769) (-924 "PMKERNEL.spad" 1540922 1540934 1541345 1541350) (-923 "PMINS.spad" 1540498 1540508 1540912 1540917) (-922 "PMFS.spad" 1540071 1540089 1540488 1540493) (-921 "PMDOWN.spad" 1539357 1539371 1540061 1540066) (-920 "PMASS.spad" 1538369 1538377 1539347 1539352) (-919 "PMASSFS.spad" 1537338 1537354 1538359 1538364) (-918 "PLOTTOOL.spad" 1537118 1537126 1537328 1537333) (-917 "PLOT.spad" 1531949 1531957 1537108 1537113) (-916 "PLOT3D.spad" 1528369 1528377 1531939 1531944) (-915 "PLOT1.spad" 1527510 1527520 1528359 1528364) (-914 "PLEQN.spad" 1514726 1514753 1527500 1527505) (-913 "PINTERP.spad" 1514342 1514361 1514716 1514721) (-912 "PINTERPA.spad" 1514124 1514140 1514332 1514337) (-911 "PI.spad" 1513731 1513739 1514098 1514119) (-910 "PID.spad" 1512687 1512695 1513657 1513726) (-909 "PICOERCE.spad" 1512344 1512354 1512677 1512682) (-908 "PGROEB.spad" 1510941 1510955 1512334 1512339) (-907 "PGE.spad" 1502194 1502202 1510931 1510936) (-906 "PGCD.spad" 1501076 1501093 1502184 1502189) (-905 "PFRPAC.spad" 1500219 1500229 1501066 1501071) (-904 "PFR.spad" 1496876 1496886 1500121 1500214) (-903 "PFOTOOLS.spad" 1496134 1496150 1496866 1496871) (-902 "PFOQ.spad" 1495504 1495522 1496124 1496129) (-901 "PFO.spad" 1494923 1494950 1495494 1495499) (-900 "PF.spad" 1494497 1494509 1494728 1494821) (-899 "PFECAT.spad" 1492163 1492171 1494423 1494492) (-898 "PFECAT.spad" 1489857 1489867 1492119 1492124) (-897 "PFBRU.spad" 1487727 1487739 1489847 1489852) (-896 "PFBR.spad" 1485265 1485288 1487717 1487722) (-895 "PERM.spad" 1480946 1480956 1485095 1485110) (-894 "PERMGRP.spad" 1475682 1475692 1480936 1480941) (-893 "PERMCAT.spad" 1474234 1474244 1475662 1475677) (-892 "PERMAN.spad" 1472766 1472780 1474224 1474229) (-891 "PENDTREE.spad" 1472105 1472115 1472395 1472400) (-890 "PDRING.spad" 1470596 1470606 1472085 1472100) (-889 "PDRING.spad" 1469095 1469107 1470586 1470591) (-888 "PDEPROB.spad" 1468110 1468118 1469085 1469090) (-887 "PDEPACK.spad" 1462112 1462120 1468100 1468105) (-886 "PDECOMP.spad" 1461574 1461591 1462102 1462107) (-885 "PDECAT.spad" 1459928 1459936 1461564 1461569) (-884 "PCOMP.spad" 1459779 1459792 1459918 1459923) (-883 "PBWLB.spad" 1458361 1458378 1459769 1459774) (-882 "PATTERN.spad" 1452792 1452802 1458351 1458356) (-881 "PATTERN2.spad" 1452528 1452540 1452782 1452787) (-880 "PATTERN1.spad" 1450830 1450846 1452518 1452523) (-879 "PATRES.spad" 1448377 1448389 1450820 1450825) (-878 "PATRES2.spad" 1448039 1448053 1448367 1448372) (-877 "PATMATCH.spad" 1446196 1446227 1447747 1447752) (-876 "PATMAB.spad" 1445621 1445631 1446186 1446191) (-875 "PATLRES.spad" 1444705 1444719 1445611 1445616) (-874 "PATAB.spad" 1444469 1444479 1444695 1444700) (-873 "PARTPERM.spad" 1441831 1441839 1444459 1444464) (-872 "PARSURF.spad" 1441259 1441287 1441821 1441826) (-871 "PARSU2.spad" 1441054 1441070 1441249 1441254) (-870 "script-parser.spad" 1440574 1440582 1441044 1441049) (-869 "PARSCURV.spad" 1440002 1440030 1440564 1440569) (-868 "PARSC2.spad" 1439791 1439807 1439992 1439997) (-867 "PARPCURV.spad" 1439249 1439277 1439781 1439786) (-866 "PARPC2.spad" 1439038 1439054 1439239 1439244) (-865 "PAN2EXPR.spad" 1438450 1438458 1439028 1439033) (-864 "PALETTE.spad" 1437420 1437428 1438440 1438445) (-863 "PAIR.spad" 1436403 1436416 1437008 1437013) (-862 "PADICRC.spad" 1433733 1433751 1434908 1435001) (-861 "PADICRAT.spad" 1431748 1431760 1431969 1432062) (-860 "PADIC.spad" 1431443 1431455 1431674 1431743) (-859 "PADICCT.spad" 1429984 1429996 1431369 1431438) (-858 "PADEPAC.spad" 1428663 1428682 1429974 1429979) (-857 "PADE.spad" 1427403 1427419 1428653 1428658) (-856 "OWP.spad" 1426643 1426673 1427261 1427328) (-855 "OVAR.spad" 1426424 1426447 1426633 1426638) (-854 "OUT.spad" 1425508 1425516 1426414 1426419) (-853 "OUTFORM.spad" 1414804 1414812 1425498 1425503) (-852 "OUTBFILE.spad" 1414222 1414230 1414794 1414799) (-851 "OUTBCON.spad" 1413500 1413508 1414212 1414217) (-850 "OUTBCON.spad" 1412776 1412786 1413490 1413495) (-849 "OSI.spad" 1412251 1412259 1412766 1412771) (-848 "OSGROUP.spad" 1412169 1412177 1412241 1412246) (-847 "ORTHPOL.spad" 1410630 1410640 1412086 1412091) (-846 "OREUP.spad" 1410083 1410111 1410310 1410349) (-845 "ORESUP.spad" 1409382 1409406 1409763 1409802) (-844 "OREPCTO.spad" 1407201 1407213 1409302 1409307) (-843 "OREPCAT.spad" 1401258 1401268 1407157 1407196) (-842 "OREPCAT.spad" 1395205 1395217 1401106 1401111) (-841 "ORDSET.spad" 1394371 1394379 1395195 1395200) (-840 "ORDSET.spad" 1393535 1393545 1394361 1394366) (-839 "ORDRING.spad" 1392925 1392933 1393515 1393530) (-838 "ORDRING.spad" 1392323 1392333 1392915 1392920) (-837 "ORDMON.spad" 1392178 1392186 1392313 1392318) (-836 "ORDFUNS.spad" 1391304 1391320 1392168 1392173) (-835 "ORDFIN.spad" 1391124 1391132 1391294 1391299) (-834 "ORDCOMP.spad" 1389589 1389599 1390671 1390700) (-833 "ORDCOMP2.spad" 1388874 1388886 1389579 1389584) (-832 "OPTPROB.spad" 1387512 1387520 1388864 1388869) (-831 "OPTPACK.spad" 1379897 1379905 1387502 1387507) (-830 "OPTCAT.spad" 1377572 1377580 1379887 1379892) (-829 "OPSIG.spad" 1377224 1377232 1377562 1377567) (-828 "OPQUERY.spad" 1376773 1376781 1377214 1377219) (-827 "OP.spad" 1376515 1376525 1376595 1376662) (-826 "OPERCAT.spad" 1376103 1376113 1376505 1376510) (-825 "OPERCAT.spad" 1375689 1375701 1376093 1376098) (-824 "ONECOMP.spad" 1374434 1374444 1375236 1375265) (-823 "ONECOMP2.spad" 1373852 1373864 1374424 1374429) (-822 "OMSERVER.spad" 1372854 1372862 1373842 1373847) (-821 "OMSAGG.spad" 1372642 1372652 1372810 1372849) (-820 "OMPKG.spad" 1371254 1371262 1372632 1372637) (-819 "OM.spad" 1370219 1370227 1371244 1371249) (-818 "OMLO.spad" 1369644 1369656 1370105 1370144) (-817 "OMEXPR.spad" 1369478 1369488 1369634 1369639) (-816 "OMERR.spad" 1369021 1369029 1369468 1369473) (-815 "OMERRK.spad" 1368055 1368063 1369011 1369016) (-814 "OMENC.spad" 1367399 1367407 1368045 1368050) (-813 "OMDEV.spad" 1361688 1361696 1367389 1367394) (-812 "OMCONN.spad" 1361097 1361105 1361678 1361683) (-811 "OINTDOM.spad" 1360860 1360868 1361023 1361092) (-810 "OFMONOID.spad" 1357047 1357057 1360850 1360855) (-809 "ODVAR.spad" 1356308 1356318 1357037 1357042) (-808 "ODR.spad" 1355952 1355978 1356120 1356269) (-807 "ODPOL.spad" 1353298 1353308 1353638 1353765) (-806 "ODP.spad" 1343145 1343165 1343518 1343649) (-805 "ODETOOLS.spad" 1341728 1341747 1343135 1343140) (-804 "ODESYS.spad" 1339378 1339395 1341718 1341723) (-803 "ODERTRIC.spad" 1335319 1335336 1339335 1339340) (-802 "ODERED.spad" 1334706 1334730 1335309 1335314) (-801 "ODERAT.spad" 1332257 1332274 1334696 1334701) (-800 "ODEPRRIC.spad" 1329148 1329170 1332247 1332252) (-799 "ODEPROB.spad" 1328405 1328413 1329138 1329143) (-798 "ODEPRIM.spad" 1325679 1325701 1328395 1328400) (-797 "ODEPAL.spad" 1325055 1325079 1325669 1325674) (-796 "ODEPACK.spad" 1311657 1311665 1325045 1325050) (-795 "ODEINT.spad" 1311088 1311104 1311647 1311652) (-794 "ODEIFTBL.spad" 1308483 1308491 1311078 1311083) (-793 "ODEEF.spad" 1303850 1303866 1308473 1308478) (-792 "ODECONST.spad" 1303369 1303387 1303840 1303845) (-791 "ODECAT.spad" 1301965 1301973 1303359 1303364) (-790 "OCT.spad" 1300103 1300113 1300819 1300858) (-789 "OCTCT2.spad" 1299747 1299768 1300093 1300098) (-788 "OC.spad" 1297521 1297531 1299703 1299742) (-787 "OC.spad" 1295020 1295032 1297204 1297209) (-786 "OCAMON.spad" 1294868 1294876 1295010 1295015) (-785 "OASGP.spad" 1294683 1294691 1294858 1294863) (-784 "OAMONS.spad" 1294203 1294211 1294673 1294678) (-783 "OAMON.spad" 1294064 1294072 1294193 1294198) (-782 "OAGROUP.spad" 1293926 1293934 1294054 1294059) (-781 "NUMTUBE.spad" 1293513 1293529 1293916 1293921) (-780 "NUMQUAD.spad" 1281375 1281383 1293503 1293508) (-779 "NUMODE.spad" 1272511 1272519 1281365 1281370) (-778 "NUMINT.spad" 1270069 1270077 1272501 1272506) (-777 "NUMFMT.spad" 1268909 1268917 1270059 1270064) (-776 "NUMERIC.spad" 1260981 1260991 1268714 1268719) (-775 "NTSCAT.spad" 1259483 1259499 1260949 1260976) (-774 "NTPOLFN.spad" 1259028 1259038 1259400 1259405) (-773 "NSUP.spad" 1252038 1252048 1256578 1256731) (-772 "NSUP2.spad" 1251430 1251442 1252028 1252033) (-771 "NSMP.spad" 1247625 1247644 1247933 1248060) (-770 "NREP.spad" 1245997 1246011 1247615 1247620) (-769 "NPCOEF.spad" 1245243 1245263 1245987 1245992) (-768 "NORMRETR.spad" 1244841 1244880 1245233 1245238) (-767 "NORMPK.spad" 1242743 1242762 1244831 1244836) (-766 "NORMMA.spad" 1242431 1242457 1242733 1242738) (-765 "NONE.spad" 1242172 1242180 1242421 1242426) (-764 "NONE1.spad" 1241848 1241858 1242162 1242167) (-763 "NODE1.spad" 1241317 1241333 1241838 1241843) (-762 "NNI.spad" 1240204 1240212 1241291 1241312) (-761 "NLINSOL.spad" 1238826 1238836 1240194 1240199) (-760 "NIPROB.spad" 1237367 1237375 1238816 1238821) (-759 "NFINTBAS.spad" 1234827 1234844 1237357 1237362) (-758 "NETCLT.spad" 1234801 1234812 1234817 1234822) (-757 "NCODIV.spad" 1232999 1233015 1234791 1234796) (-756 "NCNTFRAC.spad" 1232641 1232655 1232989 1232994) (-755 "NCEP.spad" 1230801 1230815 1232631 1232636) (-754 "NASRING.spad" 1230397 1230405 1230791 1230796) (-753 "NASRING.spad" 1229991 1230001 1230387 1230392) (-752 "NARNG.spad" 1229335 1229343 1229981 1229986) (-751 "NARNG.spad" 1228677 1228687 1229325 1229330) (-750 "NAGSP.spad" 1227750 1227758 1228667 1228672) (-749 "NAGS.spad" 1217275 1217283 1227740 1227745) (-748 "NAGF07.spad" 1215668 1215676 1217265 1217270) (-747 "NAGF04.spad" 1209900 1209908 1215658 1215663) (-746 "NAGF02.spad" 1203709 1203717 1209890 1209895) (-745 "NAGF01.spad" 1199312 1199320 1203699 1203704) (-744 "NAGE04.spad" 1192772 1192780 1199302 1199307) (-743 "NAGE02.spad" 1183114 1183122 1192762 1192767) (-742 "NAGE01.spad" 1178998 1179006 1183104 1183109) (-741 "NAGD03.spad" 1176918 1176926 1178988 1178993) (-740 "NAGD02.spad" 1169449 1169457 1176908 1176913) (-739 "NAGD01.spad" 1163562 1163570 1169439 1169444) (-738 "NAGC06.spad" 1159349 1159357 1163552 1163557) (-737 "NAGC05.spad" 1157818 1157826 1159339 1159344) (-736 "NAGC02.spad" 1157073 1157081 1157808 1157813) (-735 "NAALG.spad" 1156608 1156618 1157041 1157068) (-734 "NAALG.spad" 1156163 1156175 1156598 1156603) (-733 "MULTSQFR.spad" 1153121 1153138 1156153 1156158) (-732 "MULTFACT.spad" 1152504 1152521 1153111 1153116) (-731 "MTSCAT.spad" 1150538 1150559 1152402 1152499) (-730 "MTHING.spad" 1150195 1150205 1150528 1150533) (-729 "MSYSCMD.spad" 1149629 1149637 1150185 1150190) (-728 "MSET.spad" 1147571 1147581 1149335 1149374) (-727 "MSETAGG.spad" 1147416 1147426 1147539 1147566) (-726 "MRING.spad" 1144387 1144399 1147124 1147191) (-725 "MRF2.spad" 1143955 1143969 1144377 1144382) (-724 "MRATFAC.spad" 1143501 1143518 1143945 1143950) (-723 "MPRFF.spad" 1141531 1141550 1143491 1143496) (-722 "MPOLY.spad" 1138966 1138981 1139325 1139452) (-721 "MPCPF.spad" 1138230 1138249 1138956 1138961) (-720 "MPC3.spad" 1138045 1138085 1138220 1138225) (-719 "MPC2.spad" 1137687 1137720 1138035 1138040) (-718 "MONOTOOL.spad" 1136022 1136039 1137677 1137682) (-717 "MONOID.spad" 1135341 1135349 1136012 1136017) (-716 "MONOID.spad" 1134658 1134668 1135331 1135336) (-715 "MONOGEN.spad" 1133404 1133417 1134518 1134653) (-714 "MONOGEN.spad" 1132172 1132187 1133288 1133293) (-713 "MONADWU.spad" 1130186 1130194 1132162 1132167) (-712 "MONADWU.spad" 1128198 1128208 1130176 1130181) (-711 "MONAD.spad" 1127342 1127350 1128188 1128193) (-710 "MONAD.spad" 1126484 1126494 1127332 1127337) (-709 "MOEBIUS.spad" 1125170 1125184 1126464 1126479) (-708 "MODULE.spad" 1125040 1125050 1125138 1125165) (-707 "MODULE.spad" 1124930 1124942 1125030 1125035) (-706 "MODRING.spad" 1124261 1124300 1124910 1124925) (-705 "MODOP.spad" 1122920 1122932 1124083 1124150) (-704 "MODMONOM.spad" 1122649 1122667 1122910 1122915) (-703 "MODMON.spad" 1119408 1119424 1120127 1120280) (-702 "MODFIELD.spad" 1118766 1118805 1119310 1119403) (-701 "MMLFORM.spad" 1117626 1117634 1118756 1118761) (-700 "MMAP.spad" 1117366 1117400 1117616 1117621) (-699 "MLO.spad" 1115793 1115803 1117322 1117361) (-698 "MLIFT.spad" 1114365 1114382 1115783 1115788) (-697 "MKUCFUNC.spad" 1113898 1113916 1114355 1114360) (-696 "MKRECORD.spad" 1113500 1113513 1113888 1113893) (-695 "MKFUNC.spad" 1112881 1112891 1113490 1113495) (-694 "MKFLCFN.spad" 1111837 1111847 1112871 1112876) (-693 "MKCHSET.spad" 1111702 1111712 1111827 1111832) (-692 "MKBCFUNC.spad" 1111187 1111205 1111692 1111697) (-691 "MINT.spad" 1110626 1110634 1111089 1111182) (-690 "MHROWRED.spad" 1109127 1109137 1110616 1110621) (-689 "MFLOAT.spad" 1107643 1107651 1109017 1109122) (-688 "MFINFACT.spad" 1107043 1107065 1107633 1107638) (-687 "MESH.spad" 1104775 1104783 1107033 1107038) (-686 "MDDFACT.spad" 1102968 1102978 1104765 1104770) (-685 "MDAGG.spad" 1102255 1102265 1102948 1102963) (-684 "MCMPLX.spad" 1098241 1098249 1098855 1099044) (-683 "MCDEN.spad" 1097449 1097461 1098231 1098236) (-682 "MCALCFN.spad" 1094551 1094577 1097439 1097444) (-681 "MAYBE.spad" 1093864 1093875 1094541 1094546) (-680 "MATSTOR.spad" 1091140 1091150 1093854 1093859) (-679 "MATRIX.spad" 1089844 1089854 1090328 1090355) (-678 "MATLIN.spad" 1087170 1087194 1089728 1089733) (-677 "MATCAT.spad" 1078755 1078777 1087138 1087165) (-676 "MATCAT.spad" 1070212 1070236 1078597 1078602) (-675 "MATCAT2.spad" 1069480 1069528 1070202 1070207) (-674 "MAPPKG3.spad" 1068379 1068393 1069470 1069475) (-673 "MAPPKG2.spad" 1067713 1067725 1068369 1068374) (-672 "MAPPKG1.spad" 1066531 1066541 1067703 1067708) (-671 "MAPPAST.spad" 1065844 1065852 1066521 1066526) (-670 "MAPHACK3.spad" 1065652 1065666 1065834 1065839) (-669 "MAPHACK2.spad" 1065417 1065429 1065642 1065647) (-668 "MAPHACK1.spad" 1065047 1065057 1065407 1065412) (-667 "MAGMA.spad" 1062837 1062854 1065037 1065042) (-666 "MACROAST.spad" 1062416 1062424 1062827 1062832) (-665 "M3D.spad" 1060112 1060122 1061794 1061799) (-664 "LZSTAGG.spad" 1057340 1057350 1060102 1060107) (-663 "LZSTAGG.spad" 1054566 1054578 1057330 1057335) (-662 "LWORD.spad" 1051271 1051288 1054556 1054561) (-661 "LSTAST.spad" 1051055 1051063 1051261 1051266) (-660 "LSQM.spad" 1049281 1049295 1049679 1049730) (-659 "LSPP.spad" 1048814 1048831 1049271 1049276) (-658 "LSMP.spad" 1047654 1047682 1048804 1048809) (-657 "LSMP1.spad" 1045458 1045472 1047644 1047649) (-656 "LSAGG.spad" 1045127 1045137 1045426 1045453) (-655 "LSAGG.spad" 1044816 1044828 1045117 1045122) (-654 "LPOLY.spad" 1043770 1043789 1044672 1044741) (-653 "LPEFRAC.spad" 1043027 1043037 1043760 1043765) (-652 "LO.spad" 1042428 1042442 1042961 1042988) (-651 "LOGIC.spad" 1042030 1042038 1042418 1042423) (-650 "LOGIC.spad" 1041630 1041640 1042020 1042025) (-649 "LODOOPS.spad" 1040548 1040560 1041620 1041625) (-648 "LODO.spad" 1039932 1039948 1040228 1040267) (-647 "LODOF.spad" 1038976 1038993 1039889 1039894) (-646 "LODOCAT.spad" 1037634 1037644 1038932 1038971) (-645 "LODOCAT.spad" 1036290 1036302 1037590 1037595) (-644 "LODO2.spad" 1035563 1035575 1035970 1036009) (-643 "LODO1.spad" 1034963 1034973 1035243 1035282) (-642 "LODEEF.spad" 1033735 1033753 1034953 1034958) (-641 "LNAGG.spad" 1029537 1029547 1033725 1033730) (-640 "LNAGG.spad" 1025303 1025315 1029493 1029498) (-639 "LMOPS.spad" 1022039 1022056 1025293 1025298) (-638 "LMODULE.spad" 1021681 1021691 1022029 1022034) (-637 "LMDICT.spad" 1020964 1020974 1021232 1021259) (-636 "LITERAL.spad" 1020870 1020881 1020954 1020959) (-635 "LIST.spad" 1018588 1018598 1020017 1020044) (-634 "LIST3.spad" 1017879 1017893 1018578 1018583) (-633 "LIST2.spad" 1016519 1016531 1017869 1017874) (-632 "LIST2MAP.spad" 1013396 1013408 1016509 1016514) (-631 "LINEXP.spad" 1012828 1012838 1013376 1013391) (-630 "LINDEP.spad" 1011605 1011617 1012740 1012745) (-629 "LIMITRF.spad" 1009519 1009529 1011595 1011600) (-628 "LIMITPS.spad" 1008402 1008415 1009509 1009514) (-627 "LIE.spad" 1006416 1006428 1007692 1007837) (-626 "LIECAT.spad" 1005892 1005902 1006342 1006411) (-625 "LIECAT.spad" 1005396 1005408 1005848 1005853) (-624 "LIB.spad" 1003444 1003452 1004055 1004070) (-623 "LGROBP.spad" 1000797 1000816 1003434 1003439) (-622 "LF.spad" 999716 999732 1000787 1000792) (-621 "LFCAT.spad" 998735 998743 999706 999711) (-620 "LEXTRIPK.spad" 994238 994253 998725 998730) (-619 "LEXP.spad" 992241 992268 994218 994233) (-618 "LETAST.spad" 991940 991948 992231 992236) (-617 "LEADCDET.spad" 990324 990341 991930 991935) (-616 "LAZM3PK.spad" 989028 989050 990314 990319) (-615 "LAUPOL.spad" 987717 987730 988621 988690) (-614 "LAPLACE.spad" 987290 987306 987707 987712) (-613 "LA.spad" 986730 986744 987212 987251) (-612 "LALG.spad" 986506 986516 986710 986725) (-611 "LALG.spad" 986290 986302 986496 986501) (-610 "KVTFROM.spad" 986025 986035 986280 986285) (-609 "KTVLOGIC.spad" 985448 985456 986015 986020) (-608 "KRCFROM.spad" 985186 985196 985438 985443) (-607 "KOVACIC.spad" 983899 983916 985176 985181) (-606 "KONVERT.spad" 983621 983631 983889 983894) (-605 "KOERCE.spad" 983358 983368 983611 983616) (-604 "KERNEL.spad" 981893 981903 983142 983147) (-603 "KERNEL2.spad" 981596 981608 981883 981888) (-602 "KDAGG.spad" 980699 980721 981576 981591) (-601 "KDAGG.spad" 979810 979834 980689 980694) (-600 "KAFILE.spad" 978773 978789 979008 979035) (-599 "JORDAN.spad" 976600 976612 978063 978208) (-598 "JOINAST.spad" 976294 976302 976590 976595) (-597 "JAVACODE.spad" 976160 976168 976284 976289) (-596 "IXAGG.spad" 974283 974307 976150 976155) (-595 "IXAGG.spad" 972261 972287 974130 974135) (-594 "IVECTOR.spad" 971032 971047 971187 971214) (-593 "ITUPLE.spad" 970177 970187 971022 971027) (-592 "ITRIGMNP.spad" 968988 969007 970167 970172) (-591 "ITFUN3.spad" 968482 968496 968978 968983) (-590 "ITFUN2.spad" 968212 968224 968472 968477) (-589 "ITAYLOR.spad" 966004 966019 968048 968173) (-588 "ISUPS.spad" 958415 958430 964978 965075) (-587 "ISUMP.spad" 957912 957928 958405 958410) (-586 "ISTRING.spad" 956915 956928 957081 957108) (-585 "ISAST.spad" 956634 956642 956905 956910) (-584 "IRURPK.spad" 955347 955366 956624 956629) (-583 "IRSN.spad" 953307 953315 955337 955342) (-582 "IRRF2F.spad" 951782 951792 953263 953268) (-581 "IRREDFFX.spad" 951383 951394 951772 951777) (-580 "IROOT.spad" 949714 949724 951373 951378) (-579 "IR.spad" 947503 947517 949569 949596) (-578 "IR2.spad" 946523 946539 947493 947498) (-577 "IR2F.spad" 945723 945739 946513 946518) (-576 "IPRNTPK.spad" 945483 945491 945713 945718) (-575 "IPF.spad" 945048 945060 945288 945381) (-574 "IPADIC.spad" 944809 944835 944974 945043) (-573 "IP4ADDR.spad" 944357 944365 944799 944804) (-572 "IOMODE.spad" 943978 943986 944347 944352) (-571 "IOBFILE.spad" 943339 943347 943968 943973) (-570 "IOBCON.spad" 943204 943212 943329 943334) (-569 "INVLAPLA.spad" 942849 942865 943194 943199) (-568 "INTTR.spad" 936095 936112 942839 942844) (-567 "INTTOOLS.spad" 933806 933822 935669 935674) (-566 "INTSLPE.spad" 933112 933120 933796 933801) (-565 "INTRVL.spad" 932678 932688 933026 933107) (-564 "INTRF.spad" 931042 931056 932668 932673) (-563 "INTRET.spad" 930474 930484 931032 931037) (-562 "INTRAT.spad" 929149 929166 930464 930469) (-561 "INTPM.spad" 927512 927528 928792 928797) (-560 "INTPAF.spad" 925280 925298 927444 927449) (-559 "INTPACK.spad" 915590 915598 925270 925275) (-558 "INT.spad" 914951 914959 915444 915585) (-557 "INTHERTR.spad" 914217 914234 914941 914946) (-556 "INTHERAL.spad" 913883 913907 914207 914212) (-555 "INTHEORY.spad" 910296 910304 913873 913878) (-554 "INTG0.spad" 903759 903777 910228 910233) (-553 "INTFTBL.spad" 897788 897796 903749 903754) (-552 "INTFACT.spad" 896847 896857 897778 897783) (-551 "INTEF.spad" 895162 895178 896837 896842) (-550 "INTDOM.spad" 893777 893785 895088 895157) (-549 "INTDOM.spad" 892454 892464 893767 893772) (-548 "INTCAT.spad" 890707 890717 892368 892449) (-547 "INTBIT.spad" 890210 890218 890697 890702) (-546 "INTALG.spad" 889392 889419 890200 890205) (-545 "INTAF.spad" 888884 888900 889382 889387) (-544 "INTABL.spad" 887402 887433 887565 887592) (-543 "INS.spad" 884869 884877 887304 887397) (-542 "INS.spad" 882422 882432 884859 884864) (-541 "INPSIGN.spad" 881856 881869 882412 882417) (-540 "INPRODPF.spad" 880922 880941 881846 881851) (-539 "INPRODFF.spad" 879980 880004 880912 880917) (-538 "INNMFACT.spad" 878951 878968 879970 879975) (-537 "INMODGCD.spad" 878435 878465 878941 878946) (-536 "INFSP.spad" 876720 876742 878425 878430) (-535 "INFPROD0.spad" 875770 875789 876710 876715) (-534 "INFORM.spad" 872931 872939 875760 875765) (-533 "INFORM1.spad" 872556 872566 872921 872926) (-532 "INFINITY.spad" 872108 872116 872546 872551) (-531 "INETCLTS.spad" 872085 872093 872098 872103) (-530 "INEP.spad" 870617 870639 872075 872080) (-529 "INDE.spad" 870346 870363 870607 870612) (-528 "INCRMAPS.spad" 869767 869777 870336 870341) (-527 "INBFILE.spad" 868839 868847 869757 869762) (-526 "INBFF.spad" 864609 864620 868829 868834) (-525 "INBCON.spad" 863853 863861 864599 864604) (-524 "INBCON.spad" 863095 863105 863843 863848) (-523 "INAST.spad" 862760 862768 863085 863090) (-522 "IMPTAST.spad" 862468 862476 862750 862755) (-521 "IMATRIX.spad" 861413 861439 861925 861952) (-520 "IMATQF.spad" 860507 860551 861369 861374) (-519 "IMATLIN.spad" 859112 859136 860463 860468) (-518 "ILIST.spad" 857768 857783 858295 858322) (-517 "IIARRAY2.spad" 857156 857194 857375 857402) (-516 "IFF.spad" 856566 856582 856837 856930) (-515 "IFAST.spad" 856180 856188 856556 856561) (-514 "IFARRAY.spad" 853667 853682 855363 855390) (-513 "IFAMON.spad" 853529 853546 853623 853628) (-512 "IEVALAB.spad" 852918 852930 853519 853524) (-511 "IEVALAB.spad" 852305 852319 852908 852913) (-510 "IDPO.spad" 852103 852115 852295 852300) (-509 "IDPOAMS.spad" 851859 851871 852093 852098) (-508 "IDPOAM.spad" 851579 851591 851849 851854) (-507 "IDPC.spad" 850513 850525 851569 851574) (-506 "IDPAM.spad" 850258 850270 850503 850508) (-505 "IDPAG.spad" 850005 850017 850248 850253) (-504 "IDENT.spad" 849777 849785 849995 850000) (-503 "IDECOMP.spad" 847014 847032 849767 849772) (-502 "IDEAL.spad" 841937 841976 846949 846954) (-501 "ICDEN.spad" 841088 841104 841927 841932) (-500 "ICARD.spad" 840277 840285 841078 841083) (-499 "IBPTOOLS.spad" 838870 838887 840267 840272) (-498 "IBITS.spad" 838069 838082 838506 838533) (-497 "IBATOOL.spad" 834944 834963 838059 838064) (-496 "IBACHIN.spad" 833431 833446 834934 834939) (-495 "IARRAY2.spad" 832419 832445 833038 833065) (-494 "IARRAY1.spad" 831464 831479 831602 831629) (-493 "IAN.spad" 829677 829685 831280 831373) (-492 "IALGFACT.spad" 829278 829311 829667 829672) (-491 "HYPCAT.spad" 828702 828710 829268 829273) (-490 "HYPCAT.spad" 828124 828134 828692 828697) (-489 "HOSTNAME.spad" 827932 827940 828114 828119) (-488 "HOMOTOP.spad" 827675 827685 827922 827927) (-487 "HOAGG.spad" 824943 824953 827665 827670) (-486 "HOAGG.spad" 821986 821998 824710 824715) (-485 "HEXADEC.spad" 820088 820096 820453 820546) (-484 "HEUGCD.spad" 819103 819114 820078 820083) (-483 "HELLFDIV.spad" 818693 818717 819093 819098) (-482 "HEAP.spad" 818085 818095 818300 818327) (-481 "HEADAST.spad" 817616 817624 818075 818080) (-480 "HDP.spad" 807459 807475 807836 807967) (-479 "HDMP.spad" 804635 804650 805253 805380) (-478 "HB.spad" 802872 802880 804625 804630) (-477 "HASHTBL.spad" 801342 801373 801553 801580) (-476 "HASAST.spad" 801058 801066 801332 801337) (-475 "HACKPI.spad" 800541 800549 800960 801053) (-474 "GTSET.spad" 799480 799496 800187 800214) (-473 "GSTBL.spad" 797999 798034 798173 798188) (-472 "GSERIES.spad" 795166 795193 796131 796280) (-471 "GROUP.spad" 794435 794443 795146 795161) (-470 "GROUP.spad" 793712 793722 794425 794430) (-469 "GROEBSOL.spad" 792200 792221 793702 793707) (-468 "GRMOD.spad" 790771 790783 792190 792195) (-467 "GRMOD.spad" 789340 789354 790761 790766) (-466 "GRIMAGE.spad" 781945 781953 789330 789335) (-465 "GRDEF.spad" 780324 780332 781935 781940) (-464 "GRAY.spad" 778783 778791 780314 780319) (-463 "GRALG.spad" 777830 777842 778773 778778) (-462 "GRALG.spad" 776875 776889 777820 777825) (-461 "GPOLSET.spad" 776329 776352 776557 776584) (-460 "GOSPER.spad" 775594 775612 776319 776324) (-459 "GMODPOL.spad" 774732 774759 775562 775589) (-458 "GHENSEL.spad" 773801 773815 774722 774727) (-457 "GENUPS.spad" 769902 769915 773791 773796) (-456 "GENUFACT.spad" 769479 769489 769892 769897) (-455 "GENPGCD.spad" 769063 769080 769469 769474) (-454 "GENMFACT.spad" 768515 768534 769053 769058) (-453 "GENEEZ.spad" 766454 766467 768505 768510) (-452 "GDMP.spad" 763472 763489 764248 764375) (-451 "GCNAALG.spad" 757367 757394 763266 763333) (-450 "GCDDOM.spad" 756539 756547 757293 757362) (-449 "GCDDOM.spad" 755773 755783 756529 756534) (-448 "GB.spad" 753291 753329 755729 755734) (-447 "GBINTERN.spad" 749311 749349 753281 753286) (-446 "GBF.spad" 745068 745106 749301 749306) (-445 "GBEUCLID.spad" 742942 742980 745058 745063) (-444 "GAUSSFAC.spad" 742239 742247 742932 742937) (-443 "GALUTIL.spad" 740561 740571 742195 742200) (-442 "GALPOLYU.spad" 739007 739020 740551 740556) (-441 "GALFACTU.spad" 737172 737191 738997 739002) (-440 "GALFACT.spad" 727305 727316 737162 737167) (-439 "FVFUN.spad" 724328 724336 727295 727300) (-438 "FVC.spad" 723380 723388 724318 724323) (-437 "FUNCTION.spad" 723229 723241 723370 723375) (-436 "FT.spad" 721522 721530 723219 723224) (-435 "FTEM.spad" 720685 720693 721512 721517) (-434 "FSUPFACT.spad" 719585 719604 720621 720626) (-433 "FST.spad" 717671 717679 719575 719580) (-432 "FSRED.spad" 717149 717165 717661 717666) (-431 "FSPRMELT.spad" 715973 715989 717106 717111) (-430 "FSPECF.spad" 714050 714066 715963 715968) (-429 "FS.spad" 708112 708122 713825 714045) (-428 "FS.spad" 701952 701964 707667 707672) (-427 "FSINT.spad" 701610 701626 701942 701947) (-426 "FSERIES.spad" 700797 700809 701430 701529) (-425 "FSCINT.spad" 700110 700126 700787 700792) (-424 "FSAGG.spad" 699227 699237 700066 700105) (-423 "FSAGG.spad" 698306 698318 699147 699152) (-422 "FSAGG2.spad" 697005 697021 698296 698301) (-421 "FS2UPS.spad" 691488 691522 696995 697000) (-420 "FS2.spad" 691133 691149 691478 691483) (-419 "FS2EXPXP.spad" 690256 690279 691123 691128) (-418 "FRUTIL.spad" 689198 689208 690246 690251) (-417 "FR.spad" 682892 682902 688222 688291) (-416 "FRNAALG.spad" 677979 677989 682834 682887) (-415 "FRNAALG.spad" 673078 673090 677935 677940) (-414 "FRNAAF2.spad" 672532 672550 673068 673073) (-413 "FRMOD.spad" 671926 671956 672463 672468) (-412 "FRIDEAL.spad" 671121 671142 671906 671921) (-411 "FRIDEAL2.spad" 670723 670755 671111 671116) (-410 "FRETRCT.spad" 670234 670244 670713 670718) (-409 "FRETRCT.spad" 669611 669623 670092 670097) (-408 "FRAMALG.spad" 667939 667952 669567 669606) (-407 "FRAMALG.spad" 666299 666314 667929 667934) (-406 "FRAC.spad" 663398 663408 663801 663974) (-405 "FRAC2.spad" 663001 663013 663388 663393) (-404 "FR2.spad" 662335 662347 662991 662996) (-403 "FPS.spad" 659144 659152 662225 662330) (-402 "FPS.spad" 655981 655991 659064 659069) (-401 "FPC.spad" 655023 655031 655883 655976) (-400 "FPC.spad" 654151 654161 655013 655018) (-399 "FPATMAB.spad" 653913 653923 654141 654146) (-398 "FPARFRAC.spad" 652386 652403 653903 653908) (-397 "FORTRAN.spad" 650892 650935 652376 652381) (-396 "FORT.spad" 649821 649829 650882 650887) (-395 "FORTFN.spad" 646991 646999 649811 649816) (-394 "FORTCAT.spad" 646675 646683 646981 646986) (-393 "FORMULA.spad" 644139 644147 646665 646670) (-392 "FORMULA1.spad" 643618 643628 644129 644134) (-391 "FORDER.spad" 643309 643333 643608 643613) (-390 "FOP.spad" 642510 642518 643299 643304) (-389 "FNLA.spad" 641934 641956 642478 642505) (-388 "FNCAT.spad" 640521 640529 641924 641929) (-387 "FNAME.spad" 640413 640421 640511 640516) (-386 "FMTC.spad" 640211 640219 640339 640408) (-385 "FMONOID.spad" 637266 637276 640167 640172) (-384 "FM.spad" 636961 636973 637200 637227) (-383 "FMFUN.spad" 633991 633999 636951 636956) (-382 "FMC.spad" 633043 633051 633981 633986) (-381 "FMCAT.spad" 630697 630715 633011 633038) (-380 "FM1.spad" 630054 630066 630631 630658) (-379 "FLOATRP.spad" 627775 627789 630044 630049) (-378 "FLOAT.spad" 621063 621071 627641 627770) (-377 "FLOATCP.spad" 618480 618494 621053 621058) (-376 "FLINEXP.spad" 618192 618202 618460 618475) (-375 "FLINEXP.spad" 617858 617870 618128 618133) (-374 "FLASORT.spad" 617178 617190 617848 617853) (-373 "FLALG.spad" 614824 614843 617104 617173) (-372 "FLAGG.spad" 611842 611852 614804 614819) (-371 "FLAGG.spad" 608761 608773 611725 611730) (-370 "FLAGG2.spad" 607442 607458 608751 608756) (-369 "FINRALG.spad" 605471 605484 607398 607437) (-368 "FINRALG.spad" 603426 603441 605355 605360) (-367 "FINITE.spad" 602578 602586 603416 603421) (-366 "FINAALG.spad" 591559 591569 602520 602573) (-365 "FINAALG.spad" 580552 580564 591515 591520) (-364 "FILE.spad" 580135 580145 580542 580547) (-363 "FILECAT.spad" 578653 578670 580125 580130) (-362 "FIELD.spad" 578059 578067 578555 578648) (-361 "FIELD.spad" 577551 577561 578049 578054) (-360 "FGROUP.spad" 576160 576170 577531 577546) (-359 "FGLMICPK.spad" 574947 574962 576150 576155) (-358 "FFX.spad" 574322 574337 574663 574756) (-357 "FFSLPE.spad" 573811 573832 574312 574317) (-356 "FFPOLY.spad" 565063 565074 573801 573806) (-355 "FFPOLY2.spad" 564123 564140 565053 565058) (-354 "FFP.spad" 563520 563540 563839 563932) (-353 "FF.spad" 562968 562984 563201 563294) (-352 "FFNBX.spad" 561480 561500 562684 562777) (-351 "FFNBP.spad" 559993 560010 561196 561289) (-350 "FFNB.spad" 558458 558479 559674 559767) (-349 "FFINTBAS.spad" 555872 555891 558448 558453) (-348 "FFIELDC.spad" 553447 553455 555774 555867) (-347 "FFIELDC.spad" 551108 551118 553437 553442) (-346 "FFHOM.spad" 549856 549873 551098 551103) (-345 "FFF.spad" 547291 547302 549846 549851) (-344 "FFCGX.spad" 546138 546158 547007 547100) (-343 "FFCGP.spad" 545027 545047 545854 545947) (-342 "FFCG.spad" 543819 543840 544708 544801) (-341 "FFCAT.spad" 536846 536868 543658 543814) (-340 "FFCAT.spad" 529952 529976 536766 536771) (-339 "FFCAT2.spad" 529697 529737 529942 529947) (-338 "FEXPR.spad" 521406 521452 529453 529492) (-337 "FEVALAB.spad" 521112 521122 521396 521401) (-336 "FEVALAB.spad" 520603 520615 520889 520894) (-335 "FDIV.spad" 520045 520069 520593 520598) (-334 "FDIVCAT.spad" 518087 518111 520035 520040) (-333 "FDIVCAT.spad" 516127 516153 518077 518082) (-332 "FDIV2.spad" 515781 515821 516117 516122) (-331 "FCPAK1.spad" 514334 514342 515771 515776) (-330 "FCOMP.spad" 513713 513723 514324 514329) (-329 "FC.spad" 503628 503636 513703 513708) (-328 "FAXF.spad" 496563 496577 503530 503623) (-327 "FAXF.spad" 489550 489566 496519 496524) (-326 "FARRAY.spad" 487696 487706 488733 488760) (-325 "FAMR.spad" 485816 485828 487594 487691) (-324 "FAMR.spad" 483920 483934 485700 485705) (-323 "FAMONOID.spad" 483570 483580 483874 483879) (-322 "FAMONC.spad" 481792 481804 483560 483565) (-321 "FAGROUP.spad" 481398 481408 481688 481715) (-320 "FACUTIL.spad" 479594 479611 481388 481393) (-319 "FACTFUNC.spad" 478770 478780 479584 479589) (-318 "EXPUPXS.spad" 475603 475626 476902 477051) (-317 "EXPRTUBE.spad" 472831 472839 475593 475598) (-316 "EXPRODE.spad" 469703 469719 472821 472826) (-315 "EXPR.spad" 464978 464988 465692 466099) (-314 "EXPR2UPS.spad" 461070 461083 464968 464973) (-313 "EXPR2.spad" 460773 460785 461060 461065) (-312 "EXPEXPAN.spad" 457711 457736 458345 458438) (-311 "EXIT.spad" 457382 457390 457701 457706) (-310 "EXITAST.spad" 457118 457126 457372 457377) (-309 "EVALCYC.spad" 456576 456590 457108 457113) (-308 "EVALAB.spad" 456140 456150 456566 456571) (-307 "EVALAB.spad" 455702 455714 456130 456135) (-306 "EUCDOM.spad" 453244 453252 455628 455697) (-305 "EUCDOM.spad" 450848 450858 453234 453239) (-304 "ESTOOLS.spad" 442688 442696 450838 450843) (-303 "ESTOOLS2.spad" 442289 442303 442678 442683) (-302 "ESTOOLS1.spad" 441974 441985 442279 442284) (-301 "ES.spad" 434521 434529 441964 441969) (-300 "ES.spad" 426974 426984 434419 434424) (-299 "ESCONT.spad" 423747 423755 426964 426969) (-298 "ESCONT1.spad" 423496 423508 423737 423742) (-297 "ES2.spad" 422991 423007 423486 423491) (-296 "ES1.spad" 422557 422573 422981 422986) (-295 "ERROR.spad" 419878 419886 422547 422552) (-294 "EQTBL.spad" 418350 418372 418559 418586) (-293 "EQ.spad" 413224 413234 416023 416135) (-292 "EQ2.spad" 412940 412952 413214 413219) (-291 "EP.spad" 409254 409264 412930 412935) (-290 "ENV.spad" 407956 407964 409244 409249) (-289 "ENTIRER.spad" 407624 407632 407900 407951) (-288 "EMR.spad" 406825 406866 407550 407619) (-287 "ELTAGG.spad" 405065 405084 406815 406820) (-286 "ELTAGG.spad" 403269 403290 405021 405026) (-285 "ELTAB.spad" 402716 402734 403259 403264) (-284 "ELFUTS.spad" 402095 402114 402706 402711) (-283 "ELEMFUN.spad" 401784 401792 402085 402090) (-282 "ELEMFUN.spad" 401471 401481 401774 401779) (-281 "ELAGG.spad" 399414 399424 401451 401466) (-280 "ELAGG.spad" 397294 397306 399333 399338) (-279 "ELABEXPR.spad" 396225 396233 397284 397289) (-278 "EFUPXS.spad" 393001 393031 396181 396186) (-277 "EFULS.spad" 389837 389860 392957 392962) (-276 "EFSTRUC.spad" 387792 387808 389827 389832) (-275 "EF.spad" 382558 382574 387782 387787) (-274 "EAB.spad" 380834 380842 382548 382553) (-273 "E04UCFA.spad" 380370 380378 380824 380829) (-272 "E04NAFA.spad" 379947 379955 380360 380365) (-271 "E04MBFA.spad" 379527 379535 379937 379942) (-270 "E04JAFA.spad" 379063 379071 379517 379522) (-269 "E04GCFA.spad" 378599 378607 379053 379058) (-268 "E04FDFA.spad" 378135 378143 378589 378594) (-267 "E04DGFA.spad" 377671 377679 378125 378130) (-266 "E04AGNT.spad" 373513 373521 377661 377666) (-265 "DVARCAT.spad" 370198 370208 373503 373508) (-264 "DVARCAT.spad" 366881 366893 370188 370193) (-263 "DSMP.spad" 364312 364326 364617 364744) (-262 "DROPT.spad" 358257 358265 364302 364307) (-261 "DROPT1.spad" 357920 357930 358247 358252) (-260 "DROPT0.spad" 352747 352755 357910 357915) (-259 "DRAWPT.spad" 350902 350910 352737 352742) (-258 "DRAW.spad" 343502 343515 350892 350897) (-257 "DRAWHACK.spad" 342810 342820 343492 343497) (-256 "DRAWCX.spad" 340252 340260 342800 342805) (-255 "DRAWCURV.spad" 339789 339804 340242 340247) (-254 "DRAWCFUN.spad" 328961 328969 339779 339784) (-253 "DQAGG.spad" 327129 327139 328929 328956) (-252 "DPOLCAT.spad" 322470 322486 326997 327124) (-251 "DPOLCAT.spad" 317897 317915 322426 322431) (-250 "DPMO.spad" 310123 310139 310261 310562) (-249 "DPMM.spad" 302362 302380 302487 302788) (-248 "DOMCTOR.spad" 302254 302262 302352 302357) (-247 "DOMAIN.spad" 301385 301393 302244 302249) (-246 "DMP.spad" 298607 298622 299179 299306) (-245 "DLP.spad" 297955 297965 298597 298602) (-244 "DLIST.spad" 296534 296544 297138 297165) (-243 "DLAGG.spad" 294945 294955 296524 296529) (-242 "DIVRING.spad" 294487 294495 294889 294940) (-241 "DIVRING.spad" 294073 294083 294477 294482) (-240 "DISPLAY.spad" 292253 292261 294063 294068) (-239 "DIRPROD.spad" 281833 281849 282473 282604) (-238 "DIRPROD2.spad" 280641 280659 281823 281828) (-237 "DIRPCAT.spad" 279583 279599 280505 280636) (-236 "DIRPCAT.spad" 278254 278272 279178 279183) (-235 "DIOSP.spad" 277079 277087 278244 278249) (-234 "DIOPS.spad" 276063 276073 277059 277074) (-233 "DIOPS.spad" 275021 275033 276019 276024) (-232 "DIFRING.spad" 274313 274321 275001 275016) (-231 "DIFRING.spad" 273613 273623 274303 274308) (-230 "DIFEXT.spad" 272772 272782 273593 273608) (-229 "DIFEXT.spad" 271848 271860 272671 272676) (-228 "DIAGG.spad" 271478 271488 271828 271843) (-227 "DIAGG.spad" 271116 271128 271468 271473) (-226 "DHMATRIX.spad" 269420 269430 270573 270600) (-225 "DFSFUN.spad" 262828 262836 269410 269415) (-224 "DFLOAT.spad" 259549 259557 262718 262823) (-223 "DFINTTLS.spad" 257758 257774 259539 259544) (-222 "DERHAM.spad" 255668 255700 257738 257753) (-221 "DEQUEUE.spad" 254986 254996 255275 255302) (-220 "DEGRED.spad" 254601 254615 254976 254981) (-219 "DEFINTRF.spad" 252126 252136 254591 254596) (-218 "DEFINTEF.spad" 250622 250638 252116 252121) (-217 "DEFAST.spad" 249990 249998 250612 250617) (-216 "DECIMAL.spad" 248096 248104 248457 248550) (-215 "DDFACT.spad" 245895 245912 248086 248091) (-214 "DBLRESP.spad" 245493 245517 245885 245890) (-213 "DBASE.spad" 244147 244157 245483 245488) (-212 "DATAARY.spad" 243609 243622 244137 244142) (-211 "D03FAFA.spad" 243437 243445 243599 243604) (-210 "D03EEFA.spad" 243257 243265 243427 243432) (-209 "D03AGNT.spad" 242337 242345 243247 243252) (-208 "D02EJFA.spad" 241799 241807 242327 242332) (-207 "D02CJFA.spad" 241277 241285 241789 241794) (-206 "D02BHFA.spad" 240767 240775 241267 241272) (-205 "D02BBFA.spad" 240257 240265 240757 240762) (-204 "D02AGNT.spad" 235061 235069 240247 240252) (-203 "D01WGTS.spad" 233380 233388 235051 235056) (-202 "D01TRNS.spad" 233357 233365 233370 233375) (-201 "D01GBFA.spad" 232879 232887 233347 233352) (-200 "D01FCFA.spad" 232401 232409 232869 232874) (-199 "D01ASFA.spad" 231869 231877 232391 232396) (-198 "D01AQFA.spad" 231315 231323 231859 231864) (-197 "D01APFA.spad" 230739 230747 231305 231310) (-196 "D01ANFA.spad" 230233 230241 230729 230734) (-195 "D01AMFA.spad" 229743 229751 230223 230228) (-194 "D01ALFA.spad" 229283 229291 229733 229738) (-193 "D01AKFA.spad" 228809 228817 229273 229278) (-192 "D01AJFA.spad" 228332 228340 228799 228804) (-191 "D01AGNT.spad" 224391 224399 228322 228327) (-190 "CYCLOTOM.spad" 223897 223905 224381 224386) (-189 "CYCLES.spad" 220729 220737 223887 223892) (-188 "CVMP.spad" 220146 220156 220719 220724) (-187 "CTRIGMNP.spad" 218636 218652 220136 220141) (-186 "CTOR.spad" 218536 218544 218626 218631) (-185 "CTORKIND.spad" 218139 218147 218526 218531) (-184 "CTORCAT.spad" 217594 217602 218129 218134) (-183 "CTORCAT.spad" 217047 217057 217584 217589) (-182 "CTORCALL.spad" 216627 216635 217037 217042) (-181 "CSTTOOLS.spad" 215870 215883 216617 216622) (-180 "CRFP.spad" 209574 209587 215860 215865) (-179 "CRCEAST.spad" 209294 209302 209564 209569) (-178 "CRAPACK.spad" 208337 208347 209284 209289) (-177 "CPMATCH.spad" 207837 207852 208262 208267) (-176 "CPIMA.spad" 207542 207561 207827 207832) (-175 "COORDSYS.spad" 202435 202445 207532 207537) (-174 "CONTOUR.spad" 201837 201845 202425 202430) (-173 "CONTFRAC.spad" 197449 197459 201739 201832) (-172 "CONDUIT.spad" 197207 197215 197439 197444) (-171 "COMRING.spad" 196881 196889 197145 197202) (-170 "COMPPROP.spad" 196395 196403 196871 196876) (-169 "COMPLPAT.spad" 196162 196177 196385 196390) (-168 "COMPLEX.spad" 190198 190208 190442 190691) (-167 "COMPLEX2.spad" 189911 189923 190188 190193) (-166 "COMPFACT.spad" 189513 189527 189901 189906) (-165 "COMPCAT.spad" 187651 187661 189259 189508) (-164 "COMPCAT.spad" 185470 185482 187080 187085) (-163 "COMMUPC.spad" 185216 185234 185460 185465) (-162 "COMMONOP.spad" 184749 184757 185206 185211) (-161 "COMM.spad" 184558 184566 184739 184744) (-160 "COMMAAST.spad" 184321 184329 184548 184553) (-159 "COMBOPC.spad" 183226 183234 184311 184316) (-158 "COMBINAT.spad" 181971 181981 183216 183221) (-157 "COMBF.spad" 179339 179355 181961 181966) (-156 "COLOR.spad" 178176 178184 179329 179334) (-155 "COLONAST.spad" 177842 177850 178166 178171) (-154 "CMPLXRT.spad" 177551 177568 177832 177837) (-153 "CLLCTAST.spad" 177213 177221 177541 177546) (-152 "CLIP.spad" 173305 173313 177203 177208) (-151 "CLIF.spad" 171944 171960 173261 173300) (-150 "CLAGG.spad" 168429 168439 171934 171939) (-149 "CLAGG.spad" 164785 164797 168292 168297) (-148 "CINTSLPE.spad" 164110 164123 164775 164780) (-147 "CHVAR.spad" 162188 162210 164100 164105) (-146 "CHARZ.spad" 162103 162111 162168 162183) (-145 "CHARPOL.spad" 161611 161621 162093 162098) (-144 "CHARNZ.spad" 161364 161372 161591 161606) (-143 "CHAR.spad" 159232 159240 161354 161359) (-142 "CFCAT.spad" 158548 158556 159222 159227) (-141 "CDEN.spad" 157706 157720 158538 158543) (-140 "CCLASS.spad" 155855 155863 157117 157156) (-139 "CATEGORY.spad" 154945 154953 155845 155850) (-138 "CATCTOR.spad" 154836 154844 154935 154940) (-137 "CATAST.spad" 154463 154471 154826 154831) (-136 "CASEAST.spad" 154177 154185 154453 154458) (-135 "CARTEN.spad" 149280 149304 154167 154172) (-134 "CARTEN2.spad" 148666 148693 149270 149275) (-133 "CARD.spad" 145955 145963 148640 148661) (-132 "CAPSLAST.spad" 145729 145737 145945 145950) (-131 "CACHSET.spad" 145351 145359 145719 145724) (-130 "CABMON.spad" 144904 144912 145341 145346) (-129 "BYTE.spad" 144325 144333 144894 144899) (-128 "BYTEBUF.spad" 142157 142165 143494 143521) (-127 "BTREE.spad" 141226 141236 141764 141791) (-126 "BTOURN.spad" 140229 140239 140833 140860) (-125 "BTCAT.spad" 139617 139627 140197 140224) (-124 "BTCAT.spad" 139025 139037 139607 139612) (-123 "BTAGG.spad" 138147 138155 138993 139020) (-122 "BTAGG.spad" 137289 137299 138137 138142) (-121 "BSTREE.spad" 136024 136034 136896 136923) (-120 "BRILL.spad" 134219 134230 136014 136019) (-119 "BRAGG.spad" 133143 133153 134209 134214) (-118 "BRAGG.spad" 132031 132043 133099 133104) (-117 "BPADICRT.spad" 130012 130024 130267 130360) (-116 "BPADIC.spad" 129676 129688 129938 130007) (-115 "BOUNDZRO.spad" 129332 129349 129666 129671) (-114 "BOP.spad" 124796 124804 129322 129327) (-113 "BOP1.spad" 122182 122192 124752 124757) (-112 "BOOLEAN.spad" 121506 121514 122172 122177) (-111 "BMODULE.spad" 121218 121230 121474 121501) (-110 "BITS.spad" 120637 120645 120854 120881) (-109 "BINDING.spad" 120056 120064 120627 120632) (-108 "BINARY.spad" 118167 118175 118523 118616) (-107 "BGAGG.spad" 117364 117374 118147 118162) (-106 "BGAGG.spad" 116569 116581 117354 117359) (-105 "BFUNCT.spad" 116133 116141 116549 116564) (-104 "BEZOUT.spad" 115267 115294 116083 116088) (-103 "BBTREE.spad" 112086 112096 114874 114901) (-102 "BASTYPE.spad" 111758 111766 112076 112081) (-101 "BASTYPE.spad" 111428 111438 111748 111753) (-100 "BALFACT.spad" 110867 110880 111418 111423) (-99 "AUTOMOR.spad" 110314 110323 110847 110862) (-98 "ATTREG.spad" 107033 107040 110066 110309) (-97 "ATTRBUT.spad" 103056 103063 107013 107028) (-96 "ATTRAST.spad" 102773 102780 103046 103051) (-95 "ATRIG.spad" 102243 102250 102763 102768) (-94 "ATRIG.spad" 101711 101720 102233 102238) (-93 "ASTCAT.spad" 101615 101622 101701 101706) (-92 "ASTCAT.spad" 101517 101526 101605 101610) (-91 "ASTACK.spad" 100850 100859 101124 101151) (-90 "ASSOCEQ.spad" 99650 99661 100806 100811) (-89 "ASP9.spad" 98731 98744 99640 99645) (-88 "ASP8.spad" 97774 97787 98721 98726) (-87 "ASP80.spad" 97096 97109 97764 97769) (-86 "ASP7.spad" 96256 96269 97086 97091) (-85 "ASP78.spad" 95707 95720 96246 96251) (-84 "ASP77.spad" 95076 95089 95697 95702) (-83 "ASP74.spad" 94168 94181 95066 95071) (-82 "ASP73.spad" 93439 93452 94158 94163) (-81 "ASP6.spad" 92306 92319 93429 93434) (-80 "ASP55.spad" 90815 90828 92296 92301) (-79 "ASP50.spad" 88632 88645 90805 90810) (-78 "ASP4.spad" 87927 87940 88622 88627) (-77 "ASP49.spad" 86926 86939 87917 87922) (-76 "ASP42.spad" 85333 85372 86916 86921) (-75 "ASP41.spad" 83912 83951 85323 85328) (-74 "ASP35.spad" 82900 82913 83902 83907) (-73 "ASP34.spad" 82201 82214 82890 82895) (-72 "ASP33.spad" 81761 81774 82191 82196) (-71 "ASP31.spad" 80901 80914 81751 81756) (-70 "ASP30.spad" 79793 79806 80891 80896) (-69 "ASP29.spad" 79259 79272 79783 79788) (-68 "ASP28.spad" 70532 70545 79249 79254) (-67 "ASP27.spad" 69429 69442 70522 70527) (-66 "ASP24.spad" 68516 68529 69419 69424) (-65 "ASP20.spad" 67980 67993 68506 68511) (-64 "ASP1.spad" 67361 67374 67970 67975) (-63 "ASP19.spad" 62047 62060 67351 67356) (-62 "ASP12.spad" 61461 61474 62037 62042) (-61 "ASP10.spad" 60732 60745 61451 61456) (-60 "ARRAY2.spad" 60092 60101 60339 60366) (-59 "ARRAY1.spad" 58927 58936 59275 59302) (-58 "ARRAY12.spad" 57596 57607 58917 58922) (-57 "ARR2CAT.spad" 53258 53279 57564 57591) (-56 "ARR2CAT.spad" 48940 48963 53248 53253) (-55 "ARITY.spad" 48508 48515 48930 48935) (-54 "APPRULE.spad" 47752 47774 48498 48503) (-53 "APPLYORE.spad" 47367 47380 47742 47747) (-52 "ANY.spad" 45709 45716 47357 47362) (-51 "ANY1.spad" 44780 44789 45699 45704) (-50 "ANTISYM.spad" 43219 43235 44760 44775) (-49 "ANON.spad" 42916 42923 43209 43214) (-48 "AN.spad" 41217 41224 42732 42825) (-47 "AMR.spad" 39396 39407 41115 41212) (-46 "AMR.spad" 37412 37425 39133 39138) (-45 "ALIST.spad" 34824 34845 35174 35201) (-44 "ALGSC.spad" 33947 33973 34696 34749) (-43 "ALGPKG.spad" 29656 29667 33903 33908) (-42 "ALGMFACT.spad" 28845 28859 29646 29651) (-41 "ALGMANIP.spad" 26265 26280 28642 28647) (-40 "ALGFF.spad" 24580 24607 24797 24953) (-39 "ALGFACT.spad" 23701 23711 24570 24575) (-38 "ALGEBRA.spad" 23534 23543 23657 23696) (-37 "ALGEBRA.spad" 23399 23410 23524 23529) (-36 "ALAGG.spad" 22909 22930 23367 23394) (-35 "AHYP.spad" 22290 22297 22899 22904) (-34 "AGG.spad" 20599 20606 22280 22285) (-33 "AGG.spad" 18872 18881 20555 20560) (-32 "AF.spad" 17297 17312 18807 18812) (-31 "ADDAST.spad" 16975 16982 17287 17292) (-30 "ACPLOT.spad" 15546 15553 16965 16970) (-29 "ACFS.spad" 13297 13306 15448 15541) (-28 "ACFS.spad" 11134 11145 13287 13292) (-27 "ACF.spad" 7736 7743 11036 11129) (-26 "ACF.spad" 4424 4433 7726 7731) (-25 "ABELSG.spad" 3965 3972 4414 4419) (-24 "ABELSG.spad" 3504 3513 3955 3960) (-23 "ABELMON.spad" 3047 3054 3494 3499) (-22 "ABELMON.spad" 2588 2597 3037 3042) (-21 "ABELGRP.spad" 2160 2167 2578 2583) (-20 "ABELGRP.spad" 1730 1739 2150 2155) (-19 "A1AGG.spad" 870 879 1698 1725) (-18 "A1AGG.spad" 30 41 860 865)) 
\ No newline at end of file
+((-3 NIL 2276360 2276365 2276370 2276375) (-2 NIL 2276340 2276345 2276350 2276355) (-1 NIL 2276320 2276325 2276330 2276335) (0 NIL 2276300 2276305 2276310 2276315) (-1274 "ZMOD.spad" 2276109 2276122 2276238 2276295) (-1273 "ZLINDEP.spad" 2275153 2275164 2276099 2276104) (-1272 "ZDSOLVE.spad" 2265002 2265024 2275143 2275148) (-1271 "YSTREAM.spad" 2264495 2264506 2264992 2264997) (-1270 "XRPOLY.spad" 2263715 2263735 2264351 2264420) (-1269 "XPR.spad" 2261506 2261519 2263433 2263532) (-1268 "XPOLY.spad" 2261061 2261072 2261362 2261431) (-1267 "XPOLYC.spad" 2260378 2260394 2260987 2261056) (-1266 "XPBWPOLY.spad" 2258815 2258835 2260158 2260227) (-1265 "XF.spad" 2257276 2257291 2258717 2258810) (-1264 "XF.spad" 2255717 2255734 2257160 2257165) (-1263 "XFALG.spad" 2252741 2252757 2255643 2255712) (-1262 "XEXPPKG.spad" 2251992 2252018 2252731 2252736) (-1261 "XDPOLY.spad" 2251606 2251622 2251848 2251917) (-1260 "XALG.spad" 2251266 2251277 2251562 2251601) (-1259 "WUTSET.spad" 2247105 2247122 2250912 2250939) (-1258 "WP.spad" 2246304 2246348 2246963 2247030) (-1257 "WHILEAST.spad" 2246102 2246111 2246294 2246299) (-1256 "WHEREAST.spad" 2245773 2245782 2246092 2246097) (-1255 "WFFINTBS.spad" 2243336 2243358 2245763 2245768) (-1254 "WEIER.spad" 2241550 2241561 2243326 2243331) (-1253 "VSPACE.spad" 2241223 2241234 2241518 2241545) (-1252 "VSPACE.spad" 2240916 2240929 2241213 2241218) (-1251 "VOID.spad" 2240593 2240602 2240906 2240911) (-1250 "VIEW.spad" 2238215 2238224 2240583 2240588) (-1249 "VIEWDEF.spad" 2233412 2233421 2238205 2238210) (-1248 "VIEW3D.spad" 2217247 2217256 2233402 2233407) (-1247 "VIEW2D.spad" 2204984 2204993 2217237 2217242) (-1246 "VECTOR.spad" 2203659 2203670 2203910 2203937) (-1245 "VECTOR2.spad" 2202286 2202299 2203649 2203654) (-1244 "VECTCAT.spad" 2200186 2200197 2202254 2202281) (-1243 "VECTCAT.spad" 2197894 2197907 2199964 2199969) (-1242 "VARIABLE.spad" 2197674 2197689 2197884 2197889) (-1241 "UTYPE.spad" 2197318 2197327 2197664 2197669) (-1240 "UTSODETL.spad" 2196611 2196635 2197274 2197279) (-1239 "UTSODE.spad" 2194799 2194819 2196601 2196606) (-1238 "UTS.spad" 2189588 2189616 2193266 2193363) (-1237 "UTSCAT.spad" 2187039 2187055 2189486 2189583) (-1236 "UTSCAT.spad" 2184134 2184152 2186583 2186588) (-1235 "UTS2.spad" 2183727 2183762 2184124 2184129) (-1234 "URAGG.spad" 2178359 2178370 2183717 2183722) (-1233 "URAGG.spad" 2172955 2172968 2178315 2178320) (-1232 "UPXSSING.spad" 2170598 2170624 2172036 2172169) (-1231 "UPXS.spad" 2167746 2167774 2168730 2168879) (-1230 "UPXSCONS.spad" 2165503 2165523 2165878 2166027) (-1229 "UPXSCCA.spad" 2164068 2164088 2165349 2165498) (-1228 "UPXSCCA.spad" 2162775 2162797 2164058 2164063) (-1227 "UPXSCAT.spad" 2161356 2161372 2162621 2162770) (-1226 "UPXS2.spad" 2160897 2160950 2161346 2161351) (-1225 "UPSQFREE.spad" 2159309 2159323 2160887 2160892) (-1224 "UPSCAT.spad" 2156902 2156926 2159207 2159304) (-1223 "UPSCAT.spad" 2154201 2154227 2156508 2156513) (-1222 "UPOLYC.spad" 2149179 2149190 2154043 2154196) (-1221 "UPOLYC.spad" 2144049 2144062 2148915 2148920) (-1220 "UPOLYC2.spad" 2143518 2143537 2144039 2144044) (-1219 "UP.spad" 2140675 2140690 2141068 2141221) (-1218 "UPMP.spad" 2139565 2139578 2140665 2140670) (-1217 "UPDIVP.spad" 2139128 2139142 2139555 2139560) (-1216 "UPDECOMP.spad" 2137365 2137379 2139118 2139123) (-1215 "UPCDEN.spad" 2136572 2136588 2137355 2137360) (-1214 "UP2.spad" 2135934 2135955 2136562 2136567) (-1213 "UNISEG.spad" 2135287 2135298 2135853 2135858) (-1212 "UNISEG2.spad" 2134780 2134793 2135243 2135248) (-1211 "UNIFACT.spad" 2133881 2133893 2134770 2134775) (-1210 "ULS.spad" 2124433 2124461 2125526 2125955) (-1209 "ULSCONS.spad" 2116827 2116847 2117199 2117348) (-1208 "ULSCCAT.spad" 2114556 2114576 2116673 2116822) (-1207 "ULSCCAT.spad" 2112393 2112415 2114512 2114517) (-1206 "ULSCAT.spad" 2110609 2110625 2112239 2112388) (-1205 "ULS2.spad" 2110121 2110174 2110599 2110604) (-1204 "UFD.spad" 2109186 2109195 2110047 2110116) (-1203 "UFD.spad" 2108313 2108324 2109176 2109181) (-1202 "UDVO.spad" 2107160 2107169 2108303 2108308) (-1201 "UDPO.spad" 2104587 2104598 2107116 2107121) (-1200 "TYPE.spad" 2104519 2104528 2104577 2104582) (-1199 "TYPEAST.spad" 2104438 2104447 2104509 2104514) (-1198 "TWOFACT.spad" 2103088 2103103 2104428 2104433) (-1197 "TUPLE.spad" 2102572 2102583 2102987 2102992) (-1196 "TUBETOOL.spad" 2099409 2099418 2102562 2102567) (-1195 "TUBE.spad" 2098050 2098067 2099399 2099404) (-1194 "TS.spad" 2096639 2096655 2097615 2097712) (-1193 "TSETCAT.spad" 2083766 2083783 2096607 2096634) (-1192 "TSETCAT.spad" 2070879 2070898 2083722 2083727) (-1191 "TRMANIP.spad" 2065245 2065262 2070585 2070590) (-1190 "TRIMAT.spad" 2064204 2064229 2065235 2065240) (-1189 "TRIGMNIP.spad" 2062721 2062738 2064194 2064199) (-1188 "TRIGCAT.spad" 2062233 2062242 2062711 2062716) (-1187 "TRIGCAT.spad" 2061743 2061754 2062223 2062228) (-1186 "TREE.spad" 2060314 2060325 2061350 2061377) (-1185 "TRANFUN.spad" 2060145 2060154 2060304 2060309) (-1184 "TRANFUN.spad" 2059974 2059985 2060135 2060140) (-1183 "TOPSP.spad" 2059648 2059657 2059964 2059969) (-1182 "TOOLSIGN.spad" 2059311 2059322 2059638 2059643) (-1181 "TEXTFILE.spad" 2057868 2057877 2059301 2059306) (-1180 "TEX.spad" 2055000 2055009 2057858 2057863) (-1179 "TEX1.spad" 2054556 2054567 2054990 2054995) (-1178 "TEMUTL.spad" 2054111 2054120 2054546 2054551) (-1177 "TBCMPPK.spad" 2052204 2052227 2054101 2054106) (-1176 "TBAGG.spad" 2051240 2051263 2052184 2052199) (-1175 "TBAGG.spad" 2050284 2050309 2051230 2051235) (-1174 "TANEXP.spad" 2049660 2049671 2050274 2050279) (-1173 "TABLE.spad" 2048071 2048094 2048341 2048368) (-1172 "TABLEAU.spad" 2047552 2047563 2048061 2048066) (-1171 "TABLBUMP.spad" 2044335 2044346 2047542 2047547) (-1170 "SYSTEM.spad" 2043609 2043618 2044325 2044330) (-1169 "SYSSOLP.spad" 2041082 2041093 2043599 2043604) (-1168 "SYNTAX.spad" 2037352 2037361 2041072 2041077) (-1167 "SYMTAB.spad" 2035408 2035417 2037342 2037347) (-1166 "SYMS.spad" 2031393 2031402 2035398 2035403) (-1165 "SYMPOLY.spad" 2030400 2030411 2030482 2030609) (-1164 "SYMFUNC.spad" 2029875 2029886 2030390 2030395) (-1163 "SYMBOL.spad" 2027302 2027311 2029865 2029870) (-1162 "SWITCH.spad" 2024059 2024068 2027292 2027297) (-1161 "SUTS.spad" 2020958 2020986 2022526 2022623) (-1160 "SUPXS.spad" 2018093 2018121 2019090 2019239) (-1159 "SUP.spad" 2014862 2014873 2015643 2015796) (-1158 "SUPFRACF.spad" 2013967 2013985 2014852 2014857) (-1157 "SUP2.spad" 2013357 2013370 2013957 2013962) (-1156 "SUMRF.spad" 2012323 2012334 2013347 2013352) (-1155 "SUMFS.spad" 2011956 2011973 2012313 2012318) (-1154 "SULS.spad" 2002495 2002523 2003601 2004030) (-1153 "SUCHTAST.spad" 2002264 2002273 2002485 2002490) (-1152 "SUCH.spad" 2001944 2001959 2002254 2002259) (-1151 "SUBSPACE.spad" 1993951 1993966 2001934 2001939) (-1150 "SUBRESP.spad" 1993111 1993125 1993907 1993912) (-1149 "STTF.spad" 1989210 1989226 1993101 1993106) (-1148 "STTFNC.spad" 1985678 1985694 1989200 1989205) (-1147 "STTAYLOR.spad" 1978076 1978087 1985559 1985564) (-1146 "STRTBL.spad" 1976581 1976598 1976730 1976757) (-1145 "STRING.spad" 1975990 1975999 1976004 1976031) (-1144 "STRICAT.spad" 1975778 1975787 1975958 1975985) (-1143 "STREAM.spad" 1972636 1972647 1975303 1975318) (-1142 "STREAM3.spad" 1972181 1972196 1972626 1972631) (-1141 "STREAM2.spad" 1971249 1971262 1972171 1972176) (-1140 "STREAM1.spad" 1970953 1970964 1971239 1971244) (-1139 "STINPROD.spad" 1969859 1969875 1970943 1970948) (-1138 "STEP.spad" 1969060 1969069 1969849 1969854) (-1137 "STBL.spad" 1967586 1967614 1967753 1967768) (-1136 "STAGG.spad" 1966661 1966672 1967576 1967581) (-1135 "STAGG.spad" 1965734 1965747 1966651 1966656) (-1134 "STACK.spad" 1965085 1965096 1965341 1965368) (-1133 "SREGSET.spad" 1962789 1962806 1964731 1964758) (-1132 "SRDCMPK.spad" 1961334 1961354 1962779 1962784) (-1131 "SRAGG.spad" 1956431 1956440 1961302 1961329) (-1130 "SRAGG.spad" 1951548 1951559 1956421 1956426) (-1129 "SQMATRIX.spad" 1949164 1949182 1950080 1950167) (-1128 "SPLTREE.spad" 1943716 1943729 1948600 1948627) (-1127 "SPLNODE.spad" 1940304 1940317 1943706 1943711) (-1126 "SPFCAT.spad" 1939081 1939090 1940294 1940299) (-1125 "SPECOUT.spad" 1937631 1937640 1939071 1939076) (-1124 "SPADXPT.spad" 1929770 1929779 1937621 1937626) (-1123 "spad-parser.spad" 1929235 1929244 1929760 1929765) (-1122 "SPADAST.spad" 1928936 1928945 1929225 1929230) (-1121 "SPACEC.spad" 1912949 1912960 1928926 1928931) (-1120 "SPACE3.spad" 1912725 1912736 1912939 1912944) (-1119 "SORTPAK.spad" 1912270 1912283 1912681 1912686) (-1118 "SOLVETRA.spad" 1910027 1910038 1912260 1912265) (-1117 "SOLVESER.spad" 1908547 1908558 1910017 1910022) (-1116 "SOLVERAD.spad" 1904557 1904568 1908537 1908542) (-1115 "SOLVEFOR.spad" 1902977 1902995 1904547 1904552) (-1114 "SNTSCAT.spad" 1902577 1902594 1902945 1902972) (-1113 "SMTS.spad" 1900837 1900863 1902142 1902239) (-1112 "SMP.spad" 1898276 1898296 1898666 1898793) (-1111 "SMITH.spad" 1897119 1897144 1898266 1898271) (-1110 "SMATCAT.spad" 1895229 1895259 1897063 1897114) (-1109 "SMATCAT.spad" 1893271 1893303 1895107 1895112) (-1108 "SKAGG.spad" 1892232 1892243 1893239 1893266) (-1107 "SINT.spad" 1891058 1891067 1892098 1892227) (-1106 "SIMPAN.spad" 1890786 1890795 1891048 1891053) (-1105 "SIG.spad" 1890114 1890123 1890776 1890781) (-1104 "SIGNRF.spad" 1889222 1889233 1890104 1890109) (-1103 "SIGNEF.spad" 1888491 1888508 1889212 1889217) (-1102 "SIGAST.spad" 1887872 1887881 1888481 1888486) (-1101 "SHP.spad" 1885790 1885805 1887828 1887833) (-1100 "SHDP.spad" 1875501 1875528 1876010 1876141) (-1099 "SGROUP.spad" 1875109 1875118 1875491 1875496) (-1098 "SGROUP.spad" 1874715 1874726 1875099 1875104) (-1097 "SGCF.spad" 1867596 1867605 1874705 1874710) (-1096 "SFRTCAT.spad" 1866524 1866541 1867564 1867591) (-1095 "SFRGCD.spad" 1865587 1865607 1866514 1866519) (-1094 "SFQCMPK.spad" 1860224 1860244 1865577 1865582) (-1093 "SFORT.spad" 1859659 1859673 1860214 1860219) (-1092 "SEXOF.spad" 1859502 1859542 1859649 1859654) (-1091 "SEX.spad" 1859394 1859403 1859492 1859497) (-1090 "SEXCAT.spad" 1856945 1856985 1859384 1859389) (-1089 "SET.spad" 1855245 1855256 1856366 1856405) (-1088 "SETMN.spad" 1853679 1853696 1855235 1855240) (-1087 "SETCAT.spad" 1853164 1853173 1853669 1853674) (-1086 "SETCAT.spad" 1852647 1852658 1853154 1853159) (-1085 "SETAGG.spad" 1849168 1849179 1852627 1852642) (-1084 "SETAGG.spad" 1845697 1845710 1849158 1849163) (-1083 "SEQAST.spad" 1845400 1845409 1845687 1845692) (-1082 "SEGXCAT.spad" 1844522 1844535 1845390 1845395) (-1081 "SEG.spad" 1844335 1844346 1844441 1844446) (-1080 "SEGCAT.spad" 1843242 1843253 1844325 1844330) (-1079 "SEGBIND.spad" 1842314 1842325 1843197 1843202) (-1078 "SEGBIND2.spad" 1842010 1842023 1842304 1842309) (-1077 "SEGAST.spad" 1841724 1841733 1842000 1842005) (-1076 "SEG2.spad" 1841149 1841162 1841680 1841685) (-1075 "SDVAR.spad" 1840425 1840436 1841139 1841144) (-1074 "SDPOL.spad" 1837815 1837826 1838106 1838233) (-1073 "SCPKG.spad" 1835894 1835905 1837805 1837810) (-1072 "SCOPE.spad" 1835039 1835048 1835884 1835889) (-1071 "SCACHE.spad" 1833721 1833732 1835029 1835034) (-1070 "SASTCAT.spad" 1833630 1833639 1833711 1833716) (-1069 "SAOS.spad" 1833502 1833511 1833620 1833625) (-1068 "SAERFFC.spad" 1833215 1833235 1833492 1833497) (-1067 "SAE.spad" 1831390 1831406 1832001 1832136) (-1066 "SAEFACT.spad" 1831091 1831111 1831380 1831385) (-1065 "RURPK.spad" 1828732 1828748 1831081 1831086) (-1064 "RULESET.spad" 1828173 1828197 1828722 1828727) (-1063 "RULE.spad" 1826377 1826401 1828163 1828168) (-1062 "RULECOLD.spad" 1826229 1826242 1826367 1826372) (-1061 "RSTRCAST.spad" 1825946 1825955 1826219 1826224) (-1060 "RSETGCD.spad" 1822324 1822344 1825936 1825941) (-1059 "RSETCAT.spad" 1812108 1812125 1822292 1822319) (-1058 "RSETCAT.spad" 1801912 1801931 1812098 1812103) (-1057 "RSDCMPK.spad" 1800364 1800384 1801902 1801907) (-1056 "RRCC.spad" 1798748 1798778 1800354 1800359) (-1055 "RRCC.spad" 1797130 1797162 1798738 1798743) (-1054 "RPTAST.spad" 1796832 1796841 1797120 1797125) (-1053 "RPOLCAT.spad" 1776192 1776207 1796700 1796827) (-1052 "RPOLCAT.spad" 1755266 1755283 1775776 1775781) (-1051 "ROUTINE.spad" 1751129 1751138 1753913 1753940) (-1050 "ROMAN.spad" 1750457 1750466 1750995 1751124) (-1049 "ROIRC.spad" 1749537 1749569 1750447 1750452) (-1048 "RNS.spad" 1748440 1748449 1749439 1749532) (-1047 "RNS.spad" 1747429 1747440 1748430 1748435) (-1046 "RNG.spad" 1747164 1747173 1747419 1747424) (-1045 "RMODULE.spad" 1746802 1746813 1747154 1747159) (-1044 "RMCAT2.spad" 1746210 1746267 1746792 1746797) (-1043 "RMATRIX.spad" 1745034 1745053 1745377 1745416) (-1042 "RMATCAT.spad" 1740567 1740598 1744990 1745029) (-1041 "RMATCAT.spad" 1735990 1736023 1740415 1740420) (-1040 "RINTERP.spad" 1735878 1735898 1735980 1735985) (-1039 "RING.spad" 1735348 1735357 1735858 1735873) (-1038 "RING.spad" 1734826 1734837 1735338 1735343) (-1037 "RIDIST.spad" 1734210 1734219 1734816 1734821) (-1036 "RGCHAIN.spad" 1732789 1732805 1733695 1733722) (-1035 "RGBCSPC.spad" 1732570 1732582 1732779 1732784) (-1034 "RGBCMDL.spad" 1732100 1732112 1732560 1732565) (-1033 "RF.spad" 1729714 1729725 1732090 1732095) (-1032 "RFFACTOR.spad" 1729176 1729187 1729704 1729709) (-1031 "RFFACT.spad" 1728911 1728923 1729166 1729171) (-1030 "RFDIST.spad" 1727899 1727908 1728901 1728906) (-1029 "RETSOL.spad" 1727316 1727329 1727889 1727894) (-1028 "RETRACT.spad" 1726744 1726755 1727306 1727311) (-1027 "RETRACT.spad" 1726170 1726183 1726734 1726739) (-1026 "RETAST.spad" 1725982 1725991 1726160 1726165) (-1025 "RESULT.spad" 1724042 1724051 1724629 1724656) (-1024 "RESRING.spad" 1723389 1723436 1723980 1724037) (-1023 "RESLATC.spad" 1722713 1722724 1723379 1723384) (-1022 "REPSQ.spad" 1722442 1722453 1722703 1722708) (-1021 "REP.spad" 1719994 1720003 1722432 1722437) (-1020 "REPDB.spad" 1719699 1719710 1719984 1719989) (-1019 "REP2.spad" 1709271 1709282 1719541 1719546) (-1018 "REP1.spad" 1703261 1703272 1709221 1709226) (-1017 "REGSET.spad" 1701058 1701075 1702907 1702934) (-1016 "REF.spad" 1700387 1700398 1701013 1701018) (-1015 "REDORDER.spad" 1699563 1699580 1700377 1700382) (-1014 "RECLOS.spad" 1698346 1698366 1699050 1699143) (-1013 "REALSOLV.spad" 1697478 1697487 1698336 1698341) (-1012 "REAL.spad" 1697350 1697359 1697468 1697473) (-1011 "REAL0Q.spad" 1694632 1694647 1697340 1697345) (-1010 "REAL0.spad" 1691460 1691475 1694622 1694627) (-1009 "RDUCEAST.spad" 1691181 1691190 1691450 1691455) (-1008 "RDIV.spad" 1690832 1690857 1691171 1691176) (-1007 "RDIST.spad" 1690395 1690406 1690822 1690827) (-1006 "RDETRS.spad" 1689191 1689209 1690385 1690390) (-1005 "RDETR.spad" 1687298 1687316 1689181 1689186) (-1004 "RDEEFS.spad" 1686371 1686388 1687288 1687293) (-1003 "RDEEF.spad" 1685367 1685384 1686361 1686366) (-1002 "RCFIELD.spad" 1682553 1682562 1685269 1685362) (-1001 "RCFIELD.spad" 1679825 1679836 1682543 1682548) (-1000 "RCAGG.spad" 1677737 1677748 1679815 1679820) (-999 "RCAGG.spad" 1675577 1675589 1677656 1677661) (-998 "RATRET.spad" 1674938 1674948 1675567 1675572) (-997 "RATFACT.spad" 1674631 1674642 1674928 1674933) (-996 "RANDSRC.spad" 1673951 1673959 1674621 1674626) (-995 "RADUTIL.spad" 1673706 1673714 1673941 1673946) (-994 "RADIX.spad" 1670608 1670621 1672173 1672266) (-993 "RADFF.spad" 1669022 1669058 1669140 1669296) (-992 "RADCAT.spad" 1668616 1668624 1669012 1669017) (-991 "RADCAT.spad" 1668208 1668218 1668606 1668611) (-990 "QUEUE.spad" 1667551 1667561 1667815 1667842) (-989 "QUAT.spad" 1666133 1666143 1666475 1666540) (-988 "QUATCT2.spad" 1665752 1665770 1666123 1666128) (-987 "QUATCAT.spad" 1663917 1663927 1665682 1665747) (-986 "QUATCAT.spad" 1661833 1661845 1663600 1663605) (-985 "QUAGG.spad" 1660659 1660669 1661801 1661828) (-984 "QQUTAST.spad" 1660428 1660436 1660649 1660654) (-983 "QFORM.spad" 1659891 1659905 1660418 1660423) (-982 "QFCAT.spad" 1658594 1658604 1659793 1659886) (-981 "QFCAT.spad" 1656888 1656900 1658089 1658094) (-980 "QFCAT2.spad" 1656579 1656595 1656878 1656883) (-979 "QEQUAT.spad" 1656136 1656144 1656569 1656574) (-978 "QCMPACK.spad" 1650883 1650902 1656126 1656131) (-977 "QALGSET.spad" 1646958 1646990 1650797 1650802) (-976 "QALGSET2.spad" 1644954 1644972 1646948 1646953) (-975 "PWFFINTB.spad" 1642264 1642285 1644944 1644949) (-974 "PUSHVAR.spad" 1641593 1641612 1642254 1642259) (-973 "PTRANFN.spad" 1637719 1637729 1641583 1641588) (-972 "PTPACK.spad" 1634807 1634817 1637709 1637714) (-971 "PTFUNC2.spad" 1634628 1634642 1634797 1634802) (-970 "PTCAT.spad" 1633877 1633887 1634596 1634623) (-969 "PSQFR.spad" 1633184 1633208 1633867 1633872) (-968 "PSEUDLIN.spad" 1632042 1632052 1633174 1633179) (-967 "PSETPK.spad" 1617475 1617491 1631920 1631925) (-966 "PSETCAT.spad" 1611395 1611418 1617455 1617470) (-965 "PSETCAT.spad" 1605289 1605314 1611351 1611356) (-964 "PSCURVE.spad" 1604272 1604280 1605279 1605284) (-963 "PSCAT.spad" 1603039 1603068 1604170 1604267) (-962 "PSCAT.spad" 1601896 1601927 1603029 1603034) (-961 "PRTITION.spad" 1600841 1600849 1601886 1601891) (-960 "PRTDAST.spad" 1600560 1600568 1600831 1600836) (-959 "PRS.spad" 1590122 1590139 1600516 1600521) (-958 "PRQAGG.spad" 1589553 1589563 1590090 1590117) (-957 "PROPLOG.spad" 1588956 1588964 1589543 1589548) (-956 "PROPFRML.spad" 1586874 1586885 1588946 1588951) (-955 "PROPERTY.spad" 1586368 1586376 1586864 1586869) (-954 "PRODUCT.spad" 1584048 1584060 1584334 1584389) (-953 "PR.spad" 1582434 1582446 1583139 1583266) (-952 "PRINT.spad" 1582186 1582194 1582424 1582429) (-951 "PRIMES.spad" 1580437 1580447 1582176 1582181) (-950 "PRIMELT.spad" 1578418 1578432 1580427 1580432) (-949 "PRIMCAT.spad" 1578041 1578049 1578408 1578413) (-948 "PRIMARR.spad" 1577046 1577056 1577224 1577251) (-947 "PRIMARR2.spad" 1575769 1575781 1577036 1577041) (-946 "PREASSOC.spad" 1575141 1575153 1575759 1575764) (-945 "PPCURVE.spad" 1574278 1574286 1575131 1575136) (-944 "PORTNUM.spad" 1574053 1574061 1574268 1574273) (-943 "POLYROOT.spad" 1572882 1572904 1574009 1574014) (-942 "POLY.spad" 1570179 1570189 1570696 1570823) (-941 "POLYLIFT.spad" 1569440 1569463 1570169 1570174) (-940 "POLYCATQ.spad" 1567542 1567564 1569430 1569435) (-939 "POLYCAT.spad" 1560948 1560969 1567410 1567537) (-938 "POLYCAT.spad" 1553656 1553679 1560120 1560125) (-937 "POLY2UP.spad" 1553104 1553118 1553646 1553651) (-936 "POLY2.spad" 1552699 1552711 1553094 1553099) (-935 "POLUTIL.spad" 1551640 1551669 1552655 1552660) (-934 "POLTOPOL.spad" 1550388 1550403 1551630 1551635) (-933 "POINT.spad" 1549227 1549237 1549314 1549341) (-932 "PNTHEORY.spad" 1545893 1545901 1549217 1549222) (-931 "PMTOOLS.spad" 1544650 1544664 1545883 1545888) (-930 "PMSYM.spad" 1544195 1544205 1544640 1544645) (-929 "PMQFCAT.spad" 1543782 1543796 1544185 1544190) (-928 "PMPRED.spad" 1543251 1543265 1543772 1543777) (-927 "PMPREDFS.spad" 1542695 1542717 1543241 1543246) (-926 "PMPLCAT.spad" 1541765 1541783 1542627 1542632) (-925 "PMLSAGG.spad" 1541346 1541360 1541755 1541760) (-924 "PMKERNEL.spad" 1540913 1540925 1541336 1541341) (-923 "PMINS.spad" 1540489 1540499 1540903 1540908) (-922 "PMFS.spad" 1540062 1540080 1540479 1540484) (-921 "PMDOWN.spad" 1539348 1539362 1540052 1540057) (-920 "PMASS.spad" 1538360 1538368 1539338 1539343) (-919 "PMASSFS.spad" 1537329 1537345 1538350 1538355) (-918 "PLOTTOOL.spad" 1537109 1537117 1537319 1537324) (-917 "PLOT.spad" 1531940 1531948 1537099 1537104) (-916 "PLOT3D.spad" 1528360 1528368 1531930 1531935) (-915 "PLOT1.spad" 1527501 1527511 1528350 1528355) (-914 "PLEQN.spad" 1514717 1514744 1527491 1527496) (-913 "PINTERP.spad" 1514333 1514352 1514707 1514712) (-912 "PINTERPA.spad" 1514115 1514131 1514323 1514328) (-911 "PI.spad" 1513722 1513730 1514089 1514110) (-910 "PID.spad" 1512678 1512686 1513648 1513717) (-909 "PICOERCE.spad" 1512335 1512345 1512668 1512673) (-908 "PGROEB.spad" 1510932 1510946 1512325 1512330) (-907 "PGE.spad" 1502185 1502193 1510922 1510927) (-906 "PGCD.spad" 1501067 1501084 1502175 1502180) (-905 "PFRPAC.spad" 1500210 1500220 1501057 1501062) (-904 "PFR.spad" 1496867 1496877 1500112 1500205) (-903 "PFOTOOLS.spad" 1496125 1496141 1496857 1496862) (-902 "PFOQ.spad" 1495495 1495513 1496115 1496120) (-901 "PFO.spad" 1494914 1494941 1495485 1495490) (-900 "PF.spad" 1494488 1494500 1494719 1494812) (-899 "PFECAT.spad" 1492154 1492162 1494414 1494483) (-898 "PFECAT.spad" 1489848 1489858 1492110 1492115) (-897 "PFBRU.spad" 1487718 1487730 1489838 1489843) (-896 "PFBR.spad" 1485256 1485279 1487708 1487713) (-895 "PERM.spad" 1480937 1480947 1485086 1485101) (-894 "PERMGRP.spad" 1475673 1475683 1480927 1480932) (-893 "PERMCAT.spad" 1474225 1474235 1475653 1475668) (-892 "PERMAN.spad" 1472757 1472771 1474215 1474220) (-891 "PENDTREE.spad" 1472096 1472106 1472386 1472391) (-890 "PDRING.spad" 1470587 1470597 1472076 1472091) (-889 "PDRING.spad" 1469086 1469098 1470577 1470582) (-888 "PDEPROB.spad" 1468101 1468109 1469076 1469081) (-887 "PDEPACK.spad" 1462103 1462111 1468091 1468096) (-886 "PDECOMP.spad" 1461565 1461582 1462093 1462098) (-885 "PDECAT.spad" 1459919 1459927 1461555 1461560) (-884 "PCOMP.spad" 1459770 1459783 1459909 1459914) (-883 "PBWLB.spad" 1458352 1458369 1459760 1459765) (-882 "PATTERN.spad" 1452783 1452793 1458342 1458347) (-881 "PATTERN2.spad" 1452519 1452531 1452773 1452778) (-880 "PATTERN1.spad" 1450821 1450837 1452509 1452514) (-879 "PATRES.spad" 1448368 1448380 1450811 1450816) (-878 "PATRES2.spad" 1448030 1448044 1448358 1448363) (-877 "PATMATCH.spad" 1446187 1446218 1447738 1447743) (-876 "PATMAB.spad" 1445612 1445622 1446177 1446182) (-875 "PATLRES.spad" 1444696 1444710 1445602 1445607) (-874 "PATAB.spad" 1444460 1444470 1444686 1444691) (-873 "PARTPERM.spad" 1441822 1441830 1444450 1444455) (-872 "PARSURF.spad" 1441250 1441278 1441812 1441817) (-871 "PARSU2.spad" 1441045 1441061 1441240 1441245) (-870 "script-parser.spad" 1440565 1440573 1441035 1441040) (-869 "PARSCURV.spad" 1439993 1440021 1440555 1440560) (-868 "PARSC2.spad" 1439782 1439798 1439983 1439988) (-867 "PARPCURV.spad" 1439240 1439268 1439772 1439777) (-866 "PARPC2.spad" 1439029 1439045 1439230 1439235) (-865 "PAN2EXPR.spad" 1438441 1438449 1439019 1439024) (-864 "PALETTE.spad" 1437411 1437419 1438431 1438436) (-863 "PAIR.spad" 1436394 1436407 1436999 1437004) (-862 "PADICRC.spad" 1433724 1433742 1434899 1434992) (-861 "PADICRAT.spad" 1431739 1431751 1431960 1432053) (-860 "PADIC.spad" 1431434 1431446 1431665 1431734) (-859 "PADICCT.spad" 1429975 1429987 1431360 1431429) (-858 "PADEPAC.spad" 1428654 1428673 1429965 1429970) (-857 "PADE.spad" 1427394 1427410 1428644 1428649) (-856 "OWP.spad" 1426634 1426664 1427252 1427319) (-855 "OVAR.spad" 1426415 1426438 1426624 1426629) (-854 "OUT.spad" 1425499 1425507 1426405 1426410) (-853 "OUTFORM.spad" 1414795 1414803 1425489 1425494) (-852 "OUTBFILE.spad" 1414213 1414221 1414785 1414790) (-851 "OUTBCON.spad" 1413491 1413499 1414203 1414208) (-850 "OUTBCON.spad" 1412767 1412777 1413481 1413486) (-849 "OSI.spad" 1412242 1412250 1412757 1412762) (-848 "OSGROUP.spad" 1412160 1412168 1412232 1412237) (-847 "ORTHPOL.spad" 1410621 1410631 1412077 1412082) (-846 "OREUP.spad" 1410074 1410102 1410301 1410340) (-845 "ORESUP.spad" 1409373 1409397 1409754 1409793) (-844 "OREPCTO.spad" 1407192 1407204 1409293 1409298) (-843 "OREPCAT.spad" 1401249 1401259 1407148 1407187) (-842 "OREPCAT.spad" 1395196 1395208 1401097 1401102) (-841 "ORDSET.spad" 1394362 1394370 1395186 1395191) (-840 "ORDSET.spad" 1393526 1393536 1394352 1394357) (-839 "ORDRING.spad" 1392916 1392924 1393506 1393521) (-838 "ORDRING.spad" 1392314 1392324 1392906 1392911) (-837 "ORDMON.spad" 1392169 1392177 1392304 1392309) (-836 "ORDFUNS.spad" 1391295 1391311 1392159 1392164) (-835 "ORDFIN.spad" 1391115 1391123 1391285 1391290) (-834 "ORDCOMP.spad" 1389580 1389590 1390662 1390691) (-833 "ORDCOMP2.spad" 1388865 1388877 1389570 1389575) (-832 "OPTPROB.spad" 1387503 1387511 1388855 1388860) (-831 "OPTPACK.spad" 1379888 1379896 1387493 1387498) (-830 "OPTCAT.spad" 1377563 1377571 1379878 1379883) (-829 "OPSIG.spad" 1377215 1377223 1377553 1377558) (-828 "OPQUERY.spad" 1376764 1376772 1377205 1377210) (-827 "OP.spad" 1376506 1376516 1376586 1376653) (-826 "OPERCAT.spad" 1376094 1376104 1376496 1376501) (-825 "OPERCAT.spad" 1375680 1375692 1376084 1376089) (-824 "ONECOMP.spad" 1374425 1374435 1375227 1375256) (-823 "ONECOMP2.spad" 1373843 1373855 1374415 1374420) (-822 "OMSERVER.spad" 1372845 1372853 1373833 1373838) (-821 "OMSAGG.spad" 1372633 1372643 1372801 1372840) (-820 "OMPKG.spad" 1371245 1371253 1372623 1372628) (-819 "OM.spad" 1370210 1370218 1371235 1371240) (-818 "OMLO.spad" 1369635 1369647 1370096 1370135) (-817 "OMEXPR.spad" 1369469 1369479 1369625 1369630) (-816 "OMERR.spad" 1369012 1369020 1369459 1369464) (-815 "OMERRK.spad" 1368046 1368054 1369002 1369007) (-814 "OMENC.spad" 1367390 1367398 1368036 1368041) (-813 "OMDEV.spad" 1361679 1361687 1367380 1367385) (-812 "OMCONN.spad" 1361088 1361096 1361669 1361674) (-811 "OINTDOM.spad" 1360851 1360859 1361014 1361083) (-810 "OFMONOID.spad" 1357038 1357048 1360841 1360846) (-809 "ODVAR.spad" 1356299 1356309 1357028 1357033) (-808 "ODR.spad" 1355943 1355969 1356111 1356260) (-807 "ODPOL.spad" 1353289 1353299 1353629 1353756) (-806 "ODP.spad" 1343136 1343156 1343509 1343640) (-805 "ODETOOLS.spad" 1341719 1341738 1343126 1343131) (-804 "ODESYS.spad" 1339369 1339386 1341709 1341714) (-803 "ODERTRIC.spad" 1335310 1335327 1339326 1339331) (-802 "ODERED.spad" 1334697 1334721 1335300 1335305) (-801 "ODERAT.spad" 1332248 1332265 1334687 1334692) (-800 "ODEPRRIC.spad" 1329139 1329161 1332238 1332243) (-799 "ODEPROB.spad" 1328396 1328404 1329129 1329134) (-798 "ODEPRIM.spad" 1325670 1325692 1328386 1328391) (-797 "ODEPAL.spad" 1325046 1325070 1325660 1325665) (-796 "ODEPACK.spad" 1311648 1311656 1325036 1325041) (-795 "ODEINT.spad" 1311079 1311095 1311638 1311643) (-794 "ODEIFTBL.spad" 1308474 1308482 1311069 1311074) (-793 "ODEEF.spad" 1303841 1303857 1308464 1308469) (-792 "ODECONST.spad" 1303360 1303378 1303831 1303836) (-791 "ODECAT.spad" 1301956 1301964 1303350 1303355) (-790 "OCT.spad" 1300094 1300104 1300810 1300849) (-789 "OCTCT2.spad" 1299738 1299759 1300084 1300089) (-788 "OC.spad" 1297512 1297522 1299694 1299733) (-787 "OC.spad" 1295011 1295023 1297195 1297200) (-786 "OCAMON.spad" 1294859 1294867 1295001 1295006) (-785 "OASGP.spad" 1294674 1294682 1294849 1294854) (-784 "OAMONS.spad" 1294194 1294202 1294664 1294669) (-783 "OAMON.spad" 1294055 1294063 1294184 1294189) (-782 "OAGROUP.spad" 1293917 1293925 1294045 1294050) (-781 "NUMTUBE.spad" 1293504 1293520 1293907 1293912) (-780 "NUMQUAD.spad" 1281366 1281374 1293494 1293499) (-779 "NUMODE.spad" 1272502 1272510 1281356 1281361) (-778 "NUMINT.spad" 1270060 1270068 1272492 1272497) (-777 "NUMFMT.spad" 1268900 1268908 1270050 1270055) (-776 "NUMERIC.spad" 1260972 1260982 1268705 1268710) (-775 "NTSCAT.spad" 1259474 1259490 1260940 1260967) (-774 "NTPOLFN.spad" 1259019 1259029 1259391 1259396) (-773 "NSUP.spad" 1252029 1252039 1256569 1256722) (-772 "NSUP2.spad" 1251421 1251433 1252019 1252024) (-771 "NSMP.spad" 1247616 1247635 1247924 1248051) (-770 "NREP.spad" 1245988 1246002 1247606 1247611) (-769 "NPCOEF.spad" 1245234 1245254 1245978 1245983) (-768 "NORMRETR.spad" 1244832 1244871 1245224 1245229) (-767 "NORMPK.spad" 1242734 1242753 1244822 1244827) (-766 "NORMMA.spad" 1242422 1242448 1242724 1242729) (-765 "NONE.spad" 1242163 1242171 1242412 1242417) (-764 "NONE1.spad" 1241839 1241849 1242153 1242158) (-763 "NODE1.spad" 1241308 1241324 1241829 1241834) (-762 "NNI.spad" 1240195 1240203 1241282 1241303) (-761 "NLINSOL.spad" 1238817 1238827 1240185 1240190) (-760 "NIPROB.spad" 1237358 1237366 1238807 1238812) (-759 "NFINTBAS.spad" 1234818 1234835 1237348 1237353) (-758 "NETCLT.spad" 1234792 1234803 1234808 1234813) (-757 "NCODIV.spad" 1232990 1233006 1234782 1234787) (-756 "NCNTFRAC.spad" 1232632 1232646 1232980 1232985) (-755 "NCEP.spad" 1230792 1230806 1232622 1232627) (-754 "NASRING.spad" 1230388 1230396 1230782 1230787) (-753 "NASRING.spad" 1229982 1229992 1230378 1230383) (-752 "NARNG.spad" 1229326 1229334 1229972 1229977) (-751 "NARNG.spad" 1228668 1228678 1229316 1229321) (-750 "NAGSP.spad" 1227741 1227749 1228658 1228663) (-749 "NAGS.spad" 1217266 1217274 1227731 1227736) (-748 "NAGF07.spad" 1215659 1215667 1217256 1217261) (-747 "NAGF04.spad" 1209891 1209899 1215649 1215654) (-746 "NAGF02.spad" 1203700 1203708 1209881 1209886) (-745 "NAGF01.spad" 1199303 1199311 1203690 1203695) (-744 "NAGE04.spad" 1192763 1192771 1199293 1199298) (-743 "NAGE02.spad" 1183105 1183113 1192753 1192758) (-742 "NAGE01.spad" 1178989 1178997 1183095 1183100) (-741 "NAGD03.spad" 1176909 1176917 1178979 1178984) (-740 "NAGD02.spad" 1169440 1169448 1176899 1176904) (-739 "NAGD01.spad" 1163553 1163561 1169430 1169435) (-738 "NAGC06.spad" 1159340 1159348 1163543 1163548) (-737 "NAGC05.spad" 1157809 1157817 1159330 1159335) (-736 "NAGC02.spad" 1157064 1157072 1157799 1157804) (-735 "NAALG.spad" 1156599 1156609 1157032 1157059) (-734 "NAALG.spad" 1156154 1156166 1156589 1156594) (-733 "MULTSQFR.spad" 1153112 1153129 1156144 1156149) (-732 "MULTFACT.spad" 1152495 1152512 1153102 1153107) (-731 "MTSCAT.spad" 1150529 1150550 1152393 1152490) (-730 "MTHING.spad" 1150186 1150196 1150519 1150524) (-729 "MSYSCMD.spad" 1149620 1149628 1150176 1150181) (-728 "MSET.spad" 1147562 1147572 1149326 1149365) (-727 "MSETAGG.spad" 1147407 1147417 1147530 1147557) (-726 "MRING.spad" 1144378 1144390 1147115 1147182) (-725 "MRF2.spad" 1143946 1143960 1144368 1144373) (-724 "MRATFAC.spad" 1143492 1143509 1143936 1143941) (-723 "MPRFF.spad" 1141522 1141541 1143482 1143487) (-722 "MPOLY.spad" 1138957 1138972 1139316 1139443) (-721 "MPCPF.spad" 1138221 1138240 1138947 1138952) (-720 "MPC3.spad" 1138036 1138076 1138211 1138216) (-719 "MPC2.spad" 1137678 1137711 1138026 1138031) (-718 "MONOTOOL.spad" 1136013 1136030 1137668 1137673) (-717 "MONOID.spad" 1135332 1135340 1136003 1136008) (-716 "MONOID.spad" 1134649 1134659 1135322 1135327) (-715 "MONOGEN.spad" 1133395 1133408 1134509 1134644) (-714 "MONOGEN.spad" 1132163 1132178 1133279 1133284) (-713 "MONADWU.spad" 1130177 1130185 1132153 1132158) (-712 "MONADWU.spad" 1128189 1128199 1130167 1130172) (-711 "MONAD.spad" 1127333 1127341 1128179 1128184) (-710 "MONAD.spad" 1126475 1126485 1127323 1127328) (-709 "MOEBIUS.spad" 1125161 1125175 1126455 1126470) (-708 "MODULE.spad" 1125031 1125041 1125129 1125156) (-707 "MODULE.spad" 1124921 1124933 1125021 1125026) (-706 "MODRING.spad" 1124252 1124291 1124901 1124916) (-705 "MODOP.spad" 1122911 1122923 1124074 1124141) (-704 "MODMONOM.spad" 1122640 1122658 1122901 1122906) (-703 "MODMON.spad" 1119399 1119415 1120118 1120271) (-702 "MODFIELD.spad" 1118757 1118796 1119301 1119394) (-701 "MMLFORM.spad" 1117617 1117625 1118747 1118752) (-700 "MMAP.spad" 1117357 1117391 1117607 1117612) (-699 "MLO.spad" 1115784 1115794 1117313 1117352) (-698 "MLIFT.spad" 1114356 1114373 1115774 1115779) (-697 "MKUCFUNC.spad" 1113889 1113907 1114346 1114351) (-696 "MKRECORD.spad" 1113491 1113504 1113879 1113884) (-695 "MKFUNC.spad" 1112872 1112882 1113481 1113486) (-694 "MKFLCFN.spad" 1111828 1111838 1112862 1112867) (-693 "MKCHSET.spad" 1111693 1111703 1111818 1111823) (-692 "MKBCFUNC.spad" 1111178 1111196 1111683 1111688) (-691 "MINT.spad" 1110617 1110625 1111080 1111173) (-690 "MHROWRED.spad" 1109118 1109128 1110607 1110612) (-689 "MFLOAT.spad" 1107634 1107642 1109008 1109113) (-688 "MFINFACT.spad" 1107034 1107056 1107624 1107629) (-687 "MESH.spad" 1104766 1104774 1107024 1107029) (-686 "MDDFACT.spad" 1102959 1102969 1104756 1104761) (-685 "MDAGG.spad" 1102246 1102256 1102939 1102954) (-684 "MCMPLX.spad" 1098232 1098240 1098846 1099035) (-683 "MCDEN.spad" 1097440 1097452 1098222 1098227) (-682 "MCALCFN.spad" 1094542 1094568 1097430 1097435) (-681 "MAYBE.spad" 1093855 1093866 1094532 1094537) (-680 "MATSTOR.spad" 1091131 1091141 1093845 1093850) (-679 "MATRIX.spad" 1089835 1089845 1090319 1090346) (-678 "MATLIN.spad" 1087161 1087185 1089719 1089724) (-677 "MATCAT.spad" 1078746 1078768 1087129 1087156) (-676 "MATCAT.spad" 1070203 1070227 1078588 1078593) (-675 "MATCAT2.spad" 1069471 1069519 1070193 1070198) (-674 "MAPPKG3.spad" 1068370 1068384 1069461 1069466) (-673 "MAPPKG2.spad" 1067704 1067716 1068360 1068365) (-672 "MAPPKG1.spad" 1066522 1066532 1067694 1067699) (-671 "MAPPAST.spad" 1065835 1065843 1066512 1066517) (-670 "MAPHACK3.spad" 1065643 1065657 1065825 1065830) (-669 "MAPHACK2.spad" 1065408 1065420 1065633 1065638) (-668 "MAPHACK1.spad" 1065038 1065048 1065398 1065403) (-667 "MAGMA.spad" 1062828 1062845 1065028 1065033) (-666 "MACROAST.spad" 1062407 1062415 1062818 1062823) (-665 "M3D.spad" 1060103 1060113 1061785 1061790) (-664 "LZSTAGG.spad" 1057331 1057341 1060093 1060098) (-663 "LZSTAGG.spad" 1054557 1054569 1057321 1057326) (-662 "LWORD.spad" 1051262 1051279 1054547 1054552) (-661 "LSTAST.spad" 1051046 1051054 1051252 1051257) (-660 "LSQM.spad" 1049272 1049286 1049670 1049721) (-659 "LSPP.spad" 1048805 1048822 1049262 1049267) (-658 "LSMP.spad" 1047645 1047673 1048795 1048800) (-657 "LSMP1.spad" 1045449 1045463 1047635 1047640) (-656 "LSAGG.spad" 1045118 1045128 1045417 1045444) (-655 "LSAGG.spad" 1044807 1044819 1045108 1045113) (-654 "LPOLY.spad" 1043761 1043780 1044663 1044732) (-653 "LPEFRAC.spad" 1043018 1043028 1043751 1043756) (-652 "LO.spad" 1042419 1042433 1042952 1042979) (-651 "LOGIC.spad" 1042021 1042029 1042409 1042414) (-650 "LOGIC.spad" 1041621 1041631 1042011 1042016) (-649 "LODOOPS.spad" 1040539 1040551 1041611 1041616) (-648 "LODO.spad" 1039923 1039939 1040219 1040258) (-647 "LODOF.spad" 1038967 1038984 1039880 1039885) (-646 "LODOCAT.spad" 1037625 1037635 1038923 1038962) (-645 "LODOCAT.spad" 1036281 1036293 1037581 1037586) (-644 "LODO2.spad" 1035554 1035566 1035961 1036000) (-643 "LODO1.spad" 1034954 1034964 1035234 1035273) (-642 "LODEEF.spad" 1033726 1033744 1034944 1034949) (-641 "LNAGG.spad" 1029528 1029538 1033716 1033721) (-640 "LNAGG.spad" 1025294 1025306 1029484 1029489) (-639 "LMOPS.spad" 1022030 1022047 1025284 1025289) (-638 "LMODULE.spad" 1021672 1021682 1022020 1022025) (-637 "LMDICT.spad" 1020955 1020965 1021223 1021250) (-636 "LITERAL.spad" 1020861 1020872 1020945 1020950) (-635 "LIST.spad" 1018579 1018589 1020008 1020035) (-634 "LIST3.spad" 1017870 1017884 1018569 1018574) (-633 "LIST2.spad" 1016510 1016522 1017860 1017865) (-632 "LIST2MAP.spad" 1013387 1013399 1016500 1016505) (-631 "LINEXP.spad" 1012819 1012829 1013367 1013382) (-630 "LINDEP.spad" 1011596 1011608 1012731 1012736) (-629 "LIMITRF.spad" 1009510 1009520 1011586 1011591) (-628 "LIMITPS.spad" 1008393 1008406 1009500 1009505) (-627 "LIE.spad" 1006407 1006419 1007683 1007828) (-626 "LIECAT.spad" 1005883 1005893 1006333 1006402) (-625 "LIECAT.spad" 1005387 1005399 1005839 1005844) (-624 "LIB.spad" 1003435 1003443 1004046 1004061) (-623 "LGROBP.spad" 1000788 1000807 1003425 1003430) (-622 "LF.spad" 999707 999723 1000778 1000783) (-621 "LFCAT.spad" 998726 998734 999697 999702) (-620 "LEXTRIPK.spad" 994229 994244 998716 998721) (-619 "LEXP.spad" 992232 992259 994209 994224) (-618 "LETAST.spad" 991931 991939 992222 992227) (-617 "LEADCDET.spad" 990315 990332 991921 991926) (-616 "LAZM3PK.spad" 989019 989041 990305 990310) (-615 "LAUPOL.spad" 987708 987721 988612 988681) (-614 "LAPLACE.spad" 987281 987297 987698 987703) (-613 "LA.spad" 986721 986735 987203 987242) (-612 "LALG.spad" 986497 986507 986701 986716) (-611 "LALG.spad" 986281 986293 986487 986492) (-610 "KVTFROM.spad" 986016 986026 986271 986276) (-609 "KTVLOGIC.spad" 985439 985447 986006 986011) (-608 "KRCFROM.spad" 985177 985187 985429 985434) (-607 "KOVACIC.spad" 983890 983907 985167 985172) (-606 "KONVERT.spad" 983612 983622 983880 983885) (-605 "KOERCE.spad" 983349 983359 983602 983607) (-604 "KERNEL.spad" 981884 981894 983133 983138) (-603 "KERNEL2.spad" 981587 981599 981874 981879) (-602 "KDAGG.spad" 980690 980712 981567 981582) (-601 "KDAGG.spad" 979801 979825 980680 980685) (-600 "KAFILE.spad" 978764 978780 978999 979026) (-599 "JORDAN.spad" 976591 976603 978054 978199) (-598 "JOINAST.spad" 976285 976293 976581 976586) (-597 "JAVACODE.spad" 976151 976159 976275 976280) (-596 "IXAGG.spad" 974274 974298 976141 976146) (-595 "IXAGG.spad" 972252 972278 974121 974126) (-594 "IVECTOR.spad" 971023 971038 971178 971205) (-593 "ITUPLE.spad" 970168 970178 971013 971018) (-592 "ITRIGMNP.spad" 968979 968998 970158 970163) (-591 "ITFUN3.spad" 968473 968487 968969 968974) (-590 "ITFUN2.spad" 968203 968215 968463 968468) (-589 "ITAYLOR.spad" 965995 966010 968039 968164) (-588 "ISUPS.spad" 958406 958421 964969 965066) (-587 "ISUMP.spad" 957903 957919 958396 958401) (-586 "ISTRING.spad" 956906 956919 957072 957099) (-585 "ISAST.spad" 956625 956633 956896 956901) (-584 "IRURPK.spad" 955338 955357 956615 956620) (-583 "IRSN.spad" 953298 953306 955328 955333) (-582 "IRRF2F.spad" 951773 951783 953254 953259) (-581 "IRREDFFX.spad" 951374 951385 951763 951768) (-580 "IROOT.spad" 949705 949715 951364 951369) (-579 "IR.spad" 947494 947508 949560 949587) (-578 "IR2.spad" 946514 946530 947484 947489) (-577 "IR2F.spad" 945714 945730 946504 946509) (-576 "IPRNTPK.spad" 945474 945482 945704 945709) (-575 "IPF.spad" 945039 945051 945279 945372) (-574 "IPADIC.spad" 944800 944826 944965 945034) (-573 "IP4ADDR.spad" 944357 944365 944790 944795) (-572 "IOMODE.spad" 943978 943986 944347 944352) (-571 "IOBFILE.spad" 943339 943347 943968 943973) (-570 "IOBCON.spad" 943204 943212 943329 943334) (-569 "INVLAPLA.spad" 942849 942865 943194 943199) (-568 "INTTR.spad" 936095 936112 942839 942844) (-567 "INTTOOLS.spad" 933806 933822 935669 935674) (-566 "INTSLPE.spad" 933112 933120 933796 933801) (-565 "INTRVL.spad" 932678 932688 933026 933107) (-564 "INTRF.spad" 931042 931056 932668 932673) (-563 "INTRET.spad" 930474 930484 931032 931037) (-562 "INTRAT.spad" 929149 929166 930464 930469) (-561 "INTPM.spad" 927512 927528 928792 928797) (-560 "INTPAF.spad" 925280 925298 927444 927449) (-559 "INTPACK.spad" 915590 915598 925270 925275) (-558 "INT.spad" 914951 914959 915444 915585) (-557 "INTHERTR.spad" 914217 914234 914941 914946) (-556 "INTHERAL.spad" 913883 913907 914207 914212) (-555 "INTHEORY.spad" 910296 910304 913873 913878) (-554 "INTG0.spad" 903759 903777 910228 910233) (-553 "INTFTBL.spad" 897788 897796 903749 903754) (-552 "INTFACT.spad" 896847 896857 897778 897783) (-551 "INTEF.spad" 895162 895178 896837 896842) (-550 "INTDOM.spad" 893777 893785 895088 895157) (-549 "INTDOM.spad" 892454 892464 893767 893772) (-548 "INTCAT.spad" 890707 890717 892368 892449) (-547 "INTBIT.spad" 890210 890218 890697 890702) (-546 "INTALG.spad" 889392 889419 890200 890205) (-545 "INTAF.spad" 888884 888900 889382 889387) (-544 "INTABL.spad" 887402 887433 887565 887592) (-543 "INS.spad" 884869 884877 887304 887397) (-542 "INS.spad" 882422 882432 884859 884864) (-541 "INPSIGN.spad" 881856 881869 882412 882417) (-540 "INPRODPF.spad" 880922 880941 881846 881851) (-539 "INPRODFF.spad" 879980 880004 880912 880917) (-538 "INNMFACT.spad" 878951 878968 879970 879975) (-537 "INMODGCD.spad" 878435 878465 878941 878946) (-536 "INFSP.spad" 876720 876742 878425 878430) (-535 "INFPROD0.spad" 875770 875789 876710 876715) (-534 "INFORM.spad" 872931 872939 875760 875765) (-533 "INFORM1.spad" 872556 872566 872921 872926) (-532 "INFINITY.spad" 872108 872116 872546 872551) (-531 "INETCLTS.spad" 872085 872093 872098 872103) (-530 "INEP.spad" 870617 870639 872075 872080) (-529 "INDE.spad" 870346 870363 870607 870612) (-528 "INCRMAPS.spad" 869767 869777 870336 870341) (-527 "INBFILE.spad" 868839 868847 869757 869762) (-526 "INBFF.spad" 864609 864620 868829 868834) (-525 "INBCON.spad" 863853 863861 864599 864604) (-524 "INBCON.spad" 863095 863105 863843 863848) (-523 "INAST.spad" 862760 862768 863085 863090) (-522 "IMPTAST.spad" 862468 862476 862750 862755) (-521 "IMATRIX.spad" 861413 861439 861925 861952) (-520 "IMATQF.spad" 860507 860551 861369 861374) (-519 "IMATLIN.spad" 859112 859136 860463 860468) (-518 "ILIST.spad" 857768 857783 858295 858322) (-517 "IIARRAY2.spad" 857156 857194 857375 857402) (-516 "IFF.spad" 856566 856582 856837 856930) (-515 "IFAST.spad" 856180 856188 856556 856561) (-514 "IFARRAY.spad" 853667 853682 855363 855390) (-513 "IFAMON.spad" 853529 853546 853623 853628) (-512 "IEVALAB.spad" 852918 852930 853519 853524) (-511 "IEVALAB.spad" 852305 852319 852908 852913) (-510 "IDPO.spad" 852103 852115 852295 852300) (-509 "IDPOAMS.spad" 851859 851871 852093 852098) (-508 "IDPOAM.spad" 851579 851591 851849 851854) (-507 "IDPC.spad" 850513 850525 851569 851574) (-506 "IDPAM.spad" 850258 850270 850503 850508) (-505 "IDPAG.spad" 850005 850017 850248 850253) (-504 "IDENT.spad" 849777 849785 849995 850000) (-503 "IDECOMP.spad" 847014 847032 849767 849772) (-502 "IDEAL.spad" 841937 841976 846949 846954) (-501 "ICDEN.spad" 841088 841104 841927 841932) (-500 "ICARD.spad" 840277 840285 841078 841083) (-499 "IBPTOOLS.spad" 838870 838887 840267 840272) (-498 "IBITS.spad" 838069 838082 838506 838533) (-497 "IBATOOL.spad" 834944 834963 838059 838064) (-496 "IBACHIN.spad" 833431 833446 834934 834939) (-495 "IARRAY2.spad" 832419 832445 833038 833065) (-494 "IARRAY1.spad" 831464 831479 831602 831629) (-493 "IAN.spad" 829677 829685 831280 831373) (-492 "IALGFACT.spad" 829278 829311 829667 829672) (-491 "HYPCAT.spad" 828702 828710 829268 829273) (-490 "HYPCAT.spad" 828124 828134 828692 828697) (-489 "HOSTNAME.spad" 827932 827940 828114 828119) (-488 "HOMOTOP.spad" 827675 827685 827922 827927) (-487 "HOAGG.spad" 824943 824953 827665 827670) (-486 "HOAGG.spad" 821986 821998 824710 824715) (-485 "HEXADEC.spad" 820088 820096 820453 820546) (-484 "HEUGCD.spad" 819103 819114 820078 820083) (-483 "HELLFDIV.spad" 818693 818717 819093 819098) (-482 "HEAP.spad" 818085 818095 818300 818327) (-481 "HEADAST.spad" 817616 817624 818075 818080) (-480 "HDP.spad" 807459 807475 807836 807967) (-479 "HDMP.spad" 804635 804650 805253 805380) (-478 "HB.spad" 802872 802880 804625 804630) (-477 "HASHTBL.spad" 801342 801373 801553 801580) (-476 "HASAST.spad" 801058 801066 801332 801337) (-475 "HACKPI.spad" 800541 800549 800960 801053) (-474 "GTSET.spad" 799480 799496 800187 800214) (-473 "GSTBL.spad" 797999 798034 798173 798188) (-472 "GSERIES.spad" 795166 795193 796131 796280) (-471 "GROUP.spad" 794435 794443 795146 795161) (-470 "GROUP.spad" 793712 793722 794425 794430) (-469 "GROEBSOL.spad" 792200 792221 793702 793707) (-468 "GRMOD.spad" 790771 790783 792190 792195) (-467 "GRMOD.spad" 789340 789354 790761 790766) (-466 "GRIMAGE.spad" 781945 781953 789330 789335) (-465 "GRDEF.spad" 780324 780332 781935 781940) (-464 "GRAY.spad" 778783 778791 780314 780319) (-463 "GRALG.spad" 777830 777842 778773 778778) (-462 "GRALG.spad" 776875 776889 777820 777825) (-461 "GPOLSET.spad" 776329 776352 776557 776584) (-460 "GOSPER.spad" 775594 775612 776319 776324) (-459 "GMODPOL.spad" 774732 774759 775562 775589) (-458 "GHENSEL.spad" 773801 773815 774722 774727) (-457 "GENUPS.spad" 769902 769915 773791 773796) (-456 "GENUFACT.spad" 769479 769489 769892 769897) (-455 "GENPGCD.spad" 769063 769080 769469 769474) (-454 "GENMFACT.spad" 768515 768534 769053 769058) (-453 "GENEEZ.spad" 766454 766467 768505 768510) (-452 "GDMP.spad" 763472 763489 764248 764375) (-451 "GCNAALG.spad" 757367 757394 763266 763333) (-450 "GCDDOM.spad" 756539 756547 757293 757362) (-449 "GCDDOM.spad" 755773 755783 756529 756534) (-448 "GB.spad" 753291 753329 755729 755734) (-447 "GBINTERN.spad" 749311 749349 753281 753286) (-446 "GBF.spad" 745068 745106 749301 749306) (-445 "GBEUCLID.spad" 742942 742980 745058 745063) (-444 "GAUSSFAC.spad" 742239 742247 742932 742937) (-443 "GALUTIL.spad" 740561 740571 742195 742200) (-442 "GALPOLYU.spad" 739007 739020 740551 740556) (-441 "GALFACTU.spad" 737172 737191 738997 739002) (-440 "GALFACT.spad" 727305 727316 737162 737167) (-439 "FVFUN.spad" 724328 724336 727295 727300) (-438 "FVC.spad" 723380 723388 724318 724323) (-437 "FUNCTION.spad" 723229 723241 723370 723375) (-436 "FT.spad" 721522 721530 723219 723224) (-435 "FTEM.spad" 720685 720693 721512 721517) (-434 "FSUPFACT.spad" 719585 719604 720621 720626) (-433 "FST.spad" 717671 717679 719575 719580) (-432 "FSRED.spad" 717149 717165 717661 717666) (-431 "FSPRMELT.spad" 715973 715989 717106 717111) (-430 "FSPECF.spad" 714050 714066 715963 715968) (-429 "FS.spad" 708112 708122 713825 714045) (-428 "FS.spad" 701952 701964 707667 707672) (-427 "FSINT.spad" 701610 701626 701942 701947) (-426 "FSERIES.spad" 700797 700809 701430 701529) (-425 "FSCINT.spad" 700110 700126 700787 700792) (-424 "FSAGG.spad" 699227 699237 700066 700105) (-423 "FSAGG.spad" 698306 698318 699147 699152) (-422 "FSAGG2.spad" 697005 697021 698296 698301) (-421 "FS2UPS.spad" 691488 691522 696995 697000) (-420 "FS2.spad" 691133 691149 691478 691483) (-419 "FS2EXPXP.spad" 690256 690279 691123 691128) (-418 "FRUTIL.spad" 689198 689208 690246 690251) (-417 "FR.spad" 682892 682902 688222 688291) (-416 "FRNAALG.spad" 677979 677989 682834 682887) (-415 "FRNAALG.spad" 673078 673090 677935 677940) (-414 "FRNAAF2.spad" 672532 672550 673068 673073) (-413 "FRMOD.spad" 671926 671956 672463 672468) (-412 "FRIDEAL.spad" 671121 671142 671906 671921) (-411 "FRIDEAL2.spad" 670723 670755 671111 671116) (-410 "FRETRCT.spad" 670234 670244 670713 670718) (-409 "FRETRCT.spad" 669611 669623 670092 670097) (-408 "FRAMALG.spad" 667939 667952 669567 669606) (-407 "FRAMALG.spad" 666299 666314 667929 667934) (-406 "FRAC.spad" 663398 663408 663801 663974) (-405 "FRAC2.spad" 663001 663013 663388 663393) (-404 "FR2.spad" 662335 662347 662991 662996) (-403 "FPS.spad" 659144 659152 662225 662330) (-402 "FPS.spad" 655981 655991 659064 659069) (-401 "FPC.spad" 655023 655031 655883 655976) (-400 "FPC.spad" 654151 654161 655013 655018) (-399 "FPATMAB.spad" 653913 653923 654141 654146) (-398 "FPARFRAC.spad" 652386 652403 653903 653908) (-397 "FORTRAN.spad" 650892 650935 652376 652381) (-396 "FORT.spad" 649821 649829 650882 650887) (-395 "FORTFN.spad" 646991 646999 649811 649816) (-394 "FORTCAT.spad" 646675 646683 646981 646986) (-393 "FORMULA.spad" 644139 644147 646665 646670) (-392 "FORMULA1.spad" 643618 643628 644129 644134) (-391 "FORDER.spad" 643309 643333 643608 643613) (-390 "FOP.spad" 642510 642518 643299 643304) (-389 "FNLA.spad" 641934 641956 642478 642505) (-388 "FNCAT.spad" 640521 640529 641924 641929) (-387 "FNAME.spad" 640413 640421 640511 640516) (-386 "FMTC.spad" 640211 640219 640339 640408) (-385 "FMONOID.spad" 637266 637276 640167 640172) (-384 "FM.spad" 636961 636973 637200 637227) (-383 "FMFUN.spad" 633991 633999 636951 636956) (-382 "FMC.spad" 633043 633051 633981 633986) (-381 "FMCAT.spad" 630697 630715 633011 633038) (-380 "FM1.spad" 630054 630066 630631 630658) (-379 "FLOATRP.spad" 627775 627789 630044 630049) (-378 "FLOAT.spad" 621063 621071 627641 627770) (-377 "FLOATCP.spad" 618480 618494 621053 621058) (-376 "FLINEXP.spad" 618192 618202 618460 618475) (-375 "FLINEXP.spad" 617858 617870 618128 618133) (-374 "FLASORT.spad" 617178 617190 617848 617853) (-373 "FLALG.spad" 614824 614843 617104 617173) (-372 "FLAGG.spad" 611842 611852 614804 614819) (-371 "FLAGG.spad" 608761 608773 611725 611730) (-370 "FLAGG2.spad" 607442 607458 608751 608756) (-369 "FINRALG.spad" 605471 605484 607398 607437) (-368 "FINRALG.spad" 603426 603441 605355 605360) (-367 "FINITE.spad" 602578 602586 603416 603421) (-366 "FINAALG.spad" 591559 591569 602520 602573) (-365 "FINAALG.spad" 580552 580564 591515 591520) (-364 "FILE.spad" 580135 580145 580542 580547) (-363 "FILECAT.spad" 578653 578670 580125 580130) (-362 "FIELD.spad" 578059 578067 578555 578648) (-361 "FIELD.spad" 577551 577561 578049 578054) (-360 "FGROUP.spad" 576160 576170 577531 577546) (-359 "FGLMICPK.spad" 574947 574962 576150 576155) (-358 "FFX.spad" 574322 574337 574663 574756) (-357 "FFSLPE.spad" 573811 573832 574312 574317) (-356 "FFPOLY.spad" 565063 565074 573801 573806) (-355 "FFPOLY2.spad" 564123 564140 565053 565058) (-354 "FFP.spad" 563520 563540 563839 563932) (-353 "FF.spad" 562968 562984 563201 563294) (-352 "FFNBX.spad" 561480 561500 562684 562777) (-351 "FFNBP.spad" 559993 560010 561196 561289) (-350 "FFNB.spad" 558458 558479 559674 559767) (-349 "FFINTBAS.spad" 555872 555891 558448 558453) (-348 "FFIELDC.spad" 553447 553455 555774 555867) (-347 "FFIELDC.spad" 551108 551118 553437 553442) (-346 "FFHOM.spad" 549856 549873 551098 551103) (-345 "FFF.spad" 547291 547302 549846 549851) (-344 "FFCGX.spad" 546138 546158 547007 547100) (-343 "FFCGP.spad" 545027 545047 545854 545947) (-342 "FFCG.spad" 543819 543840 544708 544801) (-341 "FFCAT.spad" 536846 536868 543658 543814) (-340 "FFCAT.spad" 529952 529976 536766 536771) (-339 "FFCAT2.spad" 529697 529737 529942 529947) (-338 "FEXPR.spad" 521406 521452 529453 529492) (-337 "FEVALAB.spad" 521112 521122 521396 521401) (-336 "FEVALAB.spad" 520603 520615 520889 520894) (-335 "FDIV.spad" 520045 520069 520593 520598) (-334 "FDIVCAT.spad" 518087 518111 520035 520040) (-333 "FDIVCAT.spad" 516127 516153 518077 518082) (-332 "FDIV2.spad" 515781 515821 516117 516122) (-331 "FCPAK1.spad" 514334 514342 515771 515776) (-330 "FCOMP.spad" 513713 513723 514324 514329) (-329 "FC.spad" 503628 503636 513703 513708) (-328 "FAXF.spad" 496563 496577 503530 503623) (-327 "FAXF.spad" 489550 489566 496519 496524) (-326 "FARRAY.spad" 487696 487706 488733 488760) (-325 "FAMR.spad" 485816 485828 487594 487691) (-324 "FAMR.spad" 483920 483934 485700 485705) (-323 "FAMONOID.spad" 483570 483580 483874 483879) (-322 "FAMONC.spad" 481792 481804 483560 483565) (-321 "FAGROUP.spad" 481398 481408 481688 481715) (-320 "FACUTIL.spad" 479594 479611 481388 481393) (-319 "FACTFUNC.spad" 478770 478780 479584 479589) (-318 "EXPUPXS.spad" 475603 475626 476902 477051) (-317 "EXPRTUBE.spad" 472831 472839 475593 475598) (-316 "EXPRODE.spad" 469703 469719 472821 472826) (-315 "EXPR.spad" 464978 464988 465692 466099) (-314 "EXPR2UPS.spad" 461070 461083 464968 464973) (-313 "EXPR2.spad" 460773 460785 461060 461065) (-312 "EXPEXPAN.spad" 457711 457736 458345 458438) (-311 "EXIT.spad" 457382 457390 457701 457706) (-310 "EXITAST.spad" 457118 457126 457372 457377) (-309 "EVALCYC.spad" 456576 456590 457108 457113) (-308 "EVALAB.spad" 456140 456150 456566 456571) (-307 "EVALAB.spad" 455702 455714 456130 456135) (-306 "EUCDOM.spad" 453244 453252 455628 455697) (-305 "EUCDOM.spad" 450848 450858 453234 453239) (-304 "ESTOOLS.spad" 442688 442696 450838 450843) (-303 "ESTOOLS2.spad" 442289 442303 442678 442683) (-302 "ESTOOLS1.spad" 441974 441985 442279 442284) (-301 "ES.spad" 434521 434529 441964 441969) (-300 "ES.spad" 426974 426984 434419 434424) (-299 "ESCONT.spad" 423747 423755 426964 426969) (-298 "ESCONT1.spad" 423496 423508 423737 423742) (-297 "ES2.spad" 422991 423007 423486 423491) (-296 "ES1.spad" 422557 422573 422981 422986) (-295 "ERROR.spad" 419878 419886 422547 422552) (-294 "EQTBL.spad" 418350 418372 418559 418586) (-293 "EQ.spad" 413224 413234 416023 416135) (-292 "EQ2.spad" 412940 412952 413214 413219) (-291 "EP.spad" 409254 409264 412930 412935) (-290 "ENV.spad" 407956 407964 409244 409249) (-289 "ENTIRER.spad" 407624 407632 407900 407951) (-288 "EMR.spad" 406825 406866 407550 407619) (-287 "ELTAGG.spad" 405065 405084 406815 406820) (-286 "ELTAGG.spad" 403269 403290 405021 405026) (-285 "ELTAB.spad" 402716 402734 403259 403264) (-284 "ELFUTS.spad" 402095 402114 402706 402711) (-283 "ELEMFUN.spad" 401784 401792 402085 402090) (-282 "ELEMFUN.spad" 401471 401481 401774 401779) (-281 "ELAGG.spad" 399414 399424 401451 401466) (-280 "ELAGG.spad" 397294 397306 399333 399338) (-279 "ELABEXPR.spad" 396225 396233 397284 397289) (-278 "EFUPXS.spad" 393001 393031 396181 396186) (-277 "EFULS.spad" 389837 389860 392957 392962) (-276 "EFSTRUC.spad" 387792 387808 389827 389832) (-275 "EF.spad" 382558 382574 387782 387787) (-274 "EAB.spad" 380834 380842 382548 382553) (-273 "E04UCFA.spad" 380370 380378 380824 380829) (-272 "E04NAFA.spad" 379947 379955 380360 380365) (-271 "E04MBFA.spad" 379527 379535 379937 379942) (-270 "E04JAFA.spad" 379063 379071 379517 379522) (-269 "E04GCFA.spad" 378599 378607 379053 379058) (-268 "E04FDFA.spad" 378135 378143 378589 378594) (-267 "E04DGFA.spad" 377671 377679 378125 378130) (-266 "E04AGNT.spad" 373513 373521 377661 377666) (-265 "DVARCAT.spad" 370198 370208 373503 373508) (-264 "DVARCAT.spad" 366881 366893 370188 370193) (-263 "DSMP.spad" 364312 364326 364617 364744) (-262 "DROPT.spad" 358257 358265 364302 364307) (-261 "DROPT1.spad" 357920 357930 358247 358252) (-260 "DROPT0.spad" 352747 352755 357910 357915) (-259 "DRAWPT.spad" 350902 350910 352737 352742) (-258 "DRAW.spad" 343502 343515 350892 350897) (-257 "DRAWHACK.spad" 342810 342820 343492 343497) (-256 "DRAWCX.spad" 340252 340260 342800 342805) (-255 "DRAWCURV.spad" 339789 339804 340242 340247) (-254 "DRAWCFUN.spad" 328961 328969 339779 339784) (-253 "DQAGG.spad" 327129 327139 328929 328956) (-252 "DPOLCAT.spad" 322470 322486 326997 327124) (-251 "DPOLCAT.spad" 317897 317915 322426 322431) (-250 "DPMO.spad" 310123 310139 310261 310562) (-249 "DPMM.spad" 302362 302380 302487 302788) (-248 "DOMCTOR.spad" 302254 302262 302352 302357) (-247 "DOMAIN.spad" 301385 301393 302244 302249) (-246 "DMP.spad" 298607 298622 299179 299306) (-245 "DLP.spad" 297955 297965 298597 298602) (-244 "DLIST.spad" 296534 296544 297138 297165) (-243 "DLAGG.spad" 294945 294955 296524 296529) (-242 "DIVRING.spad" 294487 294495 294889 294940) (-241 "DIVRING.spad" 294073 294083 294477 294482) (-240 "DISPLAY.spad" 292253 292261 294063 294068) (-239 "DIRPROD.spad" 281833 281849 282473 282604) (-238 "DIRPROD2.spad" 280641 280659 281823 281828) (-237 "DIRPCAT.spad" 279583 279599 280505 280636) (-236 "DIRPCAT.spad" 278254 278272 279178 279183) (-235 "DIOSP.spad" 277079 277087 278244 278249) (-234 "DIOPS.spad" 276063 276073 277059 277074) (-233 "DIOPS.spad" 275021 275033 276019 276024) (-232 "DIFRING.spad" 274313 274321 275001 275016) (-231 "DIFRING.spad" 273613 273623 274303 274308) (-230 "DIFEXT.spad" 272772 272782 273593 273608) (-229 "DIFEXT.spad" 271848 271860 272671 272676) (-228 "DIAGG.spad" 271478 271488 271828 271843) (-227 "DIAGG.spad" 271116 271128 271468 271473) (-226 "DHMATRIX.spad" 269420 269430 270573 270600) (-225 "DFSFUN.spad" 262828 262836 269410 269415) (-224 "DFLOAT.spad" 259549 259557 262718 262823) (-223 "DFINTTLS.spad" 257758 257774 259539 259544) (-222 "DERHAM.spad" 255668 255700 257738 257753) (-221 "DEQUEUE.spad" 254986 254996 255275 255302) (-220 "DEGRED.spad" 254601 254615 254976 254981) (-219 "DEFINTRF.spad" 252126 252136 254591 254596) (-218 "DEFINTEF.spad" 250622 250638 252116 252121) (-217 "DEFAST.spad" 249990 249998 250612 250617) (-216 "DECIMAL.spad" 248096 248104 248457 248550) (-215 "DDFACT.spad" 245895 245912 248086 248091) (-214 "DBLRESP.spad" 245493 245517 245885 245890) (-213 "DBASE.spad" 244147 244157 245483 245488) (-212 "DATAARY.spad" 243609 243622 244137 244142) (-211 "D03FAFA.spad" 243437 243445 243599 243604) (-210 "D03EEFA.spad" 243257 243265 243427 243432) (-209 "D03AGNT.spad" 242337 242345 243247 243252) (-208 "D02EJFA.spad" 241799 241807 242327 242332) (-207 "D02CJFA.spad" 241277 241285 241789 241794) (-206 "D02BHFA.spad" 240767 240775 241267 241272) (-205 "D02BBFA.spad" 240257 240265 240757 240762) (-204 "D02AGNT.spad" 235061 235069 240247 240252) (-203 "D01WGTS.spad" 233380 233388 235051 235056) (-202 "D01TRNS.spad" 233357 233365 233370 233375) (-201 "D01GBFA.spad" 232879 232887 233347 233352) (-200 "D01FCFA.spad" 232401 232409 232869 232874) (-199 "D01ASFA.spad" 231869 231877 232391 232396) (-198 "D01AQFA.spad" 231315 231323 231859 231864) (-197 "D01APFA.spad" 230739 230747 231305 231310) (-196 "D01ANFA.spad" 230233 230241 230729 230734) (-195 "D01AMFA.spad" 229743 229751 230223 230228) (-194 "D01ALFA.spad" 229283 229291 229733 229738) (-193 "D01AKFA.spad" 228809 228817 229273 229278) (-192 "D01AJFA.spad" 228332 228340 228799 228804) (-191 "D01AGNT.spad" 224391 224399 228322 228327) (-190 "CYCLOTOM.spad" 223897 223905 224381 224386) (-189 "CYCLES.spad" 220729 220737 223887 223892) (-188 "CVMP.spad" 220146 220156 220719 220724) (-187 "CTRIGMNP.spad" 218636 218652 220136 220141) (-186 "CTOR.spad" 218536 218544 218626 218631) (-185 "CTORKIND.spad" 218139 218147 218526 218531) (-184 "CTORCAT.spad" 217594 217602 218129 218134) (-183 "CTORCAT.spad" 217047 217057 217584 217589) (-182 "CTORCALL.spad" 216627 216635 217037 217042) (-181 "CSTTOOLS.spad" 215870 215883 216617 216622) (-180 "CRFP.spad" 209574 209587 215860 215865) (-179 "CRCEAST.spad" 209294 209302 209564 209569) (-178 "CRAPACK.spad" 208337 208347 209284 209289) (-177 "CPMATCH.spad" 207837 207852 208262 208267) (-176 "CPIMA.spad" 207542 207561 207827 207832) (-175 "COORDSYS.spad" 202435 202445 207532 207537) (-174 "CONTOUR.spad" 201837 201845 202425 202430) (-173 "CONTFRAC.spad" 197449 197459 201739 201832) (-172 "CONDUIT.spad" 197207 197215 197439 197444) (-171 "COMRING.spad" 196881 196889 197145 197202) (-170 "COMPPROP.spad" 196395 196403 196871 196876) (-169 "COMPLPAT.spad" 196162 196177 196385 196390) (-168 "COMPLEX.spad" 190198 190208 190442 190691) (-167 "COMPLEX2.spad" 189911 189923 190188 190193) (-166 "COMPFACT.spad" 189513 189527 189901 189906) (-165 "COMPCAT.spad" 187651 187661 189259 189508) (-164 "COMPCAT.spad" 185470 185482 187080 187085) (-163 "COMMUPC.spad" 185216 185234 185460 185465) (-162 "COMMONOP.spad" 184749 184757 185206 185211) (-161 "COMM.spad" 184558 184566 184739 184744) (-160 "COMMAAST.spad" 184321 184329 184548 184553) (-159 "COMBOPC.spad" 183226 183234 184311 184316) (-158 "COMBINAT.spad" 181971 181981 183216 183221) (-157 "COMBF.spad" 179339 179355 181961 181966) (-156 "COLOR.spad" 178176 178184 179329 179334) (-155 "COLONAST.spad" 177842 177850 178166 178171) (-154 "CMPLXRT.spad" 177551 177568 177832 177837) (-153 "CLLCTAST.spad" 177213 177221 177541 177546) (-152 "CLIP.spad" 173305 173313 177203 177208) (-151 "CLIF.spad" 171944 171960 173261 173300) (-150 "CLAGG.spad" 168429 168439 171934 171939) (-149 "CLAGG.spad" 164785 164797 168292 168297) (-148 "CINTSLPE.spad" 164110 164123 164775 164780) (-147 "CHVAR.spad" 162188 162210 164100 164105) (-146 "CHARZ.spad" 162103 162111 162168 162183) (-145 "CHARPOL.spad" 161611 161621 162093 162098) (-144 "CHARNZ.spad" 161364 161372 161591 161606) (-143 "CHAR.spad" 159232 159240 161354 161359) (-142 "CFCAT.spad" 158548 158556 159222 159227) (-141 "CDEN.spad" 157706 157720 158538 158543) (-140 "CCLASS.spad" 155855 155863 157117 157156) (-139 "CATEGORY.spad" 154945 154953 155845 155850) (-138 "CATCTOR.spad" 154836 154844 154935 154940) (-137 "CATAST.spad" 154463 154471 154826 154831) (-136 "CASEAST.spad" 154177 154185 154453 154458) (-135 "CARTEN.spad" 149280 149304 154167 154172) (-134 "CARTEN2.spad" 148666 148693 149270 149275) (-133 "CARD.spad" 145955 145963 148640 148661) (-132 "CAPSLAST.spad" 145729 145737 145945 145950) (-131 "CACHSET.spad" 145351 145359 145719 145724) (-130 "CABMON.spad" 144904 144912 145341 145346) (-129 "BYTE.spad" 144325 144333 144894 144899) (-128 "BYTEBUF.spad" 142157 142165 143494 143521) (-127 "BTREE.spad" 141226 141236 141764 141791) (-126 "BTOURN.spad" 140229 140239 140833 140860) (-125 "BTCAT.spad" 139617 139627 140197 140224) (-124 "BTCAT.spad" 139025 139037 139607 139612) (-123 "BTAGG.spad" 138147 138155 138993 139020) (-122 "BTAGG.spad" 137289 137299 138137 138142) (-121 "BSTREE.spad" 136024 136034 136896 136923) (-120 "BRILL.spad" 134219 134230 136014 136019) (-119 "BRAGG.spad" 133143 133153 134209 134214) (-118 "BRAGG.spad" 132031 132043 133099 133104) (-117 "BPADICRT.spad" 130012 130024 130267 130360) (-116 "BPADIC.spad" 129676 129688 129938 130007) (-115 "BOUNDZRO.spad" 129332 129349 129666 129671) (-114 "BOP.spad" 124796 124804 129322 129327) (-113 "BOP1.spad" 122182 122192 124752 124757) (-112 "BOOLEAN.spad" 121506 121514 122172 122177) (-111 "BMODULE.spad" 121218 121230 121474 121501) (-110 "BITS.spad" 120637 120645 120854 120881) (-109 "BINDING.spad" 120056 120064 120627 120632) (-108 "BINARY.spad" 118167 118175 118523 118616) (-107 "BGAGG.spad" 117364 117374 118147 118162) (-106 "BGAGG.spad" 116569 116581 117354 117359) (-105 "BFUNCT.spad" 116133 116141 116549 116564) (-104 "BEZOUT.spad" 115267 115294 116083 116088) (-103 "BBTREE.spad" 112086 112096 114874 114901) (-102 "BASTYPE.spad" 111758 111766 112076 112081) (-101 "BASTYPE.spad" 111428 111438 111748 111753) (-100 "BALFACT.spad" 110867 110880 111418 111423) (-99 "AUTOMOR.spad" 110314 110323 110847 110862) (-98 "ATTREG.spad" 107033 107040 110066 110309) (-97 "ATTRBUT.spad" 103056 103063 107013 107028) (-96 "ATTRAST.spad" 102773 102780 103046 103051) (-95 "ATRIG.spad" 102243 102250 102763 102768) (-94 "ATRIG.spad" 101711 101720 102233 102238) (-93 "ASTCAT.spad" 101615 101622 101701 101706) (-92 "ASTCAT.spad" 101517 101526 101605 101610) (-91 "ASTACK.spad" 100850 100859 101124 101151) (-90 "ASSOCEQ.spad" 99650 99661 100806 100811) (-89 "ASP9.spad" 98731 98744 99640 99645) (-88 "ASP8.spad" 97774 97787 98721 98726) (-87 "ASP80.spad" 97096 97109 97764 97769) (-86 "ASP7.spad" 96256 96269 97086 97091) (-85 "ASP78.spad" 95707 95720 96246 96251) (-84 "ASP77.spad" 95076 95089 95697 95702) (-83 "ASP74.spad" 94168 94181 95066 95071) (-82 "ASP73.spad" 93439 93452 94158 94163) (-81 "ASP6.spad" 92306 92319 93429 93434) (-80 "ASP55.spad" 90815 90828 92296 92301) (-79 "ASP50.spad" 88632 88645 90805 90810) (-78 "ASP4.spad" 87927 87940 88622 88627) (-77 "ASP49.spad" 86926 86939 87917 87922) (-76 "ASP42.spad" 85333 85372 86916 86921) (-75 "ASP41.spad" 83912 83951 85323 85328) (-74 "ASP35.spad" 82900 82913 83902 83907) (-73 "ASP34.spad" 82201 82214 82890 82895) (-72 "ASP33.spad" 81761 81774 82191 82196) (-71 "ASP31.spad" 80901 80914 81751 81756) (-70 "ASP30.spad" 79793 79806 80891 80896) (-69 "ASP29.spad" 79259 79272 79783 79788) (-68 "ASP28.spad" 70532 70545 79249 79254) (-67 "ASP27.spad" 69429 69442 70522 70527) (-66 "ASP24.spad" 68516 68529 69419 69424) (-65 "ASP20.spad" 67980 67993 68506 68511) (-64 "ASP1.spad" 67361 67374 67970 67975) (-63 "ASP19.spad" 62047 62060 67351 67356) (-62 "ASP12.spad" 61461 61474 62037 62042) (-61 "ASP10.spad" 60732 60745 61451 61456) (-60 "ARRAY2.spad" 60092 60101 60339 60366) (-59 "ARRAY1.spad" 58927 58936 59275 59302) (-58 "ARRAY12.spad" 57596 57607 58917 58922) (-57 "ARR2CAT.spad" 53258 53279 57564 57591) (-56 "ARR2CAT.spad" 48940 48963 53248 53253) (-55 "ARITY.spad" 48508 48515 48930 48935) (-54 "APPRULE.spad" 47752 47774 48498 48503) (-53 "APPLYORE.spad" 47367 47380 47742 47747) (-52 "ANY.spad" 45709 45716 47357 47362) (-51 "ANY1.spad" 44780 44789 45699 45704) (-50 "ANTISYM.spad" 43219 43235 44760 44775) (-49 "ANON.spad" 42916 42923 43209 43214) (-48 "AN.spad" 41217 41224 42732 42825) (-47 "AMR.spad" 39396 39407 41115 41212) (-46 "AMR.spad" 37412 37425 39133 39138) (-45 "ALIST.spad" 34824 34845 35174 35201) (-44 "ALGSC.spad" 33947 33973 34696 34749) (-43 "ALGPKG.spad" 29656 29667 33903 33908) (-42 "ALGMFACT.spad" 28845 28859 29646 29651) (-41 "ALGMANIP.spad" 26265 26280 28642 28647) (-40 "ALGFF.spad" 24580 24607 24797 24953) (-39 "ALGFACT.spad" 23701 23711 24570 24575) (-38 "ALGEBRA.spad" 23534 23543 23657 23696) (-37 "ALGEBRA.spad" 23399 23410 23524 23529) (-36 "ALAGG.spad" 22909 22930 23367 23394) (-35 "AHYP.spad" 22290 22297 22899 22904) (-34 "AGG.spad" 20599 20606 22280 22285) (-33 "AGG.spad" 18872 18881 20555 20560) (-32 "AF.spad" 17297 17312 18807 18812) (-31 "ADDAST.spad" 16975 16982 17287 17292) (-30 "ACPLOT.spad" 15546 15553 16965 16970) (-29 "ACFS.spad" 13297 13306 15448 15541) (-28 "ACFS.spad" 11134 11145 13287 13292) (-27 "ACF.spad" 7736 7743 11036 11129) (-26 "ACF.spad" 4424 4433 7726 7731) (-25 "ABELSG.spad" 3965 3972 4414 4419) (-24 "ABELSG.spad" 3504 3513 3955 3960) (-23 "ABELMON.spad" 3047 3054 3494 3499) (-22 "ABELMON.spad" 2588 2597 3037 3042) (-21 "ABELGRP.spad" 2160 2167 2578 2583) (-20 "ABELGRP.spad" 1730 1739 2150 2155) (-19 "A1AGG.spad" 870 879 1698 1725) (-18 "A1AGG.spad" 30 41 860 865)) 
\ No newline at end of file