* algebra/syntax.spad.pamphlet (ElaboratedExpression): New.

* algebra/any.spad.pamphlet: Rename ObjectProperty to Property. * algebra/exposed.lsp.pamphlet: Likewise. * algebra/Makefile.pamphlet (axiom_algebra_layer_5): Include ELABEXPR.o * share/algebra: Update databases.
author: dos-reis <gdr@axiomatics.org> 2008-01-20 21:17:21 +0000
committer: dos-reis <gdr@axiomatics.org> 2008-01-20 21:17:21 +0000
commit: 92db1817aed73ac8a38e9d3070a021d7153ca1ba (patch)
tree: 1e59d7655578549ff3d3f45084d9f657cd730572 /src/share/algebra/browse.daase
parent: 7fc5f46ef3c26ff7b1c5a5876736f9a1c27c3c13 (diff)
download: open-axiom-92db1817aed73ac8a38e9d3070a021d7153ca1ba.tar.gz
1 files changed, 445 insertions, 445 deletions
diff --git a/src/share/algebra/browse.daase b/src/share/algebra/browse.daase
index cc7661dd..14ce0e7c 100644
--- a/src/share/algebra/browse.daase
+++ b/src/share/algebra/browse.daase
@@ -1,12 +1,12 @@
 
-(2233102 . 3409778141)       
+(2233072 . 3409817877)       
 (-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 
 NIL 
 (-19 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."))) 
-((-4234 . T) (-4233 . T) (-2046 . T)) 
+((-4234 . T) (-4233 . T) (-2092 . T)) 
 NIL 
 (-20 S) 
 ((|constructor| (NIL "The class of abelian groups,{} \\spadignore{i.e.} additive monoids where each element has an additive inverse. \\blankline")) (* (($ (|Integer|) $) "\\spad{n*x} is the product of \\spad{x} by the integer \\spad{n}.")) (- (($ $ $) "\\spad{x-y} is the difference of \\spad{x} and \\spad{y} \\spadignore{i.e.} \\spad{x + (-y)}.") (($ $) "\\spad{-x} is the additive inverse of \\spad{x}."))) 
@@ -46,7 +46,7 @@ NIL
 NIL 
 (-29 R) 
 ((|constructor| (NIL "Model for algebraically closed function spaces.")) (|zerosOf| (((|List| $) $ (|Symbol|)) "\\spad{zerosOf(p,{} y)} returns \\spad{[y1,{}...,{}yn]} such that \\spad{p(\\spad{yi}) = 0}. The \\spad{yi}\\spad{'s} are expressed in radicals if possible,{} and otherwise as implicit algebraic quantities which display as \\spad{'yi}. The returned symbols \\spad{y1},{}...,{}\\spad{yn} are bound in the interpreter to respective root values.") (((|List| $) $) "\\spad{zerosOf(p)} returns \\spad{[y1,{}...,{}yn]} such that \\spad{p(\\spad{yi}) = 0}. The \\spad{yi}\\spad{'s} are expressed in radicals if possible. The returned symbols \\spad{y1},{}...,{}\\spad{yn} are bound in the interpreter to respective root values. Error: if \\spad{p} has more than one variable.")) (|zeroOf| (($ $ (|Symbol|)) "\\spad{zeroOf(p,{} y)} returns \\spad{y} such that \\spad{p(y) = 0}. The value \\spad{y} is expressed in terms of radicals if possible,{}and otherwise as an implicit algebraic quantity which displays as \\spad{'y}.") (($ $) "\\spad{zeroOf(p)} returns \\spad{y} such that \\spad{p(y) = 0}. The value \\spad{y} is expressed in terms of radicals if possible,{}and otherwise as an implicit algebraic quantity. Error: if \\spad{p} has more than one variable.")) (|rootsOf| (((|List| $) $ (|Symbol|)) "\\spad{rootsOf(p,{} y)} returns \\spad{[y1,{}...,{}yn]} such that \\spad{p(\\spad{yi}) = 0}; The returned roots display as \\spad{'y1},{}...,{}\\spad{'yn}. Note: the returned symbols \\spad{y1},{}...,{}\\spad{yn} are bound in the interpreter to respective root values.") (((|List| $) $) "\\spad{rootsOf(p,{} y)} returns \\spad{[y1,{}...,{}yn]} such that \\spad{p(\\spad{yi}) = 0}; Note: the returned symbols \\spad{y1},{}...,{}\\spad{yn} are bound in the interpreter to respective root values. Error: if \\spad{p} has more than one variable \\spad{y}.")) (|rootOf| (($ $ (|Symbol|)) "\\spad{rootOf(p,{}y)} returns \\spad{y} such that \\spad{p(y) = 0}. The object returned displays as \\spad{'y}.") (($ $) "\\spad{rootOf(p)} returns \\spad{y} such that \\spad{p(y) = 0}. Error: if \\spad{p} has more than one variable \\spad{y}."))) 
-((-4230 . T) (-4228 . T) (-4227 . T) ((-4235 "*") . T) (-4226 . T) (-4231 . T) (-4225 . T) (-2046 . T)) 
+((-4230 . T) (-4228 . T) (-4227 . T) ((-4235 "*") . T) (-4226 . T) (-4231 . T) (-4225 . T) (-2092 . T)) 
 NIL 
 (-30) 
 ((|constructor| (NIL "\\indented{1}{Plot a NON-SINGULAR plane algebraic curve \\spad{p}(\\spad{x},{}\\spad{y}) = 0.} Author: Clifton \\spad{J}. Williamson Date Created: Fall 1988 Date Last Updated: 27 April 1990 Keywords: algebraic curve,{} non-singular,{} plot Examples: References:")) (|refine| (($ $ (|DoubleFloat|)) "\\spad{refine(p,{}x)} \\undocumented{}")) (|makeSketch| (($ (|Polynomial| (|Integer|)) (|Symbol|) (|Symbol|) (|Segment| (|Fraction| (|Integer|))) (|Segment| (|Fraction| (|Integer|)))) "\\spad{makeSketch(p,{}x,{}y,{}a..b,{}c..d)} creates an ACPLOT of the curve \\spad{p = 0} in the region {\\em a <= x <= b,{} c <= y <= d}. More specifically,{} 'makeSketch' plots a non-singular algebraic curve \\spad{p = 0} in an rectangular region {\\em xMin <= x <= xMax},{} {\\em yMin <= y <= yMax}. The user inputs \\spad{makeSketch(p,{}x,{}y,{}xMin..xMax,{}yMin..yMax)}. Here \\spad{p} is a polynomial in the variables \\spad{x} and \\spad{y} with integer coefficients (\\spad{p} belongs to the domain \\spad{Polynomial Integer}). The case where \\spad{p} is a polynomial in only one of the variables is allowed. The variables \\spad{x} and \\spad{y} are input to specify the the coordinate axes. The horizontal axis is the \\spad{x}-axis and the vertical axis is the \\spad{y}-axis. The rational numbers xMin,{}...,{}yMax specify the boundaries of the region in which the curve is to be plotted."))) 
@@ -62,7 +62,7 @@ NIL
 ((|HasAttribute| |#1| (QUOTE -4233))) 
 (-33) 
 ((|constructor| (NIL "The notion of aggregate serves to model any data structure aggregate,{} designating any collection of objects,{} with heterogenous or homogeneous members,{} with a finite or infinite number of members,{} explicitly or implicitly represented. An aggregate can in principle represent everything from a string of characters to abstract sets such as \"the set of \\spad{x} satisfying relation {\\em r(x)}\" An attribute \\spadatt{finiteAggregate} is used to assert that a domain has a finite number of elements.")) (|#| (((|NonNegativeInteger|) $) "\\spad{\\# u} returns the number of items in \\spad{u}.")) (|sample| (($) "\\spad{sample yields} a value of type \\%")) (|size?| (((|Boolean|) $ (|NonNegativeInteger|)) "\\spad{size?(u,{}n)} tests if \\spad{u} has exactly \\spad{n} elements.")) (|more?| (((|Boolean|) $ (|NonNegativeInteger|)) "\\spad{more?(u,{}n)} tests if \\spad{u} has greater than \\spad{n} elements.")) (|less?| (((|Boolean|) $ (|NonNegativeInteger|)) "\\spad{less?(u,{}n)} tests if \\spad{u} has less than \\spad{n} elements.")) (|empty?| (((|Boolean|) $) "\\spad{empty?(u)} tests if \\spad{u} has 0 elements.")) (|empty| (($) "\\spad{empty()}\\$\\spad{D} creates an aggregate of type \\spad{D} with 0 elements. Note: The {\\em \\$D} can be dropped if understood by context,{} \\spadignore{e.g.} \\axiom{u: \\spad{D} \\spad{:=} empty()}.")) (|copy| (($ $) "\\spad{copy(u)} returns a top-level (non-recursive) copy of \\spad{u}. Note: for collections,{} \\axiom{copy(\\spad{u}) \\spad{==} [\\spad{x} for \\spad{x} in \\spad{u}]}.")) (|eq?| (((|Boolean|) $ $) "\\spad{eq?(u,{}v)} tests if \\spad{u} and \\spad{v} are same objects."))) 
-((-2046 . T)) 
+((-2092 . T)) 
 NIL 
 (-34) 
 ((|constructor| (NIL "Category for the inverse hyperbolic trigonometric functions.")) (|atanh| (($ $) "\\spad{atanh(x)} returns the hyperbolic arc-tangent of \\spad{x}.")) (|asinh| (($ $) "\\spad{asinh(x)} returns the hyperbolic arc-sine of \\spad{x}.")) (|asech| (($ $) "\\spad{asech(x)} returns the hyperbolic arc-secant of \\spad{x}.")) (|acsch| (($ $) "\\spad{acsch(x)} returns the hyperbolic arc-cosecant of \\spad{x}.")) (|acoth| (($ $) "\\spad{acoth(x)} returns the hyperbolic arc-cotangent of \\spad{x}.")) (|acosh| (($ $) "\\spad{acosh(x)} returns the hyperbolic arc-cosine of \\spad{x}."))) 
@@ -70,7 +70,7 @@ NIL
 NIL 
 (-35 |Key| |Entry|) 
 ((|constructor| (NIL "An association list is a list of key entry pairs which may be viewed as a table. It is a poor mans version of a table: searching for a key is a linear operation.")) (|assoc| (((|Union| (|Record| (|:| |key| |#1|) (|:| |entry| |#2|)) "failed") |#1| $) "\\spad{assoc(k,{}u)} returns the element \\spad{x} in association list \\spad{u} stored with key \\spad{k},{} or \"failed\" if \\spad{u} has no key \\spad{k}."))) 
-((-4233 . T) (-4234 . T) (-2046 . T)) 
+((-4233 . T) (-4234 . T) (-2092 . T)) 
 NIL 
 (-36 S R) 
 ((|constructor| (NIL "The category of associative algebras (modules which are themselves rings). \\blankline")) (|coerce| (($ |#2|) "\\spad{coerce(r)} maps the ring element \\spad{r} to a member of the algebra."))) 
@@ -84,14 +84,14 @@ 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 
-(-39 -4049 UP UPUP -2704) 
+(-39 -4049 UP UPUP -3967) 
 ((|constructor| (NIL "Function field defined by \\spad{f}(\\spad{x},{} \\spad{y}) = 0.")) (|knownInfBasis| (((|Void|) (|NonNegativeInteger|)) "\\spad{knownInfBasis(n)} \\undocumented{}"))) 
 ((-4226 |has| (-381 |#2|) (-337)) (-4231 |has| (-381 |#2|) (-337)) (-4225 |has| (-381 |#2|) (-337)) ((-4235 "*") . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
-((|HasCategory| (-381 |#2|) (QUOTE (-133))) (|HasCategory| (-381 |#2|) (QUOTE (-135))) (|HasCategory| (-381 |#2|) (QUOTE (-323))) (|HasCategory| (-381 |#2|) (QUOTE (-337))) (-3703 (|HasCategory| (-381 |#2|) (QUOTE (-337))) (|HasCategory| (-381 |#2|) (QUOTE (-323)))) (|HasCategory| (-381 |#2|) (QUOTE (-342))) (|HasCategory| (-381 |#2|) (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| (-381 |#2|) (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| (-381 |#2|) (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-342))) (-3703 (|HasCategory| (-381 |#2|) (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| (-381 |#2|) (QUOTE (-337)))) (-12 (|HasCategory| (-381 |#2|) (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| (-381 |#2|) (QUOTE (-337)))) (-3703 (-12 (|HasCategory| (-381 |#2|) (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| (-381 |#2|) (QUOTE (-337)))) (-12 (|HasCategory| (-381 |#2|) (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| (-381 |#2|) (QUOTE (-323))))) (-12 (|HasCategory| (-381 |#2|) (QUOTE (-210))) (|HasCategory| (-381 |#2|) (QUOTE (-337)))) (-3703 (-12 (|HasCategory| (-381 |#2|) (QUOTE (-210))) (|HasCategory| (-381 |#2|) (QUOTE (-337)))) (|HasCategory| (-381 |#2|) (QUOTE (-323))))) 
+((|HasCategory| (-381 |#2|) (QUOTE (-133))) (|HasCategory| (-381 |#2|) (QUOTE (-135))) (|HasCategory| (-381 |#2|) (QUOTE (-323))) (|HasCategory| (-381 |#2|) (QUOTE (-337))) (-3703 (|HasCategory| (-381 |#2|) (QUOTE (-337))) (|HasCategory| (-381 |#2|) (QUOTE (-323)))) (|HasCategory| (-381 |#2|) (QUOTE (-342))) (|HasCategory| (-381 |#2|) (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| (-381 |#2|) (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| (-381 |#2|) (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-342))) (-3703 (|HasCategory| (-381 |#2|) (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| (-381 |#2|) (QUOTE (-337)))) (-12 (|HasCategory| (-381 |#2|) (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| (-381 |#2|) (QUOTE (-337)))) (-3703 (-12 (|HasCategory| (-381 |#2|) (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| (-381 |#2|) (QUOTE (-337)))) (-12 (|HasCategory| (-381 |#2|) (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| (-381 |#2|) (QUOTE (-323))))) (-12 (|HasCategory| (-381 |#2|) (QUOTE (-210))) (|HasCategory| (-381 |#2|) (QUOTE (-337)))) (-3703 (-12 (|HasCategory| (-381 |#2|) (QUOTE (-210))) (|HasCategory| (-381 |#2|) (QUOTE (-337)))) (|HasCategory| (-381 |#2|) (QUOTE (-323))))) 
 (-40 R -4049) 
 ((|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 (-425))) (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -404) (|devaluate| |#1|))))) 
+((-12 (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -404) (|devaluate| |#1|))))) 
 (-41 OV E P) 
 ((|constructor| (NIL "This package factors multivariate polynomials over the domain of \\spadtype{AlgebraicNumber} by allowing the user to specify a list of algebraic numbers generating the particular extension to factor over.")) (|factor| (((|Factored| (|SparseUnivariatePolynomial| |#3|)) (|SparseUnivariatePolynomial| |#3|) (|List| (|AlgebraicNumber|))) "\\spad{factor(p,{}lan)} factors the polynomial \\spad{p} over the extension generated by the algebraic numbers given by the list \\spad{lan}. \\spad{p} is presented as a univariate polynomial with multivariate coefficients.") (((|Factored| |#3|) |#3| (|List| (|AlgebraicNumber|))) "\\spad{factor(p,{}lan)} factors the polynomial \\spad{p} over the extension generated by the algebraic numbers given by the list \\spad{lan}."))) 
 NIL 
@@ -107,7 +107,7 @@ NIL
 (-44 |Key| |Entry|) 
 ((|constructor| (NIL "\\spadtype{AssociationList} implements association lists. These may be viewed as lists of pairs where the first part is a key and the second is the stored value. For example,{} the key might be a string with a persons employee identification number and the value might be a record with personnel data."))) 
 ((-4233 . T) (-4234 . T)) 
-((|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (QUOTE (-784))) (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| |#2| (QUOTE (-1013))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (|HasCategory| (-521) (QUOTE (-784))) (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (QUOTE (-1013))) (-3703 (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (QUOTE (-784))) (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (QUOTE (-1013))) (|HasCategory| |#2| (QUOTE (-1013)))) (-3703 (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (QUOTE (-1013))) (|HasCategory| |#2| (QUOTE (-1013)))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-792)))) (-12 (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (QUOTE (-1013))) (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (LIST (QUOTE -284) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2529) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3045) (|devaluate| |#2|)))))) (-3703 (-12 (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (QUOTE (-784))) (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (LIST (QUOTE -284) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2529) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3045) (|devaluate| |#2|)))))) (-12 (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (QUOTE (-1013))) (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (LIST (QUOTE -284) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2529) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3045) (|devaluate| |#2|))))))) (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (LIST (QUOTE -561) (QUOTE (-792)))) (-3703 (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (QUOTE (-784))) (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (QUOTE (-1013))) (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (LIST (QUOTE -561) (QUOTE (-792)))) (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-792))))) (-3703 (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (LIST (QUOTE -561) (QUOTE (-792)))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-792)))))) 
+((|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (QUOTE (-783))) (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#2| (QUOTE (-1013))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (|HasCategory| (-521) (QUOTE (-783))) (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (QUOTE (-1013))) (-3703 (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (QUOTE (-783))) (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (QUOTE (-1013))) (|HasCategory| |#2| (QUOTE (-1013)))) (-3703 (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (QUOTE (-1013))) (|HasCategory| |#2| (QUOTE (-1013)))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-791)))) (-12 (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (QUOTE (-1013))) (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (LIST (QUOTE -284) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2535) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3050) (|devaluate| |#2|)))))) (-3703 (-12 (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (QUOTE (-783))) (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (LIST (QUOTE -284) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2535) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3050) (|devaluate| |#2|)))))) (-12 (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (QUOTE (-1013))) (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (LIST (QUOTE -284) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2535) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3050) (|devaluate| |#2|))))))) (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (LIST (QUOTE -561) (QUOTE (-791)))) (-3703 (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (QUOTE (-783))) (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (QUOTE (-1013))) (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (LIST (QUOTE -561) (QUOTE (-791)))) (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-791))))) (-3703 (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (LIST (QUOTE -561) (QUOTE (-791)))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-791)))))) 
 (-45 S R E) 
 ((|constructor| (NIL "Abelian monoid ring elements (not necessarily of finite support) of this ring are of the form formal SUM (r_i * e_i) where the r_i are coefficents and the e_i,{} elements of the ordered abelian monoid,{} are thought of as exponents or monomials. The monomials commute with each other,{} and with the coefficients (which themselves may or may not be commutative). See \\spadtype{FiniteAbelianMonoidRing} for the case of finite support a useful common model for polynomials and power series. Conceptually at least,{} only the non-zero terms are ever operated on.")) (/ (($ $ |#2|) "\\spad{p/c} divides \\spad{p} by the coefficient \\spad{c}.")) (|coefficient| ((|#2| $ |#3|) "\\spad{coefficient(p,{}e)} extracts the coefficient of the monomial with exponent \\spad{e} from polynomial \\spad{p},{} or returns zero if exponent is not present.")) (|reductum| (($ $) "\\spad{reductum(u)} returns \\spad{u} minus its leading monomial returns zero if handed the zero element.")) (|monomial| (($ |#2| |#3|) "\\spad{monomial(r,{}e)} makes a term from a coefficient \\spad{r} and an exponent \\spad{e}.")) (|monomial?| (((|Boolean|) $) "\\spad{monomial?(p)} tests if \\spad{p} is a single monomial.")) (|map| (($ (|Mapping| |#2| |#2|) $) "\\spad{map(fn,{}u)} maps function \\spad{fn} onto the coefficients of the non-zero monomials of \\spad{u}.")) (|degree| ((|#3| $) "\\spad{degree(p)} returns the maximum of the exponents of the terms of \\spad{p}.")) (|leadingMonomial| (($ $) "\\spad{leadingMonomial(p)} returns the monomial of \\spad{p} with the highest degree.")) (|leadingCoefficient| ((|#2| $) "\\spad{leadingCoefficient(p)} returns the coefficient highest degree term of \\spad{p}."))) 
 NIL 
@@ -150,7 +150,7 @@ NIL
 NIL 
 (-55 R |Row| |Col|) 
 ((|constructor| (NIL "\\indented{1}{TwoDimensionalArrayCategory is a general array category which} allows different representations and indexing schemes. Rows and columns may be extracted with rows returned as objects of type Row and columns returned as objects of type Col. The index of the 'first' row may be obtained by calling the function 'minRowIndex'. The index of the 'first' column may be obtained by calling the function 'minColIndex'. The index of the first element of a 'Row' is the same as the index of the first column in an array and vice versa.")) (|map!| (($ (|Mapping| |#1| |#1|) $) "\\spad{map!(f,{}a)} assign \\spad{a(i,{}j)} to \\spad{f(a(i,{}j))} for all \\spad{i,{} j}")) (|map| (($ (|Mapping| |#1| |#1| |#1|) $ $ |#1|) "\\spad{map(f,{}a,{}b,{}r)} returns \\spad{c},{} where \\spad{c(i,{}j) = f(a(i,{}j),{}b(i,{}j))} when both \\spad{a(i,{}j)} and \\spad{b(i,{}j)} exist; else \\spad{c(i,{}j) = f(r,{} b(i,{}j))} when \\spad{a(i,{}j)} does not exist; else \\spad{c(i,{}j) = f(a(i,{}j),{}r)} when \\spad{b(i,{}j)} does not exist; otherwise \\spad{c(i,{}j) = f(r,{}r)}.") (($ (|Mapping| |#1| |#1| |#1|) $ $) "\\spad{map(f,{}a,{}b)} returns \\spad{c},{} where \\spad{c(i,{}j) = f(a(i,{}j),{}b(i,{}j))} for all \\spad{i,{} j}") (($ (|Mapping| |#1| |#1|) $) "\\spad{map(f,{}a)} returns \\spad{b},{} where \\spad{b(i,{}j) = f(a(i,{}j))} for all \\spad{i,{} j}")) (|setColumn!| (($ $ (|Integer|) |#3|) "\\spad{setColumn!(m,{}j,{}v)} sets to \\spad{j}th column of \\spad{m} to \\spad{v}")) (|setRow!| (($ $ (|Integer|) |#2|) "\\spad{setRow!(m,{}i,{}v)} sets to \\spad{i}th row of \\spad{m} to \\spad{v}")) (|qsetelt!| ((|#1| $ (|Integer|) (|Integer|) |#1|) "\\spad{qsetelt!(m,{}i,{}j,{}r)} sets the element in the \\spad{i}th row and \\spad{j}th column of \\spad{m} to \\spad{r} NO error check to determine if indices are in proper ranges")) (|setelt| ((|#1| $ (|Integer|) (|Integer|) |#1|) "\\spad{setelt(m,{}i,{}j,{}r)} sets the element in the \\spad{i}th row and \\spad{j}th column of \\spad{m} to \\spad{r} error check to determine if indices are in proper ranges")) (|parts| (((|List| |#1|) $) "\\spad{parts(m)} returns a list of the elements of \\spad{m} in row major order")) (|column| ((|#3| $ (|Integer|)) "\\spad{column(m,{}j)} returns the \\spad{j}th column of \\spad{m} error check to determine if index is in proper ranges")) (|row| ((|#2| $ (|Integer|)) "\\spad{row(m,{}i)} returns the \\spad{i}th row of \\spad{m} error check to determine if index is in proper ranges")) (|qelt| ((|#1| $ (|Integer|) (|Integer|)) "\\spad{qelt(m,{}i,{}j)} returns the element in the \\spad{i}th row and \\spad{j}th column of the array \\spad{m} NO error check to determine if indices are in proper ranges")) (|elt| ((|#1| $ (|Integer|) (|Integer|) |#1|) "\\spad{elt(m,{}i,{}j,{}r)} returns the element in the \\spad{i}th row and \\spad{j}th column of the array \\spad{m},{} if \\spad{m} has an \\spad{i}th row and a \\spad{j}th column,{} and returns \\spad{r} otherwise") ((|#1| $ (|Integer|) (|Integer|)) "\\spad{elt(m,{}i,{}j)} returns the element in the \\spad{i}th row and \\spad{j}th column of the array \\spad{m} error check to determine if indices are in proper ranges")) (|ncols| (((|NonNegativeInteger|) $) "\\spad{ncols(m)} returns the number of columns in the array \\spad{m}")) (|nrows| (((|NonNegativeInteger|) $) "\\spad{nrows(m)} returns the number of rows in the array \\spad{m}")) (|maxColIndex| (((|Integer|) $) "\\spad{maxColIndex(m)} returns the index of the 'last' column of the array \\spad{m}")) (|minColIndex| (((|Integer|) $) "\\spad{minColIndex(m)} returns the index of the 'first' column of the array \\spad{m}")) (|maxRowIndex| (((|Integer|) $) "\\spad{maxRowIndex(m)} returns the index of the 'last' row of the array \\spad{m}")) (|minRowIndex| (((|Integer|) $) "\\spad{minRowIndex(m)} returns the index of the 'first' row of the array \\spad{m}")) (|fill!| (($ $ |#1|) "\\spad{fill!(m,{}r)} fills \\spad{m} with \\spad{r}\\spad{'s}")) (|new| (($ (|NonNegativeInteger|) (|NonNegativeInteger|) |#1|) "\\spad{new(m,{}n,{}r)} is an \\spad{m}-by-\\spad{n} array all of whose entries are \\spad{r}")) (|finiteAggregate| ((|attribute|) "two-dimensional arrays are finite")) (|shallowlyMutable| ((|attribute|) "one may destructively alter arrays"))) 
-((-4233 . T) (-4234 . T) (-2046 . T)) 
+((-4233 . T) (-4234 . T) (-2092 . T)) 
 NIL 
 (-56 A B) 
 ((|constructor| (NIL "\\indented{1}{This package provides tools for operating on one-dimensional arrays} with unary and binary functions involving different underlying types")) (|map| (((|OneDimensionalArray| |#2|) (|Mapping| |#2| |#1|) (|OneDimensionalArray| |#1|)) "\\spad{map(f,{}a)} applies function \\spad{f} to each member of one-dimensional array \\spad{a} resulting in a new one-dimensional array over a possibly different underlying domain.")) (|reduce| ((|#2| (|Mapping| |#2| |#1| |#2|) (|OneDimensionalArray| |#1|) |#2|) "\\spad{reduce(f,{}a,{}r)} applies function \\spad{f} to each successive element of the one-dimensional array \\spad{a} and an accumulant initialized to \\spad{r}. For example,{} \\spad{reduce(_+\\$Integer,{}[1,{}2,{}3],{}0)} does \\spad{3+(2+(1+0))}. Note: third argument \\spad{r} may be regarded as the identity element for the function \\spad{f}.")) (|scan| (((|OneDimensionalArray| |#2|) (|Mapping| |#2| |#1| |#2|) (|OneDimensionalArray| |#1|) |#2|) "\\spad{scan(f,{}a,{}r)} successively applies \\spad{reduce(f,{}x,{}r)} to more and more leading sub-arrays \\spad{x} of one-dimensional array \\spad{a}. More precisely,{} if \\spad{a} is \\spad{[a1,{}a2,{}...]},{} then \\spad{scan(f,{}a,{}r)} returns \\spad{[reduce(f,{}[a1],{}r),{}reduce(f,{}[a1,{}a2],{}r),{}...]}."))) 
@@ -159,64 +159,64 @@ NIL
 (-57 S) 
 ((|constructor| (NIL "This is the domain of 1-based one dimensional arrays")) (|oneDimensionalArray| (($ (|NonNegativeInteger|) |#1|) "\\spad{oneDimensionalArray(n,{}s)} creates an array from \\spad{n} copies of element \\spad{s}") (($ (|List| |#1|)) "\\spad{oneDimensionalArray(l)} creates an array from a list of elements \\spad{l}"))) 
 ((-4234 . T) (-4233 . T)) 
-((|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| (-521) (QUOTE (-784))) (|HasCategory| |#1| (QUOTE (-1013))) (-3703 (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| |#1| (QUOTE (-1013)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|))))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))))) 
+((|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| (-521) (QUOTE (-783))) (|HasCategory| |#1| (QUOTE (-1013))) (-3703 (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#1| (QUOTE (-1013)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|))))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))))) 
 (-58 R) 
 ((|constructor| (NIL "\\indented{1}{A TwoDimensionalArray is a two dimensional array with} 1-based indexing for both rows and columns.")) (|shallowlyMutable| ((|attribute|) "One may destructively alter TwoDimensionalArray\\spad{'s}."))) 
 ((-4233 . T) (-4234 . T)) 
-((|HasCategory| |#1| (QUOTE (-1013))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))))) 
-(-59 -2884) 
+((|HasCategory| |#1| (QUOTE (-1013))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))))) 
+(-59 -2890) 
 ((|constructor| (NIL "\\spadtype{ASP10} produces Fortran for Type 10 ASPs,{} needed for NAG routine \\axiomOpFrom{d02kef}{d02Package}. This ASP computes the values of a set of functions,{} for example:\\begin{verbatim}      SUBROUTINE COEFFN(P,Q,DQDL,X,ELAM,JINT)      DOUBLE PRECISION ELAM,P,Q,X,DQDL      INTEGER JINT      P=1.0D0      Q=((-1.0D0*X**3)+ELAM*X*X-2.0D0)/(X*X)      DQDL=1.0D0      RETURN      END\\end{verbatim}")) (|coerce| (($ (|Vector| (|FortranExpression| (|construct| (QUOTE JINT) (QUOTE X) (QUOTE ELAM)) (|construct|) (|MachineFloat|)))) "\\spad{coerce(f)} takes objects from the appropriate instantiation of \\spadtype{FortranExpression} and turns them into an ASP."))) 
 NIL 
 NIL 
-(-60 -2884) 
+(-60 -2890) 
 ((|constructor| (NIL "\\spadtype{Asp12} produces Fortran for Type 12 ASPs,{} needed for NAG routine \\axiomOpFrom{d02kef}{d02Package} etc.,{} for example:\\begin{verbatim}      SUBROUTINE MONIT (MAXIT,IFLAG,ELAM,FINFO)      DOUBLE PRECISION ELAM,FINFO(15)      INTEGER MAXIT,IFLAG      IF(MAXIT.EQ.-1)THEN        PRINT*,\"Output from Monit\"      ENDIF      PRINT*,MAXIT,IFLAG,ELAM,(FINFO(I),I=1,4)      RETURN      END\\end{verbatim}")) (|outputAsFortran| (((|Void|)) "\\spad{outputAsFortran()} generates the default code for \\spadtype{ASP12}."))) 
 NIL 
 NIL 
-(-61 -2884) 
+(-61 -2890) 
 ((|constructor| (NIL "\\spadtype{Asp19} produces Fortran for Type 19 ASPs,{} evaluating a set of functions and their jacobian at a given point,{} for example:\\begin{verbatim}      SUBROUTINE LSFUN2(M,N,XC,FVECC,FJACC,LJC)      DOUBLE PRECISION FVECC(M),FJACC(LJC,N),XC(N)      INTEGER M,N,LJC      INTEGER I,J      DO 25003 I=1,LJC        DO 25004 J=1,N          FJACC(I,J)=0.0D025004   CONTINUE25003 CONTINUE      FVECC(1)=((XC(1)-0.14D0)*XC(3)+(15.0D0*XC(1)-2.1D0)*XC(2)+1.0D0)/(     &XC(3)+15.0D0*XC(2))      FVECC(2)=((XC(1)-0.18D0)*XC(3)+(7.0D0*XC(1)-1.26D0)*XC(2)+1.0D0)/(     &XC(3)+7.0D0*XC(2))      FVECC(3)=((XC(1)-0.22D0)*XC(3)+(4.333333333333333D0*XC(1)-0.953333     &3333333333D0)*XC(2)+1.0D0)/(XC(3)+4.333333333333333D0*XC(2))      FVECC(4)=((XC(1)-0.25D0)*XC(3)+(3.0D0*XC(1)-0.75D0)*XC(2)+1.0D0)/(     &XC(3)+3.0D0*XC(2))      FVECC(5)=((XC(1)-0.29D0)*XC(3)+(2.2D0*XC(1)-0.6379999999999999D0)*     &XC(2)+1.0D0)/(XC(3)+2.2D0*XC(2))      FVECC(6)=((XC(1)-0.32D0)*XC(3)+(1.666666666666667D0*XC(1)-0.533333     &3333333333D0)*XC(2)+1.0D0)/(XC(3)+1.666666666666667D0*XC(2))      FVECC(7)=((XC(1)-0.35D0)*XC(3)+(1.285714285714286D0*XC(1)-0.45D0)*     &XC(2)+1.0D0)/(XC(3)+1.285714285714286D0*XC(2))      FVECC(8)=((XC(1)-0.39D0)*XC(3)+(XC(1)-0.39D0)*XC(2)+1.0D0)/(XC(3)+     &XC(2))      FVECC(9)=((XC(1)-0.37D0)*XC(3)+(XC(1)-0.37D0)*XC(2)+1.285714285714     &286D0)/(XC(3)+XC(2))      FVECC(10)=((XC(1)-0.58D0)*XC(3)+(XC(1)-0.58D0)*XC(2)+1.66666666666     &6667D0)/(XC(3)+XC(2))      FVECC(11)=((XC(1)-0.73D0)*XC(3)+(XC(1)-0.73D0)*XC(2)+2.2D0)/(XC(3)     &+XC(2))      FVECC(12)=((XC(1)-0.96D0)*XC(3)+(XC(1)-0.96D0)*XC(2)+3.0D0)/(XC(3)     &+XC(2))      FVECC(13)=((XC(1)-1.34D0)*XC(3)+(XC(1)-1.34D0)*XC(2)+4.33333333333     &3333D0)/(XC(3)+XC(2))      FVECC(14)=((XC(1)-2.1D0)*XC(3)+(XC(1)-2.1D0)*XC(2)+7.0D0)/(XC(3)+X     &C(2))      FVECC(15)=((XC(1)-4.39D0)*XC(3)+(XC(1)-4.39D0)*XC(2)+15.0D0)/(XC(3     &)+XC(2))      FJACC(1,1)=1.0D0      FJACC(1,2)=-15.0D0/(XC(3)**2+30.0D0*XC(2)*XC(3)+225.0D0*XC(2)**2)      FJACC(1,3)=-1.0D0/(XC(3)**2+30.0D0*XC(2)*XC(3)+225.0D0*XC(2)**2)      FJACC(2,1)=1.0D0      FJACC(2,2)=-7.0D0/(XC(3)**2+14.0D0*XC(2)*XC(3)+49.0D0*XC(2)**2)      FJACC(2,3)=-1.0D0/(XC(3)**2+14.0D0*XC(2)*XC(3)+49.0D0*XC(2)**2)      FJACC(3,1)=1.0D0      FJACC(3,2)=((-0.1110223024625157D-15*XC(3))-4.333333333333333D0)/(     &XC(3)**2+8.666666666666666D0*XC(2)*XC(3)+18.77777777777778D0*XC(2)     &**2)      FJACC(3,3)=(0.1110223024625157D-15*XC(2)-1.0D0)/(XC(3)**2+8.666666     &666666666D0*XC(2)*XC(3)+18.77777777777778D0*XC(2)**2)      FJACC(4,1)=1.0D0      FJACC(4,2)=-3.0D0/(XC(3)**2+6.0D0*XC(2)*XC(3)+9.0D0*XC(2)**2)      FJACC(4,3)=-1.0D0/(XC(3)**2+6.0D0*XC(2)*XC(3)+9.0D0*XC(2)**2)      FJACC(5,1)=1.0D0      FJACC(5,2)=((-0.1110223024625157D-15*XC(3))-2.2D0)/(XC(3)**2+4.399     &999999999999D0*XC(2)*XC(3)+4.839999999999998D0*XC(2)**2)      FJACC(5,3)=(0.1110223024625157D-15*XC(2)-1.0D0)/(XC(3)**2+4.399999     &999999999D0*XC(2)*XC(3)+4.839999999999998D0*XC(2)**2)      FJACC(6,1)=1.0D0      FJACC(6,2)=((-0.2220446049250313D-15*XC(3))-1.666666666666667D0)/(     &XC(3)**2+3.333333333333333D0*XC(2)*XC(3)+2.777777777777777D0*XC(2)     &**2)      FJACC(6,3)=(0.2220446049250313D-15*XC(2)-1.0D0)/(XC(3)**2+3.333333     &333333333D0*XC(2)*XC(3)+2.777777777777777D0*XC(2)**2)      FJACC(7,1)=1.0D0      FJACC(7,2)=((-0.5551115123125783D-16*XC(3))-1.285714285714286D0)/(     &XC(3)**2+2.571428571428571D0*XC(2)*XC(3)+1.653061224489796D0*XC(2)     &**2)      FJACC(7,3)=(0.5551115123125783D-16*XC(2)-1.0D0)/(XC(3)**2+2.571428     &571428571D0*XC(2)*XC(3)+1.653061224489796D0*XC(2)**2)      FJACC(8,1)=1.0D0      FJACC(8,2)=-1.0D0/(XC(3)**2+2.0D0*XC(2)*XC(3)+XC(2)**2)      FJACC(8,3)=-1.0D0/(XC(3)**2+2.0D0*XC(2)*XC(3)+XC(2)**2)      FJACC(9,1)=1.0D0      FJACC(9,2)=-1.285714285714286D0/(XC(3)**2+2.0D0*XC(2)*XC(3)+XC(2)*     &*2)      FJACC(9,3)=-1.285714285714286D0/(XC(3)**2+2.0D0*XC(2)*XC(3)+XC(2)*     &*2)      FJACC(10,1)=1.0D0      FJACC(10,2)=-1.666666666666667D0/(XC(3)**2+2.0D0*XC(2)*XC(3)+XC(2)     &**2)      FJACC(10,3)=-1.666666666666667D0/(XC(3)**2+2.0D0*XC(2)*XC(3)+XC(2)     &**2)      FJACC(11,1)=1.0D0      FJACC(11,2)=-2.2D0/(XC(3)**2+2.0D0*XC(2)*XC(3)+XC(2)**2)      FJACC(11,3)=-2.2D0/(XC(3)**2+2.0D0*XC(2)*XC(3)+XC(2)**2)      FJACC(12,1)=1.0D0      FJACC(12,2)=-3.0D0/(XC(3)**2+2.0D0*XC(2)*XC(3)+XC(2)**2)      FJACC(12,3)=-3.0D0/(XC(3)**2+2.0D0*XC(2)*XC(3)+XC(2)**2)      FJACC(13,1)=1.0D0      FJACC(13,2)=-4.333333333333333D0/(XC(3)**2+2.0D0*XC(2)*XC(3)+XC(2)     &**2)      FJACC(13,3)=-4.333333333333333D0/(XC(3)**2+2.0D0*XC(2)*XC(3)+XC(2)     &**2)      FJACC(14,1)=1.0D0      FJACC(14,2)=-7.0D0/(XC(3)**2+2.0D0*XC(2)*XC(3)+XC(2)**2)      FJACC(14,3)=-7.0D0/(XC(3)**2+2.0D0*XC(2)*XC(3)+XC(2)**2)      FJACC(15,1)=1.0D0      FJACC(15,2)=-15.0D0/(XC(3)**2+2.0D0*XC(2)*XC(3)+XC(2)**2)      FJACC(15,3)=-15.0D0/(XC(3)**2+2.0D0*XC(2)*XC(3)+XC(2)**2)      RETURN      END\\end{verbatim}")) (|coerce| (($ (|Vector| (|FortranExpression| (|construct|) (|construct| (QUOTE XC)) (|MachineFloat|)))) "\\spad{coerce(f)} takes objects from the appropriate instantiation of \\spadtype{FortranExpression} and turns them into an ASP."))) 
 NIL 
 NIL 
-(-62 -2884) 
+(-62 -2890) 
 ((|constructor| (NIL "\\spadtype{Asp1} produces Fortran for Type 1 ASPs,{} needed for various NAG routines. Type 1 ASPs take a univariate expression (in the symbol \\spad{X}) and turn it into a Fortran Function like the following:\\begin{verbatim}      DOUBLE PRECISION FUNCTION F(X)      DOUBLE PRECISION X      F=DSIN(X)      RETURN      END\\end{verbatim}")) (|coerce| (($ (|FortranExpression| (|construct| (QUOTE X)) (|construct|) (|MachineFloat|))) "\\spad{coerce(f)} takes an object from the appropriate instantiation of \\spadtype{FortranExpression} and turns it into an ASP."))) 
 NIL 
 NIL 
-(-63 -2884) 
+(-63 -2890) 
 ((|constructor| (NIL "\\spadtype{Asp20} produces Fortran for Type 20 ASPs,{} for example:\\begin{verbatim}      SUBROUTINE QPHESS(N,NROWH,NCOLH,JTHCOL,HESS,X,HX)      DOUBLE PRECISION HX(N),X(N),HESS(NROWH,NCOLH)      INTEGER JTHCOL,N,NROWH,NCOLH      HX(1)=2.0D0*X(1)      HX(2)=2.0D0*X(2)      HX(3)=2.0D0*X(4)+2.0D0*X(3)      HX(4)=2.0D0*X(4)+2.0D0*X(3)      HX(5)=2.0D0*X(5)      HX(6)=(-2.0D0*X(7))+(-2.0D0*X(6))      HX(7)=(-2.0D0*X(7))+(-2.0D0*X(6))      RETURN      END\\end{verbatim}")) (|coerce| (($ (|Matrix| (|FortranExpression| (|construct|) (|construct| (QUOTE X) (QUOTE HESS)) (|MachineFloat|)))) "\\spad{coerce(f)} takes objects from the appropriate instantiation of \\spadtype{FortranExpression} and turns them into an ASP."))) 
 NIL 
 NIL 
-(-64 -2884) 
+(-64 -2890) 
 ((|constructor| (NIL "\\spadtype{Asp24} produces Fortran for Type 24 ASPs which evaluate a multivariate function at a point (needed for NAG routine \\axiomOpFrom{e04jaf}{e04Package}),{} for example:\\begin{verbatim}      SUBROUTINE FUNCT1(N,XC,FC)      DOUBLE PRECISION FC,XC(N)      INTEGER N      FC=10.0D0*XC(4)**4+(-40.0D0*XC(1)*XC(4)**3)+(60.0D0*XC(1)**2+5     &.0D0)*XC(4)**2+((-10.0D0*XC(3))+(-40.0D0*XC(1)**3))*XC(4)+16.0D0*X     &C(3)**4+(-32.0D0*XC(2)*XC(3)**3)+(24.0D0*XC(2)**2+5.0D0)*XC(3)**2+     &(-8.0D0*XC(2)**3*XC(3))+XC(2)**4+100.0D0*XC(2)**2+20.0D0*XC(1)*XC(     &2)+10.0D0*XC(1)**4+XC(1)**2      RETURN      END\\end{verbatim}")) (|coerce| (($ (|FortranExpression| (|construct|) (|construct| (QUOTE XC)) (|MachineFloat|))) "\\spad{coerce(f)} takes an object from the appropriate instantiation of \\spadtype{FortranExpression} and turns it into an ASP."))) 
 NIL 
 NIL 
-(-65 -2884) 
+(-65 -2890) 
 ((|constructor| (NIL "\\spadtype{Asp27} produces Fortran for Type 27 ASPs,{} needed for NAG routine \\axiomOpFrom{f02fjf}{f02Package} ,{}for example:\\begin{verbatim}      FUNCTION DOT(IFLAG,N,Z,W,RWORK,LRWORK,IWORK,LIWORK)      DOUBLE PRECISION W(N),Z(N),RWORK(LRWORK)      INTEGER N,LIWORK,IFLAG,LRWORK,IWORK(LIWORK)      DOT=(W(16)+(-0.5D0*W(15)))*Z(16)+((-0.5D0*W(16))+W(15)+(-0.5D0*W(1     &4)))*Z(15)+((-0.5D0*W(15))+W(14)+(-0.5D0*W(13)))*Z(14)+((-0.5D0*W(     &14))+W(13)+(-0.5D0*W(12)))*Z(13)+((-0.5D0*W(13))+W(12)+(-0.5D0*W(1     &1)))*Z(12)+((-0.5D0*W(12))+W(11)+(-0.5D0*W(10)))*Z(11)+((-0.5D0*W(     &11))+W(10)+(-0.5D0*W(9)))*Z(10)+((-0.5D0*W(10))+W(9)+(-0.5D0*W(8))     &)*Z(9)+((-0.5D0*W(9))+W(8)+(-0.5D0*W(7)))*Z(8)+((-0.5D0*W(8))+W(7)     &+(-0.5D0*W(6)))*Z(7)+((-0.5D0*W(7))+W(6)+(-0.5D0*W(5)))*Z(6)+((-0.     &5D0*W(6))+W(5)+(-0.5D0*W(4)))*Z(5)+((-0.5D0*W(5))+W(4)+(-0.5D0*W(3     &)))*Z(4)+((-0.5D0*W(4))+W(3)+(-0.5D0*W(2)))*Z(3)+((-0.5D0*W(3))+W(     &2)+(-0.5D0*W(1)))*Z(2)+((-0.5D0*W(2))+W(1))*Z(1)      RETURN      END\\end{verbatim}"))) 
 NIL 
 NIL 
-(-66 -2884) 
+(-66 -2890) 
 ((|constructor| (NIL "\\spadtype{Asp28} produces Fortran for Type 28 ASPs,{} used in NAG routine \\axiomOpFrom{f02fjf}{f02Package},{} for example:\\begin{verbatim}      SUBROUTINE IMAGE(IFLAG,N,Z,W,RWORK,LRWORK,IWORK,LIWORK)      DOUBLE PRECISION Z(N),W(N),IWORK(LRWORK),RWORK(LRWORK)      INTEGER N,LIWORK,IFLAG,LRWORK      W(1)=0.01707454969713436D0*Z(16)+0.001747395874954051D0*Z(15)+0.00     &2106973900813502D0*Z(14)+0.002957434991769087D0*Z(13)+(-0.00700554     &0882865317D0*Z(12))+(-0.01219194009813166D0*Z(11))+0.0037230647365     &3087D0*Z(10)+0.04932374658377151D0*Z(9)+(-0.03586220812223305D0*Z(     &8))+(-0.04723268012114625D0*Z(7))+(-0.02434652144032987D0*Z(6))+0.     &2264766947290192D0*Z(5)+(-0.1385343580686922D0*Z(4))+(-0.116530050     &8238904D0*Z(3))+(-0.2803531651057233D0*Z(2))+1.019463911841327D0*Z     &(1)      W(2)=0.0227345011107737D0*Z(16)+0.008812321197398072D0*Z(15)+0.010     &94012210519586D0*Z(14)+(-0.01764072463999744D0*Z(13))+(-0.01357136     &72105995D0*Z(12))+0.00157466157362272D0*Z(11)+0.05258889186338282D     &0*Z(10)+(-0.01981532388243379D0*Z(9))+(-0.06095390688679697D0*Z(8)     &)+(-0.04153119955569051D0*Z(7))+0.2176561076571465D0*Z(6)+(-0.0532     &5555586632358D0*Z(5))+(-0.1688977368984641D0*Z(4))+(-0.32440166056     &67343D0*Z(3))+0.9128222941872173D0*Z(2)+(-0.2419652703415429D0*Z(1     &))      W(3)=0.03371198197190302D0*Z(16)+0.02021603150122265D0*Z(15)+(-0.0     &06607305534689702D0*Z(14))+(-0.03032392238968179D0*Z(13))+0.002033     &305231024948D0*Z(12)+0.05375944956767728D0*Z(11)+(-0.0163213312502     &9967D0*Z(10))+(-0.05483186562035512D0*Z(9))+(-0.04901428822579872D     &0*Z(8))+0.2091097927887612D0*Z(7)+(-0.05760560341383113D0*Z(6))+(-     &0.1236679206156403D0*Z(5))+(-0.3523683853026259D0*Z(4))+0.88929961     &32269974D0*Z(3)+(-0.2995429545781457D0*Z(2))+(-0.02986582812574917     &D0*Z(1))      W(4)=0.05141563713660119D0*Z(16)+0.005239165960779299D0*Z(15)+(-0.     &01623427735779699D0*Z(14))+(-0.01965809746040371D0*Z(13))+0.054688     &97337339577D0*Z(12)+(-0.014224695935687D0*Z(11))+(-0.0505181779315     &6355D0*Z(10))+(-0.04353074206076491D0*Z(9))+0.2012230497530726D0*Z     &(8)+(-0.06630874514535952D0*Z(7))+(-0.1280829963720053D0*Z(6))+(-0     &.305169742604165D0*Z(5))+0.8600427128450191D0*Z(4)+(-0.32415033802     &68184D0*Z(3))+(-0.09033531980693314D0*Z(2))+0.09089205517109111D0*     &Z(1)      W(5)=0.04556369767776375D0*Z(16)+(-0.001822737697581869D0*Z(15))+(     &-0.002512226501941856D0*Z(14))+0.02947046460707379D0*Z(13)+(-0.014     &45079632086177D0*Z(12))+(-0.05034242196614937D0*Z(11))+(-0.0376966     &3291725935D0*Z(10))+0.2171103102175198D0*Z(9)+(-0.0824949256021352     &4D0*Z(8))+(-0.1473995209288945D0*Z(7))+(-0.315042193418466D0*Z(6))     &+0.9591623347824002D0*Z(5)+(-0.3852396953763045D0*Z(4))+(-0.141718     &5427288274D0*Z(3))+(-0.03423495461011043D0*Z(2))+0.319820917706851     &6D0*Z(1)      W(6)=0.04015147277405744D0*Z(16)+0.01328585741341559D0*Z(15)+0.048     &26082005465965D0*Z(14)+(-0.04319641116207706D0*Z(13))+(-0.04931323     &319055762D0*Z(12))+(-0.03526886317505474D0*Z(11))+0.22295383396730     &01D0*Z(10)+(-0.07375317649315155D0*Z(9))+(-0.1589391311991561D0*Z(     &8))+(-0.328001910890377D0*Z(7))+0.952576555482747D0*Z(6)+(-0.31583     &09975786731D0*Z(5))+(-0.1846882042225383D0*Z(4))+(-0.0703762046700     &4427D0*Z(3))+0.2311852964327382D0*Z(2)+0.04254083491825025D0*Z(1)      W(7)=0.06069778964023718D0*Z(16)+0.06681263884671322D0*Z(15)+(-0.0     &2113506688615768D0*Z(14))+(-0.083996867458326D0*Z(13))+(-0.0329843     &8523869648D0*Z(12))+0.2276878326327734D0*Z(11)+(-0.067356038933017     &95D0*Z(10))+(-0.1559813965382218D0*Z(9))+(-0.3363262957694705D0*Z(     &8))+0.9442791158560948D0*Z(7)+(-0.3199955249404657D0*Z(6))+(-0.136     &2463839920727D0*Z(5))+(-0.1006185171570586D0*Z(4))+0.2057504515015     &423D0*Z(3)+(-0.02065879269286707D0*Z(2))+0.03160990266745513D0*Z(1     &)      W(8)=0.126386868896738D0*Z(16)+0.002563370039476418D0*Z(15)+(-0.05     &581757739455641D0*Z(14))+(-0.07777893205900685D0*Z(13))+0.23117338     &45834199D0*Z(12)+(-0.06031581134427592D0*Z(11))+(-0.14805474755869     &52D0*Z(10))+(-0.3364014128402243D0*Z(9))+0.9364014128402244D0*Z(8)     &+(-0.3269452524413048D0*Z(7))+(-0.1396841886557241D0*Z(6))+(-0.056     &1733845834199D0*Z(5))+0.1777789320590069D0*Z(4)+(-0.04418242260544     &359D0*Z(3))+(-0.02756337003947642D0*Z(2))+0.07361313110326199D0*Z(     &1)      W(9)=0.07361313110326199D0*Z(16)+(-0.02756337003947642D0*Z(15))+(-     &0.04418242260544359D0*Z(14))+0.1777789320590069D0*Z(13)+(-0.056173     &3845834199D0*Z(12))+(-0.1396841886557241D0*Z(11))+(-0.326945252441     &3048D0*Z(10))+0.9364014128402244D0*Z(9)+(-0.3364014128402243D0*Z(8     &))+(-0.1480547475586952D0*Z(7))+(-0.06031581134427592D0*Z(6))+0.23     &11733845834199D0*Z(5)+(-0.07777893205900685D0*Z(4))+(-0.0558175773     &9455641D0*Z(3))+0.002563370039476418D0*Z(2)+0.126386868896738D0*Z(     &1)      W(10)=0.03160990266745513D0*Z(16)+(-0.02065879269286707D0*Z(15))+0     &.2057504515015423D0*Z(14)+(-0.1006185171570586D0*Z(13))+(-0.136246     &3839920727D0*Z(12))+(-0.3199955249404657D0*Z(11))+0.94427911585609     &48D0*Z(10)+(-0.3363262957694705D0*Z(9))+(-0.1559813965382218D0*Z(8     &))+(-0.06735603893301795D0*Z(7))+0.2276878326327734D0*Z(6)+(-0.032     &98438523869648D0*Z(5))+(-0.083996867458326D0*Z(4))+(-0.02113506688     &615768D0*Z(3))+0.06681263884671322D0*Z(2)+0.06069778964023718D0*Z(     &1)      W(11)=0.04254083491825025D0*Z(16)+0.2311852964327382D0*Z(15)+(-0.0     &7037620467004427D0*Z(14))+(-0.1846882042225383D0*Z(13))+(-0.315830     &9975786731D0*Z(12))+0.952576555482747D0*Z(11)+(-0.328001910890377D     &0*Z(10))+(-0.1589391311991561D0*Z(9))+(-0.07375317649315155D0*Z(8)     &)+0.2229538339673001D0*Z(7)+(-0.03526886317505474D0*Z(6))+(-0.0493     &1323319055762D0*Z(5))+(-0.04319641116207706D0*Z(4))+0.048260820054     &65965D0*Z(3)+0.01328585741341559D0*Z(2)+0.04015147277405744D0*Z(1)      W(12)=0.3198209177068516D0*Z(16)+(-0.03423495461011043D0*Z(15))+(-     &0.1417185427288274D0*Z(14))+(-0.3852396953763045D0*Z(13))+0.959162     &3347824002D0*Z(12)+(-0.315042193418466D0*Z(11))+(-0.14739952092889     &45D0*Z(10))+(-0.08249492560213524D0*Z(9))+0.2171103102175198D0*Z(8     &)+(-0.03769663291725935D0*Z(7))+(-0.05034242196614937D0*Z(6))+(-0.     &01445079632086177D0*Z(5))+0.02947046460707379D0*Z(4)+(-0.002512226     &501941856D0*Z(3))+(-0.001822737697581869D0*Z(2))+0.045563697677763     &75D0*Z(1)      W(13)=0.09089205517109111D0*Z(16)+(-0.09033531980693314D0*Z(15))+(     &-0.3241503380268184D0*Z(14))+0.8600427128450191D0*Z(13)+(-0.305169     &742604165D0*Z(12))+(-0.1280829963720053D0*Z(11))+(-0.0663087451453     &5952D0*Z(10))+0.2012230497530726D0*Z(9)+(-0.04353074206076491D0*Z(     &8))+(-0.05051817793156355D0*Z(7))+(-0.014224695935687D0*Z(6))+0.05     &468897337339577D0*Z(5)+(-0.01965809746040371D0*Z(4))+(-0.016234277     &35779699D0*Z(3))+0.005239165960779299D0*Z(2)+0.05141563713660119D0     &*Z(1)      W(14)=(-0.02986582812574917D0*Z(16))+(-0.2995429545781457D0*Z(15))     &+0.8892996132269974D0*Z(14)+(-0.3523683853026259D0*Z(13))+(-0.1236     &679206156403D0*Z(12))+(-0.05760560341383113D0*Z(11))+0.20910979278     &87612D0*Z(10)+(-0.04901428822579872D0*Z(9))+(-0.05483186562035512D     &0*Z(8))+(-0.01632133125029967D0*Z(7))+0.05375944956767728D0*Z(6)+0     &.002033305231024948D0*Z(5)+(-0.03032392238968179D0*Z(4))+(-0.00660     &7305534689702D0*Z(3))+0.02021603150122265D0*Z(2)+0.033711981971903     &02D0*Z(1)      W(15)=(-0.2419652703415429D0*Z(16))+0.9128222941872173D0*Z(15)+(-0     &.3244016605667343D0*Z(14))+(-0.1688977368984641D0*Z(13))+(-0.05325     &555586632358D0*Z(12))+0.2176561076571465D0*Z(11)+(-0.0415311995556     &9051D0*Z(10))+(-0.06095390688679697D0*Z(9))+(-0.01981532388243379D     &0*Z(8))+0.05258889186338282D0*Z(7)+0.00157466157362272D0*Z(6)+(-0.     &0135713672105995D0*Z(5))+(-0.01764072463999744D0*Z(4))+0.010940122     &10519586D0*Z(3)+0.008812321197398072D0*Z(2)+0.0227345011107737D0*Z     &(1)      W(16)=1.019463911841327D0*Z(16)+(-0.2803531651057233D0*Z(15))+(-0.     &1165300508238904D0*Z(14))+(-0.1385343580686922D0*Z(13))+0.22647669     &47290192D0*Z(12)+(-0.02434652144032987D0*Z(11))+(-0.04723268012114     &625D0*Z(10))+(-0.03586220812223305D0*Z(9))+0.04932374658377151D0*Z     &(8)+0.00372306473653087D0*Z(7)+(-0.01219194009813166D0*Z(6))+(-0.0     &07005540882865317D0*Z(5))+0.002957434991769087D0*Z(4)+0.0021069739     &00813502D0*Z(3)+0.001747395874954051D0*Z(2)+0.01707454969713436D0*     &Z(1)      RETURN      END\\end{verbatim}"))) 
 NIL 
 NIL 
-(-67 -2884) 
+(-67 -2890) 
 ((|constructor| (NIL "\\spadtype{Asp29} produces Fortran for Type 29 ASPs,{} needed for NAG routine \\axiomOpFrom{f02fjf}{f02Package},{} for example:\\begin{verbatim}      SUBROUTINE MONIT(ISTATE,NEXTIT,NEVALS,NEVECS,K,F,D)      DOUBLE PRECISION D(K),F(K)      INTEGER K,NEXTIT,NEVALS,NVECS,ISTATE      CALL F02FJZ(ISTATE,NEXTIT,NEVALS,NEVECS,K,F,D)      RETURN      END\\end{verbatim}")) (|outputAsFortran| (((|Void|)) "\\spad{outputAsFortran()} generates the default code for \\spadtype{ASP29}."))) 
 NIL 
 NIL 
-(-68 -2884) 
+(-68 -2890) 
 ((|constructor| (NIL "\\spadtype{Asp30} produces Fortran for Type 30 ASPs,{} needed for NAG routine \\axiomOpFrom{f04qaf}{f04Package},{} for example:\\begin{verbatim}      SUBROUTINE APROD(MODE,M,N,X,Y,RWORK,LRWORK,IWORK,LIWORK)      DOUBLE PRECISION X(N),Y(M),RWORK(LRWORK)      INTEGER M,N,LIWORK,IFAIL,LRWORK,IWORK(LIWORK),MODE      DOUBLE PRECISION A(5,5)      EXTERNAL F06PAF      A(1,1)=1.0D0      A(1,2)=0.0D0      A(1,3)=0.0D0      A(1,4)=-1.0D0      A(1,5)=0.0D0      A(2,1)=0.0D0      A(2,2)=1.0D0      A(2,3)=0.0D0      A(2,4)=0.0D0      A(2,5)=-1.0D0      A(3,1)=0.0D0      A(3,2)=0.0D0      A(3,3)=1.0D0      A(3,4)=-1.0D0      A(3,5)=0.0D0      A(4,1)=-1.0D0      A(4,2)=0.0D0      A(4,3)=-1.0D0      A(4,4)=4.0D0      A(4,5)=-1.0D0      A(5,1)=0.0D0      A(5,2)=-1.0D0      A(5,3)=0.0D0      A(5,4)=-1.0D0      A(5,5)=4.0D0      IF(MODE.EQ.1)THEN        CALL F06PAF('N',M,N,1.0D0,A,M,X,1,1.0D0,Y,1)      ELSEIF(MODE.EQ.2)THEN        CALL F06PAF('T',M,N,1.0D0,A,M,Y,1,1.0D0,X,1)      ENDIF      RETURN      END\\end{verbatim}"))) 
 NIL 
 NIL 
-(-69 -2884) 
+(-69 -2890) 
 ((|constructor| (NIL "\\spadtype{Asp31} produces Fortran for Type 31 ASPs,{} needed for NAG routine \\axiomOpFrom{d02ejf}{d02Package},{} for example:\\begin{verbatim}      SUBROUTINE PEDERV(X,Y,PW)      DOUBLE PRECISION X,Y(*)      DOUBLE PRECISION PW(3,3)      PW(1,1)=-0.03999999999999999D0      PW(1,2)=10000.0D0*Y(3)      PW(1,3)=10000.0D0*Y(2)      PW(2,1)=0.03999999999999999D0      PW(2,2)=(-10000.0D0*Y(3))+(-60000000.0D0*Y(2))      PW(2,3)=-10000.0D0*Y(2)      PW(3,1)=0.0D0      PW(3,2)=60000000.0D0*Y(2)      PW(3,3)=0.0D0      RETURN      END\\end{verbatim}")) (|coerce| (($ (|Vector| (|FortranExpression| (|construct| (QUOTE X)) (|construct| (QUOTE Y)) (|MachineFloat|)))) "\\spad{coerce(f)} takes objects from the appropriate instantiation of \\spadtype{FortranExpression} and turns them into an ASP."))) 
 NIL 
 NIL 
-(-70 -2884) 
+(-70 -2890) 
 ((|constructor| (NIL "\\spadtype{Asp33} produces Fortran for Type 33 ASPs,{} needed for NAG routine \\axiomOpFrom{d02kef}{d02Package}. The code is a dummy ASP:\\begin{verbatim}      SUBROUTINE REPORT(X,V,JINT)      DOUBLE PRECISION V(3),X      INTEGER JINT      RETURN      END\\end{verbatim}")) (|outputAsFortran| (((|Void|)) "\\spad{outputAsFortran()} generates the default code for \\spadtype{ASP33}."))) 
 NIL 
 NIL 
-(-71 -2884) 
+(-71 -2890) 
 ((|constructor| (NIL "\\spadtype{Asp34} produces Fortran for Type 34 ASPs,{} needed for NAG routine \\axiomOpFrom{f04mbf}{f04Package},{} for example:\\begin{verbatim}      SUBROUTINE MSOLVE(IFLAG,N,X,Y,RWORK,LRWORK,IWORK,LIWORK)      DOUBLE PRECISION RWORK(LRWORK),X(N),Y(N)      INTEGER I,J,N,LIWORK,IFLAG,LRWORK,IWORK(LIWORK)      DOUBLE PRECISION W1(3),W2(3),MS(3,3)      IFLAG=-1      MS(1,1)=2.0D0      MS(1,2)=1.0D0      MS(1,3)=0.0D0      MS(2,1)=1.0D0      MS(2,2)=2.0D0      MS(2,3)=1.0D0      MS(3,1)=0.0D0      MS(3,2)=1.0D0      MS(3,3)=2.0D0      CALL F04ASF(MS,N,X,N,Y,W1,W2,IFLAG)      IFLAG=-IFLAG      RETURN      END\\end{verbatim}"))) 
 NIL 
 NIL 
-(-72 -2884) 
+(-72 -2890) 
 ((|constructor| (NIL "\\spadtype{Asp35} produces Fortran for Type 35 ASPs,{} needed for NAG routines \\axiomOpFrom{c05pbf}{c05Package},{} \\axiomOpFrom{c05pcf}{c05Package},{} for example:\\begin{verbatim}      SUBROUTINE FCN(N,X,FVEC,FJAC,LDFJAC,IFLAG)      DOUBLE PRECISION X(N),FVEC(N),FJAC(LDFJAC,N)      INTEGER LDFJAC,N,IFLAG      IF(IFLAG.EQ.1)THEN        FVEC(1)=(-1.0D0*X(2))+X(1)        FVEC(2)=(-1.0D0*X(3))+2.0D0*X(2)        FVEC(3)=3.0D0*X(3)      ELSEIF(IFLAG.EQ.2)THEN        FJAC(1,1)=1.0D0        FJAC(1,2)=-1.0D0        FJAC(1,3)=0.0D0        FJAC(2,1)=0.0D0        FJAC(2,2)=2.0D0        FJAC(2,3)=-1.0D0        FJAC(3,1)=0.0D0        FJAC(3,2)=0.0D0        FJAC(3,3)=3.0D0      ENDIF      END\\end{verbatim}")) (|coerce| (($ (|Vector| (|FortranExpression| (|construct|) (|construct| (QUOTE X)) (|MachineFloat|)))) "\\spad{coerce(f)} takes objects from the appropriate instantiation of \\spadtype{FortranExpression} and turns them into an ASP."))) 
 NIL 
 NIL 
@@ -228,55 +228,55 @@ NIL
 ((|constructor| (NIL "\\spadtype{Asp42} produces Fortran for Type 42 ASPs,{} needed for NAG routines \\axiomOpFrom{d02raf}{d02Package} and \\axiomOpFrom{d02saf}{d02Package} in particular. These ASPs are in fact three Fortran routines which return a vector of functions,{} and their derivatives \\spad{wrt} \\spad{Y}(\\spad{i}) and also a continuation parameter EPS,{} for example:\\begin{verbatim}      SUBROUTINE G(EPS,YA,YB,BC,N)      DOUBLE PRECISION EPS,YA(N),YB(N),BC(N)      INTEGER N      BC(1)=YA(1)      BC(2)=YA(2)      BC(3)=YB(2)-1.0D0      RETURN      END      SUBROUTINE JACOBG(EPS,YA,YB,AJ,BJ,N)      DOUBLE PRECISION EPS,YA(N),AJ(N,N),BJ(N,N),YB(N)      INTEGER N      AJ(1,1)=1.0D0      AJ(1,2)=0.0D0      AJ(1,3)=0.0D0      AJ(2,1)=0.0D0      AJ(2,2)=1.0D0      AJ(2,3)=0.0D0      AJ(3,1)=0.0D0      AJ(3,2)=0.0D0      AJ(3,3)=0.0D0      BJ(1,1)=0.0D0      BJ(1,2)=0.0D0      BJ(1,3)=0.0D0      BJ(2,1)=0.0D0      BJ(2,2)=0.0D0      BJ(2,3)=0.0D0      BJ(3,1)=0.0D0      BJ(3,2)=1.0D0      BJ(3,3)=0.0D0      RETURN      END      SUBROUTINE JACGEP(EPS,YA,YB,BCEP,N)      DOUBLE PRECISION EPS,YA(N),YB(N),BCEP(N)      INTEGER N      BCEP(1)=0.0D0      BCEP(2)=0.0D0      BCEP(3)=0.0D0      RETURN      END\\end{verbatim}")) (|coerce| (($ (|Vector| (|FortranExpression| (|construct| (QUOTE EPS)) (|construct| (QUOTE YA) (QUOTE YB)) (|MachineFloat|)))) "\\spad{coerce(f)} takes objects from the appropriate instantiation of \\spadtype{FortranExpression} and turns them into an ASP."))) 
 NIL 
 NIL 
-(-75 -2884) 
+(-75 -2890) 
 ((|constructor| (NIL "\\spadtype{Asp49} produces Fortran for Type 49 ASPs,{} needed for NAG routines \\axiomOpFrom{e04dgf}{e04Package},{} \\axiomOpFrom{e04ucf}{e04Package},{} for example:\\begin{verbatim}      SUBROUTINE OBJFUN(MODE,N,X,OBJF,OBJGRD,NSTATE,IUSER,USER)      DOUBLE PRECISION X(N),OBJF,OBJGRD(N),USER(*)      INTEGER N,IUSER(*),MODE,NSTATE      OBJF=X(4)*X(9)+((-1.0D0*X(5))+X(3))*X(8)+((-1.0D0*X(3))+X(1))*X(7)     &+(-1.0D0*X(2)*X(6))      OBJGRD(1)=X(7)      OBJGRD(2)=-1.0D0*X(6)      OBJGRD(3)=X(8)+(-1.0D0*X(7))      OBJGRD(4)=X(9)      OBJGRD(5)=-1.0D0*X(8)      OBJGRD(6)=-1.0D0*X(2)      OBJGRD(7)=(-1.0D0*X(3))+X(1)      OBJGRD(8)=(-1.0D0*X(5))+X(3)      OBJGRD(9)=X(4)      RETURN      END\\end{verbatim}")) (|coerce| (($ (|FortranExpression| (|construct|) (|construct| (QUOTE X)) (|MachineFloat|))) "\\spad{coerce(f)} takes an object from the appropriate instantiation of \\spadtype{FortranExpression} and turns it into an ASP."))) 
 NIL 
 NIL 
-(-76 -2884) 
+(-76 -2890) 
 ((|constructor| (NIL "\\spadtype{Asp4} produces Fortran for Type 4 ASPs,{} which take an expression in \\spad{X}(1) .. \\spad{X}(NDIM) and produce a real function of the form:\\begin{verbatim}      DOUBLE PRECISION FUNCTION FUNCTN(NDIM,X)      DOUBLE PRECISION X(NDIM)      INTEGER NDIM      FUNCTN=(4.0D0*X(1)*X(3)**2*DEXP(2.0D0*X(1)*X(3)))/(X(4)**2+(2.0D0*     &X(2)+2.0D0)*X(4)+X(2)**2+2.0D0*X(2)+1.0D0)      RETURN      END\\end{verbatim}")) (|coerce| (($ (|FortranExpression| (|construct|) (|construct| (QUOTE X)) (|MachineFloat|))) "\\spad{coerce(f)} takes an object from the appropriate instantiation of \\spadtype{FortranExpression} and turns it into an ASP."))) 
 NIL 
 NIL 
-(-77 -2884) 
+(-77 -2890) 
 ((|constructor| (NIL "\\spadtype{Asp50} produces Fortran for Type 50 ASPs,{} needed for NAG routine \\axiomOpFrom{e04fdf}{e04Package},{} for example:\\begin{verbatim}      SUBROUTINE LSFUN1(M,N,XC,FVECC)      DOUBLE PRECISION FVECC(M),XC(N)      INTEGER I,M,N      FVECC(1)=((XC(1)-2.4D0)*XC(3)+(15.0D0*XC(1)-36.0D0)*XC(2)+1.0D0)/(     &XC(3)+15.0D0*XC(2))      FVECC(2)=((XC(1)-2.8D0)*XC(3)+(7.0D0*XC(1)-19.6D0)*XC(2)+1.0D0)/(X     &C(3)+7.0D0*XC(2))      FVECC(3)=((XC(1)-3.2D0)*XC(3)+(4.333333333333333D0*XC(1)-13.866666     &66666667D0)*XC(2)+1.0D0)/(XC(3)+4.333333333333333D0*XC(2))      FVECC(4)=((XC(1)-3.5D0)*XC(3)+(3.0D0*XC(1)-10.5D0)*XC(2)+1.0D0)/(X     &C(3)+3.0D0*XC(2))      FVECC(5)=((XC(1)-3.9D0)*XC(3)+(2.2D0*XC(1)-8.579999999999998D0)*XC     &(2)+1.0D0)/(XC(3)+2.2D0*XC(2))      FVECC(6)=((XC(1)-4.199999999999999D0)*XC(3)+(1.666666666666667D0*X     &C(1)-7.0D0)*XC(2)+1.0D0)/(XC(3)+1.666666666666667D0*XC(2))      FVECC(7)=((XC(1)-4.5D0)*XC(3)+(1.285714285714286D0*XC(1)-5.7857142     &85714286D0)*XC(2)+1.0D0)/(XC(3)+1.285714285714286D0*XC(2))      FVECC(8)=((XC(1)-4.899999999999999D0)*XC(3)+(XC(1)-4.8999999999999     &99D0)*XC(2)+1.0D0)/(XC(3)+XC(2))      FVECC(9)=((XC(1)-4.699999999999999D0)*XC(3)+(XC(1)-4.6999999999999     &99D0)*XC(2)+1.285714285714286D0)/(XC(3)+XC(2))      FVECC(10)=((XC(1)-6.8D0)*XC(3)+(XC(1)-6.8D0)*XC(2)+1.6666666666666     &67D0)/(XC(3)+XC(2))      FVECC(11)=((XC(1)-8.299999999999999D0)*XC(3)+(XC(1)-8.299999999999     &999D0)*XC(2)+2.2D0)/(XC(3)+XC(2))      FVECC(12)=((XC(1)-10.6D0)*XC(3)+(XC(1)-10.6D0)*XC(2)+3.0D0)/(XC(3)     &+XC(2))      FVECC(13)=((XC(1)-1.34D0)*XC(3)+(XC(1)-1.34D0)*XC(2)+4.33333333333     &3333D0)/(XC(3)+XC(2))      FVECC(14)=((XC(1)-2.1D0)*XC(3)+(XC(1)-2.1D0)*XC(2)+7.0D0)/(XC(3)+X     &C(2))      FVECC(15)=((XC(1)-4.39D0)*XC(3)+(XC(1)-4.39D0)*XC(2)+15.0D0)/(XC(3     &)+XC(2))      END\\end{verbatim}")) (|coerce| (($ (|Vector| (|FortranExpression| (|construct|) (|construct| (QUOTE XC)) (|MachineFloat|)))) "\\spad{coerce(f)} takes objects from the appropriate instantiation of \\spadtype{FortranExpression} and turns them into an ASP."))) 
 NIL 
 NIL 
-(-78 -2884) 
+(-78 -2890) 
 ((|constructor| (NIL "\\spadtype{Asp55} produces Fortran for Type 55 ASPs,{} needed for NAG routines \\axiomOpFrom{e04dgf}{e04Package} and \\axiomOpFrom{e04ucf}{e04Package},{} for example:\\begin{verbatim}      SUBROUTINE CONFUN(MODE,NCNLN,N,NROWJ,NEEDC,X,C,CJAC,NSTATE,IUSER     &,USER)      DOUBLE PRECISION C(NCNLN),X(N),CJAC(NROWJ,N),USER(*)      INTEGER N,IUSER(*),NEEDC(NCNLN),NROWJ,MODE,NCNLN,NSTATE      IF(NEEDC(1).GT.0)THEN        C(1)=X(6)**2+X(1)**2        CJAC(1,1)=2.0D0*X(1)        CJAC(1,2)=0.0D0        CJAC(1,3)=0.0D0        CJAC(1,4)=0.0D0        CJAC(1,5)=0.0D0        CJAC(1,6)=2.0D0*X(6)      ENDIF      IF(NEEDC(2).GT.0)THEN        C(2)=X(2)**2+(-2.0D0*X(1)*X(2))+X(1)**2        CJAC(2,1)=(-2.0D0*X(2))+2.0D0*X(1)        CJAC(2,2)=2.0D0*X(2)+(-2.0D0*X(1))        CJAC(2,3)=0.0D0        CJAC(2,4)=0.0D0        CJAC(2,5)=0.0D0        CJAC(2,6)=0.0D0      ENDIF      IF(NEEDC(3).GT.0)THEN        C(3)=X(3)**2+(-2.0D0*X(1)*X(3))+X(2)**2+X(1)**2        CJAC(3,1)=(-2.0D0*X(3))+2.0D0*X(1)        CJAC(3,2)=2.0D0*X(2)        CJAC(3,3)=2.0D0*X(3)+(-2.0D0*X(1))        CJAC(3,4)=0.0D0        CJAC(3,5)=0.0D0        CJAC(3,6)=0.0D0      ENDIF      RETURN      END\\end{verbatim}")) (|coerce| (($ (|Vector| (|FortranExpression| (|construct|) (|construct| (QUOTE X)) (|MachineFloat|)))) "\\spad{coerce(f)} takes objects from the appropriate instantiation of \\spadtype{FortranExpression} and turns them into an ASP."))) 
 NIL 
 NIL 
-(-79 -2884) 
+(-79 -2890) 
 ((|constructor| (NIL "\\spadtype{Asp6} produces Fortran for Type 6 ASPs,{} needed for NAG routines \\axiomOpFrom{c05nbf}{c05Package},{} \\axiomOpFrom{c05ncf}{c05Package}. These represent vectors of functions of \\spad{X}(\\spad{i}) and look like:\\begin{verbatim}      SUBROUTINE FCN(N,X,FVEC,IFLAG)      DOUBLE PRECISION X(N),FVEC(N)      INTEGER N,IFLAG      FVEC(1)=(-2.0D0*X(2))+(-2.0D0*X(1)**2)+3.0D0*X(1)+1.0D0      FVEC(2)=(-2.0D0*X(3))+(-2.0D0*X(2)**2)+3.0D0*X(2)+(-1.0D0*X(1))+1.     &0D0      FVEC(3)=(-2.0D0*X(4))+(-2.0D0*X(3)**2)+3.0D0*X(3)+(-1.0D0*X(2))+1.     &0D0      FVEC(4)=(-2.0D0*X(5))+(-2.0D0*X(4)**2)+3.0D0*X(4)+(-1.0D0*X(3))+1.     &0D0      FVEC(5)=(-2.0D0*X(6))+(-2.0D0*X(5)**2)+3.0D0*X(5)+(-1.0D0*X(4))+1.     &0D0      FVEC(6)=(-2.0D0*X(7))+(-2.0D0*X(6)**2)+3.0D0*X(6)+(-1.0D0*X(5))+1.     &0D0      FVEC(7)=(-2.0D0*X(8))+(-2.0D0*X(7)**2)+3.0D0*X(7)+(-1.0D0*X(6))+1.     &0D0      FVEC(8)=(-2.0D0*X(9))+(-2.0D0*X(8)**2)+3.0D0*X(8)+(-1.0D0*X(7))+1.     &0D0      FVEC(9)=(-2.0D0*X(9)**2)+3.0D0*X(9)+(-1.0D0*X(8))+1.0D0      RETURN      END\\end{verbatim}")) (|coerce| (($ (|Vector| (|FortranExpression| (|construct|) (|construct| (QUOTE X)) (|MachineFloat|)))) "\\spad{coerce(f)} takes objects from the appropriate instantiation of \\spadtype{FortranExpression} and turns them into an ASP."))) 
 NIL 
 NIL 
-(-80 -2884) 
+(-80 -2890) 
 ((|constructor| (NIL "\\spadtype{Asp73} produces Fortran for Type 73 ASPs,{} needed for NAG routine \\axiomOpFrom{d03eef}{d03Package},{} for example:\\begin{verbatim}      SUBROUTINE PDEF(X,Y,ALPHA,BETA,GAMMA,DELTA,EPSOLN,PHI,PSI)      DOUBLE PRECISION ALPHA,EPSOLN,PHI,X,Y,BETA,DELTA,GAMMA,PSI      ALPHA=DSIN(X)      BETA=Y      GAMMA=X*Y      DELTA=DCOS(X)*DSIN(Y)      EPSOLN=Y+X      PHI=X      PSI=Y      RETURN      END\\end{verbatim}")) (|coerce| (($ (|Vector| (|FortranExpression| (|construct| (QUOTE X) (QUOTE Y)) (|construct|) (|MachineFloat|)))) "\\spad{coerce(f)} takes objects from the appropriate instantiation of \\spadtype{FortranExpression} and turns them into an ASP."))) 
 NIL 
 NIL 
-(-81 -2884) 
+(-81 -2890) 
 ((|constructor| (NIL "\\spadtype{Asp74} produces Fortran for Type 74 ASPs,{} needed for NAG routine \\axiomOpFrom{d03eef}{d03Package},{} for example:\\begin{verbatim}      SUBROUTINE BNDY(X,Y,A,B,C,IBND)      DOUBLE PRECISION A,B,C,X,Y      INTEGER IBND      IF(IBND.EQ.0)THEN        A=0.0D0        B=1.0D0        C=-1.0D0*DSIN(X)      ELSEIF(IBND.EQ.1)THEN        A=1.0D0        B=0.0D0        C=DSIN(X)*DSIN(Y)      ELSEIF(IBND.EQ.2)THEN        A=1.0D0        B=0.0D0        C=DSIN(X)*DSIN(Y)      ELSEIF(IBND.EQ.3)THEN        A=0.0D0        B=1.0D0        C=-1.0D0*DSIN(Y)      ENDIF      END\\end{verbatim}")) (|coerce| (($ (|Matrix| (|FortranExpression| (|construct| (QUOTE X) (QUOTE Y)) (|construct|) (|MachineFloat|)))) "\\spad{coerce(f)} takes objects from the appropriate instantiation of \\spadtype{FortranExpression} and turns them into an ASP."))) 
 NIL 
 NIL 
-(-82 -2884) 
+(-82 -2890) 
 ((|constructor| (NIL "\\spadtype{Asp77} produces Fortran for Type 77 ASPs,{} needed for NAG routine \\axiomOpFrom{d02gbf}{d02Package},{} for example:\\begin{verbatim}      SUBROUTINE FCNF(X,F)      DOUBLE PRECISION X      DOUBLE PRECISION F(2,2)      F(1,1)=0.0D0      F(1,2)=1.0D0      F(2,1)=0.0D0      F(2,2)=-10.0D0      RETURN      END\\end{verbatim}")) (|coerce| (($ (|Matrix| (|FortranExpression| (|construct| (QUOTE X)) (|construct|) (|MachineFloat|)))) "\\spad{coerce(f)} takes objects from the appropriate instantiation of \\spadtype{FortranExpression} and turns them into an ASP."))) 
 NIL 
 NIL 
-(-83 -2884) 
+(-83 -2890) 
 ((|constructor| (NIL "\\spadtype{Asp78} produces Fortran for Type 78 ASPs,{} needed for NAG routine \\axiomOpFrom{d02gbf}{d02Package},{} for example:\\begin{verbatim}      SUBROUTINE FCNG(X,G)      DOUBLE PRECISION G(*),X      G(1)=0.0D0      G(2)=0.0D0      END\\end{verbatim}")) (|coerce| (($ (|Vector| (|FortranExpression| (|construct| (QUOTE X)) (|construct|) (|MachineFloat|)))) "\\spad{coerce(f)} takes objects from the appropriate instantiation of \\spadtype{FortranExpression} and turns them into an ASP."))) 
 NIL 
 NIL 
-(-84 -2884) 
+(-84 -2890) 
 ((|constructor| (NIL "\\spadtype{Asp7} produces Fortran for Type 7 ASPs,{} needed for NAG routines \\axiomOpFrom{d02bbf}{d02Package},{} \\axiomOpFrom{d02gaf}{d02Package}. These represent a vector of functions of the scalar \\spad{X} and the array \\spad{Z},{} and look like:\\begin{verbatim}      SUBROUTINE FCN(X,Z,F)      DOUBLE PRECISION F(*),X,Z(*)      F(1)=DTAN(Z(3))      F(2)=((-0.03199999999999999D0*DCOS(Z(3))*DTAN(Z(3)))+(-0.02D0*Z(2)     &**2))/(Z(2)*DCOS(Z(3)))      F(3)=-0.03199999999999999D0/(X*Z(2)**2)      RETURN      END\\end{verbatim}")) (|coerce| (($ (|Vector| (|FortranExpression| (|construct| (QUOTE X)) (|construct| (QUOTE Y)) (|MachineFloat|)))) "\\spad{coerce(f)} takes objects from the appropriate instantiation of \\spadtype{FortranExpression} and turns them into an ASP."))) 
 NIL 
 NIL 
-(-85 -2884) 
+(-85 -2890) 
 ((|constructor| (NIL "\\spadtype{Asp80} produces Fortran for Type 80 ASPs,{} needed for NAG routine \\axiomOpFrom{d02kef}{d02Package},{} for example:\\begin{verbatim}      SUBROUTINE BDYVAL(XL,XR,ELAM,YL,YR)      DOUBLE PRECISION ELAM,XL,YL(3),XR,YR(3)      YL(1)=XL      YL(2)=2.0D0      YR(1)=1.0D0      YR(2)=-1.0D0*DSQRT(XR+(-1.0D0*ELAM))      RETURN      END\\end{verbatim}")) (|coerce| (($ (|Matrix| (|FortranExpression| (|construct| (QUOTE XL) (QUOTE XR) (QUOTE ELAM)) (|construct|) (|MachineFloat|)))) "\\spad{coerce(f)} takes objects from the appropriate instantiation of \\spadtype{FortranExpression} and turns them into an ASP."))) 
 NIL 
 NIL 
-(-86 -2884) 
+(-86 -2890) 
 ((|constructor| (NIL "\\spadtype{Asp8} produces Fortran for Type 8 ASPs,{} needed for NAG routine \\axiomOpFrom{d02bbf}{d02Package}. This ASP prints intermediate values of the computed solution of an ODE and might look like:\\begin{verbatim}      SUBROUTINE OUTPUT(XSOL,Y,COUNT,M,N,RESULT,FORWRD)      DOUBLE PRECISION Y(N),RESULT(M,N),XSOL      INTEGER M,N,COUNT      LOGICAL FORWRD      DOUBLE PRECISION X02ALF,POINTS(8)      EXTERNAL X02ALF      INTEGER I      POINTS(1)=1.0D0      POINTS(2)=2.0D0      POINTS(3)=3.0D0      POINTS(4)=4.0D0      POINTS(5)=5.0D0      POINTS(6)=6.0D0      POINTS(7)=7.0D0      POINTS(8)=8.0D0      COUNT=COUNT+1      DO 25001 I=1,N        RESULT(COUNT,I)=Y(I)25001 CONTINUE      IF(COUNT.EQ.M)THEN        IF(FORWRD)THEN          XSOL=X02ALF()        ELSE          XSOL=-X02ALF()        ENDIF      ELSE        XSOL=POINTS(COUNT)      ENDIF      END\\end{verbatim}"))) 
 NIL 
 NIL 
-(-87 -2884) 
+(-87 -2890) 
 ((|constructor| (NIL "\\spadtype{Asp9} produces Fortran for Type 9 ASPs,{} needed for NAG routines \\axiomOpFrom{d02bhf}{d02Package},{} \\axiomOpFrom{d02cjf}{d02Package},{} \\axiomOpFrom{d02ejf}{d02Package}. These ASPs represent a function of a scalar \\spad{X} and a vector \\spad{Y},{} for example:\\begin{verbatim}      DOUBLE PRECISION FUNCTION G(X,Y)      DOUBLE PRECISION X,Y(*)      G=X+Y(1)      RETURN      END\\end{verbatim} If the user provides a constant value for \\spad{G},{} then extra information is added via COMMON blocks used by certain routines. This specifies that the value returned by \\spad{G} in this case is to be ignored.")) (|coerce| (($ (|FortranExpression| (|construct| (QUOTE X)) (|construct| (QUOTE Y)) (|MachineFloat|))) "\\spad{coerce(f)} takes an object from the appropriate instantiation of \\spadtype{FortranExpression} and turns it into an ASP."))) 
 NIL 
 NIL 
@@ -287,7 +287,7 @@ NIL
 (-89 S) 
 ((|constructor| (NIL "A stack represented as a flexible array.")) (|arrayStack| (($ (|List| |#1|)) "\\spad{arrayStack([x,{}y,{}...,{}z])} creates an array stack with first (top) element \\spad{x},{} second element \\spad{y},{}...,{}and last element \\spad{z}."))) 
 ((-4233 . T) (-4234 . T)) 
-((|HasCategory| |#1| (QUOTE (-1013))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))))) 
+((|HasCategory| |#1| (QUOTE (-1013))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))))) 
 (-90 S) 
 ((|constructor| (NIL "Category for the inverse trigonometric functions.")) (|atan| (($ $) "\\spad{atan(x)} returns the arc-tangent of \\spad{x}.")) (|asin| (($ $) "\\spad{asin(x)} returns the arc-sine of \\spad{x}.")) (|asec| (($ $) "\\spad{asec(x)} returns the arc-secant of \\spad{x}.")) (|acsc| (($ $) "\\spad{acsc(x)} returns the arc-cosecant of \\spad{x}.")) (|acot| (($ $) "\\spad{acot(x)} returns the arc-cotangent of \\spad{x}.")) (|acos| (($ $) "\\spad{acos(x)} returns the arc-cosine of \\spad{x}."))) 
 NIL 
@@ -323,7 +323,7 @@ NIL
 (-98 S) 
 ((|constructor| (NIL "\\spadtype{BalancedBinaryTree(S)} is the domain of balanced binary trees (bbtree). A balanced binary tree of \\spad{2**k} leaves,{} for some \\spad{k > 0},{} is symmetric,{} that is,{} the left and right subtree of each interior node have identical shape. In general,{} the left and right subtree of a given node can differ by at most leaf node.")) (|mapDown!| (($ $ |#1| (|Mapping| (|List| |#1|) |#1| |#1| |#1|)) "\\spad{mapDown!(t,{}p,{}f)} returns \\spad{t} after traversing \\spad{t} in \"preorder\" (node then left then right) fashion replacing the successive interior nodes as follows. Let \\spad{l} and \\spad{r} denote the left and right subtrees of \\spad{t}. The root value \\spad{x} of \\spad{t} is replaced by \\spad{p}. Then \\spad{f}(value \\spad{l},{} value \\spad{r},{} \\spad{p}),{} where \\spad{l} and \\spad{r} denote the left and right subtrees of \\spad{t},{} is evaluated producing two values \\spad{pl} and \\spad{pr}. Then \\spad{mapDown!(l,{}pl,{}f)} and \\spad{mapDown!(l,{}pr,{}f)} are evaluated.") (($ $ |#1| (|Mapping| |#1| |#1| |#1|)) "\\spad{mapDown!(t,{}p,{}f)} returns \\spad{t} after traversing \\spad{t} in \"preorder\" (node then left then right) fashion replacing the successive interior nodes as follows. The root value \\spad{x} is replaced by \\spad{q} \\spad{:=} \\spad{f}(\\spad{p},{}\\spad{x}). The mapDown!(\\spad{l},{}\\spad{q},{}\\spad{f}) and mapDown!(\\spad{r},{}\\spad{q},{}\\spad{f}) are evaluated for the left and right subtrees \\spad{l} and \\spad{r} of \\spad{t}.")) (|mapUp!| (($ $ $ (|Mapping| |#1| |#1| |#1| |#1| |#1|)) "\\spad{mapUp!(t,{}t1,{}f)} traverses \\spad{t} in an \"endorder\" (left then right then node) fashion returning \\spad{t} with the value at each successive interior node of \\spad{t} replaced by \\spad{f}(\\spad{l},{}\\spad{r},{}\\spad{l1},{}\\spad{r1}) where \\spad{l} and \\spad{r} are the values at the immediate left and right nodes. Values \\spad{l1} and \\spad{r1} are values at the corresponding nodes of a balanced binary tree \\spad{t1},{} of identical shape at \\spad{t}.") ((|#1| $ (|Mapping| |#1| |#1| |#1|)) "\\spad{mapUp!(t,{}f)} traverses balanced binary tree \\spad{t} in an \"endorder\" (left then right then node) fashion returning \\spad{t} with the value at each successive interior node of \\spad{t} replaced by \\spad{f}(\\spad{l},{}\\spad{r}) where \\spad{l} and \\spad{r} are the values at the immediate left and right nodes.")) (|setleaves!| (($ $ (|List| |#1|)) "\\spad{setleaves!(t,{} ls)} sets the leaves of \\spad{t} in left-to-right order to the elements of \\spad{ls}.")) (|balancedBinaryTree| (($ (|NonNegativeInteger|) |#1|) "\\spad{balancedBinaryTree(n,{} s)} creates a balanced binary tree with \\spad{n} nodes each with value \\spad{s}."))) 
 ((-4233 . T) (-4234 . T)) 
-((|HasCategory| |#1| (QUOTE (-1013))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))))) 
+((|HasCategory| |#1| (QUOTE (-1013))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))))) 
 (-99 R UP M |Row| |Col|) 
 ((|constructor| (NIL "\\spadtype{BezoutMatrix} contains functions for computing resultants and discriminants using Bezout matrices.")) (|bezoutDiscriminant| ((|#1| |#2|) "\\spad{bezoutDiscriminant(p)} computes the discriminant of a polynomial \\spad{p} by computing the determinant of a Bezout matrix.")) (|bezoutResultant| ((|#1| |#2| |#2|) "\\spad{bezoutResultant(p,{}q)} computes the resultant of the two polynomials \\spad{p} and \\spad{q} by computing the determinant of a Bezout matrix.")) (|bezoutMatrix| ((|#3| |#2| |#2|) "\\spad{bezoutMatrix(p,{}q)} returns the Bezout matrix for the two polynomials \\spad{p} and \\spad{q}.")) (|sylvesterMatrix| ((|#3| |#2| |#2|) "\\spad{sylvesterMatrix(p,{}q)} returns the Sylvester matrix for the two polynomials \\spad{p} and \\spad{q}."))) 
 NIL 
@@ -338,14 +338,14 @@ NIL
 NIL 
 (-102 S) 
 ((|constructor| (NIL "A bag aggregate is an aggregate for which one can insert and extract objects,{} and where the order in which objects are inserted determines the order of extraction. Examples of bags are stacks,{} queues,{} and dequeues.")) (|inspect| ((|#1| $) "\\spad{inspect(u)} returns an (random) element from a bag.")) (|insert!| (($ |#1| $) "\\spad{insert!(x,{}u)} inserts item \\spad{x} into bag \\spad{u}.")) (|extract!| ((|#1| $) "\\spad{extract!(u)} destructively removes a (random) item from bag \\spad{u}.")) (|bag| (($ (|List| |#1|)) "\\spad{bag([x,{}y,{}...,{}z])} creates a bag with elements \\spad{x},{}\\spad{y},{}...,{}\\spad{z}.")) (|shallowlyMutable| ((|attribute|) "shallowlyMutable means that elements of bags may be destructively changed."))) 
-((-4234 . T) (-2046 . T)) 
+((-4234 . T) (-2092 . T)) 
 NIL 
 (-103) 
 ((|constructor| (NIL "This domain allows rational numbers to be presented as repeating binary expansions.")) (|binary| (($ (|Fraction| (|Integer|))) "\\spad{binary(r)} converts a rational number to a binary expansion.")) (|fractionPart| (((|Fraction| (|Integer|)) $) "\\spad{fractionPart(b)} returns the fractional part of a binary expansion.")) (|coerce| (((|RadixExpansion| 2) $) "\\spad{coerce(b)} converts a binary expansion to a radix expansion with base 2.") (((|Fraction| (|Integer|)) $) "\\spad{coerce(b)} converts a binary expansion to a rational number."))) 
 ((-4225 . T) (-4231 . T) (-4226 . T) ((-4235 "*") . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
-((|HasCategory| (-521) (QUOTE (-838))) (|HasCategory| (-521) (LIST (QUOTE -961) (QUOTE (-1084)))) (|HasCategory| (-521) (QUOTE (-133))) (|HasCategory| (-521) (QUOTE (-135))) (|HasCategory| (-521) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| (-521) (QUOTE (-946))) (|HasCategory| (-521) (QUOTE (-757))) (|HasCategory| (-521) (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| (-521) (QUOTE (-1060))) (|HasCategory| (-521) (LIST (QUOTE -815) (QUOTE (-521)))) (|HasCategory| (-521) (LIST (QUOTE -815) (QUOTE (-353)))) (|HasCategory| (-521) (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-353))))) (|HasCategory| (-521) (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521))))) (|HasCategory| (-521) (QUOTE (-210))) (|HasCategory| (-521) (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| (-521) (LIST (QUOTE -482) (QUOTE (-1084)) (QUOTE (-521)))) (|HasCategory| (-521) (LIST (QUOTE -284) (QUOTE (-521)))) (|HasCategory| (-521) (LIST (QUOTE -261) (QUOTE (-521)) (QUOTE (-521)))) (|HasCategory| (-521) (QUOTE (-282))) (|HasCategory| (-521) (QUOTE (-506))) (|HasCategory| (-521) (QUOTE (-784))) (-3703 (|HasCategory| (-521) (QUOTE (-757))) (|HasCategory| (-521) (QUOTE (-784)))) (|HasCategory| (-521) (LIST (QUOTE -583) (QUOTE (-521)))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| (-521) (QUOTE (-838)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| (-521) (QUOTE (-838)))) (|HasCategory| (-521) (QUOTE (-133))))) 
+((|HasCategory| (-521) (QUOTE (-837))) (|HasCategory| (-521) (LIST (QUOTE -961) (QUOTE (-1084)))) (|HasCategory| (-521) (QUOTE (-133))) (|HasCategory| (-521) (QUOTE (-135))) (|HasCategory| (-521) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| (-521) (QUOTE (-946))) (|HasCategory| (-521) (QUOTE (-756))) (|HasCategory| (-521) (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| (-521) (QUOTE (-1060))) (|HasCategory| (-521) (LIST (QUOTE -814) (QUOTE (-521)))) (|HasCategory| (-521) (LIST (QUOTE -814) (QUOTE (-353)))) (|HasCategory| (-521) (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-353))))) (|HasCategory| (-521) (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521))))) (|HasCategory| (-521) (QUOTE (-210))) (|HasCategory| (-521) (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| (-521) (LIST (QUOTE -482) (QUOTE (-1084)) (QUOTE (-521)))) (|HasCategory| (-521) (LIST (QUOTE -284) (QUOTE (-521)))) (|HasCategory| (-521) (LIST (QUOTE -261) (QUOTE (-521)) (QUOTE (-521)))) (|HasCategory| (-521) (QUOTE (-282))) (|HasCategory| (-521) (QUOTE (-506))) (|HasCategory| (-521) (QUOTE (-783))) (-3703 (|HasCategory| (-521) (QUOTE (-756))) (|HasCategory| (-521) (QUOTE (-783)))) (|HasCategory| (-521) (LIST (QUOTE -583) (QUOTE (-521)))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| (-521) (QUOTE (-837)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| (-521) (QUOTE (-837)))) (|HasCategory| (-521) (QUOTE (-133))))) 
 (-104) 
-((|constructor| (NIL "\\indented{1}{Author: Gabriel Dos Reis} Date Created: October 24,{} 2007 Date Last Modified: January 18,{} 2008. A `Binding' is a name asosciated with a collection of properties.")) (|binding| (($ (|Symbol|) (|List| (|ObjectProperty|))) "\\spad{binding(n,{}props)} constructs a binding with name \\spad{`n'} and property list `props'.")) (|properties| (((|List| (|ObjectProperty|)) $) "\\spad{properties(b)} returns the properties associated with binding \\spad{b}.")) (|name| (((|Symbol|) $) "\\spad{name(b)} returns the name of binding \\spad{b}"))) 
+((|constructor| (NIL "\\indented{1}{Author: Gabriel Dos Reis} Date Created: October 24,{} 2007 Date Last Modified: January 18,{} 2008. A `Binding' is a name asosciated with a collection of properties.")) (|binding| (($ (|Symbol|) (|List| (|Property|))) "\\spad{binding(n,{}props)} constructs a binding with name \\spad{`n'} and property list `props'.")) (|properties| (((|List| (|Property|)) $) "\\spad{properties(b)} returns the properties associated with binding \\spad{b}.")) (|name| (((|Symbol|) $) "\\spad{name(b)} returns the name of binding \\spad{b}"))) 
 NIL 
 NIL 
 (-105) 
@@ -355,7 +355,7 @@ NIL
 (-106) 
 ((|constructor| (NIL "\\spadtype{Bits} provides logical functions for Indexed Bits.")) (|bits| (($ (|NonNegativeInteger|) (|Boolean|)) "\\spad{bits(n,{}b)} creates bits with \\spad{n} values of \\spad{b}"))) 
 ((-4234 . T) (-4233 . T)) 
-((|HasCategory| (-108) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| (-108) (QUOTE (-784))) (|HasCategory| (-521) (QUOTE (-784))) (|HasCategory| (-108) (QUOTE (-1013))) (-12 (|HasCategory| (-108) (QUOTE (-1013))) (|HasCategory| (-108) (LIST (QUOTE -284) (QUOTE (-108))))) (|HasCategory| (-108) (LIST (QUOTE -561) (QUOTE (-792))))) 
+((|HasCategory| (-108) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| (-108) (QUOTE (-783))) (|HasCategory| (-521) (QUOTE (-783))) (|HasCategory| (-108) (QUOTE (-1013))) (-12 (|HasCategory| (-108) (QUOTE (-1013))) (|HasCategory| (-108) (LIST (QUOTE -284) (QUOTE (-108))))) (|HasCategory| (-108) (LIST (QUOTE -561) (QUOTE (-791))))) 
 (-107 R S) 
 ((|constructor| (NIL "A \\spadtype{BiModule} is both a left and right module with respect to potentially different rings. \\blankline")) (|rightUnitary| ((|attribute|) "\\spad{x * 1 = x}")) (|leftUnitary| ((|attribute|) "\\spad{1 * x = x}"))) 
 ((-4228 . T) (-4227 . T)) 
@@ -367,7 +367,7 @@ NIL
 (-109 A) 
 ((|constructor| (NIL "This package exports functions to set some commonly used properties of operators,{} including properties which contain functions.")) (|constantOpIfCan| (((|Union| |#1| "failed") (|BasicOperator|)) "\\spad{constantOpIfCan(op)} returns \\spad{a} if \\spad{op} is the constant nullary operator always returning \\spad{a},{} \"failed\" otherwise.")) (|constantOperator| (((|BasicOperator|) |#1|) "\\spad{constantOperator(a)} returns a nullary operator op such that \\spad{op()} always evaluate to \\spad{a}.")) (|derivative| (((|Union| (|List| (|Mapping| |#1| (|List| |#1|))) "failed") (|BasicOperator|)) "\\spad{derivative(op)} returns the value of the \"\\%diff\" property of \\spad{op} if it has one,{} and \"failed\" otherwise.") (((|BasicOperator|) (|BasicOperator|) (|Mapping| |#1| |#1|)) "\\spad{derivative(op,{} foo)} attaches foo as the \"\\%diff\" property of \\spad{op}. If \\spad{op} has an \"\\%diff\" property \\spad{f},{} then applying a derivation \\spad{D} to \\spad{op}(a) returns \\spad{f(a) * D(a)}. Argument \\spad{op} must be unary.") (((|BasicOperator|) (|BasicOperator|) (|List| (|Mapping| |#1| (|List| |#1|)))) "\\spad{derivative(op,{} [foo1,{}...,{}foon])} attaches [foo1,{}...,{}foon] as the \"\\%diff\" property of \\spad{op}. If \\spad{op} has an \"\\%diff\" property \\spad{[f1,{}...,{}fn]} then applying a derivation \\spad{D} to \\spad{op(a1,{}...,{}an)} returns \\spad{f1(a1,{}...,{}an) * D(a1) + ... + fn(a1,{}...,{}an) * D(an)}.")) (|evaluate| (((|Union| (|Mapping| |#1| (|List| |#1|)) "failed") (|BasicOperator|)) "\\spad{evaluate(op)} returns the value of the \"\\%eval\" property of \\spad{op} if it has one,{} and \"failed\" otherwise.") (((|BasicOperator|) (|BasicOperator|) (|Mapping| |#1| |#1|)) "\\spad{evaluate(op,{} foo)} attaches foo as the \"\\%eval\" property of \\spad{op}. If \\spad{op} has an \"\\%eval\" property \\spad{f},{} then applying \\spad{op} to a returns the result of \\spad{f(a)}. Argument \\spad{op} must be unary.") (((|BasicOperator|) (|BasicOperator|) (|Mapping| |#1| (|List| |#1|))) "\\spad{evaluate(op,{} foo)} attaches foo as the \"\\%eval\" property of \\spad{op}. If \\spad{op} has an \"\\%eval\" property \\spad{f},{} then applying \\spad{op} to \\spad{(a1,{}...,{}an)} returns the result of \\spad{f(a1,{}...,{}an)}.") (((|Union| |#1| "failed") (|BasicOperator|) (|List| |#1|)) "\\spad{evaluate(op,{} [a1,{}...,{}an])} checks if \\spad{op} has an \"\\%eval\" property \\spad{f}. If it has,{} then \\spad{f(a1,{}...,{}an)} is returned,{} and \"failed\" otherwise."))) 
 NIL 
-((|HasCategory| |#1| (QUOTE (-784)))) 
+((|HasCategory| |#1| (QUOTE (-783)))) 
 (-110) 
 ((|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 
@@ -383,14 +383,14 @@ NIL
 (-113 |p|) 
 ((|constructor| (NIL "Stream-based implementation of \\spad{Qp:} numbers are represented as sum(\\spad{i} = \\spad{k}..,{} a[\\spad{i}] * p^i),{} where the a[\\spad{i}] lie in -(\\spad{p} - 1)\\spad{/2},{}...,{}(\\spad{p} - 1)\\spad{/2}."))) 
 ((-4225 . T) (-4231 . T) (-4226 . T) ((-4235 "*") . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
-((|HasCategory| (-112 |#1|) (QUOTE (-838))) (|HasCategory| (-112 |#1|) (LIST (QUOTE -961) (QUOTE (-1084)))) (|HasCategory| (-112 |#1|) (QUOTE (-133))) (|HasCategory| (-112 |#1|) (QUOTE (-135))) (|HasCategory| (-112 |#1|) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| (-112 |#1|) (QUOTE (-946))) (|HasCategory| (-112 |#1|) (QUOTE (-757))) (|HasCategory| (-112 |#1|) (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| (-112 |#1|) (QUOTE (-1060))) (|HasCategory| (-112 |#1|) (LIST (QUOTE -815) (QUOTE (-521)))) (|HasCategory| (-112 |#1|) (LIST (QUOTE -815) (QUOTE (-353)))) (|HasCategory| (-112 |#1|) (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-353))))) (|HasCategory| (-112 |#1|) (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521))))) (|HasCategory| (-112 |#1|) (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| (-112 |#1|) (QUOTE (-210))) (|HasCategory| (-112 |#1|) (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| (-112 |#1|) (LIST (QUOTE -482) (QUOTE (-1084)) (LIST (QUOTE -112) (|devaluate| |#1|)))) (|HasCategory| (-112 |#1|) (LIST (QUOTE -284) (LIST (QUOTE -112) (|devaluate| |#1|)))) (|HasCategory| (-112 |#1|) (LIST (QUOTE -261) (LIST (QUOTE -112) (|devaluate| |#1|)) (LIST (QUOTE -112) (|devaluate| |#1|)))) (|HasCategory| (-112 |#1|) (QUOTE (-282))) (|HasCategory| (-112 |#1|) (QUOTE (-506))) (|HasCategory| (-112 |#1|) (QUOTE (-784))) (-3703 (|HasCategory| (-112 |#1|) (QUOTE (-757))) (|HasCategory| (-112 |#1|) (QUOTE (-784)))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| (-112 |#1|) (QUOTE (-838)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| (-112 |#1|) (QUOTE (-838)))) (|HasCategory| (-112 |#1|) (QUOTE (-133))))) 
+((|HasCategory| (-112 |#1|) (QUOTE (-837))) (|HasCategory| (-112 |#1|) (LIST (QUOTE -961) (QUOTE (-1084)))) (|HasCategory| (-112 |#1|) (QUOTE (-133))) (|HasCategory| (-112 |#1|) (QUOTE (-135))) (|HasCategory| (-112 |#1|) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| (-112 |#1|) (QUOTE (-946))) (|HasCategory| (-112 |#1|) (QUOTE (-756))) (|HasCategory| (-112 |#1|) (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| (-112 |#1|) (QUOTE (-1060))) (|HasCategory| (-112 |#1|) (LIST (QUOTE -814) (QUOTE (-521)))) (|HasCategory| (-112 |#1|) (LIST (QUOTE -814) (QUOTE (-353)))) (|HasCategory| (-112 |#1|) (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-353))))) (|HasCategory| (-112 |#1|) (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521))))) (|HasCategory| (-112 |#1|) (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| (-112 |#1|) (QUOTE (-210))) (|HasCategory| (-112 |#1|) (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| (-112 |#1|) (LIST (QUOTE -482) (QUOTE (-1084)) (LIST (QUOTE -112) (|devaluate| |#1|)))) (|HasCategory| (-112 |#1|) (LIST (QUOTE -284) (LIST (QUOTE -112) (|devaluate| |#1|)))) (|HasCategory| (-112 |#1|) (LIST (QUOTE -261) (LIST (QUOTE -112) (|devaluate| |#1|)) (LIST (QUOTE -112) (|devaluate| |#1|)))) (|HasCategory| (-112 |#1|) (QUOTE (-282))) (|HasCategory| (-112 |#1|) (QUOTE (-506))) (|HasCategory| (-112 |#1|) (QUOTE (-783))) (-3703 (|HasCategory| (-112 |#1|) (QUOTE (-756))) (|HasCategory| (-112 |#1|) (QUOTE (-783)))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| (-112 |#1|) (QUOTE (-837)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| (-112 |#1|) (QUOTE (-837)))) (|HasCategory| (-112 |#1|) (QUOTE (-133))))) 
 (-114 A S) 
 ((|constructor| (NIL "A binary-recursive aggregate has 0,{} 1 or 2 children and serves as a model for a binary tree or a doubly-linked aggregate structure")) (|setright!| (($ $ $) "\\spad{setright!(a,{}x)} sets the right child of \\spad{t} to be \\spad{x}.")) (|setleft!| (($ $ $) "\\spad{setleft!(a,{}b)} sets the left child of \\axiom{a} to be \\spad{b}.")) (|setelt| (($ $ "right" $) "\\spad{setelt(a,{}\"right\",{}b)} (also written \\axiom{\\spad{b} . right \\spad{:=} \\spad{b}}) is equivalent to \\axiom{setright!(a,{}\\spad{b})}.") (($ $ "left" $) "\\spad{setelt(a,{}\"left\",{}b)} (also written \\axiom{a . left \\spad{:=} \\spad{b}}) is equivalent to \\axiom{setleft!(a,{}\\spad{b})}.")) (|right| (($ $) "\\spad{right(a)} returns the right child.")) (|elt| (($ $ "right") "\\spad{elt(a,{}\"right\")} (also written: \\axiom{a . right}) is equivalent to \\axiom{right(a)}.") (($ $ "left") "\\spad{elt(u,{}\"left\")} (also written: \\axiom{a . left}) is equivalent to \\axiom{left(a)}.")) (|left| (($ $) "\\spad{left(u)} returns the left child."))) 
 NIL 
 ((|HasAttribute| |#1| (QUOTE -4234))) 
 (-115 S) 
 ((|constructor| (NIL "A binary-recursive aggregate has 0,{} 1 or 2 children and serves as a model for a binary tree or a doubly-linked aggregate structure")) (|setright!| (($ $ $) "\\spad{setright!(a,{}x)} sets the right child of \\spad{t} to be \\spad{x}.")) (|setleft!| (($ $ $) "\\spad{setleft!(a,{}b)} sets the left child of \\axiom{a} to be \\spad{b}.")) (|setelt| (($ $ "right" $) "\\spad{setelt(a,{}\"right\",{}b)} (also written \\axiom{\\spad{b} . right \\spad{:=} \\spad{b}}) is equivalent to \\axiom{setright!(a,{}\\spad{b})}.") (($ $ "left" $) "\\spad{setelt(a,{}\"left\",{}b)} (also written \\axiom{a . left \\spad{:=} \\spad{b}}) is equivalent to \\axiom{setleft!(a,{}\\spad{b})}.")) (|right| (($ $) "\\spad{right(a)} returns the right child.")) (|elt| (($ $ "right") "\\spad{elt(a,{}\"right\")} (also written: \\axiom{a . right}) is equivalent to \\axiom{right(a)}.") (($ $ "left") "\\spad{elt(u,{}\"left\")} (also written: \\axiom{a . left}) is equivalent to \\axiom{left(a)}.")) (|left| (($ $) "\\spad{left(u)} returns the left child."))) 
-((-2046 . T)) 
+((-2092 . T)) 
 NIL 
 (-116 UP) 
 ((|constructor| (NIL "\\indented{1}{Author: Frederic Lehobey,{} James \\spad{H}. Davenport} Date Created: 28 June 1994 Date Last Updated: 11 July 1997 Basic Operations: brillhartIrreducible? Related Domains: Also See: AMS Classifications: Keywords: factorization Examples: References: [1] John Brillhart,{} Note on Irreducibility Testing,{} Mathematics of Computation,{} vol. 35,{} num. 35,{} Oct. 1980,{} 1379-1381 [2] James Davenport,{} On Brillhart Irreducibility. To appear. [3] John Brillhart,{} On the Euler and Bernoulli polynomials,{} \\spad{J}. Reine Angew. Math.,{} \\spad{v}. 234,{} (1969),{} \\spad{pp}. 45-64")) (|noLinearFactor?| (((|Boolean|) |#1|) "\\spad{noLinearFactor?(p)} returns \\spad{true} if \\spad{p} can be shown to have no linear factor by a theorem of Lehmer,{} \\spad{false} else. \\spad{I} insist on the fact that \\spad{false} does not mean that \\spad{p} has a linear factor.")) (|brillhartTrials| (((|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{brillhartTrials(n)} sets to \\spad{n} the number of tests in \\spadfun{brillhartIrreducible?} and returns the previous value.") (((|NonNegativeInteger|)) "\\spad{brillhartTrials()} returns the number of tests in \\spadfun{brillhartIrreducible?}.")) (|brillhartIrreducible?| (((|Boolean|) |#1| (|Boolean|)) "\\spad{brillhartIrreducible?(p,{}noLinears)} returns \\spad{true} if \\spad{p} can be shown to be irreducible by a remark of Brillhart,{} \\spad{false} else. If \\spad{noLinears} is \\spad{true},{} we are being told \\spad{p} has no linear factors \\spad{false} does not mean that \\spad{p} is reducible.") (((|Boolean|) |#1|) "\\spad{brillhartIrreducible?(p)} returns \\spad{true} if \\spad{p} can be shown to be irreducible by a remark of Brillhart,{} \\spad{false} is inconclusive."))) 
@@ -399,14 +399,14 @@ NIL
 (-117 S) 
 ((|constructor| (NIL "BinarySearchTree(\\spad{S}) is the domain of a binary trees where elements are ordered across the tree. A binary search tree is either empty or has a value which is an \\spad{S},{} and a right and left which are both BinaryTree(\\spad{S}) Elements are ordered across the tree.")) (|split| (((|Record| (|:| |less| $) (|:| |greater| $)) |#1| $) "\\spad{split(x,{}b)} splits binary tree \\spad{b} into two trees,{} one with elements greater than \\spad{x},{} the other with elements less than \\spad{x}.")) (|insertRoot!| (($ |#1| $) "\\spad{insertRoot!(x,{}b)} inserts element \\spad{x} as a root of binary search tree \\spad{b}.")) (|insert!| (($ |#1| $) "\\spad{insert!(x,{}b)} inserts element \\spad{x} as leaves into binary search tree \\spad{b}.")) (|binarySearchTree| (($ (|List| |#1|)) "\\spad{binarySearchTree(l)} \\undocumented"))) 
 ((-4233 . T) (-4234 . T)) 
-((|HasCategory| |#1| (QUOTE (-1013))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))))) 
+((|HasCategory| |#1| (QUOTE (-1013))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))))) 
 (-118 S) 
 ((|constructor| (NIL "The bit aggregate category models aggregates representing large quantities of Boolean data.")) (|xor| (($ $ $) "\\spad{xor(a,{}b)} returns the logical {\\em exclusive-or} of bit aggregates \\axiom{a} and \\axiom{\\spad{b}}.")) (|or| (($ $ $) "\\spad{a or b} returns the logical {\\em or} of bit aggregates \\axiom{a} and \\axiom{\\spad{b}}.")) (|and| (($ $ $) "\\spad{a and b} returns the logical {\\em and} of bit aggregates \\axiom{a} and \\axiom{\\spad{b}}.")) (|nor| (($ $ $) "\\spad{nor(a,{}b)} returns the logical {\\em nor} of bit aggregates \\axiom{a} and \\axiom{\\spad{b}}.")) (|nand| (($ $ $) "\\spad{nand(a,{}b)} returns the logical {\\em nand} of bit aggregates \\axiom{a} and \\axiom{\\spad{b}}.")) (^ (($ $) "\\spad{^ b} returns the logical {\\em not} of bit aggregate \\axiom{\\spad{b}}.")) (|not| (($ $) "\\spad{not(b)} returns the logical {\\em not} of bit aggregate \\axiom{\\spad{b}}."))) 
 NIL 
 NIL 
 (-119) 
 ((|constructor| (NIL "The bit aggregate category models aggregates representing large quantities of Boolean data.")) (|xor| (($ $ $) "\\spad{xor(a,{}b)} returns the logical {\\em exclusive-or} of bit aggregates \\axiom{a} and \\axiom{\\spad{b}}.")) (|or| (($ $ $) "\\spad{a or b} returns the logical {\\em or} of bit aggregates \\axiom{a} and \\axiom{\\spad{b}}.")) (|and| (($ $ $) "\\spad{a and b} returns the logical {\\em and} of bit aggregates \\axiom{a} and \\axiom{\\spad{b}}.")) (|nor| (($ $ $) "\\spad{nor(a,{}b)} returns the logical {\\em nor} of bit aggregates \\axiom{a} and \\axiom{\\spad{b}}.")) (|nand| (($ $ $) "\\spad{nand(a,{}b)} returns the logical {\\em nand} of bit aggregates \\axiom{a} and \\axiom{\\spad{b}}.")) (^ (($ $) "\\spad{^ b} returns the logical {\\em not} of bit aggregate \\axiom{\\spad{b}}.")) (|not| (($ $) "\\spad{not(b)} returns the logical {\\em not} of bit aggregate \\axiom{\\spad{b}}."))) 
-((-4234 . T) (-4233 . T) (-2046 . T)) 
+((-4234 . T) (-4233 . T) (-2092 . T)) 
 NIL 
 (-120 A S) 
 ((|constructor| (NIL "\\spadtype{BinaryTreeCategory(S)} is the category of binary trees: a tree which is either empty or else is a \\spadfun{node} consisting of a value and a \\spadfun{left} and \\spadfun{right},{} both binary trees.")) (|node| (($ $ |#2| $) "\\spad{node(left,{}v,{}right)} creates a binary tree with value \\spad{v},{} a binary tree \\spad{left},{} and a binary tree \\spad{right}.")) (|finiteAggregate| ((|attribute|) "Binary trees have a finite number of components")) (|shallowlyMutable| ((|attribute|) "Binary trees have updateable components"))) 
@@ -414,16 +414,16 @@ NIL
 NIL 
 (-121 S) 
 ((|constructor| (NIL "\\spadtype{BinaryTreeCategory(S)} is the category of binary trees: a tree which is either empty or else is a \\spadfun{node} consisting of a value and a \\spadfun{left} and \\spadfun{right},{} both binary trees.")) (|node| (($ $ |#1| $) "\\spad{node(left,{}v,{}right)} creates a binary tree with value \\spad{v},{} a binary tree \\spad{left},{} and a binary tree \\spad{right}.")) (|finiteAggregate| ((|attribute|) "Binary trees have a finite number of components")) (|shallowlyMutable| ((|attribute|) "Binary trees have updateable components"))) 
-((-4233 . T) (-4234 . T) (-2046 . T)) 
+((-4233 . T) (-4234 . T) (-2092 . T)) 
 NIL 
 (-122 S) 
 ((|constructor| (NIL "\\spadtype{BinaryTournament(S)} is the domain of binary trees where elements are ordered down the tree. A binary search tree is either empty or is a node containing a \\spadfun{value} of type \\spad{S},{} and a \\spadfun{right} and a \\spadfun{left} which are both \\spadtype{BinaryTree(S)}")) (|insert!| (($ |#1| $) "\\spad{insert!(x,{}b)} inserts element \\spad{x} as leaves into binary tournament \\spad{b}.")) (|binaryTournament| (($ (|List| |#1|)) "\\spad{binaryTournament(ls)} creates a binary tournament with the elements of \\spad{ls} as values at the nodes."))) 
 ((-4233 . T) (-4234 . T)) 
-((|HasCategory| |#1| (QUOTE (-1013))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))))) 
+((|HasCategory| |#1| (QUOTE (-1013))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))))) 
 (-123 S) 
 ((|constructor| (NIL "\\spadtype{BinaryTree(S)} is the domain of all binary trees. A binary tree over \\spad{S} is either empty or has a \\spadfun{value} which is an \\spad{S} and a \\spadfun{right} and \\spadfun{left} which are both binary trees.")) (|binaryTree| (($ $ |#1| $) "\\spad{binaryTree(l,{}v,{}r)} creates a binary tree with value \\spad{v} with left subtree \\spad{l} and right subtree \\spad{r}.") (($ |#1|) "\\spad{binaryTree(v)} is an non-empty binary tree with value \\spad{v},{} and left and right empty."))) 
 ((-4233 . T) (-4234 . T)) 
-((|HasCategory| |#1| (QUOTE (-1013))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))))) 
+((|HasCategory| |#1| (QUOTE (-1013))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))))) 
 (-124) 
 ((|constructor| (NIL "This is an \\spadtype{AbelianMonoid} with the cancellation property,{} \\spadignore{i.e.} \\spad{ a+b = a+c => b=c }. This is formalised by the partial subtraction operator,{} which satisfies the axioms listed below: \\blankline")) (|subtractIfCan| (((|Union| $ "failed") $ $) "\\spad{subtractIfCan(x,{} y)} returns an element \\spad{z} such that \\spad{z+y=x} or \"failed\" if no such element exists."))) 
 NIL 
@@ -436,18 +436,18 @@ NIL
 ((|constructor| (NIL "Members of the domain CardinalNumber are values indicating the cardinality of sets,{} both finite and infinite. Arithmetic operations are defined on cardinal numbers as follows. \\blankline If \\spad{x = \\#X} and \\spad{y = \\#Y} then \\indented{2}{\\spad{x+y\\space{2}= \\#(X+Y)}\\space{3}\\tab{30}disjoint union} \\indented{2}{\\spad{x-y\\space{2}= \\#(X-Y)}\\space{3}\\tab{30}relative complement} \\indented{2}{\\spad{x*y\\space{2}= \\#(X*Y)}\\space{3}\\tab{30}cartesian product} \\indented{2}{\\spad{x**y = \\#(X**Y)}\\space{2}\\tab{30}\\spad{X**Y = \\{g| g:Y->X\\}}} \\blankline The non-negative integers have a natural construction as cardinals \\indented{2}{\\spad{0 = \\#\\{\\}},{} \\spad{1 = \\{0\\}},{} \\spad{2 = \\{0,{} 1\\}},{} ...,{} \\spad{n = \\{i| 0 <= i < n\\}}.} \\blankline That \\spad{0} acts as a zero for the multiplication of cardinals is equivalent to the axiom of choice. \\blankline The generalized continuum hypothesis asserts \\center{\\spad{2**Aleph i = Aleph(i+1)}} and is independent of the axioms of set theory [Goedel 1940]. \\blankline Three commonly encountered cardinal numbers are \\indented{3}{\\spad{a = \\#Z}\\space{7}\\tab{30}countable infinity} \\indented{3}{\\spad{c = \\#R}\\space{7}\\tab{30}the continuum} \\indented{3}{\\spad{f = \\#\\{g| g:[0,{}1]->R\\}}} \\blankline In this domain,{} these values are obtained using \\indented{3}{\\spad{a := Aleph 0},{} \\spad{c := 2**a},{} \\spad{f := 2**c}.} \\blankline")) (|generalizedContinuumHypothesisAssumed| (((|Boolean|) (|Boolean|)) "\\spad{generalizedContinuumHypothesisAssumed(bool)} is used to dictate whether the hypothesis is to be assumed.")) (|generalizedContinuumHypothesisAssumed?| (((|Boolean|)) "\\spad{generalizedContinuumHypothesisAssumed?()} tests if the hypothesis is currently assumed.")) (|countable?| (((|Boolean|) $) "\\spad{countable?(\\spad{a})} determines whether \\spad{a} is a countable cardinal,{} \\spadignore{i.e.} an integer or \\spad{Aleph 0}.")) (|finite?| (((|Boolean|) $) "\\spad{finite?(\\spad{a})} determines whether \\spad{a} is a finite cardinal,{} \\spadignore{i.e.} an integer.")) (|Aleph| (($ (|NonNegativeInteger|)) "\\spad{Aleph(n)} provides the named (infinite) cardinal number.")) (** (($ $ $) "\\spad{x**y} returns \\spad{\\#(X**Y)} where \\spad{X**Y} is defined \\indented{1}{as \\spad{\\{g| g:Y->X\\}}.}")) (- (((|Union| $ "failed") $ $) "\\spad{x - y} returns an element \\spad{z} such that \\spad{z+y=x} or \"failed\" if no such element exists.")) (|commutative| ((|attribute| "*") "a domain \\spad{D} has \\spad{commutative(\"*\")} if it has an operation \\spad{\"*\": (D,{}D) -> D} which is commutative."))) 
 (((-4235 "*") . T)) 
 NIL 
-(-127 |minix| -2617 S T$) 
+(-127 |minix| -2623 S T$) 
 ((|constructor| (NIL "This package provides functions to enable conversion of tensors given conversion of the components.")) (|map| (((|CartesianTensor| |#1| |#2| |#4|) (|Mapping| |#4| |#3|) (|CartesianTensor| |#1| |#2| |#3|)) "\\spad{map(f,{}ts)} does a componentwise conversion of the tensor \\spad{ts} to a tensor with components of type \\spad{T}.")) (|reshape| (((|CartesianTensor| |#1| |#2| |#4|) (|List| |#4|) (|CartesianTensor| |#1| |#2| |#3|)) "\\spad{reshape(lt,{}ts)} organizes the list of components \\spad{lt} into a tensor with the same shape as \\spad{ts}."))) 
 NIL 
 NIL 
-(-128 |minix| -2617 R) 
+(-128 |minix| -2623 R) 
 ((|constructor| (NIL "CartesianTensor(minix,{}dim,{}\\spad{R}) provides Cartesian tensors with components belonging to a commutative ring \\spad{R}. These tensors can have any number of indices. Each index takes values from \\spad{minix} to \\spad{minix + dim - 1}.")) (|sample| (($) "\\spad{sample()} returns an object of type \\%.")) (|unravel| (($ (|List| |#3|)) "\\spad{unravel(t)} produces a tensor from a list of components such that \\indented{2}{\\spad{unravel(ravel(t)) = t}.}")) (|ravel| (((|List| |#3|) $) "\\spad{ravel(t)} produces a list of components from a tensor such that \\indented{2}{\\spad{unravel(ravel(t)) = t}.}")) (|leviCivitaSymbol| (($) "\\spad{leviCivitaSymbol()} is the rank \\spad{dim} tensor defined by \\spad{leviCivitaSymbol()(i1,{}...idim) = +1/0/-1} if \\spad{i1,{}...,{}idim} is an even/is nota /is an odd permutation of \\spad{minix,{}...,{}minix+dim-1}.")) (|kroneckerDelta| (($) "\\spad{kroneckerDelta()} is the rank 2 tensor defined by \\indented{3}{\\spad{kroneckerDelta()(i,{}j)}} \\indented{6}{\\spad{= 1\\space{2}if i = j}} \\indented{6}{\\spad{= 0 if\\space{2}i \\^= j}}")) (|reindex| (($ $ (|List| (|Integer|))) "\\spad{reindex(t,{}[i1,{}...,{}idim])} permutes the indices of \\spad{t}. For example,{} if \\spad{r = reindex(t,{} [4,{}1,{}2,{}3])} for a rank 4 tensor \\spad{t},{} then \\spad{r} is the rank for tensor given by \\indented{4}{\\spad{r(i,{}j,{}k,{}l) = t(l,{}i,{}j,{}k)}.}")) (|transpose| (($ $ (|Integer|) (|Integer|)) "\\spad{transpose(t,{}i,{}j)} exchanges the \\spad{i}\\spad{-}th and \\spad{j}\\spad{-}th indices of \\spad{t}. For example,{} if \\spad{r = transpose(t,{}2,{}3)} for a rank 4 tensor \\spad{t},{} then \\spad{r} is the rank 4 tensor given by \\indented{4}{\\spad{r(i,{}j,{}k,{}l) = t(i,{}k,{}j,{}l)}.}") (($ $) "\\spad{transpose(t)} exchanges the first and last indices of \\spad{t}. For example,{} if \\spad{r = transpose(t)} for a rank 4 tensor \\spad{t},{} then \\spad{r} is the rank 4 tensor given by \\indented{4}{\\spad{r(i,{}j,{}k,{}l) = t(l,{}j,{}k,{}i)}.}")) (|contract| (($ $ (|Integer|) (|Integer|)) "\\spad{contract(t,{}i,{}j)} is the contraction of tensor \\spad{t} which sums along the \\spad{i}\\spad{-}th and \\spad{j}\\spad{-}th indices. For example,{} if \\spad{r = contract(t,{}1,{}3)} for a rank 4 tensor \\spad{t},{} then \\spad{r} is the rank 2 \\spad{(= 4 - 2)} tensor given by \\indented{4}{\\spad{r(i,{}j) = sum(h=1..dim,{}t(h,{}i,{}h,{}j))}.}") (($ $ (|Integer|) $ (|Integer|)) "\\spad{contract(t,{}i,{}s,{}j)} is the inner product of tenors \\spad{s} and \\spad{t} which sums along the \\spad{k1}\\spad{-}th index of \\spad{t} and the \\spad{k2}\\spad{-}th index of \\spad{s}. For example,{} if \\spad{r = contract(s,{}2,{}t,{}1)} for rank 3 tensors rank 3 tensors \\spad{s} and \\spad{t},{} then \\spad{r} is the rank 4 \\spad{(= 3 + 3 - 2)} tensor given by \\indented{4}{\\spad{r(i,{}j,{}k,{}l) = sum(h=1..dim,{}s(i,{}h,{}j)*t(h,{}k,{}l))}.}")) (* (($ $ $) "\\spad{s*t} is the inner product of the tensors \\spad{s} and \\spad{t} which contracts the last index of \\spad{s} with the first index of \\spad{t},{} \\spadignore{i.e.} \\indented{4}{\\spad{t*s = contract(t,{}rank t,{} s,{} 1)}} \\indented{4}{\\spad{t*s = sum(k=1..N,{} t[i1,{}..,{}iN,{}k]*s[k,{}j1,{}..,{}jM])}} This is compatible with the use of \\spad{M*v} to denote the matrix-vector inner product.")) (|product| (($ $ $) "\\spad{product(s,{}t)} is the outer product of the tensors \\spad{s} and \\spad{t}. For example,{} if \\spad{r = product(s,{}t)} for rank 2 tensors \\spad{s} and \\spad{t},{} then \\spad{r} is a rank 4 tensor given by \\indented{4}{\\spad{r(i,{}j,{}k,{}l) = s(i,{}j)*t(k,{}l)}.}")) (|elt| ((|#3| $ (|List| (|Integer|))) "\\spad{elt(t,{}[i1,{}...,{}iN])} gives a component of a rank \\spad{N} tensor.") ((|#3| $ (|Integer|) (|Integer|) (|Integer|) (|Integer|)) "\\spad{elt(t,{}i,{}j,{}k,{}l)} gives a component of a rank 4 tensor.") ((|#3| $ (|Integer|) (|Integer|) (|Integer|)) "\\spad{elt(t,{}i,{}j,{}k)} gives a component of a rank 3 tensor.") ((|#3| $ (|Integer|) (|Integer|)) "\\spad{elt(t,{}i,{}j)} gives a component of a rank 2 tensor.") ((|#3| $ (|Integer|)) "\\spad{elt(t,{}i)} gives a component of a rank 1 tensor.") ((|#3| $) "\\spad{elt(t)} gives the component of a rank 0 tensor.")) (|rank| (((|NonNegativeInteger|) $) "\\spad{rank(t)} returns the tensorial rank of \\spad{t} (that is,{} the number of indices). This is the same as the graded module degree.")) (|coerce| (($ (|List| $)) "\\spad{coerce([t_1,{}...,{}t_dim])} allows tensors to be constructed using lists.") (($ (|List| |#3|)) "\\spad{coerce([r_1,{}...,{}r_dim])} allows tensors to be constructed using lists.") (($ (|SquareMatrix| |#2| |#3|)) "\\spad{coerce(m)} views a matrix as a rank 2 tensor.") (($ (|DirectProduct| |#2| |#3|)) "\\spad{coerce(v)} views a vector as a rank 1 tensor."))) 
 NIL 
 NIL 
 (-129) 
 ((|constructor| (NIL "This domain allows classes of characters to be defined and manipulated efficiently.")) (|alphanumeric| (($) "\\spad{alphanumeric()} returns the class of all characters for which \\spadfunFrom{alphanumeric?}{Character} is \\spad{true}.")) (|alphabetic| (($) "\\spad{alphabetic()} returns the class of all characters for which \\spadfunFrom{alphabetic?}{Character} is \\spad{true}.")) (|lowerCase| (($) "\\spad{lowerCase()} returns the class of all characters for which \\spadfunFrom{lowerCase?}{Character} is \\spad{true}.")) (|upperCase| (($) "\\spad{upperCase()} returns the class of all characters for which \\spadfunFrom{upperCase?}{Character} is \\spad{true}.")) (|hexDigit| (($) "\\spad{hexDigit()} returns the class of all characters for which \\spadfunFrom{hexDigit?}{Character} is \\spad{true}.")) (|digit| (($) "\\spad{digit()} returns the class of all characters for which \\spadfunFrom{digit?}{Character} is \\spad{true}.")) (|charClass| (($ (|List| (|Character|))) "\\spad{charClass(l)} creates a character class which contains exactly the characters given in the list \\spad{l}.") (($ (|String|)) "\\spad{charClass(s)} creates a character class which contains exactly the characters given in the string \\spad{s}."))) 
 ((-4233 . T) (-4223 . T) (-4234 . T)) 
-((|HasCategory| (-132) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| (-132) (QUOTE (-342))) (|HasCategory| (-132) (QUOTE (-784))) (|HasCategory| (-132) (QUOTE (-1013))) (-12 (|HasCategory| (-132) (QUOTE (-1013))) (|HasCategory| (-132) (LIST (QUOTE -284) (QUOTE (-132))))) (-3703 (-12 (|HasCategory| (-132) (QUOTE (-342))) (|HasCategory| (-132) (LIST (QUOTE -284) (QUOTE (-132))))) (-12 (|HasCategory| (-132) (QUOTE (-1013))) (|HasCategory| (-132) (LIST (QUOTE -284) (QUOTE (-132)))))) (|HasCategory| (-132) (LIST (QUOTE -561) (QUOTE (-792))))) 
+((|HasCategory| (-132) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| (-132) (QUOTE (-342))) (|HasCategory| (-132) (QUOTE (-783))) (|HasCategory| (-132) (QUOTE (-1013))) (-12 (|HasCategory| (-132) (QUOTE (-1013))) (|HasCategory| (-132) (LIST (QUOTE -284) (QUOTE (-132))))) (-3703 (-12 (|HasCategory| (-132) (QUOTE (-342))) (|HasCategory| (-132) (LIST (QUOTE -284) (QUOTE (-132))))) (-12 (|HasCategory| (-132) (QUOTE (-1013))) (|HasCategory| (-132) (LIST (QUOTE -284) (QUOTE (-132)))))) (|HasCategory| (-132) (LIST (QUOTE -561) (QUOTE (-791))))) 
 (-130 R Q A) 
 ((|constructor| (NIL "CommonDenominator 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|)) |#3|) "\\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| |#3|) "\\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| |#3|) "\\spad{commonDenominator([q1,{}...,{}qn])} returns a common denominator \\spad{d} for \\spad{q1},{}...,{}\\spad{qn}."))) 
 NIL 
@@ -486,7 +486,7 @@ NIL
 ((|HasCategory| |#2| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#2| (QUOTE (-1013))) (|HasAttribute| |#1| (QUOTE -4233))) 
 (-139 S) 
 ((|constructor| (NIL "A collection is a homogeneous aggregate which can built from list of members. The operation used to build the aggregate is generically named \\spadfun{construct}. However,{} each collection provides its own special function with the same name as the data type,{} except with an initial lower case letter,{} \\spadignore{e.g.} \\spadfun{list} for \\spadtype{List},{} \\spadfun{flexibleArray} for \\spadtype{FlexibleArray},{} and so on.")) (|removeDuplicates| (($ $) "\\spad{removeDuplicates(u)} returns a copy of \\spad{u} with all duplicates removed.")) (|select| (($ (|Mapping| (|Boolean|) |#1|) $) "\\spad{select(p,{}u)} returns a copy of \\spad{u} containing only those elements such \\axiom{\\spad{p}(\\spad{x})} is \\spad{true}. Note: \\axiom{select(\\spad{p},{}\\spad{u}) \\spad{==} [\\spad{x} for \\spad{x} in \\spad{u} | \\spad{p}(\\spad{x})]}.")) (|remove| (($ |#1| $) "\\spad{remove(x,{}u)} returns a copy of \\spad{u} with all elements \\axiom{\\spad{y} = \\spad{x}} removed. Note: \\axiom{remove(\\spad{y},{}\\spad{c}) \\spad{==} [\\spad{x} for \\spad{x} in \\spad{c} | \\spad{x} \\spad{^=} \\spad{y}]}.") (($ (|Mapping| (|Boolean|) |#1|) $) "\\spad{remove(p,{}u)} returns a copy of \\spad{u} removing all elements \\spad{x} such that \\axiom{\\spad{p}(\\spad{x})} is \\spad{true}. Note: \\axiom{remove(\\spad{p},{}\\spad{u}) \\spad{==} [\\spad{x} for \\spad{x} in \\spad{u} | not \\spad{p}(\\spad{x})]}.")) (|reduce| ((|#1| (|Mapping| |#1| |#1| |#1|) $ |#1| |#1|) "\\spad{reduce(f,{}u,{}x,{}z)} reduces the binary operation \\spad{f} across \\spad{u},{} stopping when an \"absorbing element\" \\spad{z} is encountered. As for \\axiom{reduce(\\spad{f},{}\\spad{u},{}\\spad{x})},{} \\spad{x} is the identity operation of \\spad{f}. Same as \\axiom{reduce(\\spad{f},{}\\spad{u},{}\\spad{x})} when \\spad{u} contains no element \\spad{z}. Thus the third argument \\spad{x} is returned when \\spad{u} is empty.") ((|#1| (|Mapping| |#1| |#1| |#1|) $ |#1|) "\\spad{reduce(f,{}u,{}x)} reduces the binary operation \\spad{f} across \\spad{u},{} where \\spad{x} is the identity operation of \\spad{f}. Same as \\axiom{reduce(\\spad{f},{}\\spad{u})} if \\spad{u} has 2 or more elements. Returns \\axiom{\\spad{f}(\\spad{x},{}\\spad{y})} if \\spad{u} has one element \\spad{y},{} \\spad{x} if \\spad{u} is empty. For example,{} \\axiom{reduce(+,{}\\spad{u},{}0)} returns the sum of the elements of \\spad{u}.") ((|#1| (|Mapping| |#1| |#1| |#1|) $) "\\spad{reduce(f,{}u)} reduces the binary operation \\spad{f} across \\spad{u}. For example,{} if \\spad{u} is \\axiom{[\\spad{x},{}\\spad{y},{}...,{}\\spad{z}]} then \\axiom{reduce(\\spad{f},{}\\spad{u})} returns \\axiom{\\spad{f}(..\\spad{f}(\\spad{f}(\\spad{x},{}\\spad{y}),{}...),{}\\spad{z})}. Note: if \\spad{u} has one element \\spad{x},{} \\axiom{reduce(\\spad{f},{}\\spad{u})} returns \\spad{x}. Error: if \\spad{u} is empty.")) (|find| (((|Union| |#1| "failed") (|Mapping| (|Boolean|) |#1|) $) "\\spad{find(p,{}u)} returns the first \\spad{x} in \\spad{u} such that \\axiom{\\spad{p}(\\spad{x})} is \\spad{true},{} and \"failed\" otherwise.")) (|construct| (($ (|List| |#1|)) "\\axiom{construct(\\spad{x},{}\\spad{y},{}...,{}\\spad{z})} returns the collection of elements \\axiom{\\spad{x},{}\\spad{y},{}...,{}\\spad{z}} ordered as given. Equivalently written as \\axiom{[\\spad{x},{}\\spad{y},{}...,{}\\spad{z}]\\$\\spad{D}},{} where \\spad{D} is the domain. \\spad{D} may be omitted for those of type List."))) 
-((-2046 . T)) 
+((-2092 . T)) 
 NIL 
 (-140 |n| K Q) 
 ((|constructor| (NIL "CliffordAlgebra(\\spad{n},{} \\spad{K},{} \\spad{Q}) defines a vector space of dimension \\spad{2**n} over \\spad{K},{} given a quadratic form \\spad{Q} on \\spad{K**n}. \\blankline If \\spad{e[i]},{} \\spad{1<=i<=n} is a basis for \\spad{K**n} then \\indented{3}{1,{} \\spad{e[i]} (\\spad{1<=i<=n}),{} \\spad{e[i1]*e[i2]}} (\\spad{1<=i1<i2<=n}),{}...,{}\\spad{e[1]*e[2]*..*e[n]} is a basis for the Clifford Algebra. \\blankline The algebra is defined by the relations \\indented{3}{\\spad{e[i]*e[j] = -e[j]*e[i]}\\space{2}(\\spad{i \\~~= j}),{}} \\indented{3}{\\spad{e[i]*e[i] = Q(e[i])}} \\blankline Examples of Clifford Algebras are: gaussians,{} quaternions,{} exterior algebras and spin algebras.")) (|recip| (((|Union| $ "failed") $) "\\spad{recip(x)} computes the multiplicative inverse of \\spad{x} or \"failed\" if \\spad{x} is not invertible.")) (|coefficient| ((|#2| $ (|List| (|PositiveInteger|))) "\\spad{coefficient(x,{}[i1,{}i2,{}...,{}iN])} extracts the coefficient of \\spad{e(i1)*e(i2)*...*e(iN)} in \\spad{x}.")) (|monomial| (($ |#2| (|List| (|PositiveInteger|))) "\\spad{monomial(c,{}[i1,{}i2,{}...,{}iN])} produces the value given by \\spad{c*e(i1)*e(i2)*...*e(iN)}.")) (|e| (($ (|PositiveInteger|)) "\\spad{e(n)} produces the appropriate unit element."))) 
@@ -531,10 +531,10 @@ NIL
 (-150 S R) 
 ((|constructor| (NIL "This category represents the extension of a ring by a square root of \\spad{-1}.")) (|rationalIfCan| (((|Union| (|Fraction| (|Integer|)) "failed") $) "\\spad{rationalIfCan(x)} returns \\spad{x} as a rational number,{} or \"failed\" if \\spad{x} is not a rational number.")) (|rational| (((|Fraction| (|Integer|)) $) "\\spad{rational(x)} returns \\spad{x} as a rational number. Error: if \\spad{x} is not a rational number.")) (|rational?| (((|Boolean|) $) "\\spad{rational?(x)} tests if \\spad{x} is a rational number.")) (|polarCoordinates| (((|Record| (|:| |r| |#2|) (|:| |phi| |#2|)) $) "\\spad{polarCoordinates(x)} returns (\\spad{r},{} phi) such that \\spad{x} = \\spad{r} * exp(\\%\\spad{i} * phi).")) (|argument| ((|#2| $) "\\spad{argument(x)} returns the angle made by (0,{}1) and (0,{}\\spad{x}).")) (|abs| (($ $) "\\spad{abs(x)} returns the absolute value of \\spad{x} = sqrt(norm(\\spad{x})).")) (|exquo| (((|Union| $ "failed") $ |#2|) "\\spad{exquo(x,{} r)} returns the exact quotient of \\spad{x} by \\spad{r},{} or \"failed\" if \\spad{r} does not divide \\spad{x} exactly.")) (|norm| ((|#2| $) "\\spad{norm(x)} returns \\spad{x} * conjugate(\\spad{x})")) (|real| ((|#2| $) "\\spad{real(x)} returns real part of \\spad{x}.")) (|imag| ((|#2| $) "\\spad{imag(x)} returns imaginary part of \\spad{x}.")) (|conjugate| (($ $) "\\spad{conjugate(x + \\%i y)} returns \\spad{x} - \\%\\spad{i} \\spad{y}.")) (|imaginary| (($) "\\spad{imaginary()} = sqrt(\\spad{-1}) = \\%\\spad{i}.")) (|complex| (($ |#2| |#2|) "\\spad{complex(x,{}y)} constructs \\spad{x} + \\%i*y.") ((|attribute|) "indicates that \\% has sqrt(\\spad{-1})"))) 
 NIL 
-((|HasCategory| |#2| (QUOTE (-838))) (|HasCategory| |#2| (QUOTE (-506))) (|HasCategory| |#2| (QUOTE (-927))) (|HasCategory| |#2| (QUOTE (-1105))) (|HasCategory| |#2| (QUOTE (-979))) (|HasCategory| |#2| (QUOTE (-946))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-135))) (|HasCategory| |#2| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#2| (QUOTE (-337))) (|HasAttribute| |#2| (QUOTE -4229)) (|HasAttribute| |#2| (QUOTE -4232)) (|HasCategory| |#2| (QUOTE (-282))) (|HasCategory| |#2| (QUOTE (-513))) (|HasCategory| |#2| (QUOTE (-784)))) 
+((|HasCategory| |#2| (QUOTE (-837))) (|HasCategory| |#2| (QUOTE (-506))) (|HasCategory| |#2| (QUOTE (-927))) (|HasCategory| |#2| (QUOTE (-1105))) (|HasCategory| |#2| (QUOTE (-979))) (|HasCategory| |#2| (QUOTE (-946))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-135))) (|HasCategory| |#2| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#2| (QUOTE (-337))) (|HasAttribute| |#2| (QUOTE -4229)) (|HasAttribute| |#2| (QUOTE -4232)) (|HasCategory| |#2| (QUOTE (-282))) (|HasCategory| |#2| (QUOTE (-513))) (|HasCategory| |#2| (QUOTE (-783)))) 
 (-151 R) 
 ((|constructor| (NIL "This category represents the extension of a ring by a square root of \\spad{-1}.")) (|rationalIfCan| (((|Union| (|Fraction| (|Integer|)) "failed") $) "\\spad{rationalIfCan(x)} returns \\spad{x} as a rational number,{} or \"failed\" if \\spad{x} is not a rational number.")) (|rational| (((|Fraction| (|Integer|)) $) "\\spad{rational(x)} returns \\spad{x} as a rational number. Error: if \\spad{x} is not a rational number.")) (|rational?| (((|Boolean|) $) "\\spad{rational?(x)} tests if \\spad{x} is a rational number.")) (|polarCoordinates| (((|Record| (|:| |r| |#1|) (|:| |phi| |#1|)) $) "\\spad{polarCoordinates(x)} returns (\\spad{r},{} phi) such that \\spad{x} = \\spad{r} * exp(\\%\\spad{i} * phi).")) (|argument| ((|#1| $) "\\spad{argument(x)} returns the angle made by (0,{}1) and (0,{}\\spad{x}).")) (|abs| (($ $) "\\spad{abs(x)} returns the absolute value of \\spad{x} = sqrt(norm(\\spad{x})).")) (|exquo| (((|Union| $ "failed") $ |#1|) "\\spad{exquo(x,{} r)} returns the exact quotient of \\spad{x} by \\spad{r},{} or \"failed\" if \\spad{r} does not divide \\spad{x} exactly.")) (|norm| ((|#1| $) "\\spad{norm(x)} returns \\spad{x} * conjugate(\\spad{x})")) (|real| ((|#1| $) "\\spad{real(x)} returns real part of \\spad{x}.")) (|imag| ((|#1| $) "\\spad{imag(x)} returns imaginary part of \\spad{x}.")) (|conjugate| (($ $) "\\spad{conjugate(x + \\%i y)} returns \\spad{x} - \\%\\spad{i} \\spad{y}.")) (|imaginary| (($) "\\spad{imaginary()} = sqrt(\\spad{-1}) = \\%\\spad{i}.")) (|complex| (($ |#1| |#1|) "\\spad{complex(x,{}y)} constructs \\spad{x} + \\%i*y.") ((|attribute|) "indicates that \\% has sqrt(\\spad{-1})"))) 
-((-4226 -3703 (|has| |#1| (-513)) (-12 (|has| |#1| (-282)) (|has| |#1| (-838)))) (-4231 |has| |#1| (-337)) (-4225 |has| |#1| (-337)) (-4229 |has| |#1| (-6 -4229)) (-4232 |has| |#1| (-6 -4232)) (-3905 . T) (-2046 . T) ((-4235 "*") . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
+((-4226 -3703 (|has| |#1| (-513)) (-12 (|has| |#1| (-282)) (|has| |#1| (-837)))) (-4231 |has| |#1| (-337)) (-4225 |has| |#1| (-337)) (-4229 |has| |#1| (-6 -4229)) (-4232 |has| |#1| (-6 -4232)) (-3905 . T) (-2092 . T) ((-4235 "*") . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
 NIL 
 (-152 RR PR) 
 ((|constructor| (NIL "\\indented{1}{Author:} Date Created: Date Last Updated: Basic Functions: Related Constructors: Complex,{} UnivariatePolynomial Also See: AMS Classifications: Keywords: complex,{} polynomial factorization,{} factor References:")) (|factor| (((|Factored| |#2|) |#2|) "\\spad{factor(p)} factorizes the polynomial \\spad{p} with complex coefficients."))) 
@@ -546,8 +546,8 @@ NIL
 NIL 
 (-154 R) 
 ((|constructor| (NIL "\\spadtype {Complex(R)} creates the domain of elements of the form \\spad{a + b * i} where \\spad{a} and \\spad{b} come from the ring \\spad{R},{} and \\spad{i} is a new element such that \\spad{i**2 = -1}."))) 
-((-4226 -3703 (|has| |#1| (-513)) (-12 (|has| |#1| (-282)) (|has| |#1| (-838)))) (-4231 |has| |#1| (-337)) (-4225 |has| |#1| (-337)) (-4229 |has| |#1| (-6 -4229)) (-4232 |has| |#1| (-6 -4232)) (-3905 . T) ((-4235 "*") . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
-((|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-323))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-337))) (-3703 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-323)))) (|HasCategory| |#1| (QUOTE (-342))) (|HasCategory| |#1| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#1| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))) (-3703 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-513)))) (|HasCategory| |#1| (QUOTE (-1105))) (-12 (|HasCategory| |#1| (QUOTE (-927))) (|HasCategory| |#1| (QUOTE (-1105)))) (|HasCategory| |#1| (QUOTE (-946))) (|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-353))))) (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -815) (QUOTE (-521)))) (|HasCategory| |#1| (LIST (QUOTE -815) (QUOTE (-353)))) (|HasCategory| |#1| (LIST (QUOTE -482) (QUOTE (-1084)) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -261) (|devaluate| |#1|) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-765))) (|HasCategory| |#1| (QUOTE (-979))) (-12 (|HasCategory| |#1| (QUOTE (-979))) (|HasCategory| |#1| (QUOTE (-1105)))) (|HasCategory| |#1| (QUOTE (-506))) (-3703 (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasCategory| |#1| (QUOTE (-282))) (-3703 (|HasCategory| |#1| (QUOTE (-282))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-323))) (|HasCategory| |#1| (QUOTE (-513)))) (-3703 (|HasCategory| |#1| (QUOTE (-282))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-323)))) (|HasCategory| |#1| (QUOTE (-838))) (|HasCategory| |#1| (QUOTE (-210))) (-3703 (-12 (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-353))))) (|HasCategory| |#1| (QUOTE (-323)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-323)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -482) (QUOTE (-1084)) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-323)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-323)))) (-12 (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-323)))) (-12 (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-323)))) (|HasCategory| |#1| (QUOTE (-210))) (-12 (|HasCategory| |#1| (QUOTE (-282))) (|HasCategory| |#1| (QUOTE (-323)))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-323)))) (-12 (|HasCategory| |#1| (QUOTE (-323))) (|HasCategory| |#1| (LIST (QUOTE -261) (|devaluate| |#1|) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-323))) (|HasCategory| |#1| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#1| (QUOTE (-323))) (|HasCategory| |#1| (LIST (QUOTE -829) (QUOTE (-1084))))) (-12 (|HasCategory| |#1| (QUOTE (-323))) (|HasCategory| |#1| (QUOTE (-342)))) (-12 (|HasCategory| |#1| (QUOTE (-323))) (|HasCategory| |#1| (QUOTE (-513)))) (-12 (|HasCategory| |#1| (QUOTE (-323))) (|HasCategory| |#1| (QUOTE (-765)))) (-12 (|HasCategory| |#1| (QUOTE (-323))) (|HasCategory| |#1| (QUOTE (-784)))) (-12 (|HasCategory| |#1| (QUOTE (-323))) (|HasCategory| |#1| (QUOTE (-946)))) (-12 (|HasCategory| |#1| (QUOTE (-323))) (|HasCategory| |#1| (QUOTE (-1105)))) (-12 (|HasCategory| |#1| (QUOTE (-323))) (|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497))))) (-12 (|HasCategory| |#1| (QUOTE (-323))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-323))) (|HasCategory| |#1| (LIST (QUOTE -815) (QUOTE (-353))))) (-12 (|HasCategory| |#1| (QUOTE (-323))) (|HasCategory| |#1| (LIST (QUOTE -815) (QUOTE (-521))))) (-12 (|HasCategory| |#1| (QUOTE (-323))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))))) (-12 (|HasCategory| |#1| (QUOTE (-282))) (|HasCategory| |#1| (QUOTE (-838)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-282))) (|HasCategory| |#1| (QUOTE (-838)))) (|HasCategory| |#1| (QUOTE (-337))) (-12 (|HasCategory| |#1| (QUOTE (-323))) (|HasCategory| |#1| (QUOTE (-838))))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-282))) (|HasCategory| |#1| (QUOTE (-838)))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-838)))) (-12 (|HasCategory| |#1| (QUOTE (-323))) (|HasCategory| |#1| (QUOTE (-838))))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-282))) (|HasCategory| |#1| (QUOTE (-838)))) (|HasCategory| |#1| (QUOTE (-337)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-282))) (|HasCategory| |#1| (QUOTE (-838)))) (|HasCategory| |#1| (QUOTE (-513)))) (|HasAttribute| |#1| (QUOTE -4229)) (|HasAttribute| |#1| (QUOTE -4232)) (-12 (|HasCategory| |#1| (QUOTE (-210))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (LIST (QUOTE -829) (QUOTE (-1084))))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-282))) (|HasCategory| |#1| (QUOTE (-838)))) (|HasCategory| |#1| (QUOTE (-133)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-282))) (|HasCategory| |#1| (QUOTE (-838)))) (|HasCategory| |#1| (QUOTE (-323))))) 
+((-4226 -3703 (|has| |#1| (-513)) (-12 (|has| |#1| (-282)) (|has| |#1| (-837)))) (-4231 |has| |#1| (-337)) (-4225 |has| |#1| (-337)) (-4229 |has| |#1| (-6 -4229)) (-4232 |has| |#1| (-6 -4232)) (-3905 . T) ((-4235 "*") . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
+((|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-323))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-337))) (-3703 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-323)))) (|HasCategory| |#1| (QUOTE (-342))) (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#1| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))) (-3703 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-513)))) (|HasCategory| |#1| (QUOTE (-1105))) (-12 (|HasCategory| |#1| (QUOTE (-927))) (|HasCategory| |#1| (QUOTE (-1105)))) (|HasCategory| |#1| (QUOTE (-946))) (|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-353))))) (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -814) (QUOTE (-521)))) (|HasCategory| |#1| (LIST (QUOTE -814) (QUOTE (-353)))) (|HasCategory| |#1| (LIST (QUOTE -482) (QUOTE (-1084)) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -261) (|devaluate| |#1|) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-764))) (|HasCategory| |#1| (QUOTE (-979))) (-12 (|HasCategory| |#1| (QUOTE (-979))) (|HasCategory| |#1| (QUOTE (-1105)))) (|HasCategory| |#1| (QUOTE (-506))) (-3703 (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasCategory| |#1| (QUOTE (-282))) (-3703 (|HasCategory| |#1| (QUOTE (-282))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-323))) (|HasCategory| |#1| (QUOTE (-513)))) (-3703 (|HasCategory| |#1| (QUOTE (-282))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-323)))) (|HasCategory| |#1| (QUOTE (-837))) (|HasCategory| |#1| (QUOTE (-210))) (-3703 (-12 (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-353))))) (|HasCategory| |#1| (QUOTE (-323)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-323)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -482) (QUOTE (-1084)) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-323)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-323)))) (-12 (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-323)))) (-12 (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-323)))) (|HasCategory| |#1| (QUOTE (-210))) (-12 (|HasCategory| |#1| (QUOTE (-282))) (|HasCategory| |#1| (QUOTE (-323)))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-323)))) (-12 (|HasCategory| |#1| (QUOTE (-323))) (|HasCategory| |#1| (LIST (QUOTE -261) (|devaluate| |#1|) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-323))) (|HasCategory| |#1| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#1| (QUOTE (-323))) (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1084))))) (-12 (|HasCategory| |#1| (QUOTE (-323))) (|HasCategory| |#1| (QUOTE (-342)))) (-12 (|HasCategory| |#1| (QUOTE (-323))) (|HasCategory| |#1| (QUOTE (-513)))) (-12 (|HasCategory| |#1| (QUOTE (-323))) (|HasCategory| |#1| (QUOTE (-764)))) (-12 (|HasCategory| |#1| (QUOTE (-323))) (|HasCategory| |#1| (QUOTE (-783)))) (-12 (|HasCategory| |#1| (QUOTE (-323))) (|HasCategory| |#1| (QUOTE (-946)))) (-12 (|HasCategory| |#1| (QUOTE (-323))) (|HasCategory| |#1| (QUOTE (-1105)))) (-12 (|HasCategory| |#1| (QUOTE (-323))) (|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497))))) (-12 (|HasCategory| |#1| (QUOTE (-323))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-323))) (|HasCategory| |#1| (LIST (QUOTE -814) (QUOTE (-353))))) (-12 (|HasCategory| |#1| (QUOTE (-323))) (|HasCategory| |#1| (LIST (QUOTE -814) (QUOTE (-521))))) (-12 (|HasCategory| |#1| (QUOTE (-323))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))))) (-12 (|HasCategory| |#1| (QUOTE (-282))) (|HasCategory| |#1| (QUOTE (-837)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-282))) (|HasCategory| |#1| (QUOTE (-837)))) (|HasCategory| |#1| (QUOTE (-337))) (-12 (|HasCategory| |#1| (QUOTE (-323))) (|HasCategory| |#1| (QUOTE (-837))))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-282))) (|HasCategory| |#1| (QUOTE (-837)))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-837)))) (-12 (|HasCategory| |#1| (QUOTE (-323))) (|HasCategory| |#1| (QUOTE (-837))))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-282))) (|HasCategory| |#1| (QUOTE (-837)))) (|HasCategory| |#1| (QUOTE (-337)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-282))) (|HasCategory| |#1| (QUOTE (-837)))) (|HasCategory| |#1| (QUOTE (-513)))) (|HasAttribute| |#1| (QUOTE -4229)) (|HasAttribute| |#1| (QUOTE -4232)) (-12 (|HasCategory| |#1| (QUOTE (-210))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1084))))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-282))) (|HasCategory| |#1| (QUOTE (-837)))) (|HasCategory| |#1| (QUOTE (-133)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-282))) (|HasCategory| |#1| (QUOTE (-837)))) (|HasCategory| |#1| (QUOTE (-323))))) 
 (-155 R S CS) 
 ((|constructor| (NIL "This package supports converting complex expressions to patterns")) (|convert| (((|Pattern| |#1|) |#3|) "\\spad{convert(cs)} converts the complex expression \\spad{cs} to a pattern"))) 
 NIL 
@@ -579,7 +579,7 @@ NIL
 (-162 R S CS) 
 ((|constructor| (NIL "This package supports matching patterns involving complex expressions")) (|patternMatch| (((|PatternMatchResult| |#1| |#3|) |#3| (|Pattern| |#1|) (|PatternMatchResult| |#1| |#3|)) "\\spad{patternMatch(cexpr,{} pat,{} res)} matches the pattern \\spad{pat} to the complex expression \\spad{cexpr}. res contains the variables of \\spad{pat} which are already matched and their matches."))) 
 NIL 
-((|HasCategory| (-881 |#2|) (LIST (QUOTE -815) (|devaluate| |#1|)))) 
+((|HasCategory| (-880 |#2|) (LIST (QUOTE -814) (|devaluate| |#1|)))) 
 (-163 R) 
 ((|constructor| (NIL "This package \\undocumented{}")) (|multiEuclideanTree| (((|List| |#1|) (|List| |#1|) |#1|) "\\spad{multiEuclideanTree(l,{}r)} \\undocumented{}")) (|chineseRemainder| (((|List| |#1|) (|List| (|List| |#1|)) (|List| |#1|)) "\\spad{chineseRemainder(llv,{}lm)} returns a list of values,{} each of which corresponds to the Chinese remainder of the associated element of \\axiom{\\spad{llv}} and axiom{\\spad{lm}}. This is more efficient than applying chineseRemainder several times.") ((|#1| (|List| |#1|) (|List| |#1|)) "\\spad{chineseRemainder(lv,{}lm)} returns a value \\axiom{\\spad{v}} such that,{} if \\spad{x} is \\axiom{\\spad{lv}.\\spad{i}} modulo \\axiom{\\spad{lm}.\\spad{i}} for all \\axiom{\\spad{i}},{} then \\spad{x} is \\axiom{\\spad{v}} modulo \\axiom{\\spad{lm}(1)\\spad{*lm}(2)*...\\spad{*lm}(\\spad{n})}.")) (|modTree| (((|List| |#1|) |#1| (|List| |#1|)) "\\spad{modTree(r,{}l)} \\undocumented{}"))) 
 NIL 
@@ -711,7 +711,7 @@ NIL
 (-195) 
 ((|constructor| (NIL "This domain allows rational numbers to be presented as repeating decimal expansions.")) (|decimal| (($ (|Fraction| (|Integer|))) "\\spad{decimal(r)} converts a rational number to a decimal expansion.")) (|fractionPart| (((|Fraction| (|Integer|)) $) "\\spad{fractionPart(d)} returns the fractional part of a decimal expansion.")) (|coerce| (((|RadixExpansion| 10) $) "\\spad{coerce(d)} converts a decimal expansion to a radix expansion with base 10.") (((|Fraction| (|Integer|)) $) "\\spad{coerce(d)} converts a decimal expansion to a rational number."))) 
 ((-4225 . T) (-4231 . T) (-4226 . T) ((-4235 "*") . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
-((|HasCategory| (-521) (QUOTE (-838))) (|HasCategory| (-521) (LIST (QUOTE -961) (QUOTE (-1084)))) (|HasCategory| (-521) (QUOTE (-133))) (|HasCategory| (-521) (QUOTE (-135))) (|HasCategory| (-521) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| (-521) (QUOTE (-946))) (|HasCategory| (-521) (QUOTE (-757))) (|HasCategory| (-521) (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| (-521) (QUOTE (-1060))) (|HasCategory| (-521) (LIST (QUOTE -815) (QUOTE (-521)))) (|HasCategory| (-521) (LIST (QUOTE -815) (QUOTE (-353)))) (|HasCategory| (-521) (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-353))))) (|HasCategory| (-521) (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521))))) (|HasCategory| (-521) (QUOTE (-210))) (|HasCategory| (-521) (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| (-521) (LIST (QUOTE -482) (QUOTE (-1084)) (QUOTE (-521)))) (|HasCategory| (-521) (LIST (QUOTE -284) (QUOTE (-521)))) (|HasCategory| (-521) (LIST (QUOTE -261) (QUOTE (-521)) (QUOTE (-521)))) (|HasCategory| (-521) (QUOTE (-282))) (|HasCategory| (-521) (QUOTE (-506))) (|HasCategory| (-521) (QUOTE (-784))) (-3703 (|HasCategory| (-521) (QUOTE (-757))) (|HasCategory| (-521) (QUOTE (-784)))) (|HasCategory| (-521) (LIST (QUOTE -583) (QUOTE (-521)))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| (-521) (QUOTE (-838)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| (-521) (QUOTE (-838)))) (|HasCategory| (-521) (QUOTE (-133))))) 
+((|HasCategory| (-521) (QUOTE (-837))) (|HasCategory| (-521) (LIST (QUOTE -961) (QUOTE (-1084)))) (|HasCategory| (-521) (QUOTE (-133))) (|HasCategory| (-521) (QUOTE (-135))) (|HasCategory| (-521) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| (-521) (QUOTE (-946))) (|HasCategory| (-521) (QUOTE (-756))) (|HasCategory| (-521) (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| (-521) (QUOTE (-1060))) (|HasCategory| (-521) (LIST (QUOTE -814) (QUOTE (-521)))) (|HasCategory| (-521) (LIST (QUOTE -814) (QUOTE (-353)))) (|HasCategory| (-521) (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-353))))) (|HasCategory| (-521) (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521))))) (|HasCategory| (-521) (QUOTE (-210))) (|HasCategory| (-521) (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| (-521) (LIST (QUOTE -482) (QUOTE (-1084)) (QUOTE (-521)))) (|HasCategory| (-521) (LIST (QUOTE -284) (QUOTE (-521)))) (|HasCategory| (-521) (LIST (QUOTE -261) (QUOTE (-521)) (QUOTE (-521)))) (|HasCategory| (-521) (QUOTE (-282))) (|HasCategory| (-521) (QUOTE (-506))) (|HasCategory| (-521) (QUOTE (-783))) (-3703 (|HasCategory| (-521) (QUOTE (-756))) (|HasCategory| (-521) (QUOTE (-783)))) (|HasCategory| (-521) (LIST (QUOTE -583) (QUOTE (-521)))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| (-521) (QUOTE (-837)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| (-521) (QUOTE (-837)))) (|HasCategory| (-521) (QUOTE (-133))))) 
 (-196 R -4049) 
 ((|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 
@@ -727,7 +727,7 @@ NIL
 (-199 S) 
 ((|constructor| (NIL "Linked list implementation of a Dequeue")) (|dequeue| (($ (|List| |#1|)) "\\spad{dequeue([x,{}y,{}...,{}z])} creates a dequeue with first (top or front) element \\spad{x},{} second element \\spad{y},{}...,{}and last (bottom or back) element \\spad{z}."))) 
 ((-4233 . T) (-4234 . T)) 
-((|HasCategory| |#1| (QUOTE (-1013))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))))) 
+((|HasCategory| |#1| (QUOTE (-1013))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))))) 
 (-200 |CoefRing| |listIndVar|) 
 ((|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}."))) 
 ((-4230 . T)) 
@@ -738,7 +738,7 @@ NIL
 NIL 
 (-202) 
 ((|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)}.")) (|doubleFloatFormat| (((|String|) (|String|)) "change the output format for doublefloats using lisp format strings")) (|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}.")) (|hash| (((|Integer|) $) "\\spad{hash(x)} returns the hash key 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}."))) 
-((-3894 . T) (-4225 . T) (-4231 . T) (-4226 . T) ((-4235 "*") . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
+((-3893 . T) (-4225 . T) (-4231 . T) (-4226 . T) ((-4235 "*") . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
 NIL 
 (-203) 
 ((|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)}.}"))) 
@@ -747,19 +747,19 @@ NIL
 (-204 R) 
 ((|constructor| (NIL "\\indented{1}{A Denavit-Hartenberg Matrix is a 4x4 Matrix of the form:} \\indented{1}{\\spad{nx ox ax px}} \\indented{1}{\\spad{ny oy ay py}} \\indented{1}{\\spad{nz oz az pz}} \\indented{2}{\\spad{0\\space{2}0\\space{2}0\\space{2}1}} (\\spad{n},{} \\spad{o},{} and a are the direction cosines)")) (|translate| (($ |#1| |#1| |#1|) "\\spad{translate(X,{}Y,{}Z)} returns a dhmatrix for translation by \\spad{X},{} \\spad{Y},{} and \\spad{Z}")) (|scale| (($ |#1| |#1| |#1|) "\\spad{scale(sx,{}sy,{}sz)} returns a dhmatrix for scaling in the \\spad{X},{} \\spad{Y} and \\spad{Z} directions")) (|rotatez| (($ |#1|) "\\spad{rotatez(r)} returns a dhmatrix for rotation about axis \\spad{Z} for \\spad{r} degrees")) (|rotatey| (($ |#1|) "\\spad{rotatey(r)} returns a dhmatrix for rotation about axis \\spad{Y} for \\spad{r} degrees")) (|rotatex| (($ |#1|) "\\spad{rotatex(r)} returns a dhmatrix for rotation about axis \\spad{X} for \\spad{r} degrees")) (|identity| (($) "\\spad{identity()} create the identity dhmatrix")) (* (((|Point| |#1|) $ (|Point| |#1|)) "\\spad{t*p} applies the dhmatrix \\spad{t} to point \\spad{p}"))) 
 ((-4233 . T) (-4234 . T)) 
-((|HasCategory| |#1| (QUOTE (-1013))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-282))) (|HasCategory| |#1| (QUOTE (-513))) (|HasAttribute| |#1| (QUOTE (-4235 "*"))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))))) 
+((|HasCategory| |#1| (QUOTE (-1013))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-282))) (|HasCategory| |#1| (QUOTE (-513))) (|HasAttribute| |#1| (QUOTE (-4235 "*"))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))))) 
 (-205 A S) 
 ((|constructor| (NIL "A dictionary is an aggregate in which entries can be inserted,{} searched for and removed. Duplicates are thrown away on insertion. This category models the usual notion of dictionary which involves large amounts of data where copying is impractical. Principal operations are thus destructive (non-copying) ones."))) 
 NIL 
 NIL 
 (-206 S) 
 ((|constructor| (NIL "A dictionary is an aggregate in which entries can be inserted,{} searched for and removed. Duplicates are thrown away on insertion. This category models the usual notion of dictionary which involves large amounts of data where copying is impractical. Principal operations are thus destructive (non-copying) ones."))) 
-((-4234 . T) (-2046 . T)) 
+((-4234 . T) (-2092 . T)) 
 NIL 
 (-207 S R) 
 ((|constructor| (NIL "Differential extensions of a ring \\spad{R}. Given a differentiation on \\spad{R},{} extend it to a differentiation on \\%.")) (D (($ $ (|Mapping| |#2| |#2|) (|NonNegativeInteger|)) "\\spad{D(x,{} deriv,{} n)} differentiate \\spad{x} \\spad{n} times using a derivation which extends \\spad{deriv} on \\spad{R}.") (($ $ (|Mapping| |#2| |#2|)) "\\spad{D(x,{} deriv)} differentiates \\spad{x} extending the derivation deriv on \\spad{R}.")) (|differentiate| (($ $ (|Mapping| |#2| |#2|) (|NonNegativeInteger|)) "\\spad{differentiate(x,{} deriv,{} n)} differentiate \\spad{x} \\spad{n} times using a derivation which extends \\spad{deriv} on \\spad{R}.") (($ $ (|Mapping| |#2| |#2|)) "\\spad{differentiate(x,{} deriv)} differentiates \\spad{x} extending the derivation deriv on \\spad{R}."))) 
 NIL 
-((|HasCategory| |#2| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-210)))) 
+((|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-210)))) 
 (-208 R) 
 ((|constructor| (NIL "Differential extensions of a ring \\spad{R}. Given a differentiation on \\spad{R},{} extend it to a differentiation on \\%.")) (D (($ $ (|Mapping| |#1| |#1|) (|NonNegativeInteger|)) "\\spad{D(x,{} deriv,{} n)} differentiate \\spad{x} \\spad{n} times using a derivation which extends \\spad{deriv} on \\spad{R}.") (($ $ (|Mapping| |#1| |#1|)) "\\spad{D(x,{} deriv)} differentiates \\spad{x} extending the derivation deriv on \\spad{R}.")) (|differentiate| (($ $ (|Mapping| |#1| |#1|) (|NonNegativeInteger|)) "\\spad{differentiate(x,{} deriv,{} n)} differentiate \\spad{x} \\spad{n} times using a derivation which extends \\spad{deriv} on \\spad{R}.") (($ $ (|Mapping| |#1| |#1|)) "\\spad{differentiate(x,{} deriv)} differentiates \\spad{x} extending the derivation deriv on \\spad{R}."))) 
 ((-4230 . T)) 
@@ -778,28 +778,28 @@ NIL
 ((|HasAttribute| |#1| (QUOTE -4233))) 
 (-212 S) 
 ((|constructor| (NIL "This category is a collection of operations common to both categories \\spadtype{Dictionary} and \\spadtype{MultiDictionary}")) (|select!| (($ (|Mapping| (|Boolean|) |#1|) $) "\\spad{select!(p,{}d)} destructively changes dictionary \\spad{d} by removing all entries \\spad{x} such that \\axiom{\\spad{p}(\\spad{x})} is not \\spad{true}.")) (|remove!| (($ (|Mapping| (|Boolean|) |#1|) $) "\\spad{remove!(p,{}d)} destructively changes dictionary \\spad{d} by removeing all entries \\spad{x} such that \\axiom{\\spad{p}(\\spad{x})} is \\spad{true}.") (($ |#1| $) "\\spad{remove!(x,{}d)} destructively changes dictionary \\spad{d} by removing all entries \\spad{y} such that \\axiom{\\spad{y} = \\spad{x}}.")) (|dictionary| (($ (|List| |#1|)) "\\spad{dictionary([x,{}y,{}...,{}z])} creates a dictionary consisting of entries \\axiom{\\spad{x},{}\\spad{y},{}...,{}\\spad{z}}.") (($) "\\spad{dictionary()}\\$\\spad{D} creates an empty dictionary of type \\spad{D}."))) 
-((-4234 . T) (-2046 . T)) 
+((-4234 . T) (-2092 . T)) 
 NIL 
 (-213) 
 ((|constructor| (NIL "any solution of a homogeneous linear Diophantine equation can be represented as a sum of minimal solutions,{} which form a \"basis\" (a minimal solution cannot be represented as a nontrivial sum of solutions) in the case of an inhomogeneous linear Diophantine equation,{} each solution is the sum of a inhomogeneous solution and any number of homogeneous solutions therefore,{} it suffices to compute two sets: \\indented{3}{1. all minimal inhomogeneous solutions} \\indented{3}{2. all minimal homogeneous solutions} the algorithm implemented is a completion procedure,{} which enumerates all solutions in a recursive depth-first-search it can be seen as finding monotone paths in a graph for more details see Reference")) (|dioSolve| (((|Record| (|:| |varOrder| (|List| (|Symbol|))) (|:| |inhom| (|Union| (|List| (|Vector| (|NonNegativeInteger|))) "failed")) (|:| |hom| (|List| (|Vector| (|NonNegativeInteger|))))) (|Equation| (|Polynomial| (|Integer|)))) "\\spad{dioSolve(u)} computes a basis of all minimal solutions for linear homogeneous Diophantine equation \\spad{u},{} then all minimal solutions of inhomogeneous equation"))) 
 NIL 
 NIL 
-(-214 S -2617 R) 
+(-214 S -2623 R) 
 ((|constructor| (NIL "\\indented{2}{This category represents a finite cartesian product of a given type.} Many categorical properties are preserved under this construction.")) (* (($ $ |#3|) "\\spad{y * r} multiplies each component of the vector \\spad{y} by the element \\spad{r}.") (($ |#3| $) "\\spad{r * y} multiplies the element \\spad{r} times each component of the vector \\spad{y}.")) (|dot| ((|#3| $ $) "\\spad{dot(x,{}y)} computes the inner product of the vectors \\spad{x} and \\spad{y}.")) (|unitVector| (($ (|PositiveInteger|)) "\\spad{unitVector(n)} produces a vector with 1 in position \\spad{n} and zero elsewhere.")) (|directProduct| (($ (|Vector| |#3|)) "\\spad{directProduct(v)} converts the vector \\spad{v} to become a direct product. Error: if the length of \\spad{v} is different from dim.")) (|finiteAggregate| ((|attribute|) "attribute to indicate an aggregate of finite size"))) 
 NIL 
-((|HasCategory| |#3| (QUOTE (-337))) (|HasCategory| |#3| (QUOTE (-729))) (|HasCategory| |#3| (QUOTE (-782))) (|HasAttribute| |#3| (QUOTE -4230)) (|HasCategory| |#3| (QUOTE (-157))) (|HasCategory| |#3| (QUOTE (-342))) (|HasCategory| |#3| (QUOTE (-663))) (|HasCategory| |#3| (QUOTE (-124))) (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (QUOTE (-970))) (|HasCategory| |#3| (QUOTE (-1013)))) 
-(-215 -2617 R) 
+((|HasCategory| |#3| (QUOTE (-337))) (|HasCategory| |#3| (QUOTE (-729))) (|HasCategory| |#3| (QUOTE (-781))) (|HasAttribute| |#3| (QUOTE -4230)) (|HasCategory| |#3| (QUOTE (-157))) (|HasCategory| |#3| (QUOTE (-342))) (|HasCategory| |#3| (QUOTE (-663))) (|HasCategory| |#3| (QUOTE (-124))) (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (QUOTE (-970))) (|HasCategory| |#3| (QUOTE (-1013)))) 
+(-215 -2623 R) 
 ((|constructor| (NIL "\\indented{2}{This category represents a finite cartesian product of a given type.} Many categorical properties are preserved under this construction.")) (* (($ $ |#2|) "\\spad{y * r} multiplies each component of the vector \\spad{y} by the element \\spad{r}.") (($ |#2| $) "\\spad{r * y} multiplies the element \\spad{r} times each component of the vector \\spad{y}.")) (|dot| ((|#2| $ $) "\\spad{dot(x,{}y)} computes the inner product of the vectors \\spad{x} and \\spad{y}.")) (|unitVector| (($ (|PositiveInteger|)) "\\spad{unitVector(n)} produces a vector with 1 in position \\spad{n} and zero elsewhere.")) (|directProduct| (($ (|Vector| |#2|)) "\\spad{directProduct(v)} converts the vector \\spad{v} to become a direct product. Error: if the length of \\spad{v} is different from dim.")) (|finiteAggregate| ((|attribute|) "attribute to indicate an aggregate of finite size"))) 
-((-4227 |has| |#2| (-970)) (-4228 |has| |#2| (-970)) (-4230 |has| |#2| (-6 -4230)) ((-4235 "*") |has| |#2| (-157)) (-4233 . T) (-2046 . T)) 
+((-4227 |has| |#2| (-970)) (-4228 |has| |#2| (-970)) (-4230 |has| |#2| (-6 -4230)) ((-4235 "*") |has| |#2| (-157)) (-4233 . T) (-2092 . T)) 
 NIL 
-(-216 -2617 A B) 
+(-216 -2623 A B) 
 ((|constructor| (NIL "\\indented{2}{This package provides operations which all take as arguments} direct products of elements of some type \\spad{A} and functions from \\spad{A} to another type \\spad{B}. The operations all iterate over their vector argument and either return a value of type \\spad{B} or a direct product over \\spad{B}.")) (|map| (((|DirectProduct| |#1| |#3|) (|Mapping| |#3| |#2|) (|DirectProduct| |#1| |#2|)) "\\spad{map(f,{} v)} applies the function \\spad{f} to every element of the vector \\spad{v} producing a new vector containing the values.")) (|reduce| ((|#3| (|Mapping| |#3| |#2| |#3|) (|DirectProduct| |#1| |#2|) |#3|) "\\spad{reduce(func,{}vec,{}ident)} combines the elements in \\spad{vec} using the binary function \\spad{func}. Argument \\spad{ident} is returned if the vector is empty.")) (|scan| (((|DirectProduct| |#1| |#3|) (|Mapping| |#3| |#2| |#3|) (|DirectProduct| |#1| |#2|) |#3|) "\\spad{scan(func,{}vec,{}ident)} creates a new vector whose elements are the result of applying reduce to the binary function \\spad{func},{} increasing initial subsequences of the vector \\spad{vec},{} and the element \\spad{ident}."))) 
 NIL 
 NIL 
-(-217 -2617 R) 
+(-217 -2623 R) 
 ((|constructor| (NIL "\\indented{2}{This type represents the finite direct or cartesian product of an} underlying component type. This contrasts with simple vectors in that the members can be viewed as having constant length. Thus many categorical properties can by lifted from the underlying component type. Component extraction operations are provided but no updating operations. Thus new direct product elements can either be created by converting vector elements using the \\spadfun{directProduct} function or by taking appropriate linear combinations of basis vectors provided by the \\spad{unitVector} operation."))) 
 ((-4227 |has| |#2| (-970)) (-4228 |has| |#2| (-970)) (-4230 |has| |#2| (-6 -4230)) ((-4235 "*") |has| |#2| (-157)) (-4233 . T)) 
-((|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-970))) (|HasCategory| |#2| (QUOTE (-729))) (|HasCategory| |#2| (QUOTE (-782))) (-3703 (|HasCategory| |#2| (QUOTE (-729))) (|HasCategory| |#2| (QUOTE (-782)))) (|HasCategory| |#2| (QUOTE (-157))) (-3703 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-970)))) (-3703 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-337)))) (-3703 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-970)))) (|HasCategory| |#2| (QUOTE (-342))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-210))) (-3703 (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-970)))) (-3703 (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (QUOTE (-970)))) (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| (-521) (QUOTE (-784))) (-12 (|HasCategory| |#2| (QUOTE (-970))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (QUOTE (-970)))) (-12 (|HasCategory| |#2| (QUOTE (-970))) (|HasCategory| |#2| (LIST (QUOTE -829) (QUOTE (-1084))))) (|HasCategory| |#2| (QUOTE (-663))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-3703 (|HasCategory| |#2| (QUOTE (-970))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521)))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-1013)))) (|HasAttribute| |#2| (QUOTE -4230)) (|HasCategory| |#2| (QUOTE (-124))) (-3703 (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-124))) (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-970)))) (|HasCategory| |#2| (QUOTE (-25))) (-3703 (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-124))) (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-342))) (|HasCategory| |#2| (QUOTE (-729))) (|HasCategory| |#2| (QUOTE (-782))) (|HasCategory| |#2| (QUOTE (-970))) (|HasCategory| |#2| (QUOTE (-1013)))) (-3703 (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-124))) (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-970)))) (-3703 (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -829) (QUOTE (-1084))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-25)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-124)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-157)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-210)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-337)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-342)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-729)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-782)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-970)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-1013))))) (-3703 (-12 (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-124))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-342))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-729))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-782))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-970))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521)))))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-3703 (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-124))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-342))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-729))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-782))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-970))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -829) (QUOTE (-1084)))))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-792)))) (-3703 (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-1013)))) (-12 (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (QUOTE (-970)))) (-12 (|HasCategory| |#2| (QUOTE (-970))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-970))) (|HasCategory| |#2| (LIST (QUOTE -829) (QUOTE (-1084))))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-792)))))) 
+((|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-970))) (|HasCategory| |#2| (QUOTE (-729))) (|HasCategory| |#2| (QUOTE (-781))) (-3703 (|HasCategory| |#2| (QUOTE (-729))) (|HasCategory| |#2| (QUOTE (-781)))) (|HasCategory| |#2| (QUOTE (-157))) (-3703 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-970)))) (-3703 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-337)))) (-3703 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-970)))) (|HasCategory| |#2| (QUOTE (-342))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-210))) (-3703 (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-970)))) (-3703 (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (QUOTE (-970)))) (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| (-521) (QUOTE (-783))) (-12 (|HasCategory| |#2| (QUOTE (-970))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (QUOTE (-970)))) (-12 (|HasCategory| |#2| (QUOTE (-970))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1084))))) (|HasCategory| |#2| (QUOTE (-663))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-3703 (|HasCategory| |#2| (QUOTE (-970))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521)))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-1013)))) (|HasAttribute| |#2| (QUOTE -4230)) (|HasCategory| |#2| (QUOTE (-124))) (-3703 (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-124))) (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-970)))) (|HasCategory| |#2| (QUOTE (-25))) (-3703 (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-124))) (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-342))) (|HasCategory| |#2| (QUOTE (-729))) (|HasCategory| |#2| (QUOTE (-781))) (|HasCategory| |#2| (QUOTE (-970))) (|HasCategory| |#2| (QUOTE (-1013)))) (-3703 (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-124))) (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-970)))) (-3703 (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1084))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-25)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-124)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-157)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-210)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-337)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-342)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-729)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-781)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-970)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-1013))))) (-3703 (-12 (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-124))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-342))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-729))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-781))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-970))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521)))))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-3703 (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-124))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-342))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-729))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-781))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-970))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1084)))))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-791)))) (-3703 (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-1013)))) (-12 (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (QUOTE (-970)))) (-12 (|HasCategory| |#2| (QUOTE (-970))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-970))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1084))))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-791)))))) 
 (-218) 
 ((|constructor| (NIL "DisplayPackage allows one to print strings in a nice manner,{} including highlighting substrings.")) (|sayLength| (((|Integer|) (|List| (|String|))) "\\spad{sayLength(l)} returns the length of a list of strings \\spad{l} as an integer.") (((|Integer|) (|String|)) "\\spad{sayLength(s)} returns the length of a string \\spad{s} as an integer.")) (|say| (((|Void|) (|List| (|String|))) "\\spad{say(l)} sends a list of strings \\spad{l} to output.") (((|Void|) (|String|)) "\\spad{say(s)} sends a string \\spad{s} to output.")) (|center| (((|List| (|String|)) (|List| (|String|)) (|Integer|) (|String|)) "\\spad{center(l,{}i,{}s)} takes a list of strings \\spad{l},{} and centers them within a list of strings which is \\spad{i} characters long,{} in which the remaining spaces are filled with strings composed of as many repetitions as possible of the last string parameter \\spad{s}.") (((|String|) (|String|) (|Integer|) (|String|)) "\\spad{center(s,{}i,{}s)} takes the first string \\spad{s},{} and centers it within a string of length \\spad{i},{} in which the other elements of the string are composed of as many replications as possible of the second indicated string,{} \\spad{s} which must have a length greater than that of an empty string.")) (|copies| (((|String|) (|Integer|) (|String|)) "\\spad{copies(i,{}s)} will take a string \\spad{s} and create a new string composed of \\spad{i} copies of \\spad{s}.")) (|newLine| (((|String|)) "\\spad{newLine()} sends a new line command to output.")) (|bright| (((|List| (|String|)) (|List| (|String|))) "\\spad{bright(l)} sets the font property of a list of strings,{} \\spad{l},{} to bold-face type.") (((|List| (|String|)) (|String|)) "\\spad{bright(s)} sets the font property of the string \\spad{s} to bold-face type."))) 
 NIL 
@@ -814,12 +814,12 @@ NIL
 NIL 
 (-221 S) 
 ((|constructor| (NIL "A doubly-linked aggregate serves as a model for a doubly-linked list,{} that is,{} a list which can has links to both next and previous nodes and thus can be efficiently traversed in both directions.")) (|setnext!| (($ $ $) "\\spad{setnext!(u,{}v)} destructively sets the next node of doubly-linked aggregate \\spad{u} to \\spad{v},{} returning \\spad{v}.")) (|setprevious!| (($ $ $) "\\spad{setprevious!(u,{}v)} destructively sets the previous node of doubly-linked aggregate \\spad{u} to \\spad{v},{} returning \\spad{v}.")) (|concat!| (($ $ $) "\\spad{concat!(u,{}v)} destructively concatenates doubly-linked aggregate \\spad{v} to the end of doubly-linked aggregate \\spad{u}.")) (|next| (($ $) "\\spad{next(l)} returns the doubly-linked aggregate beginning with its next element. Error: if \\spad{l} has no next element. Note: \\axiom{next(\\spad{l}) = rest(\\spad{l})} and \\axiom{previous(next(\\spad{l})) = \\spad{l}}.")) (|previous| (($ $) "\\spad{previous(l)} returns the doubly-link list beginning with its previous element. Error: if \\spad{l} has no previous element. Note: \\axiom{next(previous(\\spad{l})) = \\spad{l}}.")) (|tail| (($ $) "\\spad{tail(l)} returns the doubly-linked aggregate \\spad{l} starting at its second element. Error: if \\spad{l} is empty.")) (|head| (($ $) "\\spad{head(l)} returns the first element of a doubly-linked aggregate \\spad{l}. Error: if \\spad{l} is empty.")) (|last| ((|#1| $) "\\spad{last(l)} returns the last element of a doubly-linked aggregate \\spad{l}. Error: if \\spad{l} is empty."))) 
-((-2046 . T)) 
+((-2092 . T)) 
 NIL 
 (-222 S) 
 ((|constructor| (NIL "This domain provides some nice functions on lists")) (|elt| (((|NonNegativeInteger|) $ "count") "\\axiom{\\spad{l}.\"count\"} returns the number of elements in \\axiom{\\spad{l}}.") (($ $ "sort") "\\axiom{\\spad{l}.sort} returns \\axiom{\\spad{l}} with elements sorted. Note: \\axiom{\\spad{l}.sort = sort(\\spad{l})}") (($ $ "unique") "\\axiom{\\spad{l}.unique} returns \\axiom{\\spad{l}} with duplicates removed. Note: \\axiom{\\spad{l}.unique = removeDuplicates(\\spad{l})}.")) (|datalist| (($ (|List| |#1|)) "\\spad{datalist(l)} creates a datalist from \\spad{l}")) (|coerce| (((|List| |#1|) $) "\\spad{coerce(x)} returns the list of elements in \\spad{x}") (($ (|List| |#1|)) "\\spad{coerce(l)} creates a datalist from \\spad{l}"))) 
 ((-4234 . T) (-4233 . T)) 
-((|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| (-521) (QUOTE (-784))) (|HasCategory| |#1| (QUOTE (-1013))) (-3703 (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| |#1| (QUOTE (-1013)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|))))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))))) 
+((|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| (-521) (QUOTE (-783))) (|HasCategory| |#1| (QUOTE (-1013))) (-3703 (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#1| (QUOTE (-1013)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|))))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))))) 
 (-223 M) 
 ((|constructor| (NIL "DiscreteLogarithmPackage implements help functions for discrete logarithms in monoids using small cyclic groups.")) (|shanksDiscLogAlgorithm| (((|Union| (|NonNegativeInteger|) "failed") |#1| |#1| (|NonNegativeInteger|)) "\\spad{shanksDiscLogAlgorithm(b,{}a,{}p)} computes \\spad{s} with \\spad{b**s = a} for assuming that \\spad{a} and \\spad{b} are elements in a 'small' cyclic group of order \\spad{p} by Shank\\spad{'s} algorithm. Note: this is a subroutine of the function \\spadfun{discreteLog}.")) (** ((|#1| |#1| (|Integer|)) "\\spad{x ** n} returns \\spad{x} raised to the integer power \\spad{n}"))) 
 NIL 
@@ -827,19 +827,19 @@ NIL
 (-224 |vl| R) 
 ((|constructor| (NIL "\\indented{2}{This type supports distributed multivariate polynomials} whose variables are from a user specified list of symbols. The coefficient ring may be non commutative,{} but the variables are assumed to commute. The term ordering is lexicographic specified by the variable list parameter with the most significant variable first in the list.")) (|reorder| (($ $ (|List| (|Integer|))) "\\spad{reorder(p,{} perm)} applies the permutation perm to the variables in a polynomial and returns the new correctly ordered polynomial"))) 
 (((-4235 "*") |has| |#2| (-157)) (-4226 |has| |#2| (-513)) (-4231 |has| |#2| (-6 -4231)) (-4228 . T) (-4227 . T) (-4230 . T)) 
-((|HasCategory| |#2| (QUOTE (-838))) (|HasCategory| |#2| (QUOTE (-513))) (|HasCategory| |#2| (QUOTE (-157))) (-3703 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-513)))) (-12 (|HasCategory| (-794 |#1|) (LIST (QUOTE -815) (QUOTE (-353)))) (|HasCategory| |#2| (LIST (QUOTE -815) (QUOTE (-353))))) (-12 (|HasCategory| (-794 |#1|) (LIST (QUOTE -815) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -815) (QUOTE (-521))))) (-12 (|HasCategory| (-794 |#1|) (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-353))))) (|HasCategory| |#2| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-353)))))) (-12 (|HasCategory| (-794 |#1|) (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521)))))) (-12 (|HasCategory| (-794 |#1|) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#2| (LIST (QUOTE -562) (QUOTE (-497))))) (|HasCategory| |#2| (QUOTE (-784))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (QUOTE (-135))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-337))) (-3703 (|HasCategory| |#2| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521)))))) (|HasAttribute| |#2| (QUOTE -4231)) (|HasCategory| |#2| (QUOTE (-425))) (-3703 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-425))) (|HasCategory| |#2| (QUOTE (-513))) (|HasCategory| |#2| (QUOTE (-838)))) (-3703 (|HasCategory| |#2| (QUOTE (-425))) (|HasCategory| |#2| (QUOTE (-513))) (|HasCategory| |#2| (QUOTE (-838)))) (-3703 (|HasCategory| |#2| (QUOTE (-425))) (|HasCategory| |#2| (QUOTE (-838)))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-838)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-838)))) (|HasCategory| |#2| (QUOTE (-133))))) 
+((|HasCategory| |#2| (QUOTE (-837))) (|HasCategory| |#2| (QUOTE (-513))) (|HasCategory| |#2| (QUOTE (-157))) (-3703 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-513)))) (-12 (|HasCategory| (-793 |#1|) (LIST (QUOTE -814) (QUOTE (-353)))) (|HasCategory| |#2| (LIST (QUOTE -814) (QUOTE (-353))))) (-12 (|HasCategory| (-793 |#1|) (LIST (QUOTE -814) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -814) (QUOTE (-521))))) (-12 (|HasCategory| (-793 |#1|) (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-353))))) (|HasCategory| |#2| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-353)))))) (-12 (|HasCategory| (-793 |#1|) (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521)))))) (-12 (|HasCategory| (-793 |#1|) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#2| (LIST (QUOTE -562) (QUOTE (-497))))) (|HasCategory| |#2| (QUOTE (-783))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (QUOTE (-135))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-337))) (-3703 (|HasCategory| |#2| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521)))))) (|HasAttribute| |#2| (QUOTE -4231)) (|HasCategory| |#2| (QUOTE (-425))) (-3703 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-425))) (|HasCategory| |#2| (QUOTE (-513))) (|HasCategory| |#2| (QUOTE (-837)))) (-3703 (|HasCategory| |#2| (QUOTE (-425))) (|HasCategory| |#2| (QUOTE (-513))) (|HasCategory| |#2| (QUOTE (-837)))) (-3703 (|HasCategory| |#2| (QUOTE (-425))) (|HasCategory| |#2| (QUOTE (-837)))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-837)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-837)))) (|HasCategory| |#2| (QUOTE (-133))))) 
 (-225) 
 ((|constructor| (NIL "\\indented{1}{Author: Gabriel Dos Reis} Date Create: October 18,{} 2007. Date Last Updated: January 19,{} 2008. Basic Operations: coerce,{} reify Related Constructors: Type,{} Syntax,{} OutputForm Also See: Type,{} ConstructorCall")) (|showSummary| (((|Void|) $) "\\spad{showSummary(d)} prints out implementation detail information of domain \\spad{`d'}.")) (|reflect| (($ (|ConstructorCall|)) "\\spad{reflect cc} returns the domain object designated by the ConstructorCall syntax `cc'. The constructor implied by `cc' must be known to the system since it is instantiated.")) (|reify| (((|ConstructorCall|) $) "\\spad{reify(d)} returns the abstract syntax for the domain \\spad{`x'}."))) 
 NIL 
 NIL 
 (-226 |n| R M S) 
 ((|constructor| (NIL "This constructor provides a direct product type with a left matrix-module view."))) 
-((-4230 -3703 (-4009 (|has| |#4| (-970)) (|has| |#4| (-210))) (-4009 (|has| |#4| (-970)) (|has| |#4| (-829 (-1084)))) (|has| |#4| (-6 -4230)) (-4009 (|has| |#4| (-970)) (|has| |#4| (-583 (-521))))) (-4227 |has| |#4| (-970)) (-4228 |has| |#4| (-970)) ((-4235 "*") |has| |#4| (-157)) (-4233 . T)) 
-((|HasCategory| |#4| (QUOTE (-337))) (|HasCategory| |#4| (QUOTE (-970))) (|HasCategory| |#4| (QUOTE (-729))) (|HasCategory| |#4| (QUOTE (-782))) (-3703 (|HasCategory| |#4| (QUOTE (-729))) (|HasCategory| |#4| (QUOTE (-782)))) (|HasCategory| |#4| (QUOTE (-157))) (-3703 (|HasCategory| |#4| (QUOTE (-157))) (|HasCategory| |#4| (QUOTE (-337))) (|HasCategory| |#4| (QUOTE (-970)))) (-3703 (|HasCategory| |#4| (QUOTE (-157))) (|HasCategory| |#4| (QUOTE (-337)))) (-3703 (|HasCategory| |#4| (QUOTE (-157))) (|HasCategory| |#4| (QUOTE (-970)))) (|HasCategory| |#4| (QUOTE (-342))) (|HasCategory| |#4| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#4| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#4| (QUOTE (-210))) (-3703 (|HasCategory| |#4| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#4| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#4| (QUOTE (-157))) (|HasCategory| |#4| (QUOTE (-210))) (|HasCategory| |#4| (QUOTE (-970)))) (|HasCategory| |#4| (QUOTE (-1013))) (|HasCategory| (-521) (QUOTE (-784))) (|HasCategory| |#4| (QUOTE (-663))) (-12 (|HasCategory| |#4| (QUOTE (-970))) (|HasCategory| |#4| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#4| (QUOTE (-970))) (|HasCategory| |#4| (LIST (QUOTE -829) (QUOTE (-1084))))) (-12 (|HasCategory| |#4| (QUOTE (-210))) (|HasCategory| |#4| (QUOTE (-970)))) (-12 (|HasCategory| |#4| (QUOTE (-1013))) (|HasCategory| |#4| (LIST (QUOTE -961) (QUOTE (-521))))) (-3703 (-12 (|HasCategory| |#4| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#4| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#4| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#4| (QUOTE (-157))) (|HasCategory| |#4| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#4| (QUOTE (-210))) (|HasCategory| |#4| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#4| (QUOTE (-337))) (|HasCategory| |#4| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#4| (QUOTE (-342))) (|HasCategory| |#4| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#4| (QUOTE (-729))) (|HasCategory| |#4| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#4| (QUOTE (-782))) (|HasCategory| |#4| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#4| (QUOTE (-970))) (|HasCategory| |#4| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#4| (QUOTE (-1013))) (|HasCategory| |#4| (LIST (QUOTE -961) (QUOTE (-521)))))) (-3703 (|HasCategory| |#4| (QUOTE (-970))) (-12 (|HasCategory| |#4| (QUOTE (-1013))) (|HasCategory| |#4| (LIST (QUOTE -961) (QUOTE (-521)))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#4| (QUOTE (-1013)))) (-3703 (-12 (|HasCategory| |#4| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#4| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#4| (LIST (QUOTE -829) (QUOTE (-1084))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#4| (QUOTE (-157)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#4| (QUOTE (-210)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#4| (QUOTE (-337)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#4| (QUOTE (-342)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#4| (QUOTE (-729)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#4| (QUOTE (-782)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#4| (QUOTE (-970)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#4| (QUOTE (-1013))))) (-3703 (|HasAttribute| |#4| (QUOTE -4230)) (-12 (|HasCategory| |#4| (QUOTE (-210))) (|HasCategory| |#4| (QUOTE (-970)))) (-12 (|HasCategory| |#4| (QUOTE (-970))) (|HasCategory| |#4| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#4| (QUOTE (-970))) (|HasCategory| |#4| (LIST (QUOTE -829) (QUOTE (-1084)))))) (|HasCategory| |#4| (QUOTE (-124))) (|HasCategory| |#4| (QUOTE (-25))) (-12 (|HasCategory| |#4| (QUOTE (-1013))) (|HasCategory| |#4| (LIST (QUOTE -284) (|devaluate| |#4|)))) (-3703 (-12 (|HasCategory| |#4| (QUOTE (-157))) (|HasCategory| |#4| (LIST (QUOTE -284) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-210))) (|HasCategory| |#4| (LIST (QUOTE -284) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-337))) (|HasCategory| |#4| (LIST (QUOTE -284) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-342))) (|HasCategory| |#4| (LIST (QUOTE -284) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-729))) (|HasCategory| |#4| (LIST (QUOTE -284) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-782))) (|HasCategory| |#4| (LIST (QUOTE -284) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-970))) (|HasCategory| |#4| (LIST (QUOTE -284) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-1013))) (|HasCategory| |#4| (LIST (QUOTE -284) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -284) (|devaluate| |#4|))) (|HasCategory| |#4| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -284) (|devaluate| |#4|))) (|HasCategory| |#4| (LIST (QUOTE -829) (QUOTE (-1084)))))) (|HasCategory| |#4| (LIST (QUOTE -561) (QUOTE (-792))))) 
+((-4230 -3703 (-4009 (|has| |#4| (-970)) (|has| |#4| (-210))) (-4009 (|has| |#4| (-970)) (|has| |#4| (-828 (-1084)))) (|has| |#4| (-6 -4230)) (-4009 (|has| |#4| (-970)) (|has| |#4| (-583 (-521))))) (-4227 |has| |#4| (-970)) (-4228 |has| |#4| (-970)) ((-4235 "*") |has| |#4| (-157)) (-4233 . T)) 
+((|HasCategory| |#4| (QUOTE (-337))) (|HasCategory| |#4| (QUOTE (-970))) (|HasCategory| |#4| (QUOTE (-729))) (|HasCategory| |#4| (QUOTE (-781))) (-3703 (|HasCategory| |#4| (QUOTE (-729))) (|HasCategory| |#4| (QUOTE (-781)))) (|HasCategory| |#4| (QUOTE (-157))) (-3703 (|HasCategory| |#4| (QUOTE (-157))) (|HasCategory| |#4| (QUOTE (-337))) (|HasCategory| |#4| (QUOTE (-970)))) (-3703 (|HasCategory| |#4| (QUOTE (-157))) (|HasCategory| |#4| (QUOTE (-337)))) (-3703 (|HasCategory| |#4| (QUOTE (-157))) (|HasCategory| |#4| (QUOTE (-970)))) (|HasCategory| |#4| (QUOTE (-342))) (|HasCategory| |#4| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#4| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#4| (QUOTE (-210))) (-3703 (|HasCategory| |#4| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#4| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#4| (QUOTE (-157))) (|HasCategory| |#4| (QUOTE (-210))) (|HasCategory| |#4| (QUOTE (-970)))) (|HasCategory| |#4| (QUOTE (-1013))) (|HasCategory| (-521) (QUOTE (-783))) (|HasCategory| |#4| (QUOTE (-663))) (-12 (|HasCategory| |#4| (QUOTE (-970))) (|HasCategory| |#4| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#4| (QUOTE (-970))) (|HasCategory| |#4| (LIST (QUOTE -828) (QUOTE (-1084))))) (-12 (|HasCategory| |#4| (QUOTE (-210))) (|HasCategory| |#4| (QUOTE (-970)))) (-12 (|HasCategory| |#4| (QUOTE (-1013))) (|HasCategory| |#4| (LIST (QUOTE -961) (QUOTE (-521))))) (-3703 (-12 (|HasCategory| |#4| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#4| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#4| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#4| (QUOTE (-157))) (|HasCategory| |#4| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#4| (QUOTE (-210))) (|HasCategory| |#4| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#4| (QUOTE (-337))) (|HasCategory| |#4| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#4| (QUOTE (-342))) (|HasCategory| |#4| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#4| (QUOTE (-729))) (|HasCategory| |#4| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#4| (QUOTE (-781))) (|HasCategory| |#4| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#4| (QUOTE (-970))) (|HasCategory| |#4| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#4| (QUOTE (-1013))) (|HasCategory| |#4| (LIST (QUOTE -961) (QUOTE (-521)))))) (-3703 (|HasCategory| |#4| (QUOTE (-970))) (-12 (|HasCategory| |#4| (QUOTE (-1013))) (|HasCategory| |#4| (LIST (QUOTE -961) (QUOTE (-521)))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#4| (QUOTE (-1013)))) (-3703 (-12 (|HasCategory| |#4| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#4| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#4| (LIST (QUOTE -828) (QUOTE (-1084))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#4| (QUOTE (-157)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#4| (QUOTE (-210)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#4| (QUOTE (-337)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#4| (QUOTE (-342)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#4| (QUOTE (-729)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#4| (QUOTE (-781)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#4| (QUOTE (-970)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#4| (QUOTE (-1013))))) (-3703 (|HasAttribute| |#4| (QUOTE -4230)) (-12 (|HasCategory| |#4| (QUOTE (-210))) (|HasCategory| |#4| (QUOTE (-970)))) (-12 (|HasCategory| |#4| (QUOTE (-970))) (|HasCategory| |#4| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#4| (QUOTE (-970))) (|HasCategory| |#4| (LIST (QUOTE -828) (QUOTE (-1084)))))) (|HasCategory| |#4| (QUOTE (-124))) (|HasCategory| |#4| (QUOTE (-25))) (-12 (|HasCategory| |#4| (QUOTE (-1013))) (|HasCategory| |#4| (LIST (QUOTE -284) (|devaluate| |#4|)))) (-3703 (-12 (|HasCategory| |#4| (QUOTE (-157))) (|HasCategory| |#4| (LIST (QUOTE -284) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-210))) (|HasCategory| |#4| (LIST (QUOTE -284) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-337))) (|HasCategory| |#4| (LIST (QUOTE -284) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-342))) (|HasCategory| |#4| (LIST (QUOTE -284) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-729))) (|HasCategory| |#4| (LIST (QUOTE -284) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-781))) (|HasCategory| |#4| (LIST (QUOTE -284) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-970))) (|HasCategory| |#4| (LIST (QUOTE -284) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-1013))) (|HasCategory| |#4| (LIST (QUOTE -284) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -284) (|devaluate| |#4|))) (|HasCategory| |#4| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -284) (|devaluate| |#4|))) (|HasCategory| |#4| (LIST (QUOTE -828) (QUOTE (-1084)))))) (|HasCategory| |#4| (LIST (QUOTE -561) (QUOTE (-791))))) 
 (-227 |n| R S) 
 ((|constructor| (NIL "This constructor provides a direct product of \\spad{R}-modules with an \\spad{R}-module view."))) 
-((-4230 -3703 (-4009 (|has| |#3| (-970)) (|has| |#3| (-210))) (-4009 (|has| |#3| (-970)) (|has| |#3| (-829 (-1084)))) (|has| |#3| (-6 -4230)) (-4009 (|has| |#3| (-970)) (|has| |#3| (-583 (-521))))) (-4227 |has| |#3| (-970)) (-4228 |has| |#3| (-970)) ((-4235 "*") |has| |#3| (-157)) (-4233 . T)) 
-((|HasCategory| |#3| (QUOTE (-337))) (|HasCategory| |#3| (QUOTE (-970))) (|HasCategory| |#3| (QUOTE (-729))) (|HasCategory| |#3| (QUOTE (-782))) (-3703 (|HasCategory| |#3| (QUOTE (-729))) (|HasCategory| |#3| (QUOTE (-782)))) (|HasCategory| |#3| (QUOTE (-157))) (-3703 (|HasCategory| |#3| (QUOTE (-157))) (|HasCategory| |#3| (QUOTE (-337))) (|HasCategory| |#3| (QUOTE (-970)))) (-3703 (|HasCategory| |#3| (QUOTE (-157))) (|HasCategory| |#3| (QUOTE (-337)))) (-3703 (|HasCategory| |#3| (QUOTE (-157))) (|HasCategory| |#3| (QUOTE (-970)))) (|HasCategory| |#3| (QUOTE (-342))) (|HasCategory| |#3| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#3| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#3| (QUOTE (-210))) (-3703 (|HasCategory| |#3| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#3| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#3| (QUOTE (-157))) (|HasCategory| |#3| (QUOTE (-210))) (|HasCategory| |#3| (QUOTE (-970)))) (|HasCategory| |#3| (QUOTE (-1013))) (|HasCategory| (-521) (QUOTE (-784))) (|HasCategory| |#3| (QUOTE (-663))) (-12 (|HasCategory| |#3| (QUOTE (-970))) (|HasCategory| |#3| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (QUOTE (-970))) (|HasCategory| |#3| (LIST (QUOTE -829) (QUOTE (-1084))))) (-12 (|HasCategory| |#3| (QUOTE (-210))) (|HasCategory| |#3| (QUOTE (-970)))) (-12 (|HasCategory| |#3| (QUOTE (-1013))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521))))) (-3703 (-12 (|HasCategory| |#3| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (QUOTE (-157))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (QUOTE (-210))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (QUOTE (-337))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (QUOTE (-342))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (QUOTE (-729))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (QUOTE (-782))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (QUOTE (-970))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (QUOTE (-1013))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521)))))) (-3703 (|HasCategory| |#3| (QUOTE (-970))) (-12 (|HasCategory| |#3| (QUOTE (-1013))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521)))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#3| (QUOTE (-1013)))) (-3703 (-12 (|HasCategory| |#3| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#3| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#3| (LIST (QUOTE -829) (QUOTE (-1084))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#3| (QUOTE (-157)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#3| (QUOTE (-210)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#3| (QUOTE (-337)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#3| (QUOTE (-342)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#3| (QUOTE (-729)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#3| (QUOTE (-782)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#3| (QUOTE (-970)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#3| (QUOTE (-1013))))) (-3703 (|HasAttribute| |#3| (QUOTE -4230)) (-12 (|HasCategory| |#3| (QUOTE (-210))) (|HasCategory| |#3| (QUOTE (-970)))) (-12 (|HasCategory| |#3| (QUOTE (-970))) (|HasCategory| |#3| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (QUOTE (-970))) (|HasCategory| |#3| (LIST (QUOTE -829) (QUOTE (-1084)))))) (|HasCategory| |#3| (QUOTE (-124))) (|HasCategory| |#3| (QUOTE (-25))) (-12 (|HasCategory| |#3| (QUOTE (-1013))) (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|)))) (-3703 (-12 (|HasCategory| |#3| (QUOTE (-157))) (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-210))) (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-337))) (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-342))) (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-729))) (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-782))) (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-970))) (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1013))) (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|))) (|HasCategory| |#3| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|))) (|HasCategory| |#3| (LIST (QUOTE -829) (QUOTE (-1084)))))) (|HasCategory| |#3| (LIST (QUOTE -561) (QUOTE (-792))))) 
+((-4230 -3703 (-4009 (|has| |#3| (-970)) (|has| |#3| (-210))) (-4009 (|has| |#3| (-970)) (|has| |#3| (-828 (-1084)))) (|has| |#3| (-6 -4230)) (-4009 (|has| |#3| (-970)) (|has| |#3| (-583 (-521))))) (-4227 |has| |#3| (-970)) (-4228 |has| |#3| (-970)) ((-4235 "*") |has| |#3| (-157)) (-4233 . T)) 
+((|HasCategory| |#3| (QUOTE (-337))) (|HasCategory| |#3| (QUOTE (-970))) (|HasCategory| |#3| (QUOTE (-729))) (|HasCategory| |#3| (QUOTE (-781))) (-3703 (|HasCategory| |#3| (QUOTE (-729))) (|HasCategory| |#3| (QUOTE (-781)))) (|HasCategory| |#3| (QUOTE (-157))) (-3703 (|HasCategory| |#3| (QUOTE (-157))) (|HasCategory| |#3| (QUOTE (-337))) (|HasCategory| |#3| (QUOTE (-970)))) (-3703 (|HasCategory| |#3| (QUOTE (-157))) (|HasCategory| |#3| (QUOTE (-337)))) (-3703 (|HasCategory| |#3| (QUOTE (-157))) (|HasCategory| |#3| (QUOTE (-970)))) (|HasCategory| |#3| (QUOTE (-342))) (|HasCategory| |#3| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#3| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#3| (QUOTE (-210))) (-3703 (|HasCategory| |#3| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#3| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#3| (QUOTE (-157))) (|HasCategory| |#3| (QUOTE (-210))) (|HasCategory| |#3| (QUOTE (-970)))) (|HasCategory| |#3| (QUOTE (-1013))) (|HasCategory| (-521) (QUOTE (-783))) (|HasCategory| |#3| (QUOTE (-663))) (-12 (|HasCategory| |#3| (QUOTE (-970))) (|HasCategory| |#3| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (QUOTE (-970))) (|HasCategory| |#3| (LIST (QUOTE -828) (QUOTE (-1084))))) (-12 (|HasCategory| |#3| (QUOTE (-210))) (|HasCategory| |#3| (QUOTE (-970)))) (-12 (|HasCategory| |#3| (QUOTE (-1013))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521))))) (-3703 (-12 (|HasCategory| |#3| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (QUOTE (-157))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (QUOTE (-210))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (QUOTE (-337))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (QUOTE (-342))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (QUOTE (-729))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (QUOTE (-781))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (QUOTE (-970))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (QUOTE (-1013))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521)))))) (-3703 (|HasCategory| |#3| (QUOTE (-970))) (-12 (|HasCategory| |#3| (QUOTE (-1013))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521)))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#3| (QUOTE (-1013)))) (-3703 (-12 (|HasCategory| |#3| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#3| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#3| (LIST (QUOTE -828) (QUOTE (-1084))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#3| (QUOTE (-157)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#3| (QUOTE (-210)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#3| (QUOTE (-337)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#3| (QUOTE (-342)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#3| (QUOTE (-729)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#3| (QUOTE (-781)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#3| (QUOTE (-970)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#3| (QUOTE (-1013))))) (-3703 (|HasAttribute| |#3| (QUOTE -4230)) (-12 (|HasCategory| |#3| (QUOTE (-210))) (|HasCategory| |#3| (QUOTE (-970)))) (-12 (|HasCategory| |#3| (QUOTE (-970))) (|HasCategory| |#3| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (QUOTE (-970))) (|HasCategory| |#3| (LIST (QUOTE -828) (QUOTE (-1084)))))) (|HasCategory| |#3| (QUOTE (-124))) (|HasCategory| |#3| (QUOTE (-25))) (-12 (|HasCategory| |#3| (QUOTE (-1013))) (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|)))) (-3703 (-12 (|HasCategory| |#3| (QUOTE (-157))) (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-210))) (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-337))) (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-342))) (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-729))) (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-781))) (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-970))) (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1013))) (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|))) (|HasCategory| |#3| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|))) (|HasCategory| |#3| (LIST (QUOTE -828) (QUOTE (-1084)))))) (|HasCategory| |#3| (LIST (QUOTE -561) (QUOTE (-791))))) 
 (-228 A R S V E) 
 ((|constructor| (NIL "\\spadtype{DifferentialPolynomialCategory} is a category constructor specifying basic functions in an ordinary differential polynomial ring with a given ordered set of differential indeterminates. In addition,{} it implements defaults for the basic functions. The functions \\spadfun{order} and \\spadfun{weight} are extended from the set of derivatives of differential indeterminates to the set of differential polynomials. Other operations provided on differential polynomials are \\spadfun{leader},{} \\spadfun{initial},{} \\spadfun{separant},{} \\spadfun{differentialVariables},{} and \\spadfun{isobaric?}. Furthermore,{} if the ground ring is a differential ring,{} then evaluation (substitution of differential indeterminates by elements of the ground ring or by differential polynomials) is provided by \\spadfun{eval}. A convenient way of referencing derivatives is provided by the functions \\spadfun{makeVariable}. \\blankline To construct a domain using this constructor,{} one needs to provide a ground ring \\spad{R},{} an ordered set \\spad{S} of differential indeterminates,{} a ranking \\spad{V} on the set of derivatives of the differential indeterminates,{} and a set \\spad{E} of exponents in bijection with the set of differential monomials in the given differential indeterminates. \\blankline")) (|separant| (($ $) "\\spad{separant(p)} returns the partial derivative of the differential polynomial \\spad{p} with respect to its leader.")) (|initial| (($ $) "\\spad{initial(p)} returns the leading coefficient when the differential polynomial \\spad{p} is written as a univariate polynomial in its leader.")) (|leader| ((|#4| $) "\\spad{leader(p)} returns the derivative of the highest rank appearing in the differential polynomial \\spad{p} Note: an error occurs if \\spad{p} is in the ground ring.")) (|isobaric?| (((|Boolean|) $) "\\spad{isobaric?(p)} returns \\spad{true} if every differential monomial appearing in the differential polynomial \\spad{p} has same weight,{} and returns \\spad{false} otherwise.")) (|weight| (((|NonNegativeInteger|) $ |#3|) "\\spad{weight(p,{} s)} returns the maximum weight of all differential monomials appearing in the differential polynomial \\spad{p} when \\spad{p} is viewed as a differential polynomial in the differential indeterminate \\spad{s} alone.") (((|NonNegativeInteger|) $) "\\spad{weight(p)} returns the maximum weight of all differential monomials appearing in the differential polynomial \\spad{p}.")) (|weights| (((|List| (|NonNegativeInteger|)) $ |#3|) "\\spad{weights(p,{} s)} returns a list of weights of differential monomials appearing in the differential polynomial \\spad{p} when \\spad{p} is viewed as a differential polynomial in the differential indeterminate \\spad{s} alone.") (((|List| (|NonNegativeInteger|)) $) "\\spad{weights(p)} returns a list of weights of differential monomials appearing in differential polynomial \\spad{p}.")) (|degree| (((|NonNegativeInteger|) $ |#3|) "\\spad{degree(p,{} s)} returns the maximum degree of the differential polynomial \\spad{p} viewed as a differential polynomial in the differential indeterminate \\spad{s} alone.")) (|order| (((|NonNegativeInteger|) $) "\\spad{order(p)} returns the order of the differential polynomial \\spad{p},{} which is the maximum number of differentiations of a differential indeterminate,{} among all those appearing in \\spad{p}.") (((|NonNegativeInteger|) $ |#3|) "\\spad{order(p,{}s)} returns the order of the differential polynomial \\spad{p} in differential indeterminate \\spad{s}.")) (|differentialVariables| (((|List| |#3|) $) "\\spad{differentialVariables(p)} returns a list of differential indeterminates occurring in a differential polynomial \\spad{p}.")) (|makeVariable| (((|Mapping| $ (|NonNegativeInteger|)) $) "\\spad{makeVariable(p)} views \\spad{p} as an element of a differential ring,{} in such a way that the \\spad{n}-th derivative of \\spad{p} may be simply referenced as \\spad{z}.\\spad{n} where \\spad{z} \\spad{:=} makeVariable(\\spad{p}). Note: In the interpreter,{} \\spad{z} is given as an internal map,{} which may be ignored.") (((|Mapping| $ (|NonNegativeInteger|)) |#3|) "\\spad{makeVariable(s)} views \\spad{s} as a differential indeterminate,{} in such a way that the \\spad{n}-th derivative of \\spad{s} may be simply referenced as \\spad{z}.\\spad{n} where \\spad{z} :=makeVariable(\\spad{s}). Note: In the interpreter,{} \\spad{z} is given as an internal map,{} which may be ignored."))) 
 NIL 
@@ -850,7 +850,7 @@ NIL
 NIL 
 (-230 S) 
 ((|constructor| (NIL "A dequeue is a doubly ended stack,{} that is,{} a bag where first items inserted are the first items extracted,{} at either the front or the back end of the data structure.")) (|reverse!| (($ $) "\\spad{reverse!(d)} destructively replaces \\spad{d} by its reverse dequeue,{} \\spadignore{i.e.} the top (front) element is now the bottom (back) element,{} and so on.")) (|extractBottom!| ((|#1| $) "\\spad{extractBottom!(d)} destructively extracts the bottom (back) element from the dequeue \\spad{d}. Error: if \\spad{d} is empty.")) (|extractTop!| ((|#1| $) "\\spad{extractTop!(d)} destructively extracts the top (front) element from the dequeue \\spad{d}. Error: if \\spad{d} is empty.")) (|insertBottom!| ((|#1| |#1| $) "\\spad{insertBottom!(x,{}d)} destructively inserts \\spad{x} into the dequeue \\spad{d} at the bottom (back) of the dequeue.")) (|insertTop!| ((|#1| |#1| $) "\\spad{insertTop!(x,{}d)} destructively inserts \\spad{x} into the dequeue \\spad{d},{} that is,{} at the top (front) of the dequeue. The element previously at the top of the dequeue becomes the second in the dequeue,{} and so on.")) (|bottom!| ((|#1| $) "\\spad{bottom!(d)} returns the element at the bottom (back) of the dequeue.")) (|top!| ((|#1| $) "\\spad{top!(d)} returns the element at the top (front) of the dequeue.")) (|height| (((|NonNegativeInteger|) $) "\\spad{height(d)} returns the number of elements in dequeue \\spad{d}. Note: \\axiom{height(\\spad{d}) = \\# \\spad{d}}.")) (|dequeue| (($ (|List| |#1|)) "\\spad{dequeue([x,{}y,{}...,{}z])} creates a dequeue with first (top or front) element \\spad{x},{} second element \\spad{y},{}...,{}and last (bottom or back) element \\spad{z}.") (($) "\\spad{dequeue()}\\$\\spad{D} creates an empty dequeue of type \\spad{D}."))) 
-((-4233 . T) (-4234 . T) (-2046 . T)) 
+((-4233 . T) (-4234 . T) (-2092 . T)) 
 NIL 
 (-231) 
 ((|constructor| (NIL "TopLevelDrawFunctionsForCompiledFunctions provides top level functions for drawing graphics of expressions.")) (|recolor| (((|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|))) "\\spad{recolor()},{} uninteresting to top level user; exported in order to compile package.")) (|makeObject| (((|ThreeSpace| (|DoubleFloat|)) (|ParametricSurface| (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|))) (|Segment| (|Float|)) (|Segment| (|Float|))) "\\spad{makeObject(surface(f,{}g,{}h),{}a..b,{}c..d,{}l)} returns a space of the domain \\spadtype{ThreeSpace} which contains the graph of the parametric surface \\spad{x = f(u,{}v)},{} \\spad{y = g(u,{}v)},{} \\spad{z = h(u,{}v)} as \\spad{u} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)} and \\spad{v} ranges from \\spad{min(c,{}d)} to \\spad{max(c,{}d)}.") (((|ThreeSpace| (|DoubleFloat|)) (|ParametricSurface| (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|))) (|Segment| (|Float|)) (|Segment| (|Float|)) (|List| (|DrawOption|))) "\\spad{makeObject(surface(f,{}g,{}h),{}a..b,{}c..d,{}l)} returns a space of the domain \\spadtype{ThreeSpace} which contains the graph of the parametric surface \\spad{x = f(u,{}v)},{} \\spad{y = g(u,{}v)},{} \\spad{z = h(u,{}v)} as \\spad{u} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)} and \\spad{v} ranges from \\spad{min(c,{}d)} to \\spad{max(c,{}d)}. The options contained in the list \\spad{l} of the domain \\spad{DrawOption} are applied.") (((|ThreeSpace| (|DoubleFloat|)) (|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|Float|)) (|Segment| (|Float|))) "\\spad{makeObject(f,{}a..b,{}c..d,{}l)} returns a space of the domain \\spadtype{ThreeSpace} which contains the graph of the parametric surface \\spad{f(u,{}v)} as \\spad{u} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)} and \\spad{v} ranges from \\spad{min(c,{}d)} to \\spad{max(c,{}d)}.") (((|ThreeSpace| (|DoubleFloat|)) (|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|Float|)) (|Segment| (|Float|)) (|List| (|DrawOption|))) "\\spad{makeObject(f,{}a..b,{}c..d,{}l)} returns a space of the domain \\spadtype{ThreeSpace} which contains the graph of the parametric surface \\spad{f(u,{}v)} as \\spad{u} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)} and \\spad{v} ranges from \\spad{min(c,{}d)} to \\spad{max(c,{}d)}; The options contained in the list \\spad{l} of the domain \\spad{DrawOption} are applied.") (((|ThreeSpace| (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|Float|)) (|Segment| (|Float|))) "\\spad{makeObject(f,{}a..b,{}c..d)} returns a space of the domain \\spadtype{ThreeSpace} which contains the graph of \\spad{z = f(x,{}y)} as \\spad{x} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)} and \\spad{y} ranges from \\spad{min(c,{}d)} to \\spad{max(c,{}d)}.") (((|ThreeSpace| (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|Float|)) (|Segment| (|Float|)) (|List| (|DrawOption|))) "\\spad{makeObject(f,{}a..b,{}c..d,{}l)} returns a space of the domain \\spadtype{ThreeSpace} which contains the graph of \\spad{z = f(x,{}y)} as \\spad{x} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)} and \\spad{y} ranges from \\spad{min(c,{}d)} to \\spad{max(c,{}d)},{} and the options contained in the list \\spad{l} of the domain \\spad{DrawOption} are applied.") (((|ThreeSpace| (|DoubleFloat|)) (|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|)) (|Segment| (|Float|))) "\\spad{makeObject(sp,{}curve(f,{}g,{}h),{}a..b)} returns the space \\spad{sp} of the domain \\spadtype{ThreeSpace} with the addition of the graph of the parametric curve \\spad{x = f(t),{} y = g(t),{} z = h(t)} as \\spad{t} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)}.") (((|ThreeSpace| (|DoubleFloat|)) (|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|)) (|Segment| (|Float|)) (|List| (|DrawOption|))) "\\spad{makeObject(curve(f,{}g,{}h),{}a..b,{}l)} returns a space of the domain \\spadtype{ThreeSpace} which contains the graph of the parametric curve \\spad{x = f(t),{} y = g(t),{} z = h(t)} as \\spad{t} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)}. The options contained in the list \\spad{l} of the domain \\spad{DrawOption} are applied.") (((|ThreeSpace| (|DoubleFloat|)) (|ParametricSpaceCurve| (|Mapping| (|DoubleFloat|) (|DoubleFloat|))) (|Segment| (|Float|))) "\\spad{makeObject(sp,{}curve(f,{}g,{}h),{}a..b)} returns the space \\spad{sp} of the domain \\spadtype{ThreeSpace} with the addition of the graph of the parametric curve \\spad{x = f(t),{} y = g(t),{} z = h(t)} as \\spad{t} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)}.") (((|ThreeSpace| (|DoubleFloat|)) (|ParametricSpaceCurve| (|Mapping| (|DoubleFloat|) (|DoubleFloat|))) (|Segment| (|Float|)) (|List| (|DrawOption|))) "\\spad{makeObject(curve(f,{}g,{}h),{}a..b,{}l)} returns a space of the domain \\spadtype{ThreeSpace} which contains the graph of the parametric curve \\spad{x = f(t),{} y = g(t),{} z = h(t)} as \\spad{t} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)}; The options contained in the list \\spad{l} of the domain \\spad{DrawOption} are applied.")) (|draw| (((|ThreeDimensionalViewport|) (|ParametricSurface| (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|))) (|Segment| (|Float|)) (|Segment| (|Float|))) "\\spad{draw(surface(f,{}g,{}h),{}a..b,{}c..d)} draws the graph of the parametric surface \\spad{x = f(u,{}v)},{} \\spad{y = g(u,{}v)},{} \\spad{z = h(u,{}v)} as \\spad{u} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)} and \\spad{v} ranges from \\spad{min(c,{}d)} to \\spad{max(c,{}d)}.") (((|ThreeDimensionalViewport|) (|ParametricSurface| (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|))) (|Segment| (|Float|)) (|Segment| (|Float|)) (|List| (|DrawOption|))) "\\spad{draw(surface(f,{}g,{}h),{}a..b,{}c..d)} draws the graph of the parametric surface \\spad{x = f(u,{}v)},{} \\spad{y = g(u,{}v)},{} \\spad{z = h(u,{}v)} as \\spad{u} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)} and \\spad{v} ranges from \\spad{min(c,{}d)} to \\spad{max(c,{}d)}; The options contained in the list \\spad{l} of the domain \\spad{DrawOption} are applied.") (((|ThreeDimensionalViewport|) (|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|Float|)) (|Segment| (|Float|))) "\\spad{draw(f,{}a..b,{}c..d)} draws the graph of the parametric surface \\spad{f(u,{}v)} as \\spad{u} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)} and \\spad{v} ranges from \\spad{min(c,{}d)} to \\spad{max(c,{}d)} The options contained in the list \\spad{l} of the domain \\spad{DrawOption} are applied.") (((|ThreeDimensionalViewport|) (|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|Float|)) (|Segment| (|Float|)) (|List| (|DrawOption|))) "\\spad{draw(f,{}a..b,{}c..d)} draws the graph of the parametric surface \\spad{f(u,{}v)} as \\spad{u} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)} and \\spad{v} ranges from \\spad{min(c,{}d)} to \\spad{max(c,{}d)}. The options contained in the list \\spad{l} of the domain \\spad{DrawOption} are applied.") (((|ThreeDimensionalViewport|) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|Float|)) (|Segment| (|Float|))) "\\spad{draw(f,{}a..b,{}c..d)} draws the graph of \\spad{z = f(x,{}y)} as \\spad{x} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)} and \\spad{y} ranges from \\spad{min(c,{}d)} to \\spad{max(c,{}d)}.") (((|ThreeDimensionalViewport|) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|Float|)) (|Segment| (|Float|)) (|List| (|DrawOption|))) "\\spad{draw(f,{}a..b,{}c..d,{}l)} draws the graph of \\spad{z = f(x,{}y)} as \\spad{x} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)} and \\spad{y} ranges from \\spad{min(c,{}d)} to \\spad{max(c,{}d)}. and the options contained in the list \\spad{l} of the domain \\spad{DrawOption} are applied.") (((|ThreeDimensionalViewport|) (|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|)) (|Segment| (|Float|))) "\\spad{draw(f,{}a..b,{}l)} draws the graph of the parametric curve \\spad{f} as \\spad{t} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)}.") (((|ThreeDimensionalViewport|) (|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|)) (|Segment| (|Float|)) (|List| (|DrawOption|))) "\\spad{draw(f,{}a..b,{}l)} draws the graph of the parametric curve \\spad{f} as \\spad{t} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)}. The options contained in the list \\spad{l} of the domain \\spad{DrawOption} are applied.") (((|ThreeDimensionalViewport|) (|ParametricSpaceCurve| (|Mapping| (|DoubleFloat|) (|DoubleFloat|))) (|Segment| (|Float|))) "\\spad{draw(curve(f,{}g,{}h),{}a..b,{}l)} draws the graph of the parametric curve \\spad{x = f(t),{} y = g(t),{} z = h(t)} as \\spad{t} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)}.") (((|ThreeDimensionalViewport|) (|ParametricSpaceCurve| (|Mapping| (|DoubleFloat|) (|DoubleFloat|))) (|Segment| (|Float|)) (|List| (|DrawOption|))) "\\spad{draw(curve(f,{}g,{}h),{}a..b,{}l)} draws the graph of the parametric curve \\spad{x = f(t),{} y = g(t),{} z = h(t)} as \\spad{t} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)}. The options contained in the list \\spad{l} of the domain \\spad{DrawOption} are applied.") (((|TwoDimensionalViewport|) (|ParametricPlaneCurve| (|Mapping| (|DoubleFloat|) (|DoubleFloat|))) (|Segment| (|Float|))) "\\spad{draw(curve(f,{}g),{}a..b)} draws the graph of the parametric curve \\spad{x = f(t),{} y = g(t)} as \\spad{t} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)}.") (((|TwoDimensionalViewport|) (|ParametricPlaneCurve| (|Mapping| (|DoubleFloat|) (|DoubleFloat|))) (|Segment| (|Float|)) (|List| (|DrawOption|))) "\\spad{draw(curve(f,{}g),{}a..b,{}l)} draws the graph of the parametric curve \\spad{x = f(t),{} y = g(t)} as \\spad{t} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)}. The options contained in the list \\spad{l} of the domain \\spad{DrawOption} are applied.") (((|TwoDimensionalViewport|) (|Mapping| (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|Float|))) "\\spad{draw(f,{}a..b)} draws the graph of \\spad{y = f(x)} as \\spad{x} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)}.") (((|TwoDimensionalViewport|) (|Mapping| (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|Float|)) (|List| (|DrawOption|))) "\\spad{draw(f,{}a..b,{}l)} draws the graph of \\spad{y = f(x)} as \\spad{x} ranges from \\spad{min(a,{}b)} to \\spad{max(a,{}b)}. The options contained in the list \\spad{l} of the domain \\spad{DrawOption} are applied."))) 
@@ -891,7 +891,7 @@ NIL
 (-240 R S V) 
 ((|constructor| (NIL "\\spadtype{DifferentialSparseMultivariatePolynomial} implements an ordinary differential polynomial ring by combining a domain belonging to the category \\spadtype{DifferentialVariableCategory} with the domain \\spadtype{SparseMultivariatePolynomial}. \\blankline"))) 
 (((-4235 "*") |has| |#1| (-157)) (-4226 |has| |#1| (-513)) (-4231 |has| |#1| (-6 -4231)) (-4228 . T) (-4227 . T) (-4230 . T)) 
-((|HasCategory| |#1| (QUOTE (-838))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-157))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-513)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -815) (QUOTE (-353)))) (|HasCategory| |#3| (LIST (QUOTE -815) (QUOTE (-353))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -815) (QUOTE (-521)))) (|HasCategory| |#3| (LIST (QUOTE -815) (QUOTE (-521))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-353))))) (|HasCategory| |#3| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-353)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521))))) (|HasCategory| |#3| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#3| (LIST (QUOTE -562) (QUOTE (-497))))) (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| |#1| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-210))) (|HasCategory| |#1| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#1| (QUOTE (-337))) (-3703 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521)))))) (|HasAttribute| |#1| (QUOTE -4231)) (|HasCategory| |#1| (QUOTE (-425))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-838)))) (-3703 (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-838)))) (-3703 (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-838)))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-838)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-838)))) (|HasCategory| |#1| (QUOTE (-133))))) 
+((|HasCategory| |#1| (QUOTE (-837))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-157))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-513)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -814) (QUOTE (-353)))) (|HasCategory| |#3| (LIST (QUOTE -814) (QUOTE (-353))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -814) (QUOTE (-521)))) (|HasCategory| |#3| (LIST (QUOTE -814) (QUOTE (-521))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-353))))) (|HasCategory| |#3| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-353)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521))))) (|HasCategory| |#3| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#3| (LIST (QUOTE -562) (QUOTE (-497))))) (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#1| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-210))) (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#1| (QUOTE (-337))) (-3703 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521)))))) (|HasAttribute| |#1| (QUOTE -4231)) (|HasCategory| |#1| (QUOTE (-425))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-837)))) (-3703 (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-837)))) (-3703 (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-837)))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-837)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-837)))) (|HasCategory| |#1| (QUOTE (-133))))) 
 (-241 A S) 
 ((|constructor| (NIL "\\spadtype{DifferentialVariableCategory} constructs the set of derivatives of a given set of (ordinary) differential indeterminates. If \\spad{x},{}...,{}\\spad{y} is an ordered set of differential indeterminates,{} and the prime notation is used for differentiation,{} then the set of derivatives (including zero-th order) of the differential indeterminates is \\spad{x},{}\\spad{x'},{}\\spad{x''},{}...,{} \\spad{y},{}\\spad{y'},{}\\spad{y''},{}... (Note: in the interpreter,{} the \\spad{n}-th derivative of \\spad{y} is displayed as \\spad{y} with a subscript \\spad{n}.) This set is viewed as a set of algebraic indeterminates,{} totally ordered in a way compatible with differentiation and the given order on the differential indeterminates. Such a total order is called a ranking of the differential indeterminates. \\blankline A domain in this category is needed to construct a differential polynomial domain. Differential polynomials are ordered by a ranking on the derivatives,{} and by an order (extending the ranking) on on the set of differential monomials. One may thus associate a domain in this category with a ranking of the differential indeterminates,{} just as one associates a domain in the category \\spadtype{OrderedAbelianMonoidSup} with an ordering of the set of monomials in a set of algebraic indeterminates. The ranking is specified through the binary relation \\spadfun{<}. For example,{} one may define one derivative to be less than another by lexicographically comparing first the \\spadfun{order},{} then the given order of the differential indeterminates appearing in the derivatives. This is the default implementation. \\blankline The notion of weight generalizes that of degree. A polynomial domain may be made into a graded ring if a weight function is given on the set of indeterminates,{} Very often,{} a grading is the first step in ordering the set of monomials. For differential polynomial domains,{} this constructor provides a function \\spadfun{weight},{} which allows the assignment of a non-negative number to each derivative of a differential indeterminate. For example,{} one may define the weight of a derivative to be simply its \\spadfun{order} (this is the default assignment). This weight function can then be extended to the set of all differential polynomials,{} providing a graded ring structure.")) (|coerce| (($ |#2|) "\\spad{coerce(s)} returns \\spad{s},{} viewed as the zero-th order derivative of \\spad{s}.")) (|differentiate| (($ $ (|NonNegativeInteger|)) "\\spad{differentiate(v,{} n)} returns the \\spad{n}-th derivative of \\spad{v}.") (($ $) "\\spad{differentiate(v)} returns the derivative of \\spad{v}.")) (|weight| (((|NonNegativeInteger|) $) "\\spad{weight(v)} returns the weight of the derivative \\spad{v}.")) (|variable| ((|#2| $) "\\spad{variable(v)} returns \\spad{s} if \\spad{v} is any derivative of the differential indeterminate \\spad{s}.")) (|order| (((|NonNegativeInteger|) $) "\\spad{order(v)} returns \\spad{n} if \\spad{v} is the \\spad{n}-th derivative of any differential indeterminate.")) (|makeVariable| (($ |#2| (|NonNegativeInteger|)) "\\spad{makeVariable(s,{} n)} returns the \\spad{n}-th derivative of a differential indeterminate \\spad{s} as an algebraic indeterminate."))) 
 NIL 
@@ -955,10 +955,10 @@ NIL
 (-256 A S) 
 ((|constructor| (NIL "An extensible aggregate is one which allows insertion and deletion of entries. These aggregates are models of lists and streams which are represented by linked structures so as to make insertion,{} deletion,{} and concatenation efficient. However,{} access to elements of these extensible aggregates is generally slow since access is made from the end. See \\spadtype{FlexibleArray} for an exception.")) (|removeDuplicates!| (($ $) "\\spad{removeDuplicates!(u)} destructively removes duplicates from \\spad{u}.")) (|select!| (($ (|Mapping| (|Boolean|) |#2|) $) "\\spad{select!(p,{}u)} destructively changes \\spad{u} by keeping only values \\spad{x} such that \\axiom{\\spad{p}(\\spad{x})}.")) (|merge!| (($ $ $) "\\spad{merge!(u,{}v)} destructively merges \\spad{u} and \\spad{v} in ascending order.") (($ (|Mapping| (|Boolean|) |#2| |#2|) $ $) "\\spad{merge!(p,{}u,{}v)} destructively merges \\spad{u} and \\spad{v} using predicate \\spad{p}.")) (|insert!| (($ $ $ (|Integer|)) "\\spad{insert!(v,{}u,{}i)} destructively inserts aggregate \\spad{v} into \\spad{u} at position \\spad{i}.") (($ |#2| $ (|Integer|)) "\\spad{insert!(x,{}u,{}i)} destructively inserts \\spad{x} into \\spad{u} at position \\spad{i}.")) (|remove!| (($ |#2| $) "\\spad{remove!(x,{}u)} destructively removes all values \\spad{x} from \\spad{u}.") (($ (|Mapping| (|Boolean|) |#2|) $) "\\spad{remove!(p,{}u)} destructively removes all elements \\spad{x} of \\spad{u} such that \\axiom{\\spad{p}(\\spad{x})} is \\spad{true}.")) (|delete!| (($ $ (|UniversalSegment| (|Integer|))) "\\spad{delete!(u,{}i..j)} destructively deletes elements \\spad{u}.\\spad{i} through \\spad{u}.\\spad{j}.") (($ $ (|Integer|)) "\\spad{delete!(u,{}i)} destructively deletes the \\axiom{\\spad{i}}th element of \\spad{u}.")) (|concat!| (($ $ $) "\\spad{concat!(u,{}v)} destructively appends \\spad{v} to the end of \\spad{u}. \\spad{v} is unchanged") (($ $ |#2|) "\\spad{concat!(u,{}x)} destructively adds element \\spad{x} to the end of \\spad{u}."))) 
 NIL 
-((|HasCategory| |#2| (QUOTE (-784))) (|HasCategory| |#2| (QUOTE (-1013)))) 
+((|HasCategory| |#2| (QUOTE (-783))) (|HasCategory| |#2| (QUOTE (-1013)))) 
 (-257 S) 
 ((|constructor| (NIL "An extensible aggregate is one which allows insertion and deletion of entries. These aggregates are models of lists and streams which are represented by linked structures so as to make insertion,{} deletion,{} and concatenation efficient. However,{} access to elements of these extensible aggregates is generally slow since access is made from the end. See \\spadtype{FlexibleArray} for an exception.")) (|removeDuplicates!| (($ $) "\\spad{removeDuplicates!(u)} destructively removes duplicates from \\spad{u}.")) (|select!| (($ (|Mapping| (|Boolean|) |#1|) $) "\\spad{select!(p,{}u)} destructively changes \\spad{u} by keeping only values \\spad{x} such that \\axiom{\\spad{p}(\\spad{x})}.")) (|merge!| (($ $ $) "\\spad{merge!(u,{}v)} destructively merges \\spad{u} and \\spad{v} in ascending order.") (($ (|Mapping| (|Boolean|) |#1| |#1|) $ $) "\\spad{merge!(p,{}u,{}v)} destructively merges \\spad{u} and \\spad{v} using predicate \\spad{p}.")) (|insert!| (($ $ $ (|Integer|)) "\\spad{insert!(v,{}u,{}i)} destructively inserts aggregate \\spad{v} into \\spad{u} at position \\spad{i}.") (($ |#1| $ (|Integer|)) "\\spad{insert!(x,{}u,{}i)} destructively inserts \\spad{x} into \\spad{u} at position \\spad{i}.")) (|remove!| (($ |#1| $) "\\spad{remove!(x,{}u)} destructively removes all values \\spad{x} from \\spad{u}.") (($ (|Mapping| (|Boolean|) |#1|) $) "\\spad{remove!(p,{}u)} destructively removes all elements \\spad{x} of \\spad{u} such that \\axiom{\\spad{p}(\\spad{x})} is \\spad{true}.")) (|delete!| (($ $ (|UniversalSegment| (|Integer|))) "\\spad{delete!(u,{}i..j)} destructively deletes elements \\spad{u}.\\spad{i} through \\spad{u}.\\spad{j}.") (($ $ (|Integer|)) "\\spad{delete!(u,{}i)} destructively deletes the \\axiom{\\spad{i}}th element of \\spad{u}.")) (|concat!| (($ $ $) "\\spad{concat!(u,{}v)} destructively appends \\spad{v} to the end of \\spad{u}. \\spad{v} is unchanged") (($ $ |#1|) "\\spad{concat!(u,{}x)} destructively adds element \\spad{x} to the end of \\spad{u}."))) 
-((-4234 . T) (-2046 . T)) 
+((-4234 . T) (-2092 . T)) 
 NIL 
 (-258 S) 
 ((|constructor| (NIL "Category for the elementary functions.")) (** (($ $ $) "\\spad{x**y} returns \\spad{x} to the power \\spad{y}.")) (|exp| (($ $) "\\spad{exp(x)} returns \\%\\spad{e} to the power \\spad{x}.")) (|log| (($ $) "\\spad{log(x)} returns the natural logarithm of \\spad{x}."))) 
@@ -984,7 +984,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 
-(-264 S R |Mod| -2633 -1318 |exactQuo|) 
+(-264 S R |Mod| -1664 -3389 |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"))) 
 ((-4226 . T) ((-4235 "*") . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
 NIL 
@@ -993,7 +993,7 @@ NIL
 ((-4226 . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
 NIL 
 (-266) 
-((|constructor| (NIL "\\indented{1}{Author: Gabriel Dos Reis} Date Created: October 24,{} 2007 Date Last Modified: January 19,{} 2008. An `Environment' is a stack of scope.")) (|categoryFrame| (($) "the current category environment in the interpreter.")) (|currentEnv| (($) "the current normal environment in effect.")) (|setProperties!| (($ (|Symbol|) (|List| (|ObjectProperty|)) $) "setBinding!(\\spad{n},{}props,{}\\spad{e}) set the list of properties of \\spad{`n'} to `props' in `e'.")) (|getProperties| (((|Union| (|List| (|ObjectProperty|)) "failed") (|Symbol|) $) "getBinding(\\spad{n},{}\\spad{e}) returns the list of properties of \\spad{`n'} in \\spad{e}; otherwise `failed'.")) (|setProperty!| (($ (|Symbol|) (|Symbol|) (|SExpression|) $) "\\spad{setProperty!(n,{}p,{}v,{}e)} binds the property `(\\spad{p},{}\\spad{v})' to \\spad{`n'} in the topmost scope of `e'.")) (|getProperty| (((|Union| (|SExpression|) "failed") (|Symbol|) (|Symbol|) $) "\\spad{getProperty(n,{}p,{}e)} returns the value of property with name \\spad{`p'} for the symbol \\spad{`n'} in environment `e'. Otherwise,{} `failed'.")) (|scopes| (((|List| (|Scope|)) $) "\\spad{scopes(e)} returns the stack of scopes in environment \\spad{e}.")) (|empty| (($) "\\spad{empty()} constructs an empty environment"))) 
+((|constructor| (NIL "\\indented{1}{Author: Gabriel Dos Reis} Date Created: October 24,{} 2007 Date Last Modified: January 19,{} 2008. An `Environment' is a stack of scope.")) (|categoryFrame| (($) "the current category environment in the interpreter.")) (|currentEnv| (($) "the current normal environment in effect.")) (|setProperties!| (($ (|Symbol|) (|List| (|Property|)) $) "setBinding!(\\spad{n},{}props,{}\\spad{e}) set the list of properties of \\spad{`n'} to `props' in `e'.")) (|getProperties| (((|Union| (|List| (|Property|)) "failed") (|Symbol|) $) "getBinding(\\spad{n},{}\\spad{e}) returns the list of properties of \\spad{`n'} in \\spad{e}; otherwise `failed'.")) (|setProperty!| (($ (|Symbol|) (|Symbol|) (|SExpression|) $) "\\spad{setProperty!(n,{}p,{}v,{}e)} binds the property `(\\spad{p},{}\\spad{v})' to \\spad{`n'} in the topmost scope of `e'.")) (|getProperty| (((|Union| (|SExpression|) "failed") (|Symbol|) (|Symbol|) $) "\\spad{getProperty(n,{}p,{}e)} returns the value of property with name \\spad{`p'} for the symbol \\spad{`n'} in environment `e'. Otherwise,{} `failed'.")) (|scopes| (((|List| (|Scope|)) $) "\\spad{scopes(e)} returns the stack of scopes in environment \\spad{e}.")) (|empty| (($) "\\spad{empty()} constructs an empty environment"))) 
 NIL 
 NIL 
 (-267 R) 
@@ -1007,11 +1007,11 @@ NIL
 (-269 S) 
 ((|constructor| (NIL "Equations as mathematical objects. All properties of the basis domain,{} \\spadignore{e.g.} being an abelian group are carried over the equation domain,{} by performing the structural operations on the left and on the right hand side.")) (|subst| (($ $ $) "\\spad{subst(eq1,{}eq2)} substitutes \\spad{eq2} into both sides of \\spad{eq1} the \\spad{lhs} of \\spad{eq2} should be a kernel")) (|inv| (($ $) "\\spad{inv(x)} returns the multiplicative inverse of \\spad{x}.")) (/ (($ $ $) "\\spad{e1/e2} produces a new equation by dividing the left and right hand sides of equations e1 and e2.")) (|factorAndSplit| (((|List| $) $) "\\spad{factorAndSplit(eq)} make the right hand side 0 and factors the new left hand side. Each factor is equated to 0 and put into the resulting list without repetitions.")) (|rightOne| (((|Union| $ "failed") $) "\\spad{rightOne(eq)} divides by the right hand side.") (((|Union| $ "failed") $) "\\spad{rightOne(eq)} divides by the right hand side,{} if possible.")) (|leftOne| (((|Union| $ "failed") $) "\\spad{leftOne(eq)} divides by the left hand side.") (((|Union| $ "failed") $) "\\spad{leftOne(eq)} divides by the left hand side,{} if possible.")) (* (($ $ |#1|) "\\spad{eqn*x} produces a new equation by multiplying both sides of equation eqn by \\spad{x}.") (($ |#1| $) "\\spad{x*eqn} produces a new equation by multiplying both sides of equation eqn by \\spad{x}.")) (- (($ $ |#1|) "\\spad{eqn-x} produces a new equation by subtracting \\spad{x} from both sides of equation eqn.") (($ |#1| $) "\\spad{x-eqn} produces a new equation by subtracting both sides of equation eqn from \\spad{x}.")) (|rightZero| (($ $) "\\spad{rightZero(eq)} subtracts the right hand side.")) (|leftZero| (($ $) "\\spad{leftZero(eq)} subtracts the left hand side.")) (+ (($ $ |#1|) "\\spad{eqn+x} produces a new equation by adding \\spad{x} to both sides of equation eqn.") (($ |#1| $) "\\spad{x+eqn} produces a new equation by adding \\spad{x} to both sides of equation eqn.")) (|eval| (($ $ (|List| $)) "\\spad{eval(eqn,{} [x1=v1,{} ... xn=vn])} replaces \\spad{xi} by \\spad{vi} in equation \\spad{eqn}.") (($ $ $) "\\spad{eval(eqn,{} x=f)} replaces \\spad{x} by \\spad{f} in equation \\spad{eqn}.")) (|map| (($ (|Mapping| |#1| |#1|) $) "\\spad{map(f,{}eqn)} constructs a new equation by applying \\spad{f} to both sides of \\spad{eqn}.")) (|rhs| ((|#1| $) "\\spad{rhs(eqn)} returns the right hand side of equation \\spad{eqn}.")) (|lhs| ((|#1| $) "\\spad{lhs(eqn)} returns the left hand side of equation \\spad{eqn}.")) (|swap| (($ $) "\\spad{swap(eq)} interchanges left and right hand side of equation \\spad{eq}.")) (|equation| (($ |#1| |#1|) "\\spad{equation(a,{}b)} creates an equation.")) (= (($ |#1| |#1|) "\\spad{a=b} creates an equation."))) 
 ((-4230 -3703 (|has| |#1| (-970)) (|has| |#1| (-446))) (-4227 |has| |#1| (-970)) (-4228 |has| |#1| (-970))) 
-((|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (QUOTE (-970))) (|HasCategory| |#1| (LIST (QUOTE -829) (QUOTE (-1084)))) (-3703 (|HasCategory| |#1| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#1| (QUOTE (-970)))) (|HasCategory| |#1| (QUOTE (-446))) (|HasCategory| |#1| (LIST (QUOTE -482) (QUOTE (-1084)) (|devaluate| |#1|))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-277))) (-3703 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-446)))) (-3703 (|HasCategory| |#1| (QUOTE (-446))) (|HasCategory| |#1| (QUOTE (-970)))) (|HasCategory| |#1| (QUOTE (-157))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-970)))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasCategory| |#1| (QUOTE (-663))) (-3703 (|HasCategory| |#1| (QUOTE (-446))) (|HasCategory| |#1| (QUOTE (-663)))) (|HasCategory| |#1| (QUOTE (-1025))) (-3703 (|HasCategory| |#1| (QUOTE (-446))) (|HasCategory| |#1| (QUOTE (-663))) (|HasCategory| |#1| (QUOTE (-1025)))) (|HasCategory| |#1| (QUOTE (-21))) (-3703 (|HasCategory| |#1| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-970)))) (-3703 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-663)))) (|HasCategory| |#1| (QUOTE (-25))) (-3703 (|HasCategory| |#1| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-970)))) (-3703 (|HasCategory| |#1| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-446))) (|HasCategory| |#1| (QUOTE (-663))) (|HasCategory| |#1| (QUOTE (-970))) (|HasCategory| |#1| (QUOTE (-1025))) (|HasCategory| |#1| (QUOTE (-1013))))) 
+((|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (QUOTE (-970))) (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1084)))) (-3703 (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#1| (QUOTE (-970)))) (|HasCategory| |#1| (QUOTE (-446))) (|HasCategory| |#1| (LIST (QUOTE -482) (QUOTE (-1084)) (|devaluate| |#1|))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-277))) (-3703 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-446)))) (-3703 (|HasCategory| |#1| (QUOTE (-446))) (|HasCategory| |#1| (QUOTE (-970)))) (|HasCategory| |#1| (QUOTE (-157))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-970)))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasCategory| |#1| (QUOTE (-663))) (-3703 (|HasCategory| |#1| (QUOTE (-446))) (|HasCategory| |#1| (QUOTE (-663)))) (|HasCategory| |#1| (QUOTE (-1025))) (-3703 (|HasCategory| |#1| (QUOTE (-446))) (|HasCategory| |#1| (QUOTE (-663))) (|HasCategory| |#1| (QUOTE (-1025)))) (|HasCategory| |#1| (QUOTE (-21))) (-3703 (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-970)))) (-3703 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-663)))) (|HasCategory| |#1| (QUOTE (-25))) (-3703 (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-970)))) (-3703 (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-446))) (|HasCategory| |#1| (QUOTE (-663))) (|HasCategory| |#1| (QUOTE (-970))) (|HasCategory| |#1| (QUOTE (-1025))) (|HasCategory| |#1| (QUOTE (-1013))))) 
 (-270 |Key| |Entry|) 
 ((|constructor| (NIL "This domain provides tables where the keys are compared using \\spadfun{eq?}. Thus keys are considered equal only if they are the same instance of a structure."))) 
 ((-4233 . T) (-4234 . T)) 
-((|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (QUOTE (-1013))) (-12 (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (QUOTE (-1013))) (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (LIST (QUOTE -284) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2529) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3045) (|devaluate| |#2|)))))) (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| |#2| (QUOTE (-1013))) (-3703 (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (QUOTE (-1013))) (|HasCategory| |#2| (QUOTE (-1013)))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-792)))) (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (LIST (QUOTE -561) (QUOTE (-792)))) (-3703 (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (QUOTE (-1013))) (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (LIST (QUOTE -561) (QUOTE (-792)))) (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-792))))) (-3703 (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (LIST (QUOTE -561) (QUOTE (-792)))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-792)))))) 
+((|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (QUOTE (-1013))) (-12 (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (QUOTE (-1013))) (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (LIST (QUOTE -284) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2535) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3050) (|devaluate| |#2|)))))) (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#2| (QUOTE (-1013))) (-3703 (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (QUOTE (-1013))) (|HasCategory| |#2| (QUOTE (-1013)))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-791)))) (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (LIST (QUOTE -561) (QUOTE (-791)))) (-3703 (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (QUOTE (-1013))) (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (LIST (QUOTE -561) (QUOTE (-791)))) (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-791))))) (-3703 (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (LIST (QUOTE -561) (QUOTE (-791)))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-791)))))) 
 (-271) 
 ((|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 
@@ -1079,7 +1079,7 @@ NIL
 (-287 R FE |var| |cen|) 
 ((|constructor| (NIL "UnivariatePuiseuxSeriesWithExponentialSingularity is a domain used to represent essential singularities of functions. Objects in this domain are quotients of sums,{} where each term in the sum is a univariate Puiseux series times the exponential of a univariate Puiseux series.")) (|coerce| (($ (|UnivariatePuiseuxSeries| |#2| |#3| |#4|)) "\\spad{coerce(f)} converts a \\spadtype{UnivariatePuiseuxSeries} to an \\spadtype{ExponentialExpansion}.")) (|limitPlus| (((|Union| (|OrderedCompletion| |#2|) "failed") $) "\\spad{limitPlus(f(var))} returns \\spad{limit(var -> a+,{}f(var))}."))) 
 ((-4225 . T) (-4231 . T) (-4226 . T) ((-4235 "*") . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
-((|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (QUOTE (-838))) (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (LIST (QUOTE -961) (QUOTE (-1084)))) (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (QUOTE (-133))) (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (QUOTE (-135))) (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (QUOTE (-946))) (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (QUOTE (-757))) (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (QUOTE (-1060))) (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (LIST (QUOTE -815) (QUOTE (-521)))) (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (LIST (QUOTE -815) (QUOTE (-353)))) (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-353))))) (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521))))) (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (QUOTE (-210))) (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (LIST (QUOTE -482) (QUOTE (-1084)) (LIST (QUOTE -1151) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#4|)))) (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (LIST (QUOTE -284) (LIST (QUOTE -1151) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#4|)))) (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (LIST (QUOTE -261) (LIST (QUOTE -1151) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#4|)) (LIST (QUOTE -1151) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#4|)))) (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (QUOTE (-282))) (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (QUOTE (-506))) (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (QUOTE (-784))) (-3703 (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (QUOTE (-757))) (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (QUOTE (-784)))) (-12 (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (QUOTE (-838))) (|HasCategory| $ (QUOTE (-133)))) (-3703 (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (QUOTE (-133))) (-12 (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (QUOTE (-838))) (|HasCategory| $ (QUOTE (-133)))))) 
+((|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (QUOTE (-837))) (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (LIST (QUOTE -961) (QUOTE (-1084)))) (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (QUOTE (-133))) (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (QUOTE (-135))) (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (QUOTE (-946))) (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (QUOTE (-756))) (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (QUOTE (-1060))) (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (LIST (QUOTE -814) (QUOTE (-521)))) (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (LIST (QUOTE -814) (QUOTE (-353)))) (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-353))))) (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521))))) (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (QUOTE (-210))) (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (LIST (QUOTE -482) (QUOTE (-1084)) (LIST (QUOTE -1151) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#4|)))) (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (LIST (QUOTE -284) (LIST (QUOTE -1151) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#4|)))) (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (LIST (QUOTE -261) (LIST (QUOTE -1151) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#4|)) (LIST (QUOTE -1151) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#4|)))) (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (QUOTE (-282))) (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (QUOTE (-506))) (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (QUOTE (-783))) (-3703 (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (QUOTE (-756))) (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (QUOTE (-783)))) (-12 (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (QUOTE (-837))) (|HasCategory| $ (QUOTE (-133)))) (-3703 (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (QUOTE (-133))) (-12 (|HasCategory| (-1151 |#1| |#2| |#3| |#4|) (QUOTE (-837))) (|HasCategory| $ (QUOTE (-133)))))) 
 (-288 R S) 
 ((|constructor| (NIL "Lifting of maps to Expressions. Date Created: 16 Jan 1989 Date Last Updated: 22 Jan 1990")) (|map| (((|Expression| |#2|) (|Mapping| |#2| |#1|) (|Expression| |#1|)) "\\spad{map(f,{} e)} applies \\spad{f} to all the constants appearing in \\spad{e}."))) 
 NIL 
@@ -1091,7 +1091,7 @@ NIL
 (-290 R) 
 ((|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."))) 
 ((-4230 -3703 (-4009 (|has| |#1| (-970)) (|has| |#1| (-583 (-521)))) (-12 (|has| |#1| (-513)) (-3703 (-4009 (|has| |#1| (-970)) (|has| |#1| (-583 (-521)))) (|has| |#1| (-970)) (|has| |#1| (-446)))) (|has| |#1| (-970)) (|has| |#1| (-446))) (-4228 |has| |#1| (-157)) (-4227 |has| |#1| (-157)) ((-4235 "*") |has| |#1| (-513)) (-4226 |has| |#1| (-513)) (-4231 |has| |#1| (-513)) (-4225 |has| |#1| (-513))) 
-((|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-970))) (-3703 (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-970)))) (|HasCategory| |#1| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-446))) (|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (LIST (QUOTE -815) (QUOTE (-521)))) (|HasCategory| |#1| (LIST (QUOTE -815) (QUOTE (-353)))) (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-353))))) (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521))))) (-12 (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521))))) (-3703 (|HasCategory| |#1| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-970)))) (-12 (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-513)))) (-3703 (|HasCategory| |#1| (QUOTE (-446))) (|HasCategory| |#1| (QUOTE (-513)))) (-12 (|HasCategory| |#1| (QUOTE (-970))) (|HasCategory| |#1| (LIST (QUOTE -583) (QUOTE (-521))))) (-3703 (|HasCategory| |#1| (QUOTE (-970))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521))))) (-3703 (|HasCategory| |#1| (QUOTE (-446))) (|HasCategory| |#1| (QUOTE (-970)))) (|HasCategory| |#1| (QUOTE (-21))) (-3703 (|HasCategory| |#1| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-970)))) (-3703 (|HasCategory| |#1| (QUOTE (-21))) (-12 (|HasCategory| |#1| (QUOTE (-970))) (|HasCategory| |#1| (LIST (QUOTE -583) (QUOTE (-521)))))) (|HasCategory| |#1| (QUOTE (-25))) (-3703 (|HasCategory| |#1| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-970)))) (-3703 (|HasCategory| |#1| (QUOTE (-25))) (-12 (|HasCategory| |#1| (QUOTE (-970))) (|HasCategory| |#1| (LIST (QUOTE -583) (QUOTE (-521)))))) (|HasCategory| |#1| (QUOTE (-1025))) (-3703 (|HasCategory| |#1| (QUOTE (-446))) (|HasCategory| |#1| (QUOTE (-1025)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-970))) (|HasCategory| |#1| (LIST (QUOTE -583) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-1025)))) (-3703 (|HasCategory| |#1| (QUOTE (-25))) (-12 (|HasCategory| |#1| (QUOTE (-970))) (|HasCategory| |#1| (LIST (QUOTE -583) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-1025)))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (-3703 (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (-12 (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))))) (-3703 (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-513)))) (-3703 (-12 (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-513)))) (-12 (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))))) (|HasCategory| $ (QUOTE (-970))) (|HasCategory| $ (LIST (QUOTE -961) (QUOTE (-521))))) 
+((|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-970))) (-3703 (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-970)))) (|HasCategory| |#1| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-446))) (|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (LIST (QUOTE -814) (QUOTE (-521)))) (|HasCategory| |#1| (LIST (QUOTE -814) (QUOTE (-353)))) (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-353))))) (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521))))) (-12 (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521))))) (-3703 (|HasCategory| |#1| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-970)))) (-12 (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-513)))) (-3703 (|HasCategory| |#1| (QUOTE (-446))) (|HasCategory| |#1| (QUOTE (-513)))) (-12 (|HasCategory| |#1| (QUOTE (-970))) (|HasCategory| |#1| (LIST (QUOTE -583) (QUOTE (-521))))) (-3703 (|HasCategory| |#1| (QUOTE (-970))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521))))) (-3703 (|HasCategory| |#1| (QUOTE (-446))) (|HasCategory| |#1| (QUOTE (-970)))) (|HasCategory| |#1| (QUOTE (-21))) (-3703 (|HasCategory| |#1| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-970)))) (-3703 (|HasCategory| |#1| (QUOTE (-21))) (-12 (|HasCategory| |#1| (QUOTE (-970))) (|HasCategory| |#1| (LIST (QUOTE -583) (QUOTE (-521)))))) (|HasCategory| |#1| (QUOTE (-25))) (-3703 (|HasCategory| |#1| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-970)))) (-3703 (|HasCategory| |#1| (QUOTE (-25))) (-12 (|HasCategory| |#1| (QUOTE (-970))) (|HasCategory| |#1| (LIST (QUOTE -583) (QUOTE (-521)))))) (|HasCategory| |#1| (QUOTE (-1025))) (-3703 (|HasCategory| |#1| (QUOTE (-446))) (|HasCategory| |#1| (QUOTE (-1025)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-970))) (|HasCategory| |#1| (LIST (QUOTE -583) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-1025)))) (-3703 (|HasCategory| |#1| (QUOTE (-25))) (-12 (|HasCategory| |#1| (QUOTE (-970))) (|HasCategory| |#1| (LIST (QUOTE -583) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-1025)))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (-3703 (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (-12 (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))))) (-3703 (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-513)))) (-3703 (-12 (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-513)))) (-12 (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))))) (|HasCategory| $ (QUOTE (-970))) (|HasCategory| $ (LIST (QUOTE -961) (QUOTE (-521))))) 
 (-291 R -4049) 
 ((|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 
@@ -1103,7 +1103,7 @@ NIL
 (-293 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."))) 
 (((-4235 "*") |has| |#1| (-157)) (-4226 |has| |#1| (-513)) (-4231 |has| |#1| (-337)) (-4225 |has| |#1| (-337)) (-4227 . T) (-4228 . T) (-4230 . T)) 
-((|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-157))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-513)))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -381) (QUOTE (-521))) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -381) (QUOTE (-521))) (|devaluate| |#1|))))) (|HasCategory| (-381 (-521)) (QUOTE (-1025))) (|HasCategory| |#1| (QUOTE (-337))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-513)))) (-3703 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-513)))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -381) (QUOTE (-521)))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -381) (QUOTE (-521)))))) (|HasSignature| |#1| (LIST (QUOTE -2189) (LIST (|devaluate| |#1|) (QUOTE (-1084)))))) (-3703 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-887))) (|HasCategory| |#1| (QUOTE (-1105))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasSignature| |#1| (LIST (QUOTE -2184) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1084))))) (|HasSignature| |#1| (LIST (QUOTE -4084) (LIST (LIST (QUOTE -587) (QUOTE (-1084))) (|devaluate| |#1|))))))) 
+((|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-157))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-513)))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -381) (QUOTE (-521))) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -381) (QUOTE (-521))) (|devaluate| |#1|))))) (|HasCategory| (-381 (-521)) (QUOTE (-1025))) (|HasCategory| |#1| (QUOTE (-337))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-513)))) (-3703 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-513)))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -381) (QUOTE (-521)))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -381) (QUOTE (-521)))))) (|HasSignature| |#1| (LIST (QUOTE -2223) (LIST (|devaluate| |#1|) (QUOTE (-1084)))))) (-3703 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-886))) (|HasCategory| |#1| (QUOTE (-1105))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasSignature| |#1| (LIST (QUOTE -1749) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1084))))) (|HasSignature| |#1| (LIST (QUOTE -4085) (LIST (LIST (QUOTE -587) (QUOTE (-1084))) (|devaluate| |#1|))))))) 
 (-294 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 
@@ -1115,7 +1115,7 @@ NIL
 (-296 S) 
 ((|constructor| (NIL "The free abelian group on a set \\spad{S} is the monoid of finite sums of the form \\spad{reduce(+,{}[\\spad{ni} * \\spad{si}])} where the \\spad{si}\\spad{'s} are in \\spad{S},{} and the \\spad{ni}\\spad{'s} are integers. The operation is commutative."))) 
 ((-4228 . T) (-4227 . T)) 
-((|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| (-521) (QUOTE (-728)))) 
+((|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| (-521) (QUOTE (-728)))) 
 (-297 S E) 
 ((|constructor| (NIL "A free abelian monoid on a set \\spad{S} is the monoid of finite sums of the form \\spad{reduce(+,{}[\\spad{ni} * \\spad{si}])} where the \\spad{si}\\spad{'s} are in \\spad{S},{} and the \\spad{ni}\\spad{'s} are in a given abelian monoid. The operation is commutative.")) (|highCommonTerms| (($ $ $) "\\spad{highCommonTerms(e1 a1 + ... + en an,{} f1 b1 + ... + fm bm)} returns \\indented{2}{\\spad{reduce(+,{}[max(\\spad{ei},{} \\spad{fi}) \\spad{ci}])}} where \\spad{ci} ranges in the intersection of \\spad{{a1,{}...,{}an}} and \\spad{{b1,{}...,{}bm}}.")) (|mapGen| (($ (|Mapping| |#1| |#1|) $) "\\spad{mapGen(f,{} e1 a1 +...+ en an)} returns \\spad{e1 f(a1) +...+ en f(an)}.")) (|mapCoef| (($ (|Mapping| |#2| |#2|) $) "\\spad{mapCoef(f,{} e1 a1 +...+ en an)} returns \\spad{f(e1) a1 +...+ f(en) an}.")) (|coefficient| ((|#2| |#1| $) "\\spad{coefficient(s,{} e1 a1 + ... + en an)} returns \\spad{ei} such that \\spad{ai} = \\spad{s},{} or 0 if \\spad{s} is not one of the \\spad{ai}\\spad{'s}.")) (|nthFactor| ((|#1| $ (|Integer|)) "\\spad{nthFactor(x,{} n)} returns the factor of the n^th term of \\spad{x}.")) (|nthCoef| ((|#2| $ (|Integer|)) "\\spad{nthCoef(x,{} n)} returns the coefficient of the n^th term of \\spad{x}.")) (|terms| (((|List| (|Record| (|:| |gen| |#1|) (|:| |exp| |#2|))) $) "\\spad{terms(e1 a1 + ... + en an)} returns \\spad{[[a1,{} e1],{}...,{}[an,{} en]]}.")) (|size| (((|NonNegativeInteger|) $) "\\spad{size(x)} returns the number of terms in \\spad{x}. mapGen(\\spad{f},{} a1\\spad{\\^}e1 ... an\\spad{\\^}en) returns \\spad{f(a1)\\^e1 ... f(an)\\^en}.")) (* (($ |#2| |#1|) "\\spad{e * s} returns \\spad{e} times \\spad{s}.")) (+ (($ |#1| $) "\\spad{s + x} returns the sum of \\spad{s} and \\spad{x}."))) 
 NIL 
@@ -1135,7 +1135,7 @@ NIL
 (-301 S) 
 ((|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."))) 
 ((-4234 . T) (-4233 . T)) 
-((|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| (-521) (QUOTE (-784))) (|HasCategory| |#1| (QUOTE (-1013))) (-3703 (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| |#1| (QUOTE (-1013)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|))))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))))) 
+((|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| (-521) (QUOTE (-783))) (|HasCategory| |#1| (QUOTE (-1013))) (-3703 (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#1| (QUOTE (-1013)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|))))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))))) 
 (-302 S -4049) 
 ((|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 
@@ -1199,7 +1199,7 @@ NIL
 (-317 |p| |extdeg|) 
 ((|constructor| (NIL "FiniteFieldCyclicGroup(\\spad{p},{}\\spad{n}) implements a finite field extension of degee \\spad{n} over the prime field with \\spad{p} elements. Its elements are represented by powers of a primitive element,{} \\spadignore{i.e.} a generator of the multiplicative (cyclic) group. As primitive element we choose the root of the extension polynomial,{} which is created by {\\em createPrimitivePoly} from \\spadtype{FiniteFieldPolynomialPackage}. The Zech logarithms are stored in a table of size half of the field size,{} and use \\spadtype{SingleInteger} for representing field elements,{} hence,{} there are restrictions on the size of the field.")) (|getZechTable| (((|PrimitiveArray| (|SingleInteger|))) "\\spad{getZechTable()} returns the zech logarithm table of the field. This table is used to perform additions in the field quickly."))) 
 ((-4225 . T) (-4231 . T) (-4226 . T) ((-4235 "*") . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
-((|HasCategory| (-839 |#1|) (QUOTE (-135))) (|HasCategory| (-839 |#1|) (QUOTE (-342))) (|HasCategory| (-839 |#1|) (QUOTE (-133))) (-3703 (|HasCategory| (-839 |#1|) (QUOTE (-133))) (|HasCategory| (-839 |#1|) (QUOTE (-342))))) 
+((|HasCategory| (-838 |#1|) (QUOTE (-135))) (|HasCategory| (-838 |#1|) (QUOTE (-342))) (|HasCategory| (-838 |#1|) (QUOTE (-133))) (-3703 (|HasCategory| (-838 |#1|) (QUOTE (-133))) (|HasCategory| (-838 |#1|) (QUOTE (-342))))) 
 (-318 GF |defpol|) 
 ((|constructor| (NIL "FiniteFieldCyclicGroupExtensionByPolynomial(\\spad{GF},{}defpol) implements a finite extension field of the ground field {\\em GF}. Its elements are represented by powers of a primitive element,{} \\spadignore{i.e.} a generator of the multiplicative (cyclic) group. As primitive element we choose the root of the extension polynomial {\\em defpol},{} which MUST be primitive (user responsibility). Zech logarithms are stored in a table of size half of the field size,{} and use \\spadtype{SingleInteger} for representing field elements,{} hence,{} there are restrictions on the size of the field.")) (|getZechTable| (((|PrimitiveArray| (|SingleInteger|))) "\\spad{getZechTable()} returns the zech logarithm table of the field it is used to perform additions in the field quickly."))) 
 ((-4225 . T) (-4231 . T) (-4226 . T) ((-4235 "*") . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
@@ -1231,7 +1231,7 @@ NIL
 (-325 |p| |extdeg|) 
 ((|constructor| (NIL "FiniteFieldNormalBasis(\\spad{p},{}\\spad{n}) implements a finite extension field of degree \\spad{n} over the prime field with \\spad{p} elements. The elements are represented by coordinate vectors with respect to a normal basis,{} \\spadignore{i.e.} a basis consisting of the conjugates (\\spad{q}-powers) of an element,{} in this case called normal element. This is chosen as a root of the extension polynomial created by \\spadfunFrom{createNormalPoly}{FiniteFieldPolynomialPackage}.")) (|sizeMultiplication| (((|NonNegativeInteger|)) "\\spad{sizeMultiplication()} returns the number of entries in the multiplication table of the field. Note: The time of multiplication of field elements depends on this size.")) (|getMultiplicationMatrix| (((|Matrix| (|PrimeField| |#1|))) "\\spad{getMultiplicationMatrix()} returns the multiplication table in form of a matrix.")) (|getMultiplicationTable| (((|Vector| (|List| (|Record| (|:| |value| (|PrimeField| |#1|)) (|:| |index| (|SingleInteger|)))))) "\\spad{getMultiplicationTable()} returns the multiplication table for the normal basis of the field. This table is used to perform multiplications between field elements."))) 
 ((-4225 . T) (-4231 . T) (-4226 . T) ((-4235 "*") . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
-((|HasCategory| (-839 |#1|) (QUOTE (-135))) (|HasCategory| (-839 |#1|) (QUOTE (-342))) (|HasCategory| (-839 |#1|) (QUOTE (-133))) (-3703 (|HasCategory| (-839 |#1|) (QUOTE (-133))) (|HasCategory| (-839 |#1|) (QUOTE (-342))))) 
+((|HasCategory| (-838 |#1|) (QUOTE (-135))) (|HasCategory| (-838 |#1|) (QUOTE (-342))) (|HasCategory| (-838 |#1|) (QUOTE (-133))) (-3703 (|HasCategory| (-838 |#1|) (QUOTE (-133))) (|HasCategory| (-838 |#1|) (QUOTE (-342))))) 
 (-326 GF |uni|) 
 ((|constructor| (NIL "FiniteFieldNormalBasisExtensionByPolynomial(\\spad{GF},{}uni) implements a finite extension of the ground field {\\em GF}. The elements are represented by coordinate vectors with respect to. a normal basis,{} \\spadignore{i.e.} a basis consisting of the conjugates (\\spad{q}-powers) of an element,{} in this case called normal element,{} where \\spad{q} is the size of {\\em GF}. The normal element is chosen as a root of the extension polynomial,{} which MUST be normal over {\\em GF} (user responsibility)")) (|sizeMultiplication| (((|NonNegativeInteger|)) "\\spad{sizeMultiplication()} returns the number of entries in the multiplication table of the field. Note: the time of multiplication of field elements depends on this size.")) (|getMultiplicationMatrix| (((|Matrix| |#1|)) "\\spad{getMultiplicationMatrix()} returns the multiplication table in form of a matrix.")) (|getMultiplicationTable| (((|Vector| (|List| (|Record| (|:| |value| |#1|) (|:| |index| (|SingleInteger|)))))) "\\spad{getMultiplicationTable()} returns the multiplication table for the normal basis of the field. This table is used to perform multiplications between field elements."))) 
 ((-4225 . T) (-4231 . T) (-4226 . T) ((-4235 "*") . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
@@ -1243,7 +1243,7 @@ NIL
 (-328 |p| |n|) 
 ((|constructor| (NIL "FiniteField(\\spad{p},{}\\spad{n}) implements finite fields with p**n elements. This packages checks that \\spad{p} is prime. For a non-checking version,{} see \\spadtype{InnerFiniteField}."))) 
 ((-4225 . T) (-4231 . T) (-4226 . T) ((-4235 "*") . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
-((|HasCategory| (-839 |#1|) (QUOTE (-135))) (|HasCategory| (-839 |#1|) (QUOTE (-342))) (|HasCategory| (-839 |#1|) (QUOTE (-133))) (-3703 (|HasCategory| (-839 |#1|) (QUOTE (-133))) (|HasCategory| (-839 |#1|) (QUOTE (-342))))) 
+((|HasCategory| (-838 |#1|) (QUOTE (-135))) (|HasCategory| (-838 |#1|) (QUOTE (-342))) (|HasCategory| (-838 |#1|) (QUOTE (-133))) (-3703 (|HasCategory| (-838 |#1|) (QUOTE (-133))) (|HasCategory| (-838 |#1|) (QUOTE (-342))))) 
 (-329 GF |defpol|) 
 ((|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."))) 
 ((-4225 . T) (-4231 . T) (-4226 . T) ((-4235 "*") . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
@@ -1315,10 +1315,10 @@ NIL
 (-346 A S) 
 ((|constructor| (NIL "A finite linear aggregate is a linear aggregate of finite length. The finite property of the aggregate adds several exports to the list of exports from \\spadtype{LinearAggregate} such as \\spadfun{reverse},{} \\spadfun{sort},{} and so on.")) (|sort!| (($ $) "\\spad{sort!(u)} returns \\spad{u} with its elements in ascending order.") (($ (|Mapping| (|Boolean|) |#2| |#2|) $) "\\spad{sort!(p,{}u)} returns \\spad{u} with its elements ordered by \\spad{p}.")) (|reverse!| (($ $) "\\spad{reverse!(u)} returns \\spad{u} with its elements in reverse order.")) (|copyInto!| (($ $ $ (|Integer|)) "\\spad{copyInto!(u,{}v,{}i)} returns aggregate \\spad{u} containing a copy of \\spad{v} inserted at element \\spad{i}.")) (|position| (((|Integer|) |#2| $ (|Integer|)) "\\spad{position(x,{}a,{}n)} returns the index \\spad{i} of the first occurrence of \\spad{x} in \\axiom{a} where \\axiom{\\spad{i} \\spad{>=} \\spad{n}},{} and \\axiom{minIndex(a) - 1} if no such \\spad{x} is found.") (((|Integer|) |#2| $) "\\spad{position(x,{}a)} returns the index \\spad{i} of the first occurrence of \\spad{x} in a,{} and \\axiom{minIndex(a) - 1} if there is no such \\spad{x}.") (((|Integer|) (|Mapping| (|Boolean|) |#2|) $) "\\spad{position(p,{}a)} returns the index \\spad{i} of the first \\spad{x} in \\axiom{a} such that \\axiom{\\spad{p}(\\spad{x})} is \\spad{true},{} and \\axiom{minIndex(a) - 1} if there is no such \\spad{x}.")) (|sorted?| (((|Boolean|) $) "\\spad{sorted?(u)} tests if the elements of \\spad{u} are in ascending order.") (((|Boolean|) (|Mapping| (|Boolean|) |#2| |#2|) $) "\\spad{sorted?(p,{}a)} tests if \\axiom{a} is sorted according to predicate \\spad{p}.")) (|sort| (($ $) "\\spad{sort(u)} returns an \\spad{u} with elements in ascending order. Note: \\axiom{sort(\\spad{u}) = sort(\\spad{<=},{}\\spad{u})}.") (($ (|Mapping| (|Boolean|) |#2| |#2|) $) "\\spad{sort(p,{}a)} returns a copy of \\axiom{a} sorted using total ordering predicate \\spad{p}.")) (|reverse| (($ $) "\\spad{reverse(a)} returns a copy of \\axiom{a} with elements in reverse order.")) (|merge| (($ $ $) "\\spad{merge(u,{}v)} merges \\spad{u} and \\spad{v} in ascending order. Note: \\axiom{merge(\\spad{u},{}\\spad{v}) = merge(\\spad{<=},{}\\spad{u},{}\\spad{v})}.") (($ (|Mapping| (|Boolean|) |#2| |#2|) $ $) "\\spad{merge(p,{}a,{}b)} returns an aggregate \\spad{c} which merges \\axiom{a} and \\spad{b}. The result is produced by examining each element \\spad{x} of \\axiom{a} and \\spad{y} of \\spad{b} successively. If \\axiom{\\spad{p}(\\spad{x},{}\\spad{y})} is \\spad{true},{} then \\spad{x} is inserted into the result; otherwise \\spad{y} is inserted. If \\spad{x} is chosen,{} the next element of \\axiom{a} is examined,{} and so on. When all the elements of one aggregate are examined,{} the remaining elements of the other are appended. For example,{} \\axiom{merge(<,{}[1,{}3],{}[2,{}7,{}5])} returns \\axiom{[1,{}2,{}3,{}7,{}5]}."))) 
 NIL 
-((|HasAttribute| |#1| (QUOTE -4234)) (|HasCategory| |#2| (QUOTE (-784))) (|HasCategory| |#2| (QUOTE (-1013)))) 
+((|HasAttribute| |#1| (QUOTE -4234)) (|HasCategory| |#2| (QUOTE (-783))) (|HasCategory| |#2| (QUOTE (-1013)))) 
 (-347 S) 
 ((|constructor| (NIL "A finite linear aggregate is a linear aggregate of finite length. The finite property of the aggregate adds several exports to the list of exports from \\spadtype{LinearAggregate} such as \\spadfun{reverse},{} \\spadfun{sort},{} and so on.")) (|sort!| (($ $) "\\spad{sort!(u)} returns \\spad{u} with its elements in ascending order.") (($ (|Mapping| (|Boolean|) |#1| |#1|) $) "\\spad{sort!(p,{}u)} returns \\spad{u} with its elements ordered by \\spad{p}.")) (|reverse!| (($ $) "\\spad{reverse!(u)} returns \\spad{u} with its elements in reverse order.")) (|copyInto!| (($ $ $ (|Integer|)) "\\spad{copyInto!(u,{}v,{}i)} returns aggregate \\spad{u} containing a copy of \\spad{v} inserted at element \\spad{i}.")) (|position| (((|Integer|) |#1| $ (|Integer|)) "\\spad{position(x,{}a,{}n)} returns the index \\spad{i} of the first occurrence of \\spad{x} in \\axiom{a} where \\axiom{\\spad{i} \\spad{>=} \\spad{n}},{} and \\axiom{minIndex(a) - 1} if no such \\spad{x} is found.") (((|Integer|) |#1| $) "\\spad{position(x,{}a)} returns the index \\spad{i} of the first occurrence of \\spad{x} in a,{} and \\axiom{minIndex(a) - 1} if there is no such \\spad{x}.") (((|Integer|) (|Mapping| (|Boolean|) |#1|) $) "\\spad{position(p,{}a)} returns the index \\spad{i} of the first \\spad{x} in \\axiom{a} such that \\axiom{\\spad{p}(\\spad{x})} is \\spad{true},{} and \\axiom{minIndex(a) - 1} if there is no such \\spad{x}.")) (|sorted?| (((|Boolean|) $) "\\spad{sorted?(u)} tests if the elements of \\spad{u} are in ascending order.") (((|Boolean|) (|Mapping| (|Boolean|) |#1| |#1|) $) "\\spad{sorted?(p,{}a)} tests if \\axiom{a} is sorted according to predicate \\spad{p}.")) (|sort| (($ $) "\\spad{sort(u)} returns an \\spad{u} with elements in ascending order. Note: \\axiom{sort(\\spad{u}) = sort(\\spad{<=},{}\\spad{u})}.") (($ (|Mapping| (|Boolean|) |#1| |#1|) $) "\\spad{sort(p,{}a)} returns a copy of \\axiom{a} sorted using total ordering predicate \\spad{p}.")) (|reverse| (($ $) "\\spad{reverse(a)} returns a copy of \\axiom{a} with elements in reverse order.")) (|merge| (($ $ $) "\\spad{merge(u,{}v)} merges \\spad{u} and \\spad{v} in ascending order. Note: \\axiom{merge(\\spad{u},{}\\spad{v}) = merge(\\spad{<=},{}\\spad{u},{}\\spad{v})}.") (($ (|Mapping| (|Boolean|) |#1| |#1|) $ $) "\\spad{merge(p,{}a,{}b)} returns an aggregate \\spad{c} which merges \\axiom{a} and \\spad{b}. The result is produced by examining each element \\spad{x} of \\axiom{a} and \\spad{y} of \\spad{b} successively. If \\axiom{\\spad{p}(\\spad{x},{}\\spad{y})} is \\spad{true},{} then \\spad{x} is inserted into the result; otherwise \\spad{y} is inserted. If \\spad{x} is chosen,{} the next element of \\axiom{a} is examined,{} and so on. When all the elements of one aggregate are examined,{} the remaining elements of the other are appended. For example,{} \\axiom{merge(<,{}[1,{}3],{}[2,{}7,{}5])} returns \\axiom{[1,{}2,{}3,{}7,{}5]}."))) 
-((-4233 . T) (-2046 . T)) 
+((-4233 . T) (-2092 . T)) 
 NIL 
 (-348 |VarSet| R) 
 ((|constructor| (NIL "The category of free Lie algebras. It is used by domains of non-commutative algebra: \\spadtype{LiePolynomial} and \\spadtype{XPBWPolynomial}. \\newline Author: Michel Petitot (petitot@lifl.\\spad{fr})")) (|eval| (($ $ (|List| |#1|) (|List| $)) "\\axiom{eval(\\spad{p},{} [\\spad{x1},{}...,{}\\spad{xn}],{} [\\spad{v1},{}...,{}\\spad{vn}])} replaces \\axiom{\\spad{xi}} by \\axiom{\\spad{vi}} in \\axiom{\\spad{p}}.") (($ $ |#1| $) "\\axiom{eval(\\spad{p},{} \\spad{x},{} \\spad{v})} replaces \\axiom{\\spad{x}} by \\axiom{\\spad{v}} in \\axiom{\\spad{p}}.")) (|varList| (((|List| |#1|) $) "\\axiom{varList(\\spad{x})} returns the list of distinct entries of \\axiom{\\spad{x}}.")) (|trunc| (($ $ (|NonNegativeInteger|)) "\\axiom{trunc(\\spad{p},{}\\spad{n})} returns the polynomial \\axiom{\\spad{p}} truncated at order \\axiom{\\spad{n}}.")) (|mirror| (($ $) "\\axiom{mirror(\\spad{x})} returns \\axiom{Sum(r_i mirror(w_i))} if \\axiom{\\spad{x}} is \\axiom{Sum(r_i w_i)}.")) (|LiePoly| (($ (|LyndonWord| |#1|)) "\\axiom{LiePoly(\\spad{l})} returns the bracketed form of \\axiom{\\spad{l}} as a Lie polynomial.")) (|rquo| (((|XRecursivePolynomial| |#1| |#2|) (|XRecursivePolynomial| |#1| |#2|) $) "\\axiom{rquo(\\spad{x},{}\\spad{y})} returns the right simplification of \\axiom{\\spad{x}} by \\axiom{\\spad{y}}.")) (|lquo| (((|XRecursivePolynomial| |#1| |#2|) (|XRecursivePolynomial| |#1| |#2|) $) "\\axiom{lquo(\\spad{x},{}\\spad{y})} returns the left simplification of \\axiom{\\spad{x}} by \\axiom{\\spad{y}}.")) (|degree| (((|NonNegativeInteger|) $) "\\axiom{degree(\\spad{x})} returns the greatest length of a word in the support of \\axiom{\\spad{x}}.")) (|coerce| (((|XRecursivePolynomial| |#1| |#2|) $) "\\axiom{coerce(\\spad{x})} returns \\axiom{\\spad{x}} as a recursive polynomial.") (((|XDistributedPolynomial| |#1| |#2|) $) "\\axiom{coerce(\\spad{x})} returns \\axiom{\\spad{x}} as distributed polynomial.") (($ |#1|) "\\axiom{coerce(\\spad{x})} returns \\axiom{\\spad{x}} as a Lie polynomial.")) (|coef| ((|#2| (|XRecursivePolynomial| |#1| |#2|) $) "\\axiom{coef(\\spad{x},{}\\spad{y})} returns the scalar product of \\axiom{\\spad{x}} by \\axiom{\\spad{y}},{} the set of words being regarded as an orthogonal basis."))) 
@@ -1342,7 +1342,7 @@ NIL
 NIL 
 (-353) 
 ((|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}.")) (|convert| (($ (|DoubleFloat|)) "\\spad{convert(x)} converts a \\spadtype{DoubleFloat} \\spad{x} to a \\spadtype{Float}.")) (|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}."))) 
-((-4216 . T) (-4224 . T) (-3894 . T) (-4225 . T) (-4231 . T) (-4226 . T) ((-4235 "*") . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
+((-4216 . T) (-4224 . T) (-3893 . T) (-4225 . T) (-4231 . T) (-4226 . T) ((-4235 "*") . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
 NIL 
 (-354 |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}."))) 
@@ -1358,11 +1358,11 @@ NIL
 NIL 
 (-357) 
 ((|constructor| (NIL "\\axiomType{FortranMatrixCategory} provides support for producing Functions and Subroutines when the input to these is an AXIOM object of type \\axiomType{Matrix} or in domains involving \\axiomType{FortranCode}.")) (|coerce| (($ (|Record| (|:| |localSymbols| (|SymbolTable|)) (|:| |code| (|List| (|FortranCode|))))) "\\spad{coerce(e)} takes the component of \\spad{e} from \\spadtype{List FortranCode} and uses it as the body of the ASP,{} making the declarations in the \\spadtype{SymbolTable} component.") (($ (|FortranCode|)) "\\spad{coerce(e)} takes an object from \\spadtype{FortranCode} and \\indented{1}{uses it as the body of an ASP.}") (($ (|List| (|FortranCode|))) "\\spad{coerce(e)} takes an object from \\spadtype{List FortranCode} and \\indented{1}{uses it as the body of an ASP.}") (($ (|Matrix| (|MachineFloat|))) "\\spad{coerce(v)} produces an ASP which returns the value of \\spad{v}."))) 
-((-2046 . T)) 
+((-2092 . T)) 
 NIL 
 (-358) 
 ((|constructor| (NIL "\\axiomType{FortranMatrixFunctionCategory} provides support for producing Functions and Subroutines representing matrices of expressions.")) (|retractIfCan| (((|Union| $ "failed") (|Matrix| (|Fraction| (|Polynomial| (|Integer|))))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (((|Union| $ "failed") (|Matrix| (|Fraction| (|Polynomial| (|Float|))))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (((|Union| $ "failed") (|Matrix| (|Polynomial| (|Integer|)))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (((|Union| $ "failed") (|Matrix| (|Polynomial| (|Float|)))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (((|Union| $ "failed") (|Matrix| (|Expression| (|Integer|)))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (((|Union| $ "failed") (|Matrix| (|Expression| (|Float|)))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}")) (|retract| (($ (|Matrix| (|Fraction| (|Polynomial| (|Integer|))))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (($ (|Matrix| (|Fraction| (|Polynomial| (|Float|))))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (($ (|Matrix| (|Polynomial| (|Integer|)))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (($ (|Matrix| (|Polynomial| (|Float|)))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (($ (|Matrix| (|Expression| (|Integer|)))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (($ (|Matrix| (|Expression| (|Float|)))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}")) (|coerce| (($ (|Record| (|:| |localSymbols| (|SymbolTable|)) (|:| |code| (|List| (|FortranCode|))))) "\\spad{coerce(e)} takes the component of \\spad{e} from \\spadtype{List FortranCode} and uses it as the body of the ASP,{} making the declarations in the \\spadtype{SymbolTable} component.") (($ (|FortranCode|)) "\\spad{coerce(e)} takes an object from \\spadtype{FortranCode} and \\indented{1}{uses it as the body of an ASP.}") (($ (|List| (|FortranCode|))) "\\spad{coerce(e)} takes an object from \\spadtype{List FortranCode} and \\indented{1}{uses it as the body of an ASP.}"))) 
-((-2046 . T)) 
+((-2092 . T)) 
 NIL 
 (-359 R S) 
 ((|constructor| (NIL "A \\spad{bi}-module is a free module over a ring with generators indexed by an ordered set. Each element can be expressed as a finite linear combination of generators. Only non-zero terms are stored."))) 
@@ -1371,7 +1371,7 @@ NIL
 (-360 S) 
 ((|constructor| (NIL "The free monoid on a set \\spad{S} is the monoid of finite products of the form \\spad{reduce(*,{}[\\spad{si} ** \\spad{ni}])} where the \\spad{si}\\spad{'s} are in \\spad{S},{} and the \\spad{ni}\\spad{'s} are nonnegative integers. The multiplication is not commutative.")) (|mapGen| (($ (|Mapping| |#1| |#1|) $) "\\spad{mapGen(f,{} a1\\^e1 ... an\\^en)} returns \\spad{f(a1)\\^e1 ... f(an)\\^en}.")) (|mapExpon| (($ (|Mapping| (|NonNegativeInteger|) (|NonNegativeInteger|)) $) "\\spad{mapExpon(f,{} a1\\^e1 ... an\\^en)} returns \\spad{a1\\^f(e1) ... an\\^f(en)}.")) (|nthFactor| ((|#1| $ (|Integer|)) "\\spad{nthFactor(x,{} n)} returns the factor of the n^th monomial of \\spad{x}.")) (|nthExpon| (((|NonNegativeInteger|) $ (|Integer|)) "\\spad{nthExpon(x,{} n)} returns the exponent of the n^th monomial of \\spad{x}.")) (|factors| (((|List| (|Record| (|:| |gen| |#1|) (|:| |exp| (|NonNegativeInteger|)))) $) "\\spad{factors(a1\\^e1,{}...,{}an\\^en)} returns \\spad{[[a1,{} e1],{}...,{}[an,{} en]]}.")) (|size| (((|NonNegativeInteger|) $) "\\spad{size(x)} returns the number of monomials in \\spad{x}.")) (|overlap| (((|Record| (|:| |lm| $) (|:| |mm| $) (|:| |rm| $)) $ $) "\\spad{overlap(x,{} y)} returns \\spad{[l,{} m,{} r]} such that \\spad{x = l * m},{} \\spad{y = m * r} and \\spad{l} and \\spad{r} have no overlap,{} \\spadignore{i.e.} \\spad{overlap(l,{} r) = [l,{} 1,{} r]}.")) (|divide| (((|Union| (|Record| (|:| |lm| $) (|:| |rm| $)) "failed") $ $) "\\spad{divide(x,{} y)} returns the left and right exact quotients of \\spad{x} by \\spad{y},{} \\spadignore{i.e.} \\spad{[l,{} r]} such that \\spad{x = l * y * r},{} \"failed\" if \\spad{x} is not of the form \\spad{l * y * r}.")) (|rquo| (((|Union| $ "failed") $ $) "\\spad{rquo(x,{} y)} returns the exact right quotient of \\spad{x} by \\spad{y} \\spadignore{i.e.} \\spad{q} such that \\spad{x = q * y},{} \"failed\" if \\spad{x} is not of the form \\spad{q * y}.")) (|lquo| (((|Union| $ "failed") $ $) "\\spad{lquo(x,{} y)} returns the exact left quotient of \\spad{x} by \\spad{y} \\spadignore{i.e.} \\spad{q} such that \\spad{x = y * q},{} \"failed\" if \\spad{x} is not of the form \\spad{y * q}.")) (|hcrf| (($ $ $) "\\spad{hcrf(x,{} y)} returns the highest common right factor of \\spad{x} and \\spad{y},{} \\spadignore{i.e.} the largest \\spad{d} such that \\spad{x = a d} and \\spad{y = b d}.")) (|hclf| (($ $ $) "\\spad{hclf(x,{} y)} returns the highest common left factor of \\spad{x} and \\spad{y},{} \\spadignore{i.e.} the largest \\spad{d} such that \\spad{x = d a} and \\spad{y = d b}.")) (** (($ |#1| (|NonNegativeInteger|)) "\\spad{s ** n} returns the product of \\spad{s} by itself \\spad{n} times.")) (* (($ $ |#1|) "\\spad{x * s} returns the product of \\spad{x} by \\spad{s} on the right.") (($ |#1| $) "\\spad{s * x} returns the product of \\spad{x} by \\spad{s} on the left."))) 
 NIL 
-((|HasCategory| |#1| (QUOTE (-784)))) 
+((|HasCategory| |#1| (QUOTE (-783)))) 
 (-361) 
 ((|constructor| (NIL "A category of domains which model machine arithmetic used by machines in the AXIOM-NAG link."))) 
 ((-4226 . T) ((-4235 "*") . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
@@ -1406,17 +1406,17 @@ NIL
 NIL 
 (-369) 
 ((|constructor| (NIL "\\axiomType{FortranProgramCategory} provides various models of FORTRAN subprograms. These can be transformed into actual FORTRAN code.")) (|outputAsFortran| (((|Void|) $) "\\axiom{outputAsFortran(\\spad{u})} translates \\axiom{\\spad{u}} into a legal FORTRAN subprogram."))) 
-((-2046 . T)) 
+((-2092 . T)) 
 NIL 
 (-370) 
 ((|constructor| (NIL "\\axiomType{FortranFunctionCategory} is the category of arguments to NAG Library routines which return (sets of) function values.")) (|retractIfCan| (((|Union| $ "failed") (|Fraction| (|Polynomial| (|Integer|)))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (((|Union| $ "failed") (|Fraction| (|Polynomial| (|Float|)))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (((|Union| $ "failed") (|Polynomial| (|Integer|))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (((|Union| $ "failed") (|Polynomial| (|Float|))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (((|Union| $ "failed") (|Expression| (|Integer|))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (((|Union| $ "failed") (|Expression| (|Float|))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}")) (|retract| (($ (|Fraction| (|Polynomial| (|Integer|)))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (($ (|Fraction| (|Polynomial| (|Float|)))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (($ (|Polynomial| (|Integer|))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (($ (|Polynomial| (|Float|))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (($ (|Expression| (|Integer|))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (($ (|Expression| (|Float|))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}")) (|coerce| (($ (|Record| (|:| |localSymbols| (|SymbolTable|)) (|:| |code| (|List| (|FortranCode|))))) "\\spad{coerce(e)} takes the component of \\spad{e} from \\spadtype{List FortranCode} and uses it as the body of the ASP,{} making the declarations in the \\spadtype{SymbolTable} component.") (($ (|FortranCode|)) "\\spad{coerce(e)} takes an object from \\spadtype{FortranCode} and \\indented{1}{uses it as the body of an ASP.}") (($ (|List| (|FortranCode|))) "\\spad{coerce(e)} takes an object from \\spadtype{List FortranCode} and \\indented{1}{uses it as the body of an ASP.}"))) 
-((-2046 . T)) 
+((-2092 . T)) 
 NIL 
 (-371) 
 ((|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 
-(-372 -2884 |returnType| -3885 |symbols|) 
+(-372 -2890 |returnType| -3886 |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 
@@ -1426,7 +1426,7 @@ NIL
 NIL 
 (-374 R) 
 ((|constructor| (NIL "A set \\spad{S} is PatternMatchable over \\spad{R} if \\spad{S} can lift the pattern-matching functions of \\spad{S} over the integers and float to itself (necessary for matching in towers)."))) 
-((-2046 . T)) 
+((-2092 . T)) 
 NIL 
 (-375 S) 
 ((|constructor| (NIL "FieldOfPrimeCharacteristic is the category of fields of prime characteristic,{} \\spadignore{e.g.} finite fields,{} algebraic closures of fields of prime characteristic,{} transcendental extensions of of fields of prime characteristic.")) (|primeFrobenius| (($ $ (|NonNegativeInteger|)) "\\spad{primeFrobenius(a,{}s)} returns \\spad{a**(p**s)} where \\spad{p} is the characteristic.") (($ $) "\\spad{primeFrobenius(a)} returns \\spad{a ** p} where \\spad{p} is the characteristic.")) (|discreteLog| (((|Union| (|NonNegativeInteger|) "failed") $ $) "\\spad{discreteLog(b,{}a)} computes \\spad{s} with \\spad{b**s = a} if such an \\spad{s} exists.")) (|order| (((|OnePointCompletion| (|PositiveInteger|)) $) "\\spad{order(a)} computes the order of an element in the multiplicative group of the field. Error: if \\spad{a} is 0."))) 
@@ -1442,7 +1442,7 @@ NIL
 ((|HasAttribute| |#1| (QUOTE -4216)) (|HasAttribute| |#1| (QUOTE -4224))) 
 (-378) 
 ((|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\"."))) 
-((-3894 . T) (-4225 . T) (-4231 . T) (-4226 . T) ((-4235 "*") . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
+((-3893 . T) (-4225 . T) (-4231 . T) (-4226 . T) ((-4235 "*") . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
 NIL 
 (-379 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."))) 
@@ -1455,7 +1455,7 @@ NIL
 (-381 S) 
 ((|constructor| (NIL "Fraction takes an IntegralDomain \\spad{S} and produces the domain of Fractions with numerators and denominators from \\spad{S}. If \\spad{S} is also a GcdDomain,{} then \\spad{gcd}\\spad{'s} between numerator and denominator will be cancelled during all operations.")) (|canonical| ((|attribute|) "\\spad{canonical} means that equal elements are in fact identical."))) 
 ((-4220 -12 (|has| |#1| (-6 -4231)) (|has| |#1| (-425)) (|has| |#1| (-6 -4220))) (-4225 . T) (-4231 . T) (-4226 . T) ((-4235 "*") . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
-((|HasCategory| |#1| (QUOTE (-838))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-1084)))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-946))) (|HasCategory| |#1| (QUOTE (-757))) (|HasCategory| |#1| (QUOTE (-1060))) (|HasCategory| |#1| (LIST (QUOTE -815) (QUOTE (-353)))) (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-353))))) (|HasCategory| |#1| (QUOTE (-210))) (|HasCategory| |#1| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#1| (LIST (QUOTE -482) (QUOTE (-1084)) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -261) (|devaluate| |#1|) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-282))) (|HasCategory| |#1| (QUOTE (-506))) (-12 (|HasCategory| |#1| (QUOTE (-506))) (|HasCategory| |#1| (QUOTE (-765)))) (-12 (|HasAttribute| |#1| (QUOTE -4231)) (|HasAttribute| |#1| (QUOTE -4220)) (|HasCategory| |#1| (QUOTE (-425)))) (|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-506))) (|HasCategory| |#1| (QUOTE (-765)))) (|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497))))) (|HasCategory| |#1| (QUOTE (-784))) (-3703 (|HasCategory| |#1| (QUOTE (-757))) (|HasCategory| |#1| (QUOTE (-784)))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-506))) (|HasCategory| |#1| (QUOTE (-765)))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -815) (QUOTE (-521)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-506))) (|HasCategory| |#1| (QUOTE (-765)))) (|HasCategory| |#1| (LIST (QUOTE -815) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521))))) (-3703 (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521))))) (-12 (|HasCategory| |#1| (QUOTE (-506))) (|HasCategory| |#1| (QUOTE (-765))))) (|HasCategory| |#1| (LIST (QUOTE -583) (QUOTE (-521)))) (-3703 (|HasCategory| |#1| (LIST (QUOTE -583) (QUOTE (-521)))) (-12 (|HasCategory| |#1| (QUOTE (-506))) (|HasCategory| |#1| (QUOTE (-765))))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-838)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-838)))) (|HasCategory| |#1| (QUOTE (-133))))) 
+((|HasCategory| |#1| (QUOTE (-837))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-1084)))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-946))) (|HasCategory| |#1| (QUOTE (-756))) (|HasCategory| |#1| (QUOTE (-1060))) (|HasCategory| |#1| (LIST (QUOTE -814) (QUOTE (-353)))) (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-353))))) (|HasCategory| |#1| (QUOTE (-210))) (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#1| (LIST (QUOTE -482) (QUOTE (-1084)) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -261) (|devaluate| |#1|) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-282))) (|HasCategory| |#1| (QUOTE (-506))) (-12 (|HasCategory| |#1| (QUOTE (-506))) (|HasCategory| |#1| (QUOTE (-764)))) (-12 (|HasAttribute| |#1| (QUOTE -4231)) (|HasAttribute| |#1| (QUOTE -4220)) (|HasCategory| |#1| (QUOTE (-425)))) (|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-506))) (|HasCategory| |#1| (QUOTE (-764)))) (|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497))))) (|HasCategory| |#1| (QUOTE (-783))) (-3703 (|HasCategory| |#1| (QUOTE (-756))) (|HasCategory| |#1| (QUOTE (-783)))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-506))) (|HasCategory| |#1| (QUOTE (-764)))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -814) (QUOTE (-521)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-506))) (|HasCategory| |#1| (QUOTE (-764)))) (|HasCategory| |#1| (LIST (QUOTE -814) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521))))) (-3703 (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521))))) (-12 (|HasCategory| |#1| (QUOTE (-506))) (|HasCategory| |#1| (QUOTE (-764))))) (|HasCategory| |#1| (LIST (QUOTE -583) (QUOTE (-521)))) (-3703 (|HasCategory| |#1| (LIST (QUOTE -583) (QUOTE (-521)))) (-12 (|HasCategory| |#1| (QUOTE (-506))) (|HasCategory| |#1| (QUOTE (-764))))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-837)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-837)))) (|HasCategory| |#1| (QUOTE (-133))))) 
 (-382 S R UP) 
 ((|constructor| (NIL "A \\spadtype{FramedAlgebra} is a \\spadtype{FiniteRankAlgebra} together with a fixed \\spad{R}-module basis.")) (|regularRepresentation| (((|Matrix| |#2|) $) "\\spad{regularRepresentation(a)} returns the matrix of the linear map defined by left multiplication by \\spad{a} with respect to the fixed basis.")) (|discriminant| ((|#2|) "\\spad{discriminant()} = determinant(traceMatrix()).")) (|traceMatrix| (((|Matrix| |#2|)) "\\spad{traceMatrix()} is the \\spad{n}-by-\\spad{n} matrix ( \\spad{Tr(\\spad{vi} * vj)} ),{} where \\spad{v1},{} ...,{} \\spad{vn} are the elements of the fixed basis.")) (|convert| (($ (|Vector| |#2|)) "\\spad{convert([a1,{}..,{}an])} returns \\spad{a1*v1 + ... + an*vn},{} where \\spad{v1},{} ...,{} \\spad{vn} are the elements of the fixed basis.") (((|Vector| |#2|) $) "\\spad{convert(a)} returns the coordinates of \\spad{a} with respect to the fixed \\spad{R}-module basis.")) (|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{R}-module basis.")) (|basis| (((|Vector| $)) "\\spad{basis()} returns the fixed \\spad{R}-module basis."))) 
 NIL 
@@ -1499,7 +1499,7 @@ NIL
 (-392 R) 
 ((|constructor| (NIL "\\spadtype{Factored} creates a domain whose objects are kept in factored form as long as possible. Thus certain operations like multiplication and \\spad{gcd} are relatively easy to do. Others,{} like addition require somewhat more work,{} and unless the argument domain provides a factor function,{} the result may not be completely factored. Each object consists of a unit and a list of factors,{} where a factor has a member of \\spad{R} (the \"base\"),{} and exponent and a flag indicating what is known about the base. A flag may be one of \"nil\",{} \"sqfr\",{} \"irred\" or \"prime\",{} which respectively mean that nothing is known about the base,{} it is square-free,{} it is irreducible,{} or it is prime. The current restriction to integral domains allows simplification to be performed without worrying about multiplication order.")) (|rationalIfCan| (((|Union| (|Fraction| (|Integer|)) "failed") $) "\\spad{rationalIfCan(u)} returns a rational number if \\spad{u} really is one,{} and \"failed\" otherwise.")) (|rational| (((|Fraction| (|Integer|)) $) "\\spad{rational(u)} assumes spadvar{\\spad{u}} is actually a rational number and does the conversion to rational number (see \\spadtype{Fraction Integer}).")) (|rational?| (((|Boolean|) $) "\\spad{rational?(u)} tests if \\spadvar{\\spad{u}} is actually a rational number (see \\spadtype{Fraction Integer}).")) (|map| (($ (|Mapping| |#1| |#1|) $) "\\spad{map(fn,{}u)} maps the function \\userfun{\\spad{fn}} across the factors of \\spadvar{\\spad{u}} and creates a new factored object. Note: this clears the information flags (sets them to \"nil\") because the effect of \\userfun{\\spad{fn}} is clearly not known in general.")) (|unitNormalize| (($ $) "\\spad{unitNormalize(u)} normalizes the unit part of the factorization. For example,{} when working with factored integers,{} this operation will ensure that the bases are all positive integers.")) (|unit| ((|#1| $) "\\spad{unit(u)} extracts the unit part of the factorization.")) (|flagFactor| (($ |#1| (|Integer|) (|Union| "nil" "sqfr" "irred" "prime")) "\\spad{flagFactor(base,{}exponent,{}flag)} creates a factored object with a single factor whose \\spad{base} is asserted to be properly described by the information \\spad{flag}.")) (|sqfrFactor| (($ |#1| (|Integer|)) "\\spad{sqfrFactor(base,{}exponent)} creates a factored object with a single factor whose \\spad{base} is asserted to be square-free (flag = \"sqfr\").")) (|primeFactor| (($ |#1| (|Integer|)) "\\spad{primeFactor(base,{}exponent)} creates a factored object with a single factor whose \\spad{base} is asserted to be prime (flag = \"prime\").")) (|numberOfFactors| (((|NonNegativeInteger|) $) "\\spad{numberOfFactors(u)} returns the number of factors in \\spadvar{\\spad{u}}.")) (|nthFlag| (((|Union| "nil" "sqfr" "irred" "prime") $ (|Integer|)) "\\spad{nthFlag(u,{}n)} returns the information flag of the \\spad{n}th factor of \\spadvar{\\spad{u}}. If \\spadvar{\\spad{n}} is not a valid index for a factor (for example,{} less than 1 or too big),{} \"nil\" is returned.")) (|nthFactor| ((|#1| $ (|Integer|)) "\\spad{nthFactor(u,{}n)} returns the base of the \\spad{n}th factor of \\spadvar{\\spad{u}}. If \\spadvar{\\spad{n}} is not a valid index for a factor (for example,{} less than 1 or too big),{} 1 is returned. If \\spadvar{\\spad{u}} consists only of a unit,{} the unit is returned.")) (|nthExponent| (((|Integer|) $ (|Integer|)) "\\spad{nthExponent(u,{}n)} returns the exponent of the \\spad{n}th factor of \\spadvar{\\spad{u}}. If \\spadvar{\\spad{n}} is not a valid index for a factor (for example,{} less than 1 or too big),{} 0 is returned.")) (|irreducibleFactor| (($ |#1| (|Integer|)) "\\spad{irreducibleFactor(base,{}exponent)} creates a factored object with a single factor whose \\spad{base} is asserted to be irreducible (flag = \"irred\").")) (|factors| (((|List| (|Record| (|:| |factor| |#1|) (|:| |exponent| (|Integer|)))) $) "\\spad{factors(u)} returns a list of the factors in a form suitable for iteration. That is,{} it returns a list where each element is a record containing a base and exponent. The original object is the product of all the factors and the unit (which can be extracted by \\axiom{unit(\\spad{u})}).")) (|nilFactor| (($ |#1| (|Integer|)) "\\spad{nilFactor(base,{}exponent)} creates a factored object with a single factor with no information about the kind of \\spad{base} (flag = \"nil\").")) (|factorList| (((|List| (|Record| (|:| |flg| (|Union| "nil" "sqfr" "irred" "prime")) (|:| |fctr| |#1|) (|:| |xpnt| (|Integer|)))) $) "\\spad{factorList(u)} returns the list of factors with flags (for use by factoring code).")) (|makeFR| (($ |#1| (|List| (|Record| (|:| |flg| (|Union| "nil" "sqfr" "irred" "prime")) (|:| |fctr| |#1|) (|:| |xpnt| (|Integer|))))) "\\spad{makeFR(unit,{}listOfFactors)} creates a factored object (for use by factoring code).")) (|exponent| (((|Integer|) $) "\\spad{exponent(u)} returns the exponent of the first factor of \\spadvar{\\spad{u}},{} or 0 if the factored form consists solely of a unit.")) (|expand| ((|#1| $) "\\spad{expand(f)} multiplies the unit and factors together,{} yielding an \"unfactored\" object. Note: this is purposely not called \\spadfun{coerce} which would cause the interpreter to do this automatically."))) 
 ((-4226 . T) ((-4235 "*") . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
-((|HasCategory| |#1| (LIST (QUOTE -482) (QUOTE (-1084)) (QUOTE $))) (|HasCategory| |#1| (LIST (QUOTE -284) (QUOTE $))) (|HasCategory| |#1| (LIST (QUOTE -261) (QUOTE $) (QUOTE $))) (|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (QUOTE (-1123))) (|HasCategory| |#1| (QUOTE (-946))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (LIST (QUOTE -482) (QUOTE (-1084)) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -261) (|devaluate| |#1|) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-210))) (|HasCategory| |#1| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#1| (QUOTE (-506))) (|HasCategory| |#1| (QUOTE (-425))) (-3703 (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-1123))))) 
+((|HasCategory| |#1| (LIST (QUOTE -482) (QUOTE (-1084)) (QUOTE $))) (|HasCategory| |#1| (LIST (QUOTE -284) (QUOTE $))) (|HasCategory| |#1| (LIST (QUOTE -261) (QUOTE $) (QUOTE $))) (|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (QUOTE (-1123))) (|HasCategory| |#1| (QUOTE (-946))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (LIST (QUOTE -482) (QUOTE (-1084)) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -261) (|devaluate| |#1|) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-210))) (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#1| (QUOTE (-506))) (|HasCategory| |#1| (QUOTE (-425))) (-3703 (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-1123))))) 
 (-393 R) 
 ((|constructor| (NIL "\\spadtype{FactoredFunctionUtilities} implements some utility functions for manipulating factored objects.")) (|mergeFactors| (((|Factored| |#1|) (|Factored| |#1|) (|Factored| |#1|)) "\\spad{mergeFactors(u,{}v)} is used when the factorizations of \\spadvar{\\spad{u}} and \\spadvar{\\spad{v}} are known to be disjoint,{} \\spadignore{e.g.} resulting from a content/primitive part split. Essentially,{} it creates a new factored object by multiplying the units together and appending the lists of factors.")) (|refine| (((|Factored| |#1|) (|Factored| |#1|) (|Mapping| (|Factored| |#1|) |#1|)) "\\spad{refine(u,{}fn)} is used to apply the function \\userfun{\\spad{fn}} to each factor of \\spadvar{\\spad{u}} and then build a new factored object from the results. For example,{} if \\spadvar{\\spad{u}} were created by calling \\spad{nilFactor(10,{}2)} then \\spad{refine(u,{}factor)} would create a factored object equal to that created by \\spad{factor(100)} or \\spad{primeFactor(2,{}2) * primeFactor(5,{}2)}."))) 
 NIL 
@@ -1523,10 +1523,10 @@ NIL
 (-398 A S) 
 ((|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| ((|#2| $) "\\spad{min(u)} returns the smallest element of aggregate \\spad{u}.")) (|max| ((|#2| $) "\\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}."))) 
 NIL 
-((|HasCategory| |#2| (QUOTE (-784))) (|HasCategory| |#2| (QUOTE (-342)))) 
+((|HasCategory| |#2| (QUOTE (-783))) (|HasCategory| |#2| (QUOTE (-342)))) 
 (-399 S) 
 ((|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}."))) 
-((-4233 . T) (-4223 . T) (-4234 . T) (-2046 . T)) 
+((-4233 . T) (-4223 . T) (-4234 . T) (-2092 . T)) 
 NIL 
 (-400 R -4049) 
 ((|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."))) 
@@ -1546,7 +1546,7 @@ NIL
 ((|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#2| (QUOTE (-513))) (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-135))) (|HasCategory| |#2| (QUOTE (-970))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-446))) (|HasCategory| |#2| (QUOTE (-1025))) (|HasCategory| |#2| (LIST (QUOTE -562) (QUOTE (-497))))) 
 (-404 R) 
 ((|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}."))) 
-((-4230 -3703 (|has| |#1| (-970)) (|has| |#1| (-446))) (-4228 |has| |#1| (-157)) (-4227 |has| |#1| (-157)) ((-4235 "*") |has| |#1| (-513)) (-4226 |has| |#1| (-513)) (-4231 |has| |#1| (-513)) (-4225 |has| |#1| (-513)) (-2046 . T)) 
+((-4230 -3703 (|has| |#1| (-970)) (|has| |#1| (-446))) (-4228 |has| |#1| (-157)) (-4227 |has| |#1| (-157)) ((-4235 "*") |has| |#1| (-513)) (-4226 |has| |#1| (-513)) (-4231 |has| |#1| (-513)) (-4225 |has| |#1| (-513)) (-2092 . T)) 
 NIL 
 (-405 R -4049) 
 ((|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."))) 
@@ -1582,11 +1582,11 @@ NIL
 NIL 
 (-413) 
 ((|constructor| (NIL "\\axiomType{FortranVectorCategory} provides support for producing Functions and Subroutines when the input to these is an AXIOM object of type \\axiomType{Vector} or in domains involving \\axiomType{FortranCode}.")) (|coerce| (($ (|Record| (|:| |localSymbols| (|SymbolTable|)) (|:| |code| (|List| (|FortranCode|))))) "\\spad{coerce(e)} takes the component of \\spad{e} from \\spadtype{List FortranCode} and uses it as the body of the ASP,{} making the declarations in the \\spadtype{SymbolTable} component.") (($ (|FortranCode|)) "\\spad{coerce(e)} takes an object from \\spadtype{FortranCode} and \\indented{1}{uses it as the body of an ASP.}") (($ (|List| (|FortranCode|))) "\\spad{coerce(e)} takes an object from \\spadtype{List FortranCode} and \\indented{1}{uses it as the body of an ASP.}") (($ (|Vector| (|MachineFloat|))) "\\spad{coerce(v)} produces an ASP which returns the value of \\spad{v}."))) 
-((-2046 . T)) 
+((-2092 . T)) 
 NIL 
 (-414) 
 ((|constructor| (NIL "\\axiomType{FortranVectorFunctionCategory} is the catagory of arguments to NAG Library routines which return the values of vectors of functions.")) (|retractIfCan| (((|Union| $ "failed") (|Vector| (|Fraction| (|Polynomial| (|Integer|))))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (((|Union| $ "failed") (|Vector| (|Fraction| (|Polynomial| (|Float|))))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (((|Union| $ "failed") (|Vector| (|Polynomial| (|Integer|)))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (((|Union| $ "failed") (|Vector| (|Polynomial| (|Float|)))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (((|Union| $ "failed") (|Vector| (|Expression| (|Integer|)))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (((|Union| $ "failed") (|Vector| (|Expression| (|Float|)))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}")) (|retract| (($ (|Vector| (|Fraction| (|Polynomial| (|Integer|))))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (($ (|Vector| (|Fraction| (|Polynomial| (|Float|))))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (($ (|Vector| (|Polynomial| (|Integer|)))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (($ (|Vector| (|Polynomial| (|Float|)))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (($ (|Vector| (|Expression| (|Integer|)))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (($ (|Vector| (|Expression| (|Float|)))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}")) (|coerce| (($ (|Record| (|:| |localSymbols| (|SymbolTable|)) (|:| |code| (|List| (|FortranCode|))))) "\\spad{coerce(e)} takes the component of \\spad{e} from \\spadtype{List FortranCode} and uses it as the body of the ASP,{} making the declarations in the \\spadtype{SymbolTable} component.") (($ (|FortranCode|)) "\\spad{coerce(e)} takes an object from \\spadtype{FortranCode} and \\indented{1}{uses it as the body of an ASP.}") (($ (|List| (|FortranCode|))) "\\spad{coerce(e)} takes an object from \\spadtype{List FortranCode} and \\indented{1}{uses it as the body of an ASP.}"))) 
-((-2046 . T)) 
+((-2092 . T)) 
 NIL 
 (-415 UP) 
 ((|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."))) 
@@ -1634,12 +1634,12 @@ NIL
 NIL 
 (-426 R |n| |ls| |gamma|) 
 ((|constructor| (NIL "AlgebraGenericElementPackage allows you to create generic elements of an algebra,{} \\spadignore{i.e.} the scalars are extended to include symbolic coefficients")) (|conditionsForIdempotents| (((|List| (|Polynomial| |#1|))) "\\spad{conditionsForIdempotents()} determines a complete list of polynomial equations for the coefficients of idempotents with respect to the fixed \\spad{R}-module basis") (((|List| (|Polynomial| |#1|)) (|Vector| $)) "\\spad{conditionsForIdempotents([v1,{}...,{}vn])} determines a complete list of polynomial equations for the coefficients of idempotents with respect to the \\spad{R}-module basis \\spad{v1},{}...,{}\\spad{vn}")) (|genericRightDiscriminant| (((|Fraction| (|Polynomial| |#1|))) "\\spad{genericRightDiscriminant()} is the determinant of the generic left trace forms of all products of basis element,{} if the generic left trace form is associative,{} an algebra is separable if the generic left discriminant is invertible,{} if it is non-zero,{} there is some ring extension which makes the algebra separable")) (|genericRightTraceForm| (((|Fraction| (|Polynomial| |#1|)) $ $) "\\spad{genericRightTraceForm (a,{}b)} is defined to be \\spadfun{genericRightTrace (a*b)},{} this defines a symmetric bilinear form on the algebra")) (|genericLeftDiscriminant| (((|Fraction| (|Polynomial| |#1|))) "\\spad{genericLeftDiscriminant()} is the determinant of the generic left trace forms of all products of basis element,{} if the generic left trace form is associative,{} an algebra is separable if the generic left discriminant is invertible,{} if it is non-zero,{} there is some ring extension which makes the algebra separable")) (|genericLeftTraceForm| (((|Fraction| (|Polynomial| |#1|)) $ $) "\\spad{genericLeftTraceForm (a,{}b)} is defined to be \\spad{genericLeftTrace (a*b)},{} this defines a symmetric bilinear form on the algebra")) (|genericRightNorm| (((|Fraction| (|Polynomial| |#1|)) $) "\\spad{genericRightNorm(a)} substitutes the coefficients of \\spad{a} for the generic coefficients into the coefficient of the constant term in \\spadfun{rightRankPolynomial} and changes the sign if the degree of this polynomial is odd")) (|genericRightTrace| (((|Fraction| (|Polynomial| |#1|)) $) "\\spad{genericRightTrace(a)} substitutes the coefficients of \\spad{a} for the generic coefficients into the coefficient of the second highest term in \\spadfun{rightRankPolynomial} and changes the sign")) (|genericRightMinimalPolynomial| (((|SparseUnivariatePolynomial| (|Fraction| (|Polynomial| |#1|))) $) "\\spad{genericRightMinimalPolynomial(a)} substitutes the coefficients of \\spad{a} for the generic coefficients in \\spadfun{rightRankPolynomial}")) (|rightRankPolynomial| (((|SparseUnivariatePolynomial| (|Fraction| (|Polynomial| |#1|)))) "\\spad{rightRankPolynomial()} returns the right minimimal polynomial of the generic element")) (|genericLeftNorm| (((|Fraction| (|Polynomial| |#1|)) $) "\\spad{genericLeftNorm(a)} substitutes the coefficients of \\spad{a} for the generic coefficients into the coefficient of the constant term in \\spadfun{leftRankPolynomial} and changes the sign if the degree of this polynomial is odd. This is a form of degree \\spad{k}")) (|genericLeftTrace| (((|Fraction| (|Polynomial| |#1|)) $) "\\spad{genericLeftTrace(a)} substitutes the coefficients of \\spad{a} for the generic coefficients into the coefficient of the second highest term in \\spadfun{leftRankPolynomial} and changes the sign. \\indented{1}{This is a linear form}")) (|genericLeftMinimalPolynomial| (((|SparseUnivariatePolynomial| (|Fraction| (|Polynomial| |#1|))) $) "\\spad{genericLeftMinimalPolynomial(a)} substitutes the coefficients of {em a} for the generic coefficients in \\spad{leftRankPolynomial()}")) (|leftRankPolynomial| (((|SparseUnivariatePolynomial| (|Fraction| (|Polynomial| |#1|)))) "\\spad{leftRankPolynomial()} returns the left minimimal polynomial of the generic element")) (|generic| (($ (|Vector| (|Symbol|)) (|Vector| $)) "\\spad{generic(vs,{}ve)} returns a generic element,{} \\spadignore{i.e.} the linear combination of \\spad{ve} with the symbolic coefficients \\spad{vs} error,{} if the vector of symbols is shorter than the vector of elements") (($ (|Symbol|) (|Vector| $)) "\\spad{generic(s,{}v)} returns a generic element,{} \\spadignore{i.e.} the linear combination of \\spad{v} with the symbolic coefficients \\spad{s1,{}s2,{}..}") (($ (|Vector| $)) "\\spad{generic(ve)} returns a generic element,{} \\spadignore{i.e.} the linear combination of \\spad{ve} basis with the symbolic coefficients \\spad{\\%x1,{}\\%x2,{}..}") (($ (|Vector| (|Symbol|))) "\\spad{generic(vs)} returns a generic element,{} \\spadignore{i.e.} the linear combination of the fixed basis with the symbolic coefficients \\spad{vs}; error,{} if the vector of symbols is too short") (($ (|Symbol|)) "\\spad{generic(s)} returns a generic element,{} \\spadignore{i.e.} the linear combination of the fixed basis with the symbolic coefficients \\spad{s1,{}s2,{}..}") (($) "\\spad{generic()} returns a generic element,{} \\spadignore{i.e.} the linear combination of the fixed basis with the symbolic coefficients \\spad{\\%x1,{}\\%x2,{}..}")) (|rightUnits| (((|Union| (|Record| (|:| |particular| $) (|:| |basis| (|List| $))) "failed")) "\\spad{rightUnits()} returns the affine space of all right units of the algebra,{} or \\spad{\"failed\"} if there is none")) (|leftUnits| (((|Union| (|Record| (|:| |particular| $) (|:| |basis| (|List| $))) "failed")) "\\spad{leftUnits()} returns the affine space of all left units of the algebra,{} or \\spad{\"failed\"} if there is none")) (|coerce| (($ (|Vector| (|Fraction| (|Polynomial| |#1|)))) "\\spad{coerce(v)} assumes that it is called with a vector of length equal to the dimension of the algebra,{} then a linear combination with the basis element is formed"))) 
-((-4230 |has| (-381 (-881 |#1|)) (-513)) (-4228 . T) (-4227 . T)) 
-((|HasCategory| (-381 (-881 |#1|)) (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| (-381 (-881 |#1|)) (QUOTE (-513)))) 
+((-4230 |has| (-381 (-880 |#1|)) (-513)) (-4228 . T) (-4227 . T)) 
+((|HasCategory| (-381 (-880 |#1|)) (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| (-381 (-880 |#1|)) (QUOTE (-513)))) 
 (-427 |vl| R E) 
 ((|constructor| (NIL "\\indented{2}{This type supports distributed multivariate polynomials} whose variables are from a user specified list of symbols. The coefficient ring may be non commutative,{} but the variables are assumed to commute. The term ordering is specified by its third parameter. Suggested types which define term orderings include: \\spadtype{DirectProduct},{} \\spadtype{HomogeneousDirectProduct},{} \\spadtype{SplitHomogeneousDirectProduct} and finally \\spadtype{OrderedDirectProduct} which accepts an arbitrary user function to define a term ordering.")) (|reorder| (($ $ (|List| (|Integer|))) "\\spad{reorder(p,{} perm)} applies the permutation perm to the variables in a polynomial and returns the new correctly ordered polynomial"))) 
 (((-4235 "*") |has| |#2| (-157)) (-4226 |has| |#2| (-513)) (-4231 |has| |#2| (-6 -4231)) (-4228 . T) (-4227 . T) (-4230 . T)) 
-((|HasCategory| |#2| (QUOTE (-838))) (|HasCategory| |#2| (QUOTE (-513))) (|HasCategory| |#2| (QUOTE (-157))) (-3703 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-513)))) (-12 (|HasCategory| (-794 |#1|) (LIST (QUOTE -815) (QUOTE (-353)))) (|HasCategory| |#2| (LIST (QUOTE -815) (QUOTE (-353))))) (-12 (|HasCategory| (-794 |#1|) (LIST (QUOTE -815) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -815) (QUOTE (-521))))) (-12 (|HasCategory| (-794 |#1|) (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-353))))) (|HasCategory| |#2| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-353)))))) (-12 (|HasCategory| (-794 |#1|) (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521)))))) (-12 (|HasCategory| (-794 |#1|) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#2| (LIST (QUOTE -562) (QUOTE (-497))))) (|HasCategory| |#2| (QUOTE (-784))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (QUOTE (-135))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-337))) (-3703 (|HasCategory| |#2| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521)))))) (|HasAttribute| |#2| (QUOTE -4231)) (|HasCategory| |#2| (QUOTE (-425))) (-3703 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-425))) (|HasCategory| |#2| (QUOTE (-513))) (|HasCategory| |#2| (QUOTE (-838)))) (-3703 (|HasCategory| |#2| (QUOTE (-425))) (|HasCategory| |#2| (QUOTE (-513))) (|HasCategory| |#2| (QUOTE (-838)))) (-3703 (|HasCategory| |#2| (QUOTE (-425))) (|HasCategory| |#2| (QUOTE (-838)))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-838)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-838)))) (|HasCategory| |#2| (QUOTE (-133))))) 
+((|HasCategory| |#2| (QUOTE (-837))) (|HasCategory| |#2| (QUOTE (-513))) (|HasCategory| |#2| (QUOTE (-157))) (-3703 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-513)))) (-12 (|HasCategory| (-793 |#1|) (LIST (QUOTE -814) (QUOTE (-353)))) (|HasCategory| |#2| (LIST (QUOTE -814) (QUOTE (-353))))) (-12 (|HasCategory| (-793 |#1|) (LIST (QUOTE -814) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -814) (QUOTE (-521))))) (-12 (|HasCategory| (-793 |#1|) (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-353))))) (|HasCategory| |#2| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-353)))))) (-12 (|HasCategory| (-793 |#1|) (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521)))))) (-12 (|HasCategory| (-793 |#1|) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#2| (LIST (QUOTE -562) (QUOTE (-497))))) (|HasCategory| |#2| (QUOTE (-783))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (QUOTE (-135))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-337))) (-3703 (|HasCategory| |#2| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521)))))) (|HasAttribute| |#2| (QUOTE -4231)) (|HasCategory| |#2| (QUOTE (-425))) (-3703 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-425))) (|HasCategory| |#2| (QUOTE (-513))) (|HasCategory| |#2| (QUOTE (-837)))) (-3703 (|HasCategory| |#2| (QUOTE (-425))) (|HasCategory| |#2| (QUOTE (-513))) (|HasCategory| |#2| (QUOTE (-837)))) (-3703 (|HasCategory| |#2| (QUOTE (-425))) (|HasCategory| |#2| (QUOTE (-837)))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-837)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-837)))) (|HasCategory| |#2| (QUOTE (-133))))) 
 (-428 R BP) 
 ((|constructor| (NIL "\\indented{1}{Author : \\spad{P}.Gianni.} January 1990 The equation \\spad{Af+Bg=h} and its generalization to \\spad{n} polynomials is solved for solutions over the \\spad{R},{} euclidean domain. A table containing the solutions of \\spad{Af+Bg=x**k} is used. The operations are performed modulus a prime which are in principle big enough,{} but the solutions are tested and,{} in case of failure,{} a hensel lifting process is used to get to the right solutions. It will be used in the factorization of multivariate polynomials over finite field,{} with \\spad{R=F[x]}.")) (|testModulus| (((|Boolean|) |#1| (|List| |#2|)) "\\spad{testModulus(p,{}lp)} returns \\spad{true} if the the prime \\spad{p} is valid for the list of polynomials \\spad{lp},{} \\spadignore{i.e.} preserves the degree and they remain relatively prime.")) (|solveid| (((|Union| (|List| |#2|) "failed") |#2| |#1| (|Vector| (|List| |#2|))) "\\spad{solveid(h,{}table)} computes the coefficients of the extended euclidean algorithm for a list of polynomials whose tablePow is \\spad{table} and with right side \\spad{h}.")) (|tablePow| (((|Union| (|Vector| (|List| |#2|)) "failed") (|NonNegativeInteger|) |#1| (|List| |#2|)) "\\spad{tablePow(maxdeg,{}prime,{}lpol)} constructs the table with the coefficients of the Extended Euclidean Algorithm for \\spad{lpol}. Here the right side is \\spad{x**k},{} for \\spad{k} less or equal to \\spad{maxdeg}. The operation returns \"failed\" when the elements are not coprime modulo \\spad{prime}.")) (|compBound| (((|NonNegativeInteger|) |#2| (|List| |#2|)) "\\spad{compBound(p,{}lp)} computes a bound for the coefficients of the solution polynomials. Given a polynomial right hand side \\spad{p},{} and a list \\spad{lp} of left hand side polynomials. Exported because it depends on the valuation.")) (|reduction| ((|#2| |#2| |#1|) "\\spad{reduction(p,{}prime)} reduces the polynomial \\spad{p} modulo \\spad{prime} of \\spad{R}. Note: this function is exported only because it\\spad{'s} conditional."))) 
 NIL 
@@ -1675,7 +1675,7 @@ NIL
 (-436 R E |VarSet| P) 
 ((|constructor| (NIL "A domain for polynomial sets.")) (|convert| (($ (|List| |#4|)) "\\axiom{convert(\\spad{lp})} returns the polynomial set whose members are the polynomials of \\axiom{\\spad{lp}}."))) 
 ((-4234 . T) (-4233 . T)) 
-((|HasCategory| |#4| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#4| (QUOTE (-1013))) (-12 (|HasCategory| |#4| (QUOTE (-1013))) (|HasCategory| |#4| (LIST (QUOTE -284) (|devaluate| |#4|)))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#4| (LIST (QUOTE -561) (QUOTE (-792))))) 
+((|HasCategory| |#4| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#4| (QUOTE (-1013))) (-12 (|HasCategory| |#4| (QUOTE (-1013))) (|HasCategory| |#4| (LIST (QUOTE -284) (|devaluate| |#4|)))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#4| (LIST (QUOTE -561) (QUOTE (-791))))) 
 (-437 S R E) 
 ((|constructor| (NIL "GradedAlgebra(\\spad{R},{}\\spad{E}) denotes ``E-graded \\spad{R}-algebra\\spad{''}. A graded algebra is a graded module together with a degree preserving \\spad{R}-linear map,{} called the {\\em product}. \\blankline The name ``product\\spad{''} is written out in full so inner and outer products with the same mapping type can be distinguished by name.")) (|product| (($ $ $) "\\spad{product(a,{}b)} is the degree-preserving \\spad{R}-linear product: \\blankline \\indented{2}{\\spad{degree product(a,{}b) = degree a + degree b}} \\indented{2}{\\spad{product(a1+a2,{}b) = product(a1,{}b) + product(a2,{}b)}} \\indented{2}{\\spad{product(a,{}b1+b2) = product(a,{}b1) + product(a,{}b2)}} \\indented{2}{\\spad{product(r*a,{}b) = product(a,{}r*b) = r*product(a,{}b)}} \\indented{2}{\\spad{product(a,{}product(b,{}c)) = product(product(a,{}b),{}c)}}")) ((|One|) (($) "1 is the identity for \\spad{product}."))) 
 NIL 
@@ -1719,15 +1719,15 @@ NIL
 (-447 |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."))) 
 (((-4235 "*") |has| |#1| (-157)) (-4226 |has| |#1| (-513)) (-4231 |has| |#1| (-337)) (-4225 |has| |#1| (-337)) (-4227 . T) (-4228 . T) (-4230 . T)) 
-((|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-157))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-513)))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -381) (QUOTE (-521))) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -381) (QUOTE (-521))) (|devaluate| |#1|))))) (|HasCategory| (-381 (-521)) (QUOTE (-1025))) (|HasCategory| |#1| (QUOTE (-337))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-513)))) (-3703 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-513)))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -381) (QUOTE (-521)))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -381) (QUOTE (-521)))))) (|HasSignature| |#1| (LIST (QUOTE -2189) (LIST (|devaluate| |#1|) (QUOTE (-1084)))))) (-3703 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-887))) (|HasCategory| |#1| (QUOTE (-1105))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasSignature| |#1| (LIST (QUOTE -2184) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1084))))) (|HasSignature| |#1| (LIST (QUOTE -4084) (LIST (LIST (QUOTE -587) (QUOTE (-1084))) (|devaluate| |#1|))))))) 
+((|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-157))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-513)))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -381) (QUOTE (-521))) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -381) (QUOTE (-521))) (|devaluate| |#1|))))) (|HasCategory| (-381 (-521)) (QUOTE (-1025))) (|HasCategory| |#1| (QUOTE (-337))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-513)))) (-3703 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-513)))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -381) (QUOTE (-521)))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -381) (QUOTE (-521)))))) (|HasSignature| |#1| (LIST (QUOTE -2223) (LIST (|devaluate| |#1|) (QUOTE (-1084)))))) (-3703 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-886))) (|HasCategory| |#1| (QUOTE (-1105))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasSignature| |#1| (LIST (QUOTE -1749) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1084))))) (|HasSignature| |#1| (LIST (QUOTE -4085) (LIST (LIST (QUOTE -587) (QUOTE (-1084))) (|devaluate| |#1|))))))) 
 (-448 |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."))) 
 ((-4234 . T)) 
-((|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-792)))) (|HasCategory| |#2| (QUOTE (-1013))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (QUOTE (-1013))) (-12 (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (QUOTE (-1013))) (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (LIST (QUOTE -284) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2529) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3045) (|devaluate| |#2|)))))) (-3703 (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (QUOTE (-1013))) (|HasCategory| |#2| (QUOTE (-1013)))) (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (LIST (QUOTE -561) (QUOTE (-792)))) (-3703 (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (QUOTE (-1013))) (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (LIST (QUOTE -561) (QUOTE (-792)))) (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-792))))) (-3703 (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (LIST (QUOTE -561) (QUOTE (-792)))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-792)))))) 
+((|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-791)))) (|HasCategory| |#2| (QUOTE (-1013))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (QUOTE (-1013))) (-12 (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (QUOTE (-1013))) (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (LIST (QUOTE -284) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2535) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3050) (|devaluate| |#2|)))))) (-3703 (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (QUOTE (-1013))) (|HasCategory| |#2| (QUOTE (-1013)))) (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (LIST (QUOTE -561) (QUOTE (-791)))) (-3703 (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (QUOTE (-1013))) (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (LIST (QUOTE -561) (QUOTE (-791)))) (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-791))))) (-3703 (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (LIST (QUOTE -561) (QUOTE (-791)))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-791)))))) 
 (-449 R E V P) 
 ((|constructor| (NIL "A domain constructor of the category \\axiomType{TriangularSetCategory}. The only requirement for a list of polynomials to be a member of such a domain is the following: no polynomial is constant and two distinct polynomials have distinct main variables. Such a triangular set may not be auto-reduced or consistent. Triangular sets are stored as sorted lists \\spad{w}.\\spad{r}.\\spad{t}. the main variables of their members but they are displayed in reverse order.\\newline References : \\indented{1}{[1] \\spad{P}. AUBRY,{} \\spad{D}. LAZARD and \\spad{M}. MORENO MAZA \"On the Theories} \\indented{5}{of Triangular Sets\" Journal of Symbol. Comp. (to appear)}"))) 
 ((-4234 . T) (-4233 . T)) 
-((|HasCategory| |#4| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#4| (QUOTE (-1013))) (-12 (|HasCategory| |#4| (QUOTE (-1013))) (|HasCategory| |#4| (LIST (QUOTE -284) (|devaluate| |#4|)))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#3| (QUOTE (-342))) (|HasCategory| |#4| (LIST (QUOTE -561) (QUOTE (-792))))) 
+((|HasCategory| |#4| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#4| (QUOTE (-1013))) (-12 (|HasCategory| |#4| (QUOTE (-1013))) (|HasCategory| |#4| (LIST (QUOTE -284) (|devaluate| |#4|)))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#3| (QUOTE (-342))) (|HasCategory| |#4| (LIST (QUOTE -561) (QUOTE (-791))))) 
 (-450) 
 ((|constructor| (NIL "\\indented{1}{Symbolic fractions in \\%\\spad{pi} with integer coefficients;} \\indented{1}{The point for using \\spad{Pi} as the default domain for those fractions} \\indented{1}{is that \\spad{Pi} is coercible to the float types,{} and not Expression.} Date Created: 21 Feb 1990 Date Last Updated: 12 Mai 1992")) (|pi| (($) "\\spad{\\spad{pi}()} returns the symbolic \\%\\spad{pi}."))) 
 ((-4225 . T) (-4231 . T) (-4226 . T) ((-4235 "*") . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
@@ -1735,7 +1735,7 @@ NIL
 (-451 |Key| |Entry| |hashfn|) 
 ((|constructor| (NIL "This domain provides access to the underlying Lisp hash tables. By varying the hashfn parameter,{} tables suited for different purposes can be obtained."))) 
 ((-4233 . T) (-4234 . T)) 
-((|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (QUOTE (-1013))) (-12 (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (QUOTE (-1013))) (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (LIST (QUOTE -284) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2529) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3045) (|devaluate| |#2|)))))) (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| |#2| (QUOTE (-1013))) (-3703 (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (QUOTE (-1013))) (|HasCategory| |#2| (QUOTE (-1013)))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-792)))) (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (LIST (QUOTE -561) (QUOTE (-792)))) (-3703 (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (QUOTE (-1013))) (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (LIST (QUOTE -561) (QUOTE (-792)))) (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-792))))) (-3703 (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (LIST (QUOTE -561) (QUOTE (-792)))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-792)))))) 
+((|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (QUOTE (-1013))) (-12 (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (QUOTE (-1013))) (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (LIST (QUOTE -284) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2535) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3050) (|devaluate| |#2|)))))) (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#2| (QUOTE (-1013))) (-3703 (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (QUOTE (-1013))) (|HasCategory| |#2| (QUOTE (-1013)))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-791)))) (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (LIST (QUOTE -561) (QUOTE (-791)))) (-3703 (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (QUOTE (-1013))) (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (LIST (QUOTE -561) (QUOTE (-791)))) (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-791))))) (-3703 (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (LIST (QUOTE -561) (QUOTE (-791)))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-791)))))) 
 (-452) 
 ((|constructor| (NIL "\\indented{1}{Author : Larry Lambe} Date Created : August 1988 Date Last Updated : March 9 1990 Related Constructors: OrderedSetInts,{} Commutator,{} FreeNilpotentLie AMS Classification: Primary 17B05,{} 17B30; Secondary 17A50 Keywords: free Lie algebra,{} Hall basis,{} basic commutators Description : Generate a basis for the free Lie algebra on \\spad{n} generators over a ring \\spad{R} with identity up to basic commutators of length \\spad{c} using the algorithm of \\spad{P}. Hall as given in Serre\\spad{'s} book Lie Groups \\spad{--} Lie Algebras")) (|generate| (((|Vector| (|List| (|Integer|))) (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{generate(numberOfGens,{} maximalWeight)} generates a vector of elements of the form [left,{}weight,{}right] which represents a \\spad{P}. Hall basis element for the free lie algebra on \\spad{numberOfGens} generators. We only generate those basis elements of weight less than or equal to maximalWeight")) (|inHallBasis?| (((|Boolean|) (|Integer|) (|Integer|) (|Integer|) (|Integer|)) "\\spad{inHallBasis?(numberOfGens,{} leftCandidate,{} rightCandidate,{} left)} tests to see if a new element should be added to the \\spad{P}. Hall basis being constructed. The list \\spad{[leftCandidate,{}wt,{}rightCandidate]} is included in the basis if in the unique factorization of \\spad{rightCandidate},{} we have left factor leftOfRight,{} and leftOfRight \\spad{<=} \\spad{leftCandidate}")) (|lfunc| (((|Integer|) (|Integer|) (|Integer|)) "\\spad{lfunc(d,{}n)} computes the rank of the \\spad{n}th factor in the lower central series of the free \\spad{d}-generated free Lie algebra; This rank is \\spad{d} if \\spad{n} = 1 and binom(\\spad{d},{}2) if \\spad{n} = 2"))) 
 NIL 
@@ -1743,15 +1743,15 @@ NIL
 (-453 |vl| R) 
 ((|constructor| (NIL "\\indented{2}{This type supports distributed multivariate polynomials} whose variables are from a user specified list of symbols. The coefficient ring may be non commutative,{} but the variables are assumed to commute. The term ordering is total degree ordering refined by reverse lexicographic ordering with respect to the position that the variables appear in the list of variables parameter.")) (|reorder| (($ $ (|List| (|Integer|))) "\\spad{reorder(p,{} perm)} applies the permutation perm to the variables in a polynomial and returns the new correctly ordered polynomial"))) 
 (((-4235 "*") |has| |#2| (-157)) (-4226 |has| |#2| (-513)) (-4231 |has| |#2| (-6 -4231)) (-4228 . T) (-4227 . T) (-4230 . T)) 
-((|HasCategory| |#2| (QUOTE (-838))) (|HasCategory| |#2| (QUOTE (-513))) (|HasCategory| |#2| (QUOTE (-157))) (-3703 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-513)))) (-12 (|HasCategory| (-794 |#1|) (LIST (QUOTE -815) (QUOTE (-353)))) (|HasCategory| |#2| (LIST (QUOTE -815) (QUOTE (-353))))) (-12 (|HasCategory| (-794 |#1|) (LIST (QUOTE -815) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -815) (QUOTE (-521))))) (-12 (|HasCategory| (-794 |#1|) (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-353))))) (|HasCategory| |#2| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-353)))))) (-12 (|HasCategory| (-794 |#1|) (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521)))))) (-12 (|HasCategory| (-794 |#1|) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#2| (LIST (QUOTE -562) (QUOTE (-497))))) (|HasCategory| |#2| (QUOTE (-784))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (QUOTE (-135))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-337))) (-3703 (|HasCategory| |#2| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521)))))) (|HasAttribute| |#2| (QUOTE -4231)) (|HasCategory| |#2| (QUOTE (-425))) (-3703 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-425))) (|HasCategory| |#2| (QUOTE (-513))) (|HasCategory| |#2| (QUOTE (-838)))) (-3703 (|HasCategory| |#2| (QUOTE (-425))) (|HasCategory| |#2| (QUOTE (-513))) (|HasCategory| |#2| (QUOTE (-838)))) (-3703 (|HasCategory| |#2| (QUOTE (-425))) (|HasCategory| |#2| (QUOTE (-838)))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-838)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-838)))) (|HasCategory| |#2| (QUOTE (-133))))) 
-(-454 -2617 S) 
+((|HasCategory| |#2| (QUOTE (-837))) (|HasCategory| |#2| (QUOTE (-513))) (|HasCategory| |#2| (QUOTE (-157))) (-3703 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-513)))) (-12 (|HasCategory| (-793 |#1|) (LIST (QUOTE -814) (QUOTE (-353)))) (|HasCategory| |#2| (LIST (QUOTE -814) (QUOTE (-353))))) (-12 (|HasCategory| (-793 |#1|) (LIST (QUOTE -814) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -814) (QUOTE (-521))))) (-12 (|HasCategory| (-793 |#1|) (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-353))))) (|HasCategory| |#2| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-353)))))) (-12 (|HasCategory| (-793 |#1|) (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521)))))) (-12 (|HasCategory| (-793 |#1|) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#2| (LIST (QUOTE -562) (QUOTE (-497))))) (|HasCategory| |#2| (QUOTE (-783))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (QUOTE (-135))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-337))) (-3703 (|HasCategory| |#2| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521)))))) (|HasAttribute| |#2| (QUOTE -4231)) (|HasCategory| |#2| (QUOTE (-425))) (-3703 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-425))) (|HasCategory| |#2| (QUOTE (-513))) (|HasCategory| |#2| (QUOTE (-837)))) (-3703 (|HasCategory| |#2| (QUOTE (-425))) (|HasCategory| |#2| (QUOTE (-513))) (|HasCategory| |#2| (QUOTE (-837)))) (-3703 (|HasCategory| |#2| (QUOTE (-425))) (|HasCategory| |#2| (QUOTE (-837)))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-837)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-837)))) (|HasCategory| |#2| (QUOTE (-133))))) 
+(-454 -2623 S) 
 ((|constructor| (NIL "\\indented{2}{This type represents the finite direct or cartesian product of an} underlying ordered component type. The vectors are ordered first by the sum of their components,{} and then refined using a reverse lexicographic ordering. This type is a suitable third argument for \\spadtype{GeneralDistributedMultivariatePolynomial}."))) 
 ((-4227 |has| |#2| (-970)) (-4228 |has| |#2| (-970)) (-4230 |has| |#2| (-6 -4230)) ((-4235 "*") |has| |#2| (-157)) (-4233 . T)) 
-((|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-970))) (|HasCategory| |#2| (QUOTE (-729))) (|HasCategory| |#2| (QUOTE (-782))) (-3703 (|HasCategory| |#2| (QUOTE (-729))) (|HasCategory| |#2| (QUOTE (-782)))) (|HasCategory| |#2| (QUOTE (-157))) (-3703 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-970)))) (-3703 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-337)))) (-3703 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-970)))) (|HasCategory| |#2| (QUOTE (-342))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-210))) (-3703 (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-970)))) (-3703 (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (QUOTE (-970)))) (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| (-521) (QUOTE (-784))) (-12 (|HasCategory| |#2| (QUOTE (-970))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (QUOTE (-970)))) (-12 (|HasCategory| |#2| (QUOTE (-970))) (|HasCategory| |#2| (LIST (QUOTE -829) (QUOTE (-1084))))) (|HasCategory| |#2| (QUOTE (-663))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-3703 (|HasCategory| |#2| (QUOTE (-970))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521)))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-1013)))) (|HasAttribute| |#2| (QUOTE -4230)) (|HasCategory| |#2| (QUOTE (-124))) (-3703 (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-124))) (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-970)))) (|HasCategory| |#2| (QUOTE (-25))) (-3703 (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-124))) (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-342))) (|HasCategory| |#2| (QUOTE (-729))) (|HasCategory| |#2| (QUOTE (-782))) (|HasCategory| |#2| (QUOTE (-970))) (|HasCategory| |#2| (QUOTE (-1013)))) (-3703 (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-124))) (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-970)))) (-3703 (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -829) (QUOTE (-1084))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-25)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-124)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-157)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-210)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-337)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-342)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-729)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-782)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-970)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-1013))))) (-3703 (-12 (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-124))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-342))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-729))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-782))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-970))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521)))))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-3703 (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-124))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-342))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-729))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-782))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-970))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -829) (QUOTE (-1084)))))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-792)))) (-3703 (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-1013)))) (-12 (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (QUOTE (-970)))) (-12 (|HasCategory| |#2| (QUOTE (-970))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-970))) (|HasCategory| |#2| (LIST (QUOTE -829) (QUOTE (-1084))))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-792)))))) 
+((|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-970))) (|HasCategory| |#2| (QUOTE (-729))) (|HasCategory| |#2| (QUOTE (-781))) (-3703 (|HasCategory| |#2| (QUOTE (-729))) (|HasCategory| |#2| (QUOTE (-781)))) (|HasCategory| |#2| (QUOTE (-157))) (-3703 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-970)))) (-3703 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-337)))) (-3703 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-970)))) (|HasCategory| |#2| (QUOTE (-342))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-210))) (-3703 (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-970)))) (-3703 (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (QUOTE (-970)))) (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| (-521) (QUOTE (-783))) (-12 (|HasCategory| |#2| (QUOTE (-970))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (QUOTE (-970)))) (-12 (|HasCategory| |#2| (QUOTE (-970))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1084))))) (|HasCategory| |#2| (QUOTE (-663))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-3703 (|HasCategory| |#2| (QUOTE (-970))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521)))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-1013)))) (|HasAttribute| |#2| (QUOTE -4230)) (|HasCategory| |#2| (QUOTE (-124))) (-3703 (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-124))) (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-970)))) (|HasCategory| |#2| (QUOTE (-25))) (-3703 (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-124))) (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-342))) (|HasCategory| |#2| (QUOTE (-729))) (|HasCategory| |#2| (QUOTE (-781))) (|HasCategory| |#2| (QUOTE (-970))) (|HasCategory| |#2| (QUOTE (-1013)))) (-3703 (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-124))) (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-970)))) (-3703 (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1084))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-25)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-124)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-157)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-210)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-337)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-342)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-729)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-781)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-970)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-1013))))) (-3703 (-12 (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-124))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-342))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-729))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-781))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-970))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521)))))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-3703 (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-124))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-342))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-729))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-781))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-970))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1084)))))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-791)))) (-3703 (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-1013)))) (-12 (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (QUOTE (-970)))) (-12 (|HasCategory| |#2| (QUOTE (-970))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-970))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1084))))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-791)))))) 
 (-455 S) 
 ((|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}."))) 
 ((-4233 . T) (-4234 . T)) 
-((|HasCategory| |#1| (QUOTE (-1013))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))))) 
+((|HasCategory| |#1| (QUOTE (-1013))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))))) 
 (-456 -4049 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 
@@ -1763,14 +1763,14 @@ NIL
 (-458) 
 ((|constructor| (NIL "This domain allows rational numbers to be presented as repeating hexadecimal expansions.")) (|hex| (($ (|Fraction| (|Integer|))) "\\spad{hex(r)} converts a rational number to a hexadecimal expansion.")) (|fractionPart| (((|Fraction| (|Integer|)) $) "\\spad{fractionPart(h)} returns the fractional part of a hexadecimal expansion.")) (|coerce| (((|RadixExpansion| 16) $) "\\spad{coerce(h)} converts a hexadecimal expansion to a radix expansion with base 16.") (((|Fraction| (|Integer|)) $) "\\spad{coerce(h)} converts a hexadecimal expansion to a rational number."))) 
 ((-4225 . T) (-4231 . T) (-4226 . T) ((-4235 "*") . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
-((|HasCategory| (-521) (QUOTE (-838))) (|HasCategory| (-521) (LIST (QUOTE -961) (QUOTE (-1084)))) (|HasCategory| (-521) (QUOTE (-133))) (|HasCategory| (-521) (QUOTE (-135))) (|HasCategory| (-521) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| (-521) (QUOTE (-946))) (|HasCategory| (-521) (QUOTE (-757))) (|HasCategory| (-521) (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| (-521) (QUOTE (-1060))) (|HasCategory| (-521) (LIST (QUOTE -815) (QUOTE (-521)))) (|HasCategory| (-521) (LIST (QUOTE -815) (QUOTE (-353)))) (|HasCategory| (-521) (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-353))))) (|HasCategory| (-521) (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521))))) (|HasCategory| (-521) (QUOTE (-210))) (|HasCategory| (-521) (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| (-521) (LIST (QUOTE -482) (QUOTE (-1084)) (QUOTE (-521)))) (|HasCategory| (-521) (LIST (QUOTE -284) (QUOTE (-521)))) (|HasCategory| (-521) (LIST (QUOTE -261) (QUOTE (-521)) (QUOTE (-521)))) (|HasCategory| (-521) (QUOTE (-282))) (|HasCategory| (-521) (QUOTE (-506))) (|HasCategory| (-521) (QUOTE (-784))) (-3703 (|HasCategory| (-521) (QUOTE (-757))) (|HasCategory| (-521) (QUOTE (-784)))) (|HasCategory| (-521) (LIST (QUOTE -583) (QUOTE (-521)))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| (-521) (QUOTE (-838)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| (-521) (QUOTE (-838)))) (|HasCategory| (-521) (QUOTE (-133))))) 
+((|HasCategory| (-521) (QUOTE (-837))) (|HasCategory| (-521) (LIST (QUOTE -961) (QUOTE (-1084)))) (|HasCategory| (-521) (QUOTE (-133))) (|HasCategory| (-521) (QUOTE (-135))) (|HasCategory| (-521) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| (-521) (QUOTE (-946))) (|HasCategory| (-521) (QUOTE (-756))) (|HasCategory| (-521) (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| (-521) (QUOTE (-1060))) (|HasCategory| (-521) (LIST (QUOTE -814) (QUOTE (-521)))) (|HasCategory| (-521) (LIST (QUOTE -814) (QUOTE (-353)))) (|HasCategory| (-521) (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-353))))) (|HasCategory| (-521) (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521))))) (|HasCategory| (-521) (QUOTE (-210))) (|HasCategory| (-521) (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| (-521) (LIST (QUOTE -482) (QUOTE (-1084)) (QUOTE (-521)))) (|HasCategory| (-521) (LIST (QUOTE -284) (QUOTE (-521)))) (|HasCategory| (-521) (LIST (QUOTE -261) (QUOTE (-521)) (QUOTE (-521)))) (|HasCategory| (-521) (QUOTE (-282))) (|HasCategory| (-521) (QUOTE (-506))) (|HasCategory| (-521) (QUOTE (-783))) (-3703 (|HasCategory| (-521) (QUOTE (-756))) (|HasCategory| (-521) (QUOTE (-783)))) (|HasCategory| (-521) (LIST (QUOTE -583) (QUOTE (-521)))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| (-521) (QUOTE (-837)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| (-521) (QUOTE (-837)))) (|HasCategory| (-521) (QUOTE (-133))))) 
 (-459 A S) 
 ((|constructor| (NIL "A homogeneous aggregate is an aggregate of elements all of the same type. In the current system,{} all aggregates are homogeneous. Two attributes characterize classes of aggregates. Aggregates from domains with attribute \\spadatt{finiteAggregate} have a finite number of members. Those with attribute \\spadatt{shallowlyMutable} allow an element to be modified or updated without changing its overall value.")) (|member?| (((|Boolean|) |#2| $) "\\spad{member?(x,{}u)} tests if \\spad{x} is a member of \\spad{u}. For collections,{} \\axiom{member?(\\spad{x},{}\\spad{u}) = reduce(or,{}[x=y for \\spad{y} in \\spad{u}],{}\\spad{false})}.")) (|members| (((|List| |#2|) $) "\\spad{members(u)} returns a list of the consecutive elements of \\spad{u}. For collections,{} \\axiom{parts([\\spad{x},{}\\spad{y},{}...,{}\\spad{z}]) = (\\spad{x},{}\\spad{y},{}...,{}\\spad{z})}.")) (|parts| (((|List| |#2|) $) "\\spad{parts(u)} returns a list of the consecutive elements of \\spad{u}. For collections,{} \\axiom{parts([\\spad{x},{}\\spad{y},{}...,{}\\spad{z}]) = (\\spad{x},{}\\spad{y},{}...,{}\\spad{z})}.")) (|count| (((|NonNegativeInteger|) |#2| $) "\\spad{count(x,{}u)} returns the number of occurrences of \\spad{x} in \\spad{u}. For collections,{} \\axiom{count(\\spad{x},{}\\spad{u}) = reduce(+,{}[x=y for \\spad{y} in \\spad{u}],{}0)}.") (((|NonNegativeInteger|) (|Mapping| (|Boolean|) |#2|) $) "\\spad{count(p,{}u)} returns the number of elements \\spad{x} in \\spad{u} such that \\axiom{\\spad{p}(\\spad{x})} is \\spad{true}. For collections,{} \\axiom{count(\\spad{p},{}\\spad{u}) = reduce(+,{}[1 for \\spad{x} in \\spad{u} | \\spad{p}(\\spad{x})],{}0)}.")) (|every?| (((|Boolean|) (|Mapping| (|Boolean|) |#2|) $) "\\spad{every?(f,{}u)} tests if \\spad{p}(\\spad{x}) is \\spad{true} for all elements \\spad{x} of \\spad{u}. Note: for collections,{} \\axiom{every?(\\spad{p},{}\\spad{u}) = reduce(and,{}map(\\spad{f},{}\\spad{u}),{}\\spad{true},{}\\spad{false})}.")) (|any?| (((|Boolean|) (|Mapping| (|Boolean|) |#2|) $) "\\spad{any?(p,{}u)} tests if \\axiom{\\spad{p}(\\spad{x})} is \\spad{true} for any element \\spad{x} of \\spad{u}. Note: for collections,{} \\axiom{any?(\\spad{p},{}\\spad{u}) = reduce(or,{}map(\\spad{f},{}\\spad{u}),{}\\spad{false},{}\\spad{true})}.")) (|map!| (($ (|Mapping| |#2| |#2|) $) "\\spad{map!(f,{}u)} destructively replaces each element \\spad{x} of \\spad{u} by \\axiom{\\spad{f}(\\spad{x})}.")) (|map| (($ (|Mapping| |#2| |#2|) $) "\\spad{map(f,{}u)} returns a copy of \\spad{u} with each element \\spad{x} replaced by \\spad{f}(\\spad{x}). For collections,{} \\axiom{map(\\spad{f},{}\\spad{u}) = [\\spad{f}(\\spad{x}) for \\spad{x} in \\spad{u}]}."))) 
 NIL 
-((|HasAttribute| |#1| (QUOTE -4233)) (|HasAttribute| |#1| (QUOTE -4234)) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|))) (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-792))))) 
+((|HasAttribute| |#1| (QUOTE -4233)) (|HasAttribute| |#1| (QUOTE -4234)) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|))) (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-791))))) 
 (-460 S) 
 ((|constructor| (NIL "A homogeneous aggregate is an aggregate of elements all of the same type. In the current system,{} all aggregates are homogeneous. Two attributes characterize classes of aggregates. Aggregates from domains with attribute \\spadatt{finiteAggregate} have a finite number of members. Those with attribute \\spadatt{shallowlyMutable} allow an element to be modified or updated without changing its overall value.")) (|member?| (((|Boolean|) |#1| $) "\\spad{member?(x,{}u)} tests if \\spad{x} is a member of \\spad{u}. For collections,{} \\axiom{member?(\\spad{x},{}\\spad{u}) = reduce(or,{}[x=y for \\spad{y} in \\spad{u}],{}\\spad{false})}.")) (|members| (((|List| |#1|) $) "\\spad{members(u)} returns a list of the consecutive elements of \\spad{u}. For collections,{} \\axiom{parts([\\spad{x},{}\\spad{y},{}...,{}\\spad{z}]) = (\\spad{x},{}\\spad{y},{}...,{}\\spad{z})}.")) (|parts| (((|List| |#1|) $) "\\spad{parts(u)} returns a list of the consecutive elements of \\spad{u}. For collections,{} \\axiom{parts([\\spad{x},{}\\spad{y},{}...,{}\\spad{z}]) = (\\spad{x},{}\\spad{y},{}...,{}\\spad{z})}.")) (|count| (((|NonNegativeInteger|) |#1| $) "\\spad{count(x,{}u)} returns the number of occurrences of \\spad{x} in \\spad{u}. For collections,{} \\axiom{count(\\spad{x},{}\\spad{u}) = reduce(+,{}[x=y for \\spad{y} in \\spad{u}],{}0)}.") (((|NonNegativeInteger|) (|Mapping| (|Boolean|) |#1|) $) "\\spad{count(p,{}u)} returns the number of elements \\spad{x} in \\spad{u} such that \\axiom{\\spad{p}(\\spad{x})} is \\spad{true}. For collections,{} \\axiom{count(\\spad{p},{}\\spad{u}) = reduce(+,{}[1 for \\spad{x} in \\spad{u} | \\spad{p}(\\spad{x})],{}0)}.")) (|every?| (((|Boolean|) (|Mapping| (|Boolean|) |#1|) $) "\\spad{every?(f,{}u)} tests if \\spad{p}(\\spad{x}) is \\spad{true} for all elements \\spad{x} of \\spad{u}. Note: for collections,{} \\axiom{every?(\\spad{p},{}\\spad{u}) = reduce(and,{}map(\\spad{f},{}\\spad{u}),{}\\spad{true},{}\\spad{false})}.")) (|any?| (((|Boolean|) (|Mapping| (|Boolean|) |#1|) $) "\\spad{any?(p,{}u)} tests if \\axiom{\\spad{p}(\\spad{x})} is \\spad{true} for any element \\spad{x} of \\spad{u}. Note: for collections,{} \\axiom{any?(\\spad{p},{}\\spad{u}) = reduce(or,{}map(\\spad{f},{}\\spad{u}),{}\\spad{false},{}\\spad{true})}.")) (|map!| (($ (|Mapping| |#1| |#1|) $) "\\spad{map!(f,{}u)} destructively replaces each element \\spad{x} of \\spad{u} by \\axiom{\\spad{f}(\\spad{x})}.")) (|map| (($ (|Mapping| |#1| |#1|) $) "\\spad{map(f,{}u)} returns a copy of \\spad{u} with each element \\spad{x} replaced by \\spad{f}(\\spad{x}). For collections,{} \\axiom{map(\\spad{f},{}\\spad{u}) = [\\spad{f}(\\spad{x}) for \\spad{x} in \\spad{u}]}."))) 
-((-2046 . T)) 
+((-2092 . T)) 
 NIL 
 (-461 S) 
 ((|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}."))) 
@@ -1791,11 +1791,11 @@ NIL
 (-465 S |mn|) 
 ((|constructor| (NIL "\\indented{1}{Author Micheal Monagan Aug/87} This is the basic one dimensional array data type."))) 
 ((-4234 . T) (-4233 . T)) 
-((|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| (-521) (QUOTE (-784))) (|HasCategory| |#1| (QUOTE (-1013))) (-3703 (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| |#1| (QUOTE (-1013)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|))))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))))) 
+((|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| (-521) (QUOTE (-783))) (|HasCategory| |#1| (QUOTE (-1013))) (-3703 (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#1| (QUOTE (-1013)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|))))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))))) 
 (-466 R |mnRow| |mnCol|) 
 ((|constructor| (NIL "\\indented{1}{An IndexedTwoDimensionalArray is a 2-dimensional array where} the minimal row and column indices are parameters of the type. Rows and columns are returned as IndexedOneDimensionalArray\\spad{'s} with minimal indices matching those of the IndexedTwoDimensionalArray. The index of the 'first' row may be obtained by calling the function 'minRowIndex'. The index of the 'first' column may be obtained by calling the function 'minColIndex'. The index of the first element of a 'Row' is the same as the index of the first column in an array and vice versa."))) 
 ((-4233 . T) (-4234 . T)) 
-((|HasCategory| |#1| (QUOTE (-1013))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))))) 
+((|HasCategory| |#1| (QUOTE (-1013))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))))) 
 (-467 K R UP) 
 ((|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 
@@ -1807,7 +1807,7 @@ NIL
 (-469 |mn|) 
 ((|constructor| (NIL "\\spadtype{IndexedBits} is a domain to compactly represent large quantities of Boolean data.")) (|And| (($ $ $) "\\spad{And(n,{}m)} returns the bit-by-bit logical {\\em And} of \\spad{n} and \\spad{m}.")) (|Or| (($ $ $) "\\spad{Or(n,{}m)} returns the bit-by-bit logical {\\em Or} of \\spad{n} and \\spad{m}.")) (|Not| (($ $) "\\spad{Not(n)} returns the bit-by-bit logical {\\em Not} of \\spad{n}."))) 
 ((-4234 . T) (-4233 . T)) 
-((|HasCategory| (-108) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| (-108) (QUOTE (-784))) (|HasCategory| (-521) (QUOTE (-784))) (|HasCategory| (-108) (QUOTE (-1013))) (-12 (|HasCategory| (-108) (QUOTE (-1013))) (|HasCategory| (-108) (LIST (QUOTE -284) (QUOTE (-108))))) (|HasCategory| (-108) (LIST (QUOTE -561) (QUOTE (-792))))) 
+((|HasCategory| (-108) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| (-108) (QUOTE (-783))) (|HasCategory| (-521) (QUOTE (-783))) (|HasCategory| (-108) (QUOTE (-1013))) (-12 (|HasCategory| (-108) (QUOTE (-1013))) (|HasCategory| (-108) (LIST (QUOTE -284) (QUOTE (-108))))) (|HasCategory| (-108) (LIST (QUOTE -561) (QUOTE (-791))))) 
 (-470 K R UP L) 
 ((|constructor| (NIL "IntegralBasisPolynomialTools provides functions for \\indented{1}{mapping functions on the coefficients of univariate and bivariate} \\indented{1}{polynomials.}")) (|mapBivariate| (((|SparseUnivariatePolynomial| (|SparseUnivariatePolynomial| |#4|)) (|Mapping| |#4| |#1|) |#3|) "\\spad{mapBivariate(f,{}p(x,{}y))} applies the function \\spad{f} to the coefficients of \\spad{p(x,{}y)}.")) (|mapMatrixIfCan| (((|Union| (|Matrix| |#2|) "failed") (|Mapping| (|Union| |#1| "failed") |#4|) (|Matrix| (|SparseUnivariatePolynomial| |#4|))) "\\spad{mapMatrixIfCan(f,{}mat)} applies the function \\spad{f} to the coefficients of the entries of \\spad{mat} if possible,{} and returns \\spad{\"failed\"} otherwise.")) (|mapUnivariateIfCan| (((|Union| |#2| "failed") (|Mapping| (|Union| |#1| "failed") |#4|) (|SparseUnivariatePolynomial| |#4|)) "\\spad{mapUnivariateIfCan(f,{}p(x))} applies the function \\spad{f} to the coefficients of \\spad{p(x)},{} if possible,{} and returns \\spad{\"failed\"} otherwise.")) (|mapUnivariate| (((|SparseUnivariatePolynomial| |#4|) (|Mapping| |#4| |#1|) |#2|) "\\spad{mapUnivariate(f,{}p(x))} applies the function \\spad{f} to the coefficients of \\spad{p(x)}.") ((|#2| (|Mapping| |#1| |#4|) (|SparseUnivariatePolynomial| |#4|)) "\\spad{mapUnivariate(f,{}p(x))} applies the function \\spad{f} to the coefficients of \\spad{p(x)}."))) 
 NIL 
@@ -1867,7 +1867,7 @@ NIL
 (-484 S |mn|) 
 ((|constructor| (NIL "\\indented{1}{Author: Michael Monagan July/87,{} modified \\spad{SMW} June/91} 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.")) (|shrinkable| (((|Boolean|) (|Boolean|)) "\\spad{shrinkable(b)} sets the shrinkable attribute of flexible arrays to \\spad{b} and returns the previous value")) (|physicalLength!| (($ $ (|Integer|)) "\\spad{physicalLength!(x,{}n)} changes the physical length of \\spad{x} to be \\spad{n} and returns the new array.")) (|physicalLength| (((|NonNegativeInteger|) $) "\\spad{physicalLength(x)} returns the number of elements \\spad{x} can accomodate before growing")) (|flexibleArray| (($ (|List| |#1|)) "\\spad{flexibleArray(l)} creates a flexible array from the list of elements \\spad{l}"))) 
 ((-4234 . T) (-4233 . T)) 
-((|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| (-521) (QUOTE (-784))) (|HasCategory| |#1| (QUOTE (-1013))) (-3703 (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| |#1| (QUOTE (-1013)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|))))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))))) 
+((|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| (-521) (QUOTE (-783))) (|HasCategory| |#1| (QUOTE (-1013))) (-3703 (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#1| (QUOTE (-1013)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|))))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))))) 
 (-485 |p| |n|) 
 ((|constructor| (NIL "InnerFiniteField(\\spad{p},{}\\spad{n}) implements finite fields with \\spad{p**n} elements where \\spad{p} is assumed prime but does not check. For a version which checks that \\spad{p} is prime,{} see \\spadtype{FiniteField}."))) 
 ((-4225 . T) (-4231 . T) (-4226 . T) ((-4235 "*") . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
@@ -1875,11 +1875,11 @@ NIL
 (-486 R |mnRow| |mnCol| |Row| |Col|) 
 ((|constructor| (NIL "\\indented{1}{This is an internal type which provides an implementation of} 2-dimensional arrays as PrimitiveArray\\spad{'s} of PrimitiveArray\\spad{'s}."))) 
 ((-4233 . T) (-4234 . T)) 
-((|HasCategory| |#1| (QUOTE (-1013))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))))) 
+((|HasCategory| |#1| (QUOTE (-1013))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))))) 
 (-487 S |mn|) 
 ((|constructor| (NIL "\\spadtype{IndexedList} is a basic implementation of the functions in \\spadtype{ListAggregate},{} often using functions in the underlying LISP system. The second parameter to the constructor (\\spad{mn}) is the beginning index of the list. That is,{} if \\spad{l} is a list,{} then \\spad{elt(l,{}mn)} is the first value. This constructor is probably best viewed as the implementation of singly-linked lists that are addressable by index rather than as a mere wrapper for LISP lists."))) 
 ((-4234 . T) (-4233 . T)) 
-((|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| (-521) (QUOTE (-784))) (|HasCategory| |#1| (QUOTE (-1013))) (-3703 (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| |#1| (QUOTE (-1013)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|))))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))))) 
+((|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| (-521) (QUOTE (-783))) (|HasCategory| |#1| (QUOTE (-1013))) (-3703 (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#1| (QUOTE (-1013)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|))))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))))) 
 (-488 R |Row| |Col| M) 
 ((|constructor| (NIL "\\spadtype{InnerMatrixLinearAlgebraFunctions} is an internal package which provides standard linear algebra functions on domains in \\spad{MatrixCategory}")) (|inverse| (((|Union| |#4| "failed") |#4|) "\\spad{inverse(m)} returns the inverse of the matrix \\spad{m}. If the matrix is not invertible,{} \"failed\" is returned. Error: if the matrix is not square.")) (|generalizedInverse| ((|#4| |#4|) "\\spad{generalizedInverse(m)} returns the generalized (Moore--Penrose) inverse of the matrix \\spad{m},{} \\spadignore{i.e.} the matrix \\spad{h} such that m*h*m=h,{} h*m*h=m,{} \\spad{m*h} and \\spad{h*m} are both symmetric matrices.")) (|determinant| ((|#1| |#4|) "\\spad{determinant(m)} returns the determinant of the matrix \\spad{m}. an error message is returned if the matrix is not square.")) (|nullSpace| (((|List| |#3|) |#4|) "\\spad{nullSpace(m)} returns a basis for the null space of the matrix \\spad{m}.")) (|nullity| (((|NonNegativeInteger|) |#4|) "\\spad{nullity(m)} returns the mullity of the matrix \\spad{m}. This is the dimension of the null space of the matrix \\spad{m}.")) (|rank| (((|NonNegativeInteger|) |#4|) "\\spad{rank(m)} returns the rank of the matrix \\spad{m}.")) (|rowEchelon| ((|#4| |#4|) "\\spad{rowEchelon(m)} returns the row echelon form of the matrix \\spad{m}."))) 
 NIL 
@@ -1891,7 +1891,7 @@ NIL
 (-490 R |mnRow| |mnCol|) 
 ((|constructor| (NIL "An \\spad{IndexedMatrix} is a matrix where the minimal row and column indices are parameters of the type. The domains Row and Col are both IndexedVectors. The index of the 'first' row may be obtained by calling the function \\spadfun{minRowIndex}. The index of the 'first' column may be obtained by calling the function \\spadfun{minColIndex}. The index of the first element of a 'Row' is the same as the index of the first column in a matrix and vice versa."))) 
 ((-4233 . T) (-4234 . T)) 
-((|HasCategory| |#1| (QUOTE (-1013))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-282))) (|HasCategory| |#1| (QUOTE (-513))) (|HasAttribute| |#1| (QUOTE (-4235 "*"))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))))) 
+((|HasCategory| |#1| (QUOTE (-1013))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-282))) (|HasCategory| |#1| (QUOTE (-513))) (|HasAttribute| |#1| (QUOTE (-4235 "*"))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))))) 
 (-491 GF) 
 ((|constructor| (NIL "InnerNormalBasisFieldFunctions(\\spad{GF}) (unexposed): This package has functions used by every normal basis finite field extension domain.")) (|minimalPolynomial| (((|SparseUnivariatePolynomial| |#1|) (|Vector| |#1|)) "\\spad{minimalPolynomial(x)} \\undocumented{} See \\axiomFunFrom{minimalPolynomial}{FiniteAlgebraicExtensionField}")) (|normalElement| (((|Vector| |#1|) (|PositiveInteger|)) "\\spad{normalElement(n)} \\undocumented{} See \\axiomFunFrom{normalElement}{FiniteAlgebraicExtensionField}")) (|basis| (((|Vector| (|Vector| |#1|)) (|PositiveInteger|)) "\\spad{basis(n)} \\undocumented{} See \\axiomFunFrom{basis}{FiniteAlgebraicExtensionField}")) (|normal?| (((|Boolean|) (|Vector| |#1|)) "\\spad{normal?(x)} \\undocumented{} See \\axiomFunFrom{normal?}{FiniteAlgebraicExtensionField}")) (|lookup| (((|PositiveInteger|) (|Vector| |#1|)) "\\spad{lookup(x)} \\undocumented{} See \\axiomFunFrom{lookup}{Finite}")) (|inv| (((|Vector| |#1|) (|Vector| |#1|)) "\\spad{inv x} \\undocumented{} See \\axiomFunFrom{inv}{DivisionRing}")) (|trace| (((|Vector| |#1|) (|Vector| |#1|) (|PositiveInteger|)) "\\spad{trace(x,{}n)} \\undocumented{} See \\axiomFunFrom{trace}{FiniteAlgebraicExtensionField}")) (|norm| (((|Vector| |#1|) (|Vector| |#1|) (|PositiveInteger|)) "\\spad{norm(x,{}n)} \\undocumented{} See \\axiomFunFrom{norm}{FiniteAlgebraicExtensionField}")) (/ (((|Vector| |#1|) (|Vector| |#1|) (|Vector| |#1|)) "\\spad{x/y} \\undocumented{} See \\axiomFunFrom{/}{Field}")) (* (((|Vector| |#1|) (|Vector| |#1|) (|Vector| |#1|)) "\\spad{x*y} \\undocumented{} See \\axiomFunFrom{*}{SemiGroup}")) (** (((|Vector| |#1|) (|Vector| |#1|) (|Integer|)) "\\spad{x**n} \\undocumented{} See \\axiomFunFrom{\\spad{**}}{DivisionRing}")) (|qPot| (((|Vector| |#1|) (|Vector| |#1|) (|Integer|)) "\\spad{qPot(v,{}e)} computes \\spad{v**(q**e)},{} interpreting \\spad{v} as an element of normal basis field,{} \\spad{q} the size of the ground field. This is done by a cyclic \\spad{e}-shift of the vector \\spad{v}.")) (|expPot| (((|Vector| |#1|) (|Vector| |#1|) (|SingleInteger|) (|SingleInteger|)) "\\spad{expPot(v,{}e,{}d)} returns the sum from \\spad{i = 0} to \\spad{e - 1} of \\spad{v**(q**i*d)},{} interpreting \\spad{v} as an element of a normal basis field and where \\spad{q} is the size of the ground field. Note: for a description of the algorithm,{} see \\spad{T}.Itoh and \\spad{S}.Tsujii,{} \"A fast algorithm for computing multiplicative inverses in \\spad{GF}(2^m) using normal bases\",{} Information and Computation 78,{} \\spad{pp}.171-177,{} 1988.")) (|repSq| (((|Vector| |#1|) (|Vector| |#1|) (|NonNegativeInteger|)) "\\spad{repSq(v,{}e)} computes \\spad{v**e} by repeated squaring,{} interpreting \\spad{v} as an element of a normal basis field.")) (|dAndcExp| (((|Vector| |#1|) (|Vector| |#1|) (|NonNegativeInteger|) (|SingleInteger|)) "\\spad{dAndcExp(v,{}n,{}k)} computes \\spad{v**e} interpreting \\spad{v} as an element of normal basis field. A divide and conquer algorithm similar to the one from \\spad{D}.\\spad{R}.Stinson,{} \"Some observations on parallel Algorithms for fast exponentiation in \\spad{GF}(2^n)\",{} Siam \\spad{J}. Computation,{} Vol.19,{} No.4,{} \\spad{pp}.711-717,{} August 1990 is used. Argument \\spad{k} is a parameter of this algorithm.")) (|xn| (((|SparseUnivariatePolynomial| |#1|) (|NonNegativeInteger|)) "\\spad{xn(n)} returns the polynomial \\spad{x**n-1}.")) (|pol| (((|SparseUnivariatePolynomial| |#1|) (|Vector| |#1|)) "\\spad{pol(v)} turns the vector \\spad{[v0,{}...,{}vn]} into the polynomial \\spad{v0+v1*x+ ... + vn*x**n}.")) (|index| (((|Vector| |#1|) (|PositiveInteger|) (|PositiveInteger|)) "\\spad{index(n,{}m)} is a index function for vectors of length \\spad{n} over the ground field.")) (|random| (((|Vector| |#1|) (|PositiveInteger|)) "\\spad{random(n)} creates a vector over the ground field with random entries.")) (|setFieldInfo| (((|Void|) (|Vector| (|List| (|Record| (|:| |value| |#1|) (|:| |index| (|SingleInteger|))))) |#1|) "\\spad{setFieldInfo(m,{}p)} initializes the field arithmetic,{} where \\spad{m} is the multiplication table and \\spad{p} is the respective normal element of the ground field \\spad{GF}."))) 
 NIL 
@@ -1959,7 +1959,7 @@ NIL
 (-507 |Key| |Entry| |addDom|) 
 ((|constructor| (NIL "This domain is used to provide a conditional \"add\" domain for the implementation of \\spadtype{Table}."))) 
 ((-4233 . T) (-4234 . T)) 
-((|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (QUOTE (-1013))) (-12 (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (QUOTE (-1013))) (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (LIST (QUOTE -284) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2529) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3045) (|devaluate| |#2|)))))) (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| |#2| (QUOTE (-1013))) (-3703 (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (QUOTE (-1013))) (|HasCategory| |#2| (QUOTE (-1013)))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-792)))) (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (LIST (QUOTE -561) (QUOTE (-792)))) (-3703 (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (QUOTE (-1013))) (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (LIST (QUOTE -561) (QUOTE (-792)))) (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-792))))) (-3703 (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (LIST (QUOTE -561) (QUOTE (-792)))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-792)))))) 
+((|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (QUOTE (-1013))) (-12 (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (QUOTE (-1013))) (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (LIST (QUOTE -284) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2535) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3050) (|devaluate| |#2|)))))) (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#2| (QUOTE (-1013))) (-3703 (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (QUOTE (-1013))) (|HasCategory| |#2| (QUOTE (-1013)))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-791)))) (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (LIST (QUOTE -561) (QUOTE (-791)))) (-3703 (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (QUOTE (-1013))) (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (LIST (QUOTE -561) (QUOTE (-791)))) (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-791))))) (-3703 (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (LIST (QUOTE -561) (QUOTE (-791)))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-791)))))) 
 (-508 R -4049) 
 ((|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 
@@ -1974,7 +1974,7 @@ NIL
 NIL 
 (-511 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."))) 
-((-3894 . T) (-4226 . T) ((-4235 "*") . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
+((-3893 . T) (-4226 . T) ((-4235 "*") . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
 NIL 
 (-512 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."))) 
@@ -2027,7 +2027,7 @@ NIL
 (-524 R -4049) 
 ((|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 -562) (LIST (QUOTE -821) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -815) (QUOTE (-521)))) (|HasCategory| |#2| (QUOTE (-1048)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -815) (QUOTE (-521)))) (|HasCategory| |#2| (QUOTE (-573))))) 
+((-12 (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -814) (QUOTE (-521)))) (|HasCategory| |#2| (QUOTE (-1048)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -814) (QUOTE (-521)))) (|HasCategory| |#2| (QUOTE (-573))))) 
 (-525 -4049 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 
@@ -2042,7 +2042,7 @@ NIL
 NIL 
 (-528 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."))) 
-((-3894 . T) (-4226 . T) ((-4235 "*") . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
+((-3893 . T) (-4226 . T) ((-4235 "*") . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
 NIL 
 (-529) 
 ((|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."))) 
@@ -2051,7 +2051,7 @@ NIL
 (-530 R -4049) 
 ((|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 -562) (LIST (QUOTE -821) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (LIST (QUOTE -815) (QUOTE (-521)))) (|HasCategory| |#2| (QUOTE (-259))) (|HasCategory| |#2| (QUOTE (-573))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-1084))))) (-12 (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#2| (QUOTE (-259)))) (|HasCategory| |#1| (QUOTE (-513)))) 
+((-12 (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (LIST (QUOTE -814) (QUOTE (-521)))) (|HasCategory| |#2| (QUOTE (-259))) (|HasCategory| |#2| (QUOTE (-573))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-1084))))) (-12 (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#2| (QUOTE (-259)))) (|HasCategory| |#1| (QUOTE (-513)))) 
 (-531 -4049 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 
@@ -2083,7 +2083,7 @@ NIL
 (-538 -4049) 
 ((|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}."))) 
 ((-4228 . T) (-4227 . T)) 
-((|HasCategory| |#1| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-1084))))) 
+((|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-1084))))) 
 (-539 I) 
 ((|constructor| (NIL "The \\spadtype{IntegerRoots} package computes square roots and \\indented{2}{\\spad{n}th roots of integers efficiently.}")) (|approxSqrt| ((|#1| |#1|) "\\spad{approxSqrt(n)} returns an approximation \\spad{x} to \\spad{sqrt(n)} such that \\spad{-1 < x - sqrt(n) < 1}. Compute an approximation \\spad{s} to \\spad{sqrt(n)} such that \\indented{10}{\\spad{-1 < s - sqrt(n) < 1}} A variable precision Newton iteration is used. The running time is \\spad{O( log(n)**2 )}.")) (|perfectSqrt| (((|Union| |#1| "failed") |#1|) "\\spad{perfectSqrt(n)} returns the square root of \\spad{n} if \\spad{n} is a perfect square and returns \"failed\" otherwise")) (|perfectSquare?| (((|Boolean|) |#1|) "\\spad{perfectSquare?(n)} returns \\spad{true} if \\spad{n} is a perfect square and \\spad{false} otherwise")) (|approxNthRoot| ((|#1| |#1| (|NonNegativeInteger|)) "\\spad{approxRoot(n,{}r)} returns an approximation \\spad{x} to \\spad{n**(1/r)} such that \\spad{-1 < x - n**(1/r) < 1}")) (|perfectNthRoot| (((|Record| (|:| |base| |#1|) (|:| |exponent| (|NonNegativeInteger|))) |#1|) "\\spad{perfectNthRoot(n)} returns \\spad{[x,{}r]},{} where \\spad{n = x\\^r} and \\spad{r} is the largest integer such that \\spad{n} is a perfect \\spad{r}th power") (((|Union| |#1| "failed") |#1| (|NonNegativeInteger|)) "\\spad{perfectNthRoot(n,{}r)} returns the \\spad{r}th root of \\spad{n} if \\spad{n} is an \\spad{r}th power and returns \"failed\" otherwise")) (|perfectNthPower?| (((|Boolean|) |#1| (|NonNegativeInteger|)) "\\spad{perfectNthPower?(n,{}r)} returns \\spad{true} if \\spad{n} is an \\spad{r}th power and \\spad{false} otherwise"))) 
 NIL 
@@ -2107,7 +2107,7 @@ NIL
 (-544 |mn|) 
 ((|constructor| (NIL "This domain implements low-level strings")) (|hash| (((|Integer|) $) "\\spad{hash(x)} provides a hashing function for strings"))) 
 ((-4234 . T) (-4233 . T)) 
-((|HasCategory| (-132) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| (-132) (QUOTE (-784))) (|HasCategory| (-521) (QUOTE (-784))) (|HasCategory| (-132) (QUOTE (-1013))) (-3703 (|HasCategory| (-132) (QUOTE (-784))) (|HasCategory| (-132) (QUOTE (-1013)))) (-12 (|HasCategory| (-132) (QUOTE (-1013))) (|HasCategory| (-132) (LIST (QUOTE -284) (QUOTE (-132))))) (-3703 (-12 (|HasCategory| (-132) (QUOTE (-784))) (|HasCategory| (-132) (LIST (QUOTE -284) (QUOTE (-132))))) (-12 (|HasCategory| (-132) (QUOTE (-1013))) (|HasCategory| (-132) (LIST (QUOTE -284) (QUOTE (-132)))))) (|HasCategory| (-132) (LIST (QUOTE -561) (QUOTE (-792)))) (-3703 (|HasCategory| (-132) (LIST (QUOTE -561) (QUOTE (-792)))) (-12 (|HasCategory| (-132) (QUOTE (-1013))) (|HasCategory| (-132) (LIST (QUOTE -284) (QUOTE (-132))))))) 
+((|HasCategory| (-132) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| (-132) (QUOTE (-783))) (|HasCategory| (-521) (QUOTE (-783))) (|HasCategory| (-132) (QUOTE (-1013))) (-3703 (|HasCategory| (-132) (QUOTE (-783))) (|HasCategory| (-132) (QUOTE (-1013)))) (-12 (|HasCategory| (-132) (QUOTE (-1013))) (|HasCategory| (-132) (LIST (QUOTE -284) (QUOTE (-132))))) (-3703 (-12 (|HasCategory| (-132) (QUOTE (-783))) (|HasCategory| (-132) (LIST (QUOTE -284) (QUOTE (-132))))) (-12 (|HasCategory| (-132) (QUOTE (-1013))) (|HasCategory| (-132) (LIST (QUOTE -284) (QUOTE (-132)))))) (|HasCategory| (-132) (LIST (QUOTE -561) (QUOTE (-791)))) (-3703 (|HasCategory| (-132) (LIST (QUOTE -561) (QUOTE (-791)))) (-12 (|HasCategory| (-132) (QUOTE (-1013))) (|HasCategory| (-132) (LIST (QUOTE -284) (QUOTE (-132))))))) 
 (-545 E V R P) 
 ((|constructor| (NIL "tools for the summation packages.")) (|sum| (((|Record| (|:| |num| |#4|) (|:| |den| (|Integer|))) |#4| |#2|) "\\spad{sum(p(n),{} n)} returns \\spad{P(n)},{} the indefinite sum of \\spad{p(n)} with respect to upward difference on \\spad{n},{} \\spadignore{i.e.} \\spad{P(n+1) - P(n) = a(n)}.") (((|Record| (|:| |num| |#4|) (|:| |den| (|Integer|))) |#4| |#2| (|Segment| |#4|)) "\\spad{sum(p(n),{} n = a..b)} returns \\spad{p(a) + p(a+1) + ... + p(b)}."))) 
 NIL 
@@ -2115,7 +2115,7 @@ NIL
 (-546 |Coef|) 
 ((|constructor| (NIL "InnerSparseUnivariatePowerSeries is an internal domain \\indented{2}{used for creating sparse Taylor and Laurent series.}")) (|cAcsch| (($ $) "\\spad{cAcsch(f)} computes the inverse hyperbolic cosecant of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cAsech| (($ $) "\\spad{cAsech(f)} computes the inverse hyperbolic secant of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cAcoth| (($ $) "\\spad{cAcoth(f)} computes the inverse hyperbolic cotangent of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cAtanh| (($ $) "\\spad{cAtanh(f)} computes the inverse hyperbolic tangent of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cAcosh| (($ $) "\\spad{cAcosh(f)} computes the inverse hyperbolic cosine of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cAsinh| (($ $) "\\spad{cAsinh(f)} computes the inverse hyperbolic sine of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cCsch| (($ $) "\\spad{cCsch(f)} computes the hyperbolic cosecant of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cSech| (($ $) "\\spad{cSech(f)} computes the hyperbolic secant of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cCoth| (($ $) "\\spad{cCoth(f)} computes the hyperbolic cotangent of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cTanh| (($ $) "\\spad{cTanh(f)} computes the hyperbolic tangent of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cCosh| (($ $) "\\spad{cCosh(f)} computes the hyperbolic cosine of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cSinh| (($ $) "\\spad{cSinh(f)} computes the hyperbolic sine of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cAcsc| (($ $) "\\spad{cAcsc(f)} computes the arccosecant of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cAsec| (($ $) "\\spad{cAsec(f)} computes the arcsecant of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cAcot| (($ $) "\\spad{cAcot(f)} computes the arccotangent of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cAtan| (($ $) "\\spad{cAtan(f)} computes the arctangent of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cAcos| (($ $) "\\spad{cAcos(f)} computes the arccosine of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cAsin| (($ $) "\\spad{cAsin(f)} computes the arcsine of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cCsc| (($ $) "\\spad{cCsc(f)} computes the cosecant of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cSec| (($ $) "\\spad{cSec(f)} computes the secant of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cCot| (($ $) "\\spad{cCot(f)} computes the cotangent of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cTan| (($ $) "\\spad{cTan(f)} computes the tangent of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cCos| (($ $) "\\spad{cCos(f)} computes the cosine of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cSin| (($ $) "\\spad{cSin(f)} computes the sine of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cLog| (($ $) "\\spad{cLog(f)} computes the logarithm of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cExp| (($ $) "\\spad{cExp(f)} computes the exponential of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cRationalPower| (($ $ (|Fraction| (|Integer|))) "\\spad{cRationalPower(f,{}r)} computes \\spad{f^r}. For use when the coefficient ring is commutative.")) (|cPower| (($ $ |#1|) "\\spad{cPower(f,{}r)} computes \\spad{f^r},{} where \\spad{f} has constant coefficient 1. For use when the coefficient ring is commutative.")) (|integrate| (($ $) "\\spad{integrate(f(x))} returns an anti-derivative of the power series \\spad{f(x)} with constant coefficient 0. Warning: function does not check for a term of degree \\spad{-1}.")) (|seriesToOutputForm| (((|OutputForm|) (|Stream| (|Record| (|:| |k| (|Integer|)) (|:| |c| |#1|))) (|Reference| (|OrderedCompletion| (|Integer|))) (|Symbol|) |#1| (|Fraction| (|Integer|))) "\\spad{seriesToOutputForm(st,{}refer,{}var,{}cen,{}r)} prints the series \\spad{f((var - cen)^r)}.")) (|iCompose| (($ $ $) "\\spad{iCompose(f,{}g)} returns \\spad{f(g(x))}. This is an internal function which should only be called for Taylor series \\spad{f(x)} and \\spad{g(x)} such that the constant coefficient of \\spad{g(x)} is zero.")) (|taylorQuoByVar| (($ $) "\\spad{taylorQuoByVar(a0 + a1 x + a2 x**2 + ...)} returns \\spad{a1 + a2 x + a3 x**2 + ...}")) (|iExquo| (((|Union| $ "failed") $ $ (|Boolean|)) "\\spad{iExquo(f,{}g,{}taylor?)} is the quotient of the power series \\spad{f} and \\spad{g}. If \\spad{taylor?} is \\spad{true},{} then we must have \\spad{order(f) >= order(g)}.")) (|multiplyCoefficients| (($ (|Mapping| |#1| (|Integer|)) $) "\\spad{multiplyCoefficients(fn,{}f)} returns the series \\spad{sum(fn(n) * an * x^n,{}n = n0..)},{} where \\spad{f} is the series \\spad{sum(an * x^n,{}n = n0..)}.")) (|monomial?| (((|Boolean|) $) "\\spad{monomial?(f)} tests if \\spad{f} is a single monomial.")) (|series| (($ (|Stream| (|Record| (|:| |k| (|Integer|)) (|:| |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.")) (|getStream| (((|Stream| (|Record| (|:| |k| (|Integer|)) (|:| |c| |#1|))) $) "\\spad{getStream(f)} returns the stream of terms representing the series \\spad{f}.")) (|getRef| (((|Reference| (|OrderedCompletion| (|Integer|))) $) "\\spad{getRef(f)} returns a reference containing the order to which the terms of \\spad{f} have been computed.")) (|makeSeries| (($ (|Reference| (|OrderedCompletion| (|Integer|))) (|Stream| (|Record| (|:| |k| (|Integer|)) (|:| |c| |#1|)))) "\\spad{makeSeries(refer,{}str)} creates a power series from the reference \\spad{refer} and the stream \\spad{str}."))) 
 (((-4235 "*") |has| |#1| (-157)) (-4226 |has| |#1| (-513)) (-4227 . T) (-4228 . T) (-4230 . T)) 
-((|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-157))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-513)))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-521)) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-521)) (|devaluate| |#1|))))) (|HasCategory| (-521) (QUOTE (-1025))) (|HasCategory| |#1| (QUOTE (-337))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-521))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-521))))) (|HasSignature| |#1| (LIST (QUOTE -2189) (LIST (|devaluate| |#1|) (QUOTE (-1084))))))) 
+((|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-157))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-513)))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-521)) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-521)) (|devaluate| |#1|))))) (|HasCategory| (-521) (QUOTE (-1025))) (|HasCategory| |#1| (QUOTE (-337))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-521))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-521))))) (|HasSignature| |#1| (LIST (QUOTE -2223) (LIST (|devaluate| |#1|) (QUOTE (-1084))))))) 
 (-547 |Coef|) 
 ((|constructor| (NIL "Internal package for dense Taylor series. This is an internal Taylor series type in which Taylor series are represented by a \\spadtype{Stream} of \\spadtype{Ring} elements. For univariate series,{} the \\spad{Stream} elements are the Taylor coefficients. For multivariate series,{} the \\spad{n}th Stream element is a form of degree \\spad{n} in the power series variables.")) (* (($ $ (|Integer|)) "\\spad{x*i} returns the product of integer \\spad{i} and the series \\spad{x}.") (($ $ |#1|) "\\spad{x*c} returns the product of \\spad{c} and the series \\spad{x}.") (($ |#1| $) "\\spad{c*x} returns the product of \\spad{c} and the series \\spad{x}.")) (|order| (((|NonNegativeInteger|) $ (|NonNegativeInteger|)) "\\spad{order(x,{}n)} returns the minimum of \\spad{n} and the order of \\spad{x}.") (((|NonNegativeInteger|) $) "\\spad{order(x)} returns the order of a power series \\spad{x},{} \\indented{1}{\\spadignore{i.e.} the degree of the first non-zero term of the series.}")) (|pole?| (((|Boolean|) $) "\\spad{pole?(x)} tests if the series \\spad{x} has a pole. \\indented{1}{Note: this is \\spad{false} when \\spad{x} is a Taylor series.}")) (|series| (($ (|Stream| |#1|)) "\\spad{series(s)} creates a power series from a stream of \\indented{1}{ring elements.} \\indented{1}{For univariate series types,{} the stream \\spad{s} should be a stream} \\indented{1}{of Taylor coefficients. For multivariate series types,{} the} \\indented{1}{stream \\spad{s} should be a stream of forms the \\spad{n}th element} \\indented{1}{of which is a} \\indented{1}{form of degree \\spad{n} in the power series variables.}")) (|coefficients| (((|Stream| |#1|) $) "\\spad{coefficients(x)} returns a stream of ring elements. \\indented{1}{When \\spad{x} is a univariate series,{} this is a stream of Taylor} \\indented{1}{coefficients. When \\spad{x} is a multivariate series,{} the} \\indented{1}{\\spad{n}th element of the stream is a form of} \\indented{1}{degree \\spad{n} in the power series variables.}"))) 
 ((-4228 |has| |#1| (-513)) (-4227 |has| |#1| (-513)) ((-4235 "*") |has| |#1| (-513)) (-4226 |has| |#1| (-513)) (-4230 . T)) 
@@ -2139,14 +2139,14 @@ NIL
 (-552 R |mn|) 
 ((|constructor| (NIL "\\indented{2}{This type represents vector like objects with varying lengths} and a user-specified initial index."))) 
 ((-4234 . T) (-4233 . T)) 
-((|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| (-521) (QUOTE (-784))) (|HasCategory| |#1| (QUOTE (-1013))) (-3703 (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| |#1| (QUOTE (-1013)))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-663))) (|HasCategory| |#1| (QUOTE (-970))) (-12 (|HasCategory| |#1| (QUOTE (-927))) (|HasCategory| |#1| (QUOTE (-970)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|))))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))))) 
+((|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| (-521) (QUOTE (-783))) (|HasCategory| |#1| (QUOTE (-1013))) (-3703 (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#1| (QUOTE (-1013)))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-663))) (|HasCategory| |#1| (QUOTE (-970))) (-12 (|HasCategory| |#1| (QUOTE (-927))) (|HasCategory| |#1| (QUOTE (-970)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|))))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))))) 
 (-553 S |Index| |Entry|) 
 ((|constructor| (NIL "An indexed aggregate is a many-to-one mapping of indices to entries. For example,{} a one-dimensional-array is an indexed aggregate where the index is an integer. Also,{} a table is an indexed aggregate where the indices and entries may have any type.")) (|swap!| (((|Void|) $ |#2| |#2|) "\\spad{swap!(u,{}i,{}j)} interchanges elements \\spad{i} and \\spad{j} of aggregate \\spad{u}. No meaningful value is returned.")) (|fill!| (($ $ |#3|) "\\spad{fill!(u,{}x)} replaces each entry in aggregate \\spad{u} by \\spad{x}. The modified \\spad{u} is returned as value.")) (|first| ((|#3| $) "\\spad{first(u)} returns the first element \\spad{x} of \\spad{u}. Note: for collections,{} \\axiom{first([\\spad{x},{}\\spad{y},{}...,{}\\spad{z}]) = \\spad{x}}. Error: if \\spad{u} is empty.")) (|minIndex| ((|#2| $) "\\spad{minIndex(u)} returns the minimum index \\spad{i} of aggregate \\spad{u}. Note: in general,{} \\axiom{minIndex(a) = reduce(min,{}[\\spad{i} for \\spad{i} in indices a])}; for lists,{} \\axiom{minIndex(a) = 1}.")) (|maxIndex| ((|#2| $) "\\spad{maxIndex(u)} returns the maximum index \\spad{i} of aggregate \\spad{u}. Note: in general,{} \\axiom{maxIndex(\\spad{u}) = reduce(max,{}[\\spad{i} for \\spad{i} in indices \\spad{u}])}; if \\spad{u} is a list,{} \\axiom{maxIndex(\\spad{u}) = \\#u}.")) (|entry?| (((|Boolean|) |#3| $) "\\spad{entry?(x,{}u)} tests if \\spad{x} equals \\axiom{\\spad{u} . \\spad{i}} for some index \\spad{i}.")) (|indices| (((|List| |#2|) $) "\\spad{indices(u)} returns a list of indices of aggregate \\spad{u} in no particular order.")) (|index?| (((|Boolean|) |#2| $) "\\spad{index?(i,{}u)} tests if \\spad{i} is an index of aggregate \\spad{u}.")) (|entries| (((|List| |#3|) $) "\\spad{entries(u)} returns a list of all the entries of aggregate \\spad{u} in no assumed order."))) 
 NIL 
-((|HasAttribute| |#1| (QUOTE -4234)) (|HasCategory| |#2| (QUOTE (-784))) (|HasAttribute| |#1| (QUOTE -4233)) (|HasCategory| |#3| (QUOTE (-1013)))) 
+((|HasAttribute| |#1| (QUOTE -4234)) (|HasCategory| |#2| (QUOTE (-783))) (|HasAttribute| |#1| (QUOTE -4233)) (|HasCategory| |#3| (QUOTE (-1013)))) 
 (-554 |Index| |Entry|) 
 ((|constructor| (NIL "An indexed aggregate is a many-to-one mapping of indices to entries. For example,{} a one-dimensional-array is an indexed aggregate where the index is an integer. Also,{} a table is an indexed aggregate where the indices and entries may have any type.")) (|swap!| (((|Void|) $ |#1| |#1|) "\\spad{swap!(u,{}i,{}j)} interchanges elements \\spad{i} and \\spad{j} of aggregate \\spad{u}. No meaningful value is returned.")) (|fill!| (($ $ |#2|) "\\spad{fill!(u,{}x)} replaces each entry in aggregate \\spad{u} by \\spad{x}. The modified \\spad{u} is returned as value.")) (|first| ((|#2| $) "\\spad{first(u)} returns the first element \\spad{x} of \\spad{u}. Note: for collections,{} \\axiom{first([\\spad{x},{}\\spad{y},{}...,{}\\spad{z}]) = \\spad{x}}. Error: if \\spad{u} is empty.")) (|minIndex| ((|#1| $) "\\spad{minIndex(u)} returns the minimum index \\spad{i} of aggregate \\spad{u}. Note: in general,{} \\axiom{minIndex(a) = reduce(min,{}[\\spad{i} for \\spad{i} in indices a])}; for lists,{} \\axiom{minIndex(a) = 1}.")) (|maxIndex| ((|#1| $) "\\spad{maxIndex(u)} returns the maximum index \\spad{i} of aggregate \\spad{u}. Note: in general,{} \\axiom{maxIndex(\\spad{u}) = reduce(max,{}[\\spad{i} for \\spad{i} in indices \\spad{u}])}; if \\spad{u} is a list,{} \\axiom{maxIndex(\\spad{u}) = \\#u}.")) (|entry?| (((|Boolean|) |#2| $) "\\spad{entry?(x,{}u)} tests if \\spad{x} equals \\axiom{\\spad{u} . \\spad{i}} for some index \\spad{i}.")) (|indices| (((|List| |#1|) $) "\\spad{indices(u)} returns a list of indices of aggregate \\spad{u} in no particular order.")) (|index?| (((|Boolean|) |#1| $) "\\spad{index?(i,{}u)} tests if \\spad{i} is an index of aggregate \\spad{u}.")) (|entries| (((|List| |#2|) $) "\\spad{entries(u)} returns a list of all the entries of aggregate \\spad{u} in no assumed order."))) 
-((-2046 . T)) 
+((-2092 . T)) 
 NIL 
 (-555 R A) 
 ((|constructor| (NIL "\\indented{1}{AssociatedJordanAlgebra takes an algebra \\spad{A} and uses \\spadfun{*\\$A}} \\indented{1}{to define the new multiplications \\spad{a*b := (a *\\$A b + b *\\$A a)/2}} \\indented{1}{(anticommutator).} \\indented{1}{The usual notation \\spad{{a,{}b}_+} cannot be used due to} \\indented{1}{restrictions in the current language.} \\indented{1}{This domain only gives a Jordan algebra if the} \\indented{1}{Jordan-identity \\spad{(a*b)*c + (b*c)*a + (c*a)*b = 0} holds} \\indented{1}{for all \\spad{a},{}\\spad{b},{}\\spad{c} in \\spad{A}.} \\indented{1}{This relation can be checked by} \\indented{1}{\\spadfun{jordanAdmissible?()\\$A}.} \\blankline If the underlying algebra is of type \\spadtype{FramedNonAssociativeAlgebra(R)} (\\spadignore{i.e.} a non associative algebra over \\spad{R} which is a free \\spad{R}-module of finite rank,{} together with a fixed \\spad{R}-module basis),{} then the same is \\spad{true} for the associated Jordan algebra. Moreover,{} if the underlying algebra is of type \\spadtype{FiniteRankNonAssociativeAlgebra(R)} (\\spadignore{i.e.} a non associative algebra over \\spad{R} which is a free \\spad{R}-module of finite rank),{} then the same \\spad{true} for the associated Jordan algebra.")) (|coerce| (($ |#2|) "\\spad{coerce(a)} coerces the element \\spad{a} of the algebra \\spad{A} to an element of the Jordan algebra \\spadtype{AssociatedJordanAlgebra}(\\spad{R},{}A)."))) 
@@ -2155,14 +2155,14 @@ NIL
 (-556 |Entry|) 
 ((|constructor| (NIL "This domain allows a random access file to be viewed both as a table and as a file object.")) (|pack!| (($ $) "\\spad{pack!(f)} reorganizes the file \\spad{f} on disk to recover unused space."))) 
 ((-4233 . T) (-4234 . T)) 
-((|HasCategory| (-2 (|:| -2529 (-1067)) (|:| -3045 |#1|)) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (QUOTE (-1013))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| (-1067) (QUOTE (-784))) (|HasCategory| (-2 (|:| -2529 (-1067)) (|:| -3045 |#1|)) (QUOTE (-1013))) (-12 (|HasCategory| (-2 (|:| -2529 (-1067)) (|:| -3045 |#1|)) (QUOTE (-1013))) (|HasCategory| (-2 (|:| -2529 (-1067)) (|:| -3045 |#1|)) (LIST (QUOTE -284) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2529) (QUOTE (-1067))) (LIST (QUOTE |:|) (QUOTE -3045) (|devaluate| |#1|)))))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))) (|HasCategory| (-2 (|:| -2529 (-1067)) (|:| -3045 |#1|)) (LIST (QUOTE -561) (QUOTE (-792))))) 
+((|HasCategory| (-2 (|:| -2535 (-1067)) (|:| -3050 |#1|)) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (QUOTE (-1013))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| (-1067) (QUOTE (-783))) (|HasCategory| (-2 (|:| -2535 (-1067)) (|:| -3050 |#1|)) (QUOTE (-1013))) (-12 (|HasCategory| (-2 (|:| -2535 (-1067)) (|:| -3050 |#1|)) (QUOTE (-1013))) (|HasCategory| (-2 (|:| -2535 (-1067)) (|:| -3050 |#1|)) (LIST (QUOTE -284) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2535) (QUOTE (-1067))) (LIST (QUOTE |:|) (QUOTE -3050) (|devaluate| |#1|)))))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))) (|HasCategory| (-2 (|:| -2535 (-1067)) (|:| -3050 |#1|)) (LIST (QUOTE -561) (QUOTE (-791))))) 
 (-557 S |Key| |Entry|) 
 ((|constructor| (NIL "A keyed dictionary is a dictionary of key-entry pairs for which there is a unique entry for each key.")) (|search| (((|Union| |#3| "failed") |#2| $) "\\spad{search(k,{}t)} searches the table \\spad{t} for the key \\spad{k},{} returning the entry stored in \\spad{t} for key \\spad{k}. If \\spad{t} has no such key,{} \\axiom{search(\\spad{k},{}\\spad{t})} returns \"failed\".")) (|remove!| (((|Union| |#3| "failed") |#2| $) "\\spad{remove!(k,{}t)} searches the table \\spad{t} for the key \\spad{k} removing (and return) the entry if there. If \\spad{t} has no such key,{} \\axiom{remove!(\\spad{k},{}\\spad{t})} returns \"failed\".")) (|keys| (((|List| |#2|) $) "\\spad{keys(t)} returns the list the keys in table \\spad{t}.")) (|key?| (((|Boolean|) |#2| $) "\\spad{key?(k,{}t)} tests if \\spad{k} is a key in table \\spad{t}."))) 
 NIL 
 NIL 
 (-558 |Key| |Entry|) 
 ((|constructor| (NIL "A keyed dictionary is a dictionary of key-entry pairs for which there is a unique entry for each key.")) (|search| (((|Union| |#2| "failed") |#1| $) "\\spad{search(k,{}t)} searches the table \\spad{t} for the key \\spad{k},{} returning the entry stored in \\spad{t} for key \\spad{k}. If \\spad{t} has no such key,{} \\axiom{search(\\spad{k},{}\\spad{t})} returns \"failed\".")) (|remove!| (((|Union| |#2| "failed") |#1| $) "\\spad{remove!(k,{}t)} searches the table \\spad{t} for the key \\spad{k} removing (and return) the entry if there. If \\spad{t} has no such key,{} \\axiom{remove!(\\spad{k},{}\\spad{t})} returns \"failed\".")) (|keys| (((|List| |#1|) $) "\\spad{keys(t)} returns the list the keys in table \\spad{t}.")) (|key?| (((|Boolean|) |#1| $) "\\spad{key?(k,{}t)} tests if \\spad{k} is a key in table \\spad{t}."))) 
-((-4234 . T) (-2046 . T)) 
+((-4234 . T) (-2092 . T)) 
 NIL 
 (-559 R S) 
 ((|constructor| (NIL "This package exports some auxiliary functions on kernels")) (|constantIfCan| (((|Union| |#1| "failed") (|Kernel| |#2|)) "\\spad{constantIfCan(k)} \\undocumented")) (|constantKernel| (((|Kernel| |#2|) |#1|) "\\spad{constantKernel(r)} \\undocumented"))) 
@@ -2171,7 +2171,7 @@ NIL
 (-560 S) 
 ((|constructor| (NIL "A kernel over a set \\spad{S} is an operator applied to a given list of arguments from \\spad{S}.")) (|is?| (((|Boolean|) $ (|Symbol|)) "\\spad{is?(op(a1,{}...,{}an),{} s)} tests if the name of op is \\spad{s}.") (((|Boolean|) $ (|BasicOperator|)) "\\spad{is?(op(a1,{}...,{}an),{} f)} tests if op = \\spad{f}.")) (|symbolIfCan| (((|Union| (|Symbol|) "failed") $) "\\spad{symbolIfCan(k)} returns \\spad{k} viewed as a symbol if \\spad{k} is a symbol,{} and \"failed\" otherwise.")) (|kernel| (($ (|Symbol|)) "\\spad{kernel(x)} returns \\spad{x} viewed as a kernel.") (($ (|BasicOperator|) (|List| |#1|) (|NonNegativeInteger|)) "\\spad{kernel(op,{} [a1,{}...,{}an],{} m)} returns the kernel \\spad{op(a1,{}...,{}an)} of nesting level \\spad{m}. Error: if \\spad{op} is \\spad{k}-ary for some \\spad{k} not equal to \\spad{m}.")) (|height| (((|NonNegativeInteger|) $) "\\spad{height(k)} returns the nesting level of \\spad{k}.")) (|argument| (((|List| |#1|) $) "\\spad{argument(op(a1,{}...,{}an))} returns \\spad{[a1,{}...,{}an]}.")) (|operator| (((|BasicOperator|) $) "\\spad{operator(op(a1,{}...,{}an))} returns the operator op.")) (|name| (((|Symbol|) $) "\\spad{name(op(a1,{}...,{}an))} returns the name of op."))) 
 NIL 
-((|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-353))))) (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521)))))) 
+((|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-353))))) (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521)))))) 
 (-561 S) 
 ((|constructor| (NIL "A is coercible to \\spad{B} means any element of A can automatically be converted into an element of \\spad{B} by the interpreter.")) (|coerce| ((|#1| $) "\\spad{coerce(a)} transforms a into an element of \\spad{S}."))) 
 NIL 
@@ -2195,7 +2195,7 @@ NIL
 (-566 A R S) 
 ((|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}."))) 
 ((-4227 . T) (-4228 . T) (-4230 . T)) 
-((|HasCategory| |#1| (QUOTE (-782)))) 
+((|HasCategory| |#1| (QUOTE (-781)))) 
 (-567 R -4049) 
 ((|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 
@@ -2203,7 +2203,7 @@ NIL
 (-568 R UP) 
 ((|constructor| (NIL "\\indented{1}{Univariate polynomials with negative and positive exponents.} Author: Manuel Bronstein Date Created: May 1988 Date Last Updated: 26 Apr 1990")) (|separate| (((|Record| (|:| |polyPart| $) (|:| |fracPart| (|Fraction| |#2|))) (|Fraction| |#2|)) "\\spad{separate(x)} \\undocumented")) (|monomial| (($ |#1| (|Integer|)) "\\spad{monomial(x,{}n)} \\undocumented")) (|coefficient| ((|#1| $ (|Integer|)) "\\spad{coefficient(x,{}n)} \\undocumented")) (|trailingCoefficient| ((|#1| $) "\\spad{trailingCoefficient }\\undocumented")) (|leadingCoefficient| ((|#1| $) "\\spad{leadingCoefficient }\\undocumented")) (|reductum| (($ $) "\\spad{reductum(x)} \\undocumented")) (|order| (((|Integer|) $) "\\spad{order(x)} \\undocumented")) (|degree| (((|Integer|) $) "\\spad{degree(x)} \\undocumented")) (|monomial?| (((|Boolean|) $) "\\spad{monomial?(x)} \\undocumented"))) 
 ((-4228 . T) (-4227 . T) ((-4235 "*") . T) (-4226 . T) (-4230 . T)) 
-((|HasCategory| |#2| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521))))) 
+((|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521))))) 
 (-569 R E V P TS ST) 
 ((|constructor| (NIL "A package for solving polynomial systems by means of Lazard triangular sets [1]. This package provides two operations. One for solving in the sense of the regular zeros,{} and the other for solving in the sense of the Zariski closure. Both produce square-free regular sets. Moreover,{} the decompositions do not contain any redundant component. However,{} only zero-dimensional regular sets are normalized,{} since normalization may be time consumming in positive dimension. The decomposition process is that of [2].\\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 \"A new algorithm for computing triangular} \\indented{5}{decomposition of algebraic varieties\" NAG Tech. Rep. 4/98.}")) (|zeroSetSplit| (((|List| |#6|) (|List| |#4|) (|Boolean|)) "\\axiom{zeroSetSplit(\\spad{lp},{}clos?)} has the same specifications as \\axiomOpFrom{zeroSetSplit(\\spad{lp},{}clos?)}{RegularTriangularSetCategory}.")) (|normalizeIfCan| ((|#6| |#6|) "\\axiom{normalizeIfCan(\\spad{ts})} returns \\axiom{\\spad{ts}} in an normalized shape if \\axiom{\\spad{ts}} is zero-dimensional."))) 
 NIL 
@@ -2235,7 +2235,7 @@ NIL
 (-576) 
 ((|constructor| (NIL "This domain provides a simple way to save values in files.")) (|setelt| (((|Any|) $ (|Symbol|) (|Any|)) "\\spad{lib.k := v} saves the value \\spad{v} in the library \\spad{lib}. It can later be extracted using the key \\spad{k}.")) (|elt| (((|Any|) $ (|Symbol|)) "\\spad{elt(lib,{}k)} or \\spad{lib}.\\spad{k} extracts the value corresponding to the key \\spad{k} from the library \\spad{lib}.")) (|pack!| (($ $) "\\spad{pack!(f)} reorganizes the file \\spad{f} on disk to recover unused space.")) (|library| (($ (|FileName|)) "\\spad{library(ln)} creates a new library file."))) 
 ((-4234 . T)) 
-((|HasCategory| (-2 (|:| -2529 (-1067)) (|:| -3045 (-51))) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| (-1067) (QUOTE (-784))) (|HasCategory| (-51) (LIST (QUOTE -561) (QUOTE (-792)))) (|HasCategory| (-51) (QUOTE (-1013))) (-12 (|HasCategory| (-51) (QUOTE (-1013))) (|HasCategory| (-51) (LIST (QUOTE -284) (QUOTE (-51))))) (|HasCategory| (-2 (|:| -2529 (-1067)) (|:| -3045 (-51))) (QUOTE (-1013))) (-12 (|HasCategory| (-2 (|:| -2529 (-1067)) (|:| -3045 (-51))) (QUOTE (-1013))) (|HasCategory| (-2 (|:| -2529 (-1067)) (|:| -3045 (-51))) (LIST (QUOTE -284) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2529) (QUOTE (-1067))) (LIST (QUOTE |:|) (QUOTE -3045) (QUOTE (-51))))))) (-3703 (|HasCategory| (-2 (|:| -2529 (-1067)) (|:| -3045 (-51))) (QUOTE (-1013))) (|HasCategory| (-51) (QUOTE (-1013)))) (|HasCategory| (-2 (|:| -2529 (-1067)) (|:| -3045 (-51))) (LIST (QUOTE -561) (QUOTE (-792)))) (-3703 (|HasCategory| (-2 (|:| -2529 (-1067)) (|:| -3045 (-51))) (QUOTE (-1013))) (|HasCategory| (-2 (|:| -2529 (-1067)) (|:| -3045 (-51))) (LIST (QUOTE -561) (QUOTE (-792)))) (|HasCategory| (-51) (QUOTE (-1013))) (|HasCategory| (-51) (LIST (QUOTE -561) (QUOTE (-792))))) (-3703 (|HasCategory| (-2 (|:| -2529 (-1067)) (|:| -3045 (-51))) (LIST (QUOTE -561) (QUOTE (-792)))) (|HasCategory| (-51) (LIST (QUOTE -561) (QUOTE (-792)))))) 
+((|HasCategory| (-2 (|:| -2535 (-1067)) (|:| -3050 (-51))) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| (-1067) (QUOTE (-783))) (|HasCategory| (-51) (LIST (QUOTE -561) (QUOTE (-791)))) (|HasCategory| (-51) (QUOTE (-1013))) (-12 (|HasCategory| (-51) (QUOTE (-1013))) (|HasCategory| (-51) (LIST (QUOTE -284) (QUOTE (-51))))) (|HasCategory| (-2 (|:| -2535 (-1067)) (|:| -3050 (-51))) (QUOTE (-1013))) (-12 (|HasCategory| (-2 (|:| -2535 (-1067)) (|:| -3050 (-51))) (QUOTE (-1013))) (|HasCategory| (-2 (|:| -2535 (-1067)) (|:| -3050 (-51))) (LIST (QUOTE -284) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2535) (QUOTE (-1067))) (LIST (QUOTE |:|) (QUOTE -3050) (QUOTE (-51))))))) (-3703 (|HasCategory| (-2 (|:| -2535 (-1067)) (|:| -3050 (-51))) (QUOTE (-1013))) (|HasCategory| (-51) (QUOTE (-1013)))) (|HasCategory| (-2 (|:| -2535 (-1067)) (|:| -3050 (-51))) (LIST (QUOTE -561) (QUOTE (-791)))) (-3703 (|HasCategory| (-2 (|:| -2535 (-1067)) (|:| -3050 (-51))) (QUOTE (-1013))) (|HasCategory| (-2 (|:| -2535 (-1067)) (|:| -3050 (-51))) (LIST (QUOTE -561) (QUOTE (-791)))) (|HasCategory| (-51) (QUOTE (-1013))) (|HasCategory| (-51) (LIST (QUOTE -561) (QUOTE (-791))))) (-3703 (|HasCategory| (-2 (|:| -2535 (-1067)) (|:| -3050 (-51))) (LIST (QUOTE -561) (QUOTE (-791)))) (|HasCategory| (-51) (LIST (QUOTE -561) (QUOTE (-791)))))) 
 (-577 S R) 
 ((|constructor| (NIL "\\axiom{JacobiIdentity} means that \\axiom{[\\spad{x},{}[\\spad{y},{}\\spad{z}]]+[\\spad{y},{}[\\spad{z},{}\\spad{x}]]+[\\spad{z},{}[\\spad{x},{}\\spad{y}]] = 0} holds.")) (/ (($ $ |#2|) "\\axiom{\\spad{x/r}} returns the division of \\axiom{\\spad{x}} by \\axiom{\\spad{r}}.")) (|construct| (($ $ $) "\\axiom{construct(\\spad{x},{}\\spad{y})} returns the Lie bracket of \\axiom{\\spad{x}} and \\axiom{\\spad{y}}."))) 
 NIL 
@@ -2259,7 +2259,7 @@ NIL
 (-582 S R) 
 ((|constructor| (NIL "Test for linear dependence.")) (|solveLinear| (((|Union| (|Vector| (|Fraction| |#1|)) "failed") (|Vector| |#2|) |#2|) "\\spad{solveLinear([v1,{}...,{}vn],{} u)} returns \\spad{[c1,{}...,{}cn]} such that \\spad{c1*v1 + ... + cn*vn = u},{} \"failed\" if no such \\spad{ci}\\spad{'s} exist in the quotient field of \\spad{S}.") (((|Union| (|Vector| |#1|) "failed") (|Vector| |#2|) |#2|) "\\spad{solveLinear([v1,{}...,{}vn],{} u)} returns \\spad{[c1,{}...,{}cn]} such that \\spad{c1*v1 + ... + cn*vn = u},{} \"failed\" if no such \\spad{ci}\\spad{'s} exist in \\spad{S}.")) (|linearDependence| (((|Union| (|Vector| |#1|) "failed") (|Vector| |#2|)) "\\spad{linearDependence([v1,{}...,{}vn])} returns \\spad{[c1,{}...,{}cn]} if \\spad{c1*v1 + ... + cn*vn = 0} and not all the \\spad{ci}\\spad{'s} are 0,{} \"failed\" if the \\spad{vi}\\spad{'s} are linearly independent over \\spad{S}.")) (|linearlyDependent?| (((|Boolean|) (|Vector| |#2|)) "\\spad{linearlyDependent?([v1,{}...,{}vn])} returns \\spad{true} if the \\spad{vi}\\spad{'s} are linearly dependent over \\spad{S},{} \\spad{false} otherwise."))) 
 NIL 
-((|HasCategory| |#1| (QUOTE (-337))) (-2400 (|HasCategory| |#1| (QUOTE (-337))))) 
+((|HasCategory| |#1| (QUOTE (-337))) (-2416 (|HasCategory| |#1| (QUOTE (-337))))) 
 (-583 R) 
 ((|constructor| (NIL "An extension ring with an explicit linear dependence test.")) (|reducedSystem| (((|Record| (|:| |mat| (|Matrix| |#1|)) (|:| |vec| (|Vector| |#1|))) (|Matrix| $) (|Vector| $)) "\\spad{reducedSystem(A,{} v)} returns a matrix \\spad{B} and a vector \\spad{w} such that \\spad{A x = v} and \\spad{B x = w} have the same solutions in \\spad{R}.") (((|Matrix| |#1|) (|Matrix| $)) "\\spad{reducedSystem(A)} returns a matrix \\spad{B} such that \\spad{A x = 0} and \\spad{B x = 0} have the same solutions in \\spad{R}."))) 
 ((-4230 . T)) 
@@ -2279,11 +2279,11 @@ NIL
 (-587 S) 
 ((|constructor| (NIL "\\spadtype{List} implements singly-linked lists that are addressable by indices; the index of the first element is 1. In addition to the operations provided by \\spadtype{IndexedList},{} this constructor provides some LISP-like functions such as \\spadfun{null} and \\spadfun{cons}.")) (|setDifference| (($ $ $) "\\spad{setDifference(u1,{}u2)} returns a list of the elements of \\spad{u1} that are not also in \\spad{u2}. The order of elements in the resulting list is unspecified.")) (|setIntersection| (($ $ $) "\\spad{setIntersection(u1,{}u2)} returns a list of the elements that lists \\spad{u1} and \\spad{u2} have in common. The order of elements in the resulting list is unspecified.")) (|setUnion| (($ $ $) "\\spad{setUnion(u1,{}u2)} appends the two lists \\spad{u1} and \\spad{u2},{} then removes all duplicates. The order of elements in the resulting list is unspecified.")) (|append| (($ $ $) "\\spad{append(u1,{}u2)} appends the elements of list \\spad{u1} onto the front of list \\spad{u2}. This new list and \\spad{u2} will share some structure.")) (|cons| (($ |#1| $) "\\spad{cons(element,{}u)} appends \\spad{element} onto the front of list \\spad{u} and returns the new list. This new list and the old one will share some structure.")) (|null| (((|Boolean|) $) "\\spad{null(u)} tests if list \\spad{u} is the empty list.")) (|nil| (($) "\\spad{nil()} returns the empty list."))) 
 ((-4234 . T) (-4233 . T)) 
-((|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| |#1| (QUOTE (-765))) (|HasCategory| (-521) (QUOTE (-784))) (|HasCategory| |#1| (QUOTE (-1013))) (-3703 (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| |#1| (QUOTE (-1013)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|))))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))))) 
+((|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#1| (QUOTE (-764))) (|HasCategory| (-521) (QUOTE (-783))) (|HasCategory| |#1| (QUOTE (-1013))) (-3703 (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#1| (QUOTE (-1013)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|))))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))))) 
 (-588 S) 
 ((|substitute| (($ |#1| |#1| $) "\\spad{substitute(x,{}y,{}d)} replace \\spad{x}\\spad{'s} with \\spad{y}\\spad{'s} in dictionary \\spad{d}.")) (|duplicates?| (((|Boolean|) $) "\\spad{duplicates?(d)} tests if dictionary \\spad{d} has duplicate entries."))) 
 ((-4233 . T) (-4234 . T)) 
-((|HasCategory| |#1| (QUOTE (-1013))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))))) 
+((|HasCategory| |#1| (QUOTE (-1013))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))))) 
 (-589 R) 
 ((|constructor| (NIL "The category of left modules over an \\spad{rng} (ring not necessarily with unit). This is an abelian group which supports left multiplation by elements of the \\spad{rng}. \\blankline")) (* (($ |#1| $) "\\spad{r*x} returns the left multiplication of the module element \\spad{x} by the ring element \\spad{r}."))) 
 NIL 
@@ -2298,7 +2298,7 @@ NIL
 ((|HasAttribute| |#1| (QUOTE -4234))) 
 (-592 S) 
 ((|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})}."))) 
-((-2046 . T)) 
+((-2092 . T)) 
 NIL 
 (-593 R -4049 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."))) 
@@ -2324,7 +2324,7 @@ NIL
 ((|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)))) 
-(-599 A -3838) 
+(-599 A -3274) 
 ((|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}}"))) 
 ((-4227 . T) (-4228 . T) (-4230 . T)) 
 ((|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-337)))) 
@@ -2358,7 +2358,7 @@ NIL
 NIL 
 (-607 S) 
 ((|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}."))) 
-((-4234 . T) (-4233 . T) (-2046 . T)) 
+((-4234 . T) (-4233 . T) (-2092 . T)) 
 NIL 
 (-608 -4049) 
 ((|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}."))) 
@@ -2375,7 +2375,7 @@ NIL
 (-611 |n| R) 
 ((|constructor| (NIL "LieSquareMatrix(\\spad{n},{}\\spad{R}) implements the Lie algebra of the \\spad{n} by \\spad{n} matrices over the commutative ring \\spad{R}. The Lie bracket (commutator) of the algebra is given by \\spad{a*b := (a *\\$SQMATRIX(n,{}R) b - b *\\$SQMATRIX(n,{}R) a)},{} where \\spadfun{*\\$SQMATRIX(\\spad{n},{}\\spad{R})} is the usual matrix multiplication."))) 
 ((-4230 . T) (-4233 . T) (-4227 . T) (-4228 . T)) 
-((|HasCategory| |#2| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-210))) (|HasAttribute| |#2| (QUOTE (-4235 "*"))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#2| (QUOTE (-282))) (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-513))) (-3703 (|HasAttribute| |#2| (QUOTE (-4235 "*"))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-210)))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-3703 (-12 (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -829) (QUOTE (-1084)))))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-792)))) (|HasCategory| |#2| (QUOTE (-157)))) 
+((|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-210))) (|HasAttribute| |#2| (QUOTE (-4235 "*"))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#2| (QUOTE (-282))) (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-513))) (-3703 (|HasAttribute| |#2| (QUOTE (-4235 "*"))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-210)))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-3703 (-12 (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1084)))))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-791)))) (|HasCategory| |#2| (QUOTE (-157)))) 
 (-612 |VarSet|) 
 ((|constructor| (NIL "Lyndon words over arbitrary (ordered) symbols: see Free Lie Algebras by \\spad{C}. Reutenauer (Oxford science publications). A Lyndon word is a word which is smaller than any of its right factors \\spad{w}.\\spad{r}.\\spad{t}. the pure lexicographical ordering. If \\axiom{a} and \\axiom{\\spad{b}} are two Lyndon words such that \\axiom{a < \\spad{b}} holds \\spad{w}.\\spad{r}.\\spad{t} lexicographical ordering then \\axiom{a*b} is a Lyndon word. Parenthesized Lyndon words can be generated from symbols by using the following rule: \\axiom{[[a,{}\\spad{b}],{}\\spad{c}]} is a Lyndon word iff \\axiom{a*b < \\spad{c} \\spad{<=} \\spad{b}} holds. Lyndon words are internally represented by binary trees using the \\spadtype{Magma} domain constructor. Two ordering are provided: lexicographic and length-lexicographic. \\newline Author : Michel Petitot (petitot@lifl.\\spad{fr}).")) (|LyndonWordsList| (((|List| $) (|List| |#1|) (|PositiveInteger|)) "\\axiom{LyndonWordsList(\\spad{vl},{} \\spad{n})} returns the list of Lyndon words over the alphabet \\axiom{\\spad{vl}},{} up to order \\axiom{\\spad{n}}.")) (|LyndonWordsList1| (((|OneDimensionalArray| (|List| $)) (|List| |#1|) (|PositiveInteger|)) "\\axiom{LyndonWordsList1(\\spad{vl},{} \\spad{n})} returns an array of lists of Lyndon words over the alphabet \\axiom{\\spad{vl}},{} up to order \\axiom{\\spad{n}}.")) (|varList| (((|List| |#1|) $) "\\axiom{varList(\\spad{x})} returns the list of distinct entries of \\axiom{\\spad{x}}.")) (|lyndonIfCan| (((|Union| $ "failed") (|OrderedFreeMonoid| |#1|)) "\\axiom{lyndonIfCan(\\spad{w})} convert \\axiom{\\spad{w}} into a Lyndon word.")) (|lyndon| (($ (|OrderedFreeMonoid| |#1|)) "\\axiom{lyndon(\\spad{w})} convert \\axiom{\\spad{w}} into a Lyndon word,{} error if \\axiom{\\spad{w}} is not a Lyndon word.")) (|lyndon?| (((|Boolean|) (|OrderedFreeMonoid| |#1|)) "\\axiom{lyndon?(\\spad{w})} test if \\axiom{\\spad{w}} is a Lyndon word.")) (|factor| (((|List| $) (|OrderedFreeMonoid| |#1|)) "\\axiom{factor(\\spad{x})} returns the decreasing factorization into Lyndon words.")) (|coerce| (((|Magma| |#1|) $) "\\axiom{coerce(\\spad{x})} returns the element of \\axiomType{Magma}(VarSet) corresponding to \\axiom{\\spad{x}}.") (((|OrderedFreeMonoid| |#1|) $) "\\axiom{coerce(\\spad{x})} returns the element of \\axiomType{OrderedFreeMonoid}(VarSet) corresponding to \\axiom{\\spad{x}}.")) (|lexico| (((|Boolean|) $ $) "\\axiom{lexico(\\spad{x},{}\\spad{y})} returns \\axiom{\\spad{true}} iff \\axiom{\\spad{x}} is smaller than \\axiom{\\spad{y}} \\spad{w}.\\spad{r}.\\spad{t}. the lexicographical ordering induced by \\axiom{VarSet}.")) (|length| (((|PositiveInteger|) $) "\\axiom{length(\\spad{x})} returns the number of entries in \\axiom{\\spad{x}}.")) (|right| (($ $) "\\axiom{right(\\spad{x})} returns right subtree of \\axiom{\\spad{x}} or error if \\axiomOpFrom{retractable?}{LyndonWord}(\\axiom{\\spad{x}}) is \\spad{true}.")) (|left| (($ $) "\\axiom{left(\\spad{x})} returns left subtree of \\axiom{\\spad{x}} or error if \\axiomOpFrom{retractable?}{LyndonWord}(\\axiom{\\spad{x}}) is \\spad{true}.")) (|retractable?| (((|Boolean|) $) "\\axiom{retractable?(\\spad{x})} tests if \\axiom{\\spad{x}} is a tree with only one entry."))) 
 NIL 
@@ -2386,12 +2386,12 @@ NIL
 NIL 
 (-614 S) 
 ((|constructor| (NIL "LazyStreamAggregate is the category of streams with lazy evaluation. It is understood that the function 'empty?' will cause lazy evaluation if necessary to determine if there are entries. Functions which call 'empty?',{} \\spadignore{e.g.} 'first' and 'rest',{} will also cause lazy evaluation if necessary.")) (|complete| (($ $) "\\spad{complete(st)} causes all entries of 'st' to be computed. this function should only be called on streams which are known to be finite.")) (|extend| (($ $ (|Integer|)) "\\spad{extend(st,{}n)} causes entries to be computed,{} if necessary,{} so that 'st' will have at least \\spad{'n'} explicit entries or so that all entries of 'st' will be computed if 'st' is finite with length \\spad{<=} \\spad{n}.")) (|numberOfComputedEntries| (((|NonNegativeInteger|) $) "\\spad{numberOfComputedEntries(st)} returns the number of explicitly computed entries of stream \\spad{st} which exist immediately prior to the time this function is called.")) (|rst| (($ $) "\\spad{rst(s)} returns a pointer to the next node of stream \\spad{s}. Caution: this function should only be called after a \\spad{empty?} test has been made since there no error check.")) (|frst| ((|#1| $) "\\spad{frst(s)} returns the first element of stream \\spad{s}. Caution: this function should only be called after a \\spad{empty?} test has been made since there no error check.")) (|lazyEvaluate| (($ $) "\\spad{lazyEvaluate(s)} causes one lazy evaluation of stream \\spad{s}. Caution: the first node must be a lazy evaluation mechanism (satisfies \\spad{lazy?(s) = true}) as there is no error check. Note: a call to this function may or may not produce an explicit first entry")) (|lazy?| (((|Boolean|) $) "\\spad{lazy?(s)} returns \\spad{true} if the first node of the stream \\spad{s} is a lazy evaluation mechanism which could produce an additional entry to \\spad{s}.")) (|explicitlyEmpty?| (((|Boolean|) $) "\\spad{explicitlyEmpty?(s)} returns \\spad{true} if the stream is an (explicitly) empty stream. Note: this is a null test which will not cause lazy evaluation.")) (|explicitEntries?| (((|Boolean|) $) "\\spad{explicitEntries?(s)} returns \\spad{true} if the stream \\spad{s} has explicitly computed entries,{} and \\spad{false} otherwise.")) (|select| (($ (|Mapping| (|Boolean|) |#1|) $) "\\spad{select(f,{}st)} returns a stream consisting of those elements of stream \\spad{st} satisfying the predicate \\spad{f}. Note: \\spad{select(f,{}st) = [x for x in st | f(x)]}.")) (|remove| (($ (|Mapping| (|Boolean|) |#1|) $) "\\spad{remove(f,{}st)} returns a stream consisting of those elements of stream \\spad{st} which do not satisfy the predicate \\spad{f}. Note: \\spad{remove(f,{}st) = [x for x in st | not f(x)]}."))) 
-((-2046 . T)) 
+((-2092 . T)) 
 NIL 
 (-615 R) 
 ((|constructor| (NIL "This domain represents three dimensional matrices over a general object type")) (|matrixDimensions| (((|Vector| (|NonNegativeInteger|)) $) "\\spad{matrixDimensions(x)} returns the dimensions of a matrix")) (|matrixConcat3D| (($ (|Symbol|) $ $) "\\spad{matrixConcat3D(s,{}x,{}y)} concatenates two 3-\\spad{D} matrices along a specified axis")) (|coerce| (((|PrimitiveArray| (|PrimitiveArray| (|PrimitiveArray| |#1|))) $) "\\spad{coerce(x)} moves from the domain to the representation type") (($ (|PrimitiveArray| (|PrimitiveArray| (|PrimitiveArray| |#1|)))) "\\spad{coerce(p)} moves from the representation type (PrimitiveArray PrimitiveArray PrimitiveArray \\spad{R}) to the domain")) (|setelt!| ((|#1| $ (|NonNegativeInteger|) (|NonNegativeInteger|) (|NonNegativeInteger|) |#1|) "\\spad{setelt!(x,{}i,{}j,{}k,{}s)} (or \\spad{x}.\\spad{i}.\\spad{j}.k:=s) sets a specific element of the array to some value of type \\spad{R}")) (|elt| ((|#1| $ (|NonNegativeInteger|) (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{elt(x,{}i,{}j,{}k)} extract an element from the matrix \\spad{x}")) (|construct| (($ (|List| (|List| (|List| |#1|)))) "\\spad{construct(lll)} creates a 3-\\spad{D} matrix from a List List List \\spad{R} \\spad{lll}")) (|plus| (($ $ $) "\\spad{plus(x,{}y)} adds two matrices,{} term by term we note that they must be the same size")) (|identityMatrix| (($ (|NonNegativeInteger|)) "\\spad{identityMatrix(n)} create an identity matrix we note that this must be square")) (|zeroMatrix| (($ (|NonNegativeInteger|) (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{zeroMatrix(i,{}j,{}k)} create a matrix with all zero terms"))) 
 NIL 
-((|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (QUOTE (-970))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-970))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|))))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))))) 
+((|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (QUOTE (-970))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-970))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|))))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))))) 
 (-616 |VarSet|) 
 ((|constructor| (NIL "This type is the basic representation of parenthesized words (binary trees over arbitrary symbols) useful in \\spadtype{LiePolynomial}. \\newline Author: Michel Petitot (petitot@lifl.\\spad{fr}).")) (|varList| (((|List| |#1|) $) "\\axiom{varList(\\spad{x})} returns the list of distinct entries of \\axiom{\\spad{x}}.")) (|right| (($ $) "\\axiom{right(\\spad{x})} returns right subtree of \\axiom{\\spad{x}} or error if \\axiomOpFrom{retractable?}{Magma}(\\axiom{\\spad{x}}) is \\spad{true}.")) (|retractable?| (((|Boolean|) $) "\\axiom{retractable?(\\spad{x})} tests if \\axiom{\\spad{x}} is a tree with only one entry.")) (|rest| (($ $) "\\axiom{rest(\\spad{x})} return \\axiom{\\spad{x}} without the first entry or error if \\axiomOpFrom{retractable?}{Magma}(\\axiom{\\spad{x}}) is \\spad{true}.")) (|mirror| (($ $) "\\axiom{mirror(\\spad{x})} returns the reversed word of \\axiom{\\spad{x}}. That is \\axiom{\\spad{x}} itself if \\axiomOpFrom{retractable?}{Magma}(\\axiom{\\spad{x}}) is \\spad{true} and \\axiom{mirror(\\spad{z}) * mirror(\\spad{y})} if \\axiom{\\spad{x}} is \\axiom{\\spad{y*z}}.")) (|lexico| (((|Boolean|) $ $) "\\axiom{lexico(\\spad{x},{}\\spad{y})} returns \\axiom{\\spad{true}} iff \\axiom{\\spad{x}} is smaller than \\axiom{\\spad{y}} \\spad{w}.\\spad{r}.\\spad{t}. the lexicographical ordering induced by \\axiom{VarSet}. \\spad{N}.\\spad{B}. This operation does not take into account the tree structure of its arguments. Thus this is not a total ordering.")) (|length| (((|PositiveInteger|) $) "\\axiom{length(\\spad{x})} returns the number of entries in \\axiom{\\spad{x}}.")) (|left| (($ $) "\\axiom{left(\\spad{x})} returns left subtree of \\axiom{\\spad{x}} or error if \\axiomOpFrom{retractable?}{Magma}(\\axiom{\\spad{x}}) is \\spad{true}.")) (|first| ((|#1| $) "\\axiom{first(\\spad{x})} returns the first entry of the tree \\axiom{\\spad{x}}.")) (|coerce| (((|OrderedFreeMonoid| |#1|) $) "\\axiom{coerce(\\spad{x})} returns the element of \\axiomType{OrderedFreeMonoid}(VarSet) corresponding to \\axiom{\\spad{x}} by removing parentheses.")) (* (($ $ $) "\\axiom{x*y} returns the tree \\axiom{[\\spad{x},{}\\spad{y}]}."))) 
 NIL 
@@ -2430,7 +2430,7 @@ NIL
 ((|HasAttribute| |#2| (QUOTE (-4235 "*"))) (|HasCategory| |#2| (QUOTE (-282))) (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-513)))) 
 (-625 R |Row| |Col|) 
 ((|constructor| (NIL "\\spadtype{MatrixCategory} is a general matrix category which allows different representations and indexing schemes. Rows and columns may be extracted with rows returned as objects of type Row and colums returned as objects of type Col. A domain belonging to this category will be shallowly mutable. The index of the 'first' row may be obtained by calling the function \\spadfun{minRowIndex}. The index of the 'first' column may be obtained by calling the function \\spadfun{minColIndex}. The index of the first element of a Row is the same as the index of the first column in a matrix and vice versa.")) (|inverse| (((|Union| $ "failed") $) "\\spad{inverse(m)} returns the inverse of the matrix \\spad{m}. If the matrix is not invertible,{} \"failed\" is returned. Error: if the matrix is not square.")) (|minordet| ((|#1| $) "\\spad{minordet(m)} computes the determinant of the matrix \\spad{m} using minors. Error: if the matrix is not square.")) (|determinant| ((|#1| $) "\\spad{determinant(m)} returns the determinant of the matrix \\spad{m}. Error: if the matrix is not square.")) (|nullSpace| (((|List| |#3|) $) "\\spad{nullSpace(m)} returns a basis for the null space of the matrix \\spad{m}.")) (|nullity| (((|NonNegativeInteger|) $) "\\spad{nullity(m)} returns the nullity of the matrix \\spad{m}. This is the dimension of the null space of the matrix \\spad{m}.")) (|rank| (((|NonNegativeInteger|) $) "\\spad{rank(m)} returns the rank of the matrix \\spad{m}.")) (|rowEchelon| (($ $) "\\spad{rowEchelon(m)} returns the row echelon form of the matrix \\spad{m}.")) (/ (($ $ |#1|) "\\spad{m/r} divides the elements of \\spad{m} by \\spad{r}. Error: if \\spad{r = 0}.")) (|exquo| (((|Union| $ "failed") $ |#1|) "\\spad{exquo(m,{}r)} computes the exact quotient of the elements of \\spad{m} by \\spad{r},{} returning \\axiom{\"failed\"} if this is not possible.")) (** (($ $ (|Integer|)) "\\spad{m**n} computes an integral power of the matrix \\spad{m}. Error: if matrix is not square or if the matrix is square but not invertible.") (($ $ (|NonNegativeInteger|)) "\\spad{x ** n} computes a non-negative integral power of the matrix \\spad{x}. Error: if the matrix is not square.")) (* ((|#2| |#2| $) "\\spad{r * x} is the product of the row vector \\spad{r} and the matrix \\spad{x}. Error: if the dimensions are incompatible.") ((|#3| $ |#3|) "\\spad{x * c} is the product of the matrix \\spad{x} and the column vector \\spad{c}. Error: if the dimensions are incompatible.") (($ (|Integer|) $) "\\spad{n * x} is an integer multiple.") (($ $ |#1|) "\\spad{x * r} is the right scalar multiple of the scalar \\spad{r} and the matrix \\spad{x}.") (($ |#1| $) "\\spad{r*x} is the left scalar multiple of the scalar \\spad{r} and the matrix \\spad{x}.") (($ $ $) "\\spad{x * y} is the product of the matrices \\spad{x} and \\spad{y}. Error: if the dimensions are incompatible.")) (- (($ $) "\\spad{-x} returns the negative of the matrix \\spad{x}.") (($ $ $) "\\spad{x - y} is the difference of the matrices \\spad{x} and \\spad{y}. Error: if the dimensions are incompatible.")) (+ (($ $ $) "\\spad{x + y} is the sum of the matrices \\spad{x} and \\spad{y}. Error: if the dimensions are incompatible.")) (|setsubMatrix!| (($ $ (|Integer|) (|Integer|) $) "\\spad{setsubMatrix(x,{}i1,{}j1,{}y)} destructively alters the matrix \\spad{x}. Here \\spad{x(i,{}j)} is set to \\spad{y(i-i1+1,{}j-j1+1)} for \\spad{i = i1,{}...,{}i1-1+nrows y} and \\spad{j = j1,{}...,{}j1-1+ncols y}.")) (|subMatrix| (($ $ (|Integer|) (|Integer|) (|Integer|) (|Integer|)) "\\spad{subMatrix(x,{}i1,{}i2,{}j1,{}j2)} extracts the submatrix \\spad{[x(i,{}j)]} where the index \\spad{i} ranges from \\spad{i1} to \\spad{i2} and the index \\spad{j} ranges from \\spad{j1} to \\spad{j2}.")) (|swapColumns!| (($ $ (|Integer|) (|Integer|)) "\\spad{swapColumns!(m,{}i,{}j)} interchanges the \\spad{i}th and \\spad{j}th columns of \\spad{m}. This destructively alters the matrix.")) (|swapRows!| (($ $ (|Integer|) (|Integer|)) "\\spad{swapRows!(m,{}i,{}j)} interchanges the \\spad{i}th and \\spad{j}th rows of \\spad{m}. This destructively alters the matrix.")) (|setelt| (($ $ (|List| (|Integer|)) (|List| (|Integer|)) $) "\\spad{setelt(x,{}rowList,{}colList,{}y)} destructively alters the matrix \\spad{x}. If \\spad{y} is \\spad{m}-by-\\spad{n},{} \\spad{rowList = [i<1>,{}i<2>,{}...,{}i<m>]} and \\spad{colList = [j<1>,{}j<2>,{}...,{}j<n>]},{} then \\spad{x(i<k>,{}j<l>)} is set to \\spad{y(k,{}l)} for \\spad{k = 1,{}...,{}m} and \\spad{l = 1,{}...,{}n}.")) (|elt| (($ $ (|List| (|Integer|)) (|List| (|Integer|))) "\\spad{elt(x,{}rowList,{}colList)} returns an \\spad{m}-by-\\spad{n} matrix consisting of elements of \\spad{x},{} where \\spad{m = \\# rowList} and \\spad{n = \\# colList}. If \\spad{rowList = [i<1>,{}i<2>,{}...,{}i<m>]} and \\spad{colList = [j<1>,{}j<2>,{}...,{}j<n>]},{} then the \\spad{(k,{}l)}th entry of \\spad{elt(x,{}rowList,{}colList)} is \\spad{x(i<k>,{}j<l>)}.")) (|listOfLists| (((|List| (|List| |#1|)) $) "\\spad{listOfLists(m)} returns the rows of the matrix \\spad{m} as a list of lists.")) (|vertConcat| (($ $ $) "\\spad{vertConcat(x,{}y)} vertically concatenates two matrices with an equal number of columns. The entries of \\spad{y} appear below of the entries of \\spad{x}. Error: if the matrices do not have the same number of columns.")) (|horizConcat| (($ $ $) "\\spad{horizConcat(x,{}y)} horizontally concatenates two matrices with an equal number of rows. The entries of \\spad{y} appear to the right of the entries of \\spad{x}. Error: if the matrices do not have the same number of rows.")) (|squareTop| (($ $) "\\spad{squareTop(m)} returns an \\spad{n}-by-\\spad{n} matrix consisting of the first \\spad{n} rows of the \\spad{m}-by-\\spad{n} matrix \\spad{m}. Error: if \\spad{m < n}.")) (|transpose| (($ $) "\\spad{transpose(m)} returns the transpose of the matrix \\spad{m}.") (($ |#2|) "\\spad{transpose(r)} converts the row \\spad{r} to a row matrix.")) (|coerce| (($ |#3|) "\\spad{coerce(col)} converts the column \\spad{col} to a column matrix.")) (|diagonalMatrix| (($ (|List| $)) "\\spad{diagonalMatrix([m1,{}...,{}mk])} creates a block diagonal matrix \\spad{M} with block matrices {\\em m1},{}...,{}{\\em mk} down the diagonal,{} with 0 block matrices elsewhere. More precisly: if \\spad{\\spad{ri} := nrows \\spad{mi}},{} \\spad{\\spad{ci} := ncols \\spad{mi}},{} then \\spad{m} is an (\\spad{r1+}..\\spad{+rk}) by (\\spad{c1+}..\\spad{+ck}) - matrix with entries \\spad{m.i.j = ml.(i-r1-..-r(l-1)).(j-n1-..-n(l-1))},{} if \\spad{(r1+..+r(l-1)) < i <= r1+..+rl} and \\spad{(c1+..+c(l-1)) < i <= c1+..+cl},{} \\spad{m.i.j} = 0 otherwise.") (($ (|List| |#1|)) "\\spad{diagonalMatrix(l)} returns a diagonal matrix with the elements of \\spad{l} on the diagonal.")) (|scalarMatrix| (($ (|NonNegativeInteger|) |#1|) "\\spad{scalarMatrix(n,{}r)} returns an \\spad{n}-by-\\spad{n} matrix with \\spad{r}\\spad{'s} on the diagonal and zeroes elsewhere.")) (|matrix| (($ (|List| (|List| |#1|))) "\\spad{matrix(l)} converts the list of lists \\spad{l} to a matrix,{} where the list of lists is viewed as a list of the rows of the matrix.")) (|zero| (($ (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{zero(m,{}n)} returns an \\spad{m}-by-\\spad{n} zero matrix.")) (|antisymmetric?| (((|Boolean|) $) "\\spad{antisymmetric?(m)} returns \\spad{true} if the matrix \\spad{m} is square and antisymmetric (\\spadignore{i.e.} \\spad{m[i,{}j] = -m[j,{}i]} for all \\spad{i} and \\spad{j}) and \\spad{false} otherwise.")) (|symmetric?| (((|Boolean|) $) "\\spad{symmetric?(m)} returns \\spad{true} if the matrix \\spad{m} is square and symmetric (\\spadignore{i.e.} \\spad{m[i,{}j] = m[j,{}i]} for all \\spad{i} and \\spad{j}) and \\spad{false} otherwise.")) (|diagonal?| (((|Boolean|) $) "\\spad{diagonal?(m)} returns \\spad{true} if the matrix \\spad{m} is square and diagonal (\\spadignore{i.e.} all entries of \\spad{m} not on the diagonal are zero) and \\spad{false} otherwise.")) (|square?| (((|Boolean|) $) "\\spad{square?(m)} returns \\spad{true} if \\spad{m} is a square matrix (\\spadignore{i.e.} if \\spad{m} has the same number of rows as columns) and \\spad{false} otherwise.")) (|finiteAggregate| ((|attribute|) "matrices are finite")) (|shallowlyMutable| ((|attribute|) "One may destructively alter matrices"))) 
-((-4233 . T) (-4234 . T) (-2046 . T)) 
+((-4233 . T) (-4234 . T) (-2092 . T)) 
 NIL 
 (-626 R |Row| |Col| M) 
 ((|constructor| (NIL "\\spadtype{MatrixLinearAlgebraFunctions} provides functions to compute inverses and canonical forms.")) (|inverse| (((|Union| |#4| "failed") |#4|) "\\spad{inverse(m)} returns the inverse of the matrix. If the matrix is not invertible,{} \"failed\" is returned. Error: if the matrix is not square.")) (|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")) (|rowEchelon| ((|#4| |#4|) "\\spad{rowEchelon(m)} returns the row echelon form of the matrix \\spad{m}.")) (|adjoint| (((|Record| (|:| |adjMat| |#4|) (|:| |detMat| |#1|)) |#4|) "\\spad{adjoint(m)} returns the ajoint matrix of \\spad{m} (\\spadignore{i.e.} the matrix \\spad{n} such that \\spad{m*n} = determinant(\\spad{m})*id) and the detrminant of \\spad{m}.")) (|invertIfCan| (((|Union| |#4| "failed") |#4|) "\\spad{invertIfCan(m)} returns the inverse of \\spad{m} over \\spad{R}")) (|fractionFreeGauss!| ((|#4| |#4|) "\\spad{fractionFreeGauss(m)} performs the fraction free gaussian elimination on the matrix \\spad{m}.")) (|nullSpace| (((|List| |#3|) |#4|) "\\spad{nullSpace(m)} returns a basis for the null space of the matrix \\spad{m}.")) (|nullity| (((|NonNegativeInteger|) |#4|) "\\spad{nullity(m)} returns the mullity of the matrix \\spad{m}. This is the dimension of the null space of the matrix \\spad{m}.")) (|rank| (((|NonNegativeInteger|) |#4|) "\\spad{rank(m)} returns the rank of the matrix \\spad{m}.")) (|elColumn2!| ((|#4| |#4| |#1| (|Integer|) (|Integer|)) "\\spad{elColumn2!(m,{}a,{}i,{}j)} adds to column \\spad{i} a*column(\\spad{m},{}\\spad{j}) : elementary operation of second kind. (\\spad{i} \\spad{^=j})")) (|elRow2!| ((|#4| |#4| |#1| (|Integer|) (|Integer|)) "\\spad{elRow2!(m,{}a,{}i,{}j)} adds to row \\spad{i} a*row(\\spad{m},{}\\spad{j}) : elementary operation of second kind. (\\spad{i} \\spad{^=j})")) (|elRow1!| ((|#4| |#4| (|Integer|) (|Integer|)) "\\spad{elRow1!(m,{}i,{}j)} swaps rows \\spad{i} and \\spad{j} of matrix \\spad{m} : elementary operation of first kind")) (|minordet| ((|#1| |#4|) "\\spad{minordet(m)} computes the determinant of the matrix \\spad{m} using minors. Error: if the matrix is not square.")) (|determinant| ((|#1| |#4|) "\\spad{determinant(m)} returns the determinant of the matrix \\spad{m}. an error message is returned if the matrix is not square."))) 
@@ -2439,7 +2439,7 @@ NIL
 (-627 R) 
 ((|constructor| (NIL "\\spadtype{Matrix} is a matrix domain where 1-based indexing is used for both rows and columns.")) (|inverse| (((|Union| $ "failed") $) "\\spad{inverse(m)} returns the inverse of the matrix \\spad{m}. If the matrix is not invertible,{} \"failed\" is returned. Error: if the matrix is not square.")) (|diagonalMatrix| (($ (|Vector| |#1|)) "\\spad{diagonalMatrix(v)} returns a diagonal matrix where the elements of \\spad{v} appear on the diagonal."))) 
 ((-4233 . T) (-4234 . T)) 
-((|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (QUOTE (-282))) (|HasCategory| |#1| (QUOTE (-513))) (|HasAttribute| |#1| (QUOTE (-4235 "*"))) (|HasCategory| |#1| (QUOTE (-337))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|))))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))))) 
+((|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (QUOTE (-282))) (|HasCategory| |#1| (QUOTE (-513))) (|HasAttribute| |#1| (QUOTE (-4235 "*"))) (|HasCategory| |#1| (QUOTE (-337))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|))))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))))) 
 (-628 R) 
 ((|constructor| (NIL "This package provides standard arithmetic operations on matrices. The functions in this package store the results of computations in existing matrices,{} rather than creating new matrices. This package works only for matrices of type Matrix and uses the internal representation of this type.")) (** (((|Matrix| |#1|) (|Matrix| |#1|) (|NonNegativeInteger|)) "\\spad{x ** n} computes the \\spad{n}-th power of a square matrix. The power \\spad{n} is assumed greater than 1.")) (|power!| (((|Matrix| |#1|) (|Matrix| |#1|) (|Matrix| |#1|) (|Matrix| |#1|) (|Matrix| |#1|) (|NonNegativeInteger|)) "\\spad{power!(a,{}b,{}c,{}m,{}n)} computes \\spad{m} \\spad{**} \\spad{n} and stores the result in \\spad{a}. The matrices \\spad{b} and \\spad{c} are used to store intermediate results. Error: if \\spad{a},{} \\spad{b},{} \\spad{c},{} and \\spad{m} are not square and of the same dimensions.")) (|times!| (((|Matrix| |#1|) (|Matrix| |#1|) (|Matrix| |#1|) (|Matrix| |#1|)) "\\spad{times!(c,{}a,{}b)} computes the matrix product \\spad{a * b} and stores the result in the matrix \\spad{c}. Error: if \\spad{a},{} \\spad{b},{} and \\spad{c} do not have compatible dimensions.")) (|rightScalarTimes!| (((|Matrix| |#1|) (|Matrix| |#1|) (|Matrix| |#1|) |#1|) "\\spad{rightScalarTimes!(c,{}a,{}r)} computes the scalar product \\spad{a * r} and stores the result in the matrix \\spad{c}. Error: if \\spad{a} and \\spad{c} do not have the same dimensions.")) (|leftScalarTimes!| (((|Matrix| |#1|) (|Matrix| |#1|) |#1| (|Matrix| |#1|)) "\\spad{leftScalarTimes!(c,{}r,{}a)} computes the scalar product \\spad{r * a} and stores the result in the matrix \\spad{c}. Error: if \\spad{a} and \\spad{c} do not have the same dimensions.")) (|minus!| (((|Matrix| |#1|) (|Matrix| |#1|) (|Matrix| |#1|) (|Matrix| |#1|)) "\\spad{!minus!(c,{}a,{}b)} computes the matrix difference \\spad{a - b} and stores the result in the matrix \\spad{c}. Error: if \\spad{a},{} \\spad{b},{} and \\spad{c} do not have the same dimensions.") (((|Matrix| |#1|) (|Matrix| |#1|) (|Matrix| |#1|)) "\\spad{minus!(c,{}a)} computes \\spad{-a} and stores the result in the matrix \\spad{c}. Error: if a and \\spad{c} do not have the same dimensions.")) (|plus!| (((|Matrix| |#1|) (|Matrix| |#1|) (|Matrix| |#1|) (|Matrix| |#1|)) "\\spad{plus!(c,{}a,{}b)} computes the matrix sum \\spad{a + b} and stores the result in the matrix \\spad{c}. Error: if \\spad{a},{} \\spad{b},{} and \\spad{c} do not have the same dimensions.")) (|copy!| (((|Matrix| |#1|) (|Matrix| |#1|) (|Matrix| |#1|)) "\\spad{copy!(c,{}a)} copies the matrix \\spad{a} into the matrix \\spad{c}. Error: if \\spad{a} and \\spad{c} do not have the same dimensions."))) 
 NIL 
@@ -2455,10 +2455,10 @@ NIL
 (-631) 
 ((|constructor| (NIL "A domain which models the complex number representation used by machines in the AXIOM-NAG link.")) (|coerce| (((|Complex| (|Float|)) $) "\\spad{coerce(u)} transforms \\spad{u} into a COmplex Float") (($ (|Complex| (|MachineInteger|))) "\\spad{coerce(u)} transforms \\spad{u} into a MachineComplex") (($ (|Complex| (|MachineFloat|))) "\\spad{coerce(u)} transforms \\spad{u} into a MachineComplex") (($ (|Complex| (|Integer|))) "\\spad{coerce(u)} transforms \\spad{u} into a MachineComplex") (($ (|Complex| (|Float|))) "\\spad{coerce(u)} transforms \\spad{u} into a MachineComplex"))) 
 ((-4226 . T) (-4231 |has| (-636) (-337)) (-4225 |has| (-636) (-337)) (-3905 . T) (-4232 |has| (-636) (-6 -4232)) (-4229 |has| (-636) (-6 -4229)) ((-4235 "*") . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
-((|HasCategory| (-636) (QUOTE (-135))) (|HasCategory| (-636) (QUOTE (-133))) (|HasCategory| (-636) (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| (-636) (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| (-636) (QUOTE (-342))) (|HasCategory| (-636) (QUOTE (-337))) (|HasCategory| (-636) (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| (-636) (QUOTE (-210))) (|HasCategory| (-636) (QUOTE (-323))) (-3703 (|HasCategory| (-636) (QUOTE (-337))) (|HasCategory| (-636) (QUOTE (-323)))) (|HasCategory| (-636) (LIST (QUOTE -261) (QUOTE (-636)) (QUOTE (-636)))) (|HasCategory| (-636) (LIST (QUOTE -284) (QUOTE (-636)))) (|HasCategory| (-636) (LIST (QUOTE -482) (QUOTE (-1084)) (QUOTE (-636)))) (|HasCategory| (-636) (LIST (QUOTE -815) (QUOTE (-353)))) (|HasCategory| (-636) (LIST (QUOTE -815) (QUOTE (-521)))) (|HasCategory| (-636) (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521))))) (|HasCategory| (-636) (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-353))))) (|HasCategory| (-636) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| (-636) (QUOTE (-946))) (|HasCategory| (-636) (QUOTE (-1105))) (-12 (|HasCategory| (-636) (QUOTE (-927))) (|HasCategory| (-636) (QUOTE (-1105)))) (|HasCategory| (-636) (QUOTE (-506))) (|HasCategory| (-636) (QUOTE (-979))) (-12 (|HasCategory| (-636) (QUOTE (-979))) (|HasCategory| (-636) (QUOTE (-1105)))) (-3703 (|HasCategory| (-636) (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| (-636) (QUOTE (-337)))) (|HasCategory| (-636) (QUOTE (-282))) (-3703 (|HasCategory| (-636) (QUOTE (-282))) (|HasCategory| (-636) (QUOTE (-337))) (|HasCategory| (-636) (QUOTE (-323)))) (|HasCategory| (-636) (QUOTE (-838))) (-12 (|HasCategory| (-636) (QUOTE (-210))) (|HasCategory| (-636) (QUOTE (-337)))) (-12 (|HasCategory| (-636) (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| (-636) (QUOTE (-337)))) (|HasCategory| (-636) (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| (-636) (QUOTE (-784))) (|HasCategory| (-636) (QUOTE (-513))) (|HasAttribute| (-636) (QUOTE -4232)) (|HasAttribute| (-636) (QUOTE -4229)) (-12 (|HasCategory| (-636) (QUOTE (-282))) (|HasCategory| (-636) (QUOTE (-838)))) (-3703 (-12 (|HasCategory| (-636) (QUOTE (-282))) (|HasCategory| (-636) (QUOTE (-838)))) (|HasCategory| (-636) (QUOTE (-337))) (-12 (|HasCategory| (-636) (QUOTE (-323))) (|HasCategory| (-636) (QUOTE (-838))))) (-3703 (-12 (|HasCategory| (-636) (QUOTE (-282))) (|HasCategory| (-636) (QUOTE (-838)))) (-12 (|HasCategory| (-636) (QUOTE (-337))) (|HasCategory| (-636) (QUOTE (-838)))) (-12 (|HasCategory| (-636) (QUOTE (-323))) (|HasCategory| (-636) (QUOTE (-838))))) (-3703 (-12 (|HasCategory| (-636) (QUOTE (-282))) (|HasCategory| (-636) (QUOTE (-838)))) (|HasCategory| (-636) (QUOTE (-337)))) (-3703 (-12 (|HasCategory| (-636) (QUOTE (-282))) (|HasCategory| (-636) (QUOTE (-838)))) (|HasCategory| (-636) (QUOTE (-513)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| (-636) (QUOTE (-282))) (|HasCategory| (-636) (QUOTE (-838)))) (|HasCategory| (-636) (QUOTE (-133)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| (-636) (QUOTE (-282))) (|HasCategory| (-636) (QUOTE (-838)))) (|HasCategory| (-636) (QUOTE (-323))))) 
+((|HasCategory| (-636) (QUOTE (-135))) (|HasCategory| (-636) (QUOTE (-133))) (|HasCategory| (-636) (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| (-636) (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| (-636) (QUOTE (-342))) (|HasCategory| (-636) (QUOTE (-337))) (|HasCategory| (-636) (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| (-636) (QUOTE (-210))) (|HasCategory| (-636) (QUOTE (-323))) (-3703 (|HasCategory| (-636) (QUOTE (-337))) (|HasCategory| (-636) (QUOTE (-323)))) (|HasCategory| (-636) (LIST (QUOTE -261) (QUOTE (-636)) (QUOTE (-636)))) (|HasCategory| (-636) (LIST (QUOTE -284) (QUOTE (-636)))) (|HasCategory| (-636) (LIST (QUOTE -482) (QUOTE (-1084)) (QUOTE (-636)))) (|HasCategory| (-636) (LIST (QUOTE -814) (QUOTE (-353)))) (|HasCategory| (-636) (LIST (QUOTE -814) (QUOTE (-521)))) (|HasCategory| (-636) (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521))))) (|HasCategory| (-636) (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-353))))) (|HasCategory| (-636) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| (-636) (QUOTE (-946))) (|HasCategory| (-636) (QUOTE (-1105))) (-12 (|HasCategory| (-636) (QUOTE (-927))) (|HasCategory| (-636) (QUOTE (-1105)))) (|HasCategory| (-636) (QUOTE (-506))) (|HasCategory| (-636) (QUOTE (-979))) (-12 (|HasCategory| (-636) (QUOTE (-979))) (|HasCategory| (-636) (QUOTE (-1105)))) (-3703 (|HasCategory| (-636) (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| (-636) (QUOTE (-337)))) (|HasCategory| (-636) (QUOTE (-282))) (-3703 (|HasCategory| (-636) (QUOTE (-282))) (|HasCategory| (-636) (QUOTE (-337))) (|HasCategory| (-636) (QUOTE (-323)))) (|HasCategory| (-636) (QUOTE (-837))) (-12 (|HasCategory| (-636) (QUOTE (-210))) (|HasCategory| (-636) (QUOTE (-337)))) (-12 (|HasCategory| (-636) (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| (-636) (QUOTE (-337)))) (|HasCategory| (-636) (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| (-636) (QUOTE (-783))) (|HasCategory| (-636) (QUOTE (-513))) (|HasAttribute| (-636) (QUOTE -4232)) (|HasAttribute| (-636) (QUOTE -4229)) (-12 (|HasCategory| (-636) (QUOTE (-282))) (|HasCategory| (-636) (QUOTE (-837)))) (-3703 (-12 (|HasCategory| (-636) (QUOTE (-282))) (|HasCategory| (-636) (QUOTE (-837)))) (|HasCategory| (-636) (QUOTE (-337))) (-12 (|HasCategory| (-636) (QUOTE (-323))) (|HasCategory| (-636) (QUOTE (-837))))) (-3703 (-12 (|HasCategory| (-636) (QUOTE (-282))) (|HasCategory| (-636) (QUOTE (-837)))) (-12 (|HasCategory| (-636) (QUOTE (-337))) (|HasCategory| (-636) (QUOTE (-837)))) (-12 (|HasCategory| (-636) (QUOTE (-323))) (|HasCategory| (-636) (QUOTE (-837))))) (-3703 (-12 (|HasCategory| (-636) (QUOTE (-282))) (|HasCategory| (-636) (QUOTE (-837)))) (|HasCategory| (-636) (QUOTE (-337)))) (-3703 (-12 (|HasCategory| (-636) (QUOTE (-282))) (|HasCategory| (-636) (QUOTE (-837)))) (|HasCategory| (-636) (QUOTE (-513)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| (-636) (QUOTE (-282))) (|HasCategory| (-636) (QUOTE (-837)))) (|HasCategory| (-636) (QUOTE (-133)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| (-636) (QUOTE (-282))) (|HasCategory| (-636) (QUOTE (-837)))) (|HasCategory| (-636) (QUOTE (-323))))) 
 (-632 S) 
 ((|constructor| (NIL "A multi-dictionary is a dictionary which may contain duplicates. As for any dictionary,{} its size is assumed large so that copying (non-destructive) operations are generally to be avoided.")) (|duplicates| (((|List| (|Record| (|:| |entry| |#1|) (|:| |count| (|NonNegativeInteger|)))) $) "\\spad{duplicates(d)} returns a list of values which have duplicates in \\spad{d}")) (|removeDuplicates!| (($ $) "\\spad{removeDuplicates!(d)} destructively removes any duplicate values in dictionary \\spad{d}.")) (|insert!| (($ |#1| $ (|NonNegativeInteger|)) "\\spad{insert!(x,{}d,{}n)} destructively inserts \\spad{n} copies of \\spad{x} into dictionary \\spad{d}."))) 
-((-4234 . T) (-2046 . T)) 
+((-4234 . T) (-2092 . T)) 
 NIL 
 (-633 U) 
 ((|constructor| (NIL "This package supports factorization and gcds of univariate polynomials over the integers modulo different primes. The inputs are given as polynomials over the integers with the prime passed explicitly as an extra argument.")) (|exptMod| ((|#1| |#1| (|Integer|) |#1| (|Integer|)) "\\spad{exptMod(f,{}n,{}g,{}p)} raises the univariate polynomial \\spad{f} to the \\spad{n}th power modulo the polynomial \\spad{g} and the prime \\spad{p}.")) (|separateFactors| (((|List| |#1|) (|List| (|Record| (|:| |factor| |#1|) (|:| |degree| (|Integer|)))) (|Integer|)) "\\spad{separateFactors(ddl,{} p)} refines the distinct degree factorization produced by \\spadfunFrom{ddFact}{ModularDistinctDegreeFactorizer} to give a complete list of factors.")) (|ddFact| (((|List| (|Record| (|:| |factor| |#1|) (|:| |degree| (|Integer|)))) |#1| (|Integer|)) "\\spad{ddFact(f,{}p)} computes a distinct degree factorization of the polynomial \\spad{f} modulo the prime \\spad{p},{} \\spadignore{i.e.} such that each factor is a product of irreducibles of the same degrees. The input polynomial \\spad{f} is assumed to be square-free modulo \\spad{p}.")) (|factor| (((|List| |#1|) |#1| (|Integer|)) "\\spad{factor(f1,{}p)} returns the list of factors of the univariate polynomial \\spad{f1} modulo the integer prime \\spad{p}. Error: if \\spad{f1} is not square-free modulo \\spad{p}.")) (|linears| ((|#1| |#1| (|Integer|)) "\\spad{linears(f,{}p)} returns the product of all the linear factors of \\spad{f} modulo \\spad{p}. Potentially incorrect result if \\spad{f} is not square-free modulo \\spad{p}.")) (|gcd| ((|#1| |#1| |#1| (|Integer|)) "\\spad{gcd(f1,{}f2,{}p)} computes the \\spad{gcd} of the univariate polynomials \\spad{f1} and \\spad{f2} modulo the integer prime \\spad{p}."))) 
@@ -2474,7 +2474,7 @@ NIL
 NIL 
 (-636) 
 ((|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|)) "\\spad{base()} returns the base of the model") (((|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}"))) 
-((-3894 . T) (-4225 . T) (-4231 . T) (-4226 . T) ((-4235 "*") . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
+((-3893 . T) (-4225 . T) (-4231 . T) (-4226 . T) ((-4235 "*") . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
 NIL 
 (-637 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."))) 
@@ -2504,7 +2504,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 
-(-644 S -2212 I) 
+(-644 S -2244 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 
@@ -2520,14 +2520,14 @@ NIL
 ((|constructor| (NIL "Lifting of a map through 2 levels of polynomials.")) (|map| ((|#6| (|Mapping| |#4| |#1|) |#3|) "\\spad{map(f,{} p)} lifts \\spad{f} to the domain of \\spad{p} then applies it to \\spad{p}."))) 
 NIL 
 NIL 
-(-648 R |Mod| -2633 -1318 |exactQuo|) 
+(-648 R |Mod| -1664 -3389 |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"))) 
 ((-4225 . T) (-4231 . T) (-4226 . T) ((-4235 "*") . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
 NIL 
 (-649 R |Rep|) 
 ((|constructor| (NIL "This package \\undocumented")) (|frobenius| (($ $) "\\spad{frobenius(x)} \\undocumented")) (|computePowers| (((|PrimitiveArray| $)) "\\spad{computePowers()} \\undocumented")) (|pow| (((|PrimitiveArray| $)) "\\spad{pow()} \\undocumented")) (|An| (((|Vector| |#1|) $) "\\spad{An(x)} \\undocumented")) (|UnVectorise| (($ (|Vector| |#1|)) "\\spad{UnVectorise(v)} \\undocumented")) (|Vectorise| (((|Vector| |#1|) $) "\\spad{Vectorise(x)} \\undocumented")) (|coerce| (($ |#2|) "\\spad{coerce(x)} \\undocumented")) (|lift| ((|#2| $) "\\spad{lift(x)} \\undocumented")) (|reduce| (($ |#2|) "\\spad{reduce(x)} \\undocumented")) (|modulus| ((|#2|) "\\spad{modulus()} \\undocumented")) (|setPoly| ((|#2| |#2|) "\\spad{setPoly(x)} \\undocumented"))) 
 (((-4235 "*") |has| |#1| (-157)) (-4226 |has| |#1| (-513)) (-4229 |has| |#1| (-337)) (-4231 |has| |#1| (-6 -4231)) (-4228 . T) (-4227 . T) (-4230 . T)) 
-((|HasCategory| |#1| (QUOTE (-838))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-157))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-513)))) (-12 (|HasCategory| (-998) (LIST (QUOTE -815) (QUOTE (-353)))) (|HasCategory| |#1| (LIST (QUOTE -815) (QUOTE (-353))))) (-12 (|HasCategory| (-998) (LIST (QUOTE -815) (QUOTE (-521)))) (|HasCategory| |#1| (LIST (QUOTE -815) (QUOTE (-521))))) (-12 (|HasCategory| (-998) (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-353))))) (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-353)))))) (-12 (|HasCategory| (-998) (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521)))))) (-12 (|HasCategory| (-998) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497))))) (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| |#1| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-1060))) (|HasCategory| |#1| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#1| (QUOTE (-342))) (|HasCategory| |#1| (QUOTE (-323))) (-3703 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521)))))) (|HasCategory| |#1| (QUOTE (-210))) (|HasAttribute| |#1| (QUOTE -4231)) (|HasCategory| |#1| (QUOTE (-425))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-838)))) (-3703 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-838)))) (-3703 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-838)))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-838)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-838)))) (|HasCategory| |#1| (QUOTE (-133))))) 
+((|HasCategory| |#1| (QUOTE (-837))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-157))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-513)))) (-12 (|HasCategory| (-998) (LIST (QUOTE -814) (QUOTE (-353)))) (|HasCategory| |#1| (LIST (QUOTE -814) (QUOTE (-353))))) (-12 (|HasCategory| (-998) (LIST (QUOTE -814) (QUOTE (-521)))) (|HasCategory| |#1| (LIST (QUOTE -814) (QUOTE (-521))))) (-12 (|HasCategory| (-998) (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-353))))) (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-353)))))) (-12 (|HasCategory| (-998) (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521)))))) (-12 (|HasCategory| (-998) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497))))) (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#1| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-1060))) (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#1| (QUOTE (-342))) (|HasCategory| |#1| (QUOTE (-323))) (-3703 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521)))))) (|HasCategory| |#1| (QUOTE (-210))) (|HasAttribute| |#1| (QUOTE -4231)) (|HasCategory| |#1| (QUOTE (-425))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-837)))) (-3703 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-837)))) (-3703 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-837)))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-837)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-837)))) (|HasCategory| |#1| (QUOTE (-133))))) 
 (-650 IS E |ff|) 
 ((|constructor| (NIL "This package \\undocumented")) (|construct| (($ |#1| |#2|) "\\spad{construct(i,{}e)} \\undocumented")) (|coerce| (((|Record| (|:| |index| |#1|) (|:| |exponent| |#2|)) $) "\\spad{coerce(x)} \\undocumented") (($ (|Record| (|:| |index| |#1|) (|:| |exponent| |#2|))) "\\spad{coerce(x)} \\undocumented")) (|index| ((|#1| $) "\\spad{index(x)} \\undocumented")) (|exponent| ((|#2| $) "\\spad{exponent(x)} \\undocumented"))) 
 NIL 
@@ -2536,7 +2536,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}."))) 
 ((-4228 |has| |#1| (-157)) (-4227 |has| |#1| (-157)) (-4230 . T)) 
 ((|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135)))) 
-(-652 R |Mod| -2633 -1318 |exactQuo|) 
+(-652 R |Mod| -1664 -3389 |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"))) 
 ((-4230 . T)) 
 NIL 
@@ -2603,7 +2603,7 @@ NIL
 (-668 |vl| R) 
 ((|constructor| (NIL "\\indented{2}{This type is the basic representation of sparse recursive multivariate} polynomials whose variables are from a user specified list of symbols. The ordering is specified by the position of the variable in the list. The coefficient ring may be non commutative,{} but the variables are assumed to commute."))) 
 (((-4235 "*") |has| |#2| (-157)) (-4226 |has| |#2| (-513)) (-4231 |has| |#2| (-6 -4231)) (-4228 . T) (-4227 . T) (-4230 . T)) 
-((|HasCategory| |#2| (QUOTE (-838))) (|HasCategory| |#2| (QUOTE (-513))) (|HasCategory| |#2| (QUOTE (-157))) (-3703 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-513)))) (-12 (|HasCategory| (-794 |#1|) (LIST (QUOTE -815) (QUOTE (-353)))) (|HasCategory| |#2| (LIST (QUOTE -815) (QUOTE (-353))))) (-12 (|HasCategory| (-794 |#1|) (LIST (QUOTE -815) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -815) (QUOTE (-521))))) (-12 (|HasCategory| (-794 |#1|) (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-353))))) (|HasCategory| |#2| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-353)))))) (-12 (|HasCategory| (-794 |#1|) (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521)))))) (-12 (|HasCategory| (-794 |#1|) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#2| (LIST (QUOTE -562) (QUOTE (-497))))) (|HasCategory| |#2| (QUOTE (-784))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (QUOTE (-135))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-337))) (-3703 (|HasCategory| |#2| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521)))))) (|HasAttribute| |#2| (QUOTE -4231)) (|HasCategory| |#2| (QUOTE (-425))) (-3703 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-425))) (|HasCategory| |#2| (QUOTE (-513))) (|HasCategory| |#2| (QUOTE (-838)))) (-3703 (|HasCategory| |#2| (QUOTE (-425))) (|HasCategory| |#2| (QUOTE (-513))) (|HasCategory| |#2| (QUOTE (-838)))) (-3703 (|HasCategory| |#2| (QUOTE (-425))) (|HasCategory| |#2| (QUOTE (-838)))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-838)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-838)))) (|HasCategory| |#2| (QUOTE (-133))))) 
+((|HasCategory| |#2| (QUOTE (-837))) (|HasCategory| |#2| (QUOTE (-513))) (|HasCategory| |#2| (QUOTE (-157))) (-3703 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-513)))) (-12 (|HasCategory| (-793 |#1|) (LIST (QUOTE -814) (QUOTE (-353)))) (|HasCategory| |#2| (LIST (QUOTE -814) (QUOTE (-353))))) (-12 (|HasCategory| (-793 |#1|) (LIST (QUOTE -814) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -814) (QUOTE (-521))))) (-12 (|HasCategory| (-793 |#1|) (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-353))))) (|HasCategory| |#2| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-353)))))) (-12 (|HasCategory| (-793 |#1|) (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521)))))) (-12 (|HasCategory| (-793 |#1|) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#2| (LIST (QUOTE -562) (QUOTE (-497))))) (|HasCategory| |#2| (QUOTE (-783))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (QUOTE (-135))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-337))) (-3703 (|HasCategory| |#2| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521)))))) (|HasAttribute| |#2| (QUOTE -4231)) (|HasCategory| |#2| (QUOTE (-425))) (-3703 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-425))) (|HasCategory| |#2| (QUOTE (-513))) (|HasCategory| |#2| (QUOTE (-837)))) (-3703 (|HasCategory| |#2| (QUOTE (-425))) (|HasCategory| |#2| (QUOTE (-513))) (|HasCategory| |#2| (QUOTE (-837)))) (-3703 (|HasCategory| |#2| (QUOTE (-425))) (|HasCategory| |#2| (QUOTE (-837)))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-837)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-837)))) (|HasCategory| |#2| (QUOTE (-133))))) 
 (-669 E OV R PRF) 
 ((|constructor| (NIL "\\indented{3}{This package exports a factor operation for multivariate polynomials} with coefficients which are rational functions over some ring \\spad{R} over which we can factor. It is used internally by packages such as primary decomposition which need to work with polynomials with rational function coefficients,{} \\spadignore{i.e.} themselves fractions of polynomials.")) (|factor| (((|Factored| |#4|) |#4|) "\\spad{factor(prf)} factors a polynomial with rational function coefficients.")) (|pushuconst| ((|#4| (|Fraction| (|Polynomial| |#3|)) |#2|) "\\spad{pushuconst(r,{}var)} takes a rational function and raises all occurances of the variable \\spad{var} to the polynomial level.")) (|pushucoef| ((|#4| (|SparseUnivariatePolynomial| (|Polynomial| |#3|)) |#2|) "\\spad{pushucoef(upoly,{}var)} converts the anonymous univariate polynomial \\spad{upoly} to a polynomial in \\spad{var} over rational functions.")) (|pushup| ((|#4| |#4| |#2|) "\\spad{pushup(prf,{}var)} raises all occurences of the variable \\spad{var} in the coefficients of the polynomial \\spad{prf} back to the polynomial level.")) (|pushdterm| ((|#4| (|SparseUnivariatePolynomial| |#4|) |#2|) "\\spad{pushdterm(monom,{}var)} pushes all top level occurences of the variable \\spad{var} into the coefficient domain for the monomial \\spad{monom}.")) (|pushdown| ((|#4| |#4| |#2|) "\\spad{pushdown(prf,{}var)} pushes all top level occurences of the variable \\spad{var} into the coefficient domain for the polynomial \\spad{prf}.")) (|totalfract| (((|Record| (|:| |sup| (|Polynomial| |#3|)) (|:| |inf| (|Polynomial| |#3|))) |#4|) "\\spad{totalfract(prf)} takes a polynomial whose coefficients are themselves fractions of polynomials and returns a record containing the numerator and denominator resulting from putting \\spad{prf} over a common denominator.")) (|convert| (((|Symbol|) $) "\\spad{convert(x)} converts \\spad{x} to a symbol"))) 
 NIL 
@@ -2619,15 +2619,15 @@ NIL
 (-672 R M) 
 ((|constructor| (NIL "\\spadtype{MonoidRing}(\\spad{R},{}\\spad{M}),{} implements the algebra of all maps from the monoid \\spad{M} to the commutative ring \\spad{R} with finite support. Multiplication of two maps \\spad{f} and \\spad{g} is defined to map an element \\spad{c} of \\spad{M} to the (convolution) sum over {\\em f(a)g(b)} such that {\\em ab = c}. Thus \\spad{M} can be identified with a canonical basis and the maps can also be considered as formal linear combinations of the elements in \\spad{M}. Scalar multiples of a basis element are called monomials. A prominent example is the class of polynomials where the monoid is a direct product of the natural numbers with pointwise addition. When \\spad{M} is \\spadtype{FreeMonoid Symbol},{} one gets polynomials in infinitely many non-commuting variables. Another application area is representation theory of finite groups \\spad{G},{} where modules over \\spadtype{MonoidRing}(\\spad{R},{}\\spad{G}) are studied.")) (|reductum| (($ $) "\\spad{reductum(f)} is \\spad{f} minus its leading monomial.")) (|leadingCoefficient| ((|#1| $) "\\spad{leadingCoefficient(f)} gives the coefficient of \\spad{f},{} whose corresponding monoid element is the greatest among all those with non-zero coefficients.")) (|leadingMonomial| ((|#2| $) "\\spad{leadingMonomial(f)} gives the monomial of \\spad{f} whose corresponding monoid element is the greatest among all those with non-zero coefficients.")) (|numberOfMonomials| (((|NonNegativeInteger|) $) "\\spad{numberOfMonomials(f)} is the number of non-zero coefficients with respect to the canonical basis.")) (|monomials| (((|List| $) $) "\\spad{monomials(f)} gives the list of all monomials whose sum is \\spad{f}.")) (|coefficients| (((|List| |#1|) $) "\\spad{coefficients(f)} lists all non-zero coefficients.")) (|monomial?| (((|Boolean|) $) "\\spad{monomial?(f)} tests if \\spad{f} is a single monomial.")) (|map| (($ (|Mapping| |#1| |#1|) $) "\\spad{map(fn,{}u)} maps function \\spad{fn} onto the coefficients of the non-zero monomials of \\spad{u}.")) (|terms| (((|List| (|Record| (|:| |coef| |#1|) (|:| |monom| |#2|))) $) "\\spad{terms(f)} gives the list of non-zero coefficients combined with their corresponding basis element as records. This is the internal representation.")) (|coerce| (($ (|List| (|Record| (|:| |coef| |#1|) (|:| |monom| |#2|)))) "\\spad{coerce(lt)} converts a list of terms and coefficients to a member of the domain.")) (|coefficient| ((|#1| $ |#2|) "\\spad{coefficient(f,{}m)} extracts the coefficient of \\spad{m} in \\spad{f} with respect to the canonical basis \\spad{M}.")) (|monomial| (($ |#1| |#2|) "\\spad{monomial(r,{}m)} creates a scalar multiple of the basis element \\spad{m}."))) 
 ((-4228 |has| |#1| (-157)) (-4227 |has| |#1| (-157)) (-4230 . T)) 
-((-12 (|HasCategory| |#1| (QUOTE (-342))) (|HasCategory| |#2| (QUOTE (-342)))) (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#2| (QUOTE (-784)))) 
+((-12 (|HasCategory| |#1| (QUOTE (-342))) (|HasCategory| |#2| (QUOTE (-342)))) (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#2| (QUOTE (-783)))) 
 (-673 S) 
 ((|constructor| (NIL "A multi-set aggregate is a set which keeps track of the multiplicity of its elements."))) 
-((-4223 . T) (-4234 . T) (-2046 . T)) 
+((-4223 . T) (-4234 . T) (-2092 . T)) 
 NIL 
 (-674 S) 
 ((|constructor| (NIL "A multiset is a set with multiplicities.")) (|remove!| (($ (|Mapping| (|Boolean|) |#1|) $ (|Integer|)) "\\spad{remove!(p,{}ms,{}number)} removes destructively at most \\spad{number} copies of elements \\spad{x} such that \\spad{p(x)} is \\spadfun{\\spad{true}} if \\spad{number} is positive,{} all of them if \\spad{number} equals zero,{} and all but at most \\spad{-number} if \\spad{number} is negative.") (($ |#1| $ (|Integer|)) "\\spad{remove!(x,{}ms,{}number)} removes destructively at most \\spad{number} copies of element \\spad{x} if \\spad{number} is positive,{} all of them if \\spad{number} equals zero,{} and all but at most \\spad{-number} if \\spad{number} is negative.")) (|remove| (($ (|Mapping| (|Boolean|) |#1|) $ (|Integer|)) "\\spad{remove(p,{}ms,{}number)} removes at most \\spad{number} copies of elements \\spad{x} such that \\spad{p(x)} is \\spadfun{\\spad{true}} if \\spad{number} is positive,{} all of them if \\spad{number} equals zero,{} and all but at most \\spad{-number} if \\spad{number} is negative.") (($ |#1| $ (|Integer|)) "\\spad{remove(x,{}ms,{}number)} removes at most \\spad{number} copies of element \\spad{x} if \\spad{number} is positive,{} all of them if \\spad{number} equals zero,{} and all but at most \\spad{-number} if \\spad{number} is negative.")) (|members| (((|List| |#1|) $) "\\spad{members(ms)} returns a list of the elements of \\spad{ms} {\\em without} their multiplicity. See also \\spadfun{parts}.")) (|multiset| (($ (|List| |#1|)) "\\spad{multiset(ls)} creates a multiset with elements from \\spad{ls}.") (($ |#1|) "\\spad{multiset(s)} creates a multiset with singleton \\spad{s}.") (($) "\\spad{multiset()}\\$\\spad{D} creates an empty multiset of domain \\spad{D}."))) 
 ((-4233 . T) (-4223 . T) (-4234 . T)) 
-((|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (QUOTE (-1013))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792))))) 
+((|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (QUOTE (-1013))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791))))) 
 (-675) 
 ((|constructor| (NIL "\\spadtype{MoreSystemCommands} implements an interface with the system command facility. These are the commands that are issued from source files or the system interpreter and they start with a close parenthesis,{} \\spadignore{e.g.} \\spadsyscom{what} commands.")) (|systemCommand| (((|Void|) (|String|)) "\\spad{systemCommand(cmd)} takes the string \\spadvar{\\spad{cmd}} and passes it to the runtime environment for execution as a system command. Although various things may be printed,{} no usable value is returned."))) 
 NIL 
@@ -2795,7 +2795,7 @@ NIL
 (-716 R |VarSet|) 
 ((|constructor| (NIL "A post-facto extension for \\axiomType{\\spad{SMP}} in order to speed up operations related to pseudo-division and \\spad{gcd}. This domain is based on the \\axiomType{NSUP} constructor which is itself a post-facto extension of the \\axiomType{SUP} constructor."))) 
 (((-4235 "*") |has| |#1| (-157)) (-4226 |has| |#1| (-513)) (-4231 |has| |#1| (-6 -4231)) (-4228 . T) (-4227 . T) (-4230 . T)) 
-((|HasCategory| |#1| (QUOTE (-838))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-157))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-513)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -815) (QUOTE (-353)))) (|HasCategory| |#2| (LIST (QUOTE -815) (QUOTE (-353))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -815) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -815) (QUOTE (-521))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-353))))) (|HasCategory| |#2| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-353)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#2| (LIST (QUOTE -562) (QUOTE (-497))))) (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| |#1| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -562) (QUOTE (-1084)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -562) (QUOTE (-1084))))) (|HasCategory| |#1| (QUOTE (-337))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -562) (QUOTE (-1084))))) (-3703 (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -562) (QUOTE (-1084)))) (-2400 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -562) (QUOTE (-1084)))))) (-3703 (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -562) (QUOTE (-1084)))) (-2400 (|HasCategory| |#1| (QUOTE (-506)))) (-2400 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -562) (QUOTE (-1084)))) (-2400 (|HasCategory| |#1| (LIST (QUOTE -37) (QUOTE (-521))))) (-2400 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -562) (QUOTE (-1084)))) (-2400 (|HasCategory| |#1| (LIST (QUOTE -918) (QUOTE (-521))))))) (-3703 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521)))))) (|HasAttribute| |#1| (QUOTE -4231)) (|HasCategory| |#1| (QUOTE (-425))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-838)))) (-3703 (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-838)))) (-3703 (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-838)))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-838)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-838)))) (|HasCategory| |#1| (QUOTE (-133))))) 
+((|HasCategory| |#1| (QUOTE (-837))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-157))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-513)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -814) (QUOTE (-353)))) (|HasCategory| |#2| (LIST (QUOTE -814) (QUOTE (-353))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -814) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -814) (QUOTE (-521))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-353))))) (|HasCategory| |#2| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-353)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#2| (LIST (QUOTE -562) (QUOTE (-497))))) (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#1| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -562) (QUOTE (-1084)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -562) (QUOTE (-1084))))) (|HasCategory| |#1| (QUOTE (-337))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -562) (QUOTE (-1084))))) (-3703 (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -562) (QUOTE (-1084)))) (-2416 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -562) (QUOTE (-1084)))))) (-3703 (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -562) (QUOTE (-1084)))) (-2416 (|HasCategory| |#1| (QUOTE (-506)))) (-2416 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -562) (QUOTE (-1084)))) (-2416 (|HasCategory| |#1| (LIST (QUOTE -37) (QUOTE (-521))))) (-2416 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -562) (QUOTE (-1084)))) (-2416 (|HasCategory| |#1| (LIST (QUOTE -918) (QUOTE (-521))))))) (-3703 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521)))))) (|HasAttribute| |#1| (QUOTE -4231)) (|HasCategory| |#1| (QUOTE (-425))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-837)))) (-3703 (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-837)))) (-3703 (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-837)))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-837)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-837)))) (|HasCategory| |#1| (QUOTE (-133))))) 
 (-717 R S) 
 ((|constructor| (NIL "This package lifts a mapping from coefficient rings \\spad{R} to \\spad{S} to a mapping from sparse univariate polynomial over \\spad{R} to a sparse univariate polynomial over \\spad{S}. Note that the mapping is assumed to send zero to zero,{} since it will only be applied to the non-zero coefficients of the polynomial.")) (|map| (((|NewSparseUnivariatePolynomial| |#2|) (|Mapping| |#2| |#1|) (|NewSparseUnivariatePolynomial| |#1|)) "\\axiom{map(func,{} poly)} creates a new polynomial by applying func to every non-zero coefficient of the polynomial poly."))) 
 NIL 
@@ -2803,19 +2803,19 @@ NIL
 (-718 R) 
 ((|constructor| (NIL "A post-facto extension for \\axiomType{SUP} in order to speed up operations related to pseudo-division and \\spad{gcd} for both \\axiomType{SUP} and,{} consequently,{} \\axiomType{NSMP}.")) (|halfExtendedResultant2| (((|Record| (|:| |resultant| |#1|) (|:| |coef2| $)) $ $) "\\axiom{halfExtendedResultant2(a,{}\\spad{b})} returns \\axiom{[\\spad{r},{}ca]} such that \\axiom{extendedResultant(a,{}\\spad{b})} returns \\axiom{[\\spad{r},{}ca,{} \\spad{cb}]}")) (|halfExtendedResultant1| (((|Record| (|:| |resultant| |#1|) (|:| |coef1| $)) $ $) "\\axiom{halfExtendedResultant1(a,{}\\spad{b})} returns \\axiom{[\\spad{r},{}ca]} such that \\axiom{extendedResultant(a,{}\\spad{b})} returns \\axiom{[\\spad{r},{}ca,{} \\spad{cb}]}")) (|extendedResultant| (((|Record| (|:| |resultant| |#1|) (|:| |coef1| $) (|:| |coef2| $)) $ $) "\\axiom{extendedResultant(a,{}\\spad{b})} returns \\axiom{[\\spad{r},{}ca,{}\\spad{cb}]} such that \\axiom{\\spad{r}} is the resultant of \\axiom{a} and \\axiom{\\spad{b}} and \\axiom{\\spad{r} = ca * a + \\spad{cb} * \\spad{b}}")) (|halfExtendedSubResultantGcd2| (((|Record| (|:| |gcd| $) (|:| |coef2| $)) $ $) "\\axiom{halfExtendedSubResultantGcd2(a,{}\\spad{b})} returns \\axiom{[\\spad{g},{}\\spad{cb}]} such that \\axiom{extendedSubResultantGcd(a,{}\\spad{b})} returns \\axiom{[\\spad{g},{}ca,{} \\spad{cb}]}")) (|halfExtendedSubResultantGcd1| (((|Record| (|:| |gcd| $) (|:| |coef1| $)) $ $) "\\axiom{halfExtendedSubResultantGcd1(a,{}\\spad{b})} returns \\axiom{[\\spad{g},{}ca]} such that \\axiom{extendedSubResultantGcd(a,{}\\spad{b})} returns \\axiom{[\\spad{g},{}ca,{} \\spad{cb}]}")) (|extendedSubResultantGcd| (((|Record| (|:| |gcd| $) (|:| |coef1| $) (|:| |coef2| $)) $ $) "\\axiom{extendedSubResultantGcd(a,{}\\spad{b})} returns \\axiom{[\\spad{g},{}ca,{} \\spad{cb}]} such that \\axiom{\\spad{g}} is a \\spad{gcd} of \\axiom{a} and \\axiom{\\spad{b}} in \\axiom{\\spad{R^}(\\spad{-1}) \\spad{P}} and \\axiom{\\spad{g} = ca * a + \\spad{cb} * \\spad{b}}")) (|lastSubResultant| (($ $ $) "\\axiom{lastSubResultant(a,{}\\spad{b})} returns \\axiom{resultant(a,{}\\spad{b})} if \\axiom{a} and \\axiom{\\spad{b}} has no non-trivial \\spad{gcd} in \\axiom{\\spad{R^}(\\spad{-1}) \\spad{P}} otherwise the non-zero sub-resultant with smallest index.")) (|subResultantsChain| (((|List| $) $ $) "\\axiom{subResultantsChain(a,{}\\spad{b})} returns the list of the non-zero sub-resultants of \\axiom{a} and \\axiom{\\spad{b}} sorted by increasing degree.")) (|lazyPseudoQuotient| (($ $ $) "\\axiom{lazyPseudoQuotient(a,{}\\spad{b})} returns \\axiom{\\spad{q}} if \\axiom{lazyPseudoDivide(a,{}\\spad{b})} returns \\axiom{[\\spad{c},{}\\spad{g},{}\\spad{q},{}\\spad{r}]}")) (|lazyPseudoDivide| (((|Record| (|:| |coef| |#1|) (|:| |gap| (|NonNegativeInteger|)) (|:| |quotient| $) (|:| |remainder| $)) $ $) "\\axiom{lazyPseudoDivide(a,{}\\spad{b})} returns \\axiom{[\\spad{c},{}\\spad{g},{}\\spad{q},{}\\spad{r}]} such that \\axiom{\\spad{c^n} * a = \\spad{q*b} \\spad{+r}} and \\axiom{lazyResidueClass(a,{}\\spad{b})} returns \\axiom{[\\spad{r},{}\\spad{c},{}\\spad{n}]} where \\axiom{\\spad{n} + \\spad{g} = max(0,{} degree(\\spad{b}) - degree(a) + 1)}.")) (|lazyPseudoRemainder| (($ $ $) "\\axiom{lazyPseudoRemainder(a,{}\\spad{b})} returns \\axiom{\\spad{r}} if \\axiom{lazyResidueClass(a,{}\\spad{b})} returns \\axiom{[\\spad{r},{}\\spad{c},{}\\spad{n}]}. This lazy pseudo-remainder is computed by means of the \\axiomOpFrom{fmecg}{NewSparseUnivariatePolynomial} operation.")) (|lazyResidueClass| (((|Record| (|:| |polnum| $) (|:| |polden| |#1|) (|:| |power| (|NonNegativeInteger|))) $ $) "\\axiom{lazyResidueClass(a,{}\\spad{b})} returns \\axiom{[\\spad{r},{}\\spad{c},{}\\spad{n}]} such that \\axiom{\\spad{r}} is reduced \\spad{w}.\\spad{r}.\\spad{t}. \\axiom{\\spad{b}} and \\axiom{\\spad{b}} divides \\axiom{\\spad{c^n} * a - \\spad{r}} where \\axiom{\\spad{c}} is \\axiom{leadingCoefficient(\\spad{b})} and \\axiom{\\spad{n}} is as small as possible with the previous properties.")) (|monicModulo| (($ $ $) "\\axiom{monicModulo(a,{}\\spad{b})} returns \\axiom{\\spad{r}} such that \\axiom{\\spad{r}} is reduced \\spad{w}.\\spad{r}.\\spad{t}. \\axiom{\\spad{b}} and \\axiom{\\spad{b}} divides \\axiom{a \\spad{-r}} where \\axiom{\\spad{b}} is monic.")) (|fmecg| (($ $ (|NonNegativeInteger|) |#1| $) "\\axiom{fmecg(\\spad{p1},{}\\spad{e},{}\\spad{r},{}\\spad{p2})} returns \\axiom{\\spad{p1} - \\spad{r} * X**e * \\spad{p2}} where \\axiom{\\spad{X}} is \\axiom{monomial(1,{}1)}"))) 
 (((-4235 "*") |has| |#1| (-157)) (-4226 |has| |#1| (-513)) (-4229 |has| |#1| (-337)) (-4231 |has| |#1| (-6 -4231)) (-4228 . T) (-4227 . T) (-4230 . T)) 
-((|HasCategory| |#1| (QUOTE (-838))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-157))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-513)))) (-12 (|HasCategory| (-998) (LIST (QUOTE -815) (QUOTE (-353)))) (|HasCategory| |#1| (LIST (QUOTE -815) (QUOTE (-353))))) (-12 (|HasCategory| (-998) (LIST (QUOTE -815) (QUOTE (-521)))) (|HasCategory| |#1| (LIST (QUOTE -815) (QUOTE (-521))))) (-12 (|HasCategory| (-998) (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-353))))) (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-353)))))) (-12 (|HasCategory| (-998) (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521)))))) (-12 (|HasCategory| (-998) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497))))) (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| |#1| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-1060))) (|HasCategory| |#1| (LIST (QUOTE -829) (QUOTE (-1084)))) (-3703 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521)))))) (|HasCategory| |#1| (QUOTE (-210))) (|HasAttribute| |#1| (QUOTE -4231)) (|HasCategory| |#1| (QUOTE (-425))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-838)))) (-3703 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-838)))) (-3703 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-838)))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-838)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-838)))) (|HasCategory| |#1| (QUOTE (-133))))) 
+((|HasCategory| |#1| (QUOTE (-837))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-157))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-513)))) (-12 (|HasCategory| (-998) (LIST (QUOTE -814) (QUOTE (-353)))) (|HasCategory| |#1| (LIST (QUOTE -814) (QUOTE (-353))))) (-12 (|HasCategory| (-998) (LIST (QUOTE -814) (QUOTE (-521)))) (|HasCategory| |#1| (LIST (QUOTE -814) (QUOTE (-521))))) (-12 (|HasCategory| (-998) (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-353))))) (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-353)))))) (-12 (|HasCategory| (-998) (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521)))))) (-12 (|HasCategory| (-998) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497))))) (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#1| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-1060))) (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1084)))) (-3703 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521)))))) (|HasCategory| |#1| (QUOTE (-210))) (|HasAttribute| |#1| (QUOTE -4231)) (|HasCategory| |#1| (QUOTE (-425))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-837)))) (-3703 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-837)))) (-3703 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-837)))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-837)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-837)))) (|HasCategory| |#1| (QUOTE (-133))))) 
 (-719 R) 
 ((|constructor| (NIL "This package provides polynomials as functions on a ring.")) (|eulerE| ((|#1| (|NonNegativeInteger|) |#1|) "\\spad{eulerE(n,{}r)} \\undocumented")) (|bernoulliB| ((|#1| (|NonNegativeInteger|) |#1|) "\\spad{bernoulliB(n,{}r)} \\undocumented")) (|cyclotomic| ((|#1| (|NonNegativeInteger|) |#1|) "\\spad{cyclotomic(n,{}r)} \\undocumented"))) 
 NIL 
 ((|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521)))))) 
 (-720 R E V P) 
 ((|constructor| (NIL "The category of normalized triangular sets. A triangular set \\spad{ts} is said normalized if for every algebraic variable \\spad{v} of \\spad{ts} the polynomial \\spad{select(ts,{}v)} is normalized \\spad{w}.\\spad{r}.\\spad{t}. every polynomial in \\spad{collectUnder(ts,{}v)}. A polynomial \\spad{p} is said normalized \\spad{w}.\\spad{r}.\\spad{t}. a non-constant polynomial \\spad{q} if \\spad{p} is constant or \\spad{degree(p,{}mdeg(q)) = 0} and \\spad{init(p)} is normalized \\spad{w}.\\spad{r}.\\spad{t}. \\spad{q}. One of the important features of normalized triangular sets is that they are regular 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} \\indented{1}{[2] \\spad{P}. AUBRY,{} \\spad{D}. LAZARD and \\spad{M}. MORENO MAZA \"On the Theories} \\indented{5}{of Triangular Sets\" Journal of Symbol. Comp. (to appear)} \\indented{1}{[3] \\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}{[4] \\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.}"))) 
-((-4234 . T) (-4233 . T) (-2046 . T)) 
+((-4234 . T) (-4233 . T) (-2092 . T)) 
 NIL 
 (-721 S) 
 ((|constructor| (NIL "Numeric provides real and complex numerical evaluation functions for various symbolic types.")) (|numericIfCan| (((|Union| (|Float|) "failed") (|Expression| |#1|) (|PositiveInteger|)) "\\spad{numericIfCan(x,{} n)} returns a real approximation of \\spad{x} up to \\spad{n} decimal places,{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.") (((|Union| (|Float|) "failed") (|Expression| |#1|)) "\\spad{numericIfCan(x)} returns a real approximation of \\spad{x},{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.") (((|Union| (|Float|) "failed") (|Fraction| (|Polynomial| |#1|)) (|PositiveInteger|)) "\\spad{numericIfCan(x,{}n)} returns a real approximation of \\spad{x} up to \\spad{n} decimal places,{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.") (((|Union| (|Float|) "failed") (|Fraction| (|Polynomial| |#1|))) "\\spad{numericIfCan(x)} returns a real approximation of \\spad{x},{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.") (((|Union| (|Float|) "failed") (|Polynomial| |#1|) (|PositiveInteger|)) "\\spad{numericIfCan(x,{}n)} returns a real approximation of \\spad{x} up to \\spad{n} decimal places,{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.") (((|Union| (|Float|) "failed") (|Polynomial| |#1|)) "\\spad{numericIfCan(x)} returns a real approximation of \\spad{x},{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.")) (|complexNumericIfCan| (((|Union| (|Complex| (|Float|)) "failed") (|Expression| (|Complex| |#1|)) (|PositiveInteger|)) "\\spad{complexNumericIfCan(x,{} n)} returns a complex approximation of \\spad{x} up to \\spad{n} decimal places,{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.") (((|Union| (|Complex| (|Float|)) "failed") (|Expression| (|Complex| |#1|))) "\\spad{complexNumericIfCan(x)} returns a complex approximation of \\spad{x},{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.") (((|Union| (|Complex| (|Float|)) "failed") (|Expression| |#1|) (|PositiveInteger|)) "\\spad{complexNumericIfCan(x,{} n)} returns a complex approximation of \\spad{x} up to \\spad{n} decimal places,{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.") (((|Union| (|Complex| (|Float|)) "failed") (|Expression| |#1|)) "\\spad{complexNumericIfCan(x)} returns a complex approximation of \\spad{x},{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.") (((|Union| (|Complex| (|Float|)) "failed") (|Fraction| (|Polynomial| (|Complex| |#1|))) (|PositiveInteger|)) "\\spad{complexNumericIfCan(x,{} n)} returns a complex approximation of \\spad{x} up to \\spad{n} decimal places,{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.") (((|Union| (|Complex| (|Float|)) "failed") (|Fraction| (|Polynomial| (|Complex| |#1|)))) "\\spad{complexNumericIfCan(x)} returns a complex approximation of \\spad{x},{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.") (((|Union| (|Complex| (|Float|)) "failed") (|Fraction| (|Polynomial| |#1|)) (|PositiveInteger|)) "\\spad{complexNumericIfCan(x,{} n)} returns a complex approximation of \\spad{x},{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.") (((|Union| (|Complex| (|Float|)) "failed") (|Fraction| (|Polynomial| |#1|))) "\\spad{complexNumericIfCan(x)} returns a complex approximation of \\spad{x},{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.") (((|Union| (|Complex| (|Float|)) "failed") (|Polynomial| |#1|) (|PositiveInteger|)) "\\spad{complexNumericIfCan(x,{} n)} returns a complex approximation of \\spad{x} up to \\spad{n} decimal places,{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.") (((|Union| (|Complex| (|Float|)) "failed") (|Polynomial| |#1|)) "\\spad{complexNumericIfCan(x)} returns a complex approximation of \\spad{x},{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.") (((|Union| (|Complex| (|Float|)) "failed") (|Polynomial| (|Complex| |#1|)) (|PositiveInteger|)) "\\spad{complexNumericIfCan(x,{} n)} returns a complex approximation of \\spad{x} up to \\spad{n} decimal places,{} or \"failed\" if \\axiom{\\spad{x}} is not a constant.") (((|Union| (|Complex| (|Float|)) "failed") (|Polynomial| (|Complex| |#1|))) "\\spad{complexNumericIfCan(x)} returns a complex approximation of \\spad{x},{} or \"failed\" if \\axiom{\\spad{x}} is not constant.")) (|complexNumeric| (((|Complex| (|Float|)) (|Expression| (|Complex| |#1|)) (|PositiveInteger|)) "\\spad{complexNumeric(x,{} n)} returns a complex approximation of \\spad{x} up to \\spad{n} decimal places.") (((|Complex| (|Float|)) (|Expression| (|Complex| |#1|))) "\\spad{complexNumeric(x)} returns a complex approximation of \\spad{x}.") (((|Complex| (|Float|)) (|Expression| |#1|) (|PositiveInteger|)) "\\spad{complexNumeric(x,{} n)} returns a complex approximation of \\spad{x} up to \\spad{n} decimal places.") (((|Complex| (|Float|)) (|Expression| |#1|)) "\\spad{complexNumeric(x)} returns a complex approximation of \\spad{x}.") (((|Complex| (|Float|)) (|Fraction| (|Polynomial| (|Complex| |#1|))) (|PositiveInteger|)) "\\spad{complexNumeric(x,{} n)} returns a complex approximation of \\spad{x} up to \\spad{n} decimal places.") (((|Complex| (|Float|)) (|Fraction| (|Polynomial| (|Complex| |#1|)))) "\\spad{complexNumeric(x)} returns a complex approximation of \\spad{x}.") (((|Complex| (|Float|)) (|Fraction| (|Polynomial| |#1|)) (|PositiveInteger|)) "\\spad{complexNumeric(x,{} n)} returns a complex approximation of \\spad{x}") (((|Complex| (|Float|)) (|Fraction| (|Polynomial| |#1|))) "\\spad{complexNumeric(x)} returns a complex approximation of \\spad{x}.") (((|Complex| (|Float|)) (|Polynomial| |#1|) (|PositiveInteger|)) "\\spad{complexNumeric(x,{} n)} returns a complex approximation of \\spad{x} up to \\spad{n} decimal places.") (((|Complex| (|Float|)) (|Polynomial| |#1|)) "\\spad{complexNumeric(x)} returns a complex approximation of \\spad{x}.") (((|Complex| (|Float|)) (|Polynomial| (|Complex| |#1|)) (|PositiveInteger|)) "\\spad{complexNumeric(x,{} n)} returns a complex approximation of \\spad{x} up to \\spad{n} decimal places.") (((|Complex| (|Float|)) (|Polynomial| (|Complex| |#1|))) "\\spad{complexNumeric(x)} returns a complex approximation of \\spad{x}.") (((|Complex| (|Float|)) (|Complex| |#1|) (|PositiveInteger|)) "\\spad{complexNumeric(x,{} n)} returns a complex approximation of \\spad{x} up to \\spad{n} decimal places.") (((|Complex| (|Float|)) (|Complex| |#1|)) "\\spad{complexNumeric(x)} returns a complex approximation of \\spad{x}.") (((|Complex| (|Float|)) |#1| (|PositiveInteger|)) "\\spad{complexNumeric(x,{} n)} returns a complex approximation of \\spad{x} up to \\spad{n} decimal places.") (((|Complex| (|Float|)) |#1|) "\\spad{complexNumeric(x)} returns a complex approximation of \\spad{x}.")) (|numeric| (((|Float|) (|Expression| |#1|) (|PositiveInteger|)) "\\spad{numeric(x,{} n)} returns a real approximation of \\spad{x} up to \\spad{n} decimal places.") (((|Float|) (|Expression| |#1|)) "\\spad{numeric(x)} returns a real approximation of \\spad{x}.") (((|Float|) (|Fraction| (|Polynomial| |#1|)) (|PositiveInteger|)) "\\spad{numeric(x,{}n)} returns a real approximation of \\spad{x} up to \\spad{n} decimal places.") (((|Float|) (|Fraction| (|Polynomial| |#1|))) "\\spad{numeric(x)} returns a real approximation of \\spad{x}.") (((|Float|) (|Polynomial| |#1|) (|PositiveInteger|)) "\\spad{numeric(x,{}n)} returns a real approximation of \\spad{x} up to \\spad{n} decimal places.") (((|Float|) (|Polynomial| |#1|)) "\\spad{numeric(x)} returns a real approximation of \\spad{x}.") (((|Float|) |#1| (|PositiveInteger|)) "\\spad{numeric(x,{} n)} returns a real approximation of \\spad{x} up to \\spad{n} decimal places.") (((|Float|) |#1|) "\\spad{numeric(x)} returns a real approximation of \\spad{x}."))) 
 NIL 
-((|HasCategory| |#1| (QUOTE (-513))) (-12 (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-784)))) (|HasCategory| |#1| (QUOTE (-970))) (|HasCategory| |#1| (QUOTE (-157)))) 
+((|HasCategory| |#1| (QUOTE (-513))) (-12 (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-783)))) (|HasCategory| |#1| (QUOTE (-970))) (|HasCategory| |#1| (QUOTE (-157)))) 
 (-722) 
 ((|constructor| (NIL "NumberFormats provides function to format and read arabic and roman numbers,{} to convert numbers to strings and to read floating-point numbers.")) (|ScanFloatIgnoreSpacesIfCan| (((|Union| (|Float|) "failed") (|String|)) "\\spad{ScanFloatIgnoreSpacesIfCan(s)} tries to form a floating point number from the string \\spad{s} ignoring any spaces.")) (|ScanFloatIgnoreSpaces| (((|Float|) (|String|)) "\\spad{ScanFloatIgnoreSpaces(s)} forms a floating point number from the string \\spad{s} ignoring any spaces. Error is generated if the string is not recognised as a floating point number.")) (|ScanRoman| (((|PositiveInteger|) (|String|)) "\\spad{ScanRoman(s)} forms an integer from a Roman numeral string \\spad{s}.")) (|FormatRoman| (((|String|) (|PositiveInteger|)) "\\spad{FormatRoman(n)} forms a Roman numeral string from an integer \\spad{n}.")) (|ScanArabic| (((|PositiveInteger|) (|String|)) "\\spad{ScanArabic(s)} forms an integer from an Arabic numeral string \\spad{s}.")) (|FormatArabic| (((|String|) (|PositiveInteger|)) "\\spad{FormatArabic(n)} forms an Arabic numeral string from an integer \\spad{n}."))) 
 NIL 
@@ -2853,664 +2853,664 @@ NIL
 NIL 
 NIL 
 (-731) 
-((|constructor| (NIL "\\indented{1}{Author: Gabriel Dos Reis} Date Created: October 24,{} 2007 Date Last Modified: January 18,{} 2008. An `ObjectProperty' is a pair of name and value.")) (|property| (($ (|Symbol|) (|SExpression|)) "\\spad{property(n,{}val)} constructs a property with name \\spad{`n'} and value `val'.")) (|value| (((|SExpression|) $) "\\spad{value(p)} returns value of property \\spad{p}")) (|name| (((|Symbol|) $) "\\spad{name(p)} returns the name of property \\spad{p}"))) 
-NIL 
-NIL 
-(-732) 
 ((|constructor| (NIL "Ordered sets which are also abelian cancellation monoids,{} such that the addition preserves the ordering."))) 
 NIL 
 NIL 
-(-733 S R) 
+(-732 S R) 
 ((|constructor| (NIL "OctonionCategory gives the categorial frame for the octonions,{} and eight-dimensional non-associative algebra,{} doubling the the quaternions in the same way as doubling the Complex numbers to get the quaternions.")) (|inv| (($ $) "\\spad{inv(o)} returns the inverse of \\spad{o} if it exists.")) (|rationalIfCan| (((|Union| (|Fraction| (|Integer|)) "failed") $) "\\spad{rationalIfCan(o)} returns the real part if all seven imaginary parts are 0,{} and \"failed\" otherwise.")) (|rational| (((|Fraction| (|Integer|)) $) "\\spad{rational(o)} returns the real part if all seven imaginary parts are 0. Error: if \\spad{o} is not rational.")) (|rational?| (((|Boolean|) $) "\\spad{rational?(o)} tests if \\spad{o} is rational,{} \\spadignore{i.e.} that all seven imaginary parts are 0.")) (|abs| ((|#2| $) "\\spad{abs(o)} computes the absolute value of an octonion,{} equal to the square root of the \\spadfunFrom{norm}{Octonion}.")) (|octon| (($ |#2| |#2| |#2| |#2| |#2| |#2| |#2| |#2|) "\\spad{octon(re,{}\\spad{ri},{}rj,{}rk,{}rE,{}rI,{}rJ,{}rK)} constructs an octonion from scalars.")) (|norm| ((|#2| $) "\\spad{norm(o)} returns the norm of an octonion,{} equal to the sum of the squares of its coefficients.")) (|imagK| ((|#2| $) "\\spad{imagK(o)} extracts the imaginary \\spad{K} part of octonion \\spad{o}.")) (|imagJ| ((|#2| $) "\\spad{imagJ(o)} extracts the imaginary \\spad{J} part of octonion \\spad{o}.")) (|imagI| ((|#2| $) "\\spad{imagI(o)} extracts the imaginary \\spad{I} part of octonion \\spad{o}.")) (|imagE| ((|#2| $) "\\spad{imagE(o)} extracts the imaginary \\spad{E} part of octonion \\spad{o}.")) (|imagk| ((|#2| $) "\\spad{imagk(o)} extracts the \\spad{k} part of octonion \\spad{o}.")) (|imagj| ((|#2| $) "\\spad{imagj(o)} extracts the \\spad{j} part of octonion \\spad{o}.")) (|imagi| ((|#2| $) "\\spad{imagi(o)} extracts the \\spad{i} part of octonion \\spad{o}.")) (|real| ((|#2| $) "\\spad{real(o)} extracts real part of octonion \\spad{o}.")) (|conjugate| (($ $) "\\spad{conjugate(o)} negates the imaginary parts \\spad{i},{}\\spad{j},{}\\spad{k},{}\\spad{E},{}\\spad{I},{}\\spad{J},{}\\spad{K} of octonian \\spad{o}."))) 
 NIL 
-((|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-506))) (|HasCategory| |#2| (QUOTE (-979))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-135))) (|HasCategory| |#2| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#2| (QUOTE (-784))) (|HasCategory| |#2| (QUOTE (-342)))) 
-(-734 R) 
+((|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-506))) (|HasCategory| |#2| (QUOTE (-979))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-135))) (|HasCategory| |#2| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#2| (QUOTE (-783))) (|HasCategory| |#2| (QUOTE (-342)))) 
+(-733 R) 
 ((|constructor| (NIL "OctonionCategory gives the categorial frame for the octonions,{} and eight-dimensional non-associative algebra,{} doubling the the quaternions in the same way as doubling the Complex numbers to get the quaternions.")) (|inv| (($ $) "\\spad{inv(o)} returns the inverse of \\spad{o} if it exists.")) (|rationalIfCan| (((|Union| (|Fraction| (|Integer|)) "failed") $) "\\spad{rationalIfCan(o)} returns the real part if all seven imaginary parts are 0,{} and \"failed\" otherwise.")) (|rational| (((|Fraction| (|Integer|)) $) "\\spad{rational(o)} returns the real part if all seven imaginary parts are 0. Error: if \\spad{o} is not rational.")) (|rational?| (((|Boolean|) $) "\\spad{rational?(o)} tests if \\spad{o} is rational,{} \\spadignore{i.e.} that all seven imaginary parts are 0.")) (|abs| ((|#1| $) "\\spad{abs(o)} computes the absolute value of an octonion,{} equal to the square root of the \\spadfunFrom{norm}{Octonion}.")) (|octon| (($ |#1| |#1| |#1| |#1| |#1| |#1| |#1| |#1|) "\\spad{octon(re,{}\\spad{ri},{}rj,{}rk,{}rE,{}rI,{}rJ,{}rK)} constructs an octonion from scalars.")) (|norm| ((|#1| $) "\\spad{norm(o)} returns the norm of an octonion,{} equal to the sum of the squares of its coefficients.")) (|imagK| ((|#1| $) "\\spad{imagK(o)} extracts the imaginary \\spad{K} part of octonion \\spad{o}.")) (|imagJ| ((|#1| $) "\\spad{imagJ(o)} extracts the imaginary \\spad{J} part of octonion \\spad{o}.")) (|imagI| ((|#1| $) "\\spad{imagI(o)} extracts the imaginary \\spad{I} part of octonion \\spad{o}.")) (|imagE| ((|#1| $) "\\spad{imagE(o)} extracts the imaginary \\spad{E} part of octonion \\spad{o}.")) (|imagk| ((|#1| $) "\\spad{imagk(o)} extracts the \\spad{k} part of octonion \\spad{o}.")) (|imagj| ((|#1| $) "\\spad{imagj(o)} extracts the \\spad{j} part of octonion \\spad{o}.")) (|imagi| ((|#1| $) "\\spad{imagi(o)} extracts the \\spad{i} part of octonion \\spad{o}.")) (|real| ((|#1| $) "\\spad{real(o)} extracts real part of octonion \\spad{o}.")) (|conjugate| (($ $) "\\spad{conjugate(o)} negates the imaginary parts \\spad{i},{}\\spad{j},{}\\spad{k},{}\\spad{E},{}\\spad{I},{}\\spad{J},{}\\spad{K} of octonian \\spad{o}."))) 
 ((-4227 . T) (-4228 . T) (-4230 . T)) 
 NIL 
-(-735 -3703 R OS S) 
+(-734 -3703 R OS S) 
 ((|constructor| (NIL "OctonionCategoryFunctions2 implements functions between two octonion domains defined over different rings. The function map is used to coerce between octonion types.")) (|map| ((|#3| (|Mapping| |#4| |#2|) |#1|) "\\spad{map(f,{}u)} maps \\spad{f} onto the component parts of the octonion \\spad{u}."))) 
 NIL 
 NIL 
-(-736 R) 
+(-735 R) 
 ((|constructor| (NIL "Octonion implements octonions (Cayley-Dixon algebra) over a commutative ring,{} an eight-dimensional non-associative algebra,{} doubling the quaternions in the same way as doubling the complex numbers to get the quaternions the main constructor function is {\\em octon} which takes 8 arguments: the real part,{} the \\spad{i} imaginary part,{} the \\spad{j} imaginary part,{} the \\spad{k} imaginary part,{} (as with quaternions) and in addition the imaginary parts \\spad{E},{} \\spad{I},{} \\spad{J},{} \\spad{K}.")) (|octon| (($ (|Quaternion| |#1|) (|Quaternion| |#1|)) "\\spad{octon(qe,{}qE)} constructs an octonion from two quaternions using the relation {\\em O = Q + QE}."))) 
 ((-4227 . T) (-4228 . T) (-4230 . T)) 
-((|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| |#1| (QUOTE (-342))) (|HasCategory| |#1| (LIST (QUOTE -482) (QUOTE (-1084)) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -261) (|devaluate| |#1|) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-979))) (|HasCategory| |#1| (QUOTE (-506))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| (-924 |#1|) (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| (-924 |#1|) (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (-3703 (|HasCategory| (-924 |#1|) (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521)))))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))) (-3703 (|HasCategory| (-924 |#1|) (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))))) 
-(-737) 
+((|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#1| (QUOTE (-342))) (|HasCategory| |#1| (LIST (QUOTE -482) (QUOTE (-1084)) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -261) (|devaluate| |#1|) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-979))) (|HasCategory| |#1| (QUOTE (-506))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| (-924 |#1|) (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| (-924 |#1|) (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (-3703 (|HasCategory| (-924 |#1|) (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521)))))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))) (-3703 (|HasCategory| (-924 |#1|) (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))))) 
+(-736) 
 ((|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 
-(-738 R -4049 L) 
+(-737 R -4049 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 
-(-739 R -4049) 
+(-738 R -4049) 
 ((|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 
-(-740) 
+(-739) 
 ((|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 
-(-741 R -4049) 
+(-740 R -4049) 
 ((|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 
-(-742) 
+(-741) 
 ((|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 
-(-743 -4049 UP UPUP R) 
+(-742 -4049 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 
-(-744 -4049 UP L LQ) 
+(-743 -4049 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 
-(-745) 
+(-744) 
 ((|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| (((|OutputForm|) $) "\\spad{coerce(x)} \\undocumented{}") (($ (|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 
-(-746 -4049 UP L LQ) 
+(-745 -4049 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 
-(-747 -4049 UP) 
+(-746 -4049 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 
-(-748 -4049 L UP A LO) 
+(-747 -4049 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 
-(-749 -4049 UP) 
+(-748 -4049 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)))) 
-(-750 -4049 LO) 
+(-749 -4049 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 
-(-751 -4049 LODO) 
+(-750 -4049 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 
-(-752 -2617 S |f|) 
+(-751 -2623 S |f|) 
 ((|constructor| (NIL "\\indented{2}{This type represents the finite direct or cartesian product of an} underlying ordered component type. The ordering on the type is determined by its third argument which represents the less than function on vectors. This type is a suitable third argument for \\spadtype{GeneralDistributedMultivariatePolynomial}."))) 
 ((-4227 |has| |#2| (-970)) (-4228 |has| |#2| (-970)) (-4230 |has| |#2| (-6 -4230)) ((-4235 "*") |has| |#2| (-157)) (-4233 . T)) 
-((|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-970))) (|HasCategory| |#2| (QUOTE (-729))) (|HasCategory| |#2| (QUOTE (-782))) (-3703 (|HasCategory| |#2| (QUOTE (-729))) (|HasCategory| |#2| (QUOTE (-782)))) (|HasCategory| |#2| (QUOTE (-157))) (-3703 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-970)))) (-3703 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-337)))) (-3703 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-970)))) (|HasCategory| |#2| (QUOTE (-342))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-210))) (-3703 (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-970)))) (-3703 (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (QUOTE (-970)))) (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| (-521) (QUOTE (-784))) (-12 (|HasCategory| |#2| (QUOTE (-970))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (QUOTE (-970)))) (-12 (|HasCategory| |#2| (QUOTE (-970))) (|HasCategory| |#2| (LIST (QUOTE -829) (QUOTE (-1084))))) (|HasCategory| |#2| (QUOTE (-663))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-3703 (|HasCategory| |#2| (QUOTE (-970))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521)))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-1013)))) (|HasAttribute| |#2| (QUOTE -4230)) (|HasCategory| |#2| (QUOTE (-124))) (-3703 (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-124))) (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-970)))) (|HasCategory| |#2| (QUOTE (-25))) (-3703 (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-124))) (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-342))) (|HasCategory| |#2| (QUOTE (-729))) (|HasCategory| |#2| (QUOTE (-782))) (|HasCategory| |#2| (QUOTE (-970))) (|HasCategory| |#2| (QUOTE (-1013)))) (-3703 (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-124))) (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-970)))) (-3703 (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -829) (QUOTE (-1084))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-25)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-124)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-157)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-210)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-337)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-342)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-729)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-782)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-970)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-1013))))) (-3703 (-12 (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-124))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-342))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-729))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-782))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-970))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521)))))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-3703 (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-124))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-342))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-729))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-782))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-970))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -829) (QUOTE (-1084)))))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-792)))) (-3703 (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-1013)))) (-12 (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (QUOTE (-970)))) (-12 (|HasCategory| |#2| (QUOTE (-970))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-970))) (|HasCategory| |#2| (LIST (QUOTE -829) (QUOTE (-1084))))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-792)))))) 
-(-753 R) 
+((|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-970))) (|HasCategory| |#2| (QUOTE (-729))) (|HasCategory| |#2| (QUOTE (-781))) (-3703 (|HasCategory| |#2| (QUOTE (-729))) (|HasCategory| |#2| (QUOTE (-781)))) (|HasCategory| |#2| (QUOTE (-157))) (-3703 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-970)))) (-3703 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-337)))) (-3703 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-970)))) (|HasCategory| |#2| (QUOTE (-342))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-210))) (-3703 (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-970)))) (-3703 (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (QUOTE (-970)))) (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| (-521) (QUOTE (-783))) (-12 (|HasCategory| |#2| (QUOTE (-970))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (QUOTE (-970)))) (-12 (|HasCategory| |#2| (QUOTE (-970))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1084))))) (|HasCategory| |#2| (QUOTE (-663))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-3703 (|HasCategory| |#2| (QUOTE (-970))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521)))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-1013)))) (|HasAttribute| |#2| (QUOTE -4230)) (|HasCategory| |#2| (QUOTE (-124))) (-3703 (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-124))) (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-970)))) (|HasCategory| |#2| (QUOTE (-25))) (-3703 (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-124))) (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-342))) (|HasCategory| |#2| (QUOTE (-729))) (|HasCategory| |#2| (QUOTE (-781))) (|HasCategory| |#2| (QUOTE (-970))) (|HasCategory| |#2| (QUOTE (-1013)))) (-3703 (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-124))) (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-970)))) (-3703 (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1084))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-25)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-124)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-157)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-210)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-337)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-342)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-729)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-781)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-970)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-1013))))) (-3703 (-12 (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-124))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-342))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-729))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-781))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-970))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521)))))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-3703 (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-124))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-342))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-729))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-781))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-970))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1084)))))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-791)))) (-3703 (-12 (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-1013)))) (-12 (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (QUOTE (-970)))) (-12 (|HasCategory| |#2| (QUOTE (-970))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (QUOTE (-970))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1084))))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-791)))))) 
+(-752 R) 
 ((|constructor| (NIL "\\spadtype{OrderlyDifferentialPolynomial} implements an ordinary differential polynomial ring in arbitrary number of differential indeterminates,{} with coefficients in a ring. The ranking on the differential indeterminate is orderly. This is analogous to the domain \\spadtype{Polynomial}. \\blankline"))) 
 (((-4235 "*") |has| |#1| (-157)) (-4226 |has| |#1| (-513)) (-4231 |has| |#1| (-6 -4231)) (-4228 . T) (-4227 . T) (-4230 . T)) 
-((|HasCategory| |#1| (QUOTE (-838))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-157))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-513)))) (-12 (|HasCategory| (-755 (-1084)) (LIST (QUOTE -815) (QUOTE (-353)))) (|HasCategory| |#1| (LIST (QUOTE -815) (QUOTE (-353))))) (-12 (|HasCategory| (-755 (-1084)) (LIST (QUOTE -815) (QUOTE (-521)))) (|HasCategory| |#1| (LIST (QUOTE -815) (QUOTE (-521))))) (-12 (|HasCategory| (-755 (-1084)) (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-353))))) (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-353)))))) (-12 (|HasCategory| (-755 (-1084)) (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521)))))) (-12 (|HasCategory| (-755 (-1084)) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497))))) (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| |#1| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-210))) (|HasCategory| |#1| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#1| (QUOTE (-337))) (-3703 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521)))))) (|HasAttribute| |#1| (QUOTE -4231)) (|HasCategory| |#1| (QUOTE (-425))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-838)))) (-3703 (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-838)))) (-3703 (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-838)))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-838)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-838)))) (|HasCategory| |#1| (QUOTE (-133))))) 
-(-754 |Kernels| R |var|) 
+((|HasCategory| |#1| (QUOTE (-837))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-157))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-513)))) (-12 (|HasCategory| (-754 (-1084)) (LIST (QUOTE -814) (QUOTE (-353)))) (|HasCategory| |#1| (LIST (QUOTE -814) (QUOTE (-353))))) (-12 (|HasCategory| (-754 (-1084)) (LIST (QUOTE -814) (QUOTE (-521)))) (|HasCategory| |#1| (LIST (QUOTE -814) (QUOTE (-521))))) (-12 (|HasCategory| (-754 (-1084)) (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-353))))) (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-353)))))) (-12 (|HasCategory| (-754 (-1084)) (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521)))))) (-12 (|HasCategory| (-754 (-1084)) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497))))) (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#1| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-210))) (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#1| (QUOTE (-337))) (-3703 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521)))))) (|HasAttribute| |#1| (QUOTE -4231)) (|HasCategory| |#1| (QUOTE (-425))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-837)))) (-3703 (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-837)))) (-3703 (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-837)))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-837)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-837)))) (|HasCategory| |#1| (QUOTE (-133))))) 
+(-753 |Kernels| R |var|) 
 ((|constructor| (NIL "This constructor produces an ordinary differential ring from a partial differential ring by specifying a variable.")) (|coerce| ((|#2| $) "\\spad{coerce(p)} views \\spad{p} as a valie in the partial differential ring.") (($ |#2|) "\\spad{coerce(r)} views \\spad{r} as a value in the ordinary differential ring."))) 
 (((-4235 "*") |has| |#2| (-337)) (-4226 |has| |#2| (-337)) (-4231 |has| |#2| (-337)) (-4225 |has| |#2| (-337)) (-4230 . T) (-4228 . T) (-4227 . T)) 
 ((|HasCategory| |#2| (QUOTE (-337)))) 
-(-755 S) 
+(-754 S) 
 ((|constructor| (NIL "\\spadtype{OrderlyDifferentialVariable} adds a commonly used orderly ranking to the set of derivatives of an ordered list of differential indeterminates. An orderly ranking is a ranking \\spadfun{<} of the derivatives with the property that for two derivatives \\spad{u} and \\spad{v},{} \\spad{u} \\spadfun{<} \\spad{v} if the \\spadfun{order} of \\spad{u} is less than that of \\spad{v}. This domain belongs to \\spadtype{DifferentialVariableCategory}. It defines \\spadfun{weight} to be just \\spadfun{order},{} and it defines an orderly ranking \\spadfun{<} on derivatives \\spad{u} via the lexicographic order on the pair (\\spadfun{order}(\\spad{u}),{} \\spadfun{variable}(\\spad{u}))."))) 
 NIL 
 NIL 
-(-756 S) 
+(-755 S) 
 ((|constructor| (NIL "\\indented{3}{The free monoid on a set \\spad{S} is the monoid of finite products of} the form \\spad{reduce(*,{}[\\spad{si} ** \\spad{ni}])} where the \\spad{si}\\spad{'s} are in \\spad{S},{} and the \\spad{ni}\\spad{'s} are non-negative integers. The multiplication is not commutative. For two elements \\spad{x} and \\spad{y} the relation \\spad{x < y} holds if either \\spad{length(x) < length(y)} holds or if these lengths are equal and if \\spad{x} is smaller than \\spad{y} \\spad{w}.\\spad{r}.\\spad{t}. the lexicographical ordering induced by \\spad{S}. This domain inherits implementation from \\spadtype{FreeMonoid}.")) (|varList| (((|List| |#1|) $) "\\spad{varList(x)} returns the list of variables of \\spad{x}.")) (|length| (((|NonNegativeInteger|) $) "\\spad{length(x)} returns the length of \\spad{x}.")) (|factors| (((|List| (|Record| (|:| |gen| |#1|) (|:| |exp| (|NonNegativeInteger|)))) $) "\\spad{factors(a1\\^e1,{}...,{}an\\^en)} returns \\spad{[[a1,{} e1],{}...,{}[an,{} en]]}.")) (|nthFactor| ((|#1| $ (|Integer|)) "\\spad{nthFactor(x,{} n)} returns the factor of the \\spad{n-th} monomial of \\spad{x}.")) (|nthExpon| (((|NonNegativeInteger|) $ (|Integer|)) "\\spad{nthExpon(x,{} n)} returns the exponent of the \\spad{n-th} monomial of \\spad{x}.")) (|size| (((|NonNegativeInteger|) $) "\\spad{size(x)} returns the number of monomials in \\spad{x}.")) (|overlap| (((|Record| (|:| |lm| $) (|:| |mm| $) (|:| |rm| $)) $ $) "\\spad{overlap(x,{} y)} returns \\spad{[l,{} m,{} r]} such that \\spad{x = l * m} and \\spad{y = m * r} hold and such that \\spad{l} and \\spad{r} have no overlap,{} that is \\spad{overlap(l,{} r) = [l,{} 1,{} r]}.")) (|div| (((|Union| (|Record| (|:| |lm| $) (|:| |rm| $)) "failed") $ $) "\\spad{x div y} returns the left and right exact quotients of \\spad{x} by \\spad{y},{} that is \\spad{[l,{} r]} such that \\spad{x = l * y * r}. \"failed\" is returned iff \\spad{x} is not of the form \\spad{l * y * r}.")) (|rquo| (((|Union| $ "failed") $ |#1|) "\\spad{rquo(x,{} s)} returns the exact right quotient of \\spad{x} by \\spad{s}.") (((|Union| $ "failed") $ $) "\\spad{rquo(x,{} y)} returns the exact right quotient of \\spad{x} by \\spad{y} that is \\spad{q} such that \\spad{x = q * y},{} \"failed\" if \\spad{x} is not of the form \\spad{q * y}.")) (|lquo| (((|Union| $ "failed") $ |#1|) "\\spad{lquo(x,{} s)} returns the exact left quotient of \\spad{x} by \\spad{s}.") (((|Union| $ "failed") $ $) "\\spad{lquo(x,{} y)} returns the exact left quotient of \\spad{x} \\indented{1}{by \\spad{y} that is \\spad{q} such that \\spad{x = y * q},{}} \"failed\" if \\spad{x} is not of the form \\spad{y * q}.")) (|hcrf| (($ $ $) "\\spad{hcrf(x,{} y)} returns the highest common right factor of \\spad{x} and \\spad{y},{} that is the largest \\spad{d} such that \\spad{x = a d} and \\spad{y = b d}.")) (|hclf| (($ $ $) "\\spad{hclf(x,{} y)} returns the highest common left factor of \\spad{x} and \\spad{y},{} that is the largest \\spad{d} such that \\spad{x = d a} and \\spad{y = d b}.")) (|lexico| (((|Boolean|) $ $) "\\spad{lexico(x,{}y)} returns \\spad{true} iff \\spad{x} is smaller than \\spad{y} \\spad{w}.\\spad{r}.\\spad{t}. the pure lexicographical ordering induced by \\spad{S}.")) (|mirror| (($ $) "\\spad{mirror(x)} returns the reversed word of \\spad{x}.")) (|rest| (($ $) "\\spad{rest(x)} returns \\spad{x} except the first letter.")) (|first| ((|#1| $) "\\spad{first(x)} returns the first letter of \\spad{x}.")) (** (($ |#1| (|NonNegativeInteger|)) "\\spad{s ** n} returns the product of \\spad{s} by itself \\spad{n} times.")) (* (($ $ |#1|) "\\spad{x * s} returns the product of \\spad{x} by \\spad{s} on the right.") (($ |#1| $) "\\spad{s * x} returns the product of \\spad{x} by \\spad{s} on the left."))) 
 NIL 
 NIL 
-(-757) 
+(-756) 
 ((|constructor| (NIL "The category of ordered commutative integral domains,{} where ordering and the arithmetic operations are compatible \\blankline"))) 
 ((-4226 . T) ((-4235 "*") . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
 NIL 
-(-758) 
+(-757) 
 ((|constructor| (NIL "\\spadtype{OpenMathConnection} provides low-level functions for handling connections to and from \\spadtype{OpenMathDevice}\\spad{s}.")) (|OMbindTCP| (((|Boolean|) $ (|SingleInteger|)) "\\spad{OMbindTCP}")) (|OMconnectTCP| (((|Boolean|) $ (|String|) (|SingleInteger|)) "\\spad{OMconnectTCP}")) (|OMconnOutDevice| (((|OpenMathDevice|) $) "\\spad{OMconnOutDevice:}")) (|OMconnInDevice| (((|OpenMathDevice|) $) "\\spad{OMconnInDevice:}")) (|OMcloseConn| (((|Void|) $) "\\spad{OMcloseConn}")) (|OMmakeConn| (($ (|SingleInteger|)) "\\spad{OMmakeConn}"))) 
 NIL 
 NIL 
-(-759) 
+(-758) 
 ((|constructor| (NIL "\\spadtype{OpenMathDevice} provides support for reading and writing openMath objects to files,{} strings etc. It also provides access to low-level operations from within the interpreter.")) (|OMgetType| (((|Symbol|) $) "\\spad{OMgetType(dev)} returns the type of the next object on \\axiom{\\spad{dev}}.")) (|OMgetSymbol| (((|Record| (|:| |cd| (|String|)) (|:| |name| (|String|))) $) "\\spad{OMgetSymbol(dev)} reads a symbol from \\axiom{\\spad{dev}}.")) (|OMgetString| (((|String|) $) "\\spad{OMgetString(dev)} reads a string from \\axiom{\\spad{dev}}.")) (|OMgetVariable| (((|Symbol|) $) "\\spad{OMgetVariable(dev)} reads a variable from \\axiom{\\spad{dev}}.")) (|OMgetFloat| (((|DoubleFloat|) $) "\\spad{OMgetFloat(dev)} reads a float from \\axiom{\\spad{dev}}.")) (|OMgetInteger| (((|Integer|) $) "\\spad{OMgetInteger(dev)} reads an integer from \\axiom{\\spad{dev}}.")) (|OMgetEndObject| (((|Void|) $) "\\spad{OMgetEndObject(dev)} reads an end object token from \\axiom{\\spad{dev}}.")) (|OMgetEndError| (((|Void|) $) "\\spad{OMgetEndError(dev)} reads an end error token from \\axiom{\\spad{dev}}.")) (|OMgetEndBVar| (((|Void|) $) "\\spad{OMgetEndBVar(dev)} reads an end bound variable list token from \\axiom{\\spad{dev}}.")) (|OMgetEndBind| (((|Void|) $) "\\spad{OMgetEndBind(dev)} reads an end binder token from \\axiom{\\spad{dev}}.")) (|OMgetEndAttr| (((|Void|) $) "\\spad{OMgetEndAttr(dev)} reads an end attribute token from \\axiom{\\spad{dev}}.")) (|OMgetEndAtp| (((|Void|) $) "\\spad{OMgetEndAtp(dev)} reads an end attribute pair token from \\axiom{\\spad{dev}}.")) (|OMgetEndApp| (((|Void|) $) "\\spad{OMgetEndApp(dev)} reads an end application token from \\axiom{\\spad{dev}}.")) (|OMgetObject| (((|Void|) $) "\\spad{OMgetObject(dev)} reads a begin object token from \\axiom{\\spad{dev}}.")) (|OMgetError| (((|Void|) $) "\\spad{OMgetError(dev)} reads a begin error token from \\axiom{\\spad{dev}}.")) (|OMgetBVar| (((|Void|) $) "\\spad{OMgetBVar(dev)} reads a begin bound variable list token from \\axiom{\\spad{dev}}.")) (|OMgetBind| (((|Void|) $) "\\spad{OMgetBind(dev)} reads a begin binder token from \\axiom{\\spad{dev}}.")) (|OMgetAttr| (((|Void|) $) "\\spad{OMgetAttr(dev)} reads a begin attribute token from \\axiom{\\spad{dev}}.")) (|OMgetAtp| (((|Void|) $) "\\spad{OMgetAtp(dev)} reads a begin attribute pair token from \\axiom{\\spad{dev}}.")) (|OMgetApp| (((|Void|) $) "\\spad{OMgetApp(dev)} reads a begin application token from \\axiom{\\spad{dev}}.")) (|OMputSymbol| (((|Void|) $ (|String|) (|String|)) "\\spad{OMputSymbol(dev,{}cd,{}s)} writes the symbol \\axiom{\\spad{s}} from \\spad{CD} \\axiom{\\spad{cd}} to \\axiom{\\spad{dev}}.")) (|OMputString| (((|Void|) $ (|String|)) "\\spad{OMputString(dev,{}i)} writes the string \\axiom{\\spad{i}} to \\axiom{\\spad{dev}}.")) (|OMputVariable| (((|Void|) $ (|Symbol|)) "\\spad{OMputVariable(dev,{}i)} writes the variable \\axiom{\\spad{i}} to \\axiom{\\spad{dev}}.")) (|OMputFloat| (((|Void|) $ (|DoubleFloat|)) "\\spad{OMputFloat(dev,{}i)} writes the float \\axiom{\\spad{i}} to \\axiom{\\spad{dev}}.")) (|OMputInteger| (((|Void|) $ (|Integer|)) "\\spad{OMputInteger(dev,{}i)} writes the integer \\axiom{\\spad{i}} to \\axiom{\\spad{dev}}.")) (|OMputEndObject| (((|Void|) $) "\\spad{OMputEndObject(dev)} writes an end object token to \\axiom{\\spad{dev}}.")) (|OMputEndError| (((|Void|) $) "\\spad{OMputEndError(dev)} writes an end error token to \\axiom{\\spad{dev}}.")) (|OMputEndBVar| (((|Void|) $) "\\spad{OMputEndBVar(dev)} writes an end bound variable list token to \\axiom{\\spad{dev}}.")) (|OMputEndBind| (((|Void|) $) "\\spad{OMputEndBind(dev)} writes an end binder token to \\axiom{\\spad{dev}}.")) (|OMputEndAttr| (((|Void|) $) "\\spad{OMputEndAttr(dev)} writes an end attribute token to \\axiom{\\spad{dev}}.")) (|OMputEndAtp| (((|Void|) $) "\\spad{OMputEndAtp(dev)} writes an end attribute pair token to \\axiom{\\spad{dev}}.")) (|OMputEndApp| (((|Void|) $) "\\spad{OMputEndApp(dev)} writes an end application token to \\axiom{\\spad{dev}}.")) (|OMputObject| (((|Void|) $) "\\spad{OMputObject(dev)} writes a begin object token to \\axiom{\\spad{dev}}.")) (|OMputError| (((|Void|) $) "\\spad{OMputError(dev)} writes a begin error token to \\axiom{\\spad{dev}}.")) (|OMputBVar| (((|Void|) $) "\\spad{OMputBVar(dev)} writes a begin bound variable list token to \\axiom{\\spad{dev}}.")) (|OMputBind| (((|Void|) $) "\\spad{OMputBind(dev)} writes a begin binder token to \\axiom{\\spad{dev}}.")) (|OMputAttr| (((|Void|) $) "\\spad{OMputAttr(dev)} writes a begin attribute token to \\axiom{\\spad{dev}}.")) (|OMputAtp| (((|Void|) $) "\\spad{OMputAtp(dev)} writes a begin attribute pair token to \\axiom{\\spad{dev}}.")) (|OMputApp| (((|Void|) $) "\\spad{OMputApp(dev)} writes a begin application token to \\axiom{\\spad{dev}}.")) (|OMsetEncoding| (((|Void|) $ (|OpenMathEncoding|)) "\\spad{OMsetEncoding(dev,{}enc)} sets the encoding used for reading or writing OpenMath objects to or from \\axiom{\\spad{dev}} to \\axiom{\\spad{enc}}.")) (|OMclose| (((|Void|) $) "\\spad{OMclose(dev)} closes \\axiom{\\spad{dev}},{} flushing output if necessary.")) (|OMopenString| (($ (|String|) (|OpenMathEncoding|)) "\\spad{OMopenString(s,{}mode)} opens the string \\axiom{\\spad{s}} for reading or writing OpenMath objects in encoding \\axiom{enc}.")) (|OMopenFile| (($ (|String|) (|String|) (|OpenMathEncoding|)) "\\spad{OMopenFile(f,{}mode,{}enc)} opens file \\axiom{\\spad{f}} for reading or writing OpenMath objects (depending on \\axiom{\\spad{mode}} which can be \\spad{\"r\"},{} \\spad{\"w\"} or \"a\" for read,{} write and append respectively),{} in the encoding \\axiom{\\spad{enc}}."))) 
 NIL 
 NIL 
-(-760) 
+(-759) 
 ((|constructor| (NIL "\\spadtype{OpenMathEncoding} is the set of valid OpenMath encodings.")) (|OMencodingBinary| (($) "\\spad{OMencodingBinary()} is the constant for the OpenMath binary encoding.")) (|OMencodingSGML| (($) "\\spad{OMencodingSGML()} is the constant for the deprecated OpenMath SGML encoding.")) (|OMencodingXML| (($) "\\spad{OMencodingXML()} is the constant for the OpenMath \\spad{XML} encoding.")) (|OMencodingUnknown| (($) "\\spad{OMencodingUnknown()} is the constant for unknown encoding types. If this is used on an input device,{} the encoding will be autodetected. It is invalid to use it on an output device."))) 
 NIL 
 NIL 
-(-761) 
+(-760) 
 ((|constructor| (NIL "\\spadtype{OpenMathErrorKind} represents different kinds of OpenMath errors: specifically parse errors,{} unknown \\spad{CD} or symbol errors,{} and read errors.")) (|OMReadError?| (((|Boolean|) $) "\\spad{OMReadError?(u)} tests whether \\spad{u} is an OpenMath read error.")) (|OMUnknownSymbol?| (((|Boolean|) $) "\\spad{OMUnknownSymbol?(u)} tests whether \\spad{u} is an OpenMath unknown symbol error.")) (|OMUnknownCD?| (((|Boolean|) $) "\\spad{OMUnknownCD?(u)} tests whether \\spad{u} is an OpenMath unknown \\spad{CD} error.")) (|OMParseError?| (((|Boolean|) $) "\\spad{OMParseError?(u)} tests whether \\spad{u} is an OpenMath parsing error.")) (|coerce| (($ (|Symbol|)) "\\spad{coerce(u)} creates an OpenMath error object of an appropriate type if \\axiom{\\spad{u}} is one of \\axiom{OMParseError},{} \\axiom{OMReadError},{} \\axiom{OMUnknownCD} or \\axiom{OMUnknownSymbol},{} otherwise it raises a runtime error."))) 
 NIL 
 NIL 
-(-762) 
+(-761) 
 ((|constructor| (NIL "\\spadtype{OpenMathError} is the domain of OpenMath errors.")) (|omError| (($ (|OpenMathErrorKind|) (|List| (|Symbol|))) "\\spad{omError(k,{}l)} creates an instance of OpenMathError.")) (|errorInfo| (((|List| (|Symbol|)) $) "\\spad{errorInfo(u)} returns information about the error \\spad{u}.")) (|errorKind| (((|OpenMathErrorKind|) $) "\\spad{errorKind(u)} returns the type of error which \\spad{u} represents."))) 
 NIL 
 NIL 
-(-763 R) 
+(-762 R) 
 ((|constructor| (NIL "\\spadtype{ExpressionToOpenMath} provides support for converting objects of type \\spadtype{Expression} into OpenMath."))) 
 NIL 
 NIL 
-(-764 P R) 
+(-763 P R) 
 ((|constructor| (NIL "This constructor creates the \\spadtype{MonogenicLinearOperator} domain which is ``opposite\\spad{''} in the ring sense to \\spad{P}. That is,{} as sets \\spad{P = \\$} but \\spad{a * b} in \\spad{\\$} is equal to \\spad{b * a} in \\spad{P}.")) (|po| ((|#1| $) "\\spad{po(q)} creates a value in \\spad{P} equal to \\spad{q} in \\$.")) (|op| (($ |#1|) "\\spad{op(p)} creates a value in \\$ equal to \\spad{p} in \\spad{P}."))) 
 ((-4227 . T) (-4228 . T) (-4230 . T)) 
 ((|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-210)))) 
-(-765) 
+(-764) 
 ((|constructor| (NIL "\\spadtype{OpenMath} provides operations for exporting an object in OpenMath format.")) (|OMwrite| (((|Void|) (|OpenMathDevice|) $ (|Boolean|)) "\\spad{OMwrite(dev,{} u,{} true)} writes the OpenMath form of \\axiom{\\spad{u}} to the OpenMath device \\axiom{\\spad{dev}} as a complete OpenMath object; OMwrite(\\spad{dev},{} \\spad{u},{} \\spad{false}) writes the object as an OpenMath fragment.") (((|Void|) (|OpenMathDevice|) $) "\\spad{OMwrite(dev,{} u)} writes the OpenMath form of \\axiom{\\spad{u}} to the OpenMath device \\axiom{\\spad{dev}} as a complete OpenMath object.") (((|String|) $ (|Boolean|)) "\\spad{OMwrite(u,{} true)} returns the OpenMath \\spad{XML} encoding of \\axiom{\\spad{u}} as a complete OpenMath object; OMwrite(\\spad{u},{} \\spad{false}) returns the OpenMath \\spad{XML} encoding of \\axiom{\\spad{u}} as an OpenMath fragment.") (((|String|) $) "\\spad{OMwrite(u)} returns the OpenMath \\spad{XML} encoding of \\axiom{\\spad{u}} as a complete OpenMath object."))) 
 NIL 
 NIL 
-(-766) 
+(-765) 
 ((|constructor| (NIL "\\spadtype{OpenMathPackage} provides some simple utilities to make reading OpenMath objects easier.")) (|OMunhandledSymbol| (((|Exit|) (|String|) (|String|)) "\\spad{OMunhandledSymbol(s,{}cd)} raises an error if AXIOM reads a symbol which it is unable to handle. Note that this is different from an unexpected symbol.")) (|OMsupportsSymbol?| (((|Boolean|) (|String|) (|String|)) "\\spad{OMsupportsSymbol?(s,{}cd)} returns \\spad{true} if AXIOM supports symbol \\axiom{\\spad{s}} from \\spad{CD} \\axiom{\\spad{cd}},{} \\spad{false} otherwise.")) (|OMsupportsCD?| (((|Boolean|) (|String|)) "\\spad{OMsupportsCD?(cd)} returns \\spad{true} if AXIOM supports \\axiom{\\spad{cd}},{} \\spad{false} otherwise.")) (|OMlistSymbols| (((|List| (|String|)) (|String|)) "\\spad{OMlistSymbols(cd)} lists all the symbols in \\axiom{\\spad{cd}}.")) (|OMlistCDs| (((|List| (|String|))) "\\spad{OMlistCDs()} lists all the \\spad{CDs} supported by AXIOM.")) (|OMreadStr| (((|Any|) (|String|)) "\\spad{OMreadStr(f)} reads an OpenMath object from \\axiom{\\spad{f}} and passes it to AXIOM.")) (|OMreadFile| (((|Any|) (|String|)) "\\spad{OMreadFile(f)} reads an OpenMath object from \\axiom{\\spad{f}} and passes it to AXIOM.")) (|OMread| (((|Any|) (|OpenMathDevice|)) "\\spad{OMread(dev)} reads an OpenMath object from \\axiom{\\spad{dev}} and passes it to AXIOM."))) 
 NIL 
 NIL 
-(-767 S) 
+(-766 S) 
 ((|constructor| (NIL "to become an in order iterator")) (|min| ((|#1| $) "\\spad{min(u)} returns the smallest entry in the multiset aggregate \\spad{u}."))) 
-((-4233 . T) (-4223 . T) (-4234 . T) (-2046 . T)) 
+((-4233 . T) (-4223 . T) (-4234 . T) (-2092 . T)) 
 NIL 
-(-768) 
+(-767) 
 ((|constructor| (NIL "\\spadtype{OpenMathServerPackage} provides the necessary operations to run AXIOM as an OpenMath server,{} reading/writing objects to/from a port. Please note the facilities available here are very basic. The idea is that a user calls \\spadignore{e.g.} \\axiom{Omserve(4000,{}60)} and then another process sends OpenMath objects to port 4000 and reads the result.")) (|OMserve| (((|Void|) (|SingleInteger|) (|SingleInteger|)) "\\spad{OMserve(portnum,{}timeout)} puts AXIOM into server mode on port number \\axiom{\\spad{portnum}}. The parameter \\axiom{\\spad{timeout}} specifies the \\spad{timeout} period for the connection.")) (|OMsend| (((|Void|) (|OpenMathConnection|) (|Any|)) "\\spad{OMsend(c,{}u)} attempts to output \\axiom{\\spad{u}} on \\aciom{\\spad{c}} in OpenMath.")) (|OMreceive| (((|Any|) (|OpenMathConnection|)) "\\spad{OMreceive(c)} reads an OpenMath object from connection \\axiom{\\spad{c}} and returns the appropriate AXIOM object."))) 
 NIL 
 NIL 
-(-769 R S) 
+(-768 R S) 
 ((|constructor| (NIL "Lifting of maps to one-point completions. Date Created: 4 Oct 1989 Date Last Updated: 4 Oct 1989")) (|map| (((|OnePointCompletion| |#2|) (|Mapping| |#2| |#1|) (|OnePointCompletion| |#1|) (|OnePointCompletion| |#2|)) "\\spad{map(f,{} r,{} i)} lifts \\spad{f} and applies it to \\spad{r},{} assuming that \\spad{f}(infinity) = \\spad{i}.") (((|OnePointCompletion| |#2|) (|Mapping| |#2| |#1|) (|OnePointCompletion| |#1|)) "\\spad{map(f,{} r)} lifts \\spad{f} and applies it to \\spad{r},{} assuming that \\spad{f}(infinity) = infinity."))) 
 NIL 
 NIL 
-(-770 R) 
+(-769 R) 
 ((|constructor| (NIL "Adjunction of a complex infinity to a set. Date Created: 4 Oct 1989 Date Last Updated: 1 Nov 1989")) (|rationalIfCan| (((|Union| (|Fraction| (|Integer|)) "failed") $) "\\spad{rationalIfCan(x)} returns \\spad{x} as a finite rational number if it is one,{} \"failed\" otherwise.")) (|rational| (((|Fraction| (|Integer|)) $) "\\spad{rational(x)} returns \\spad{x} as a finite rational number. Error: if \\spad{x} is not a rational number.")) (|rational?| (((|Boolean|) $) "\\spad{rational?(x)} tests if \\spad{x} is a finite rational number.")) (|infinite?| (((|Boolean|) $) "\\spad{infinite?(x)} tests if \\spad{x} is infinite.")) (|finite?| (((|Boolean|) $) "\\spad{finite?(x)} tests if \\spad{x} is finite.")) (|infinity| (($) "\\spad{infinity()} returns infinity."))) 
-((-4230 |has| |#1| (-782))) 
-((|HasCategory| |#1| (QUOTE (-782))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-506))) (-3703 (|HasCategory| |#1| (QUOTE (-782))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-21))) (-3703 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-782))))) 
-(-771 R) 
+((-4230 |has| |#1| (-781))) 
+((|HasCategory| |#1| (QUOTE (-781))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-506))) (-3703 (|HasCategory| |#1| (QUOTE (-781))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-21))) (-3703 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-781))))) 
+(-770 R) 
 ((|constructor| (NIL "Algebra of ADDITIVE operators over a ring."))) 
 ((-4228 |has| |#1| (-157)) (-4227 |has| |#1| (-157)) (-4230 . T)) 
 ((|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135)))) 
-(-772) 
+(-771) 
 ((|constructor| (NIL "This package exports tools to create AXIOM Library information databases.")) (|getDatabase| (((|Database| (|IndexCard|)) (|String|)) "\\spad{getDatabase(\"char\")} returns a list of appropriate entries in the browser database. The legal values for \\spad{\"char\"} are \"o\" (operations),{} \\spad{\"k\"} (constructors),{} \\spad{\"d\"} (domains),{} \\spad{\"c\"} (categories) or \\spad{\"p\"} (packages)."))) 
 NIL 
 NIL 
-(-773) 
+(-772) 
 ((|numericalOptimization| (((|Result|) (|Record| (|:| |fn| (|Expression| (|DoubleFloat|))) (|:| |init| (|List| (|DoubleFloat|))) (|:| |lb| (|List| (|OrderedCompletion| (|DoubleFloat|)))) (|:| |cf| (|List| (|Expression| (|DoubleFloat|)))) (|:| |ub| (|List| (|OrderedCompletion| (|DoubleFloat|)))))) "\\spad{numericalOptimization(args)} performs the optimization of the function given the strategy or method returned by \\axiomFun{measure}.") (((|Result|) (|Record| (|:| |lfn| (|List| (|Expression| (|DoubleFloat|)))) (|:| |init| (|List| (|DoubleFloat|))))) "\\spad{numericalOptimization(args)} performs the optimization of the function given the strategy or method returned by \\axiomFun{measure}.")) (|measure| (((|Record| (|:| |measure| (|Float|)) (|:| |explanations| (|String|))) (|RoutinesTable|) (|Record| (|:| |lfn| (|List| (|Expression| (|DoubleFloat|)))) (|:| |init| (|List| (|DoubleFloat|))))) "\\spad{measure(R,{}args)} calculates an estimate of the ability of a particular method to solve an optimization 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.") (((|Record| (|:| |measure| (|Float|)) (|:| |explanations| (|String|))) (|RoutinesTable|) (|Record| (|:| |fn| (|Expression| (|DoubleFloat|))) (|:| |init| (|List| (|DoubleFloat|))) (|:| |lb| (|List| (|OrderedCompletion| (|DoubleFloat|)))) (|:| |cf| (|List| (|Expression| (|DoubleFloat|)))) (|:| |ub| (|List| (|OrderedCompletion| (|DoubleFloat|)))))) "\\spad{measure(R,{}args)} calculates an estimate of the ability of a particular method to solve an optimization 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 
-(-774) 
+(-773) 
 ((|goodnessOfFit| (((|Result|) (|List| (|Expression| (|Float|))) (|List| (|Float|))) "\\spad{goodnessOfFit(lf,{}start)} is a top level ANNA function to check to goodness of fit of a least squares model \\spadignore{i.e.} the minimization of a set of functions,{} \\axiom{\\spad{lf}},{} of one or more variables without constraints. \\blankline The parameter \\axiom{\\spad{start}} is a list of the initial guesses of the values of the variables. \\blankline It iterates over the \\axiom{domains} of \\axiomType{NumericalOptimizationCategory} to get the name and other relevant information of the best \\axiom{measure} and then optimize the function on that \\axiom{domain}. It then calls the numerical routine \\axiomType{E04YCF} to get estimates of the variance-covariance matrix of the regression coefficients of the least-squares problem. \\blankline It thus returns both the results of the optimization and the variance-covariance calculation. goodnessOfFit(\\spad{lf},{}\\spad{start}) is a top level function to iterate over the \\axiom{domains} of \\axiomType{NumericalOptimizationCategory} to get the name and other relevant information of the best \\axiom{measure} and then optimize the function on that \\axiom{domain}. It then checks the goodness of fit of the least squares model.") (((|Result|) (|NumericalOptimizationProblem|)) "\\spad{goodnessOfFit(prob)} is a top level ANNA function to check to goodness of fit of a least squares model as defined within \\axiom{\\spad{prob}}. \\blankline It iterates over the \\axiom{domains} of \\axiomType{NumericalOptimizationCategory} to get the name and other relevant information of the best \\axiom{measure} and then optimize the function on that \\axiom{domain}. It then calls the numerical routine \\axiomType{E04YCF} to get estimates of the variance-covariance matrix of the regression coefficients of the least-squares problem. \\blankline It thus returns both the results of the optimization and the variance-covariance calculation.")) (|optimize| (((|Result|) (|List| (|Expression| (|Float|))) (|List| (|Float|))) "\\spad{optimize(lf,{}start)} is a top level ANNA function to minimize a set of functions,{} \\axiom{\\spad{lf}},{} of one or more variables without constraints \\spadignore{i.e.} a least-squares problem. \\blankline The parameter \\axiom{\\spad{start}} is a list of the initial guesses of the values of the variables. \\blankline It iterates over the \\axiom{domains} of \\axiomType{NumericalOptimizationCategory} to get the name and other relevant information of the best \\axiom{measure} and then optimize the function on that \\axiom{domain}.") (((|Result|) (|Expression| (|Float|)) (|List| (|Float|))) "\\spad{optimize(f,{}start)} is a top level ANNA function to minimize a function,{} \\axiom{\\spad{f}},{} of one or more variables without constraints. \\blankline The parameter \\axiom{\\spad{start}} is a list of the initial guesses of the values of the variables. \\blankline It iterates over the \\axiom{domains} of \\axiomType{NumericalOptimizationCategory} to get the name and other relevant information of the best \\axiom{measure} and then optimize the function on that \\axiom{domain}.") (((|Result|) (|Expression| (|Float|)) (|List| (|Float|)) (|List| (|OrderedCompletion| (|Float|))) (|List| (|OrderedCompletion| (|Float|)))) "\\spad{optimize(f,{}start,{}lower,{}upper)} is a top level ANNA function to minimize a function,{} \\axiom{\\spad{f}},{} of one or more variables with simple constraints. The bounds on the variables are defined in \\axiom{\\spad{lower}} and \\axiom{\\spad{upper}}. \\blankline The parameter \\axiom{\\spad{start}} is a list of the initial guesses of the values of the variables. \\blankline It iterates over the \\axiom{domains} of \\axiomType{NumericalOptimizationCategory} to get the name and other relevant information of the best \\axiom{measure} and then optimize the function on that \\axiom{domain}.") (((|Result|) (|Expression| (|Float|)) (|List| (|Float|)) (|List| (|OrderedCompletion| (|Float|))) (|List| (|Expression| (|Float|))) (|List| (|OrderedCompletion| (|Float|)))) "\\spad{optimize(f,{}start,{}lower,{}cons,{}upper)} is a top level ANNA function to minimize a function,{} \\axiom{\\spad{f}},{} of one or more variables with the given constraints. \\blankline These constraints may be simple constraints on the variables in which case \\axiom{\\spad{cons}} would be an empty list and the bounds on those variables defined in \\axiom{\\spad{lower}} and \\axiom{\\spad{upper}},{} or a mixture of simple,{} linear and non-linear constraints,{} where \\axiom{\\spad{cons}} contains the linear and non-linear constraints and the bounds on these are added to \\axiom{\\spad{upper}} and \\axiom{\\spad{lower}}. \\blankline The parameter \\axiom{\\spad{start}} is a list of the initial guesses of the values of the variables. \\blankline It iterates over the \\axiom{domains} of \\axiomType{NumericalOptimizationCategory} to get the name and other relevant information of the best \\axiom{measure} and then optimize the function on that \\axiom{domain}.") (((|Result|) (|NumericalOptimizationProblem|)) "\\spad{optimize(prob)} is a top level ANNA function to minimize a function or a set of functions with any constraints as defined within \\axiom{\\spad{prob}}. \\blankline It iterates over the \\axiom{domains} of \\axiomType{NumericalOptimizationCategory} to get the name and other relevant information of the best \\axiom{measure} and then optimize the function on that \\axiom{domain}.") (((|Result|) (|NumericalOptimizationProblem|) (|RoutinesTable|)) "\\spad{optimize(prob,{}routines)} is a top level ANNA function to minimize a function or a set of functions with any constraints as defined within \\axiom{\\spad{prob}}. \\blankline It iterates over the \\axiom{domains} listed in \\axiom{\\spad{routines}} of \\axiomType{NumericalOptimizationCategory} to get the name and other relevant information of the best \\axiom{measure} and then optimize the function on that \\axiom{domain}.")) (|measure| (((|Record| (|:| |measure| (|Float|)) (|:| |name| (|String|)) (|:| |explanations| (|List| (|String|)))) (|NumericalOptimizationProblem|) (|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 optimization problem defined by \\axiom{\\spad{prob}} by checking various attributes of the functions and calculating a measure of compatibility of each routine to these attributes. \\blankline It calls each \\axiom{domain} listed in \\axiom{\\spad{R}} of \\axiom{category} \\axiomType{NumericalOptimizationCategory} 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|)))) (|NumericalOptimizationProblem|)) "\\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 optimization problem defined by \\axiom{\\spad{prob}} by checking various attributes of the functions and calculating a measure of compatibility of each routine to these attributes. \\blankline It calls each \\axiom{domain} of \\axiom{category} \\axiomType{NumericalOptimizationCategory} 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."))) 
 NIL 
 NIL 
-(-775) 
+(-774) 
 ((|retract| (((|Union| (|:| |noa| (|Record| (|:| |fn| (|Expression| (|DoubleFloat|))) (|:| |init| (|List| (|DoubleFloat|))) (|:| |lb| (|List| (|OrderedCompletion| (|DoubleFloat|)))) (|:| |cf| (|List| (|Expression| (|DoubleFloat|)))) (|:| |ub| (|List| (|OrderedCompletion| (|DoubleFloat|)))))) (|:| |lsa| (|Record| (|:| |lfn| (|List| (|Expression| (|DoubleFloat|)))) (|:| |init| (|List| (|DoubleFloat|)))))) $) "\\spad{retract(x)} \\undocumented{}")) (|coerce| (((|OutputForm|) $) "\\spad{coerce(x)} \\undocumented{}") (($ (|Union| (|:| |noa| (|Record| (|:| |fn| (|Expression| (|DoubleFloat|))) (|:| |init| (|List| (|DoubleFloat|))) (|:| |lb| (|List| (|OrderedCompletion| (|DoubleFloat|)))) (|:| |cf| (|List| (|Expression| (|DoubleFloat|)))) (|:| |ub| (|List| (|OrderedCompletion| (|DoubleFloat|)))))) (|:| |lsa| (|Record| (|:| |lfn| (|List| (|Expression| (|DoubleFloat|)))) (|:| |init| (|List| (|DoubleFloat|))))))) "\\spad{coerce(x)} \\undocumented{}") (($ (|Record| (|:| |lfn| (|List| (|Expression| (|DoubleFloat|)))) (|:| |init| (|List| (|DoubleFloat|))))) "\\spad{coerce(x)} \\undocumented{}") (($ (|Record| (|:| |fn| (|Expression| (|DoubleFloat|))) (|:| |init| (|List| (|DoubleFloat|))) (|:| |lb| (|List| (|OrderedCompletion| (|DoubleFloat|)))) (|:| |cf| (|List| (|Expression| (|DoubleFloat|)))) (|:| |ub| (|List| (|OrderedCompletion| (|DoubleFloat|)))))) "\\spad{coerce(x)} \\undocumented{}"))) 
 NIL 
 NIL 
-(-776 R S) 
+(-775 R S) 
 ((|constructor| (NIL "Lifting of maps to ordered completions. Date Created: 4 Oct 1989 Date Last Updated: 4 Oct 1989")) (|map| (((|OrderedCompletion| |#2|) (|Mapping| |#2| |#1|) (|OrderedCompletion| |#1|) (|OrderedCompletion| |#2|) (|OrderedCompletion| |#2|)) "\\spad{map(f,{} r,{} p,{} m)} lifts \\spad{f} and applies it to \\spad{r},{} assuming that \\spad{f}(plusInfinity) = \\spad{p} and that \\spad{f}(minusInfinity) = \\spad{m}.") (((|OrderedCompletion| |#2|) (|Mapping| |#2| |#1|) (|OrderedCompletion| |#1|)) "\\spad{map(f,{} r)} lifts \\spad{f} and applies it to \\spad{r},{} assuming that \\spad{f}(plusInfinity) = plusInfinity and that \\spad{f}(minusInfinity) = minusInfinity."))) 
 NIL 
 NIL 
-(-777 R) 
+(-776 R) 
 ((|constructor| (NIL "Adjunction of two real infinites quantities to a set. Date Created: 4 Oct 1989 Date Last Updated: 1 Nov 1989")) (|rationalIfCan| (((|Union| (|Fraction| (|Integer|)) "failed") $) "\\spad{rationalIfCan(x)} returns \\spad{x} as a finite rational number if it is one and \"failed\" otherwise.")) (|rational| (((|Fraction| (|Integer|)) $) "\\spad{rational(x)} returns \\spad{x} as a finite rational number. Error: if \\spad{x} cannot be so converted.")) (|rational?| (((|Boolean|) $) "\\spad{rational?(x)} tests if \\spad{x} is a finite rational number.")) (|whatInfinity| (((|SingleInteger|) $) "\\spad{whatInfinity(x)} returns 0 if \\spad{x} is finite,{} 1 if \\spad{x} is +infinity,{} and \\spad{-1} if \\spad{x} is -infinity.")) (|infinite?| (((|Boolean|) $) "\\spad{infinite?(x)} tests if \\spad{x} is +infinity or -infinity,{}")) (|finite?| (((|Boolean|) $) "\\spad{finite?(x)} tests if \\spad{x} is finite.")) (|minusInfinity| (($) "\\spad{minusInfinity()} returns -infinity.")) (|plusInfinity| (($) "\\spad{plusInfinity()} returns +infinity."))) 
-((-4230 |has| |#1| (-782))) 
-((|HasCategory| |#1| (QUOTE (-782))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-506))) (-3703 (|HasCategory| |#1| (QUOTE (-782))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-21))) (-3703 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-782))))) 
-(-778) 
+((-4230 |has| |#1| (-781))) 
+((|HasCategory| |#1| (QUOTE (-781))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-506))) (-3703 (|HasCategory| |#1| (QUOTE (-781))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-21))) (-3703 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-781))))) 
+(-777) 
 ((|constructor| (NIL "Ordered finite sets."))) 
 NIL 
 NIL 
-(-779 -2617 S) 
+(-778 -2623 S) 
 ((|constructor| (NIL "\\indented{3}{This package provides ordering functions on vectors which} are suitable parameters for OrderedDirectProduct.")) (|reverseLex| (((|Boolean|) (|Vector| |#2|) (|Vector| |#2|)) "\\spad{reverseLex(v1,{}v2)} return \\spad{true} if the vector \\spad{v1} is less than the vector \\spad{v2} in the ordering which is total degree refined by the reverse lexicographic ordering.")) (|totalLex| (((|Boolean|) (|Vector| |#2|) (|Vector| |#2|)) "\\spad{totalLex(v1,{}v2)} return \\spad{true} if the vector \\spad{v1} is less than the vector \\spad{v2} in the ordering which is total degree refined by lexicographic ordering.")) (|pureLex| (((|Boolean|) (|Vector| |#2|) (|Vector| |#2|)) "\\spad{pureLex(v1,{}v2)} return \\spad{true} if the vector \\spad{v1} is less than the vector \\spad{v2} in the lexicographic ordering."))) 
 NIL 
 NIL 
-(-780) 
+(-779) 
 ((|constructor| (NIL "Ordered sets which are also monoids,{} such that multiplication preserves the ordering. \\blankline"))) 
 NIL 
 NIL 
-(-781 S) 
+(-780 S) 
 ((|constructor| (NIL "Ordered sets which are also rings,{} that is,{} domains where the ring operations are compatible with the ordering. \\blankline")) (|abs| (($ $) "\\spad{abs(x)} returns the absolute value of \\spad{x}.")) (|sign| (((|Integer|) $) "\\spad{sign(x)} is 1 if \\spad{x} is positive,{} \\spad{-1} if \\spad{x} is negative,{} 0 if \\spad{x} equals 0.")) (|negative?| (((|Boolean|) $) "\\spad{negative?(x)} tests whether \\spad{x} is strictly less than 0.")) (|positive?| (((|Boolean|) $) "\\spad{positive?(x)} tests whether \\spad{x} is strictly greater than 0."))) 
 NIL 
 NIL 
-(-782) 
+(-781) 
 ((|constructor| (NIL "Ordered sets which are also rings,{} that is,{} domains where the ring operations are compatible with the ordering. \\blankline")) (|abs| (($ $) "\\spad{abs(x)} returns the absolute value of \\spad{x}.")) (|sign| (((|Integer|) $) "\\spad{sign(x)} is 1 if \\spad{x} is positive,{} \\spad{-1} if \\spad{x} is negative,{} 0 if \\spad{x} equals 0.")) (|negative?| (((|Boolean|) $) "\\spad{negative?(x)} tests whether \\spad{x} is strictly less than 0.")) (|positive?| (((|Boolean|) $) "\\spad{positive?(x)} tests whether \\spad{x} is strictly greater than 0."))) 
 ((-4230 . T)) 
 NIL 
-(-783 S) 
+(-782 S) 
 ((|constructor| (NIL "The class of totally ordered sets,{} that is,{} sets such that for each pair of elements \\spad{(a,{}b)} exactly one of the following relations holds \\spad{a<b or a=b or b<a} and the relation is transitive,{} \\spadignore{i.e.} \\spad{a<b and b<c => a<c}.")) (|min| (($ $ $) "\\spad{min(x,{}y)} returns the minimum of \\spad{x} and \\spad{y} relative to \\spad{\"<\"}.")) (|max| (($ $ $) "\\spad{max(x,{}y)} returns the maximum of \\spad{x} and \\spad{y} relative to \\spad{\"<\"}.")) (<= (((|Boolean|) $ $) "\\spad{x <= y} is a less than or equal test.")) (>= (((|Boolean|) $ $) "\\spad{x >= y} is a greater than or equal test.")) (> (((|Boolean|) $ $) "\\spad{x > y} is a greater than test.")) (< (((|Boolean|) $ $) "\\spad{x < y} is a strict total ordering on the elements of the set."))) 
 NIL 
 NIL 
-(-784) 
+(-783) 
 ((|constructor| (NIL "The class of totally ordered sets,{} that is,{} sets such that for each pair of elements \\spad{(a,{}b)} exactly one of the following relations holds \\spad{a<b or a=b or b<a} and the relation is transitive,{} \\spadignore{i.e.} \\spad{a<b and b<c => a<c}.")) (|min| (($ $ $) "\\spad{min(x,{}y)} returns the minimum of \\spad{x} and \\spad{y} relative to \\spad{\"<\"}.")) (|max| (($ $ $) "\\spad{max(x,{}y)} returns the maximum of \\spad{x} and \\spad{y} relative to \\spad{\"<\"}.")) (<= (((|Boolean|) $ $) "\\spad{x <= y} is a less than or equal test.")) (>= (((|Boolean|) $ $) "\\spad{x >= y} is a greater than or equal test.")) (> (((|Boolean|) $ $) "\\spad{x > y} is a greater than test.")) (< (((|Boolean|) $ $) "\\spad{x < y} is a strict total ordering on the elements of the set."))) 
 NIL 
 NIL 
-(-785 S R) 
+(-784 S R) 
 ((|constructor| (NIL "This is the category of univariate skew polynomials over an Ore coefficient ring. The multiplication is given by \\spad{x a = \\sigma(a) x + \\delta a}. This category is an evolution of the types \\indented{2}{MonogenicLinearOperator,{} OppositeMonogenicLinearOperator,{} and} \\indented{2}{NonCommutativeOperatorDivision} developped by Jean Della Dora and Stephen \\spad{M}. Watt.")) (|leftLcm| (($ $ $) "\\spad{leftLcm(a,{}b)} computes the value \\spad{m} of lowest degree such that \\spad{m = aa*a = bb*b} for some values \\spad{aa} and \\spad{bb}. The value \\spad{m} is computed using right-division.")) (|rightExtendedGcd| (((|Record| (|:| |coef1| $) (|:| |coef2| $) (|:| |generator| $)) $ $) "\\spad{rightExtendedGcd(a,{}b)} returns \\spad{[c,{}d]} such that \\spad{g = c * a + d * b = rightGcd(a,{} b)}.")) (|rightGcd| (($ $ $) "\\spad{rightGcd(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 right-division.")) (|rightExactQuotient| (((|Union| $ "failed") $ $) "\\spad{rightExactQuotient(a,{}b)} computes the value \\spad{q},{} if it exists such that \\spad{a = q*b}.")) (|rightRemainder| (($ $ $) "\\spad{rightRemainder(a,{}b)} computes 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}. The value \\spad{r} is returned.")) (|rightQuotient| (($ $ $) "\\spad{rightQuotient(a,{}b)} computes 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}. The value \\spad{q} is returned.")) (|rightDivide| (((|Record| (|:| |quotient| $) (|:| |remainder| $)) $ $) "\\spad{rightDivide(a,{}b)} 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{''}.")) (|rightLcm| (($ $ $) "\\spad{rightLcm(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.")) (|leftExtendedGcd| (((|Record| (|:| |coef1| $) (|:| |coef2| $) (|:| |generator| $)) $ $) "\\spad{leftExtendedGcd(a,{}b)} returns \\spad{[c,{}d]} such that \\spad{g = a * c + b * d = leftGcd(a,{} b)}.")) (|leftGcd| (($ $ $) "\\spad{leftGcd(a,{}b)} computes the value \\spad{g} of highest degree such that \\indented{3}{\\spad{a = g*aa}} \\indented{3}{\\spad{b = g*bb}} for some values \\spad{aa} and \\spad{bb}. The value \\spad{g} is computed using left-division.")) (|leftExactQuotient| (((|Union| $ "failed") $ $) "\\spad{leftExactQuotient(a,{}b)} computes the value \\spad{q},{} if it exists,{} \\indented{1}{such that \\spad{a = b*q}.}")) (|leftRemainder| (($ $ $) "\\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| (($ $ $) "\\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| $) (|:| |remainder| $)) $ $) "\\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{''}.")) (|primitivePart| (($ $) "\\spad{primitivePart(l)} returns \\spad{l0} such that \\spad{l = a * l0} for some a in \\spad{R},{} and \\spad{content(l0) = 1}.")) (|content| ((|#2| $) "\\spad{content(l)} returns the \\spad{gcd} of all the coefficients of \\spad{l}.")) (|monicRightDivide| (((|Record| (|:| |quotient| $) (|:| |remainder| $)) $ $) "\\spad{monicRightDivide(a,{}b)} 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{''}.")) (|monicLeftDivide| (((|Record| (|:| |quotient| $) (|:| |remainder| $)) $ $) "\\spad{monicLeftDivide(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}. \\spad{b} must be monic. This process is called ``left division\\spad{''}.")) (|exquo| (((|Union| $ "failed") $ |#2|) "\\spad{exquo(l,{} a)} returns the exact quotient of \\spad{l} by a,{} returning \\axiom{\"failed\"} if this is not possible.")) (|apply| ((|#2| $ |#2| |#2|) "\\spad{apply(p,{} c,{} m)} returns \\spad{p(m)} where the action is given by \\spad{x m = c sigma(m) + delta(m)}.")) (|coefficients| (((|List| |#2|) $) "\\spad{coefficients(l)} returns the list of all the nonzero coefficients of \\spad{l}.")) (|monomial| (($ |#2| (|NonNegativeInteger|)) "\\spad{monomial(c,{}k)} produces \\spad{c} times the \\spad{k}-th power of the generating operator,{} \\spad{monomial(1,{}1)}.")) (|coefficient| ((|#2| $ (|NonNegativeInteger|)) "\\spad{coefficient(l,{}k)} is \\spad{a(k)} if \\indented{2}{\\spad{l = sum(monomial(a(i),{}i),{} i = 0..n)}.}")) (|reductum| (($ $) "\\spad{reductum(l)} is \\spad{l - monomial(a(n),{}n)} if \\indented{2}{\\spad{l = sum(monomial(a(i),{}i),{} i = 0..n)}.}")) (|leadingCoefficient| ((|#2| $) "\\spad{leadingCoefficient(l)} is \\spad{a(n)} if \\indented{2}{\\spad{l = sum(monomial(a(i),{}i),{} i = 0..n)}.}")) (|minimumDegree| (((|NonNegativeInteger|) $) "\\spad{minimumDegree(l)} is the smallest \\spad{k} such that \\spad{a(k) ^= 0} if \\indented{2}{\\spad{l = sum(monomial(a(i),{}i),{} i = 0..n)}.}")) (|degree| (((|NonNegativeInteger|) $) "\\spad{degree(l)} is \\spad{n} if \\indented{2}{\\spad{l = sum(monomial(a(i),{}i),{} i = 0..n)}.}"))) 
 NIL 
 ((|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-425))) (|HasCategory| |#2| (QUOTE (-513))) (|HasCategory| |#2| (QUOTE (-157)))) 
-(-786 R) 
+(-785 R) 
 ((|constructor| (NIL "This is the category of univariate skew polynomials over an Ore coefficient ring. The multiplication is given by \\spad{x a = \\sigma(a) x + \\delta a}. This category is an evolution of the types \\indented{2}{MonogenicLinearOperator,{} OppositeMonogenicLinearOperator,{} and} \\indented{2}{NonCommutativeOperatorDivision} developped by Jean Della Dora and Stephen \\spad{M}. Watt.")) (|leftLcm| (($ $ $) "\\spad{leftLcm(a,{}b)} computes the value \\spad{m} of lowest degree such that \\spad{m = aa*a = bb*b} for some values \\spad{aa} and \\spad{bb}. The value \\spad{m} is computed using right-division.")) (|rightExtendedGcd| (((|Record| (|:| |coef1| $) (|:| |coef2| $) (|:| |generator| $)) $ $) "\\spad{rightExtendedGcd(a,{}b)} returns \\spad{[c,{}d]} such that \\spad{g = c * a + d * b = rightGcd(a,{} b)}.")) (|rightGcd| (($ $ $) "\\spad{rightGcd(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 right-division.")) (|rightExactQuotient| (((|Union| $ "failed") $ $) "\\spad{rightExactQuotient(a,{}b)} computes the value \\spad{q},{} if it exists such that \\spad{a = q*b}.")) (|rightRemainder| (($ $ $) "\\spad{rightRemainder(a,{}b)} computes 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}. The value \\spad{r} is returned.")) (|rightQuotient| (($ $ $) "\\spad{rightQuotient(a,{}b)} computes 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}. The value \\spad{q} is returned.")) (|rightDivide| (((|Record| (|:| |quotient| $) (|:| |remainder| $)) $ $) "\\spad{rightDivide(a,{}b)} 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{''}.")) (|rightLcm| (($ $ $) "\\spad{rightLcm(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.")) (|leftExtendedGcd| (((|Record| (|:| |coef1| $) (|:| |coef2| $) (|:| |generator| $)) $ $) "\\spad{leftExtendedGcd(a,{}b)} returns \\spad{[c,{}d]} such that \\spad{g = a * c + b * d = leftGcd(a,{} b)}.")) (|leftGcd| (($ $ $) "\\spad{leftGcd(a,{}b)} computes the value \\spad{g} of highest degree such that \\indented{3}{\\spad{a = g*aa}} \\indented{3}{\\spad{b = g*bb}} for some values \\spad{aa} and \\spad{bb}. The value \\spad{g} is computed using left-division.")) (|leftExactQuotient| (((|Union| $ "failed") $ $) "\\spad{leftExactQuotient(a,{}b)} computes the value \\spad{q},{} if it exists,{} \\indented{1}{such that \\spad{a = b*q}.}")) (|leftRemainder| (($ $ $) "\\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| (($ $ $) "\\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| $) (|:| |remainder| $)) $ $) "\\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{''}.")) (|primitivePart| (($ $) "\\spad{primitivePart(l)} returns \\spad{l0} such that \\spad{l = a * l0} for some a in \\spad{R},{} and \\spad{content(l0) = 1}.")) (|content| ((|#1| $) "\\spad{content(l)} returns the \\spad{gcd} of all the coefficients of \\spad{l}.")) (|monicRightDivide| (((|Record| (|:| |quotient| $) (|:| |remainder| $)) $ $) "\\spad{monicRightDivide(a,{}b)} 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{''}.")) (|monicLeftDivide| (((|Record| (|:| |quotient| $) (|:| |remainder| $)) $ $) "\\spad{monicLeftDivide(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}. \\spad{b} must be monic. This process is called ``left division\\spad{''}.")) (|exquo| (((|Union| $ "failed") $ |#1|) "\\spad{exquo(l,{} a)} returns the exact quotient of \\spad{l} by a,{} returning \\axiom{\"failed\"} if this is not possible.")) (|apply| ((|#1| $ |#1| |#1|) "\\spad{apply(p,{} c,{} m)} returns \\spad{p(m)} where the action is given by \\spad{x m = c sigma(m) + delta(m)}.")) (|coefficients| (((|List| |#1|) $) "\\spad{coefficients(l)} returns the list of all the nonzero coefficients of \\spad{l}.")) (|monomial| (($ |#1| (|NonNegativeInteger|)) "\\spad{monomial(c,{}k)} produces \\spad{c} times the \\spad{k}-th power of the generating operator,{} \\spad{monomial(1,{}1)}.")) (|coefficient| ((|#1| $ (|NonNegativeInteger|)) "\\spad{coefficient(l,{}k)} is \\spad{a(k)} if \\indented{2}{\\spad{l = sum(monomial(a(i),{}i),{} i = 0..n)}.}")) (|reductum| (($ $) "\\spad{reductum(l)} is \\spad{l - monomial(a(n),{}n)} if \\indented{2}{\\spad{l = sum(monomial(a(i),{}i),{} i = 0..n)}.}")) (|leadingCoefficient| ((|#1| $) "\\spad{leadingCoefficient(l)} is \\spad{a(n)} if \\indented{2}{\\spad{l = sum(monomial(a(i),{}i),{} i = 0..n)}.}")) (|minimumDegree| (((|NonNegativeInteger|) $) "\\spad{minimumDegree(l)} is the smallest \\spad{k} such that \\spad{a(k) ^= 0} if \\indented{2}{\\spad{l = sum(monomial(a(i),{}i),{} i = 0..n)}.}")) (|degree| (((|NonNegativeInteger|) $) "\\spad{degree(l)} is \\spad{n} if \\indented{2}{\\spad{l = sum(monomial(a(i),{}i),{} i = 0..n)}.}"))) 
 ((-4227 . T) (-4228 . T) (-4230 . T)) 
 NIL 
-(-787 R C) 
+(-786 R C) 
 ((|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 (-337))) (|HasCategory| |#1| (QUOTE (-513)))) 
-(-788 R |sigma| -1202) 
+(-787 R |sigma| -1202) 
 ((|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."))) 
 ((-4227 . T) (-4228 . T) (-4230 . T)) 
 ((|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-337)))) 
-(-789 |x| R |sigma| -1202) 
+(-788 |x| R |sigma| -1202) 
 ((|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}.")) (|coerce| (($ (|Variable| |#1|)) "\\spad{coerce(x)} returns \\spad{x} as a skew-polynomial."))) 
 ((-4227 . T) (-4228 . T) (-4230 . T)) 
 ((|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#2| (QUOTE (-513))) (|HasCategory| |#2| (QUOTE (-425))) (|HasCategory| |#2| (QUOTE (-337)))) 
-(-790 R) 
+(-789 R) 
 ((|constructor| (NIL "This package provides orthogonal polynomials as functions on a ring.")) (|legendreP| ((|#1| (|NonNegativeInteger|) |#1|) "\\spad{legendreP(n,{}x)} is the \\spad{n}-th Legendre polynomial,{} \\spad{P[n](x)}. These are defined by \\spad{1/sqrt(1-2*x*t+t**2) = sum(P[n](x)*t**n,{} n = 0..)}.")) (|laguerreL| ((|#1| (|NonNegativeInteger|) (|NonNegativeInteger|) |#1|) "\\spad{laguerreL(m,{}n,{}x)} is the associated Laguerre polynomial,{} \\spad{L<m>[n](x)}. This is the \\spad{m}-th derivative of \\spad{L[n](x)}.") ((|#1| (|NonNegativeInteger|) |#1|) "\\spad{laguerreL(n,{}x)} is the \\spad{n}-th Laguerre polynomial,{} \\spad{L[n](x)}. These are defined by \\spad{exp(-t*x/(1-t))/(1-t) = sum(L[n](x)*t**n/n!,{} n = 0..)}.")) (|hermiteH| ((|#1| (|NonNegativeInteger|) |#1|) "\\spad{hermiteH(n,{}x)} is the \\spad{n}-th Hermite polynomial,{} \\spad{H[n](x)}. These are defined by \\spad{exp(2*t*x-t**2) = sum(H[n](x)*t**n/n!,{} n = 0..)}.")) (|chebyshevU| ((|#1| (|NonNegativeInteger|) |#1|) "\\spad{chebyshevU(n,{}x)} is the \\spad{n}-th Chebyshev polynomial of the second kind,{} \\spad{U[n](x)}. These are defined by \\spad{1/(1-2*t*x+t**2) = sum(T[n](x) *t**n,{} n = 0..)}.")) (|chebyshevT| ((|#1| (|NonNegativeInteger|) |#1|) "\\spad{chebyshevT(n,{}x)} is the \\spad{n}-th Chebyshev polynomial of the first kind,{} \\spad{T[n](x)}. These are defined by \\spad{(1-t*x)/(1-2*t*x+t**2) = sum(T[n](x) *t**n,{} n = 0..)}."))) 
 NIL 
 ((|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521)))))) 
-(-791) 
+(-790) 
 ((|constructor| (NIL "\\indented{1}{Author : Larry Lambe} Date created : 14 August 1988 Date Last Updated : 11 March 1991 Description : A domain used in order to take the free \\spad{R}-module on the Integers \\spad{I}. This is actually the forgetful functor from OrderedRings to OrderedSets applied to \\spad{I}")) (|value| (((|Integer|) $) "\\spad{value(x)} returns the integer associated with \\spad{x}")) (|coerce| (($ (|Integer|)) "\\spad{coerce(i)} returns the element corresponding to \\spad{i}"))) 
 NIL 
 NIL 
-(-792) 
+(-791) 
 ((|constructor| (NIL "This domain is used to create and manipulate mathematical expressions for output. It is intended to provide an insulating layer between the expression rendering software (\\spadignore{e.g.} TeX,{} or Script) and the output coercions in the various domains.")) (SEGMENT (($ $) "\\spad{SEGMENT(x)} creates the prefix form: \\spad{x..}.") (($ $ $) "\\spad{SEGMENT(x,{}y)} creates the infix form: \\spad{x..y}.")) (|not| (($ $) "\\spad{not f} creates the equivalent prefix form.")) (|or| (($ $ $) "\\spad{f or g} creates the equivalent infix form.")) (|and| (($ $ $) "\\spad{f and g} creates the equivalent infix form.")) (|exquo| (($ $ $) "\\spad{exquo(f,{}g)} creates the equivalent infix form.")) (|quo| (($ $ $) "\\spad{f quo g} creates the equivalent infix form.")) (|rem| (($ $ $) "\\spad{f rem g} creates the equivalent infix form.")) (|div| (($ $ $) "\\spad{f div g} creates the equivalent infix form.")) (** (($ $ $) "\\spad{f ** g} creates the equivalent infix form.")) (/ (($ $ $) "\\spad{f / g} creates the equivalent infix form.")) (* (($ $ $) "\\spad{f * g} creates the equivalent infix form.")) (- (($ $) "\\spad{- f} creates the equivalent prefix form.") (($ $ $) "\\spad{f - g} creates the equivalent infix form.")) (+ (($ $ $) "\\spad{f + g} creates the equivalent infix form.")) (>= (($ $ $) "\\spad{f >= g} creates the equivalent infix form.")) (<= (($ $ $) "\\spad{f <= g} creates the equivalent infix form.")) (> (($ $ $) "\\spad{f > g} creates the equivalent infix form.")) (< (($ $ $) "\\spad{f < g} creates the equivalent infix form.")) (^= (($ $ $) "\\spad{f ^= g} creates the equivalent infix form.")) (= (($ $ $) "\\spad{f = g} creates the equivalent infix form.")) (|blankSeparate| (($ (|List| $)) "\\spad{blankSeparate(l)} creates the form separating the elements of \\spad{l} by blanks.")) (|semicolonSeparate| (($ (|List| $)) "\\spad{semicolonSeparate(l)} creates the form separating the elements of \\spad{l} by semicolons.")) (|commaSeparate| (($ (|List| $)) "\\spad{commaSeparate(l)} creates the form separating the elements of \\spad{l} by commas.")) (|pile| (($ (|List| $)) "\\spad{pile(l)} creates the form consisting of the elements of \\spad{l} which displays as a pile,{} \\spadignore{i.e.} the elements begin on a new line and are indented right to the same margin.")) (|paren| (($ (|List| $)) "\\spad{paren(lf)} creates the form separating the elements of \\spad{lf} by commas and encloses the result in parentheses.") (($ $) "\\spad{paren(f)} creates the form enclosing \\spad{f} in parentheses.")) (|bracket| (($ (|List| $)) "\\spad{bracket(lf)} creates the form separating the elements of \\spad{lf} by commas and encloses the result in square brackets.") (($ $) "\\spad{bracket(f)} creates the form enclosing \\spad{f} in square brackets.")) (|brace| (($ (|List| $)) "\\spad{brace(lf)} creates the form separating the elements of \\spad{lf} by commas and encloses the result in curly brackets.") (($ $) "\\spad{brace(f)} creates the form enclosing \\spad{f} in braces (curly brackets).")) (|int| (($ $ $ $) "\\spad{int(expr,{}lowerlimit,{}upperlimit)} creates the form prefixing \\spad{expr} by an integral sign with both a \\spad{lowerlimit} and \\spad{upperlimit}.") (($ $ $) "\\spad{int(expr,{}lowerlimit)} creates the form prefixing \\spad{expr} by an integral sign with a \\spad{lowerlimit}.") (($ $) "\\spad{int(expr)} creates the form prefixing \\spad{expr} with an integral sign.")) (|prod| (($ $ $ $) "\\spad{prod(expr,{}lowerlimit,{}upperlimit)} creates the form prefixing \\spad{expr} by a capital \\spad{pi} with both a \\spad{lowerlimit} and \\spad{upperlimit}.") (($ $ $) "\\spad{prod(expr,{}lowerlimit)} creates the form prefixing \\spad{expr} by a capital \\spad{pi} with a \\spad{lowerlimit}.") (($ $) "\\spad{prod(expr)} creates the form prefixing \\spad{expr} by a capital \\spad{pi}.")) (|sum| (($ $ $ $) "\\spad{sum(expr,{}lowerlimit,{}upperlimit)} creates the form prefixing \\spad{expr} by a capital sigma with both a \\spad{lowerlimit} and \\spad{upperlimit}.") (($ $ $) "\\spad{sum(expr,{}lowerlimit)} creates the form prefixing \\spad{expr} by a capital sigma with a \\spad{lowerlimit}.") (($ $) "\\spad{sum(expr)} creates the form prefixing \\spad{expr} by a capital sigma.")) (|overlabel| (($ $ $) "\\spad{overlabel(x,{}f)} creates the form \\spad{f} with \\spad{\"x} overbar\" over the top.")) (|overbar| (($ $) "\\spad{overbar(f)} creates the form \\spad{f} with an overbar.")) (|prime| (($ $ (|NonNegativeInteger|)) "\\spad{prime(f,{}n)} creates the form \\spad{f} followed by \\spad{n} primes.") (($ $) "\\spad{prime(f)} creates the form \\spad{f} followed by a suffix prime (single quote).")) (|dot| (($ $ (|NonNegativeInteger|)) "\\spad{dot(f,{}n)} creates the form \\spad{f} with \\spad{n} dots overhead.") (($ $) "\\spad{dot(f)} creates the form with a one dot overhead.")) (|quote| (($ $) "\\spad{quote(f)} creates the form \\spad{f} with a prefix quote.")) (|supersub| (($ $ (|List| $)) "\\spad{supersub(a,{}[sub1,{}super1,{}sub2,{}super2,{}...])} creates a form with each subscript aligned under each superscript.")) (|scripts| (($ $ (|List| $)) "\\spad{scripts(f,{} [sub,{} super,{} presuper,{} presub])} \\indented{1}{creates a form for \\spad{f} with scripts on all 4 corners.}")) (|presuper| (($ $ $) "\\spad{presuper(f,{}n)} creates a form for \\spad{f} presuperscripted by \\spad{n}.")) (|presub| (($ $ $) "\\spad{presub(f,{}n)} creates a form for \\spad{f} presubscripted by \\spad{n}.")) (|super| (($ $ $) "\\spad{super(f,{}n)} creates a form for \\spad{f} superscripted by \\spad{n}.")) (|sub| (($ $ $) "\\spad{sub(f,{}n)} creates a form for \\spad{f} subscripted by \\spad{n}.")) (|binomial| (($ $ $) "\\spad{binomial(n,{}m)} creates a form for the binomial coefficient of \\spad{n} and \\spad{m}.")) (|differentiate| (($ $ (|NonNegativeInteger|)) "\\spad{differentiate(f,{}n)} creates a form for the \\spad{n}th derivative of \\spad{f},{} \\spadignore{e.g.} \\spad{f'},{} \\spad{f''},{} \\spad{f'''},{} \\spad{\"f} super \\spad{iv}\".")) (|rarrow| (($ $ $) "\\spad{rarrow(f,{}g)} creates a form for the mapping \\spad{f -> g}.")) (|assign| (($ $ $) "\\spad{assign(f,{}g)} creates a form for the assignment \\spad{f := g}.")) (|slash| (($ $ $) "\\spad{slash(f,{}g)} creates a form for the horizontal fraction of \\spad{f} over \\spad{g}.")) (|over| (($ $ $) "\\spad{over(f,{}g)} creates a form for the vertical fraction of \\spad{f} over \\spad{g}.")) (|root| (($ $ $) "\\spad{root(f,{}n)} creates a form for the \\spad{n}th root of form \\spad{f}.") (($ $) "\\spad{root(f)} creates a form for the square root of form \\spad{f}.")) (|zag| (($ $ $) "\\spad{zag(f,{}g)} creates a form for the continued fraction form for \\spad{f} over \\spad{g}.")) (|matrix| (($ (|List| (|List| $))) "\\spad{matrix(llf)} makes \\spad{llf} (a list of lists of forms) into a form which displays as a matrix.")) (|box| (($ $) "\\spad{box(f)} encloses \\spad{f} in a box.")) (|label| (($ $ $) "\\spad{label(n,{}f)} gives form \\spad{f} an equation label \\spad{n}.")) (|string| (($ $) "\\spad{string(f)} creates \\spad{f} with string quotes.")) (|elt| (($ $ (|List| $)) "\\spad{elt(op,{}l)} creates a form for application of \\spad{op} to list of arguments \\spad{l}.")) (|infix?| (((|Boolean|) $) "\\spad{infix?(op)} returns \\spad{true} if \\spad{op} is an infix operator,{} and \\spad{false} otherwise.")) (|postfix| (($ $ $) "\\spad{postfix(op,{} a)} creates a form which prints as: a \\spad{op}.")) (|infix| (($ $ $ $) "\\spad{infix(op,{} a,{} b)} creates a form which prints as: a \\spad{op} \\spad{b}.") (($ $ (|List| $)) "\\spad{infix(f,{}l)} creates a form depicting the \\spad{n}-ary application of infix operation \\spad{f} to a tuple of arguments \\spad{l}.")) (|prefix| (($ $ (|List| $)) "\\spad{prefix(f,{}l)} creates a form depicting the \\spad{n}-ary prefix application of \\spad{f} to a tuple of arguments given by list \\spad{l}.")) (|vconcat| (($ (|List| $)) "\\spad{vconcat(u)} vertically concatenates all forms in list \\spad{u}.") (($ $ $) "\\spad{vconcat(f,{}g)} vertically concatenates forms \\spad{f} and \\spad{g}.")) (|hconcat| (($ (|List| $)) "\\spad{hconcat(u)} horizontally concatenates all forms in list \\spad{u}.") (($ $ $) "\\spad{hconcat(f,{}g)} horizontally concatenate forms \\spad{f} and \\spad{g}.")) (|center| (($ $) "\\spad{center(f)} centers form \\spad{f} in total space.") (($ $ (|Integer|)) "\\spad{center(f,{}n)} centers form \\spad{f} within space of width \\spad{n}.")) (|right| (($ $) "\\spad{right(f)} right-justifies form \\spad{f} in total space.") (($ $ (|Integer|)) "\\spad{right(f,{}n)} right-justifies form \\spad{f} within space of width \\spad{n}.")) (|left| (($ $) "\\spad{left(f)} left-justifies form \\spad{f} in total space.") (($ $ (|Integer|)) "\\spad{left(f,{}n)} left-justifies form \\spad{f} within space of width \\spad{n}.")) (|rspace| (($ (|Integer|) (|Integer|)) "\\spad{rspace(n,{}m)} creates rectangular white space,{} \\spad{n} wide by \\spad{m} high.")) (|vspace| (($ (|Integer|)) "\\spad{vspace(n)} creates white space of height \\spad{n}.")) (|hspace| (($ (|Integer|)) "\\spad{hspace(n)} creates white space of width \\spad{n}.")) (|superHeight| (((|Integer|) $) "\\spad{superHeight(f)} returns the height of form \\spad{f} above the base line.")) (|subHeight| (((|Integer|) $) "\\spad{subHeight(f)} returns the height of form \\spad{f} below the base line.")) (|height| (((|Integer|)) "\\spad{height()} returns the height of the display area (an integer).") (((|Integer|) $) "\\spad{height(f)} returns the height of form \\spad{f} (an integer).")) (|width| (((|Integer|)) "\\spad{width()} returns the width of the display area (an integer).") (((|Integer|) $) "\\spad{width(f)} returns the width of form \\spad{f} (an integer).")) (|empty| (($) "\\spad{empty()} creates an empty form.")) (|outputForm| (($ (|DoubleFloat|)) "\\spad{outputForm(sf)} creates an form for small float \\spad{sf}.") (($ (|String|)) "\\spad{outputForm(s)} creates an form for string \\spad{s}.") (($ (|Symbol|)) "\\spad{outputForm(s)} creates an form for symbol \\spad{s}.") (($ (|Integer|)) "\\spad{outputForm(n)} creates an form for integer \\spad{n}.")) (|messagePrint| (((|Void|) (|String|)) "\\spad{messagePrint(s)} prints \\spad{s} without string quotes. Note: \\spad{messagePrint(s)} is equivalent to \\spad{print message(s)}.")) (|message| (($ (|String|)) "\\spad{message(s)} creates an form with no string quotes from string \\spad{s}.")) (|print| (((|Void|) $) "\\spad{print(u)} prints the form \\spad{u}."))) 
 NIL 
 NIL 
-(-793) 
+(-792) 
 ((|constructor| (NIL "OutPackage allows pretty-printing from programs.")) (|outputList| (((|Void|) (|List| (|Any|))) "\\spad{outputList(l)} displays the concatenated components of the list \\spad{l} on the ``algebra output\\spad{''} stream,{} as defined by \\spadsyscom{set output algebra}; quotes are stripped from strings.")) (|output| (((|Void|) (|String|) (|OutputForm|)) "\\spad{output(s,{}x)} displays the string \\spad{s} followed by the form \\spad{x} on the ``algebra output\\spad{''} stream,{} as defined by \\spadsyscom{set output algebra}.") (((|Void|) (|OutputForm|)) "\\spad{output(x)} displays the output form \\spad{x} on the ``algebra output\\spad{''} stream,{} as defined by \\spadsyscom{set output algebra}.") (((|Void|) (|String|)) "\\spad{output(s)} displays the string \\spad{s} on the ``algebra output\\spad{''} stream,{} as defined by \\spadsyscom{set output algebra}."))) 
 NIL 
 NIL 
-(-794 |VariableList|) 
+(-793 |VariableList|) 
 ((|constructor| (NIL "This domain implements ordered variables")) (|variable| (((|Union| $ "failed") (|Symbol|)) "\\spad{variable(s)} returns a member of the variable set or failed"))) 
 NIL 
 NIL 
-(-795 R |vl| |wl| |wtlevel|) 
+(-794 R |vl| |wl| |wtlevel|) 
 ((|constructor| (NIL "This domain represents truncated weighted polynomials over the \"Polynomial\" type. The variables must be specified,{} as must the weights. The representation is sparse in the sense that only non-zero terms are represented.")) (|changeWeightLevel| (((|Void|) (|NonNegativeInteger|)) "\\spad{changeWeightLevel(n)} This changes the weight level to the new value given: \\spad{NB:} previously calculated terms are not affected")) (/ (((|Union| $ "failed") $ $) "\\spad{x/y} division (only works if minimum weight of divisor is zero,{} and if \\spad{R} is a Field)")) (|coerce| (($ (|Polynomial| |#1|)) "\\spad{coerce(p)} coerces a Polynomial(\\spad{R}) into Weighted form,{} applying weights and ignoring terms") (((|Polynomial| |#1|) $) "\\spad{coerce(p)} converts back into a Polynomial(\\spad{R}),{} ignoring weights"))) 
 ((-4228 |has| |#1| (-157)) (-4227 |has| |#1| (-157)) (-4230 . T)) 
 ((|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-337)))) 
-(-796 R PS UP) 
+(-795 R PS UP) 
 ((|constructor| (NIL "\\indented{1}{This package computes reliable Pad&ea. approximants using} a generalized Viskovatov continued fraction algorithm. Authors: Burge,{} Hassner & Watt. Date Created: April 1987 Date Last Updated: 12 April 1990 Keywords: Pade,{} series Examples: References: \\indented{2}{\"Pade Approximants,{} Part I: Basic Theory\",{} Baker & Graves-Morris.}")) (|padecf| (((|Union| (|ContinuedFraction| |#3|) "failed") (|NonNegativeInteger|) (|NonNegativeInteger|) |#2| |#2|) "\\spad{padecf(nd,{}dd,{}ns,{}ds)} computes the approximant as a continued fraction of polynomials (if it exists) for arguments \\spad{nd} (numerator degree of approximant),{} \\spad{dd} (denominator degree of approximant),{} \\spad{ns} (numerator series of function),{} and \\spad{ds} (denominator series of function).")) (|pade| (((|Union| (|Fraction| |#3|) "failed") (|NonNegativeInteger|) (|NonNegativeInteger|) |#2| |#2|) "\\spad{pade(nd,{}dd,{}ns,{}ds)} computes the approximant as a quotient of polynomials (if it exists) for arguments \\spad{nd} (numerator degree of approximant),{} \\spad{dd} (denominator degree of approximant),{} \\spad{ns} (numerator series of function),{} and \\spad{ds} (denominator series of function)."))) 
 NIL 
 NIL 
-(-797 R |x| |pt|) 
+(-796 R |x| |pt|) 
 ((|constructor| (NIL "\\indented{1}{This package computes reliable Pad&ea. approximants using} a generalized Viskovatov continued fraction algorithm. Authors: Trager,{}Burge,{} Hassner & Watt. Date Created: April 1987 Date Last Updated: 12 April 1990 Keywords: Pade,{} series Examples: References: \\indented{2}{\"Pade Approximants,{} Part I: Basic Theory\",{} Baker & Graves-Morris.}")) (|pade| (((|Union| (|Fraction| (|UnivariatePolynomial| |#2| |#1|)) "failed") (|NonNegativeInteger|) (|NonNegativeInteger|) (|UnivariateTaylorSeries| |#1| |#2| |#3|)) "\\spad{pade(nd,{}dd,{}s)} computes the quotient of polynomials (if it exists) with numerator degree at most \\spad{nd} and denominator degree at most \\spad{dd} which matches the series \\spad{s} to order \\spad{nd + dd}.") (((|Union| (|Fraction| (|UnivariatePolynomial| |#2| |#1|)) "failed") (|NonNegativeInteger|) (|NonNegativeInteger|) (|UnivariateTaylorSeries| |#1| |#2| |#3|) (|UnivariateTaylorSeries| |#1| |#2| |#3|)) "\\spad{pade(nd,{}dd,{}ns,{}ds)} computes the approximant as a quotient of polynomials (if it exists) for arguments \\spad{nd} (numerator degree of approximant),{} \\spad{dd} (denominator degree of approximant),{} \\spad{ns} (numerator series of function),{} and \\spad{ds} (denominator series of function)."))) 
 NIL 
 NIL 
-(-798 |p|) 
+(-797 |p|) 
 ((|constructor| (NIL "This is the catefory of stream-based representations of \\indented{2}{the \\spad{p}-adic integers.}")) (|root| (($ (|SparseUnivariatePolynomial| (|Integer|)) (|Integer|)) "\\spad{root(f,{}a)} returns a root of the polynomial \\spad{f}. Argument \\spad{a} must be a root of \\spad{f} \\spad{(mod p)}.")) (|sqrt| (($ $ (|Integer|)) "\\spad{sqrt(b,{}a)} returns a square root of \\spad{b}. Argument \\spad{a} is a square root of \\spad{b} \\spad{(mod p)}.")) (|approximate| (((|Integer|) $ (|Integer|)) "\\spad{approximate(x,{}n)} returns an integer \\spad{y} such that \\spad{y = x (mod p^n)} when \\spad{n} is positive,{} and 0 otherwise.")) (|quotientByP| (($ $) "\\spad{quotientByP(x)} returns \\spad{b},{} where \\spad{x = a + b p}.")) (|moduloP| (((|Integer|) $) "\\spad{modulo(x)} returns a,{} where \\spad{x = a + b p}.")) (|modulus| (((|Integer|)) "\\spad{modulus()} returns the value of \\spad{p}.")) (|complete| (($ $) "\\spad{complete(x)} forces the computation of all digits.")) (|extend| (($ $ (|Integer|)) "\\spad{extend(x,{}n)} forces the computation of digits up to order \\spad{n}.")) (|order| (((|NonNegativeInteger|) $) "\\spad{order(x)} returns the exponent of the highest power of \\spad{p} dividing \\spad{x}.")) (|digits| (((|Stream| (|Integer|)) $) "\\spad{digits(x)} returns a stream of \\spad{p}-adic digits of \\spad{x}."))) 
 ((-4226 . T) ((-4235 "*") . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
 NIL 
-(-799 |p|) 
+(-798 |p|) 
 ((|constructor| (NIL "Stream-based implementation of \\spad{Zp:} \\spad{p}-adic numbers are represented as sum(\\spad{i} = 0..,{} a[\\spad{i}] * p^i),{} where the a[\\spad{i}] lie in 0,{}1,{}...,{}(\\spad{p} - 1)."))) 
 ((-4226 . T) ((-4235 "*") . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
 NIL 
-(-800 |p|) 
+(-799 |p|) 
 ((|constructor| (NIL "Stream-based implementation of \\spad{Qp:} numbers are represented as sum(\\spad{i} = \\spad{k}..,{} a[\\spad{i}] * p^i) where the a[\\spad{i}] lie in 0,{}1,{}...,{}(\\spad{p} - 1)."))) 
 ((-4225 . T) (-4231 . T) (-4226 . T) ((-4235 "*") . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
-((|HasCategory| (-799 |#1|) (QUOTE (-838))) (|HasCategory| (-799 |#1|) (LIST (QUOTE -961) (QUOTE (-1084)))) (|HasCategory| (-799 |#1|) (QUOTE (-133))) (|HasCategory| (-799 |#1|) (QUOTE (-135))) (|HasCategory| (-799 |#1|) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| (-799 |#1|) (QUOTE (-946))) (|HasCategory| (-799 |#1|) (QUOTE (-757))) (|HasCategory| (-799 |#1|) (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| (-799 |#1|) (QUOTE (-1060))) (|HasCategory| (-799 |#1|) (LIST (QUOTE -815) (QUOTE (-521)))) (|HasCategory| (-799 |#1|) (LIST (QUOTE -815) (QUOTE (-353)))) (|HasCategory| (-799 |#1|) (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-353))))) (|HasCategory| (-799 |#1|) (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521))))) (|HasCategory| (-799 |#1|) (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| (-799 |#1|) (QUOTE (-210))) (|HasCategory| (-799 |#1|) (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| (-799 |#1|) (LIST (QUOTE -482) (QUOTE (-1084)) (LIST (QUOTE -799) (|devaluate| |#1|)))) (|HasCategory| (-799 |#1|) (LIST (QUOTE -284) (LIST (QUOTE -799) (|devaluate| |#1|)))) (|HasCategory| (-799 |#1|) (LIST (QUOTE -261) (LIST (QUOTE -799) (|devaluate| |#1|)) (LIST (QUOTE -799) (|devaluate| |#1|)))) (|HasCategory| (-799 |#1|) (QUOTE (-282))) (|HasCategory| (-799 |#1|) (QUOTE (-506))) (|HasCategory| (-799 |#1|) (QUOTE (-784))) (-3703 (|HasCategory| (-799 |#1|) (QUOTE (-757))) (|HasCategory| (-799 |#1|) (QUOTE (-784)))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| (-799 |#1|) (QUOTE (-838)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| (-799 |#1|) (QUOTE (-838)))) (|HasCategory| (-799 |#1|) (QUOTE (-133))))) 
-(-801 |p| PADIC) 
+((|HasCategory| (-798 |#1|) (QUOTE (-837))) (|HasCategory| (-798 |#1|) (LIST (QUOTE -961) (QUOTE (-1084)))) (|HasCategory| (-798 |#1|) (QUOTE (-133))) (|HasCategory| (-798 |#1|) (QUOTE (-135))) (|HasCategory| (-798 |#1|) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| (-798 |#1|) (QUOTE (-946))) (|HasCategory| (-798 |#1|) (QUOTE (-756))) (|HasCategory| (-798 |#1|) (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| (-798 |#1|) (QUOTE (-1060))) (|HasCategory| (-798 |#1|) (LIST (QUOTE -814) (QUOTE (-521)))) (|HasCategory| (-798 |#1|) (LIST (QUOTE -814) (QUOTE (-353)))) (|HasCategory| (-798 |#1|) (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-353))))) (|HasCategory| (-798 |#1|) (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521))))) (|HasCategory| (-798 |#1|) (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| (-798 |#1|) (QUOTE (-210))) (|HasCategory| (-798 |#1|) (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| (-798 |#1|) (LIST (QUOTE -482) (QUOTE (-1084)) (LIST (QUOTE -798) (|devaluate| |#1|)))) (|HasCategory| (-798 |#1|) (LIST (QUOTE -284) (LIST (QUOTE -798) (|devaluate| |#1|)))) (|HasCategory| (-798 |#1|) (LIST (QUOTE -261) (LIST (QUOTE -798) (|devaluate| |#1|)) (LIST (QUOTE -798) (|devaluate| |#1|)))) (|HasCategory| (-798 |#1|) (QUOTE (-282))) (|HasCategory| (-798 |#1|) (QUOTE (-506))) (|HasCategory| (-798 |#1|) (QUOTE (-783))) (-3703 (|HasCategory| (-798 |#1|) (QUOTE (-756))) (|HasCategory| (-798 |#1|) (QUOTE (-783)))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| (-798 |#1|) (QUOTE (-837)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| (-798 |#1|) (QUOTE (-837)))) (|HasCategory| (-798 |#1|) (QUOTE (-133))))) 
+(-800 |p| PADIC) 
 ((|constructor| (NIL "This is the category of stream-based representations of \\spad{Qp}.")) (|removeZeroes| (($ (|Integer|) $) "\\spad{removeZeroes(n,{}x)} removes up to \\spad{n} leading zeroes from the \\spad{p}-adic rational \\spad{x}.") (($ $) "\\spad{removeZeroes(x)} removes leading zeroes from the representation of the \\spad{p}-adic rational \\spad{x}. A \\spad{p}-adic rational is represented by (1) an exponent and (2) a \\spad{p}-adic integer which may have leading zero digits. When the \\spad{p}-adic integer has a leading zero digit,{} a 'leading zero' is removed from the \\spad{p}-adic rational as follows: the number is rewritten by increasing the exponent by 1 and dividing the \\spad{p}-adic integer by \\spad{p}. Note: \\spad{removeZeroes(f)} removes all leading zeroes from \\spad{f}.")) (|continuedFraction| (((|ContinuedFraction| (|Fraction| (|Integer|))) $) "\\spad{continuedFraction(x)} converts the \\spad{p}-adic rational number \\spad{x} to a continued fraction.")) (|approximate| (((|Fraction| (|Integer|)) $ (|Integer|)) "\\spad{approximate(x,{}n)} returns a rational number \\spad{y} such that \\spad{y = x (mod p^n)}."))) 
 ((-4225 . T) (-4231 . T) (-4226 . T) ((-4235 "*") . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
-((|HasCategory| |#2| (QUOTE (-838))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-135))) (|HasCategory| |#2| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#2| (QUOTE (-946))) (|HasCategory| |#2| (QUOTE (-757))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (LIST (QUOTE -815) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -815) (QUOTE (-353)))) (|HasCategory| |#2| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-353))))) (|HasCategory| |#2| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#2| (LIST (QUOTE -482) (QUOTE (-1084)) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -261) (|devaluate| |#2|) (|devaluate| |#2|))) (|HasCategory| |#2| (QUOTE (-282))) (|HasCategory| |#2| (QUOTE (-506))) (|HasCategory| |#2| (QUOTE (-784))) (-3703 (|HasCategory| |#2| (QUOTE (-757))) (|HasCategory| |#2| (QUOTE (-784)))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-838)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-838)))) (|HasCategory| |#2| (QUOTE (-133))))) 
-(-802 S T$) 
+((|HasCategory| |#2| (QUOTE (-837))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-135))) (|HasCategory| |#2| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#2| (QUOTE (-946))) (|HasCategory| |#2| (QUOTE (-756))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (LIST (QUOTE -814) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -814) (QUOTE (-353)))) (|HasCategory| |#2| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-353))))) (|HasCategory| |#2| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#2| (LIST (QUOTE -482) (QUOTE (-1084)) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -261) (|devaluate| |#2|) (|devaluate| |#2|))) (|HasCategory| |#2| (QUOTE (-282))) (|HasCategory| |#2| (QUOTE (-506))) (|HasCategory| |#2| (QUOTE (-783))) (-3703 (|HasCategory| |#2| (QUOTE (-756))) (|HasCategory| |#2| (QUOTE (-783)))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-837)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-837)))) (|HasCategory| |#2| (QUOTE (-133))))) 
+(-801 S T$) 
 ((|constructor| (NIL "\\indented{1}{This domain provides a very simple representation} of the notion of `pair of objects'. It does not try to achieve all possible imaginable things.")) (|second| ((|#2| $) "\\spad{second(p)} extracts the second components of \\spad{`p'}.")) (|first| ((|#1| $) "\\spad{first(p)} extracts the first component of \\spad{`p'}.")) (|construct| (($ |#1| |#2|) "\\spad{construct(s,{}t)} is same as pair(\\spad{s},{}\\spad{t}),{} with syntactic sugar.")) (|pair| (($ |#1| |#2|) "\\spad{pair(s,{}t)} returns a pair object composed of \\spad{`s'} and \\spad{`t'}."))) 
 NIL 
-((-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#2| (QUOTE (-1013)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-792))))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#2| (QUOTE (-1013)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-792))))))) 
-(-803) 
+((-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#2| (QUOTE (-1013)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-791))))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#2| (QUOTE (-1013)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-791))))))) 
+(-802) 
 ((|constructor| (NIL "This domain describes four groups of color shades (palettes).")) (|coerce| (($ (|Color|)) "\\spad{coerce(c)} sets the average shade for the palette to that of the indicated color \\spad{c}.")) (|shade| (((|Integer|) $) "\\spad{shade(p)} returns the shade index of the indicated palette \\spad{p}.")) (|hue| (((|Color|) $) "\\spad{hue(p)} returns the hue field of the indicated palette \\spad{p}.")) (|light| (($ (|Color|)) "\\spad{light(c)} sets the shade of a hue,{} \\spad{c},{} to it\\spad{'s} highest value.")) (|pastel| (($ (|Color|)) "\\spad{pastel(c)} sets the shade of a hue,{} \\spad{c},{} above bright,{} but below light.")) (|bright| (($ (|Color|)) "\\spad{bright(c)} sets the shade of a hue,{} \\spad{c},{} above dim,{} but below pastel.")) (|dim| (($ (|Color|)) "\\spad{dim(c)} sets the shade of a hue,{} \\spad{c},{} above dark,{} but below bright.")) (|dark| (($ (|Color|)) "\\spad{dark(c)} sets the shade of the indicated hue of \\spad{c} to it\\spad{'s} lowest value."))) 
 NIL 
 NIL 
-(-804) 
+(-803) 
 ((|constructor| (NIL "This package provides a coerce from polynomials over algebraic numbers to \\spadtype{Expression AlgebraicNumber}.")) (|coerce| (((|Expression| (|Integer|)) (|Fraction| (|Polynomial| (|AlgebraicNumber|)))) "\\spad{coerce(rf)} converts \\spad{rf},{} a fraction of polynomial \\spad{p} with algebraic number coefficients to \\spadtype{Expression Integer}.") (((|Expression| (|Integer|)) (|Polynomial| (|AlgebraicNumber|))) "\\spad{coerce(p)} converts the polynomial \\spad{p} with algebraic number coefficients to \\spadtype{Expression Integer}."))) 
 NIL 
 NIL 
-(-805 CF1 CF2) 
+(-804 CF1 CF2) 
 ((|constructor| (NIL "This package \\undocumented")) (|map| (((|ParametricPlaneCurve| |#2|) (|Mapping| |#2| |#1|) (|ParametricPlaneCurve| |#1|)) "\\spad{map(f,{}x)} \\undocumented"))) 
 NIL 
 NIL 
-(-806 |ComponentFunction|) 
+(-805 |ComponentFunction|) 
 ((|constructor| (NIL "ParametricPlaneCurve is used for plotting parametric plane curves in the affine plane.")) (|coordinate| ((|#1| $ (|NonNegativeInteger|)) "\\spad{coordinate(c,{}i)} returns a coordinate function for \\spad{c} using 1-based indexing according to \\spad{i}. This indicates what the function for the coordinate component \\spad{i} of the plane curve is.")) (|curve| (($ |#1| |#1|) "\\spad{curve(c1,{}c2)} creates a plane curve from 2 component functions \\spad{c1} and \\spad{c2}."))) 
 NIL 
 NIL 
-(-807 CF1 CF2) 
+(-806 CF1 CF2) 
 ((|constructor| (NIL "This package \\undocumented")) (|map| (((|ParametricSpaceCurve| |#2|) (|Mapping| |#2| |#1|) (|ParametricSpaceCurve| |#1|)) "\\spad{map(f,{}x)} \\undocumented"))) 
 NIL 
 NIL 
-(-808 |ComponentFunction|) 
+(-807 |ComponentFunction|) 
 ((|constructor| (NIL "ParametricSpaceCurve is used for plotting parametric space curves in affine 3-space.")) (|coordinate| ((|#1| $ (|NonNegativeInteger|)) "\\spad{coordinate(c,{}i)} returns a coordinate function of \\spad{c} using 1-based indexing according to \\spad{i}. This indicates what the function for the coordinate component,{} \\spad{i},{} of the space curve is.")) (|curve| (($ |#1| |#1| |#1|) "\\spad{curve(c1,{}c2,{}c3)} creates a space curve from 3 component functions \\spad{c1},{} \\spad{c2},{} and \\spad{c3}."))) 
 NIL 
 NIL 
-(-809) 
+(-808) 
 ((|constructor| (NIL "\\indented{1}{This package provides a simple Spad script parser.} Related Constructors: Syntax. See Also: Syntax.")) (|getSyntaxFormsFromFile| (((|List| (|Syntax|)) (|String|)) "\\spad{getSyntaxFormsFromFile(f)} parses the source file \\spad{f} (supposedly containing Spad scripts) and returns a List Syntax. The filename \\spad{f} is supposed to have the proper extension. Note that source location information is not part of result."))) 
 NIL 
 NIL 
-(-810 CF1 CF2) 
+(-809 CF1 CF2) 
 ((|constructor| (NIL "This package \\undocumented")) (|map| (((|ParametricSurface| |#2|) (|Mapping| |#2| |#1|) (|ParametricSurface| |#1|)) "\\spad{map(f,{}x)} \\undocumented"))) 
 NIL 
 NIL 
-(-811 |ComponentFunction|) 
+(-810 |ComponentFunction|) 
 ((|constructor| (NIL "ParametricSurface is used for plotting parametric surfaces in affine 3-space.")) (|coordinate| ((|#1| $ (|NonNegativeInteger|)) "\\spad{coordinate(s,{}i)} returns a coordinate function of \\spad{s} using 1-based indexing according to \\spad{i}. This indicates what the function for the coordinate component,{} \\spad{i},{} of the surface is.")) (|surface| (($ |#1| |#1| |#1|) "\\spad{surface(c1,{}c2,{}c3)} creates a surface from 3 parametric component functions \\spad{c1},{} \\spad{c2},{} and \\spad{c3}."))) 
 NIL 
 NIL 
-(-812) 
+(-811) 
 ((|constructor| (NIL "PartitionsAndPermutations contains functions for generating streams of integer partitions,{} and streams of sequences of integers composed from a multi-set.")) (|permutations| (((|Stream| (|List| (|Integer|))) (|Integer|)) "\\spad{permutations(n)} is the stream of permutations \\indented{1}{formed from \\spad{1,{}2,{}3,{}...,{}n}.}")) (|sequences| (((|Stream| (|List| (|Integer|))) (|List| (|Integer|))) "\\spad{sequences([l0,{}l1,{}l2,{}..,{}ln])} is the set of \\indented{1}{all sequences formed from} \\spad{l0} 0\\spad{'s},{}\\spad{l1} 1\\spad{'s},{}\\spad{l2} 2\\spad{'s},{}...,{}\\spad{ln} \\spad{n}\\spad{'s}.") (((|Stream| (|List| (|Integer|))) (|List| (|Integer|)) (|List| (|Integer|))) "\\spad{sequences(l1,{}l2)} is the stream of all sequences that \\indented{1}{can be composed from the multiset defined from} \\indented{1}{two lists of integers \\spad{l1} and \\spad{l2}.} \\indented{1}{For example,{}the pair \\spad{([1,{}2,{}4],{}[2,{}3,{}5])} represents} \\indented{1}{multi-set with 1 \\spad{2},{} 2 \\spad{3}\\spad{'s},{} and 4 \\spad{5}\\spad{'s}.}")) (|shufflein| (((|Stream| (|List| (|Integer|))) (|List| (|Integer|)) (|Stream| (|List| (|Integer|)))) "\\spad{shufflein(l,{}st)} maps shuffle(\\spad{l},{}\\spad{u}) on to all \\indented{1}{members \\spad{u} of \\spad{st},{} concatenating the results.}")) (|shuffle| (((|Stream| (|List| (|Integer|))) (|List| (|Integer|)) (|List| (|Integer|))) "\\spad{shuffle(l1,{}l2)} forms the stream of all shuffles of \\spad{l1} \\indented{1}{and \\spad{l2},{} \\spadignore{i.e.} all sequences that can be formed from} \\indented{1}{merging \\spad{l1} and \\spad{l2}.}")) (|conjugates| (((|Stream| (|List| (|Integer|))) (|Stream| (|List| (|Integer|)))) "\\spad{conjugates(lp)} is the stream of conjugates of a stream \\indented{1}{of partitions \\spad{lp}.}")) (|conjugate| (((|List| (|Integer|)) (|List| (|Integer|))) "\\spad{conjugate(pt)} is the conjugate of the partition \\spad{pt}.")) (|partitions| (((|Stream| (|List| (|Integer|))) (|Integer|) (|Integer|)) "\\spad{partitions(p,{}l)} is the stream of all \\indented{1}{partitions whose number of} \\indented{1}{parts and largest part are no greater than \\spad{p} and \\spad{l}.}") (((|Stream| (|List| (|Integer|))) (|Integer|)) "\\spad{partitions(n)} is the stream of all partitions of \\spad{n}.") (((|Stream| (|List| (|Integer|))) (|Integer|) (|Integer|) (|Integer|)) "\\spad{partitions(p,{}l,{}n)} is the stream of partitions \\indented{1}{of \\spad{n} whose number of parts is no greater than \\spad{p}} \\indented{1}{and whose largest part is no greater than \\spad{l}.}"))) 
 NIL 
 NIL 
-(-813 R) 
+(-812 R) 
 ((|constructor| (NIL "An object \\spad{S} is Patternable over an object \\spad{R} if \\spad{S} can lift the conversions from \\spad{R} into \\spadtype{Pattern(Integer)} and \\spadtype{Pattern(Float)} to itself."))) 
 NIL 
 NIL 
-(-814 R S L) 
+(-813 R S L) 
 ((|constructor| (NIL "A PatternMatchListResult is an object internally returned by the pattern matcher when matching on lists. It is either a failed match,{} or a pair of PatternMatchResult,{} one for atoms (elements of the list),{} and one for lists.")) (|lists| (((|PatternMatchResult| |#1| |#3|) $) "\\spad{lists(r)} returns the list of matches that match lists.")) (|atoms| (((|PatternMatchResult| |#1| |#2|) $) "\\spad{atoms(r)} returns the list of matches that match atoms (elements of the lists).")) (|makeResult| (($ (|PatternMatchResult| |#1| |#2|) (|PatternMatchResult| |#1| |#3|)) "\\spad{makeResult(r1,{}r2)} makes the combined result [\\spad{r1},{}\\spad{r2}].")) (|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 
-(-815 S) 
+(-814 S) 
 ((|constructor| (NIL "A set \\spad{R} is PatternMatchable over \\spad{S} if elements of \\spad{R} can be matched to patterns over \\spad{S}.")) (|patternMatch| (((|PatternMatchResult| |#1| $) $ (|Pattern| |#1|) (|PatternMatchResult| |#1| $)) "\\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 (necessary for recursion). Initially,{} res is just the result of \\spadfun{new} which is an empty list of matches."))) 
 NIL 
 NIL 
-(-816 |Base| |Subject| |Pat|) 
+(-815 |Base| |Subject| |Pat|) 
 ((|constructor| (NIL "This package provides the top-level pattern macthing functions.")) (|Is| (((|PatternMatchResult| |#1| |#2|) |#2| |#3|) "\\spad{Is(expr,{} pat)} matches the pattern pat on the expression \\spad{expr} and returns a match of the form \\spad{[v1 = e1,{}...,{}vn = en]}; returns an empty match if \\spad{expr} is exactly equal to pat. returns a \\spadfun{failed} match if pat does not match \\spad{expr}.") (((|List| (|Equation| (|Polynomial| |#2|))) |#2| |#3|) "\\spad{Is(expr,{} pat)} matches the pattern pat on the expression \\spad{expr} and returns a list of matches \\spad{[v1 = e1,{}...,{}vn = en]}; returns an empty list if either \\spad{expr} is exactly equal to pat or if pat does not match \\spad{expr}.") (((|List| (|Equation| |#2|)) |#2| |#3|) "\\spad{Is(expr,{} pat)} matches the pattern pat on the expression \\spad{expr} and returns a list of matches \\spad{[v1 = e1,{}...,{}vn = en]}; returns an empty list if either \\spad{expr} is exactly equal to pat or if pat does not match \\spad{expr}.") (((|PatternMatchListResult| |#1| |#2| (|List| |#2|)) (|List| |#2|) |#3|) "\\spad{Is([e1,{}...,{}en],{} pat)} matches the pattern pat on the list of expressions \\spad{[e1,{}...,{}en]} and returns the result.")) (|is?| (((|Boolean|) (|List| |#2|) |#3|) "\\spad{is?([e1,{}...,{}en],{} pat)} tests if the list of expressions \\spad{[e1,{}...,{}en]} matches the pattern pat.") (((|Boolean|) |#2| |#3|) "\\spad{is?(expr,{} pat)} tests if the expression \\spad{expr} matches the pattern pat."))) 
 NIL 
-((|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-1084)))) (-12 (-2400 (|HasCategory| |#2| (QUOTE (-970)))) (-2400 (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-1084)))))) (-12 (|HasCategory| |#2| (QUOTE (-970))) (-2400 (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-1084))))))) 
-(-817 R A B) 
+((|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-1084)))) (-12 (-2416 (|HasCategory| |#2| (QUOTE (-970)))) (-2416 (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-1084)))))) (-12 (|HasCategory| |#2| (QUOTE (-970))) (-2416 (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-1084))))))) 
+(-816 R A B) 
 ((|constructor| (NIL "Lifts maps to pattern matching results.")) (|map| (((|PatternMatchResult| |#1| |#3|) (|Mapping| |#3| |#2|) (|PatternMatchResult| |#1| |#2|)) "\\spad{map(f,{} [(v1,{}a1),{}...,{}(vn,{}an)])} returns the matching result [(\\spad{v1},{}\\spad{f}(a1)),{}...,{}(\\spad{vn},{}\\spad{f}(an))]."))) 
 NIL 
 NIL 
-(-818 R S) 
+(-817 R S) 
 ((|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 
-(-819 R -2212) 
+(-818 R -2244) 
 ((|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 
-(-820 R S) 
+(-819 R S) 
 ((|constructor| (NIL "Lifts maps to patterns.")) (|map| (((|Pattern| |#2|) (|Mapping| |#2| |#1|) (|Pattern| |#1|)) "\\spad{map(f,{} p)} applies \\spad{f} to all the leaves of \\spad{p} and returns the result as a pattern over \\spad{S}."))) 
 NIL 
 NIL 
-(-821 R) 
+(-820 R) 
 ((|constructor| (NIL "Patterns for use by the pattern matcher.")) (|optpair| (((|Union| (|List| $) "failed") (|List| $)) "\\spad{optpair(l)} returns \\spad{l} has the form \\spad{[a,{} b]} and a is optional,{} and \"failed\" otherwise.")) (|variables| (((|List| $) $) "\\spad{variables(p)} returns the list of matching variables appearing in \\spad{p}.")) (|getBadValues| (((|List| (|Any|)) $) "\\spad{getBadValues(p)} returns the list of \"bad values\" for \\spad{p}. Note: \\spad{p} is not allowed to match any of its \"bad values\".")) (|addBadValue| (($ $ (|Any|)) "\\spad{addBadValue(p,{} v)} adds \\spad{v} to the list of \"bad values\" for \\spad{p}. Note: \\spad{p} is not allowed to match any of its \"bad values\".")) (|resetBadValues| (($ $) "\\spad{resetBadValues(p)} initializes the list of \"bad values\" for \\spad{p} to \\spad{[]}. Note: \\spad{p} is not allowed to match any of its \"bad values\".")) (|hasTopPredicate?| (((|Boolean|) $) "\\spad{hasTopPredicate?(p)} tests if \\spad{p} has a top-level predicate.")) (|topPredicate| (((|Record| (|:| |var| (|List| (|Symbol|))) (|:| |pred| (|Any|))) $) "\\spad{topPredicate(x)} returns \\spad{[[a1,{}...,{}an],{} f]} where the top-level predicate of \\spad{x} is \\spad{f(a1,{}...,{}an)}. Note: \\spad{n} is 0 if \\spad{x} has no top-level predicate.")) (|setTopPredicate| (($ $ (|List| (|Symbol|)) (|Any|)) "\\spad{setTopPredicate(x,{} [a1,{}...,{}an],{} f)} returns \\spad{x} with the top-level predicate set to \\spad{f(a1,{}...,{}an)}.")) (|patternVariable| (($ (|Symbol|) (|Boolean|) (|Boolean|) (|Boolean|)) "\\spad{patternVariable(x,{} c?,{} o?,{} m?)} creates a pattern variable \\spad{x},{} which is constant if \\spad{c? = true},{} optional if \\spad{o? = true},{} and multiple if \\spad{m? = true}.")) (|withPredicates| (($ $ (|List| (|Any|))) "\\spad{withPredicates(p,{} [p1,{}...,{}pn])} makes a copy of \\spad{p} and attaches the predicate \\spad{p1} and ... and \\spad{pn} to the copy,{} which is returned.")) (|setPredicates| (($ $ (|List| (|Any|))) "\\spad{setPredicates(p,{} [p1,{}...,{}pn])} attaches the predicate \\spad{p1} and ... and \\spad{pn} to \\spad{p}.")) (|predicates| (((|List| (|Any|)) $) "\\spad{predicates(p)} returns \\spad{[p1,{}...,{}pn]} such that the predicate attached to \\spad{p} is \\spad{p1} and ... and \\spad{pn}.")) (|hasPredicate?| (((|Boolean|) $) "\\spad{hasPredicate?(p)} tests if \\spad{p} has predicates attached to it.")) (|optional?| (((|Boolean|) $) "\\spad{optional?(p)} tests if \\spad{p} is a single matching variable which can match an identity.")) (|multiple?| (((|Boolean|) $) "\\spad{multiple?(p)} tests if \\spad{p} is a single matching variable allowing list matching or multiple term matching in a sum or product.")) (|generic?| (((|Boolean|) $) "\\spad{generic?(p)} tests if \\spad{p} is a single matching variable.")) (|constant?| (((|Boolean|) $) "\\spad{constant?(p)} tests if \\spad{p} contains no matching variables.")) (|symbol?| (((|Boolean|) $) "\\spad{symbol?(p)} tests if \\spad{p} is a symbol.")) (|quoted?| (((|Boolean|) $) "\\spad{quoted?(p)} tests if \\spad{p} is of the form \\spad{'s} for a symbol \\spad{s}.")) (|inR?| (((|Boolean|) $) "\\spad{inR?(p)} tests if \\spad{p} is an atom (\\spadignore{i.e.} an element of \\spad{R}).")) (|copy| (($ $) "\\spad{copy(p)} returns a recursive copy of \\spad{p}.")) (|convert| (($ (|List| $)) "\\spad{convert([a1,{}...,{}an])} returns the pattern \\spad{[a1,{}...,{}an]}.")) (|depth| (((|NonNegativeInteger|) $) "\\spad{depth(p)} returns the nesting level of \\spad{p}.")) (/ (($ $ $) "\\spad{a / b} returns the pattern \\spad{a / b}.")) (** (($ $ $) "\\spad{a ** b} returns the pattern \\spad{a ** b}.") (($ $ (|NonNegativeInteger|)) "\\spad{a ** n} returns the pattern \\spad{a ** n}.")) (* (($ $ $) "\\spad{a * b} returns the pattern \\spad{a * b}.")) (+ (($ $ $) "\\spad{a + b} returns the pattern \\spad{a + b}.")) (|elt| (($ (|BasicOperator|) (|List| $)) "\\spad{elt(op,{} [a1,{}...,{}an])} returns \\spad{op(a1,{}...,{}an)}.")) (|isPower| (((|Union| (|Record| (|:| |val| $) (|:| |exponent| $)) "failed") $) "\\spad{isPower(p)} returns \\spad{[a,{} b]} if \\spad{p = a ** b},{} and \"failed\" otherwise.")) (|isList| (((|Union| (|List| $) "failed") $) "\\spad{isList(p)} returns \\spad{[a1,{}...,{}an]} if \\spad{p = [a1,{}...,{}an]},{} \"failed\" otherwise.")) (|isQuotient| (((|Union| (|Record| (|:| |num| $) (|:| |den| $)) "failed") $) "\\spad{isQuotient(p)} returns \\spad{[a,{} b]} if \\spad{p = a / b},{} and \"failed\" otherwise.")) (|isExpt| (((|Union| (|Record| (|:| |val| $) (|:| |exponent| (|NonNegativeInteger|))) "failed") $) "\\spad{isExpt(p)} returns \\spad{[q,{} n]} if \\spad{n > 0} and \\spad{p = q ** n},{} and \"failed\" otherwise.")) (|isOp| (((|Union| (|Record| (|:| |op| (|BasicOperator|)) (|:| |arg| (|List| $))) "failed") $) "\\spad{isOp(p)} returns \\spad{[op,{} [a1,{}...,{}an]]} if \\spad{p = op(a1,{}...,{}an)},{} and \"failed\" otherwise.") (((|Union| (|List| $) "failed") $ (|BasicOperator|)) "\\spad{isOp(p,{} op)} returns \\spad{[a1,{}...,{}an]} if \\spad{p = op(a1,{}...,{}an)},{} and \"failed\" otherwise.")) (|isTimes| (((|Union| (|List| $) "failed") $) "\\spad{isTimes(p)} returns \\spad{[a1,{}...,{}an]} if \\spad{n > 1} and \\spad{p = a1 * ... * an},{} and \"failed\" otherwise.")) (|isPlus| (((|Union| (|List| $) "failed") $) "\\spad{isPlus(p)} returns \\spad{[a1,{}...,{}an]} if \\spad{n > 1} \\indented{1}{and \\spad{p = a1 + ... + an},{}} and \"failed\" otherwise.")) ((|One|) (($) "1")) ((|Zero|) (($) "0"))) 
 NIL 
 NIL 
-(-822 |VarSet|) 
+(-821 |VarSet|) 
 ((|constructor| (NIL "This domain provides the internal representation of polynomials in non-commutative variables written over the Poincare-Birkhoff-Witt basis. See the \\spadtype{XPBWPolynomial} domain constructor. See Free Lie Algebras by \\spad{C}. Reutenauer (Oxford science publications). \\newline Author: Michel Petitot (petitot@lifl.\\spad{fr}).")) (|varList| (((|List| |#1|) $) "\\spad{varList([l1]*[l2]*...[ln])} returns the list of variables in the word \\spad{l1*l2*...*ln}.")) (|retractable?| (((|Boolean|) $) "\\spad{retractable?([l1]*[l2]*...[ln])} returns \\spad{true} iff \\spad{n} equals \\spad{1}.")) (|rest| (($ $) "\\spad{rest([l1]*[l2]*...[ln])} returns the list \\spad{l2,{} .... ln}.")) (|ListOfTerms| (((|List| (|LyndonWord| |#1|)) $) "\\spad{ListOfTerms([l1]*[l2]*...[ln])} returns the list of words \\spad{l1,{} l2,{} .... ln}.")) (|length| (((|NonNegativeInteger|) $) "\\spad{length([l1]*[l2]*...[ln])} returns the length of the word \\spad{l1*l2*...*ln}.")) (|first| (((|LyndonWord| |#1|) $) "\\spad{first([l1]*[l2]*...[ln])} returns the Lyndon word \\spad{l1}.")) (|coerce| (($ |#1|) "\\spad{coerce(v)} return \\spad{v}") (((|OrderedFreeMonoid| |#1|) $) "\\spad{coerce([l1]*[l2]*...[ln])} returns the word \\spad{l1*l2*...*ln},{} where \\spad{[l_i]} is the backeted form of the Lyndon word \\spad{l_i}.")) ((|One|) (($) "\\spad{1} returns the empty list."))) 
 NIL 
 NIL 
-(-823 UP R) 
+(-822 UP R) 
 ((|constructor| (NIL "This package \\undocumented")) (|compose| ((|#1| |#1| |#1|) "\\spad{compose(p,{}q)} \\undocumented"))) 
 NIL 
 NIL 
-(-824) 
+(-823) 
 ((|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 
-(-825 UP -4049) 
+(-824 UP -4049) 
 ((|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 
-(-826) 
+(-825) 
 ((|measure| (((|Record| (|:| |measure| (|Float|)) (|:| |name| (|String|)) (|:| |explanations| (|List| (|String|)))) (|NumericalPDEProblem|) (|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 PDE problem defined by \\axiom{\\spad{prob}}. \\blankline It calls each \\axiom{domain} listed in \\axiom{\\spad{R}} of \\axiom{category} \\axiomType{PartialDifferentialEquationsSolverCategory} 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 PDEs by checking various attributes of the system of PDEs and calculating a measure of compatibility of each routine to these attributes.") (((|Record| (|:| |measure| (|Float|)) (|:| |name| (|String|)) (|:| |explanations| (|List| (|String|)))) (|NumericalPDEProblem|)) "\\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 PDE problem defined by \\axiom{\\spad{prob}}. \\blankline It calls each \\axiom{domain} of \\axiom{category} \\axiomType{PartialDifferentialEquationsSolverCategory} 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 PDEs by checking various attributes of the system of PDEs and calculating a measure of compatibility of each routine to these attributes.")) (|solve| (((|Result|) (|Float|) (|Float|) (|Float|) (|Float|) (|NonNegativeInteger|) (|NonNegativeInteger|) (|List| (|Expression| (|Float|))) (|List| (|List| (|Expression| (|Float|)))) (|String|)) "\\spad{solve(xmin,{}ymin,{}xmax,{}ymax,{}ngx,{}ngy,{}pde,{}bounds,{}st)} is a top level ANNA function to solve numerically a system of partial differential equations. This is defined as a list of coefficients (\\axiom{\\spad{pde}}),{} a grid (\\axiom{\\spad{xmin}},{} \\axiom{\\spad{ymin}},{} \\axiom{\\spad{xmax}},{} \\axiom{\\spad{ymax}},{} \\axiom{\\spad{ngx}},{} \\axiom{\\spad{ngy}}) and the boundary values (\\axiom{\\spad{bounds}}). A default value for tolerance is used. There is also a parameter (\\axiom{\\spad{st}}) which should contain the value \"elliptic\" if the PDE is known to be elliptic,{} or \"unknown\" if it is uncertain. This causes the routine to check whether the PDE is elliptic. \\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 PDE\\spad{'s} and calculating a measure of compatibility of each routine to these attributes. \\blankline It then calls the resulting `best' routine. \\blankline \\spad{**} At the moment,{} only Second Order Elliptic Partial Differential Equations are solved \\spad{**}") (((|Result|) (|Float|) (|Float|) (|Float|) (|Float|) (|NonNegativeInteger|) (|NonNegativeInteger|) (|List| (|Expression| (|Float|))) (|List| (|List| (|Expression| (|Float|)))) (|String|) (|DoubleFloat|)) "\\spad{solve(xmin,{}ymin,{}xmax,{}ymax,{}ngx,{}ngy,{}pde,{}bounds,{}st,{}tol)} is a top level ANNA function to solve numerically a system of partial differential equations. This is defined as a list of coefficients (\\axiom{\\spad{pde}}),{} a grid (\\axiom{\\spad{xmin}},{} \\axiom{\\spad{ymin}},{} \\axiom{\\spad{xmax}},{} \\axiom{\\spad{ymax}},{} \\axiom{\\spad{ngx}},{} \\axiom{\\spad{ngy}}),{} the boundary values (\\axiom{\\spad{bounds}}) and a tolerance requirement (\\axiom{\\spad{tol}}). There is also a parameter (\\axiom{\\spad{st}}) which should contain the value \"elliptic\" if the PDE is known to be elliptic,{} or \"unknown\" if it is uncertain. This causes the routine to check whether the PDE is elliptic. \\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 PDE\\spad{'s} and calculating a measure of compatibility of each routine to these attributes. \\blankline It then calls the resulting `best' routine. \\blankline \\spad{**} At the moment,{} only Second Order Elliptic Partial Differential Equations are solved \\spad{**}") (((|Result|) (|NumericalPDEProblem|) (|RoutinesTable|)) "\\spad{solve(PDEProblem,{}routines)} is a top level ANNA function to solve numerically a system of partial differential equations. \\blankline The method used to perform the numerical process will be one of the \\spad{routines} contained in the NAG numerical Library. The function predicts the likely most effective routine by checking various attributes of the system of PDE\\spad{'s} and calculating a measure of compatibility of each routine to these attributes. \\blankline It then calls the resulting `best' routine. \\blankline \\spad{**} At the moment,{} only Second Order Elliptic Partial Differential Equations are solved \\spad{**}") (((|Result|) (|NumericalPDEProblem|)) "\\spad{solve(PDEProblem)} is a top level ANNA function to solve numerically a system of partial differential equations. \\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 PDE\\spad{'s} and calculating a measure of compatibility of each routine to these attributes. \\blankline It then calls the resulting `best' routine. \\blankline \\spad{**} At the moment,{} only Second Order Elliptic Partial Differential Equations are solved \\spad{**}"))) 
 NIL 
 NIL 
-(-827) 
+(-826) 
 ((|retract| (((|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{retract(x)} \\undocumented{}")) (|coerce| (((|OutputForm|) $) "\\spad{coerce(x)} \\undocumented{}") (($ (|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{coerce(x)} \\undocumented{}"))) 
 NIL 
 NIL 
-(-828 A S) 
+(-827 A S) 
 ((|constructor| (NIL "A partial differential ring with differentiations indexed by a parameter type \\spad{S}. \\blankline")) (D (($ $ (|List| |#2|) (|List| (|NonNegativeInteger|))) "\\spad{D(x,{} [s1,{}...,{}sn],{} [n1,{}...,{}nn])} computes multiple partial derivatives,{} \\spadignore{i.e.} \\spad{D(...D(x,{} s1,{} n1)...,{} sn,{} nn)}.") (($ $ |#2| (|NonNegativeInteger|)) "\\spad{D(x,{} s,{} n)} computes multiple partial derivatives,{} \\spadignore{i.e.} \\spad{n}-th derivative of \\spad{x} with respect to \\spad{s}.") (($ $ (|List| |#2|)) "\\spad{D(x,{}[s1,{}...sn])} computes successive partial derivatives,{} \\spadignore{i.e.} \\spad{D(...D(x,{} s1)...,{} sn)}.") (($ $ |#2|) "\\spad{D(x,{}v)} computes the partial derivative of \\spad{x} with respect to \\spad{v}.")) (|differentiate| (($ $ (|List| |#2|) (|List| (|NonNegativeInteger|))) "\\spad{differentiate(x,{} [s1,{}...,{}sn],{} [n1,{}...,{}nn])} computes multiple partial derivatives,{} \\spadignore{i.e.}") (($ $ |#2| (|NonNegativeInteger|)) "\\spad{differentiate(x,{} s,{} n)} computes multiple partial derivatives,{} \\spadignore{i.e.} \\spad{n}-th derivative of \\spad{x} with respect to \\spad{s}.") (($ $ (|List| |#2|)) "\\spad{differentiate(x,{}[s1,{}...sn])} computes successive partial derivatives,{} \\spadignore{i.e.} \\spad{differentiate(...differentiate(x,{} s1)...,{} sn)}.") (($ $ |#2|) "\\spad{differentiate(x,{}v)} computes the partial derivative of \\spad{x} with respect to \\spad{v}."))) 
 NIL 
 NIL 
-(-829 S) 
+(-828 S) 
 ((|constructor| (NIL "A partial differential ring with differentiations indexed by a parameter type \\spad{S}. \\blankline")) (D (($ $ (|List| |#1|) (|List| (|NonNegativeInteger|))) "\\spad{D(x,{} [s1,{}...,{}sn],{} [n1,{}...,{}nn])} computes multiple partial derivatives,{} \\spadignore{i.e.} \\spad{D(...D(x,{} s1,{} n1)...,{} sn,{} nn)}.") (($ $ |#1| (|NonNegativeInteger|)) "\\spad{D(x,{} s,{} n)} computes multiple partial derivatives,{} \\spadignore{i.e.} \\spad{n}-th derivative of \\spad{x} with respect to \\spad{s}.") (($ $ (|List| |#1|)) "\\spad{D(x,{}[s1,{}...sn])} computes successive partial derivatives,{} \\spadignore{i.e.} \\spad{D(...D(x,{} s1)...,{} sn)}.") (($ $ |#1|) "\\spad{D(x,{}v)} computes the partial derivative of \\spad{x} with respect to \\spad{v}.")) (|differentiate| (($ $ (|List| |#1|) (|List| (|NonNegativeInteger|))) "\\spad{differentiate(x,{} [s1,{}...,{}sn],{} [n1,{}...,{}nn])} computes multiple partial derivatives,{} \\spadignore{i.e.}") (($ $ |#1| (|NonNegativeInteger|)) "\\spad{differentiate(x,{} s,{} n)} computes multiple partial derivatives,{} \\spadignore{i.e.} \\spad{n}-th derivative of \\spad{x} with respect to \\spad{s}.") (($ $ (|List| |#1|)) "\\spad{differentiate(x,{}[s1,{}...sn])} computes successive partial derivatives,{} \\spadignore{i.e.} \\spad{differentiate(...differentiate(x,{} s1)...,{} sn)}.") (($ $ |#1|) "\\spad{differentiate(x,{}v)} computes the partial derivative of \\spad{x} with respect to \\spad{v}."))) 
 ((-4230 . T)) 
 NIL 
-(-830 S) 
+(-829 S) 
 ((|constructor| (NIL "\\indented{1}{A PendantTree(\\spad{S})is either a leaf? and is an \\spad{S} or has} a left and a right both PendantTree(\\spad{S})\\spad{'s}")) (|coerce| (((|Tree| |#1|) $) "\\spad{coerce(x)} \\undocumented")) (|ptree| (($ $ $) "\\spad{ptree(x,{}y)} \\undocumented") (($ |#1|) "\\spad{ptree(s)} is a leaf? pendant tree"))) 
 NIL 
-((|HasCategory| |#1| (QUOTE (-1013))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))))) 
-(-831 |n| R) 
+((|HasCategory| |#1| (QUOTE (-1013))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))))) 
+(-830 |n| R) 
 ((|constructor| (NIL "Permanent implements the functions {\\em permanent},{} the permanent for square matrices.")) (|permanent| ((|#2| (|SquareMatrix| |#1| |#2|)) "\\spad{permanent(x)} computes the permanent of a square matrix \\spad{x}. The {\\em permanent} is equivalent to the \\spadfun{determinant} except that coefficients have no change of sign. This function is much more difficult to compute than the {\\em determinant}. The formula used is by \\spad{H}.\\spad{J}. Ryser,{} improved by [Nijenhuis and Wilf,{} \\spad{Ch}. 19]. Note: permanent(\\spad{x}) choose one of three algorithms,{} depending on the underlying ring \\spad{R} and on \\spad{n},{} the number of rows (and columns) of \\spad{x:}\\begin{items} \\item 1. if 2 has an inverse in \\spad{R} we can use the algorithm of \\indented{3}{[Nijenhuis and Wilf,{} \\spad{ch}.19,{}\\spad{p}.158]; if 2 has no inverse,{}} \\indented{3}{some modifications are necessary:} \\item 2. if {\\em n > 6} and \\spad{R} is an integral domain with characteristic \\indented{3}{different from 2 (the algorithm works if and only 2 is not a} \\indented{3}{zero-divisor of \\spad{R} and {\\em characteristic()\\$R ^= 2},{}} \\indented{3}{but how to check that for any given \\spad{R} ?),{}} \\indented{3}{the local function {\\em permanent2} is called;} \\item 3. else,{} the local function {\\em permanent3} is called \\indented{3}{(works for all commutative rings \\spad{R}).} \\end{items}"))) 
 NIL 
 NIL 
-(-832 S) 
+(-831 S) 
 ((|constructor| (NIL "PermutationCategory provides a categorial environment \\indented{1}{for subgroups of bijections of a set (\\spadignore{i.e.} permutations)}")) (< (((|Boolean|) $ $) "\\spad{p < q} is an order relation on permutations. Note: this order is only total if and only if \\spad{S} is totally ordered or \\spad{S} is finite.")) (|orbit| (((|Set| |#1|) $ |#1|) "\\spad{orbit(p,{} el)} returns the orbit of {\\em el} under the permutation \\spad{p},{} \\spadignore{i.e.} the set which is given by applications of the powers of \\spad{p} to {\\em el}.")) (|elt| ((|#1| $ |#1|) "\\spad{elt(p,{} el)} returns the image of {\\em el} under the permutation \\spad{p}.")) (|eval| ((|#1| $ |#1|) "\\spad{eval(p,{} el)} returns the image of {\\em el} under the permutation \\spad{p}.")) (|cycles| (($ (|List| (|List| |#1|))) "\\spad{cycles(lls)} coerces a list list of cycles {\\em lls} to a permutation,{} each cycle being a list with not repetitions,{} is coerced to the permutation,{} which maps {\\em ls.i} to {\\em ls.i+1},{} indices modulo the length of the list,{} then these permutations are mutiplied. Error: if repetitions occur in one cycle.")) (|cycle| (($ (|List| |#1|)) "\\spad{cycle(ls)} coerces a cycle {\\em ls},{} \\spadignore{i.e.} a list with not repetitions to a permutation,{} which maps {\\em ls.i} to {\\em ls.i+1},{} indices modulo the length of the list. Error: if repetitions occur."))) 
 ((-4230 . T)) 
 NIL 
-(-833 S) 
+(-832 S) 
 ((|constructor| (NIL "PermutationGroup implements permutation groups acting on a set \\spad{S},{} \\spadignore{i.e.} all subgroups of the symmetric group of \\spad{S},{} represented as a list of permutations (generators). Note that therefore the objects are not members of the \\Language category \\spadtype{Group}. Using the idea of base and strong generators by Sims,{} basic routines and algorithms are implemented so that the word problem for permutation groups can be solved.")) (|initializeGroupForWordProblem| (((|Void|) $ (|Integer|) (|Integer|)) "\\spad{initializeGroupForWordProblem(gp,{}m,{}n)} initializes the group {\\em gp} for the word problem. Notes: (1) with a small integer you get shorter words,{} but the routine takes longer than the standard routine for longer words. (2) be careful: invoking this routine will destroy the possibly stored information about your group (but will recompute it again). (3) users need not call this function normally for the soultion of the word problem.") (((|Void|) $) "\\spad{initializeGroupForWordProblem(gp)} initializes the group {\\em gp} for the word problem. Notes: it calls the other function of this name with parameters 0 and 1: {\\em initializeGroupForWordProblem(gp,{}0,{}1)}. Notes: (1) be careful: invoking this routine will destroy the possibly information about your group (but will recompute it again) (2) users need not call this function normally for the soultion of the word problem.")) (<= (((|Boolean|) $ $) "\\spad{gp1 <= gp2} returns \\spad{true} if and only if {\\em gp1} is a subgroup of {\\em gp2}. Note: because of a bug in the parser you have to call this function explicitly by {\\em gp1 <=\\$(PERMGRP S) gp2}.")) (< (((|Boolean|) $ $) "\\spad{gp1 < gp2} returns \\spad{true} if and only if {\\em gp1} is a proper subgroup of {\\em gp2}.")) (|movedPoints| (((|Set| |#1|) $) "\\spad{movedPoints(gp)} returns the points moved by the group {\\em gp}.")) (|wordInGenerators| (((|List| (|NonNegativeInteger|)) (|Permutation| |#1|) $) "\\spad{wordInGenerators(p,{}gp)} returns the word for the permutation \\spad{p} in the original generators of the group {\\em gp},{} represented by the indices of the list,{} given by {\\em generators}.")) (|wordInStrongGenerators| (((|List| (|NonNegativeInteger|)) (|Permutation| |#1|) $) "\\spad{wordInStrongGenerators(p,{}gp)} returns the word for the permutation \\spad{p} in the strong generators of the group {\\em gp},{} represented by the indices of the list,{} given by {\\em strongGenerators}.")) (|member?| (((|Boolean|) (|Permutation| |#1|) $) "\\spad{member?(pp,{}gp)} answers the question,{} whether the permutation {\\em pp} is in the group {\\em gp} or not.")) (|orbits| (((|Set| (|Set| |#1|)) $) "\\spad{orbits(gp)} returns the orbits of the group {\\em gp},{} \\spadignore{i.e.} it partitions the (finite) of all moved points.")) (|orbit| (((|Set| (|List| |#1|)) $ (|List| |#1|)) "\\spad{orbit(gp,{}ls)} returns the orbit of the ordered list {\\em ls} under the group {\\em gp}. Note: return type is \\spad{L} \\spad{L} \\spad{S} temporarily because FSET \\spad{L} \\spad{S} has an error.") (((|Set| (|Set| |#1|)) $ (|Set| |#1|)) "\\spad{orbit(gp,{}els)} returns the orbit of the unordered set {\\em els} under the group {\\em gp}.") (((|Set| |#1|) $ |#1|) "\\spad{orbit(gp,{}el)} returns the orbit of the element {\\em el} under the group {\\em gp},{} \\spadignore{i.e.} the set of all points gained by applying each group element to {\\em el}.")) (|permutationGroup| (($ (|List| (|Permutation| |#1|))) "\\spad{permutationGroup(ls)} coerces a list of permutations {\\em ls} to the group generated by this list.")) (|wordsForStrongGenerators| (((|List| (|List| (|NonNegativeInteger|))) $) "\\spad{wordsForStrongGenerators(gp)} returns the words for the strong generators of the group {\\em gp} in the original generators of {\\em gp},{} represented by their indices in the list,{} given by {\\em generators}.")) (|strongGenerators| (((|List| (|Permutation| |#1|)) $) "\\spad{strongGenerators(gp)} returns strong generators for the group {\\em gp}.")) (|base| (((|List| |#1|) $) "\\spad{base(gp)} returns a base for the group {\\em gp}.")) (|degree| (((|NonNegativeInteger|) $) "\\spad{degree(gp)} returns the number of points moved by all permutations of the group {\\em gp}.")) (|order| (((|NonNegativeInteger|) $) "\\spad{order(gp)} returns the order of the group {\\em gp}.")) (|random| (((|Permutation| |#1|) $) "\\spad{random(gp)} returns a random product of maximal 20 generators of the group {\\em gp}. Note: {\\em random(gp)=random(gp,{}20)}.") (((|Permutation| |#1|) $ (|Integer|)) "\\spad{random(gp,{}i)} returns a random product of maximal \\spad{i} generators of the group {\\em gp}.")) (|elt| (((|Permutation| |#1|) $ (|NonNegativeInteger|)) "\\spad{elt(gp,{}i)} returns the \\spad{i}-th generator of the group {\\em gp}.")) (|generators| (((|List| (|Permutation| |#1|)) $) "\\spad{generators(gp)} returns the generators of the group {\\em gp}.")) (|coerce| (($ (|List| (|Permutation| |#1|))) "\\spad{coerce(ls)} coerces a list of permutations {\\em ls} to the group generated by this list.") (((|List| (|Permutation| |#1|)) $) "\\spad{coerce(gp)} returns the generators of the group {\\em gp}."))) 
 NIL 
 NIL 
-(-834 S) 
+(-833 S) 
 ((|constructor| (NIL "Permutation(\\spad{S}) implements the group of all bijections \\indented{2}{on a set \\spad{S},{} which move only a finite number of points.} \\indented{2}{A permutation is considered as a map from \\spad{S} into \\spad{S}. In particular} \\indented{2}{multiplication is defined as composition of maps:} \\indented{2}{{\\em pi1 * pi2 = pi1 o pi2}.} \\indented{2}{The internal representation of permuatations are two lists} \\indented{2}{of equal length representing preimages and images.}")) (|coerceImages| (($ (|List| |#1|)) "\\spad{coerceImages(ls)} coerces the list {\\em ls} to a permutation whose image is given by {\\em ls} and the preimage is fixed to be {\\em [1,{}...,{}n]}. Note: {coerceImages(\\spad{ls})=coercePreimagesImages([1,{}...,{}\\spad{n}],{}\\spad{ls})}. We assume that both preimage and image do not contain repetitions.")) (|fixedPoints| (((|Set| |#1|) $) "\\spad{fixedPoints(p)} returns the points fixed by the permutation \\spad{p}.")) (|sort| (((|List| $) (|List| $)) "\\spad{sort(lp)} sorts a list of permutations {\\em lp} according to cycle structure first according to length of cycles,{} second,{} if \\spad{S} has \\spadtype{Finite} or \\spad{S} has \\spadtype{OrderedSet} according to lexicographical order of entries in cycles of equal length.")) (|odd?| (((|Boolean|) $) "\\spad{odd?(p)} returns \\spad{true} if and only if \\spad{p} is an odd permutation \\spadignore{i.e.} {\\em sign(p)} is {\\em -1}.")) (|even?| (((|Boolean|) $) "\\spad{even?(p)} returns \\spad{true} if and only if \\spad{p} is an even permutation,{} \\spadignore{i.e.} {\\em sign(p)} is 1.")) (|sign| (((|Integer|) $) "\\spad{sign(p)} returns the signum of the permutation \\spad{p},{} \\spad{+1} or \\spad{-1}.")) (|numberOfCycles| (((|NonNegativeInteger|) $) "\\spad{numberOfCycles(p)} returns the number of non-trivial cycles of the permutation \\spad{p}.")) (|order| (((|NonNegativeInteger|) $) "\\spad{order(p)} returns the order of a permutation \\spad{p} as a group element.")) (|cyclePartition| (((|Partition|) $) "\\spad{cyclePartition(p)} returns the cycle structure of a permutation \\spad{p} including cycles of length 1 only if \\spad{S} is finite.")) (|movedPoints| (((|Set| |#1|) $) "\\spad{movedPoints(p)} returns the set of points moved by the permutation \\spad{p}.")) (|degree| (((|NonNegativeInteger|) $) "\\spad{degree(p)} retuns the number of points moved by the permutation \\spad{p}.")) (|coerceListOfPairs| (($ (|List| (|List| |#1|))) "\\spad{coerceListOfPairs(lls)} coerces a list of pairs {\\em lls} to a permutation. Error: if not consistent,{} \\spadignore{i.e.} the set of the first elements coincides with the set of second elements. coerce(\\spad{p}) generates output of the permutation \\spad{p} with domain OutputForm.")) (|coerce| (($ (|List| |#1|)) "\\spad{coerce(ls)} coerces a cycle {\\em ls},{} \\spadignore{i.e.} a list with not repetitions to a permutation,{} which maps {\\em ls.i} to {\\em ls.i+1},{} indices modulo the length of the list. Error: if repetitions occur.") (($ (|List| (|List| |#1|))) "\\spad{coerce(lls)} coerces a list of cycles {\\em lls} to a permutation,{} each cycle being a list with no repetitions,{} is coerced to the permutation,{} which maps {\\em ls.i} to {\\em ls.i+1},{} indices modulo the length of the list,{} then these permutations are mutiplied. Error: if repetitions occur in one cycle.")) (|coercePreimagesImages| (($ (|List| (|List| |#1|))) "\\spad{coercePreimagesImages(lls)} coerces the representation {\\em lls} of a permutation as a list of preimages and images to a permutation. We assume that both preimage and image do not contain repetitions.")) (|listRepresentation| (((|Record| (|:| |preimage| (|List| |#1|)) (|:| |image| (|List| |#1|))) $) "\\spad{listRepresentation(p)} produces a representation {\\em rep} of the permutation \\spad{p} as a list of preimages and images,{} \\spad{i}.\\spad{e} \\spad{p} maps {\\em (rep.preimage).k} to {\\em (rep.image).k} for all indices \\spad{k}. Elements of \\spad{S} not in {\\em (rep.preimage).k} are fixed points,{} and these are the only fixed points of the permutation."))) 
 ((-4230 . T)) 
-((|HasCategory| |#1| (QUOTE (-342))) (|HasCategory| |#1| (QUOTE (-784))) (-3703 (|HasCategory| |#1| (QUOTE (-342))) (|HasCategory| |#1| (QUOTE (-784))))) 
-(-835 R E |VarSet| S) 
+((|HasCategory| |#1| (QUOTE (-342))) (|HasCategory| |#1| (QUOTE (-783))) (-3703 (|HasCategory| |#1| (QUOTE (-342))) (|HasCategory| |#1| (QUOTE (-783))))) 
+(-834 R E |VarSet| S) 
 ((|constructor| (NIL "PolynomialFactorizationByRecursion(\\spad{R},{}\\spad{E},{}\\spad{VarSet},{}\\spad{S}) is used for factorization of sparse univariate polynomials over a domain \\spad{S} of multivariate polynomials over \\spad{R}.")) (|factorSFBRlcUnit| (((|Factored| (|SparseUnivariatePolynomial| |#4|)) (|List| |#3|) (|SparseUnivariatePolynomial| |#4|)) "\\spad{factorSFBRlcUnit(p)} returns the square free factorization of polynomial \\spad{p} (see \\spadfun{factorSquareFreeByRecursion}{PolynomialFactorizationByRecursionUnivariate}) in the case where the leading coefficient of \\spad{p} is a unit.")) (|bivariateSLPEBR| (((|Union| (|List| (|SparseUnivariatePolynomial| |#4|)) "failed") (|List| (|SparseUnivariatePolynomial| |#4|)) (|SparseUnivariatePolynomial| |#4|) |#3|) "\\spad{bivariateSLPEBR(lp,{}p,{}v)} implements the bivariate case of \\spadfunFrom{solveLinearPolynomialEquationByRecursion}{PolynomialFactorizationByRecursionUnivariate}; its implementation depends on \\spad{R}")) (|randomR| ((|#1|) "\\spad{randomR produces} a random element of \\spad{R}")) (|factorSquareFreeByRecursion| (((|Factored| (|SparseUnivariatePolynomial| |#4|)) (|SparseUnivariatePolynomial| |#4|)) "\\spad{factorSquareFreeByRecursion(p)} returns the square free factorization of \\spad{p}. This functions performs the recursion step for factorSquareFreePolynomial,{} as defined in \\spadfun{PolynomialFactorizationExplicit} category (see \\spadfun{factorSquareFreePolynomial}).")) (|factorByRecursion| (((|Factored| (|SparseUnivariatePolynomial| |#4|)) (|SparseUnivariatePolynomial| |#4|)) "\\spad{factorByRecursion(p)} factors polynomial \\spad{p}. This function performs the recursion step for factorPolynomial,{} as defined in \\spadfun{PolynomialFactorizationExplicit} category (see \\spadfun{factorPolynomial})")) (|solveLinearPolynomialEquationByRecursion| (((|Union| (|List| (|SparseUnivariatePolynomial| |#4|)) "failed") (|List| (|SparseUnivariatePolynomial| |#4|)) (|SparseUnivariatePolynomial| |#4|)) "\\spad{solveLinearPolynomialEquationByRecursion([p1,{}...,{}pn],{}p)} returns the list of polynomials \\spad{[q1,{}...,{}qn]} such that \\spad{sum qi/pi = p / prod \\spad{pi}},{} a recursion step for solveLinearPolynomialEquation as defined in \\spadfun{PolynomialFactorizationExplicit} category (see \\spadfun{solveLinearPolynomialEquation}). If no such list of \\spad{qi} exists,{} then \"failed\" is returned."))) 
 NIL 
 NIL 
-(-836 R S) 
+(-835 R S) 
 ((|constructor| (NIL "\\indented{1}{PolynomialFactorizationByRecursionUnivariate} \\spad{R} is a \\spadfun{PolynomialFactorizationExplicit} domain,{} \\spad{S} is univariate polynomials over \\spad{R} We are interested in handling SparseUnivariatePolynomials over \\spad{S},{} is a variable we shall call \\spad{z}")) (|factorSFBRlcUnit| (((|Factored| (|SparseUnivariatePolynomial| |#2|)) (|SparseUnivariatePolynomial| |#2|)) "\\spad{factorSFBRlcUnit(p)} returns the square free factorization of polynomial \\spad{p} (see \\spadfun{factorSquareFreeByRecursion}{PolynomialFactorizationByRecursionUnivariate}) in the case where the leading coefficient of \\spad{p} is a unit.")) (|randomR| ((|#1|) "\\spad{randomR()} produces a random element of \\spad{R}")) (|factorSquareFreeByRecursion| (((|Factored| (|SparseUnivariatePolynomial| |#2|)) (|SparseUnivariatePolynomial| |#2|)) "\\spad{factorSquareFreeByRecursion(p)} returns the square free factorization of \\spad{p}. This functions performs the recursion step for factorSquareFreePolynomial,{} as defined in \\spadfun{PolynomialFactorizationExplicit} category (see \\spadfun{factorSquareFreePolynomial}).")) (|factorByRecursion| (((|Factored| (|SparseUnivariatePolynomial| |#2|)) (|SparseUnivariatePolynomial| |#2|)) "\\spad{factorByRecursion(p)} factors polynomial \\spad{p}. This function performs the recursion step for factorPolynomial,{} as defined in \\spadfun{PolynomialFactorizationExplicit} category (see \\spadfun{factorPolynomial})")) (|solveLinearPolynomialEquationByRecursion| (((|Union| (|List| (|SparseUnivariatePolynomial| |#2|)) "failed") (|List| (|SparseUnivariatePolynomial| |#2|)) (|SparseUnivariatePolynomial| |#2|)) "\\spad{solveLinearPolynomialEquationByRecursion([p1,{}...,{}pn],{}p)} returns the list of polynomials \\spad{[q1,{}...,{}qn]} such that \\spad{sum qi/pi = p / prod \\spad{pi}},{} a recursion step for solveLinearPolynomialEquation as defined in \\spadfun{PolynomialFactorizationExplicit} category (see \\spadfun{solveLinearPolynomialEquation}). If no such list of \\spad{qi} exists,{} then \"failed\" is returned."))) 
 NIL 
 NIL 
-(-837 S) 
+(-836 S) 
 ((|constructor| (NIL "This is the category of domains that know \"enough\" about themselves in order to factor univariate polynomials over themselves. This will be used in future releases for supporting factorization over finitely generated coefficient fields,{} it is not yet available in the current release of axiom.")) (|charthRoot| (((|Union| $ "failed") $) "\\spad{charthRoot(r)} returns the \\spad{p}\\spad{-}th root of \\spad{r},{} or \"failed\" if none exists in the domain.")) (|conditionP| (((|Union| (|Vector| $) "failed") (|Matrix| $)) "\\spad{conditionP(m)} returns a vector of elements,{} not all zero,{} whose \\spad{p}\\spad{-}th powers (\\spad{p} is the characteristic of the domain) are a solution of the homogenous linear system represented by \\spad{m},{} or \"failed\" is there is no such vector.")) (|solveLinearPolynomialEquation| (((|Union| (|List| (|SparseUnivariatePolynomial| $)) "failed") (|List| (|SparseUnivariatePolynomial| $)) (|SparseUnivariatePolynomial| $)) "\\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.")) (|gcdPolynomial| (((|SparseUnivariatePolynomial| $) (|SparseUnivariatePolynomial| $) (|SparseUnivariatePolynomial| $)) "\\spad{gcdPolynomial(p,{}q)} returns the \\spad{gcd} of the univariate polynomials \\spad{p} \\spad{qnd} \\spad{q}.")) (|factorSquareFreePolynomial| (((|Factored| (|SparseUnivariatePolynomial| $)) (|SparseUnivariatePolynomial| $)) "\\spad{factorSquareFreePolynomial(p)} factors the univariate polynomial \\spad{p} into irreducibles where \\spad{p} is known to be square free and primitive with respect to its main variable.")) (|factorPolynomial| (((|Factored| (|SparseUnivariatePolynomial| $)) (|SparseUnivariatePolynomial| $)) "\\spad{factorPolynomial(p)} returns the factorization into irreducibles of the univariate polynomial \\spad{p}.")) (|squareFreePolynomial| (((|Factored| (|SparseUnivariatePolynomial| $)) (|SparseUnivariatePolynomial| $)) "\\spad{squareFreePolynomial(p)} returns the square-free factorization of the univariate polynomial \\spad{p}."))) 
 NIL 
 ((|HasCategory| |#1| (QUOTE (-133)))) 
-(-838) 
+(-837) 
 ((|constructor| (NIL "This is the category of domains that know \"enough\" about themselves in order to factor univariate polynomials over themselves. This will be used in future releases for supporting factorization over finitely generated coefficient fields,{} it is not yet available in the current release of axiom.")) (|charthRoot| (((|Union| $ "failed") $) "\\spad{charthRoot(r)} returns the \\spad{p}\\spad{-}th root of \\spad{r},{} or \"failed\" if none exists in the domain.")) (|conditionP| (((|Union| (|Vector| $) "failed") (|Matrix| $)) "\\spad{conditionP(m)} returns a vector of elements,{} not all zero,{} whose \\spad{p}\\spad{-}th powers (\\spad{p} is the characteristic of the domain) are a solution of the homogenous linear system represented by \\spad{m},{} or \"failed\" is there is no such vector.")) (|solveLinearPolynomialEquation| (((|Union| (|List| (|SparseUnivariatePolynomial| $)) "failed") (|List| (|SparseUnivariatePolynomial| $)) (|SparseUnivariatePolynomial| $)) "\\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.")) (|gcdPolynomial| (((|SparseUnivariatePolynomial| $) (|SparseUnivariatePolynomial| $) (|SparseUnivariatePolynomial| $)) "\\spad{gcdPolynomial(p,{}q)} returns the \\spad{gcd} of the univariate polynomials \\spad{p} \\spad{qnd} \\spad{q}.")) (|factorSquareFreePolynomial| (((|Factored| (|SparseUnivariatePolynomial| $)) (|SparseUnivariatePolynomial| $)) "\\spad{factorSquareFreePolynomial(p)} factors the univariate polynomial \\spad{p} into irreducibles where \\spad{p} is known to be square free and primitive with respect to its main variable.")) (|factorPolynomial| (((|Factored| (|SparseUnivariatePolynomial| $)) (|SparseUnivariatePolynomial| $)) "\\spad{factorPolynomial(p)} returns the factorization into irreducibles of the univariate polynomial \\spad{p}.")) (|squareFreePolynomial| (((|Factored| (|SparseUnivariatePolynomial| $)) (|SparseUnivariatePolynomial| $)) "\\spad{squareFreePolynomial(p)} returns the square-free factorization of the univariate polynomial \\spad{p}."))) 
 ((-4226 . T) ((-4235 "*") . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
 NIL 
-(-839 |p|) 
+(-838 |p|) 
 ((|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."))) 
 ((-4225 . T) (-4231 . T) (-4226 . T) ((-4235 "*") . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
 ((|HasCategory| $ (QUOTE (-135))) (|HasCategory| $ (QUOTE (-133))) (|HasCategory| $ (QUOTE (-342)))) 
-(-840 R0 -4049 UP UPUP R) 
+(-839 R0 -4049 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 
-(-841 UP UPUP R) 
+(-840 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| |#3|)) "failed") (|FiniteDivisor| (|Fraction| (|Integer|)) |#1| |#2| |#3|)) "\\spad{torsionIfCan(f)} \\undocumented")) (|torsion?| (((|Boolean|) (|FiniteDivisor| (|Fraction| (|Integer|)) |#1| |#2| |#3|)) "\\spad{torsion?(f)} \\undocumented")) (|order| (((|Union| (|NonNegativeInteger|) "failed") (|FiniteDivisor| (|Fraction| (|Integer|)) |#1| |#2| |#3|)) "\\spad{order(f)} \\undocumented"))) 
 NIL 
 NIL 
-(-842 UP UPUP) 
+(-841 UP UPUP) 
 ((|constructor| (NIL "\\indented{1}{Utilities for PFOQ and PFO} Author: Manuel Bronstein Date Created: 25 Aug 1988 Date Last Updated: 11 Jul 1990")) (|polyred| ((|#2| |#2|) "\\spad{polyred(u)} \\undocumented")) (|doubleDisc| (((|Integer|) |#2|) "\\spad{doubleDisc(u)} \\undocumented")) (|mix| (((|Integer|) (|List| (|Record| (|:| |den| (|Integer|)) (|:| |gcdnum| (|Integer|))))) "\\spad{mix(l)} \\undocumented")) (|badNum| (((|Integer|) |#2|) "\\spad{badNum(u)} \\undocumented") (((|Record| (|:| |den| (|Integer|)) (|:| |gcdnum| (|Integer|))) |#1|) "\\spad{badNum(p)} \\undocumented")) (|getGoodPrime| (((|PositiveInteger|) (|Integer|)) "\\spad{getGoodPrime n} returns the smallest prime not dividing \\spad{n}"))) 
 NIL 
 NIL 
-(-843 R) 
+(-842 R) 
 ((|constructor| (NIL "The domain \\spadtype{PartialFraction} implements partial fractions over a euclidean domain \\spad{R}. This requirement on the argument domain allows us to normalize the fractions. Of particular interest are the 2 forms for these fractions. The ``compact\\spad{''} form has only one fractional term per prime in the denominator,{} while the \\spad{``p}-adic\\spad{''} form expands each numerator \\spad{p}-adically via the prime \\spad{p} in the denominator. For computational efficiency,{} the compact form is used,{} though the \\spad{p}-adic form may be gotten by calling the function \\spadfunFrom{padicFraction}{PartialFraction}. For a general euclidean domain,{} it is not known how to factor the denominator. Thus the function \\spadfunFrom{partialFraction}{PartialFraction} takes as its second argument an element of \\spadtype{Factored(R)}.")) (|wholePart| ((|#1| $) "\\spad{wholePart(p)} extracts the whole part of the partial fraction \\spad{p}.")) (|partialFraction| (($ |#1| (|Factored| |#1|)) "\\spad{partialFraction(numer,{}denom)} is the main function for constructing partial fractions. The second argument is the denominator and should be factored.")) (|padicFraction| (($ $) "\\spad{padicFraction(q)} expands the fraction \\spad{p}-adically in the primes \\spad{p} in the denominator of \\spad{q}. For example,{} \\spad{padicFraction(3/(2**2)) = 1/2 + 1/(2**2)}. Use \\spadfunFrom{compactFraction}{PartialFraction} to return to compact form.")) (|padicallyExpand| (((|SparseUnivariatePolynomial| |#1|) |#1| |#1|) "\\spad{padicallyExpand(p,{}x)} is a utility function that expands the second argument \\spad{x} \\spad{``p}-adically\\spad{''} in the first.")) (|numberOfFractionalTerms| (((|Integer|) $) "\\spad{numberOfFractionalTerms(p)} computes the number of fractional terms in \\spad{p}. This returns 0 if there is no fractional part.")) (|nthFractionalTerm| (($ $ (|Integer|)) "\\spad{nthFractionalTerm(p,{}n)} extracts the \\spad{n}th fractional term from the partial fraction \\spad{p}. This returns 0 if the index \\spad{n} is out of range.")) (|firstNumer| ((|#1| $) "\\spad{firstNumer(p)} extracts the numerator of the first fractional term. This returns 0 if there is no fractional part (use \\spadfunFrom{wholePart}{PartialFraction} to get the whole part).")) (|firstDenom| (((|Factored| |#1|) $) "\\spad{firstDenom(p)} extracts the denominator of the first fractional term. This returns 1 if there is no fractional part (use \\spadfunFrom{wholePart}{PartialFraction} to get the whole part).")) (|compactFraction| (($ $) "\\spad{compactFraction(p)} normalizes the partial fraction \\spad{p} to the compact representation. In this form,{} the partial fraction has only one fractional term per prime in the denominator.")) (|coerce| (($ (|Fraction| (|Factored| |#1|))) "\\spad{coerce(f)} takes a fraction with numerator and denominator in factored form and creates a partial fraction. It is necessary for the parts to be factored because it is not known in general how to factor elements of \\spad{R} and this is needed to decompose into partial fractions.") (((|Fraction| |#1|) $) "\\spad{coerce(p)} sums up the components of the partial fraction and returns a single fraction."))) 
 ((-4225 . T) (-4231 . T) (-4226 . T) ((-4235 "*") . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
 NIL 
-(-844 R) 
+(-843 R) 
 ((|constructor| (NIL "The package \\spadtype{PartialFractionPackage} gives an easier to use interfact the domain \\spadtype{PartialFraction}. The user gives a fraction of polynomials,{} and a variable and the package converts it to the proper datatype for the \\spadtype{PartialFraction} domain.")) (|partialFraction| (((|Any|) (|Polynomial| |#1|) (|Factored| (|Polynomial| |#1|)) (|Symbol|)) "\\spad{partialFraction(num,{} facdenom,{} var)} returns the partial fraction decomposition of the rational function whose numerator is \\spad{num} and whose factored denominator is \\spad{facdenom} with respect to the variable var.") (((|Any|) (|Fraction| (|Polynomial| |#1|)) (|Symbol|)) "\\spad{partialFraction(rf,{} var)} returns the partial fraction decomposition of the rational function \\spad{rf} with respect to the variable var."))) 
 NIL 
 NIL 
-(-845 E OV R P) 
+(-844 E OV R P) 
 ((|gcdPrimitive| ((|#4| (|List| |#4|)) "\\spad{gcdPrimitive lp} computes the \\spad{gcd} of the list of primitive polynomials \\spad{lp}.") (((|SparseUnivariatePolynomial| |#4|) (|SparseUnivariatePolynomial| |#4|) (|SparseUnivariatePolynomial| |#4|)) "\\spad{gcdPrimitive(p,{}q)} computes the \\spad{gcd} of the primitive polynomials \\spad{p} and \\spad{q}.") ((|#4| |#4| |#4|) "\\spad{gcdPrimitive(p,{}q)} computes the \\spad{gcd} of the primitive polynomials \\spad{p} and \\spad{q}.")) (|gcd| (((|SparseUnivariatePolynomial| |#4|) (|List| (|SparseUnivariatePolynomial| |#4|))) "\\spad{gcd(lp)} computes the \\spad{gcd} of the list of polynomials \\spad{lp}.") (((|SparseUnivariatePolynomial| |#4|) (|SparseUnivariatePolynomial| |#4|) (|SparseUnivariatePolynomial| |#4|)) "\\spad{gcd(p,{}q)} computes the \\spad{gcd} of the two polynomials \\spad{p} and \\spad{q}.") ((|#4| (|List| |#4|)) "\\spad{gcd(lp)} computes the \\spad{gcd} of the list of polynomials \\spad{lp}.") ((|#4| |#4| |#4|) "\\spad{gcd(p,{}q)} computes the \\spad{gcd} of the two polynomials \\spad{p} and \\spad{q}."))) 
 NIL 
 NIL 
-(-846) 
+(-845) 
 ((|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 
-(-847 -4049) 
+(-846 -4049) 
 ((|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 
-(-848 R) 
+(-847 R) 
 ((|constructor| (NIL "\\indented{1}{Provides a coercion from the symbolic fractions in \\%\\spad{pi} with} integer coefficients to any Expression type. Date Created: 21 Feb 1990 Date Last Updated: 21 Feb 1990")) (|coerce| (((|Expression| |#1|) (|Pi|)) "\\spad{coerce(f)} returns \\spad{f} as an Expression(\\spad{R})."))) 
 NIL 
 NIL 
-(-849) 
+(-848) 
 ((|constructor| (NIL "The category of constructive principal ideal domains,{} \\spadignore{i.e.} where a single generator can be constructively found for any ideal given by a finite set of generators. Note that this constructive definition only implies that finitely generated ideals are principal. It is not clear what we would mean by an infinitely generated ideal.")) (|expressIdealMember| (((|Union| (|List| $) "failed") (|List| $) $) "\\spad{expressIdealMember([f1,{}...,{}fn],{}h)} returns a representation of \\spad{h} as a linear combination of the \\spad{fi} or \"failed\" if \\spad{h} is not in the ideal generated by the \\spad{fi}.")) (|principalIdeal| (((|Record| (|:| |coef| (|List| $)) (|:| |generator| $)) (|List| $)) "\\spad{principalIdeal([f1,{}...,{}fn])} returns a record whose generator component is a generator of the ideal generated by \\spad{[f1,{}...,{}fn]} whose coef component satisfies \\spad{generator = sum (input.i * coef.i)}"))) 
 ((-4226 . T) ((-4235 "*") . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
 NIL 
-(-850) 
+(-849) 
 ((|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}."))) 
 (((-4235 "*") . T)) 
 NIL 
-(-851 -4049 P) 
+(-850 -4049 P) 
 ((|constructor| (NIL "This package exports interpolation algorithms")) (|LagrangeInterpolation| ((|#2| (|List| |#1|) (|List| |#1|)) "\\spad{LagrangeInterpolation(l1,{}l2)} \\undocumented"))) 
 NIL 
 NIL 
-(-852 |xx| -4049) 
+(-851 |xx| -4049) 
 ((|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 
-(-853 R |Var| |Expon| GR) 
+(-852 R |Var| |Expon| GR) 
 ((|constructor| (NIL "Author: William Sit,{} spring 89")) (|inconsistent?| (((|Boolean|) (|List| (|Polynomial| |#1|))) "inconsistant?(\\spad{pl}) returns \\spad{true} if the system of equations \\spad{p} = 0 for \\spad{p} in \\spad{pl} is inconsistent. It is assumed that \\spad{pl} is a groebner basis.") (((|Boolean|) (|List| |#4|)) "inconsistant?(\\spad{pl}) returns \\spad{true} if the system of equations \\spad{p} = 0 for \\spad{p} in \\spad{pl} is inconsistent. It is assumed that \\spad{pl} is a groebner basis.")) (|sqfree| ((|#4| |#4|) "\\spad{sqfree(p)} returns the product of square free factors of \\spad{p}")) (|regime| (((|Record| (|:| |eqzro| (|List| |#4|)) (|:| |neqzro| (|List| |#4|)) (|:| |wcond| (|List| (|Polynomial| |#1|))) (|:| |bsoln| (|Record| (|:| |partsol| (|Vector| (|Fraction| (|Polynomial| |#1|)))) (|:| |basis| (|List| (|Vector| (|Fraction| (|Polynomial| |#1|)))))))) (|Record| (|:| |det| |#4|) (|:| |rows| (|List| (|Integer|))) (|:| |cols| (|List| (|Integer|)))) (|Matrix| |#4|) (|List| (|Fraction| (|Polynomial| |#1|))) (|List| (|List| |#4|)) (|NonNegativeInteger|) (|NonNegativeInteger|) (|Integer|)) "\\spad{regime(y,{}c,{} w,{} p,{} r,{} rm,{} m)} returns a regime,{} a list of polynomials specifying the consistency conditions,{} a particular solution and basis representing the general solution of the parametric linear system \\spad{c} \\spad{z} = \\spad{w} on that regime. The regime returned depends on the subdeterminant \\spad{y}.det and the row and column indices. The solutions are simplified using the assumption that the system has rank \\spad{r} and maximum rank \\spad{rm}. The list \\spad{p} represents a list of list of factors of polynomials in a groebner basis of the ideal generated by higher order subdeterminants,{} and ius used for the simplification. The mode \\spad{m} distinguishes the cases when the system is homogeneous,{} or the right hand side is arbitrary,{} or when there is no new right hand side variables.")) (|redmat| (((|Matrix| |#4|) (|Matrix| |#4|) (|List| |#4|)) "\\spad{redmat(m,{}g)} returns a matrix whose entries are those of \\spad{m} modulo the ideal generated by the groebner basis \\spad{g}")) (|ParCond| (((|List| (|Record| (|:| |det| |#4|) (|:| |rows| (|List| (|Integer|))) (|:| |cols| (|List| (|Integer|))))) (|Matrix| |#4|) (|NonNegativeInteger|)) "\\spad{ParCond(m,{}k)} returns the list of all \\spad{k} by \\spad{k} subdeterminants in the matrix \\spad{m}")) (|overset?| (((|Boolean|) (|List| |#4|) (|List| (|List| |#4|))) "\\spad{overset?(s,{}sl)} returns \\spad{true} if \\spad{s} properly a sublist of a member of \\spad{sl}; otherwise it returns \\spad{false}")) (|nextSublist| (((|List| (|List| (|Integer|))) (|Integer|) (|Integer|)) "\\spad{nextSublist(n,{}k)} returns a list of \\spad{k}-subsets of {1,{} ...,{} \\spad{n}}.")) (|minset| (((|List| (|List| |#4|)) (|List| (|List| |#4|))) "\\spad{minset(sl)} returns the sublist of \\spad{sl} consisting of the minimal lists (with respect to inclusion) in the list \\spad{sl} of lists")) (|minrank| (((|NonNegativeInteger|) (|List| (|Record| (|:| |rank| (|NonNegativeInteger|)) (|:| |eqns| (|List| (|Record| (|:| |det| |#4|) (|:| |rows| (|List| (|Integer|))) (|:| |cols| (|List| (|Integer|)))))) (|:| |fgb| (|List| |#4|))))) "\\spad{minrank(r)} returns the minimum rank in the list \\spad{r} of regimes")) (|maxrank| (((|NonNegativeInteger|) (|List| (|Record| (|:| |rank| (|NonNegativeInteger|)) (|:| |eqns| (|List| (|Record| (|:| |det| |#4|) (|:| |rows| (|List| (|Integer|))) (|:| |cols| (|List| (|Integer|)))))) (|:| |fgb| (|List| |#4|))))) "\\spad{maxrank(r)} returns the maximum rank in the list \\spad{r} of regimes")) (|factorset| (((|List| |#4|) |#4|) "\\spad{factorset(p)} returns the set of irreducible factors of \\spad{p}.")) (|B1solve| (((|Record| (|:| |partsol| (|Vector| (|Fraction| (|Polynomial| |#1|)))) (|:| |basis| (|List| (|Vector| (|Fraction| (|Polynomial| |#1|)))))) (|Record| (|:| |mat| (|Matrix| (|Fraction| (|Polynomial| |#1|)))) (|:| |vec| (|List| (|Fraction| (|Polynomial| |#1|)))) (|:| |rank| (|NonNegativeInteger|)) (|:| |rows| (|List| (|Integer|))) (|:| |cols| (|List| (|Integer|))))) "\\spad{B1solve(s)} solves the system (\\spad{s}.mat) \\spad{z} = \\spad{s}.vec for the variables given by the column indices of \\spad{s}.cols in terms of the other variables and the right hand side \\spad{s}.vec by assuming that the rank is \\spad{s}.rank,{} that the system is consistent,{} with the linearly independent equations indexed by the given row indices \\spad{s}.rows; the coefficients in \\spad{s}.mat involving parameters are treated as polynomials. B1solve(\\spad{s}) returns a particular solution to the system and a basis of the homogeneous system (\\spad{s}.mat) \\spad{z} = 0.")) (|redpps| (((|Record| (|:| |partsol| (|Vector| (|Fraction| (|Polynomial| |#1|)))) (|:| |basis| (|List| (|Vector| (|Fraction| (|Polynomial| |#1|)))))) (|Record| (|:| |partsol| (|Vector| (|Fraction| (|Polynomial| |#1|)))) (|:| |basis| (|List| (|Vector| (|Fraction| (|Polynomial| |#1|)))))) (|List| |#4|)) "\\spad{redpps(s,{}g)} returns the simplified form of \\spad{s} after reducing modulo a groebner basis \\spad{g}")) (|ParCondList| (((|List| (|Record| (|:| |rank| (|NonNegativeInteger|)) (|:| |eqns| (|List| (|Record| (|:| |det| |#4|) (|:| |rows| (|List| (|Integer|))) (|:| |cols| (|List| (|Integer|)))))) (|:| |fgb| (|List| |#4|)))) (|Matrix| |#4|) (|NonNegativeInteger|)) "\\spad{ParCondList(c,{}r)} computes a list of subdeterminants of each rank \\spad{>=} \\spad{r} of the matrix \\spad{c} and returns a groebner basis for the ideal they generate")) (|hasoln| (((|Record| (|:| |sysok| (|Boolean|)) (|:| |z0| (|List| |#4|)) (|:| |n0| (|List| |#4|))) (|List| |#4|) (|List| |#4|)) "\\spad{hasoln(g,{} l)} tests whether the quasi-algebraic set defined by \\spad{p} = 0 for \\spad{p} in \\spad{g} and \\spad{q} \\spad{^=} 0 for \\spad{q} in \\spad{l} is empty or not and returns a simplified definition of the quasi-algebraic set")) (|pr2dmp| ((|#4| (|Polynomial| |#1|)) "\\spad{pr2dmp(p)} converts \\spad{p} to target domain")) (|se2rfi| (((|List| (|Fraction| (|Polynomial| |#1|))) (|List| (|Symbol|))) "\\spad{se2rfi(l)} converts \\spad{l} to target domain")) (|dmp2rfi| (((|List| (|Fraction| (|Polynomial| |#1|))) (|List| |#4|)) "\\spad{dmp2rfi(l)} converts \\spad{l} to target domain") (((|Matrix| (|Fraction| (|Polynomial| |#1|))) (|Matrix| |#4|)) "\\spad{dmp2rfi(m)} converts \\spad{m} to target domain") (((|Fraction| (|Polynomial| |#1|)) |#4|) "\\spad{dmp2rfi(p)} converts \\spad{p} to target domain")) (|bsolve| (((|Record| (|:| |rgl| (|List| (|Record| (|:| |eqzro| (|List| |#4|)) (|:| |neqzro| (|List| |#4|)) (|:| |wcond| (|List| (|Polynomial| |#1|))) (|:| |bsoln| (|Record| (|:| |partsol| (|Vector| (|Fraction| (|Polynomial| |#1|)))) (|:| |basis| (|List| (|Vector| (|Fraction| (|Polynomial| |#1|)))))))))) (|:| |rgsz| (|Integer|))) (|Matrix| |#4|) (|List| (|Fraction| (|Polynomial| |#1|))) (|NonNegativeInteger|) (|String|) (|Integer|)) "\\spad{bsolve(c,{} w,{} r,{} s,{} m)} returns a list of regimes and solutions of the system \\spad{c} \\spad{z} = \\spad{w} for ranks at least \\spad{r}; depending on the mode \\spad{m} chosen,{} it writes the output to a file given by the string \\spad{s}.")) (|rdregime| (((|List| (|Record| (|:| |eqzro| (|List| |#4|)) (|:| |neqzro| (|List| |#4|)) (|:| |wcond| (|List| (|Polynomial| |#1|))) (|:| |bsoln| (|Record| (|:| |partsol| (|Vector| (|Fraction| (|Polynomial| |#1|)))) (|:| |basis| (|List| (|Vector| (|Fraction| (|Polynomial| |#1|))))))))) (|String|)) "\\spad{rdregime(s)} reads in a list from a file with name \\spad{s}")) (|wrregime| (((|Integer|) (|List| (|Record| (|:| |eqzro| (|List| |#4|)) (|:| |neqzro| (|List| |#4|)) (|:| |wcond| (|List| (|Polynomial| |#1|))) (|:| |bsoln| (|Record| (|:| |partsol| (|Vector| (|Fraction| (|Polynomial| |#1|)))) (|:| |basis| (|List| (|Vector| (|Fraction| (|Polynomial| |#1|))))))))) (|String|)) "\\spad{wrregime(l,{}s)} writes a list of regimes to a file named \\spad{s} and returns the number of regimes written")) (|psolve| (((|Integer|) (|Matrix| |#4|) (|PositiveInteger|) (|String|)) "\\spad{psolve(c,{}k,{}s)} solves \\spad{c} \\spad{z} = 0 for all possible ranks \\spad{>=} \\spad{k} of the matrix \\spad{c},{} writes the results to a file named \\spad{s},{} and returns the number of regimes") (((|Integer|) (|Matrix| |#4|) (|List| (|Symbol|)) (|PositiveInteger|) (|String|)) "\\spad{psolve(c,{}w,{}k,{}s)} solves \\spad{c} \\spad{z} = \\spad{w} for all possible ranks \\spad{>=} \\spad{k} of the matrix \\spad{c} and indeterminate right hand side \\spad{w},{} writes the results to a file named \\spad{s},{} and returns the number of regimes") (((|Integer|) (|Matrix| |#4|) (|List| |#4|) (|PositiveInteger|) (|String|)) "\\spad{psolve(c,{}w,{}k,{}s)} solves \\spad{c} \\spad{z} = \\spad{w} for all possible ranks \\spad{>=} \\spad{k} of the matrix \\spad{c} and given right hand side \\spad{w},{} writes the results to a file named \\spad{s},{} and returns the number of regimes") (((|Integer|) (|Matrix| |#4|) (|String|)) "\\spad{psolve(c,{}s)} solves \\spad{c} \\spad{z} = 0 for all possible ranks of the matrix \\spad{c} and given right hand side vector \\spad{w},{} writes the results to a file named \\spad{s},{} and returns the number of regimes") (((|Integer|) (|Matrix| |#4|) (|List| (|Symbol|)) (|String|)) "\\spad{psolve(c,{}w,{}s)} solves \\spad{c} \\spad{z} = \\spad{w} for all possible ranks of the matrix \\spad{c} and indeterminate right hand side \\spad{w},{} writes the results to a file named \\spad{s},{} and returns the number of regimes") (((|Integer|) (|Matrix| |#4|) (|List| |#4|) (|String|)) "\\spad{psolve(c,{}w,{}s)} solves \\spad{c} \\spad{z} = \\spad{w} for all possible ranks of the matrix \\spad{c} and given right hand side vector \\spad{w},{} writes the results to a file named \\spad{s},{} and returns the number of regimes") (((|List| (|Record| (|:| |eqzro| (|List| |#4|)) (|:| |neqzro| (|List| |#4|)) (|:| |wcond| (|List| (|Polynomial| |#1|))) (|:| |bsoln| (|Record| (|:| |partsol| (|Vector| (|Fraction| (|Polynomial| |#1|)))) (|:| |basis| (|List| (|Vector| (|Fraction| (|Polynomial| |#1|))))))))) (|Matrix| |#4|) (|PositiveInteger|)) "\\spad{psolve(c)} solves the homogeneous linear system \\spad{c} \\spad{z} = 0 for all possible ranks \\spad{>=} \\spad{k} of the matrix \\spad{c}") (((|List| (|Record| (|:| |eqzro| (|List| |#4|)) (|:| |neqzro| (|List| |#4|)) (|:| |wcond| (|List| (|Polynomial| |#1|))) (|:| |bsoln| (|Record| (|:| |partsol| (|Vector| (|Fraction| (|Polynomial| |#1|)))) (|:| |basis| (|List| (|Vector| (|Fraction| (|Polynomial| |#1|))))))))) (|Matrix| |#4|) (|List| (|Symbol|)) (|PositiveInteger|)) "\\spad{psolve(c,{}w,{}k)} solves \\spad{c} \\spad{z} = \\spad{w} for all possible ranks \\spad{>=} \\spad{k} of the matrix \\spad{c} and indeterminate right hand side \\spad{w}") (((|List| (|Record| (|:| |eqzro| (|List| |#4|)) (|:| |neqzro| (|List| |#4|)) (|:| |wcond| (|List| (|Polynomial| |#1|))) (|:| |bsoln| (|Record| (|:| |partsol| (|Vector| (|Fraction| (|Polynomial| |#1|)))) (|:| |basis| (|List| (|Vector| (|Fraction| (|Polynomial| |#1|))))))))) (|Matrix| |#4|) (|List| |#4|) (|PositiveInteger|)) "\\spad{psolve(c,{}w,{}k)} solves \\spad{c} \\spad{z} = \\spad{w} for all possible ranks \\spad{>=} \\spad{k} of the matrix \\spad{c} and given right hand side vector \\spad{w}") (((|List| (|Record| (|:| |eqzro| (|List| |#4|)) (|:| |neqzro| (|List| |#4|)) (|:| |wcond| (|List| (|Polynomial| |#1|))) (|:| |bsoln| (|Record| (|:| |partsol| (|Vector| (|Fraction| (|Polynomial| |#1|)))) (|:| |basis| (|List| (|Vector| (|Fraction| (|Polynomial| |#1|))))))))) (|Matrix| |#4|)) "\\spad{psolve(c)} solves the homogeneous linear system \\spad{c} \\spad{z} = 0 for all possible ranks of the matrix \\spad{c}") (((|List| (|Record| (|:| |eqzro| (|List| |#4|)) (|:| |neqzro| (|List| |#4|)) (|:| |wcond| (|List| (|Polynomial| |#1|))) (|:| |bsoln| (|Record| (|:| |partsol| (|Vector| (|Fraction| (|Polynomial| |#1|)))) (|:| |basis| (|List| (|Vector| (|Fraction| (|Polynomial| |#1|))))))))) (|Matrix| |#4|) (|List| (|Symbol|))) "\\spad{psolve(c,{}w)} solves \\spad{c} \\spad{z} = \\spad{w} for all possible ranks of the matrix \\spad{c} and indeterminate right hand side \\spad{w}") (((|List| (|Record| (|:| |eqzro| (|List| |#4|)) (|:| |neqzro| (|List| |#4|)) (|:| |wcond| (|List| (|Polynomial| |#1|))) (|:| |bsoln| (|Record| (|:| |partsol| (|Vector| (|Fraction| (|Polynomial| |#1|)))) (|:| |basis| (|List| (|Vector| (|Fraction| (|Polynomial| |#1|))))))))) (|Matrix| |#4|) (|List| |#4|)) "\\spad{psolve(c,{}w)} solves \\spad{c} \\spad{z} = \\spad{w} for all possible ranks of the matrix \\spad{c} and given right hand side vector \\spad{w}"))) 
 NIL 
 NIL 
-(-854 S) 
+(-853 S) 
 ((|constructor| (NIL "PlotFunctions1 provides facilities for plotting curves where functions \\spad{SF} \\spad{->} \\spad{SF} are specified by giving an expression")) (|plotPolar| (((|Plot|) |#1| (|Symbol|)) "\\spad{plotPolar(f,{}theta)} plots the graph of \\spad{r = f(theta)} as \\spad{theta} ranges from 0 to 2 \\spad{pi}") (((|Plot|) |#1| (|Symbol|) (|Segment| (|DoubleFloat|))) "\\spad{plotPolar(f,{}theta,{}seg)} plots the graph of \\spad{r = f(theta)} as \\spad{theta} ranges over an interval")) (|plot| (((|Plot|) |#1| |#1| (|Symbol|) (|Segment| (|DoubleFloat|))) "\\spad{plot(f,{}g,{}t,{}seg)} plots the graph of \\spad{x = f(t)},{} \\spad{y = g(t)} as \\spad{t} ranges over an interval.") (((|Plot|) |#1| (|Symbol|) (|Segment| (|DoubleFloat|))) "\\spad{plot(fcn,{}x,{}seg)} plots the graph of \\spad{y = f(x)} on a interval"))) 
 NIL 
 NIL 
-(-855) 
+(-854) 
 ((|constructor| (NIL "Plot3D supports parametric plots defined over a real number system. A real number system is a model for the real numbers and as such may be an approximation. For example,{} floating point numbers and infinite continued fractions are real number systems. The facilities at this point are limited to 3-dimensional parametric plots.")) (|debug3D| (((|Boolean|) (|Boolean|)) "\\spad{debug3D(true)} turns debug mode on; debug3D(\\spad{false}) turns debug mode off.")) (|numFunEvals3D| (((|Integer|)) "\\spad{numFunEvals3D()} returns the number of points computed.")) (|setAdaptive3D| (((|Boolean|) (|Boolean|)) "\\spad{setAdaptive3D(true)} turns adaptive plotting on; setAdaptive3D(\\spad{false}) turns adaptive plotting off.")) (|adaptive3D?| (((|Boolean|)) "\\spad{adaptive3D?()} determines whether plotting be done adaptively.")) (|setScreenResolution3D| (((|Integer|) (|Integer|)) "\\spad{setScreenResolution3D(i)} sets the screen resolution for a 3d graph to \\spad{i}.")) (|screenResolution3D| (((|Integer|)) "\\spad{screenResolution3D()} returns the screen resolution for a 3d graph.")) (|setMaxPoints3D| (((|Integer|) (|Integer|)) "\\spad{setMaxPoints3D(i)} sets the maximum number of points in a plot to \\spad{i}.")) (|maxPoints3D| (((|Integer|)) "\\spad{maxPoints3D()} returns the maximum number of points in a plot.")) (|setMinPoints3D| (((|Integer|) (|Integer|)) "\\spad{setMinPoints3D(i)} sets the minimum number of points in a plot to \\spad{i}.")) (|minPoints3D| (((|Integer|)) "\\spad{minPoints3D()} returns the minimum number of points in a plot.")) (|tValues| (((|List| (|List| (|DoubleFloat|))) $) "\\spad{tValues(p)} returns a list of lists of the values of the parameter for which a point is computed,{} one list for each curve in the plot \\spad{p}.")) (|tRange| (((|Segment| (|DoubleFloat|)) $) "\\spad{tRange(p)} returns the range of the parameter in a parametric plot \\spad{p}.")) (|refine| (($ $) "\\spad{refine(x)} \\undocumented") (($ $ (|Segment| (|DoubleFloat|))) "\\spad{refine(x,{}r)} \\undocumented")) (|zoom| (($ $ (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|))) "\\spad{zoom(x,{}r,{}s,{}t)} \\undocumented")) (|plot| (($ $ (|Segment| (|DoubleFloat|))) "\\spad{plot(x,{}r)} \\undocumented") (($ (|Mapping| (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|))) "\\spad{plot(f1,{}f2,{}f3,{}f4,{}x,{}y,{}z,{}w)} \\undocumented") (($ (|Mapping| (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|DoubleFloat|))) "\\spad{plot(f,{}g,{}h,{}a..b)} plots {/emx = \\spad{f}(\\spad{t}),{} \\spad{y} = \\spad{g}(\\spad{t}),{} \\spad{z} = \\spad{h}(\\spad{t})} as \\spad{t} ranges over {/em[a,{}\\spad{b}]}.")) (|pointPlot| (($ (|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|))) "\\spad{pointPlot(f,{}x,{}y,{}z,{}w)} \\undocumented") (($ (|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|)) (|Segment| (|DoubleFloat|))) "\\spad{pointPlot(f,{}g,{}h,{}a..b)} plots {/emx = \\spad{f}(\\spad{t}),{} \\spad{y} = \\spad{g}(\\spad{t}),{} \\spad{z} = \\spad{h}(\\spad{t})} as \\spad{t} ranges over {/em[a,{}\\spad{b}]}."))) 
 NIL 
 NIL 
-(-856) 
+(-855) 
 ((|constructor| (NIL "The Plot domain supports plotting of functions defined over a real number system. A real number system is a model for the real numbers and as such may be an approximation. For example floating point numbers and infinite continued fractions. The facilities at this point are limited to 2-dimensional plots or either a single function or a parametric function.")) (|debug| (((|Boolean|) (|Boolean|)) "\\spad{debug(true)} turns debug mode on \\spad{debug(false)} turns debug mode off")) (|numFunEvals| (((|Integer|)) "\\spad{numFunEvals()} returns the number of points computed")) (|setAdaptive| (((|Boolean|) (|Boolean|)) "\\spad{setAdaptive(true)} turns adaptive plotting on \\spad{setAdaptive(false)} turns adaptive plotting off")) (|adaptive?| (((|Boolean|)) "\\spad{adaptive?()} determines whether plotting be done adaptively")) (|setScreenResolution| (((|Integer|) (|Integer|)) "\\spad{setScreenResolution(i)} sets the screen resolution to \\spad{i}")) (|screenResolution| (((|Integer|)) "\\spad{screenResolution()} returns the screen resolution")) (|setMaxPoints| (((|Integer|) (|Integer|)) "\\spad{setMaxPoints(i)} sets the maximum number of points in a plot to \\spad{i}")) (|maxPoints| (((|Integer|)) "\\spad{maxPoints()} returns the maximum number of points in a plot")) (|setMinPoints| (((|Integer|) (|Integer|)) "\\spad{setMinPoints(i)} sets the minimum number of points in a plot to \\spad{i}")) (|minPoints| (((|Integer|)) "\\spad{minPoints()} returns the minimum number of points in a plot")) (|tRange| (((|Segment| (|DoubleFloat|)) $) "\\spad{tRange(p)} returns the range of the parameter in a parametric plot \\spad{p}")) (|refine| (($ $) "\\spad{refine(p)} performs a refinement on the plot \\spad{p}") (($ $ (|Segment| (|DoubleFloat|))) "\\spad{refine(x,{}r)} \\undocumented")) (|zoom| (($ $ (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|))) "\\spad{zoom(x,{}r,{}s)} \\undocumented") (($ $ (|Segment| (|DoubleFloat|))) "\\spad{zoom(x,{}r)} \\undocumented")) (|parametric?| (((|Boolean|) $) "\\spad{parametric? determines} whether it is a parametric plot?")) (|plotPolar| (($ (|Mapping| (|DoubleFloat|) (|DoubleFloat|))) "\\spad{plotPolar(f)} plots the polar curve \\spad{r = f(theta)} as theta ranges over the interval \\spad{[0,{}2*\\%\\spad{pi}]}; this is the same as the parametric curve \\spad{x = f(t) * cos(t)},{} \\spad{y = f(t) * sin(t)}.") (($ (|Mapping| (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|DoubleFloat|))) "\\spad{plotPolar(f,{}a..b)} plots the polar curve \\spad{r = f(theta)} as theta ranges over the interval \\spad{[a,{}b]}; this is the same as the parametric curve \\spad{x = f(t) * cos(t)},{} \\spad{y = f(t) * sin(t)}.")) (|pointPlot| (($ (|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|))) "\\spad{pointPlot(t +-> (f(t),{}g(t)),{}a..b,{}c..d,{}e..f)} plots the parametric curve \\spad{x = f(t)},{} \\spad{y = g(t)} as \\spad{t} ranges over the interval \\spad{[a,{}b]}; \\spad{x}-range of \\spad{[c,{}d]} and \\spad{y}-range of \\spad{[e,{}f]} are noted in Plot object.") (($ (|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|)) (|Segment| (|DoubleFloat|))) "\\spad{pointPlot(t +-> (f(t),{}g(t)),{}a..b)} plots the parametric curve \\spad{x = f(t)},{} \\spad{y = g(t)} as \\spad{t} ranges over the interval \\spad{[a,{}b]}.")) (|plot| (($ $ (|Segment| (|DoubleFloat|))) "\\spad{plot(x,{}r)} \\undocumented") (($ (|Mapping| (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|))) "\\spad{plot(f,{}g,{}a..b,{}c..d,{}e..f)} plots the parametric curve \\spad{x = f(t)},{} \\spad{y = g(t)} as \\spad{t} ranges over the interval \\spad{[a,{}b]}; \\spad{x}-range of \\spad{[c,{}d]} and \\spad{y}-range of \\spad{[e,{}f]} are noted in Plot object.") (($ (|Mapping| (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|DoubleFloat|))) "\\spad{plot(f,{}g,{}a..b)} plots the parametric curve \\spad{x = f(t)},{} \\spad{y = g(t)} as \\spad{t} ranges over the interval \\spad{[a,{}b]}.") (($ (|List| (|Mapping| (|DoubleFloat|) (|DoubleFloat|))) (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|))) "\\spad{plot([f1,{}...,{}fm],{}a..b,{}c..d)} plots the functions \\spad{y = f1(x)},{}...,{} \\spad{y = fm(x)} on the interval \\spad{a..b}; \\spad{y}-range of \\spad{[c,{}d]} is noted in Plot object.") (($ (|List| (|Mapping| (|DoubleFloat|) (|DoubleFloat|))) (|Segment| (|DoubleFloat|))) "\\spad{plot([f1,{}...,{}fm],{}a..b)} plots the functions \\spad{y = f1(x)},{}...,{} \\spad{y = fm(x)} on the interval \\spad{a..b}.") (($ (|Mapping| (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|))) "\\spad{plot(f,{}a..b,{}c..d)} plots the function \\spad{f(x)} on the interval \\spad{[a,{}b]}; \\spad{y}-range of \\spad{[c,{}d]} is noted in Plot object.") (($ (|Mapping| (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|DoubleFloat|))) "\\spad{plot(f,{}a..b)} plots the function \\spad{f(x)} on the interval \\spad{[a,{}b]}."))) 
 NIL 
 NIL 
-(-857) 
+(-856) 
 ((|constructor| (NIL "This package exports plotting tools")) (|calcRanges| (((|List| (|Segment| (|DoubleFloat|))) (|List| (|List| (|Point| (|DoubleFloat|))))) "\\spad{calcRanges(l)} \\undocumented"))) 
 NIL 
 NIL 
-(-858 R -4049) 
+(-857 R -4049) 
 ((|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 
-(-859) 
+(-858) 
 ((|constructor| (NIL "Attaching assertions to symbols for pattern matching. Date Created: 21 Mar 1989 Date Last Updated: 23 May 1990")) (|multiple| (((|Expression| (|Integer|)) (|Symbol|)) "\\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.")) (|optional| (((|Expression| (|Integer|)) (|Symbol|)) "\\spad{optional(x)} tells the pattern matcher that \\spad{x} can match an identity (0 in a sum,{} 1 in a product or exponentiation)..")) (|constant| (((|Expression| (|Integer|)) (|Symbol|)) "\\spad{constant(x)} tells the pattern matcher that \\spad{x} should match only the symbol \\spad{'x} and no other quantity.")) (|assert| (((|Expression| (|Integer|)) (|Symbol|) (|String|)) "\\spad{assert(x,{} s)} makes the assertion \\spad{s} about \\spad{x}."))) 
 NIL 
 NIL 
-(-860 S A B) 
+(-859 S A B) 
 ((|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 
-(-861 S R -4049) 
+(-860 S R -4049) 
 ((|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 
-(-862 I) 
+(-861 I) 
 ((|constructor| (NIL "This package provides pattern matching functions on integers.")) (|patternMatch| (((|PatternMatchResult| (|Integer|) |#1|) |#1| (|Pattern| (|Integer|)) (|PatternMatchResult| (|Integer|) |#1|)) "\\spad{patternMatch(n,{} pat,{} res)} matches the pattern \\spad{pat} to the integer \\spad{n}; res contains the variables of \\spad{pat} which are already matched and their matches."))) 
 NIL 
 NIL 
-(-863 S E) 
+(-862 S E) 
 ((|constructor| (NIL "This package provides pattern matching functions on kernels.")) (|patternMatch| (((|PatternMatchResult| |#1| |#2|) (|Kernel| |#2|) (|Pattern| |#1|) (|PatternMatchResult| |#1| |#2|)) "\\spad{patternMatch(f(e1,{}...,{}en),{} pat,{} res)} matches the pattern \\spad{pat} to \\spad{f(e1,{}...,{}en)}; res contains the variables of \\spad{pat} which are already matched and their matches."))) 
 NIL 
 NIL 
-(-864 S R L) 
+(-863 S R L) 
 ((|constructor| (NIL "This package provides pattern matching functions on lists.")) (|patternMatch| (((|PatternMatchListResult| |#1| |#2| |#3|) |#3| (|Pattern| |#1|) (|PatternMatchListResult| |#1| |#2| |#3|)) "\\spad{patternMatch(l,{} pat,{} res)} matches the pattern \\spad{pat} to the list \\spad{l}; res contains the variables of \\spad{pat} which are already matched and their matches."))) 
 NIL 
 NIL 
-(-865 S E V R P) 
+(-864 S E V R P) 
 ((|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 -815) (|devaluate| |#1|)))) 
-(-866 R -4049 -2212) 
+((|HasCategory| |#3| (LIST (QUOTE -814) (|devaluate| |#1|)))) 
+(-865 R -4049 -2244) 
 ((|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 
-(-867 -2212) 
+(-866 -2244) 
 ((|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 
-(-868 S R Q) 
+(-867 S R Q) 
 ((|constructor| (NIL "This package provides pattern matching functions on quotients.")) (|patternMatch| (((|PatternMatchResult| |#1| |#3|) |#3| (|Pattern| |#1|) (|PatternMatchResult| |#1| |#3|)) "\\spad{patternMatch(a/b,{} pat,{} res)} matches the pattern \\spad{pat} to the quotient \\spad{a/b}; res contains the variables of \\spad{pat} which are already matched and their matches."))) 
 NIL 
 NIL 
-(-869 S) 
+(-868 S) 
 ((|constructor| (NIL "This package provides pattern matching functions on symbols.")) (|patternMatch| (((|PatternMatchResult| |#1| (|Symbol|)) (|Symbol|) (|Pattern| |#1|) (|PatternMatchResult| |#1| (|Symbol|))) "\\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 (necessary for recursion)."))) 
 NIL 
 NIL 
-(-870 S R P) 
+(-869 S R P) 
 ((|constructor| (NIL "This package provides tools for the pattern matcher.")) (|patternMatchTimes| (((|PatternMatchResult| |#1| |#3|) (|List| |#3|) (|List| (|Pattern| |#1|)) (|PatternMatchResult| |#1| |#3|) (|Mapping| (|PatternMatchResult| |#1| |#3|) |#3| (|Pattern| |#1|) (|PatternMatchResult| |#1| |#3|))) "\\spad{patternMatchTimes(lsubj,{} lpat,{} res,{} match)} matches the product of patterns \\spad{reduce(*,{}lpat)} to the product of subjects \\spad{reduce(*,{}lsubj)}; \\spad{r} contains the previous matches and match is a pattern-matching function on \\spad{P}.")) (|patternMatch| (((|PatternMatchResult| |#1| |#3|) (|List| |#3|) (|List| (|Pattern| |#1|)) (|Mapping| |#3| (|List| |#3|)) (|PatternMatchResult| |#1| |#3|) (|Mapping| (|PatternMatchResult| |#1| |#3|) |#3| (|Pattern| |#1|) (|PatternMatchResult| |#1| |#3|))) "\\spad{patternMatch(lsubj,{} lpat,{} op,{} res,{} match)} matches the list of patterns \\spad{lpat} to the list of subjects \\spad{lsubj},{} allowing for commutativity; \\spad{op} is the operator such that \\spad{op}(\\spad{lpat}) should match \\spad{op}(\\spad{lsubj}) at the end,{} \\spad{r} contains the previous matches,{} and match is a pattern-matching function on \\spad{P}."))) 
 NIL 
 NIL 
-(-871) 
+(-870) 
 ((|constructor| (NIL "This package provides various polynomial number theoretic functions over the integers.")) (|legendre| (((|SparseUnivariatePolynomial| (|Fraction| (|Integer|))) (|Integer|)) "\\spad{legendre(n)} returns the \\spad{n}th Legendre polynomial \\spad{P[n](x)}. Note: Legendre polynomials,{} denoted \\spad{P[n](x)},{} are computed from the two term recurrence. The generating function is: \\spad{1/sqrt(1-2*t*x+t**2) = sum(P[n](x)*t**n,{} n=0..infinity)}.")) (|laguerre| (((|SparseUnivariatePolynomial| (|Integer|)) (|Integer|)) "\\spad{laguerre(n)} returns the \\spad{n}th Laguerre polynomial \\spad{L[n](x)}. Note: Laguerre polynomials,{} denoted \\spad{L[n](x)},{} are computed from the two term recurrence. The generating function is: \\spad{exp(x*t/(t-1))/(1-t) = sum(L[n](x)*t**n/n!,{} n=0..infinity)}.")) (|hermite| (((|SparseUnivariatePolynomial| (|Integer|)) (|Integer|)) "\\spad{hermite(n)} returns the \\spad{n}th Hermite polynomial \\spad{H[n](x)}. Note: Hermite polynomials,{} denoted \\spad{H[n](x)},{} are computed from the two term recurrence. The generating function is: \\spad{exp(2*t*x-t**2) = sum(H[n](x)*t**n/n!,{} n=0..infinity)}.")) (|fixedDivisor| (((|Integer|) (|SparseUnivariatePolynomial| (|Integer|))) "\\spad{fixedDivisor(a)} for \\spad{a(x)} in \\spad{Z[x]} is the largest integer \\spad{f} such that \\spad{f} divides \\spad{a(x=k)} for all integers \\spad{k}. Note: fixed divisor of \\spad{a} is \\spad{reduce(gcd,{}[a(x=k) for k in 0..degree(a)])}.")) (|euler| (((|SparseUnivariatePolynomial| (|Fraction| (|Integer|))) (|Integer|)) "\\spad{euler(n)} returns the \\spad{n}th Euler polynomial \\spad{E[n](x)}. Note: Euler polynomials denoted \\spad{E(n,{}x)} computed by solving the differential equation \\spad{differentiate(E(n,{}x),{}x) = n E(n-1,{}x)} where \\spad{E(0,{}x) = 1} and initial condition comes from \\spad{E(n) = 2**n E(n,{}1/2)}.")) (|cyclotomic| (((|SparseUnivariatePolynomial| (|Integer|)) (|Integer|)) "\\spad{cyclotomic(n)} returns the \\spad{n}th cyclotomic polynomial \\spad{phi[n](x)}. Note: \\spad{phi[n](x)} is the factor of \\spad{x**n - 1} whose roots are the primitive \\spad{n}th roots of unity.")) (|chebyshevU| (((|SparseUnivariatePolynomial| (|Integer|)) (|Integer|)) "\\spad{chebyshevU(n)} returns the \\spad{n}th Chebyshev polynomial \\spad{U[n](x)}. Note: Chebyshev polynomials of the second kind,{} denoted \\spad{U[n](x)},{} computed from the two term recurrence. The generating function \\spad{1/(1-2*t*x+t**2) = sum(T[n](x)*t**n,{} n=0..infinity)}.")) (|chebyshevT| (((|SparseUnivariatePolynomial| (|Integer|)) (|Integer|)) "\\spad{chebyshevT(n)} returns the \\spad{n}th Chebyshev polynomial \\spad{T[n](x)}. Note: Chebyshev polynomials of the first kind,{} denoted \\spad{T[n](x)},{} computed from the two term recurrence. The generating function \\spad{(1-t*x)/(1-2*t*x+t**2) = sum(T[n](x)*t**n,{} n=0..infinity)}.")) (|bernoulli| (((|SparseUnivariatePolynomial| (|Fraction| (|Integer|))) (|Integer|)) "\\spad{bernoulli(n)} returns the \\spad{n}th Bernoulli polynomial \\spad{B[n](x)}. Note: Bernoulli polynomials denoted \\spad{B(n,{}x)} computed by solving the differential equation \\spad{differentiate(B(n,{}x),{}x) = n B(n-1,{}x)} where \\spad{B(0,{}x) = 1} and initial condition comes from \\spad{B(n) = B(n,{}0)}."))) 
 NIL 
 NIL 
-(-872 R) 
+(-871 R) 
 ((|constructor| (NIL "This domain implements points in coordinate space"))) 
 ((-4234 . T) (-4233 . T)) 
-((|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| (-521) (QUOTE (-784))) (|HasCategory| |#1| (QUOTE (-1013))) (-3703 (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| |#1| (QUOTE (-1013)))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-663))) (|HasCategory| |#1| (QUOTE (-970))) (-12 (|HasCategory| |#1| (QUOTE (-927))) (|HasCategory| |#1| (QUOTE (-970)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|))))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))))) 
-(-873 |lv| R) 
+((|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| (-521) (QUOTE (-783))) (|HasCategory| |#1| (QUOTE (-1013))) (-3703 (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#1| (QUOTE (-1013)))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-663))) (|HasCategory| |#1| (QUOTE (-970))) (-12 (|HasCategory| |#1| (QUOTE (-927))) (|HasCategory| |#1| (QUOTE (-970)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|))))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))))) 
+(-872 |lv| R) 
 ((|constructor| (NIL "Package with the conversion functions among different kind of polynomials")) (|pToDmp| (((|DistributedMultivariatePolynomial| |#1| |#2|) (|Polynomial| |#2|)) "\\spad{pToDmp(p)} converts \\spad{p} from a \\spadtype{POLY} to a \\spadtype{DMP}.")) (|dmpToP| (((|Polynomial| |#2|) (|DistributedMultivariatePolynomial| |#1| |#2|)) "\\spad{dmpToP(p)} converts \\spad{p} from a \\spadtype{DMP} to a \\spadtype{POLY}.")) (|hdmpToP| (((|Polynomial| |#2|) (|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|)) "\\spad{hdmpToP(p)} converts \\spad{p} from a \\spadtype{HDMP} to a \\spadtype{POLY}.")) (|pToHdmp| (((|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|) (|Polynomial| |#2|)) "\\spad{pToHdmp(p)} converts \\spad{p} from a \\spadtype{POLY} to a \\spadtype{HDMP}.")) (|hdmpToDmp| (((|DistributedMultivariatePolynomial| |#1| |#2|) (|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|)) "\\spad{hdmpToDmp(p)} converts \\spad{p} from a \\spadtype{HDMP} to a \\spadtype{DMP}.")) (|dmpToHdmp| (((|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|) (|DistributedMultivariatePolynomial| |#1| |#2|)) "\\spad{dmpToHdmp(p)} converts \\spad{p} from a \\spadtype{DMP} to a \\spadtype{HDMP}."))) 
 NIL 
 NIL 
-(-874 |TheField| |ThePols|) 
+(-873 |TheField| |ThePols|) 
 ((|constructor| (NIL "\\axiomType{RealPolynomialUtilitiesPackage} provides common functions used by interval coding.")) (|lazyVariations| (((|NonNegativeInteger|) (|List| |#1|) (|Integer|) (|Integer|)) "\\axiom{lazyVariations(\\spad{l},{}\\spad{s1},{}\\spad{sn})} is the number of sign variations in the list of non null numbers [s1::l]\\spad{@sn},{}")) (|sturmVariationsOf| (((|NonNegativeInteger|) (|List| |#1|)) "\\axiom{sturmVariationsOf(\\spad{l})} is the number of sign variations in the list of numbers \\spad{l},{} note that the first term counts as a sign")) (|boundOfCauchy| ((|#1| |#2|) "\\axiom{boundOfCauchy(\\spad{p})} bounds the roots of \\spad{p}")) (|sturmSequence| (((|List| |#2|) |#2|) "\\axiom{sturmSequence(\\spad{p}) = sylvesterSequence(\\spad{p},{}\\spad{p'})}")) (|sylvesterSequence| (((|List| |#2|) |#2| |#2|) "\\axiom{sylvesterSequence(\\spad{p},{}\\spad{q})} is the negated remainder sequence of \\spad{p} and \\spad{q} divided by the last computed term"))) 
 NIL 
-((|HasCategory| |#1| (QUOTE (-782)))) 
-(-875 R S) 
+((|HasCategory| |#1| (QUOTE (-781)))) 
+(-874 R S) 
 ((|constructor| (NIL "\\indented{2}{This package takes a mapping between coefficient rings,{} and lifts} it to a mapping between polynomials over those rings.")) (|map| (((|Polynomial| |#2|) (|Mapping| |#2| |#1|) (|Polynomial| |#1|)) "\\spad{map(f,{} p)} produces a new polynomial as a result of applying the function \\spad{f} to every coefficient of the polynomial \\spad{p}."))) 
 NIL 
 NIL 
-(-876 |x| R) 
+(-875 |x| R) 
 ((|constructor| (NIL "This package is primarily to help the interpreter do coercions. It allows you to view a polynomial as a univariate polynomial in one of its variables with coefficients which are again a polynomial in all the other variables.")) (|univariate| (((|UnivariatePolynomial| |#1| (|Polynomial| |#2|)) (|Polynomial| |#2|) (|Variable| |#1|)) "\\spad{univariate(p,{} x)} converts the polynomial \\spad{p} to a one of type \\spad{UnivariatePolynomial(x,{}Polynomial(R))},{} ie. as a member of \\spad{R[...][x]}."))) 
 NIL 
 NIL 
-(-877 S R E |VarSet|) 
+(-876 S R E |VarSet|) 
 ((|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| (($ $ |#4|) "\\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| (($ $ |#4|) "\\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| (($ $ |#4|) "\\spad{discriminant(p,{}v)} returns the disriminant of the polynomial \\spad{p} with respect to the variable \\spad{v}.")) (|resultant| (($ $ $ |#4|) "\\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| |#4|) $) "\\spad{variables(p)} returns the list of those variables actually appearing in the polynomial \\spad{p}.")) (|totalDegree| (((|NonNegativeInteger|) $ (|List| |#4|)) "\\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| |#4|) (|:| |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| $) |#4|) "\\spad{multivariate(sup,{}v)} converts an anonymous univariable polynomial \\spad{sup} to a polynomial in the variable \\spad{v}.") (($ (|SparseUnivariatePolynomial| |#2|) |#4|) "\\spad{multivariate(sup,{}v)} converts an anonymous univariable polynomial \\spad{sup} to a polynomial in the variable \\spad{v}.")) (|monomial| (($ $ (|List| |#4|) (|List| (|NonNegativeInteger|))) "\\spad{monomial(a,{}[v1..vn],{}[e1..en])} returns \\spad{a*prod(vi**ei)}.") (($ $ |#4| (|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| $)) $ $ |#4|) "\\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| |#4|)) "\\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|) $ |#4|) "\\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| |#4| "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| |#2|) $) "\\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| $) $ |#4|) "\\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| |#4|) (|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)}.") (($ $ |#4| (|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| |#4|)) "\\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|) $ |#4|) "\\spad{degree(p,{}v)} gives the degree of polynomial \\spad{p} with respect to the variable \\spad{v}."))) 
 NIL 
-((|HasCategory| |#2| (QUOTE (-838))) (|HasAttribute| |#2| (QUOTE -4231)) (|HasCategory| |#2| (QUOTE (-425))) (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#4| (LIST (QUOTE -815) (QUOTE (-353)))) (|HasCategory| |#2| (LIST (QUOTE -815) (QUOTE (-353)))) (|HasCategory| |#4| (LIST (QUOTE -815) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -815) (QUOTE (-521)))) (|HasCategory| |#4| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-353))))) (|HasCategory| |#2| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-353))))) (|HasCategory| |#4| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521))))) (|HasCategory| |#4| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#2| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#2| (QUOTE (-784)))) 
-(-878 R E |VarSet|) 
+((|HasCategory| |#2| (QUOTE (-837))) (|HasAttribute| |#2| (QUOTE -4231)) (|HasCategory| |#2| (QUOTE (-425))) (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#4| (LIST (QUOTE -814) (QUOTE (-353)))) (|HasCategory| |#2| (LIST (QUOTE -814) (QUOTE (-353)))) (|HasCategory| |#4| (LIST (QUOTE -814) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -814) (QUOTE (-521)))) (|HasCategory| |#4| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-353))))) (|HasCategory| |#2| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-353))))) (|HasCategory| |#4| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521))))) (|HasCategory| |#4| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#2| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#2| (QUOTE (-783)))) 
+(-877 R E |VarSet|) 
 ((|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}."))) 
 (((-4235 "*") |has| |#1| (-157)) (-4226 |has| |#1| (-513)) (-4231 |has| |#1| (-6 -4231)) (-4228 . T) (-4227 . T) (-4230 . T)) 
 NIL 
-(-879 E V R P -4049) 
+(-878 E V R P -4049) 
 ((|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 
-(-880 E |Vars| R P S) 
+(-879 E |Vars| R P S) 
 ((|constructor| (NIL "This package provides a very general map function,{} which given a set \\spad{S} and polynomials over \\spad{R} with maps from the variables into \\spad{S} and the coefficients into \\spad{S},{} maps polynomials into \\spad{S}. \\spad{S} is assumed to support \\spad{+},{} \\spad{*} and \\spad{**}.")) (|map| ((|#5| (|Mapping| |#5| |#2|) (|Mapping| |#5| |#3|) |#4|) "\\spad{map(varmap,{} coefmap,{} p)} takes a \\spad{varmap},{} a mapping from the variables of polynomial \\spad{p} into \\spad{S},{} \\spad{coefmap},{} a mapping from coefficients of \\spad{p} into \\spad{S},{} and \\spad{p},{} and produces a member of \\spad{S} using the corresponding arithmetic. in \\spad{S}"))) 
 NIL 
 NIL 
-(-881 R) 
+(-880 R) 
 ((|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}."))) 
 (((-4235 "*") |has| |#1| (-157)) (-4226 |has| |#1| (-513)) (-4231 |has| |#1| (-6 -4231)) (-4228 . T) (-4227 . T) (-4230 . T)) 
-((|HasCategory| |#1| (QUOTE (-838))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-157))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-513)))) (-12 (|HasCategory| (-1084) (LIST (QUOTE -815) (QUOTE (-353)))) (|HasCategory| |#1| (LIST (QUOTE -815) (QUOTE (-353))))) (-12 (|HasCategory| (-1084) (LIST (QUOTE -815) (QUOTE (-521)))) (|HasCategory| |#1| (LIST (QUOTE -815) (QUOTE (-521))))) (-12 (|HasCategory| (-1084) (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-353))))) (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-353)))))) (-12 (|HasCategory| (-1084) (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521)))))) (-12 (|HasCategory| (-1084) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497))))) (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| |#1| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-337))) (-3703 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521)))))) (|HasAttribute| |#1| (QUOTE -4231)) (|HasCategory| |#1| (QUOTE (-425))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-838)))) (-3703 (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-838)))) (-3703 (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-838)))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-838)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-838)))) (|HasCategory| |#1| (QUOTE (-133))))) 
-(-882 E V R P -4049) 
+((|HasCategory| |#1| (QUOTE (-837))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-157))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-513)))) (-12 (|HasCategory| (-1084) (LIST (QUOTE -814) (QUOTE (-353)))) (|HasCategory| |#1| (LIST (QUOTE -814) (QUOTE (-353))))) (-12 (|HasCategory| (-1084) (LIST (QUOTE -814) (QUOTE (-521)))) (|HasCategory| |#1| (LIST (QUOTE -814) (QUOTE (-521))))) (-12 (|HasCategory| (-1084) (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-353))))) (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-353)))))) (-12 (|HasCategory| (-1084) (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521)))))) (-12 (|HasCategory| (-1084) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497))))) (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#1| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-337))) (-3703 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521)))))) (|HasAttribute| |#1| (QUOTE -4231)) (|HasCategory| |#1| (QUOTE (-425))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-837)))) (-3703 (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-837)))) (-3703 (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-837)))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-837)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-837)))) (|HasCategory| |#1| (QUOTE (-133))))) 
+(-881 E V R P -4049) 
 ((|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)}.")) (|coerce| (($ |#4|) "\\spad{coerce(p)} \\undocumented")) (|denom| ((|#4| $) "\\spad{denom(x)} \\undocumented")) (|numer| ((|#4| $) "\\spad{numer(x)} \\undocumented"))) 
 NIL 
 ((|HasCategory| |#3| (QUOTE (-425)))) 
-(-883) 
+(-882) 
 ((|constructor| (NIL "PlottablePlaneCurveCategory is the category of curves in the plane which may be plotted via the graphics facilities. Functions are provided for obtaining lists of lists of points,{} representing the branches of the curve,{} and for determining the ranges of the \\spad{x}-coordinates and \\spad{y}-coordinates of the points on the curve.")) (|yRange| (((|Segment| (|DoubleFloat|)) $) "\\spad{yRange(c)} returns the range of the \\spad{y}-coordinates of the points on the curve \\spad{c}.")) (|xRange| (((|Segment| (|DoubleFloat|)) $) "\\spad{xRange(c)} returns the range of the \\spad{x}-coordinates of the points on the curve \\spad{c}.")) (|listBranches| (((|List| (|List| (|Point| (|DoubleFloat|)))) $) "\\spad{listBranches(c)} returns a list of lists of points,{} representing the branches of the curve \\spad{c}."))) 
 NIL 
 NIL 
-(-884 R L) 
+(-883 R L) 
 ((|constructor| (NIL "\\spadtype{PrecomputedAssociatedEquations} stores some generic precomputations which speed up the computations of the associated equations needed for factoring operators.")) (|firstUncouplingMatrix| (((|Union| (|Matrix| |#1|) "failed") |#2| (|PositiveInteger|)) "\\spad{firstUncouplingMatrix(op,{} m)} returns the matrix A such that \\spad{A w = (W',{}W'',{}...,{}W^N)} in the corresponding associated equations for right-factors of order \\spad{m} of \\spad{op}. Returns \"failed\" if the matrix A has not been precomputed for the particular combination \\spad{degree(L),{} m}."))) 
 NIL 
 NIL 
-(-885 A B) 
+(-884 A B) 
 ((|constructor| (NIL "\\indented{1}{This package provides tools for operating on primitive arrays} with unary and binary functions involving different underlying types")) (|map| (((|PrimitiveArray| |#2|) (|Mapping| |#2| |#1|) (|PrimitiveArray| |#1|)) "\\spad{map(f,{}a)} applies function \\spad{f} to each member of primitive array \\spad{a} resulting in a new primitive array over a possibly different underlying domain.")) (|reduce| ((|#2| (|Mapping| |#2| |#1| |#2|) (|PrimitiveArray| |#1|) |#2|) "\\spad{reduce(f,{}a,{}r)} applies function \\spad{f} to each successive element of the primitive array \\spad{a} and an accumulant initialized to \\spad{r}. For example,{} \\spad{reduce(_+\\$Integer,{}[1,{}2,{}3],{}0)} does \\spad{3+(2+(1+0))}. Note: third argument \\spad{r} may be regarded as the identity element for the function \\spad{f}.")) (|scan| (((|PrimitiveArray| |#2|) (|Mapping| |#2| |#1| |#2|) (|PrimitiveArray| |#1|) |#2|) "\\spad{scan(f,{}a,{}r)} successively applies \\spad{reduce(f,{}x,{}r)} to more and more leading sub-arrays \\spad{x} of primitive array \\spad{a}. More precisely,{} if \\spad{a} is \\spad{[a1,{}a2,{}...]},{} then \\spad{scan(f,{}a,{}r)} returns \\spad{[reduce(f,{}[a1],{}r),{}reduce(f,{}[a1,{}a2],{}r),{}...]}."))) 
 NIL 
 NIL 
-(-886 S) 
+(-885 S) 
 ((|constructor| (NIL "\\indented{1}{This provides a fast array type with no bound checking on elt\\spad{'s}.} Minimum index is 0 in this type,{} cannot be changed"))) 
 ((-4234 . T) (-4233 . T)) 
-((|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| (-521) (QUOTE (-784))) (|HasCategory| |#1| (QUOTE (-1013))) (-3703 (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| |#1| (QUOTE (-1013)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|))))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))))) 
-(-887) 
+((|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| (-521) (QUOTE (-783))) (|HasCategory| |#1| (QUOTE (-1013))) (-3703 (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#1| (QUOTE (-1013)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|))))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))))) 
+(-886) 
 ((|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 
-(-888 -4049) 
+(-887 -4049) 
 ((|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 
-(-889 I) 
+(-888 I) 
 ((|constructor| (NIL "The \\spadtype{IntegerPrimesPackage} implements a modification of Rabin\\spad{'s} probabilistic primality test and the utility functions \\spadfun{nextPrime},{} \\spadfun{prevPrime} and \\spadfun{primes}.")) (|primes| (((|List| |#1|) |#1| |#1|) "\\spad{primes(a,{}b)} returns a list of all primes \\spad{p} with \\spad{a <= p <= b}")) (|prevPrime| ((|#1| |#1|) "\\spad{prevPrime(n)} returns the largest prime strictly smaller than \\spad{n}")) (|nextPrime| ((|#1| |#1|) "\\spad{nextPrime(n)} returns the smallest prime strictly larger than \\spad{n}")) (|prime?| (((|Boolean|) |#1|) "\\spad{prime?(n)} returns \\spad{true} if \\spad{n} is prime and \\spad{false} if not. The algorithm used is Rabin\\spad{'s} probabilistic primality test (reference: Knuth Volume 2 Semi Numerical Algorithms). If \\spad{prime? n} returns \\spad{false},{} \\spad{n} is proven composite. If \\spad{prime? n} returns \\spad{true},{} prime? may be in error however,{} the probability of error is very low. and is zero below 25*10**9 (due to a result of Pomerance et al),{} below 10**12 and 10**13 due to results of Pinch,{} and below 341550071728321 due to a result of Jaeschke. Specifically,{} this implementation does at least 10 pseudo prime tests and so the probability of error is \\spad{< 4**(-10)}. The running time of this method is cubic in the length of the input \\spad{n},{} that is \\spad{O( (log n)**3 )},{} for n<10**20. beyond that,{} the algorithm is quartic,{} \\spad{O( (log n)**4 )}. Two improvements due to Davenport have been incorporated which catches some trivial strong pseudo-primes,{} such as [Jaeschke,{} 1991] 1377161253229053 * 413148375987157,{} which the original algorithm regards as prime"))) 
 NIL 
 NIL 
-(-890) 
+(-889) 
 ((|constructor| (NIL "PrintPackage provides a print function for output forms.")) (|print| (((|Void|) (|OutputForm|)) "\\spad{print(o)} writes the output form \\spad{o} on standard output using the two-dimensional formatter."))) 
 NIL 
 NIL 
-(-891 R E) 
+(-890 R E) 
 ((|constructor| (NIL "This domain represents generalized polynomials with coefficients (from a not necessarily commutative ring),{} and terms indexed by their exponents (from an arbitrary ordered abelian monoid). This type is used,{} for example,{} by the \\spadtype{DistributedMultivariatePolynomial} domain where the exponent domain is a direct product of non negative integers.")) (|canonicalUnitNormal| ((|attribute|) "canonicalUnitNormal guarantees that the function unitCanonical returns the same representative for all associates of any particular element.")) (|fmecg| (($ $ |#2| |#1| $) "\\spad{fmecg(p1,{}e,{}r,{}p2)} finds \\spad{X} : \\spad{p1} - \\spad{r} * X**e * \\spad{p2}"))) 
 (((-4235 "*") |has| |#1| (-157)) (-4226 |has| |#1| (-513)) (-4231 |has| |#1| (-6 -4231)) (-4227 . T) (-4228 . T) (-4230 . T)) 
 ((|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-157))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-513)))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-425))) (-12 (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#2| (QUOTE (-124)))) (-3703 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521)))))) (|HasAttribute| |#1| (QUOTE -4231))) 
-(-892 A B) 
+(-891 A B) 
 ((|constructor| (NIL "This domain implements cartesian product")) (|selectsecond| ((|#2| $) "\\spad{selectsecond(x)} \\undocumented")) (|selectfirst| ((|#1| $) "\\spad{selectfirst(x)} \\undocumented")) (|makeprod| (($ |#1| |#2|) "\\spad{makeprod(a,{}b)} \\undocumented"))) 
 ((-4230 -12 (|has| |#2| (-446)) (|has| |#1| (-446)))) 
-((-12 (|HasCategory| |#1| (QUOTE (-729))) (|HasCategory| |#2| (QUOTE (-729)))) (-12 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-21)))) (-12 (|HasCategory| |#1| (QUOTE (-446))) (|HasCategory| |#2| (QUOTE (-446)))) (-12 (|HasCategory| |#1| (QUOTE (-342))) (|HasCategory| |#2| (QUOTE (-342)))) (-12 (|HasCategory| |#1| (QUOTE (-663))) (|HasCategory| |#2| (QUOTE (-663)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-446))) (|HasCategory| |#2| (QUOTE (-446)))) (-12 (|HasCategory| |#1| (QUOTE (-663))) (|HasCategory| |#2| (QUOTE (-663))))) (-12 (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-23)))) (-12 (|HasCategory| |#1| (QUOTE (-124))) (|HasCategory| |#2| (QUOTE (-124)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-21)))) (-12 (|HasCategory| |#1| (QUOTE (-124))) (|HasCategory| |#2| (QUOTE (-124)))) (-12 (|HasCategory| |#1| (QUOTE (-729))) (|HasCategory| |#2| (QUOTE (-729))))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-21)))) (-12 (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-23)))) (-12 (|HasCategory| |#1| (QUOTE (-124))) (|HasCategory| |#2| (QUOTE (-124)))) (-12 (|HasCategory| |#1| (QUOTE (-729))) (|HasCategory| |#2| (QUOTE (-729))))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-21)))) (-12 (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-23)))) (-12 (|HasCategory| |#1| (QUOTE (-124))) (|HasCategory| |#2| (QUOTE (-124)))) (-12 (|HasCategory| |#1| (QUOTE (-446))) (|HasCategory| |#2| (QUOTE (-446)))) (-12 (|HasCategory| |#1| (QUOTE (-663))) (|HasCategory| |#2| (QUOTE (-663)))) (-12 (|HasCategory| |#1| (QUOTE (-729))) (|HasCategory| |#2| (QUOTE (-729))))) (-12 (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| |#2| (QUOTE (-784)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-729))) (|HasCategory| |#2| (QUOTE (-729)))) (-12 (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| |#2| (QUOTE (-784)))))) 
+((-12 (|HasCategory| |#1| (QUOTE (-729))) (|HasCategory| |#2| (QUOTE (-729)))) (-12 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-21)))) (-12 (|HasCategory| |#1| (QUOTE (-446))) (|HasCategory| |#2| (QUOTE (-446)))) (-12 (|HasCategory| |#1| (QUOTE (-342))) (|HasCategory| |#2| (QUOTE (-342)))) (-12 (|HasCategory| |#1| (QUOTE (-663))) (|HasCategory| |#2| (QUOTE (-663)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-446))) (|HasCategory| |#2| (QUOTE (-446)))) (-12 (|HasCategory| |#1| (QUOTE (-663))) (|HasCategory| |#2| (QUOTE (-663))))) (-12 (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-23)))) (-12 (|HasCategory| |#1| (QUOTE (-124))) (|HasCategory| |#2| (QUOTE (-124)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-21)))) (-12 (|HasCategory| |#1| (QUOTE (-124))) (|HasCategory| |#2| (QUOTE (-124)))) (-12 (|HasCategory| |#1| (QUOTE (-729))) (|HasCategory| |#2| (QUOTE (-729))))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-21)))) (-12 (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-23)))) (-12 (|HasCategory| |#1| (QUOTE (-124))) (|HasCategory| |#2| (QUOTE (-124)))) (-12 (|HasCategory| |#1| (QUOTE (-729))) (|HasCategory| |#2| (QUOTE (-729))))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-21)))) (-12 (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-23)))) (-12 (|HasCategory| |#1| (QUOTE (-124))) (|HasCategory| |#2| (QUOTE (-124)))) (-12 (|HasCategory| |#1| (QUOTE (-446))) (|HasCategory| |#2| (QUOTE (-446)))) (-12 (|HasCategory| |#1| (QUOTE (-663))) (|HasCategory| |#2| (QUOTE (-663)))) (-12 (|HasCategory| |#1| (QUOTE (-729))) (|HasCategory| |#2| (QUOTE (-729))))) (-12 (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#2| (QUOTE (-783)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-729))) (|HasCategory| |#2| (QUOTE (-729)))) (-12 (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#2| (QUOTE (-783)))))) 
+(-892) 
+((|constructor| (NIL "\\indented{1}{Author: Gabriel Dos Reis} Date Created: October 24,{} 2007 Date Last Modified: January 18,{} 2008. An `Property' is a pair of name and value.")) (|property| (($ (|Symbol|) (|SExpression|)) "\\spad{property(n,{}val)} constructs a property with name \\spad{`n'} and value `val'.")) (|value| (((|SExpression|) $) "\\spad{value(p)} returns value of property \\spad{p}")) (|name| (((|Symbol|) $) "\\spad{name(p)} returns the name of property \\spad{p}"))) 
+NIL 
+NIL 
 (-893 T$) 
 ((|constructor| (NIL "This domain implements propositional formula build over a term domain,{} that itself belongs to PropositionalLogic")) (|equivOperands| (((|Pair| $ $) $) "\\spad{equivOperands p} extracts the operands to the logical equivalence; otherwise errors.")) (|equiv?| (((|Boolean|) $) "\\spad{equiv? p} is \\spad{true} when \\spad{`p'} is a logical equivalence.")) (|impliesOperands| (((|Pair| $ $) $) "\\spad{impliesOperands p} extracts the operands to the logical implication; otherwise errors.")) (|implies?| (((|Boolean|) $) "\\spad{implies? p} is \\spad{true} when \\spad{`p'} is a logical implication.")) (|orOperands| (((|Pair| $ $) $) "\\spad{orOperands p} extracts the operands to the logical disjunction; otherwise errors.")) (|or?| (((|Boolean|) $) "\\spad{or? p} is \\spad{true} when \\spad{`p'} is a logical disjunction.")) (|andOperands| (((|Pair| $ $) $) "\\spad{andOperands p} extracts the operands of the logical conjunction; otherwise errors.")) (|and?| (((|Boolean|) $) "\\spad{and? p} is \\spad{true} when \\spad{`p'} is a logical conjunction.")) (|notOperand| (($ $) "\\spad{notOperand returns} the operand to the logical `not' operator; otherwise errors.")) (|not?| (((|Boolean|) $) "\\spad{not? p} is \\spad{true} when \\spad{`p'} is a logical negation")) (|variable| (((|Symbol|) $) "\\spad{variable p} extracts the varible name from \\spad{`p'}; otherwise errors.")) (|variable?| (((|Boolean|) $) "variables? \\spad{p} returns \\spad{true} when \\spad{`p'} really is a variable.")) (|term| ((|#1| $) "\\spad{term p} extracts the term value from \\spad{`p'}; otherwise errors.")) (|term?| (((|Boolean|) $) "\\spad{term? p} returns \\spad{true} when \\spad{`p'} really is a term")) (|variables| (((|Set| (|Symbol|)) $) "\\spad{variables(p)} returns the set of propositional variables appearing in the proposition \\spad{`p'}.")) (|coerce| (($ (|Symbol|)) "\\spad{coerce(t)} turns the term \\spad{`t'} into a propositional variable.") (($ |#1|) "\\spad{coerce(t)} turns the term \\spad{`t'} into a propositional formula"))) 
 NIL 
-((|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792))))) 
+((|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791))))) 
 (-894) 
 ((|constructor| (NIL "This category declares the connectives of Propositional Logic.")) (|equiv| (($ $ $) "\\spad{equiv(p,{}q)} returns the logical equivalence of \\spad{`p'},{} \\spad{`q'}.")) (|implies| (($ $ $) "\\spad{implies(p,{}q)} returns the logical implication of \\spad{`q'} by \\spad{`p'}.")) (|or| (($ $ $) "\\spad{p or q} returns the logical disjunction of \\spad{`p'},{} \\spad{`q'}.")) (|and| (($ $ $) "\\spad{p and q} returns the logical conjunction of \\spad{`p'},{} \\spad{`q'}.")) (|not| (($ $) "\\spad{not p} returns the logical negation of \\spad{`p'}."))) 
 NIL 
 NIL 
 (-895 S) 
 ((|constructor| (NIL "A priority queue is a bag of items from an ordered set where the item extracted is always the maximum element.")) (|merge!| (($ $ $) "\\spad{merge!(q,{}q1)} destructively changes priority queue \\spad{q} to include the values from priority queue \\spad{q1}.")) (|merge| (($ $ $) "\\spad{merge(q1,{}q2)} returns combines priority queues \\spad{q1} and \\spad{q2} to return a single priority queue \\spad{q}.")) (|max| ((|#1| $) "\\spad{max(q)} returns the maximum element of priority queue \\spad{q}."))) 
-((-4233 . T) (-4234 . T) (-2046 . T)) 
+((-4233 . T) (-4234 . T) (-2092 . T)) 
 NIL 
 (-896 R |polR|) 
 ((|constructor| (NIL "This package contains some functions: \\axiomOpFrom{discriminant}{PseudoRemainderSequence},{} \\axiomOpFrom{resultant}{PseudoRemainderSequence},{} \\axiomOpFrom{subResultantGcd}{PseudoRemainderSequence},{} \\axiomOpFrom{chainSubResultants}{PseudoRemainderSequence},{} \\axiomOpFrom{degreeSubResultant}{PseudoRemainderSequence},{} \\axiomOpFrom{lastSubResultant}{PseudoRemainderSequence},{} \\axiomOpFrom{resultantEuclidean}{PseudoRemainderSequence},{} \\axiomOpFrom{subResultantGcdEuclidean}{PseudoRemainderSequence},{} \\axiomOpFrom{semiSubResultantGcdEuclidean1}{PseudoRemainderSequence},{} \\axiomOpFrom{semiSubResultantGcdEuclidean2}{PseudoRemainderSequence},{} etc. This procedures are coming from improvements of the subresultants algorithm. \\indented{2}{Version : 7} \\indented{2}{References : Lionel Ducos \"Optimizations of the subresultant algorithm\"} \\indented{2}{to appear in the Journal of Pure and Applied Algebra.} \\indented{2}{Author : Ducos Lionel \\axiom{Lionel.Ducos@mathlabo.univ-poitiers.\\spad{fr}}}")) (|semiResultantEuclideannaif| (((|Record| (|:| |coef2| |#2|) (|:| |resultant| |#1|)) |#2| |#2|) "\\axiom{resultantEuclidean_naif(\\spad{P},{}\\spad{Q})} returns the semi-extended resultant of \\axiom{\\spad{P}} and \\axiom{\\spad{Q}} computed by means of the naive algorithm.")) (|resultantEuclideannaif| (((|Record| (|:| |coef1| |#2|) (|:| |coef2| |#2|) (|:| |resultant| |#1|)) |#2| |#2|) "\\axiom{resultantEuclidean_naif(\\spad{P},{}\\spad{Q})} returns the extended resultant of \\axiom{\\spad{P}} and \\axiom{\\spad{Q}} computed by means of the naive algorithm.")) (|resultantnaif| ((|#1| |#2| |#2|) "\\axiom{resultantEuclidean_naif(\\spad{P},{}\\spad{Q})} returns the resultant of \\axiom{\\spad{P}} and \\axiom{\\spad{Q}} computed by means of the naive algorithm.")) (|nextsousResultant2| ((|#2| |#2| |#2| |#2| |#1|) "\\axiom{nextsousResultant2(\\spad{P},{} \\spad{Q},{} \\spad{Z},{} \\spad{s})} returns the subresultant \\axiom{\\spad{S_}{\\spad{e}-1}} where \\axiom{\\spad{P} ~ \\spad{S_d},{} \\spad{Q} = \\spad{S_}{\\spad{d}-1},{} \\spad{Z} = S_e,{} \\spad{s} = \\spad{lc}(\\spad{S_d})}")) (|Lazard2| ((|#2| |#2| |#1| |#1| (|NonNegativeInteger|)) "\\axiom{Lazard2(\\spad{F},{} \\spad{x},{} \\spad{y},{} \\spad{n})} computes \\axiom{(x/y)\\spad{**}(\\spad{n}-1) * \\spad{F}}")) (|Lazard| ((|#1| |#1| |#1| (|NonNegativeInteger|)) "\\axiom{Lazard(\\spad{x},{} \\spad{y},{} \\spad{n})} computes \\axiom{x**n/y**(\\spad{n}-1)}")) (|divide| (((|Record| (|:| |quotient| |#2|) (|:| |remainder| |#2|)) |#2| |#2|) "\\axiom{divide(\\spad{F},{}\\spad{G})} computes quotient and rest of the exact euclidean division of \\axiom{\\spad{F}} by \\axiom{\\spad{G}}.")) (|pseudoDivide| (((|Record| (|:| |coef| |#1|) (|:| |quotient| |#2|) (|:| |remainder| |#2|)) |#2| |#2|) "\\axiom{pseudoDivide(\\spad{P},{}\\spad{Q})} computes the pseudoDivide of \\axiom{\\spad{P}} by \\axiom{\\spad{Q}}.")) (|exquo| (((|Vector| |#2|) (|Vector| |#2|) |#1|) "\\axiom{\\spad{v} exquo \\spad{r}} computes the exact quotient of \\axiom{\\spad{v}} by \\axiom{\\spad{r}}")) (* (((|Vector| |#2|) |#1| (|Vector| |#2|)) "\\axiom{\\spad{r} * \\spad{v}} computes the product of \\axiom{\\spad{r}} and \\axiom{\\spad{v}}")) (|gcd| ((|#2| |#2| |#2|) "\\axiom{\\spad{gcd}(\\spad{P},{} \\spad{Q})} returns the \\spad{gcd} of \\axiom{\\spad{P}} and \\axiom{\\spad{Q}}.")) (|semiResultantReduitEuclidean| (((|Record| (|:| |coef2| |#2|) (|:| |resultantReduit| |#1|)) |#2| |#2|) "\\axiom{semiResultantReduitEuclidean(\\spad{P},{}\\spad{Q})} returns the \"reduce resultant\" and carries out the equality \\axiom{...\\spad{P} + coef2*Q = resultantReduit(\\spad{P},{}\\spad{Q})}.")) (|resultantReduitEuclidean| (((|Record| (|:| |coef1| |#2|) (|:| |coef2| |#2|) (|:| |resultantReduit| |#1|)) |#2| |#2|) "\\axiom{resultantReduitEuclidean(\\spad{P},{}\\spad{Q})} returns the \"reduce resultant\" and carries out the equality \\axiom{coef1*P + coef2*Q = resultantReduit(\\spad{P},{}\\spad{Q})}.")) (|resultantReduit| ((|#1| |#2| |#2|) "\\axiom{resultantReduit(\\spad{P},{}\\spad{Q})} returns the \"reduce resultant\" of \\axiom{\\spad{P}} and \\axiom{\\spad{Q}}.")) (|schema| (((|List| (|NonNegativeInteger|)) |#2| |#2|) "\\axiom{schema(\\spad{P},{}\\spad{Q})} returns the list of degrees of non zero subresultants of \\axiom{\\spad{P}} and \\axiom{\\spad{Q}}.")) (|chainSubResultants| (((|List| |#2|) |#2| |#2|) "\\axiom{chainSubResultants(\\spad{P},{} \\spad{Q})} computes the list of non zero subresultants of \\axiom{\\spad{P}} and \\axiom{\\spad{Q}}.")) (|semiDiscriminantEuclidean| (((|Record| (|:| |coef2| |#2|) (|:| |discriminant| |#1|)) |#2|) "\\axiom{discriminantEuclidean(\\spad{P})} carries out the equality \\axiom{...\\spad{P} + coef2 * \\spad{D}(\\spad{P}) = discriminant(\\spad{P})}. Warning: \\axiom{degree(\\spad{P}) \\spad{>=} degree(\\spad{Q})}.")) (|discriminantEuclidean| (((|Record| (|:| |coef1| |#2|) (|:| |coef2| |#2|) (|:| |discriminant| |#1|)) |#2|) "\\axiom{discriminantEuclidean(\\spad{P})} carries out the equality \\axiom{coef1 * \\spad{P} + coef2 * \\spad{D}(\\spad{P}) = discriminant(\\spad{P})}.")) (|discriminant| ((|#1| |#2|) "\\axiom{discriminant(\\spad{P},{} \\spad{Q})} returns the discriminant of \\axiom{\\spad{P}} and \\axiom{\\spad{Q}}.")) (|semiSubResultantGcdEuclidean1| (((|Record| (|:| |coef1| |#2|) (|:| |gcd| |#2|)) |#2| |#2|) "\\axiom{semiSubResultantGcdEuclidean1(\\spad{P},{}\\spad{Q})} carries out the equality \\axiom{coef1*P + ? \\spad{Q} = \\spad{+/-} S_i(\\spad{P},{}\\spad{Q})} where the degree (not the indice) of the subresultant \\axiom{S_i(\\spad{P},{}\\spad{Q})} is the smaller as possible.")) (|semiSubResultantGcdEuclidean2| (((|Record| (|:| |coef2| |#2|) (|:| |gcd| |#2|)) |#2| |#2|) "\\axiom{semiSubResultantGcdEuclidean2(\\spad{P},{}\\spad{Q})} carries out the equality \\axiom{...\\spad{P} + coef2*Q = \\spad{+/-} S_i(\\spad{P},{}\\spad{Q})} where the degree (not the indice) of the subresultant \\axiom{S_i(\\spad{P},{}\\spad{Q})} is the smaller as possible. Warning: \\axiom{degree(\\spad{P}) \\spad{>=} degree(\\spad{Q})}.")) (|subResultantGcdEuclidean| (((|Record| (|:| |coef1| |#2|) (|:| |coef2| |#2|) (|:| |gcd| |#2|)) |#2| |#2|) "\\axiom{subResultantGcdEuclidean(\\spad{P},{}\\spad{Q})} carries out the equality \\axiom{coef1*P + coef2*Q = \\spad{+/-} S_i(\\spad{P},{}\\spad{Q})} where the degree (not the indice) of the subresultant \\axiom{S_i(\\spad{P},{}\\spad{Q})} is the smaller as possible.")) (|subResultantGcd| ((|#2| |#2| |#2|) "\\axiom{subResultantGcd(\\spad{P},{} \\spad{Q})} returns the \\spad{gcd} of two primitive polynomials \\axiom{\\spad{P}} and \\axiom{\\spad{Q}}.")) (|semiLastSubResultantEuclidean| (((|Record| (|:| |coef2| |#2|) (|:| |subResultant| |#2|)) |#2| |#2|) "\\axiom{semiLastSubResultantEuclidean(\\spad{P},{} \\spad{Q})} computes the last non zero subresultant \\axiom{\\spad{S}} and carries out the equality \\axiom{...\\spad{P} + coef2*Q = \\spad{S}}. Warning: \\axiom{degree(\\spad{P}) \\spad{>=} degree(\\spad{Q})}.")) (|lastSubResultantEuclidean| (((|Record| (|:| |coef1| |#2|) (|:| |coef2| |#2|) (|:| |subResultant| |#2|)) |#2| |#2|) "\\axiom{lastSubResultantEuclidean(\\spad{P},{} \\spad{Q})} computes the last non zero subresultant \\axiom{\\spad{S}} and carries out the equality \\axiom{coef1*P + coef2*Q = \\spad{S}}.")) (|lastSubResultant| ((|#2| |#2| |#2|) "\\axiom{lastSubResultant(\\spad{P},{} \\spad{Q})} computes the last non zero subresultant of \\axiom{\\spad{P}} and \\axiom{\\spad{Q}}")) (|semiDegreeSubResultantEuclidean| (((|Record| (|:| |coef2| |#2|) (|:| |subResultant| |#2|)) |#2| |#2| (|NonNegativeInteger|)) "\\axiom{indiceSubResultant(\\spad{P},{} \\spad{Q},{} \\spad{i})} returns a subresultant \\axiom{\\spad{S}} of degree \\axiom{\\spad{d}} and carries out the equality \\axiom{...\\spad{P} + coef2*Q = S_i}. Warning: \\axiom{degree(\\spad{P}) \\spad{>=} degree(\\spad{Q})}.")) (|degreeSubResultantEuclidean| (((|Record| (|:| |coef1| |#2|) (|:| |coef2| |#2|) (|:| |subResultant| |#2|)) |#2| |#2| (|NonNegativeInteger|)) "\\axiom{indiceSubResultant(\\spad{P},{} \\spad{Q},{} \\spad{i})} returns a subresultant \\axiom{\\spad{S}} of degree \\axiom{\\spad{d}} and carries out the equality \\axiom{coef1*P + coef2*Q = S_i}.")) (|degreeSubResultant| ((|#2| |#2| |#2| (|NonNegativeInteger|)) "\\axiom{degreeSubResultant(\\spad{P},{} \\spad{Q},{} \\spad{d})} computes a subresultant of degree \\axiom{\\spad{d}}.")) (|semiIndiceSubResultantEuclidean| (((|Record| (|:| |coef2| |#2|) (|:| |subResultant| |#2|)) |#2| |#2| (|NonNegativeInteger|)) "\\axiom{semiIndiceSubResultantEuclidean(\\spad{P},{} \\spad{Q},{} \\spad{i})} returns the subresultant \\axiom{S_i(\\spad{P},{}\\spad{Q})} and carries out the equality \\axiom{...\\spad{P} + coef2*Q = S_i(\\spad{P},{}\\spad{Q})} Warning: \\axiom{degree(\\spad{P}) \\spad{>=} degree(\\spad{Q})}.")) (|indiceSubResultantEuclidean| (((|Record| (|:| |coef1| |#2|) (|:| |coef2| |#2|) (|:| |subResultant| |#2|)) |#2| |#2| (|NonNegativeInteger|)) "\\axiom{indiceSubResultant(\\spad{P},{} \\spad{Q},{} \\spad{i})} returns the subresultant \\axiom{S_i(\\spad{P},{}\\spad{Q})} and carries out the equality \\axiom{coef1*P + coef2*Q = S_i(\\spad{P},{}\\spad{Q})}")) (|indiceSubResultant| ((|#2| |#2| |#2| (|NonNegativeInteger|)) "\\axiom{indiceSubResultant(\\spad{P},{} \\spad{Q},{} \\spad{i})} returns the subresultant of indice \\axiom{\\spad{i}}")) (|semiResultantEuclidean1| (((|Record| (|:| |coef1| |#2|) (|:| |resultant| |#1|)) |#2| |#2|) "\\axiom{semiResultantEuclidean1(\\spad{P},{}\\spad{Q})} carries out the equality \\axiom{coef1.\\spad{P} + ? \\spad{Q} = resultant(\\spad{P},{}\\spad{Q})}.")) (|semiResultantEuclidean2| (((|Record| (|:| |coef2| |#2|) (|:| |resultant| |#1|)) |#2| |#2|) "\\axiom{semiResultantEuclidean2(\\spad{P},{}\\spad{Q})} carries out the equality \\axiom{...\\spad{P} + coef2*Q = resultant(\\spad{P},{}\\spad{Q})}. Warning: \\axiom{degree(\\spad{P}) \\spad{>=} degree(\\spad{Q})}.")) (|resultantEuclidean| (((|Record| (|:| |coef1| |#2|) (|:| |coef2| |#2|) (|:| |resultant| |#1|)) |#2| |#2|) "\\axiom{resultantEuclidean(\\spad{P},{}\\spad{Q})} carries out the equality \\axiom{coef1*P + coef2*Q = resultant(\\spad{P},{}\\spad{Q})}")) (|resultant| ((|#1| |#2| |#2|) "\\axiom{resultant(\\spad{P},{} \\spad{Q})} returns the resultant of \\axiom{\\spad{P}} and \\axiom{\\spad{Q}}"))) 
@@ -3538,7 +3538,7 @@ NIL
 ((|HasCategory| |#2| (QUOTE (-513)))) 
 (-902 R E |VarSet| P) 
 ((|constructor| (NIL "A category for finite subsets of a polynomial ring. Such a set is only regarded as a set of polynomials and not identified to the ideal it generates. So two distinct sets may generate the same the ideal. Furthermore,{} for \\spad{R} being an integral domain,{} a set of polynomials may be viewed as a representation of the ideal it generates in the polynomial ring \\spad{(R)^(-1) P},{} or the set of its zeros (described for instance by the radical of the previous ideal,{} or a split of the associated affine variety) and so on. So this category provides operations about those different notions.")) (|triangular?| (((|Boolean|) $) "\\axiom{triangular?(\\spad{ps})} returns \\spad{true} iff \\axiom{\\spad{ps}} is a triangular set,{} \\spadignore{i.e.} two distinct polynomials have distinct main variables and no constant lies in \\axiom{\\spad{ps}}.")) (|rewriteIdealWithRemainder| (((|List| |#4|) (|List| |#4|) $) "\\axiom{rewriteIdealWithRemainder(\\spad{lp},{}\\spad{cs})} returns \\axiom{\\spad{lr}} such that every polynomial in \\axiom{\\spad{lr}} is fully reduced in the sense of Groebner bases \\spad{w}.\\spad{r}.\\spad{t}. \\axiom{\\spad{cs}} and \\axiom{(\\spad{lp},{}\\spad{cs})} and \\axiom{(\\spad{lr},{}\\spad{cs})} generate the same ideal in \\axiom{(\\spad{R})^(\\spad{-1}) \\spad{P}}.")) (|rewriteIdealWithHeadRemainder| (((|List| |#4|) (|List| |#4|) $) "\\axiom{rewriteIdealWithHeadRemainder(\\spad{lp},{}\\spad{cs})} returns \\axiom{\\spad{lr}} such that the leading monomial of every polynomial in \\axiom{\\spad{lr}} is reduced in the sense of Groebner bases \\spad{w}.\\spad{r}.\\spad{t}. \\axiom{\\spad{cs}} and \\axiom{(\\spad{lp},{}\\spad{cs})} and \\axiom{(\\spad{lr},{}\\spad{cs})} generate the same ideal in \\axiom{(\\spad{R})^(\\spad{-1}) \\spad{P}}.")) (|remainder| (((|Record| (|:| |rnum| |#1|) (|:| |polnum| |#4|) (|:| |den| |#1|)) |#4| $) "\\axiom{remainder(a,{}\\spad{ps})} returns \\axiom{[\\spad{c},{}\\spad{b},{}\\spad{r}]} such that \\axiom{\\spad{b}} is fully reduced in the sense of Groebner bases \\spad{w}.\\spad{r}.\\spad{t}. \\axiom{\\spad{ps}},{} \\axiom{r*a - \\spad{c*b}} lies in the ideal generated by \\axiom{\\spad{ps}}. Furthermore,{} if \\axiom{\\spad{R}} is a \\spad{gcd}-domain,{} \\axiom{\\spad{b}} is primitive.")) (|headRemainder| (((|Record| (|:| |num| |#4|) (|:| |den| |#1|)) |#4| $) "\\axiom{headRemainder(a,{}\\spad{ps})} returns \\axiom{[\\spad{b},{}\\spad{r}]} such that the leading monomial of \\axiom{\\spad{b}} is reduced in the sense of Groebner bases \\spad{w}.\\spad{r}.\\spad{t}. \\axiom{\\spad{ps}} and \\axiom{r*a - \\spad{b}} lies in the ideal generated by \\axiom{\\spad{ps}}.")) (|roughUnitIdeal?| (((|Boolean|) $) "\\axiom{roughUnitIdeal?(\\spad{ps})} returns \\spad{true} iff \\axiom{\\spad{ps}} contains some non null element lying in the base ring \\axiom{\\spad{R}}.")) (|roughEqualIdeals?| (((|Boolean|) $ $) "\\axiom{roughEqualIdeals?(\\spad{ps1},{}\\spad{ps2})} returns \\spad{true} iff it can proved that \\axiom{\\spad{ps1}} and \\axiom{\\spad{ps2}} generate the same ideal in \\axiom{(\\spad{R})^(\\spad{-1}) \\spad{P}} without computing Groebner bases.")) (|roughSubIdeal?| (((|Boolean|) $ $) "\\axiom{roughSubIdeal?(\\spad{ps1},{}\\spad{ps2})} returns \\spad{true} iff it can proved that all polynomials in \\axiom{\\spad{ps1}} lie in the ideal generated by \\axiom{\\spad{ps2}} in \\axiom{\\axiom{(\\spad{R})^(\\spad{-1}) \\spad{P}}} without computing Groebner bases.")) (|roughBase?| (((|Boolean|) $) "\\axiom{roughBase?(\\spad{ps})} returns \\spad{true} iff for every pair \\axiom{{\\spad{p},{}\\spad{q}}} of polynomials in \\axiom{\\spad{ps}} their leading monomials are relatively prime.")) (|trivialIdeal?| (((|Boolean|) $) "\\axiom{trivialIdeal?(\\spad{ps})} returns \\spad{true} iff \\axiom{\\spad{ps}} does not contain non-zero elements.")) (|sort| (((|Record| (|:| |under| $) (|:| |floor| $) (|:| |upper| $)) $ |#3|) "\\axiom{sort(\\spad{v},{}\\spad{ps})} returns \\axiom{us,{}\\spad{vs},{}\\spad{ws}} such that \\axiom{us} is \\axiom{collectUnder(\\spad{ps},{}\\spad{v})},{} \\axiom{\\spad{vs}} is \\axiom{collect(\\spad{ps},{}\\spad{v})} and \\axiom{\\spad{ws}} is \\axiom{collectUpper(\\spad{ps},{}\\spad{v})}.")) (|collectUpper| (($ $ |#3|) "\\axiom{collectUpper(\\spad{ps},{}\\spad{v})} returns the set consisting of the polynomials of \\axiom{\\spad{ps}} with main variable greater than \\axiom{\\spad{v}}.")) (|collect| (($ $ |#3|) "\\axiom{collect(\\spad{ps},{}\\spad{v})} returns the set consisting of the polynomials of \\axiom{\\spad{ps}} with \\axiom{\\spad{v}} as main variable.")) (|collectUnder| (($ $ |#3|) "\\axiom{collectUnder(\\spad{ps},{}\\spad{v})} returns the set consisting of the polynomials of \\axiom{\\spad{ps}} with main variable less than \\axiom{\\spad{v}}.")) (|mainVariable?| (((|Boolean|) |#3| $) "\\axiom{mainVariable?(\\spad{v},{}\\spad{ps})} returns \\spad{true} iff \\axiom{\\spad{v}} is the main variable of some polynomial in \\axiom{\\spad{ps}}.")) (|mainVariables| (((|List| |#3|) $) "\\axiom{mainVariables(\\spad{ps})} returns the decreasingly sorted list of the variables which are main variables of some polynomial in \\axiom{\\spad{ps}}.")) (|variables| (((|List| |#3|) $) "\\axiom{variables(\\spad{ps})} returns the decreasingly sorted list of the variables which are variables of some polynomial in \\axiom{\\spad{ps}}.")) (|mvar| ((|#3| $) "\\axiom{mvar(\\spad{ps})} returns the main variable of the non constant polynomial with the greatest main variable,{} if any,{} else an error is returned.")) (|retract| (($ (|List| |#4|)) "\\axiom{retract(\\spad{lp})} returns an element of the domain whose elements are the members of \\axiom{\\spad{lp}} if such an element exists,{} otherwise an error is produced.")) (|retractIfCan| (((|Union| $ "failed") (|List| |#4|)) "\\axiom{retractIfCan(\\spad{lp})} returns an element of the domain whose elements are the members of \\axiom{\\spad{lp}} if such an element exists,{} otherwise \\axiom{\"failed\"} is returned."))) 
-((-4233 . T) (-2046 . T)) 
+((-4233 . T) (-2092 . T)) 
 NIL 
 (-903 R E V P) 
 ((|constructor| (NIL "This package provides modest routines for polynomial system solving. The aim of many of the operations of this package is to remove certain factors in some polynomials in order to avoid unnecessary computations in algorithms involving splitting techniques by partial factorization.")) (|removeIrreducibleRedundantFactors| (((|List| |#4|) (|List| |#4|) (|List| |#4|)) "\\axiom{removeIrreducibleRedundantFactors(\\spad{lp},{}\\spad{lq})} returns the same as \\axiom{irreducibleFactors(concat(\\spad{lp},{}\\spad{lq}))} assuming that \\axiom{irreducibleFactors(\\spad{lp})} returns \\axiom{\\spad{lp}} up to replacing some polynomial \\axiom{\\spad{pj}} in \\axiom{\\spad{lp}} by some polynomial \\axiom{\\spad{qj}} associated to \\axiom{\\spad{pj}}.")) (|lazyIrreducibleFactors| (((|List| |#4|) (|List| |#4|)) "\\axiom{lazyIrreducibleFactors(\\spad{lp})} returns \\axiom{\\spad{lf}} such that if \\axiom{\\spad{lp} = [\\spad{p1},{}...,{}\\spad{pn}]} and \\axiom{\\spad{lf} = [\\spad{f1},{}...,{}\\spad{fm}]} then \\axiom{p1*p2*...*pn=0} means \\axiom{f1*f2*...*fm=0},{} and the \\axiom{\\spad{fi}} are irreducible over \\axiom{\\spad{R}} and are pairwise distinct. The algorithm tries to avoid factorization into irreducible factors as far as possible and makes previously use of \\spad{gcd} techniques over \\axiom{\\spad{R}}.")) (|irreducibleFactors| (((|List| |#4|) (|List| |#4|)) "\\axiom{irreducibleFactors(\\spad{lp})} returns \\axiom{\\spad{lf}} such that if \\axiom{\\spad{lp} = [\\spad{p1},{}...,{}\\spad{pn}]} and \\axiom{\\spad{lf} = [\\spad{f1},{}...,{}\\spad{fm}]} then \\axiom{p1*p2*...*pn=0} means \\axiom{f1*f2*...*fm=0},{} and the \\axiom{\\spad{fi}} are irreducible over \\axiom{\\spad{R}} and are pairwise distinct.")) (|removeRedundantFactorsInPols| (((|List| |#4|) (|List| |#4|) (|List| |#4|)) "\\axiom{removeRedundantFactorsInPols(\\spad{lp},{}\\spad{lf})} returns \\axiom{newlp} where \\axiom{newlp} is obtained from \\axiom{\\spad{lp}} by removing in every polynomial \\axiom{\\spad{p}} of \\axiom{\\spad{lp}} any non trivial factor of any polynomial \\axiom{\\spad{f}} in \\axiom{\\spad{lf}}. Moreover,{} squares over \\axiom{\\spad{R}} are first removed in every polynomial \\axiom{\\spad{lp}}.")) (|removeRedundantFactorsInContents| (((|List| |#4|) (|List| |#4|) (|List| |#4|)) "\\axiom{removeRedundantFactorsInContents(\\spad{lp},{}\\spad{lf})} returns \\axiom{newlp} where \\axiom{newlp} is obtained from \\axiom{\\spad{lp}} by removing in the content of every polynomial of \\axiom{\\spad{lp}} any non trivial factor of any polynomial \\axiom{\\spad{f}} in \\axiom{\\spad{lf}}. Moreover,{} squares over \\axiom{\\spad{R}} are first removed in the content of every polynomial of \\axiom{\\spad{lp}}.")) (|removeRoughlyRedundantFactorsInContents| (((|List| |#4|) (|List| |#4|) (|List| |#4|)) "\\axiom{removeRoughlyRedundantFactorsInContents(\\spad{lp},{}\\spad{lf})} returns \\axiom{newlp}where \\axiom{newlp} is obtained from \\axiom{\\spad{lp}} by removing in the content of every polynomial of \\axiom{\\spad{lp}} any occurence of a polynomial \\axiom{\\spad{f}} in \\axiom{\\spad{lf}}. Moreover,{} squares over \\axiom{\\spad{R}} are first removed in the content of every polynomial of \\axiom{\\spad{lp}}.")) (|univariatePolynomialsGcds| (((|List| |#4|) (|List| |#4|) (|Boolean|)) "\\axiom{univariatePolynomialsGcds(\\spad{lp},{}opt)} returns the same as \\axiom{univariatePolynomialsGcds(\\spad{lp})} if \\axiom{opt} is \\axiom{\\spad{false}} and if the previous operation does not return any non null and constant polynomial,{} else return \\axiom{[1]}.") (((|List| |#4|) (|List| |#4|)) "\\axiom{univariatePolynomialsGcds(\\spad{lp})} returns \\axiom{\\spad{lg}} where \\axiom{\\spad{lg}} is a list of the gcds of every pair in \\axiom{\\spad{lp}} of univariate polynomials in the same main variable.")) (|squareFreeFactors| (((|List| |#4|) |#4|) "\\axiom{squareFreeFactors(\\spad{p})} returns the square-free factors of \\axiom{\\spad{p}} over \\axiom{\\spad{R}}")) (|rewriteIdealWithQuasiMonicGenerators| (((|List| |#4|) (|List| |#4|) (|Mapping| (|Boolean|) |#4| |#4|) (|Mapping| |#4| |#4| |#4|)) "\\axiom{rewriteIdealWithQuasiMonicGenerators(\\spad{lp},{}redOp?,{}redOp)} returns \\axiom{\\spad{lq}} where \\axiom{\\spad{lq}} and \\axiom{\\spad{lp}} generate the same ideal in \\axiom{\\spad{R^}(\\spad{-1}) \\spad{P}} and \\axiom{\\spad{lq}} has rank not higher than the one of \\axiom{\\spad{lp}}. Moreover,{} \\axiom{\\spad{lq}} is computed by reducing \\axiom{\\spad{lp}} \\spad{w}.\\spad{r}.\\spad{t}. some basic set of the ideal generated by the quasi-monic polynomials in \\axiom{\\spad{lp}}.")) (|rewriteSetByReducingWithParticularGenerators| (((|List| |#4|) (|List| |#4|) (|Mapping| (|Boolean|) |#4|) (|Mapping| (|Boolean|) |#4| |#4|) (|Mapping| |#4| |#4| |#4|)) "\\axiom{rewriteSetByReducingWithParticularGenerators(\\spad{lp},{}pred?,{}redOp?,{}redOp)} returns \\axiom{\\spad{lq}} where \\axiom{\\spad{lq}} is computed by the following algorithm. Chose a basic set \\spad{w}.\\spad{r}.\\spad{t}. the reduction-test \\axiom{redOp?} among the polynomials satisfying property \\axiom{pred?},{} if it is empty then leave,{} else reduce the other polynomials by this basic set \\spad{w}.\\spad{r}.\\spad{t}. the reduction-operation \\axiom{redOp}. Repeat while another basic set with smaller rank can be computed. See code. If \\axiom{pred?} is \\axiom{quasiMonic?} the ideal is unchanged.")) (|crushedSet| (((|List| |#4|) (|List| |#4|)) "\\axiom{crushedSet(\\spad{lp})} returns \\axiom{\\spad{lq}} such that \\axiom{\\spad{lp}} and and \\axiom{\\spad{lq}} generate the same ideal and no rough basic sets reduce (in the sense of Groebner bases) the other polynomials in \\axiom{\\spad{lq}}.")) (|roughBasicSet| (((|Union| (|Record| (|:| |bas| (|GeneralTriangularSet| |#1| |#2| |#3| |#4|)) (|:| |top| (|List| |#4|))) "failed") (|List| |#4|)) "\\axiom{roughBasicSet(\\spad{lp})} returns the smallest (with Ritt-Wu ordering) triangular set contained in \\axiom{\\spad{lp}}.")) (|interReduce| (((|List| |#4|) (|List| |#4|)) "\\axiom{interReduce(\\spad{lp})} returns \\axiom{\\spad{lq}} such that \\axiom{\\spad{lp}} and \\axiom{\\spad{lq}} generate the same ideal and no polynomial in \\axiom{\\spad{lq}} is reducuble by the others in the sense of Groebner bases. Since no assumptions are required the result may depend on the ordering the reductions are performed.")) (|removeRoughlyRedundantFactorsInPol| ((|#4| |#4| (|List| |#4|)) "\\axiom{removeRoughlyRedundantFactorsInPol(\\spad{p},{}\\spad{lf})} returns the same as removeRoughlyRedundantFactorsInPols([\\spad{p}],{}\\spad{lf},{}\\spad{true})")) (|removeRoughlyRedundantFactorsInPols| (((|List| |#4|) (|List| |#4|) (|List| |#4|) (|Boolean|)) "\\axiom{removeRoughlyRedundantFactorsInPols(\\spad{lp},{}\\spad{lf},{}opt)} returns the same as \\axiom{removeRoughlyRedundantFactorsInPols(\\spad{lp},{}\\spad{lf})} if \\axiom{opt} is \\axiom{\\spad{false}} and if the previous operation does not return any non null and constant polynomial,{} else return \\axiom{[1]}.") (((|List| |#4|) (|List| |#4|) (|List| |#4|)) "\\axiom{removeRoughlyRedundantFactorsInPols(\\spad{lp},{}\\spad{lf})} returns \\axiom{newlp}where \\axiom{newlp} is obtained from \\axiom{\\spad{lp}} by removing in every polynomial \\axiom{\\spad{p}} of \\axiom{\\spad{lp}} any occurence of a polynomial \\axiom{\\spad{f}} in \\axiom{\\spad{lf}}. This may involve a lot of exact-quotients computations.")) (|bivariatePolynomials| (((|Record| (|:| |goodPols| (|List| |#4|)) (|:| |badPols| (|List| |#4|))) (|List| |#4|)) "\\axiom{bivariatePolynomials(\\spad{lp})} returns \\axiom{\\spad{bps},{}nbps} where \\axiom{\\spad{bps}} is a list of the bivariate polynomials,{} and \\axiom{nbps} are the other ones.")) (|bivariate?| (((|Boolean|) |#4|) "\\axiom{bivariate?(\\spad{p})} returns \\spad{true} iff \\axiom{\\spad{p}} involves two and only two variables.")) (|linearPolynomials| (((|Record| (|:| |goodPols| (|List| |#4|)) (|:| |badPols| (|List| |#4|))) (|List| |#4|)) "\\axiom{linearPolynomials(\\spad{lp})} returns \\axiom{\\spad{lps},{}nlps} where \\axiom{\\spad{lps}} is a list of the linear polynomials in \\spad{lp},{} and \\axiom{nlps} are the other ones.")) (|linear?| (((|Boolean|) |#4|) "\\axiom{linear?(\\spad{p})} returns \\spad{true} iff \\axiom{\\spad{p}} does not lie in the base ring \\axiom{\\spad{R}} and has main degree \\axiom{1}.")) (|univariatePolynomials| (((|Record| (|:| |goodPols| (|List| |#4|)) (|:| |badPols| (|List| |#4|))) (|List| |#4|)) "\\axiom{univariatePolynomials(\\spad{lp})} returns \\axiom{ups,{}nups} where \\axiom{ups} is a list of the univariate polynomials,{} and \\axiom{nups} are the other ones.")) (|univariate?| (((|Boolean|) |#4|) "\\axiom{univariate?(\\spad{p})} returns \\spad{true} iff \\axiom{\\spad{p}} involves one and only one variable.")) (|quasiMonicPolynomials| (((|Record| (|:| |goodPols| (|List| |#4|)) (|:| |badPols| (|List| |#4|))) (|List| |#4|)) "\\axiom{quasiMonicPolynomials(\\spad{lp})} returns \\axiom{qmps,{}nqmps} where \\axiom{qmps} is a list of the quasi-monic polynomials in \\axiom{\\spad{lp}} and \\axiom{nqmps} are the other ones.")) (|selectAndPolynomials| (((|Record| (|:| |goodPols| (|List| |#4|)) (|:| |badPols| (|List| |#4|))) (|List| (|Mapping| (|Boolean|) |#4|)) (|List| |#4|)) "\\axiom{selectAndPolynomials(lpred?,{}\\spad{ps})} returns \\axiom{\\spad{gps},{}\\spad{bps}} where \\axiom{\\spad{gps}} is a list of the polynomial \\axiom{\\spad{p}} in \\axiom{\\spad{ps}} such that \\axiom{pred?(\\spad{p})} holds for every \\axiom{pred?} in \\axiom{lpred?} and \\axiom{\\spad{bps}} are the other ones.")) (|selectOrPolynomials| (((|Record| (|:| |goodPols| (|List| |#4|)) (|:| |badPols| (|List| |#4|))) (|List| (|Mapping| (|Boolean|) |#4|)) (|List| |#4|)) "\\axiom{selectOrPolynomials(lpred?,{}\\spad{ps})} returns \\axiom{\\spad{gps},{}\\spad{bps}} where \\axiom{\\spad{gps}} is a list of the polynomial \\axiom{\\spad{p}} in \\axiom{\\spad{ps}} such that \\axiom{pred?(\\spad{p})} holds for some \\axiom{pred?} in \\axiom{lpred?} and \\axiom{\\spad{bps}} are the other ones.")) (|selectPolynomials| (((|Record| (|:| |goodPols| (|List| |#4|)) (|:| |badPols| (|List| |#4|))) (|Mapping| (|Boolean|) |#4|) (|List| |#4|)) "\\axiom{selectPolynomials(pred?,{}\\spad{ps})} returns \\axiom{\\spad{gps},{}\\spad{bps}} where \\axiom{\\spad{gps}} is a list of the polynomial \\axiom{\\spad{p}} in \\axiom{\\spad{ps}} such that \\axiom{pred?(\\spad{p})} holds and \\axiom{\\spad{bps}} are the other ones.")) (|probablyZeroDim?| (((|Boolean|) (|List| |#4|)) "\\axiom{probablyZeroDim?(\\spad{lp})} returns \\spad{true} iff the number of polynomials in \\axiom{\\spad{lp}} is not smaller than the number of variables occurring in these polynomials.")) (|possiblyNewVariety?| (((|Boolean|) (|List| |#4|) (|List| (|List| |#4|))) "\\axiom{possiblyNewVariety?(newlp,{}\\spad{llp})} returns \\spad{true} iff for every \\axiom{\\spad{lp}} in \\axiom{\\spad{llp}} certainlySubVariety?(newlp,{}\\spad{lp}) does not hold.")) (|certainlySubVariety?| (((|Boolean|) (|List| |#4|) (|List| |#4|)) "\\axiom{certainlySubVariety?(newlp,{}\\spad{lp})} returns \\spad{true} iff for every \\axiom{\\spad{p}} in \\axiom{\\spad{lp}} the remainder of \\axiom{\\spad{p}} by \\axiom{newlp} using the division algorithm of Groebner techniques is zero.")) (|unprotectedRemoveRedundantFactors| (((|List| |#4|) |#4| |#4|) "\\axiom{unprotectedRemoveRedundantFactors(\\spad{p},{}\\spad{q})} returns the same as \\axiom{removeRedundantFactors(\\spad{p},{}\\spad{q})} but does assume that neither \\axiom{\\spad{p}} nor \\axiom{\\spad{q}} lie in the base ring \\axiom{\\spad{R}} and assumes that \\axiom{infRittWu?(\\spad{p},{}\\spad{q})} holds. Moreover,{} if \\axiom{\\spad{R}} is \\spad{gcd}-domain,{} then \\axiom{\\spad{p}} and \\axiom{\\spad{q}} are assumed to be square free.")) (|removeSquaresIfCan| (((|List| |#4|) (|List| |#4|)) "\\axiom{removeSquaresIfCan(\\spad{lp})} returns \\axiom{removeDuplicates [squareFreePart(\\spad{p})\\$\\spad{P} for \\spad{p} in \\spad{lp}]} if \\axiom{\\spad{R}} is \\spad{gcd}-domain else returns \\axiom{\\spad{lp}}.")) (|removeRedundantFactors| (((|List| |#4|) (|List| |#4|) (|List| |#4|) (|Mapping| (|List| |#4|) (|List| |#4|))) "\\axiom{removeRedundantFactors(\\spad{lp},{}\\spad{lq},{}remOp)} returns the same as \\axiom{concat(remOp(removeRoughlyRedundantFactorsInPols(\\spad{lp},{}\\spad{lq})),{}\\spad{lq})} assuming that \\axiom{remOp(\\spad{lq})} returns \\axiom{\\spad{lq}} up to similarity.") (((|List| |#4|) (|List| |#4|) (|List| |#4|)) "\\axiom{removeRedundantFactors(\\spad{lp},{}\\spad{lq})} returns the same as \\axiom{removeRedundantFactors(concat(\\spad{lp},{}\\spad{lq}))} assuming that \\axiom{removeRedundantFactors(\\spad{lp})} returns \\axiom{\\spad{lp}} up to replacing some polynomial \\axiom{\\spad{pj}} in \\axiom{\\spad{lp}} by some polynomial \\axiom{\\spad{qj}} associated to \\axiom{\\spad{pj}}.") (((|List| |#4|) (|List| |#4|) |#4|) "\\axiom{removeRedundantFactors(\\spad{lp},{}\\spad{q})} returns the same as \\axiom{removeRedundantFactors(cons(\\spad{q},{}\\spad{lp}))} assuming that \\axiom{removeRedundantFactors(\\spad{lp})} returns \\axiom{\\spad{lp}} up to replacing some polynomial \\axiom{\\spad{pj}} in \\axiom{\\spad{lp}} by some some polynomial \\axiom{\\spad{qj}} associated to \\axiom{\\spad{pj}}.") (((|List| |#4|) |#4| |#4|) "\\axiom{removeRedundantFactors(\\spad{p},{}\\spad{q})} returns the same as \\axiom{removeRedundantFactors([\\spad{p},{}\\spad{q}])}") (((|List| |#4|) (|List| |#4|)) "\\axiom{removeRedundantFactors(\\spad{lp})} returns \\axiom{\\spad{lq}} such that if \\axiom{\\spad{lp} = [\\spad{p1},{}...,{}\\spad{pn}]} and \\axiom{\\spad{lq} = [\\spad{q1},{}...,{}\\spad{qm}]} then the product \\axiom{p1*p2*...\\spad{*pn}} vanishes iff the product \\axiom{q1*q2*...\\spad{*qm}} vanishes,{} and the product of degrees of the \\axiom{\\spad{qi}} is not greater than the one of the \\axiom{\\spad{pj}},{} and no polynomial in \\axiom{\\spad{lq}} divides another polynomial in \\axiom{\\spad{lq}}. In particular,{} polynomials lying in the base ring \\axiom{\\spad{R}} are removed. Moreover,{} \\axiom{\\spad{lq}} is sorted \\spad{w}.\\spad{r}.\\spad{t} \\axiom{infRittWu?}. Furthermore,{} if \\spad{R} is \\spad{gcd}-domain,{} the polynomials in \\axiom{\\spad{lq}} are pairwise without common non trivial factor."))) 
@@ -3554,7 +3554,7 @@ NIL
 NIL 
 (-906 R) 
 ((|constructor| (NIL "PointCategory is the category of points in space which may be plotted via the graphics facilities. Functions are provided for defining points and handling elements of points.")) (|extend| (($ $ (|List| |#1|)) "\\spad{extend(x,{}l,{}r)} \\undocumented")) (|cross| (($ $ $) "\\spad{cross(p,{}q)} computes the cross product of the two points \\spad{p} and \\spad{q}. Error if the \\spad{p} and \\spad{q} are not 3 dimensional")) (|convert| (($ (|List| |#1|)) "\\spad{convert(l)} takes a list of elements,{} \\spad{l},{} from the domain Ring and returns the form of point category.")) (|dimension| (((|PositiveInteger|) $) "\\spad{dimension(s)} returns the dimension of the point category \\spad{s}.")) (|point| (($ (|List| |#1|)) "\\spad{point(l)} returns a point category defined by a list \\spad{l} of elements from the domain \\spad{R}."))) 
-((-4234 . T) (-4233 . T) (-2046 . T)) 
+((-4234 . T) (-4233 . T) (-2092 . T)) 
 NIL 
 (-907 R1 R2) 
 ((|constructor| (NIL "This package \\undocumented")) (|map| (((|Point| |#2|) (|Mapping| |#2| |#1|) (|Point| |#1|)) "\\spad{map(f,{}p)} \\undocumented"))) 
@@ -3599,10 +3599,10 @@ NIL
 (-917 A S) 
 ((|constructor| (NIL "QuotientField(\\spad{S}) is the category of fractions of an Integral Domain \\spad{S}.")) (|floor| ((|#2| $) "\\spad{floor(x)} returns the largest integral element below \\spad{x}.")) (|ceiling| ((|#2| $) "\\spad{ceiling(x)} returns the smallest integral element above \\spad{x}.")) (|random| (($) "\\spad{random()} returns a random fraction.")) (|fractionPart| (($ $) "\\spad{fractionPart(x)} returns the fractional part of \\spad{x}. \\spad{x} = wholePart(\\spad{x}) + fractionPart(\\spad{x})")) (|wholePart| ((|#2| $) "\\spad{wholePart(x)} returns the whole part of the fraction \\spad{x} \\spadignore{i.e.} the truncated quotient of the numerator by the denominator.")) (|denominator| (($ $) "\\spad{denominator(x)} is the denominator of the fraction \\spad{x} converted to \\%.")) (|numerator| (($ $) "\\spad{numerator(x)} is the numerator of the fraction \\spad{x} converted to \\%.")) (|denom| ((|#2| $) "\\spad{denom(x)} returns the denominator of the fraction \\spad{x}.")) (|numer| ((|#2| $) "\\spad{numer(x)} returns the numerator of the fraction \\spad{x}.")) (/ (($ |#2| |#2|) "\\spad{d1 / d2} returns the fraction \\spad{d1} divided by \\spad{d2}."))) 
 NIL 
-((|HasCategory| |#2| (QUOTE (-838))) (|HasCategory| |#2| (QUOTE (-506))) (|HasCategory| |#2| (QUOTE (-282))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-135))) (|HasCategory| |#2| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#2| (QUOTE (-946))) (|HasCategory| |#2| (QUOTE (-757))) (|HasCategory| |#2| (QUOTE (-784))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#2| (QUOTE (-1060)))) 
+((|HasCategory| |#2| (QUOTE (-837))) (|HasCategory| |#2| (QUOTE (-506))) (|HasCategory| |#2| (QUOTE (-282))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-135))) (|HasCategory| |#2| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#2| (QUOTE (-946))) (|HasCategory| |#2| (QUOTE (-756))) (|HasCategory| |#2| (QUOTE (-783))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#2| (QUOTE (-1060)))) 
 (-918 S) 
 ((|constructor| (NIL "QuotientField(\\spad{S}) is the category of fractions of an Integral Domain \\spad{S}.")) (|floor| ((|#1| $) "\\spad{floor(x)} returns the largest integral element below \\spad{x}.")) (|ceiling| ((|#1| $) "\\spad{ceiling(x)} returns the smallest integral element above \\spad{x}.")) (|random| (($) "\\spad{random()} returns a random fraction.")) (|fractionPart| (($ $) "\\spad{fractionPart(x)} returns the fractional part of \\spad{x}. \\spad{x} = wholePart(\\spad{x}) + fractionPart(\\spad{x})")) (|wholePart| ((|#1| $) "\\spad{wholePart(x)} returns the whole part of the fraction \\spad{x} \\spadignore{i.e.} the truncated quotient of the numerator by the denominator.")) (|denominator| (($ $) "\\spad{denominator(x)} is the denominator of the fraction \\spad{x} converted to \\%.")) (|numerator| (($ $) "\\spad{numerator(x)} is the numerator of the fraction \\spad{x} converted to \\%.")) (|denom| ((|#1| $) "\\spad{denom(x)} returns the denominator of the fraction \\spad{x}.")) (|numer| ((|#1| $) "\\spad{numer(x)} returns the numerator of the fraction \\spad{x}.")) (/ (($ |#1| |#1|) "\\spad{d1 / d2} returns the fraction \\spad{d1} divided by \\spad{d2}."))) 
-((-2046 . T) (-4225 . T) (-4231 . T) (-4226 . T) ((-4235 "*") . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
+((-2092 . T) (-4225 . T) (-4231 . T) (-4226 . T) ((-4235 "*") . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
 NIL 
 (-919 |n| K) 
 ((|constructor| (NIL "This domain provides modest support for quadratic forms.")) (|elt| ((|#2| $ (|DirectProduct| |#1| |#2|)) "\\spad{elt(qf,{}v)} evaluates the quadratic form \\spad{qf} on the vector \\spad{v},{} producing a scalar.")) (|matrix| (((|SquareMatrix| |#1| |#2|) $) "\\spad{matrix(qf)} creates a square matrix from the quadratic form \\spad{qf}.")) (|quadraticForm| (($ (|SquareMatrix| |#1| |#2|)) "\\spad{quadraticForm(m)} creates a quadratic form from a symmetric,{} square matrix \\spad{m}."))) 
@@ -3610,12 +3610,12 @@ NIL
 NIL 
 (-920 S) 
 ((|constructor| (NIL "A queue is a bag where the first item inserted is the first item extracted.")) (|back| ((|#1| $) "\\spad{back(q)} returns the element at the back of the queue. The queue \\spad{q} is unchanged by this operation. Error: if \\spad{q} is empty.")) (|front| ((|#1| $) "\\spad{front(q)} returns the element at the front of the queue. The queue \\spad{q} is unchanged by this operation. Error: if \\spad{q} is empty.")) (|length| (((|NonNegativeInteger|) $) "\\spad{length(q)} returns the number of elements in the queue. Note: \\axiom{length(\\spad{q}) = \\spad{#q}}.")) (|rotate!| (($ $) "\\spad{rotate! q} rotates queue \\spad{q} so that the element at the front of the queue goes to the back of the queue. Note: rotate! \\spad{q} is equivalent to enqueue!(dequeue!(\\spad{q})).")) (|dequeue!| ((|#1| $) "\\spad{dequeue! s} destructively extracts the first (top) element from queue \\spad{q}. The element previously second in the queue becomes the first element. Error: if \\spad{q} is empty.")) (|enqueue!| ((|#1| |#1| $) "\\spad{enqueue!(x,{}q)} inserts \\spad{x} into the queue \\spad{q} at the back end."))) 
-((-4233 . T) (-4234 . T) (-2046 . T)) 
+((-4233 . T) (-4234 . T) (-2092 . T)) 
 NIL 
 (-921 S R) 
 ((|constructor| (NIL "\\spadtype{QuaternionCategory} describes the category of quaternions and implements functions that are not representation specific.")) (|rationalIfCan| (((|Union| (|Fraction| (|Integer|)) "failed") $) "\\spad{rationalIfCan(q)} returns \\spad{q} as a rational number,{} or \"failed\" if this is not possible. Note: if \\spad{rational?(q)} is \\spad{true},{} the conversion can be done and the rational number will be returned.")) (|rational| (((|Fraction| (|Integer|)) $) "\\spad{rational(q)} tries to convert \\spad{q} into a rational number. Error: if this is not possible. If \\spad{rational?(q)} is \\spad{true},{} the conversion will be done and the rational number returned.")) (|rational?| (((|Boolean|) $) "\\spad{rational?(q)} returns {\\it \\spad{true}} if all the imaginary parts of \\spad{q} are zero and the real part can be converted into a rational number,{} and {\\it \\spad{false}} otherwise.")) (|abs| ((|#2| $) "\\spad{abs(q)} computes the absolute value of quaternion \\spad{q} (sqrt of norm).")) (|real| ((|#2| $) "\\spad{real(q)} extracts the real part of quaternion \\spad{q}.")) (|quatern| (($ |#2| |#2| |#2| |#2|) "\\spad{quatern(r,{}i,{}j,{}k)} constructs a quaternion from scalars.")) (|norm| ((|#2| $) "\\spad{norm(q)} computes the norm of \\spad{q} (the sum of the squares of the components).")) (|imagK| ((|#2| $) "\\spad{imagK(q)} extracts the imaginary \\spad{k} part of quaternion \\spad{q}.")) (|imagJ| ((|#2| $) "\\spad{imagJ(q)} extracts the imaginary \\spad{j} part of quaternion \\spad{q}.")) (|imagI| ((|#2| $) "\\spad{imagI(q)} extracts the imaginary \\spad{i} part of quaternion \\spad{q}.")) (|conjugate| (($ $) "\\spad{conjugate(q)} negates the imaginary parts of quaternion \\spad{q}."))) 
 NIL 
-((|HasCategory| |#2| (QUOTE (-506))) (|HasCategory| |#2| (QUOTE (-979))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-135))) (|HasCategory| |#2| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-784))) (|HasCategory| |#2| (QUOTE (-265)))) 
+((|HasCategory| |#2| (QUOTE (-506))) (|HasCategory| |#2| (QUOTE (-979))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-135))) (|HasCategory| |#2| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-783))) (|HasCategory| |#2| (QUOTE (-265)))) 
 (-922 R) 
 ((|constructor| (NIL "\\spadtype{QuaternionCategory} describes the category of quaternions and implements functions that are not representation specific.")) (|rationalIfCan| (((|Union| (|Fraction| (|Integer|)) "failed") $) "\\spad{rationalIfCan(q)} returns \\spad{q} as a rational number,{} or \"failed\" if this is not possible. Note: if \\spad{rational?(q)} is \\spad{true},{} the conversion can be done and the rational number will be returned.")) (|rational| (((|Fraction| (|Integer|)) $) "\\spad{rational(q)} tries to convert \\spad{q} into a rational number. Error: if this is not possible. If \\spad{rational?(q)} is \\spad{true},{} the conversion will be done and the rational number returned.")) (|rational?| (((|Boolean|) $) "\\spad{rational?(q)} returns {\\it \\spad{true}} if all the imaginary parts of \\spad{q} are zero and the real part can be converted into a rational number,{} and {\\it \\spad{false}} otherwise.")) (|abs| ((|#1| $) "\\spad{abs(q)} computes the absolute value of quaternion \\spad{q} (sqrt of norm).")) (|real| ((|#1| $) "\\spad{real(q)} extracts the real part of quaternion \\spad{q}.")) (|quatern| (($ |#1| |#1| |#1| |#1|) "\\spad{quatern(r,{}i,{}j,{}k)} constructs a quaternion from scalars.")) (|norm| ((|#1| $) "\\spad{norm(q)} computes the norm of \\spad{q} (the sum of the squares of the components).")) (|imagK| ((|#1| $) "\\spad{imagK(q)} extracts the imaginary \\spad{k} part of quaternion \\spad{q}.")) (|imagJ| ((|#1| $) "\\spad{imagJ(q)} extracts the imaginary \\spad{j} part of quaternion \\spad{q}.")) (|imagI| ((|#1| $) "\\spad{imagI(q)} extracts the imaginary \\spad{i} part of quaternion \\spad{q}.")) (|conjugate| (($ $) "\\spad{conjugate(q)} negates the imaginary parts of quaternion \\spad{q}."))) 
 ((-4226 |has| |#1| (-265)) (-4227 . T) (-4228 . T) (-4230 . T)) 
@@ -3627,11 +3627,11 @@ NIL
 (-924 R) 
 ((|constructor| (NIL "\\spadtype{Quaternion} implements quaternions over a \\indented{2}{commutative ring. The main constructor function is \\spadfun{quatern}} \\indented{2}{which takes 4 arguments: the real part,{} the \\spad{i} imaginary part,{} the \\spad{j}} \\indented{2}{imaginary part and the \\spad{k} imaginary part.}"))) 
 ((-4226 |has| |#1| (-265)) (-4227 . T) (-4228 . T) (-4230 . T)) 
-((|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-265))) (-3703 (|HasCategory| |#1| (QUOTE (-265))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| |#1| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#1| (LIST (QUOTE -482) (QUOTE (-1084)) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -261) (|devaluate| |#1|) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-210))) (|HasCategory| |#1| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-979))) (|HasCategory| |#1| (QUOTE (-506))) (-3703 (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-337))))) 
+((|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-265))) (-3703 (|HasCategory| |#1| (QUOTE (-265))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#1| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#1| (LIST (QUOTE -482) (QUOTE (-1084)) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -261) (|devaluate| |#1|) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-210))) (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-979))) (|HasCategory| |#1| (QUOTE (-506))) (-3703 (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-337))))) 
 (-925 S) 
 ((|constructor| (NIL "Linked List implementation of a Queue")) (|queue| (($ (|List| |#1|)) "\\spad{queue([x,{}y,{}...,{}z])} creates a queue with first (top) element \\spad{x},{} second element \\spad{y},{}...,{}and last (bottom) element \\spad{z}."))) 
 ((-4233 . T) (-4234 . T)) 
-((|HasCategory| |#1| (QUOTE (-1013))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))))) 
+((|HasCategory| |#1| (QUOTE (-1013))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))))) 
 (-926 S) 
 ((|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 
@@ -3643,11 +3643,11 @@ NIL
 (-928 -4049 UP UPUP |radicnd| |n|) 
 ((|constructor| (NIL "Function field defined by y**n = \\spad{f}(\\spad{x})."))) 
 ((-4226 |has| (-381 |#2|) (-337)) (-4231 |has| (-381 |#2|) (-337)) (-4225 |has| (-381 |#2|) (-337)) ((-4235 "*") . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
-((|HasCategory| (-381 |#2|) (QUOTE (-133))) (|HasCategory| (-381 |#2|) (QUOTE (-135))) (|HasCategory| (-381 |#2|) (QUOTE (-323))) (|HasCategory| (-381 |#2|) (QUOTE (-337))) (-3703 (|HasCategory| (-381 |#2|) (QUOTE (-337))) (|HasCategory| (-381 |#2|) (QUOTE (-323)))) (|HasCategory| (-381 |#2|) (QUOTE (-342))) (|HasCategory| (-381 |#2|) (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| (-381 |#2|) (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| (-381 |#2|) (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-342))) (-3703 (|HasCategory| (-381 |#2|) (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| (-381 |#2|) (QUOTE (-337)))) (-12 (|HasCategory| (-381 |#2|) (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| (-381 |#2|) (QUOTE (-337)))) (-3703 (-12 (|HasCategory| (-381 |#2|) (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| (-381 |#2|) (QUOTE (-337)))) (-12 (|HasCategory| (-381 |#2|) (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| (-381 |#2|) (QUOTE (-323))))) (-12 (|HasCategory| (-381 |#2|) (QUOTE (-210))) (|HasCategory| (-381 |#2|) (QUOTE (-337)))) (-3703 (-12 (|HasCategory| (-381 |#2|) (QUOTE (-210))) (|HasCategory| (-381 |#2|) (QUOTE (-337)))) (|HasCategory| (-381 |#2|) (QUOTE (-323))))) 
+((|HasCategory| (-381 |#2|) (QUOTE (-133))) (|HasCategory| (-381 |#2|) (QUOTE (-135))) (|HasCategory| (-381 |#2|) (QUOTE (-323))) (|HasCategory| (-381 |#2|) (QUOTE (-337))) (-3703 (|HasCategory| (-381 |#2|) (QUOTE (-337))) (|HasCategory| (-381 |#2|) (QUOTE (-323)))) (|HasCategory| (-381 |#2|) (QUOTE (-342))) (|HasCategory| (-381 |#2|) (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| (-381 |#2|) (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| (-381 |#2|) (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-342))) (-3703 (|HasCategory| (-381 |#2|) (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| (-381 |#2|) (QUOTE (-337)))) (-12 (|HasCategory| (-381 |#2|) (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| (-381 |#2|) (QUOTE (-337)))) (-3703 (-12 (|HasCategory| (-381 |#2|) (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| (-381 |#2|) (QUOTE (-337)))) (-12 (|HasCategory| (-381 |#2|) (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| (-381 |#2|) (QUOTE (-323))))) (-12 (|HasCategory| (-381 |#2|) (QUOTE (-210))) (|HasCategory| (-381 |#2|) (QUOTE (-337)))) (-3703 (-12 (|HasCategory| (-381 |#2|) (QUOTE (-210))) (|HasCategory| (-381 |#2|) (QUOTE (-337)))) (|HasCategory| (-381 |#2|) (QUOTE (-323))))) 
 (-929 |bb|) 
 ((|constructor| (NIL "This domain allows rational numbers to be presented as repeating decimal expansions or more generally as repeating expansions in any base.")) (|fractRadix| (($ (|List| (|Integer|)) (|List| (|Integer|))) "\\spad{fractRadix(pre,{}cyc)} creates a fractional radix expansion from a list of prefix ragits and a list of cyclic ragits. For example,{} \\spad{fractRadix([1],{}[6])} will return \\spad{0.16666666...}.")) (|wholeRadix| (($ (|List| (|Integer|))) "\\spad{wholeRadix(l)} creates an integral radix expansion from a list of ragits. For example,{} \\spad{wholeRadix([1,{}3,{}4])} will return \\spad{134}.")) (|cycleRagits| (((|List| (|Integer|)) $) "\\spad{cycleRagits(rx)} returns the cyclic part of the ragits of the fractional part of a radix expansion. For example,{} if \\spad{x = 3/28 = 0.10 714285 714285 ...},{} then \\spad{cycleRagits(x) = [7,{}1,{}4,{}2,{}8,{}5]}.")) (|prefixRagits| (((|List| (|Integer|)) $) "\\spad{prefixRagits(rx)} returns the non-cyclic part of the ragits of the fractional part of a radix expansion. For example,{} if \\spad{x = 3/28 = 0.10 714285 714285 ...},{} then \\spad{prefixRagits(x)=[1,{}0]}.")) (|fractRagits| (((|Stream| (|Integer|)) $) "\\spad{fractRagits(rx)} returns the ragits of the fractional part of a radix expansion.")) (|wholeRagits| (((|List| (|Integer|)) $) "\\spad{wholeRagits(rx)} returns the ragits of the integer part of a radix expansion.")) (|fractionPart| (((|Fraction| (|Integer|)) $) "\\spad{fractionPart(rx)} returns the fractional part of a radix expansion.")) (|coerce| (((|Fraction| (|Integer|)) $) "\\spad{coerce(rx)} converts a radix expansion to a rational number."))) 
 ((-4225 . T) (-4231 . T) (-4226 . T) ((-4235 "*") . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
-((|HasCategory| (-521) (QUOTE (-838))) (|HasCategory| (-521) (LIST (QUOTE -961) (QUOTE (-1084)))) (|HasCategory| (-521) (QUOTE (-133))) (|HasCategory| (-521) (QUOTE (-135))) (|HasCategory| (-521) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| (-521) (QUOTE (-946))) (|HasCategory| (-521) (QUOTE (-757))) (|HasCategory| (-521) (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| (-521) (QUOTE (-1060))) (|HasCategory| (-521) (LIST (QUOTE -815) (QUOTE (-521)))) (|HasCategory| (-521) (LIST (QUOTE -815) (QUOTE (-353)))) (|HasCategory| (-521) (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-353))))) (|HasCategory| (-521) (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521))))) (|HasCategory| (-521) (QUOTE (-210))) (|HasCategory| (-521) (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| (-521) (LIST (QUOTE -482) (QUOTE (-1084)) (QUOTE (-521)))) (|HasCategory| (-521) (LIST (QUOTE -284) (QUOTE (-521)))) (|HasCategory| (-521) (LIST (QUOTE -261) (QUOTE (-521)) (QUOTE (-521)))) (|HasCategory| (-521) (QUOTE (-282))) (|HasCategory| (-521) (QUOTE (-506))) (|HasCategory| (-521) (QUOTE (-784))) (-3703 (|HasCategory| (-521) (QUOTE (-757))) (|HasCategory| (-521) (QUOTE (-784)))) (|HasCategory| (-521) (LIST (QUOTE -583) (QUOTE (-521)))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| (-521) (QUOTE (-838)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| (-521) (QUOTE (-838)))) (|HasCategory| (-521) (QUOTE (-133))))) 
+((|HasCategory| (-521) (QUOTE (-837))) (|HasCategory| (-521) (LIST (QUOTE -961) (QUOTE (-1084)))) (|HasCategory| (-521) (QUOTE (-133))) (|HasCategory| (-521) (QUOTE (-135))) (|HasCategory| (-521) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| (-521) (QUOTE (-946))) (|HasCategory| (-521) (QUOTE (-756))) (|HasCategory| (-521) (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| (-521) (QUOTE (-1060))) (|HasCategory| (-521) (LIST (QUOTE -814) (QUOTE (-521)))) (|HasCategory| (-521) (LIST (QUOTE -814) (QUOTE (-353)))) (|HasCategory| (-521) (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-353))))) (|HasCategory| (-521) (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521))))) (|HasCategory| (-521) (QUOTE (-210))) (|HasCategory| (-521) (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| (-521) (LIST (QUOTE -482) (QUOTE (-1084)) (QUOTE (-521)))) (|HasCategory| (-521) (LIST (QUOTE -284) (QUOTE (-521)))) (|HasCategory| (-521) (LIST (QUOTE -261) (QUOTE (-521)) (QUOTE (-521)))) (|HasCategory| (-521) (QUOTE (-282))) (|HasCategory| (-521) (QUOTE (-506))) (|HasCategory| (-521) (QUOTE (-783))) (-3703 (|HasCategory| (-521) (QUOTE (-756))) (|HasCategory| (-521) (QUOTE (-783)))) (|HasCategory| (-521) (LIST (QUOTE -583) (QUOTE (-521)))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| (-521) (QUOTE (-837)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| (-521) (QUOTE (-837)))) (|HasCategory| (-521) (QUOTE (-133))))) 
 (-930) 
 ((|constructor| (NIL "This package provides tools for creating radix expansions.")) (|radix| (((|Any|) (|Fraction| (|Integer|)) (|Integer|)) "\\spad{radix(x,{}b)} converts \\spad{x} to a radix expansion in base \\spad{b}."))) 
 NIL 
@@ -3670,7 +3670,7 @@ NIL
 ((|HasAttribute| |#1| (QUOTE -4234)) (|HasCategory| |#2| (QUOTE (-1013)))) 
 (-935 S) 
 ((|constructor| (NIL "A recursive aggregate over a type \\spad{S} is a model for a a directed graph containing values of type \\spad{S}. Recursively,{} a recursive aggregate is a {\\em node} consisting of a \\spadfun{value} from \\spad{S} and 0 or more \\spadfun{children} which are recursive aggregates. A node with no children is called a \\spadfun{leaf} node. A recursive aggregate may be cyclic for which some operations as noted may go into an infinite loop.")) (|setvalue!| ((|#1| $ |#1|) "\\spad{setvalue!(u,{}x)} sets the value of node \\spad{u} to \\spad{x}.")) (|setelt| ((|#1| $ "value" |#1|) "\\spad{setelt(a,{}\"value\",{}x)} (also written \\axiom{a . value \\spad{:=} \\spad{x}}) is equivalent to \\axiom{setvalue!(a,{}\\spad{x})}")) (|setchildren!| (($ $ (|List| $)) "\\spad{setchildren!(u,{}v)} replaces the current children of node \\spad{u} with the members of \\spad{v} in left-to-right order.")) (|node?| (((|Boolean|) $ $) "\\spad{node?(u,{}v)} tests if node \\spad{u} is contained in node \\spad{v} (either as a child,{} a child of a child,{} etc.).")) (|child?| (((|Boolean|) $ $) "\\spad{child?(u,{}v)} tests if node \\spad{u} is a child of node \\spad{v}.")) (|distance| (((|Integer|) $ $) "\\spad{distance(u,{}v)} returns the path length (an integer) from node \\spad{u} to \\spad{v}.")) (|leaves| (((|List| |#1|) $) "\\spad{leaves(t)} returns the list of values in obtained by visiting the nodes of tree \\axiom{\\spad{t}} in left-to-right order.")) (|cyclic?| (((|Boolean|) $) "\\spad{cyclic?(u)} tests if \\spad{u} has a cycle.")) (|elt| ((|#1| $ "value") "\\spad{elt(u,{}\"value\")} (also written: \\axiom{a. value}) is equivalent to \\axiom{value(a)}.")) (|value| ((|#1| $) "\\spad{value(u)} returns the value of the node \\spad{u}.")) (|leaf?| (((|Boolean|) $) "\\spad{leaf?(u)} tests if \\spad{u} is a terminal node.")) (|nodes| (((|List| $) $) "\\spad{nodes(u)} returns a list of all of the nodes of aggregate \\spad{u}.")) (|children| (((|List| $) $) "\\spad{children(u)} returns a list of the children of aggregate \\spad{u}."))) 
-((-2046 . T)) 
+((-2092 . T)) 
 NIL 
 (-936 S) 
 ((|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)}") (($ $ (|NonNegativeInteger|)) "\\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}}"))) 
@@ -3735,7 +3735,7 @@ NIL
 (-951 R E V P) 
 ((|constructor| (NIL "This domain provides an implementation of regular chains. Moreover,{} the operation \\axiomOpFrom{zeroSetSplit}{RegularTriangularSetCategory} is an implementation of a new algorithm for solving polynomial systems by means of regular chains.\\newline References : \\indented{1}{[1] \\spad{M}. MORENO MAZA \"A new algorithm for computing triangular} \\indented{5}{decomposition of algebraic varieties\" NAG Tech. Rep. 4/98.}")) (|preprocess| (((|Record| (|:| |val| (|List| |#4|)) (|:| |towers| (|List| $))) (|List| |#4|) (|Boolean|) (|Boolean|)) "\\axiom{pre_process(\\spad{lp},{}\\spad{b1},{}\\spad{b2})} is an internal subroutine,{} exported only for developement.")) (|internalZeroSetSplit| (((|List| $) (|List| |#4|) (|Boolean|) (|Boolean|) (|Boolean|)) "\\axiom{internalZeroSetSplit(\\spad{lp},{}\\spad{b1},{}\\spad{b2},{}\\spad{b3})} is an internal subroutine,{} exported only for developement.")) (|zeroSetSplit| (((|List| $) (|List| |#4|) (|Boolean|) (|Boolean|) (|Boolean|) (|Boolean|)) "\\axiom{zeroSetSplit(\\spad{lp},{}\\spad{b1},{}\\spad{b2}.\\spad{b3},{}\\spad{b4})} is an internal subroutine,{} exported only for developement.") (((|List| $) (|List| |#4|) (|Boolean|) (|Boolean|)) "\\axiom{zeroSetSplit(\\spad{lp},{}clos?,{}info?)} has the same specifications as \\axiomOpFrom{zeroSetSplit}{RegularTriangularSetCategory}. Moreover,{} if \\axiom{clos?} then solves in the sense of the Zariski closure else solves in the sense of the regular zeros. If \\axiom{info?} then do print messages during the computations.")) (|internalAugment| (((|List| $) |#4| $ (|Boolean|) (|Boolean|) (|Boolean|) (|Boolean|) (|Boolean|)) "\\axiom{internalAugment(\\spad{p},{}\\spad{ts},{}\\spad{b1},{}\\spad{b2},{}\\spad{b3},{}\\spad{b4},{}\\spad{b5})} is an internal subroutine,{} exported only for developement."))) 
 ((-4234 . T) (-4233 . T)) 
-((|HasCategory| |#4| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#4| (QUOTE (-1013))) (-12 (|HasCategory| |#4| (QUOTE (-1013))) (|HasCategory| |#4| (LIST (QUOTE -284) (|devaluate| |#4|)))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#3| (QUOTE (-342))) (|HasCategory| |#4| (LIST (QUOTE -561) (QUOTE (-792))))) 
+((|HasCategory| |#4| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#4| (QUOTE (-1013))) (-12 (|HasCategory| |#4| (QUOTE (-1013))) (|HasCategory| |#4| (LIST (QUOTE -284) (|devaluate| |#4|)))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#3| (QUOTE (-342))) (|HasCategory| |#4| (LIST (QUOTE -561) (QUOTE (-791))))) 
 (-952 R) 
 ((|constructor| (NIL "RepresentationPackage1 provides functions for representation theory for finite groups and algebras. The package creates permutation representations and uses tensor products and its symmetric and antisymmetric components to create new representations of larger degree from given ones. Note: instead of having parameters from \\spadtype{Permutation} this package allows list notation of permutations as well: \\spadignore{e.g.} \\spad{[1,{}4,{}3,{}2]} denotes permutes 2 and 4 and fixes 1 and 3.")) (|permutationRepresentation| (((|List| (|Matrix| (|Integer|))) (|List| (|List| (|Integer|)))) "\\spad{permutationRepresentation([pi1,{}...,{}pik],{}n)} returns the list of matrices {\\em [(deltai,{}pi1(i)),{}...,{}(deltai,{}pik(i))]} if the permutations {\\em pi1},{}...,{}{\\em pik} are in list notation and are permuting {\\em {1,{}2,{}...,{}n}}.") (((|List| (|Matrix| (|Integer|))) (|List| (|Permutation| (|Integer|))) (|Integer|)) "\\spad{permutationRepresentation([pi1,{}...,{}pik],{}n)} returns the list of matrices {\\em [(deltai,{}pi1(i)),{}...,{}(deltai,{}pik(i))]} (Kronecker delta) for the permutations {\\em pi1,{}...,{}pik} of {\\em {1,{}2,{}...,{}n}}.") (((|Matrix| (|Integer|)) (|List| (|Integer|))) "\\spad{permutationRepresentation(\\spad{pi},{}n)} returns the matrix {\\em (deltai,{}\\spad{pi}(i))} (Kronecker delta) if the permutation {\\em \\spad{pi}} is in list notation and permutes {\\em {1,{}2,{}...,{}n}}.") (((|Matrix| (|Integer|)) (|Permutation| (|Integer|)) (|Integer|)) "\\spad{permutationRepresentation(\\spad{pi},{}n)} returns the matrix {\\em (deltai,{}\\spad{pi}(i))} (Kronecker delta) for a permutation {\\em \\spad{pi}} of {\\em {1,{}2,{}...,{}n}}.")) (|tensorProduct| (((|List| (|Matrix| |#1|)) (|List| (|Matrix| |#1|))) "\\spad{tensorProduct([a1,{}...ak])} calculates the list of Kronecker products of each matrix {\\em \\spad{ai}} with itself for {1 \\spad{<=} \\spad{i} \\spad{<=} \\spad{k}}. Note: If the list of matrices corresponds to a group representation (repr. of generators) of one group,{} then these matrices correspond to the tensor product of the representation with itself.") (((|Matrix| |#1|) (|Matrix| |#1|)) "\\spad{tensorProduct(a)} calculates the Kronecker product of the matrix {\\em a} with itself.") (((|List| (|Matrix| |#1|)) (|List| (|Matrix| |#1|)) (|List| (|Matrix| |#1|))) "\\spad{tensorProduct([a1,{}...,{}ak],{}[b1,{}...,{}bk])} calculates the list of Kronecker products of the matrices {\\em \\spad{ai}} and {\\em \\spad{bi}} for {1 \\spad{<=} \\spad{i} \\spad{<=} \\spad{k}}. Note: If each list of matrices corresponds to a group representation (repr. of generators) of one group,{} then these matrices correspond to the tensor product of the two representations.") (((|Matrix| |#1|) (|Matrix| |#1|) (|Matrix| |#1|)) "\\spad{tensorProduct(a,{}b)} calculates the Kronecker product of the matrices {\\em a} and \\spad{b}. Note: if each matrix corresponds to a group representation (repr. of generators) of one group,{} then these matrices correspond to the tensor product of the two representations.")) (|symmetricTensors| (((|List| (|Matrix| |#1|)) (|List| (|Matrix| |#1|)) (|PositiveInteger|)) "\\spad{symmetricTensors(la,{}n)} applies to each \\spad{m}-by-\\spad{m} square matrix in the list {\\em la} the irreducible,{} polynomial representation of the general linear group {\\em GLm} which corresponds to the partition {\\em (n,{}0,{}...,{}0)} of \\spad{n}. Error: if the matrices in {\\em la} are not square matrices. Note: this corresponds to the symmetrization of the representation with the trivial representation of the symmetric group {\\em Sn}. The carrier spaces of the representation are the symmetric tensors of the \\spad{n}-fold tensor product.") (((|Matrix| |#1|) (|Matrix| |#1|) (|PositiveInteger|)) "\\spad{symmetricTensors(a,{}n)} applies to the \\spad{m}-by-\\spad{m} square matrix {\\em a} the irreducible,{} polynomial representation of the general linear group {\\em GLm} which corresponds to the partition {\\em (n,{}0,{}...,{}0)} of \\spad{n}. Error: if {\\em a} is not a square matrix. Note: this corresponds to the symmetrization of the representation with the trivial representation of the symmetric group {\\em Sn}. The carrier spaces of the representation are the symmetric tensors of the \\spad{n}-fold tensor product.")) (|createGenericMatrix| (((|Matrix| (|Polynomial| |#1|)) (|NonNegativeInteger|)) "\\spad{createGenericMatrix(m)} creates a square matrix of dimension \\spad{k} whose entry at the \\spad{i}-th row and \\spad{j}-th column is the indeterminate {\\em x[i,{}j]} (double subscripted).")) (|antisymmetricTensors| (((|List| (|Matrix| |#1|)) (|List| (|Matrix| |#1|)) (|PositiveInteger|)) "\\spad{antisymmetricTensors(la,{}n)} applies to each \\spad{m}-by-\\spad{m} square matrix in the list {\\em la} the irreducible,{} polynomial representation of the general linear group {\\em GLm} which corresponds to the partition {\\em (1,{}1,{}...,{}1,{}0,{}0,{}...,{}0)} of \\spad{n}. Error: if \\spad{n} is greater than \\spad{m}. Note: this corresponds to the symmetrization of the representation with the sign representation of the symmetric group {\\em Sn}. The carrier spaces of the representation are the antisymmetric tensors of the \\spad{n}-fold tensor product.") (((|Matrix| |#1|) (|Matrix| |#1|) (|PositiveInteger|)) "\\spad{antisymmetricTensors(a,{}n)} applies to the square matrix {\\em a} the irreducible,{} polynomial representation of the general linear group {\\em GLm},{} where \\spad{m} is the number of rows of {\\em a},{} which corresponds to the partition {\\em (1,{}1,{}...,{}1,{}0,{}0,{}...,{}0)} of \\spad{n}. Error: if \\spad{n} is greater than \\spad{m}. Note: this corresponds to the symmetrization of the representation with the sign representation of the symmetric group {\\em Sn}. The carrier spaces of the representation are the antisymmetric tensors of the \\spad{n}-fold tensor product."))) 
 NIL 
@@ -3767,7 +3767,7 @@ NIL
 (-959) 
 ((|constructor| (NIL "A domain used to return the results from a call to the NAG Library. It prints as a list of names and types,{} though the user may choose to display values automatically if he or she wishes.")) (|showArrayValues| (((|Boolean|) (|Boolean|)) "\\spad{showArrayValues(true)} forces the values of array components to be \\indented{1}{displayed rather than just their types.}")) (|showScalarValues| (((|Boolean|) (|Boolean|)) "\\spad{showScalarValues(true)} forces the values of scalar components to be \\indented{1}{displayed rather than just their types.}"))) 
 ((-4233 . T) (-4234 . T)) 
-((|HasCategory| (-2 (|:| -2529 (-1084)) (|:| -3045 (-51))) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| (-2 (|:| -2529 (-1084)) (|:| -3045 (-51))) (QUOTE (-1013))) (-12 (|HasCategory| (-2 (|:| -2529 (-1084)) (|:| -3045 (-51))) (QUOTE (-1013))) (|HasCategory| (-2 (|:| -2529 (-1084)) (|:| -3045 (-51))) (LIST (QUOTE -284) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2529) (QUOTE (-1084))) (LIST (QUOTE |:|) (QUOTE -3045) (QUOTE (-51))))))) (|HasCategory| (-1084) (QUOTE (-784))) (|HasCategory| (-51) (QUOTE (-1013))) (-3703 (|HasCategory| (-2 (|:| -2529 (-1084)) (|:| -3045 (-51))) (QUOTE (-1013))) (|HasCategory| (-51) (QUOTE (-1013)))) (-12 (|HasCategory| (-51) (QUOTE (-1013))) (|HasCategory| (-51) (LIST (QUOTE -284) (QUOTE (-51))))) (|HasCategory| (-51) (LIST (QUOTE -561) (QUOTE (-792)))) (|HasCategory| (-2 (|:| -2529 (-1084)) (|:| -3045 (-51))) (LIST (QUOTE -561) (QUOTE (-792)))) (-3703 (|HasCategory| (-2 (|:| -2529 (-1084)) (|:| -3045 (-51))) (QUOTE (-1013))) (|HasCategory| (-2 (|:| -2529 (-1084)) (|:| -3045 (-51))) (LIST (QUOTE -561) (QUOTE (-792)))) (|HasCategory| (-51) (QUOTE (-1013))) (|HasCategory| (-51) (LIST (QUOTE -561) (QUOTE (-792))))) (-3703 (|HasCategory| (-2 (|:| -2529 (-1084)) (|:| -3045 (-51))) (LIST (QUOTE -561) (QUOTE (-792)))) (|HasCategory| (-51) (LIST (QUOTE -561) (QUOTE (-792)))))) 
+((|HasCategory| (-2 (|:| -2535 (-1084)) (|:| -3050 (-51))) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| (-2 (|:| -2535 (-1084)) (|:| -3050 (-51))) (QUOTE (-1013))) (-12 (|HasCategory| (-2 (|:| -2535 (-1084)) (|:| -3050 (-51))) (QUOTE (-1013))) (|HasCategory| (-2 (|:| -2535 (-1084)) (|:| -3050 (-51))) (LIST (QUOTE -284) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2535) (QUOTE (-1084))) (LIST (QUOTE |:|) (QUOTE -3050) (QUOTE (-51))))))) (|HasCategory| (-1084) (QUOTE (-783))) (|HasCategory| (-51) (QUOTE (-1013))) (-3703 (|HasCategory| (-2 (|:| -2535 (-1084)) (|:| -3050 (-51))) (QUOTE (-1013))) (|HasCategory| (-51) (QUOTE (-1013)))) (-12 (|HasCategory| (-51) (QUOTE (-1013))) (|HasCategory| (-51) (LIST (QUOTE -284) (QUOTE (-51))))) (|HasCategory| (-51) (LIST (QUOTE -561) (QUOTE (-791)))) (|HasCategory| (-2 (|:| -2535 (-1084)) (|:| -3050 (-51))) (LIST (QUOTE -561) (QUOTE (-791)))) (-3703 (|HasCategory| (-2 (|:| -2535 (-1084)) (|:| -3050 (-51))) (QUOTE (-1013))) (|HasCategory| (-2 (|:| -2535 (-1084)) (|:| -3050 (-51))) (LIST (QUOTE -561) (QUOTE (-791)))) (|HasCategory| (-51) (QUOTE (-1013))) (|HasCategory| (-51) (LIST (QUOTE -561) (QUOTE (-791))))) (-3703 (|HasCategory| (-2 (|:| -2535 (-1084)) (|:| -3050 (-51))) (LIST (QUOTE -561) (QUOTE (-791)))) (|HasCategory| (-51) (LIST (QUOTE -561) (QUOTE (-791)))))) 
 (-960 A S) 
 ((|constructor| (NIL "A is retractable to \\spad{B} means that some elementsif A can be converted into elements of \\spad{B} and any element of \\spad{B} can be converted into an element of A.")) (|retract| ((|#2| $) "\\spad{retract(a)} transforms a into an element of \\spad{S} if possible. Error: if a cannot be made into an element of \\spad{S}.")) (|retractIfCan| (((|Union| |#2| "failed") $) "\\spad{retractIfCan(a)} transforms a into an element of \\spad{S} if possible. Returns \"failed\" if a cannot be made into an element of \\spad{S}.")) (|coerce| (($ |#2|) "\\spad{coerce(a)} transforms a into an element of \\%."))) 
 NIL 
@@ -3799,7 +3799,7 @@ NIL
 (-967 R |ls|) 
 ((|constructor| (NIL "A domain for regular chains (\\spadignore{i.e.} regular triangular sets) over a \\spad{Gcd}-Domain and with a fix list of variables. This is just a front-end for the \\spadtype{RegularTriangularSet} domain constructor.")) (|zeroSetSplit| (((|List| $) (|List| (|NewSparseMultivariatePolynomial| |#1| (|OrderedVariableList| |#2|))) (|Boolean|) (|Boolean|)) "\\spad{zeroSetSplit(lp,{}clos?,{}info?)} returns a list \\spad{lts} of regular chains such that the union of the closures of their regular zero sets equals the affine variety associated with \\spad{lp}. Moreover,{} if \\spad{clos?} is \\spad{false} then the union of the regular zero set of the \\spad{ts} (for \\spad{ts} in \\spad{lts}) equals this variety. If \\spad{info?} is \\spad{true} then some information is displayed during the computations. See \\axiomOpFrom{zeroSetSplit}{RegularTriangularSet}."))) 
 ((-4234 . T) (-4233 . T)) 
-((|HasCategory| (-716 |#1| (-794 |#2|)) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| (-716 |#1| (-794 |#2|)) (QUOTE (-1013))) (-12 (|HasCategory| (-716 |#1| (-794 |#2|)) (QUOTE (-1013))) (|HasCategory| (-716 |#1| (-794 |#2|)) (LIST (QUOTE -284) (LIST (QUOTE -716) (|devaluate| |#1|) (LIST (QUOTE -794) (|devaluate| |#2|)))))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| (-794 |#2|) (QUOTE (-342))) (|HasCategory| (-716 |#1| (-794 |#2|)) (LIST (QUOTE -561) (QUOTE (-792))))) 
+((|HasCategory| (-716 |#1| (-793 |#2|)) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| (-716 |#1| (-793 |#2|)) (QUOTE (-1013))) (-12 (|HasCategory| (-716 |#1| (-793 |#2|)) (QUOTE (-1013))) (|HasCategory| (-716 |#1| (-793 |#2|)) (LIST (QUOTE -284) (LIST (QUOTE -716) (|devaluate| |#1|) (LIST (QUOTE -793) (|devaluate| |#2|)))))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| (-793 |#2|) (QUOTE (-342))) (|HasCategory| (-716 |#1| (-793 |#2|)) (LIST (QUOTE -561) (QUOTE (-791))))) 
 (-968) 
 ((|constructor| (NIL "This package exports integer distributions")) (|ridHack1| (((|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Integer|)) "\\spad{ridHack1(i,{}j,{}k,{}l)} \\undocumented")) (|geometric| (((|Mapping| (|Integer|)) |RationalNumber|) "\\spad{geometric(f)} \\undocumented")) (|poisson| (((|Mapping| (|Integer|)) |RationalNumber|) "\\spad{poisson(f)} \\undocumented")) (|binomial| (((|Mapping| (|Integer|)) (|Integer|) |RationalNumber|) "\\spad{binomial(n,{}f)} \\undocumented")) (|uniform| (((|Mapping| (|Integer|)) (|Segment| (|Integer|))) "\\spad{uniform(s)} \\undocumented"))) 
 NIL 
@@ -3822,12 +3822,12 @@ NIL
 ((|HasCategory| |#4| (QUOTE (-282))) (|HasCategory| |#4| (QUOTE (-337))) (|HasCategory| |#4| (QUOTE (-513))) (|HasCategory| |#4| (QUOTE (-157)))) 
 (-973 |m| |n| R |Row| |Col|) 
 ((|constructor| (NIL "\\spadtype{RectangularMatrixCategory} is a category of matrices of fixed dimensions. The dimensions of the matrix will be parameters of the domain. Domains in this category will be \\spad{R}-modules and will be non-mutable.")) (|nullSpace| (((|List| |#5|) $) "\\spad{nullSpace(m)}+ returns a basis for the null space of the matrix \\spad{m}.")) (|nullity| (((|NonNegativeInteger|) $) "\\spad{nullity(m)} returns the nullity of the matrix \\spad{m}. This is the dimension of the null space of the matrix \\spad{m}.")) (|rank| (((|NonNegativeInteger|) $) "\\spad{rank(m)} returns the rank of the matrix \\spad{m}.")) (|rowEchelon| (($ $) "\\spad{rowEchelon(m)} returns the row echelon form of the matrix \\spad{m}.")) (/ (($ $ |#3|) "\\spad{m/r} divides the elements of \\spad{m} by \\spad{r}. Error: if \\spad{r = 0}.")) (|exquo| (((|Union| $ "failed") $ |#3|) "\\spad{exquo(m,{}r)} computes the exact quotient of the elements of \\spad{m} by \\spad{r},{} returning \\axiom{\"failed\"} if this is not possible.")) (|map| (($ (|Mapping| |#3| |#3| |#3|) $ $) "\\spad{map(f,{}a,{}b)} returns \\spad{c},{} where \\spad{c} is such that \\spad{c(i,{}j) = f(a(i,{}j),{}b(i,{}j))} for all \\spad{i},{} \\spad{j}.") (($ (|Mapping| |#3| |#3|) $) "\\spad{map(f,{}a)} returns \\spad{b},{} where \\spad{b(i,{}j) = a(i,{}j)} for all \\spad{i},{} \\spad{j}.")) (|column| ((|#5| $ (|Integer|)) "\\spad{column(m,{}j)} returns the \\spad{j}th column of the matrix \\spad{m}. Error: if the index outside the proper range.")) (|row| ((|#4| $ (|Integer|)) "\\spad{row(m,{}i)} returns the \\spad{i}th row of the matrix \\spad{m}. Error: if the index is outside the proper range.")) (|qelt| ((|#3| $ (|Integer|) (|Integer|)) "\\spad{qelt(m,{}i,{}j)} returns the element in the \\spad{i}th row and \\spad{j}th column of the matrix \\spad{m}. Note: there is NO error check to determine if indices are in the proper ranges.")) (|elt| ((|#3| $ (|Integer|) (|Integer|) |#3|) "\\spad{elt(m,{}i,{}j,{}r)} returns the element in the \\spad{i}th row and \\spad{j}th column of the matrix \\spad{m},{} if \\spad{m} has an \\spad{i}th row and a \\spad{j}th column,{} and returns \\spad{r} otherwise.") ((|#3| $ (|Integer|) (|Integer|)) "\\spad{elt(m,{}i,{}j)} returns the element in the \\spad{i}th row and \\spad{j}th column of the matrix \\spad{m}. Error: if indices are outside the proper ranges.")) (|listOfLists| (((|List| (|List| |#3|)) $) "\\spad{listOfLists(m)} returns the rows of the matrix \\spad{m} as a list of lists.")) (|ncols| (((|NonNegativeInteger|) $) "\\spad{ncols(m)} returns the number of columns in the matrix \\spad{m}.")) (|nrows| (((|NonNegativeInteger|) $) "\\spad{nrows(m)} returns the number of rows in the matrix \\spad{m}.")) (|maxColIndex| (((|Integer|) $) "\\spad{maxColIndex(m)} returns the index of the 'last' column of the matrix \\spad{m}.")) (|minColIndex| (((|Integer|) $) "\\spad{minColIndex(m)} returns the index of the 'first' column of the matrix \\spad{m}.")) (|maxRowIndex| (((|Integer|) $) "\\spad{maxRowIndex(m)} returns the index of the 'last' row of the matrix \\spad{m}.")) (|minRowIndex| (((|Integer|) $) "\\spad{minRowIndex(m)} returns the index of the 'first' row of the matrix \\spad{m}.")) (|antisymmetric?| (((|Boolean|) $) "\\spad{antisymmetric?(m)} returns \\spad{true} if the matrix \\spad{m} is square and antisymmetric (\\spadignore{i.e.} \\spad{m[i,{}j] = -m[j,{}i]} for all \\spad{i} and \\spad{j}) and \\spad{false} otherwise.")) (|symmetric?| (((|Boolean|) $) "\\spad{symmetric?(m)} returns \\spad{true} if the matrix \\spad{m} is square and symmetric (\\spadignore{i.e.} \\spad{m[i,{}j] = m[j,{}i]} for all \\spad{i} and \\spad{j}) and \\spad{false} otherwise.")) (|diagonal?| (((|Boolean|) $) "\\spad{diagonal?(m)} returns \\spad{true} if the matrix \\spad{m} is square and diagonal (\\spadignore{i.e.} all entries of \\spad{m} not on the diagonal are zero) and \\spad{false} otherwise.")) (|square?| (((|Boolean|) $) "\\spad{square?(m)} returns \\spad{true} if \\spad{m} is a square matrix (\\spadignore{i.e.} if \\spad{m} has the same number of rows as columns) and \\spad{false} otherwise.")) (|matrix| (($ (|List| (|List| |#3|))) "\\spad{matrix(l)} converts the list of lists \\spad{l} to a matrix,{} where the list of lists is viewed as a list of the rows of the matrix.")) (|finiteAggregate| ((|attribute|) "matrices are finite"))) 
-((-4233 . T) (-2046 . T) (-4228 . T) (-4227 . T)) 
+((-4233 . T) (-2092 . T) (-4228 . T) (-4227 . T)) 
 NIL 
 (-974 |m| |n| R) 
 ((|constructor| (NIL "\\spadtype{RectangularMatrix} is a matrix domain where the number of rows and the number of columns are parameters of the domain.")) (|coerce| (((|Matrix| |#3|) $) "\\spad{coerce(m)} converts a matrix of type \\spadtype{RectangularMatrix} to a matrix of type \\spad{Matrix}.")) (|rectangularMatrix| (($ (|Matrix| |#3|)) "\\spad{rectangularMatrix(m)} converts a matrix of type \\spadtype{Matrix} to a matrix of type \\spad{RectangularMatrix}."))) 
 ((-4233 . T) (-4228 . T) (-4227 . T)) 
-((|HasCategory| |#3| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#3| (QUOTE (-337))) (|HasCategory| |#3| (QUOTE (-1013))) (|HasCategory| |#3| (QUOTE (-282))) (|HasCategory| |#3| (QUOTE (-513))) (|HasCategory| |#3| (QUOTE (-157))) (-3703 (|HasCategory| |#3| (QUOTE (-157))) (|HasCategory| |#3| (QUOTE (-337)))) (|HasCategory| |#3| (LIST (QUOTE -561) (QUOTE (-792)))) (-12 (|HasCategory| |#3| (QUOTE (-1013))) (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|)))) (-3703 (-12 (|HasCategory| |#3| (QUOTE (-157))) (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-337))) (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1013))) (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|)))))) 
+((|HasCategory| |#3| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#3| (QUOTE (-337))) (|HasCategory| |#3| (QUOTE (-1013))) (|HasCategory| |#3| (QUOTE (-282))) (|HasCategory| |#3| (QUOTE (-513))) (|HasCategory| |#3| (QUOTE (-157))) (-3703 (|HasCategory| |#3| (QUOTE (-157))) (|HasCategory| |#3| (QUOTE (-337)))) (|HasCategory| |#3| (LIST (QUOTE -561) (QUOTE (-791)))) (-12 (|HasCategory| |#3| (QUOTE (-1013))) (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|)))) (-3703 (-12 (|HasCategory| |#3| (QUOTE (-157))) (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-337))) (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1013))) (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|)))))) 
 (-975 |m| |n| R1 |Row1| |Col1| M1 R2 |Row2| |Col2| M2) 
 ((|constructor| (NIL "\\spadtype{RectangularMatrixCategoryFunctions2} provides functions between two matrix domains. The functions provided are \\spadfun{map} and \\spadfun{reduce}.")) (|reduce| ((|#7| (|Mapping| |#7| |#3| |#7|) |#6| |#7|) "\\spad{reduce(f,{}m,{}r)} returns a matrix \\spad{n} where \\spad{n[i,{}j] = f(m[i,{}j],{}r)} for all indices spad{\\spad{i}} and \\spad{j}.")) (|map| ((|#10| (|Mapping| |#7| |#3|) |#6|) "\\spad{map(f,{}m)} applies the function \\spad{f} to the elements of the matrix \\spad{m}."))) 
 NIL 
@@ -3859,7 +3859,7 @@ NIL
 (-982) 
 ((|constructor| (NIL "\\axiomType{RoutinesTable} implements a database and associated tuning mechanisms for a set of known NAG routines")) (|recoverAfterFail| (((|Union| (|String|) "failed") $ (|String|) (|Integer|)) "\\spad{recoverAfterFail(routs,{}routineName,{}ifailValue)} acts on the instructions given by the ifail list")) (|showTheRoutinesTable| (($) "\\spad{showTheRoutinesTable()} returns the current table of NAG routines.")) (|deleteRoutine!| (($ $ (|Symbol|)) "\\spad{deleteRoutine!(R,{}s)} destructively deletes the given routine from the current database of NAG routines")) (|getExplanations| (((|List| (|String|)) $ (|String|)) "\\spad{getExplanations(R,{}s)} gets the explanations of the output parameters for the given NAG routine.")) (|getMeasure| (((|Float|) $ (|Symbol|)) "\\spad{getMeasure(R,{}s)} gets the current value of the maximum measure for the given NAG routine.")) (|changeMeasure| (($ $ (|Symbol|) (|Float|)) "\\spad{changeMeasure(R,{}s,{}newValue)} changes the maximum value for a measure of the given NAG routine.")) (|changeThreshhold| (($ $ (|Symbol|) (|Float|)) "\\spad{changeThreshhold(R,{}s,{}newValue)} changes the value below which,{} given a NAG routine generating a higher measure,{} the routines will make no attempt to generate a measure.")) (|selectMultiDimensionalRoutines| (($ $) "\\spad{selectMultiDimensionalRoutines(R)} chooses only those routines from the database which are designed for use with multi-dimensional expressions")) (|selectNonFiniteRoutines| (($ $) "\\spad{selectNonFiniteRoutines(R)} chooses only those routines from the database which are designed for use with non-finite expressions.")) (|selectSumOfSquaresRoutines| (($ $) "\\spad{selectSumOfSquaresRoutines(R)} chooses only those routines from the database which are designed for use with sums of squares")) (|selectFiniteRoutines| (($ $) "\\spad{selectFiniteRoutines(R)} chooses only those routines from the database which are designed for use with finite expressions")) (|selectODEIVPRoutines| (($ $) "\\spad{selectODEIVPRoutines(R)} chooses only those routines from the database which are for the solution of ODE\\spad{'s}")) (|selectPDERoutines| (($ $) "\\spad{selectPDERoutines(R)} chooses only those routines from the database which are for the solution of PDE\\spad{'s}")) (|selectOptimizationRoutines| (($ $) "\\spad{selectOptimizationRoutines(R)} chooses only those routines from the database which are for integration")) (|selectIntegrationRoutines| (($ $) "\\spad{selectIntegrationRoutines(R)} chooses only those routines from the database which are for integration")) (|routines| (($) "\\spad{routines()} initialises a database of known NAG routines")) (|concat| (($ $ $) "\\spad{concat(x,{}y)} merges two tables \\spad{x} and \\spad{y}"))) 
 ((-4233 . T) (-4234 . T)) 
-((|HasCategory| (-2 (|:| -2529 (-1084)) (|:| -3045 (-51))) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| (-2 (|:| -2529 (-1084)) (|:| -3045 (-51))) (QUOTE (-1013))) (-12 (|HasCategory| (-2 (|:| -2529 (-1084)) (|:| -3045 (-51))) (QUOTE (-1013))) (|HasCategory| (-2 (|:| -2529 (-1084)) (|:| -3045 (-51))) (LIST (QUOTE -284) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2529) (QUOTE (-1084))) (LIST (QUOTE |:|) (QUOTE -3045) (QUOTE (-51))))))) (|HasCategory| (-1084) (QUOTE (-784))) (|HasCategory| (-51) (QUOTE (-1013))) (-3703 (|HasCategory| (-2 (|:| -2529 (-1084)) (|:| -3045 (-51))) (QUOTE (-1013))) (|HasCategory| (-51) (QUOTE (-1013)))) (-12 (|HasCategory| (-51) (QUOTE (-1013))) (|HasCategory| (-51) (LIST (QUOTE -284) (QUOTE (-51))))) (|HasCategory| (-51) (LIST (QUOTE -561) (QUOTE (-792)))) (|HasCategory| (-2 (|:| -2529 (-1084)) (|:| -3045 (-51))) (LIST (QUOTE -561) (QUOTE (-792)))) (-3703 (|HasCategory| (-2 (|:| -2529 (-1084)) (|:| -3045 (-51))) (QUOTE (-1013))) (|HasCategory| (-2 (|:| -2529 (-1084)) (|:| -3045 (-51))) (LIST (QUOTE -561) (QUOTE (-792)))) (|HasCategory| (-51) (QUOTE (-1013))) (|HasCategory| (-51) (LIST (QUOTE -561) (QUOTE (-792))))) (-3703 (|HasCategory| (-2 (|:| -2529 (-1084)) (|:| -3045 (-51))) (LIST (QUOTE -561) (QUOTE (-792)))) (|HasCategory| (-51) (LIST (QUOTE -561) (QUOTE (-792)))))) 
+((|HasCategory| (-2 (|:| -2535 (-1084)) (|:| -3050 (-51))) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| (-2 (|:| -2535 (-1084)) (|:| -3050 (-51))) (QUOTE (-1013))) (-12 (|HasCategory| (-2 (|:| -2535 (-1084)) (|:| -3050 (-51))) (QUOTE (-1013))) (|HasCategory| (-2 (|:| -2535 (-1084)) (|:| -3050 (-51))) (LIST (QUOTE -284) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2535) (QUOTE (-1084))) (LIST (QUOTE |:|) (QUOTE -3050) (QUOTE (-51))))))) (|HasCategory| (-1084) (QUOTE (-783))) (|HasCategory| (-51) (QUOTE (-1013))) (-3703 (|HasCategory| (-2 (|:| -2535 (-1084)) (|:| -3050 (-51))) (QUOTE (-1013))) (|HasCategory| (-51) (QUOTE (-1013)))) (-12 (|HasCategory| (-51) (QUOTE (-1013))) (|HasCategory| (-51) (LIST (QUOTE -284) (QUOTE (-51))))) (|HasCategory| (-51) (LIST (QUOTE -561) (QUOTE (-791)))) (|HasCategory| (-2 (|:| -2535 (-1084)) (|:| -3050 (-51))) (LIST (QUOTE -561) (QUOTE (-791)))) (-3703 (|HasCategory| (-2 (|:| -2535 (-1084)) (|:| -3050 (-51))) (QUOTE (-1013))) (|HasCategory| (-2 (|:| -2535 (-1084)) (|:| -3050 (-51))) (LIST (QUOTE -561) (QUOTE (-791)))) (|HasCategory| (-51) (QUOTE (-1013))) (|HasCategory| (-51) (LIST (QUOTE -561) (QUOTE (-791))))) (-3703 (|HasCategory| (-2 (|:| -2535 (-1084)) (|:| -3050 (-51))) (LIST (QUOTE -561) (QUOTE (-791)))) (|HasCategory| (-51) (LIST (QUOTE -561) (QUOTE (-791)))))) 
 (-983 S R E V) 
 ((|constructor| (NIL "A category for general multi-variate polynomials with coefficients in a ring,{} variables in an ordered set,{} and exponents from an ordered abelian monoid,{} with a \\axiomOp{sup} operation. When not constant,{} such a polynomial is viewed as a univariate polynomial in its main variable \\spad{w}. \\spad{r}. \\spad{t}. to the total ordering on the elements in the ordered set,{} so that some operations usually defined for univariate polynomials make sense here.")) (|mainSquareFreePart| (($ $) "\\axiom{mainSquareFreePart(\\spad{p})} returns the square free part of \\axiom{\\spad{p}} viewed as a univariate polynomial in its main variable and with coefficients in the polynomial ring generated by its other variables over \\axiom{\\spad{R}}.")) (|mainPrimitivePart| (($ $) "\\axiom{mainPrimitivePart(\\spad{p})} returns the primitive part of \\axiom{\\spad{p}} viewed as a univariate polynomial in its main variable and with coefficients in the polynomial ring generated by its other variables over \\axiom{\\spad{R}}.")) (|mainContent| (($ $) "\\axiom{mainContent(\\spad{p})} returns the content of \\axiom{\\spad{p}} viewed as a univariate polynomial in its main variable and with coefficients in the polynomial ring generated by its other variables over \\axiom{\\spad{R}}.")) (|primitivePart!| (($ $) "\\axiom{primitivePart!(\\spad{p})} replaces \\axiom{\\spad{p}} by its primitive part.")) (|gcd| ((|#2| |#2| $) "\\axiom{\\spad{gcd}(\\spad{r},{}\\spad{p})} returns the \\spad{gcd} of \\axiom{\\spad{r}} and the content of \\axiom{\\spad{p}}.")) (|nextsubResultant2| (($ $ $ $ $) "\\axiom{nextsubResultant2(\\spad{p},{}\\spad{q},{}\\spad{z},{}\\spad{s})} is the multivariate version of the operation \\axiomOpFrom{next_sousResultant2}{PseudoRemainderSequence} from the \\axiomType{PseudoRemainderSequence} constructor.")) (|LazardQuotient2| (($ $ $ $ (|NonNegativeInteger|)) "\\axiom{LazardQuotient2(\\spad{p},{}a,{}\\spad{b},{}\\spad{n})} returns \\axiom{(a**(\\spad{n}-1) * \\spad{p}) exquo \\spad{b**}(\\spad{n}-1)} assuming that this quotient does not fail.")) (|LazardQuotient| (($ $ $ (|NonNegativeInteger|)) "\\axiom{LazardQuotient(a,{}\\spad{b},{}\\spad{n})} returns \\axiom{a**n exquo \\spad{b**}(\\spad{n}-1)} assuming that this quotient does not fail.")) (|lastSubResultant| (($ $ $) "\\axiom{lastSubResultant(a,{}\\spad{b})} returns the last non-zero subresultant of \\axiom{a} and \\axiom{\\spad{b}} where \\axiom{a} and \\axiom{\\spad{b}} are assumed to have the same main variable \\axiom{\\spad{v}} and are viewed as univariate polynomials in \\axiom{\\spad{v}}.")) (|subResultantChain| (((|List| $) $ $) "\\axiom{subResultantChain(a,{}\\spad{b})},{} where \\axiom{a} and \\axiom{\\spad{b}} are not contant polynomials with the same main variable,{} returns the subresultant chain of \\axiom{a} and \\axiom{\\spad{b}}.")) (|resultant| (($ $ $) "\\axiom{resultant(a,{}\\spad{b})} computes the resultant of \\axiom{a} and \\axiom{\\spad{b}} where \\axiom{a} and \\axiom{\\spad{b}} are assumed to have the same main variable \\axiom{\\spad{v}} and are viewed as univariate polynomials in \\axiom{\\spad{v}}.")) (|halfExtendedSubResultantGcd2| (((|Record| (|:| |gcd| $) (|:| |coef2| $)) $ $) "\\axiom{halfExtendedSubResultantGcd2(a,{}\\spad{b})} returns \\axiom{[\\spad{g},{}\\spad{cb}]} if \\axiom{extendedSubResultantGcd(a,{}\\spad{b})} returns \\axiom{[\\spad{g},{}ca,{}\\spad{cb}]} otherwise produces an error.")) (|halfExtendedSubResultantGcd1| (((|Record| (|:| |gcd| $) (|:| |coef1| $)) $ $) "\\axiom{halfExtendedSubResultantGcd1(a,{}\\spad{b})} returns \\axiom{[\\spad{g},{}ca]} if \\axiom{extendedSubResultantGcd(a,{}\\spad{b})} returns \\axiom{[\\spad{g},{}ca,{}\\spad{cb}]} otherwise produces an error.")) (|extendedSubResultantGcd| (((|Record| (|:| |gcd| $) (|:| |coef1| $) (|:| |coef2| $)) $ $) "\\axiom{extendedSubResultantGcd(a,{}\\spad{b})} returns \\axiom{[ca,{}\\spad{cb},{}\\spad{r}]} such that \\axiom{\\spad{r}} is \\axiom{subResultantGcd(a,{}\\spad{b})} and we have \\axiom{ca * a + \\spad{cb} * \\spad{cb} = \\spad{r}} .")) (|subResultantGcd| (($ $ $) "\\axiom{subResultantGcd(a,{}\\spad{b})} computes a \\spad{gcd} of \\axiom{a} and \\axiom{\\spad{b}} where \\axiom{a} and \\axiom{\\spad{b}} are assumed to have the same main variable \\axiom{\\spad{v}} and are viewed as univariate polynomials in \\axiom{\\spad{v}} with coefficients in the fraction field of the polynomial ring generated by their other variables over \\axiom{\\spad{R}}.")) (|exactQuotient!| (($ $ $) "\\axiom{exactQuotient!(a,{}\\spad{b})} replaces \\axiom{a} by \\axiom{exactQuotient(a,{}\\spad{b})}") (($ $ |#2|) "\\axiom{exactQuotient!(\\spad{p},{}\\spad{r})} replaces \\axiom{\\spad{p}} by \\axiom{exactQuotient(\\spad{p},{}\\spad{r})}.")) (|exactQuotient| (($ $ $) "\\axiom{exactQuotient(a,{}\\spad{b})} computes the exact quotient of \\axiom{a} by \\axiom{\\spad{b}},{} which is assumed to be a divisor of \\axiom{a}. No error is returned if this exact quotient fails!") (($ $ |#2|) "\\axiom{exactQuotient(\\spad{p},{}\\spad{r})} computes the exact quotient of \\axiom{\\spad{p}} by \\axiom{\\spad{r}},{} which is assumed to be a divisor of \\axiom{\\spad{p}}. No error is returned if this exact quotient fails!")) (|primPartElseUnitCanonical!| (($ $) "\\axiom{primPartElseUnitCanonical!(\\spad{p})} replaces \\axiom{\\spad{p}} by \\axiom{primPartElseUnitCanonical(\\spad{p})}.")) (|primPartElseUnitCanonical| (($ $) "\\axiom{primPartElseUnitCanonical(\\spad{p})} returns \\axiom{primitivePart(\\spad{p})} if \\axiom{\\spad{R}} is a \\spad{gcd}-domain,{} otherwise \\axiom{unitCanonical(\\spad{p})}.")) (|convert| (($ (|Polynomial| |#2|)) "\\axiom{convert(\\spad{p})} returns \\axiom{\\spad{p}} as an element of the current domain if all its variables belong to \\axiom{\\spad{V}},{} otherwise an error is produced.") (($ (|Polynomial| (|Integer|))) "\\axiom{convert(\\spad{p})} returns the same as \\axiom{retract(\\spad{p})}.") (($ (|Polynomial| (|Integer|))) "\\axiom{convert(\\spad{p})} returns the same as \\axiom{retract(\\spad{p})}") (($ (|Polynomial| (|Fraction| (|Integer|)))) "\\axiom{convert(\\spad{p})} returns the same as \\axiom{retract(\\spad{p})}.")) (|retract| (($ (|Polynomial| |#2|)) "\\axiom{retract(\\spad{p})} returns \\axiom{\\spad{p}} as an element of the current domain if \\axiom{retractIfCan(\\spad{p})} does not return \"failed\",{} otherwise an error is produced.") (($ (|Polynomial| |#2|)) "\\axiom{retract(\\spad{p})} returns \\axiom{\\spad{p}} as an element of the current domain if \\axiom{retractIfCan(\\spad{p})} does not return \"failed\",{} otherwise an error is produced.") (($ (|Polynomial| (|Integer|))) "\\axiom{retract(\\spad{p})} returns \\axiom{\\spad{p}} as an element of the current domain if \\axiom{retractIfCan(\\spad{p})} does not return \"failed\",{} otherwise an error is produced.") (($ (|Polynomial| |#2|)) "\\axiom{retract(\\spad{p})} returns \\axiom{\\spad{p}} as an element of the current domain if \\axiom{retractIfCan(\\spad{p})} does not return \"failed\",{} otherwise an error is produced.") (($ (|Polynomial| (|Integer|))) "\\axiom{retract(\\spad{p})} returns \\axiom{\\spad{p}} as an element of the current domain if \\axiom{retractIfCan(\\spad{p})} does not return \"failed\",{} otherwise an error is produced.") (($ (|Polynomial| (|Fraction| (|Integer|)))) "\\axiom{retract(\\spad{p})} returns \\axiom{\\spad{p}} as an element of the current domain if \\axiom{retractIfCan(\\spad{p})} does not return \"failed\",{} otherwise an error is produced.")) (|retractIfCan| (((|Union| $ "failed") (|Polynomial| |#2|)) "\\axiom{retractIfCan(\\spad{p})} returns \\axiom{\\spad{p}} as an element of the current domain if all its variables belong to \\axiom{\\spad{V}}.") (((|Union| $ "failed") (|Polynomial| |#2|)) "\\axiom{retractIfCan(\\spad{p})} returns \\axiom{\\spad{p}} as an element of the current domain if all its variables belong to \\axiom{\\spad{V}}.") (((|Union| $ "failed") (|Polynomial| (|Integer|))) "\\axiom{retractIfCan(\\spad{p})} returns \\axiom{\\spad{p}} as an element of the current domain if all its variables belong to \\axiom{\\spad{V}}.") (((|Union| $ "failed") (|Polynomial| |#2|)) "\\axiom{retractIfCan(\\spad{p})} returns \\axiom{\\spad{p}} as an element of the current domain if all its variables belong to \\axiom{\\spad{V}}.") (((|Union| $ "failed") (|Polynomial| (|Integer|))) "\\axiom{retractIfCan(\\spad{p})} returns \\axiom{\\spad{p}} as an element of the current domain if all its variables belong to \\axiom{\\spad{V}}.") (((|Union| $ "failed") (|Polynomial| (|Fraction| (|Integer|)))) "\\axiom{retractIfCan(\\spad{p})} returns \\axiom{\\spad{p}} as an element of the current domain if all its variables belong to \\axiom{\\spad{V}}.")) (|initiallyReduce| (($ $ $) "\\axiom{initiallyReduce(a,{}\\spad{b})} returns a polynomial \\axiom{\\spad{r}} such that \\axiom{initiallyReduced?(\\spad{r},{}\\spad{b})} holds and there exists an integer \\axiom{\\spad{e}} such that \\axiom{init(\\spad{b})^e a - \\spad{r}} is zero modulo \\axiom{\\spad{b}}.")) (|headReduce| (($ $ $) "\\axiom{headReduce(a,{}\\spad{b})} returns a polynomial \\axiom{\\spad{r}} such that \\axiom{headReduced?(\\spad{r},{}\\spad{b})} holds and there exists an integer \\axiom{\\spad{e}} such that \\axiom{init(\\spad{b})^e a - \\spad{r}} is zero modulo \\axiom{\\spad{b}}.")) (|lazyResidueClass| (((|Record| (|:| |polnum| $) (|:| |polden| $) (|:| |power| (|NonNegativeInteger|))) $ $) "\\axiom{lazyResidueClass(a,{}\\spad{b})} returns \\axiom{[\\spad{p},{}\\spad{q},{}\\spad{n}]} where \\axiom{\\spad{p} / q**n} represents the residue class of \\axiom{a} modulo \\axiom{\\spad{b}} and \\axiom{\\spad{p}} is reduced \\spad{w}.\\spad{r}.\\spad{t}. \\axiom{\\spad{b}} and \\axiom{\\spad{q}} is \\axiom{init(\\spad{b})}.")) (|monicModulo| (($ $ $) "\\axiom{monicModulo(a,{}\\spad{b})} computes \\axiom{a mod \\spad{b}},{} if \\axiom{\\spad{b}} is monic as univariate polynomial in its main variable.")) (|pseudoDivide| (((|Record| (|:| |quotient| $) (|:| |remainder| $)) $ $) "\\axiom{pseudoDivide(a,{}\\spad{b})} computes \\axiom{[pquo(a,{}\\spad{b}),{}prem(a,{}\\spad{b})]},{} both polynomials viewed as univariate polynomials in the main variable of \\axiom{\\spad{b}},{} if \\axiom{\\spad{b}} is not a constant polynomial.")) (|lazyPseudoDivide| (((|Record| (|:| |coef| $) (|:| |gap| (|NonNegativeInteger|)) (|:| |quotient| $) (|:| |remainder| $)) $ $ |#4|) "\\axiom{lazyPseudoDivide(a,{}\\spad{b},{}\\spad{v})} returns \\axiom{[\\spad{c},{}\\spad{g},{}\\spad{q},{}\\spad{r}]} such that \\axiom{\\spad{r} = lazyPrem(a,{}\\spad{b},{}\\spad{v})},{} \\axiom{(c**g)\\spad{*r} = prem(a,{}\\spad{b},{}\\spad{v})} and \\axiom{\\spad{q}} is the pseudo-quotient computed in this lazy pseudo-division.") (((|Record| (|:| |coef| $) (|:| |gap| (|NonNegativeInteger|)) (|:| |quotient| $) (|:| |remainder| $)) $ $) "\\axiom{lazyPseudoDivide(a,{}\\spad{b})} returns \\axiom{[\\spad{c},{}\\spad{g},{}\\spad{q},{}\\spad{r}]} such that \\axiom{[\\spad{c},{}\\spad{g},{}\\spad{r}] = lazyPremWithDefault(a,{}\\spad{b})} and \\axiom{\\spad{q}} is the pseudo-quotient computed in this lazy pseudo-division.")) (|lazyPremWithDefault| (((|Record| (|:| |coef| $) (|:| |gap| (|NonNegativeInteger|)) (|:| |remainder| $)) $ $ |#4|) "\\axiom{lazyPremWithDefault(a,{}\\spad{b},{}\\spad{v})} returns \\axiom{[\\spad{c},{}\\spad{g},{}\\spad{r}]} such that \\axiom{\\spad{r} = lazyPrem(a,{}\\spad{b},{}\\spad{v})} and \\axiom{(c**g)\\spad{*r} = prem(a,{}\\spad{b},{}\\spad{v})}.") (((|Record| (|:| |coef| $) (|:| |gap| (|NonNegativeInteger|)) (|:| |remainder| $)) $ $) "\\axiom{lazyPremWithDefault(a,{}\\spad{b})} returns \\axiom{[\\spad{c},{}\\spad{g},{}\\spad{r}]} such that \\axiom{\\spad{r} = lazyPrem(a,{}\\spad{b})} and \\axiom{(c**g)\\spad{*r} = prem(a,{}\\spad{b})}.")) (|lazyPquo| (($ $ $ |#4|) "\\axiom{lazyPquo(a,{}\\spad{b},{}\\spad{v})} returns the polynomial \\axiom{\\spad{q}} such that \\axiom{lazyPseudoDivide(a,{}\\spad{b},{}\\spad{v})} returns \\axiom{[\\spad{c},{}\\spad{g},{}\\spad{q},{}\\spad{r}]}.") (($ $ $) "\\axiom{lazyPquo(a,{}\\spad{b})} returns the polynomial \\axiom{\\spad{q}} such that \\axiom{lazyPseudoDivide(a,{}\\spad{b})} returns \\axiom{[\\spad{c},{}\\spad{g},{}\\spad{q},{}\\spad{r}]}.")) (|lazyPrem| (($ $ $ |#4|) "\\axiom{lazyPrem(a,{}\\spad{b},{}\\spad{v})} returns the polynomial \\axiom{\\spad{r}} reduced \\spad{w}.\\spad{r}.\\spad{t}. \\axiom{\\spad{b}} viewed as univariate polynomials in the variable \\axiom{\\spad{v}} such that \\axiom{\\spad{b}} divides \\axiom{init(\\spad{b})^e a - \\spad{r}} where \\axiom{\\spad{e}} is the number of steps of this pseudo-division.") (($ $ $) "\\axiom{lazyPrem(a,{}\\spad{b})} returns the polynomial \\axiom{\\spad{r}} reduced \\spad{w}.\\spad{r}.\\spad{t}. \\axiom{\\spad{b}} and such that \\axiom{\\spad{b}} divides \\axiom{init(\\spad{b})^e a - \\spad{r}} where \\axiom{\\spad{e}} is the number of steps of this pseudo-division.")) (|pquo| (($ $ $ |#4|) "\\axiom{pquo(a,{}\\spad{b},{}\\spad{v})} computes the pseudo-quotient of \\axiom{a} by \\axiom{\\spad{b}},{} both viewed as univariate polynomials in \\axiom{\\spad{v}}.") (($ $ $) "\\axiom{pquo(a,{}\\spad{b})} computes the pseudo-quotient of \\axiom{a} by \\axiom{\\spad{b}},{} both viewed as univariate polynomials in the main variable of \\axiom{\\spad{b}}.")) (|prem| (($ $ $ |#4|) "\\axiom{prem(a,{}\\spad{b},{}\\spad{v})} computes the pseudo-remainder of \\axiom{a} by \\axiom{\\spad{b}},{} both viewed as univariate polynomials in \\axiom{\\spad{v}}.") (($ $ $) "\\axiom{prem(a,{}\\spad{b})} computes the pseudo-remainder of \\axiom{a} by \\axiom{\\spad{b}},{} both viewed as univariate polynomials in the main variable of \\axiom{\\spad{b}}.")) (|normalized?| (((|Boolean|) $ (|List| $)) "\\axiom{normalized?(\\spad{q},{}\\spad{lp})} returns \\spad{true} iff \\axiom{normalized?(\\spad{q},{}\\spad{p})} holds for every \\axiom{\\spad{p}} in \\axiom{\\spad{lp}}.") (((|Boolean|) $ $) "\\axiom{normalized?(a,{}\\spad{b})} returns \\spad{true} iff \\axiom{a} and its iterated initials have degree zero \\spad{w}.\\spad{r}.\\spad{t}. the main variable of \\axiom{\\spad{b}}")) (|initiallyReduced?| (((|Boolean|) $ (|List| $)) "\\axiom{initiallyReduced?(\\spad{q},{}\\spad{lp})} returns \\spad{true} iff \\axiom{initiallyReduced?(\\spad{q},{}\\spad{p})} holds for every \\axiom{\\spad{p}} in \\axiom{\\spad{lp}}.") (((|Boolean|) $ $) "\\axiom{initiallyReduced?(a,{}\\spad{b})} returns \\spad{false} iff there exists an iterated initial of \\axiom{a} which is not reduced \\spad{w}.\\spad{r}.\\spad{t} \\axiom{\\spad{b}}.")) (|headReduced?| (((|Boolean|) $ (|List| $)) "\\axiom{headReduced?(\\spad{q},{}\\spad{lp})} returns \\spad{true} iff \\axiom{headReduced?(\\spad{q},{}\\spad{p})} holds for every \\axiom{\\spad{p}} in \\axiom{\\spad{lp}}.") (((|Boolean|) $ $) "\\axiom{headReduced?(a,{}\\spad{b})} returns \\spad{true} iff \\axiom{degree(head(a),{}mvar(\\spad{b})) < mdeg(\\spad{b})}.")) (|reduced?| (((|Boolean|) $ (|List| $)) "\\axiom{reduced?(\\spad{q},{}\\spad{lp})} returns \\spad{true} iff \\axiom{reduced?(\\spad{q},{}\\spad{p})} holds for every \\axiom{\\spad{p}} in \\axiom{\\spad{lp}}.") (((|Boolean|) $ $) "\\axiom{reduced?(a,{}\\spad{b})} returns \\spad{true} iff \\axiom{degree(a,{}mvar(\\spad{b})) < mdeg(\\spad{b})}.")) (|supRittWu?| (((|Boolean|) $ $) "\\axiom{supRittWu?(a,{}\\spad{b})} returns \\spad{true} if \\axiom{a} is greater than \\axiom{\\spad{b}} \\spad{w}.\\spad{r}.\\spad{t}. the Ritt and Wu Wen Tsun ordering using the refinement of Lazard.")) (|infRittWu?| (((|Boolean|) $ $) "\\axiom{infRittWu?(a,{}\\spad{b})} returns \\spad{true} if \\axiom{a} is less than \\axiom{\\spad{b}} \\spad{w}.\\spad{r}.\\spad{t}. the Ritt and Wu Wen Tsun ordering using the refinement of Lazard.")) (|RittWuCompare| (((|Union| (|Boolean|) "failed") $ $) "\\axiom{RittWuCompare(a,{}\\spad{b})} returns \\axiom{\"failed\"} if \\axiom{a} and \\axiom{\\spad{b}} have same rank \\spad{w}.\\spad{r}.\\spad{t}. Ritt and Wu Wen Tsun ordering using the refinement of Lazard,{} otherwise returns \\axiom{infRittWu?(a,{}\\spad{b})}.")) (|mainMonomials| (((|List| $) $) "\\axiom{mainMonomials(\\spad{p})} returns an error if \\axiom{\\spad{p}} is \\axiom{\\spad{O}},{} otherwise,{} if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}} returns [1],{} otherwise returns the list of the monomials of \\axiom{\\spad{p}},{} where \\axiom{\\spad{p}} is viewed as a univariate polynomial in its main variable.")) (|mainCoefficients| (((|List| $) $) "\\axiom{mainCoefficients(\\spad{p})} returns an error if \\axiom{\\spad{p}} is \\axiom{\\spad{O}},{} otherwise,{} if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}} returns [\\spad{p}],{} otherwise returns the list of the coefficients of \\axiom{\\spad{p}},{} where \\axiom{\\spad{p}} is viewed as a univariate polynomial in its main variable.")) (|leastMonomial| (($ $) "\\axiom{leastMonomial(\\spad{p})} returns an error if \\axiom{\\spad{p}} is \\axiom{\\spad{O}},{} otherwise,{} if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}} returns \\axiom{1},{} otherwise,{} the monomial of \\axiom{\\spad{p}} with lowest degree,{} where \\axiom{\\spad{p}} is viewed as a univariate polynomial in its main variable.")) (|mainMonomial| (($ $) "\\axiom{mainMonomial(\\spad{p})} returns an error if \\axiom{\\spad{p}} is \\axiom{\\spad{O}},{} otherwise,{} if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}} returns \\axiom{1},{} otherwise,{} \\axiom{mvar(\\spad{p})} raised to the power \\axiom{mdeg(\\spad{p})}.")) (|quasiMonic?| (((|Boolean|) $) "\\axiom{quasiMonic?(\\spad{p})} returns \\spad{false} if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}},{} otherwise returns \\spad{true} iff the initial of \\axiom{\\spad{p}} lies in the base ring \\axiom{\\spad{R}}.")) (|monic?| (((|Boolean|) $) "\\axiom{monic?(\\spad{p})} returns \\spad{false} if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}},{} otherwise returns \\spad{true} iff \\axiom{\\spad{p}} is monic as a univariate polynomial in its main variable.")) (|reductum| (($ $ |#4|) "\\axiom{reductum(\\spad{p},{}\\spad{v})} returns the reductum of \\axiom{\\spad{p}},{} where \\axiom{\\spad{p}} is viewed as a univariate polynomial in \\axiom{\\spad{v}}.")) (|leadingCoefficient| (($ $ |#4|) "\\axiom{leadingCoefficient(\\spad{p},{}\\spad{v})} returns the leading coefficient of \\axiom{\\spad{p}},{} where \\axiom{\\spad{p}} is viewed as A univariate polynomial in \\axiom{\\spad{v}}.")) (|deepestInitial| (($ $) "\\axiom{deepestInitial(\\spad{p})} returns an error if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}},{} otherwise returns the last term of \\axiom{iteratedInitials(\\spad{p})}.")) (|iteratedInitials| (((|List| $) $) "\\axiom{iteratedInitials(\\spad{p})} returns \\axiom{[]} if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}},{} otherwise returns the list of the iterated initials of \\axiom{\\spad{p}}.")) (|deepestTail| (($ $) "\\axiom{deepestTail(\\spad{p})} returns \\axiom{0} if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}},{} otherwise returns tail(\\spad{p}),{} if \\axiom{tail(\\spad{p})} belongs to \\axiom{\\spad{R}} or \\axiom{mvar(tail(\\spad{p})) < mvar(\\spad{p})},{} otherwise returns \\axiom{deepestTail(tail(\\spad{p}))}.")) (|tail| (($ $) "\\axiom{tail(\\spad{p})} returns its reductum,{} where \\axiom{\\spad{p}} is viewed as a univariate polynomial in its main variable.")) (|head| (($ $) "\\axiom{head(\\spad{p})} returns \\axiom{\\spad{p}} if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}},{} otherwise returns its leading term (monomial in the AXIOM sense),{} where \\axiom{\\spad{p}} is viewed as a univariate polynomial in its main variable.")) (|init| (($ $) "\\axiom{init(\\spad{p})} returns an error if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}},{} otherwise returns its leading coefficient,{} where \\axiom{\\spad{p}} is viewed as a univariate polynomial in its main variable.")) (|mdeg| (((|NonNegativeInteger|) $) "\\axiom{mdeg(\\spad{p})} returns an error if \\axiom{\\spad{p}} is \\axiom{0},{} otherwise,{} if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}} returns \\axiom{0},{} otherwise,{} returns the degree of \\axiom{\\spad{p}} in its main variable.")) (|mvar| ((|#4| $) "\\axiom{mvar(\\spad{p})} returns an error if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}},{} otherwise returns its main variable \\spad{w}. \\spad{r}. \\spad{t}. to the total ordering on the elements in \\axiom{\\spad{V}}."))) 
 NIL 
@@ -3886,7 +3886,7 @@ NIL
 NIL 
 (-989 R E V P) 
 ((|constructor| (NIL "The category of regular triangular sets,{} introduced under the name regular chains in [1] (and other papers). In [3] it is proved that regular triangular sets and towers of simple extensions of a field are equivalent notions. In the following definitions,{} all polynomials and ideals are taken from the polynomial ring \\spad{k[x1,{}...,{}xn]} where \\spad{k} is the fraction field of \\spad{R}. The triangular set \\spad{[t1,{}...,{}tm]} is regular iff for every \\spad{i} the initial of \\spad{ti+1} is invertible in the tower of simple extensions associated with \\spad{[t1,{}...,{}\\spad{ti}]}. A family \\spad{[T1,{}...,{}Ts]} of regular triangular sets is a split of Kalkbrener of a given ideal \\spad{I} iff the radical of \\spad{I} is equal to the intersection of the radical ideals generated by the saturated ideals of the \\spad{[T1,{}...,{}\\spad{Ti}]}. A family \\spad{[T1,{}...,{}Ts]} of regular triangular sets is a split of Kalkbrener of a given triangular set \\spad{T} iff it is a split of Kalkbrener of the saturated ideal of \\spad{T}. Let \\spad{K} be an algebraic closure of \\spad{k}. Assume that \\spad{V} is finite with cardinality \\spad{n} and let \\spad{A} be the affine space \\spad{K^n}. For a regular triangular set \\spad{T} let denote by \\spad{W(T)} the set of regular zeros of \\spad{T}. A family \\spad{[T1,{}...,{}Ts]} of regular triangular sets is a split of Lazard of a given subset \\spad{S} of \\spad{A} iff the union of the \\spad{W(\\spad{Ti})} contains \\spad{S} and is contained in the closure of \\spad{S} (\\spad{w}.\\spad{r}.\\spad{t}. Zariski topology). A family \\spad{[T1,{}...,{}Ts]} of regular triangular sets is a split of Lazard of a given triangular set \\spad{T} if it is a split of Lazard of \\spad{W(T)}. Note that if \\spad{[T1,{}...,{}Ts]} is a split of Lazard of \\spad{T} then it is also a split of Kalkbrener of \\spad{T}. The converse is \\spad{false}. This category provides operations related to both kinds of splits,{} the former being related to ideals decomposition whereas the latter deals with varieties decomposition. See the example illustrating the \\spadtype{RegularTriangularSet} constructor for more explanations about decompositions by means of regular triangular sets. \\newline References : \\indented{1}{[1] \\spad{M}. KALKBRENER \"Three contributions to elimination theory\"} \\indented{5}{\\spad{Phd} Thesis,{} University of Linz,{} Austria,{} 1991.} \\indented{1}{[2] \\spad{M}. KALKBRENER \"Algorithmic properties of polynomial rings\"} \\indented{5}{Journal of Symbol. Comp. 1998} \\indented{1}{[3] \\spad{P}. AUBRY,{} \\spad{D}. LAZARD and \\spad{M}. MORENO MAZA \"On the Theories} \\indented{5}{of Triangular Sets\" Journal of Symbol. Comp. (to appear)} \\indented{1}{[4] \\spad{M}. MORENO MAZA \"A new algorithm for computing triangular} \\indented{5}{decomposition of algebraic varieties\" NAG Tech. Rep. 4/98.}")) (|zeroSetSplit| (((|List| $) (|List| |#4|) (|Boolean|)) "\\spad{zeroSetSplit(lp,{}clos?)} returns \\spad{lts} a split of Kalkbrener of the radical ideal associated with \\spad{lp}. If \\spad{clos?} is \\spad{false},{} it is also a decomposition of the variety associated with \\spad{lp} into the regular zero set of the \\spad{ts} in \\spad{lts} (or,{} in other words,{} a split of Lazard of this variety). See the example illustrating the \\spadtype{RegularTriangularSet} constructor for more explanations about decompositions by means of regular triangular sets.")) (|extend| (((|List| $) (|List| |#4|) (|List| $)) "\\spad{extend(lp,{}lts)} returns the same as \\spad{concat([extend(lp,{}ts) for ts in lts])|}") (((|List| $) (|List| |#4|) $) "\\spad{extend(lp,{}ts)} returns \\spad{ts} if \\spad{empty? lp} \\spad{extend(p,{}ts)} if \\spad{lp = [p]} else \\spad{extend(first lp,{} extend(rest lp,{} ts))}") (((|List| $) |#4| (|List| $)) "\\spad{extend(p,{}lts)} returns the same as \\spad{concat([extend(p,{}ts) for ts in lts])|}") (((|List| $) |#4| $) "\\spad{extend(p,{}ts)} assumes that \\spad{p} is a non-constant polynomial whose main variable is greater than any variable of \\spad{ts}. Then it returns a split of Kalkbrener of \\spad{ts+p}. This may not be \\spad{ts+p} itself,{} if for instance \\spad{ts+p} is not a regular triangular set.")) (|internalAugment| (($ (|List| |#4|) $) "\\spad{internalAugment(lp,{}ts)} returns \\spad{ts} if \\spad{lp} is empty otherwise returns \\spad{internalAugment(rest lp,{} internalAugment(first lp,{} ts))}") (($ |#4| $) "\\spad{internalAugment(p,{}ts)} assumes that \\spad{augment(p,{}ts)} returns a singleton and returns it.")) (|augment| (((|List| $) (|List| |#4|) (|List| $)) "\\spad{augment(lp,{}lts)} returns the same as \\spad{concat([augment(lp,{}ts) for ts in lts])}") (((|List| $) (|List| |#4|) $) "\\spad{augment(lp,{}ts)} returns \\spad{ts} if \\spad{empty? lp},{} \\spad{augment(p,{}ts)} if \\spad{lp = [p]},{} otherwise \\spad{augment(first lp,{} augment(rest lp,{} ts))}") (((|List| $) |#4| (|List| $)) "\\spad{augment(p,{}lts)} returns the same as \\spad{concat([augment(p,{}ts) for ts in lts])}") (((|List| $) |#4| $) "\\spad{augment(p,{}ts)} assumes that \\spad{p} is a non-constant polynomial whose main variable is greater than any variable of \\spad{ts}. This operation assumes also that if \\spad{p} is added to \\spad{ts} the resulting set,{} say \\spad{ts+p},{} is a regular triangular set. Then it returns a split of Kalkbrener of \\spad{ts+p}. This may not be \\spad{ts+p} itself,{} if for instance \\spad{ts+p} is required to be square-free.")) (|intersect| (((|List| $) |#4| (|List| $)) "\\spad{intersect(p,{}lts)} returns the same as \\spad{intersect([p],{}lts)}") (((|List| $) (|List| |#4|) (|List| $)) "\\spad{intersect(lp,{}lts)} returns the same as \\spad{concat([intersect(lp,{}ts) for ts in lts])|}") (((|List| $) (|List| |#4|) $) "\\spad{intersect(lp,{}ts)} returns \\spad{lts} a split of Lazard of the intersection of the affine variety associated with \\spad{lp} and the regular zero set of \\spad{ts}.") (((|List| $) |#4| $) "\\spad{intersect(p,{}ts)} returns the same as \\spad{intersect([p],{}ts)}")) (|squareFreePart| (((|List| (|Record| (|:| |val| |#4|) (|:| |tower| $))) |#4| $) "\\spad{squareFreePart(p,{}ts)} returns \\spad{lpwt} such that \\spad{lpwt.i.val} is a square-free polynomial \\spad{w}.\\spad{r}.\\spad{t}. \\spad{lpwt.i.tower},{} this polynomial being associated with \\spad{p} modulo \\spad{lpwt.i.tower},{} for every \\spad{i}. Moreover,{} the list of the \\spad{lpwt.i.tower} is a split of Kalkbrener of \\spad{ts}. WARNING: This assumes that \\spad{p} is a non-constant polynomial such that if \\spad{p} is added to \\spad{ts},{} then the resulting set is a regular triangular set.")) (|lastSubResultant| (((|List| (|Record| (|:| |val| |#4|) (|:| |tower| $))) |#4| |#4| $) "\\spad{lastSubResultant(p1,{}p2,{}ts)} returns \\spad{lpwt} such that \\spad{lpwt.i.val} is a quasi-monic \\spad{gcd} of \\spad{p1} and \\spad{p2} \\spad{w}.\\spad{r}.\\spad{t}. \\spad{lpwt.i.tower},{} for every \\spad{i},{} and such that the list of the \\spad{lpwt.i.tower} is a split of Kalkbrener of \\spad{ts}. Moreover,{} if \\spad{p1} and \\spad{p2} do not have a non-trivial \\spad{gcd} \\spad{w}.\\spad{r}.\\spad{t}. \\spad{lpwt.i.tower} then \\spad{lpwt.i.val} is the resultant of these polynomials \\spad{w}.\\spad{r}.\\spad{t}. \\spad{lpwt.i.tower}. This assumes that \\spad{p1} and \\spad{p2} have the same maim variable and that this variable is greater that any variable occurring in \\spad{ts}.")) (|lastSubResultantElseSplit| (((|Union| |#4| (|List| $)) |#4| |#4| $) "\\spad{lastSubResultantElseSplit(p1,{}p2,{}ts)} returns either \\spad{g} a quasi-monic \\spad{gcd} of \\spad{p1} and \\spad{p2} \\spad{w}.\\spad{r}.\\spad{t}. the \\spad{ts} or a split of Kalkbrener of \\spad{ts}. This assumes that \\spad{p1} and \\spad{p2} have the same maim variable and that this variable is greater that any variable occurring in \\spad{ts}.")) (|invertibleSet| (((|List| $) |#4| $) "\\spad{invertibleSet(p,{}ts)} returns a split of Kalkbrener of the quotient ideal of the ideal \\axiom{\\spad{I}} by \\spad{p} where \\spad{I} is the radical of saturated of \\spad{ts}.")) (|invertible?| (((|Boolean|) |#4| $) "\\spad{invertible?(p,{}ts)} returns \\spad{true} iff \\spad{p} is invertible in the tower associated with \\spad{ts}.") (((|List| (|Record| (|:| |val| (|Boolean|)) (|:| |tower| $))) |#4| $) "\\spad{invertible?(p,{}ts)} returns \\spad{lbwt} where \\spad{lbwt.i} is the result of \\spad{invertibleElseSplit?(p,{}lbwt.i.tower)} and the list of the \\spad{(lqrwt.i).tower} is a split of Kalkbrener of \\spad{ts}.")) (|invertibleElseSplit?| (((|Union| (|Boolean|) (|List| $)) |#4| $) "\\spad{invertibleElseSplit?(p,{}ts)} returns \\spad{true} (resp. \\spad{false}) if \\spad{p} is invertible in the tower associated with \\spad{ts} or returns a split of Kalkbrener of \\spad{ts}.")) (|purelyAlgebraicLeadingMonomial?| (((|Boolean|) |#4| $) "\\spad{purelyAlgebraicLeadingMonomial?(p,{}ts)} returns \\spad{true} iff the main variable of any non-constant iterarted initial of \\spad{p} is algebraic \\spad{w}.\\spad{r}.\\spad{t}. \\spad{ts}.")) (|algebraicCoefficients?| (((|Boolean|) |#4| $) "\\spad{algebraicCoefficients?(p,{}ts)} returns \\spad{true} iff every variable of \\spad{p} which is not the main one of \\spad{p} is algebraic \\spad{w}.\\spad{r}.\\spad{t}. \\spad{ts}.")) (|purelyTranscendental?| (((|Boolean|) |#4| $) "\\spad{purelyTranscendental?(p,{}ts)} returns \\spad{true} iff every variable of \\spad{p} is not algebraic \\spad{w}.\\spad{r}.\\spad{t}. \\spad{ts}")) (|purelyAlgebraic?| (((|Boolean|) $) "\\spad{purelyAlgebraic?(ts)} returns \\spad{true} iff for every algebraic variable \\spad{v} of \\spad{ts} we have \\spad{algebraicCoefficients?(t_v,{}ts_v_-)} where \\spad{ts_v} is \\axiomOpFrom{select}{TriangularSetCategory}(\\spad{ts},{}\\spad{v}) and \\spad{ts_v_-} is \\axiomOpFrom{collectUnder}{TriangularSetCategory}(\\spad{ts},{}\\spad{v}).") (((|Boolean|) |#4| $) "\\spad{purelyAlgebraic?(p,{}ts)} returns \\spad{true} iff every variable of \\spad{p} is algebraic \\spad{w}.\\spad{r}.\\spad{t}. \\spad{ts}."))) 
-((-4234 . T) (-4233 . T) (-2046 . T)) 
+((-4234 . T) (-4233 . T) (-2092 . T)) 
 NIL 
 (-990 R E V P TS) 
 ((|constructor| (NIL "An internal package for computing gcds and resultants of univariate polynomials with coefficients in a tower of simple extensions of a field.\\newline References : \\indented{1}{[1] \\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}{[2] \\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.} \\indented{1}{[3] \\spad{M}. MORENO MAZA \"A new algorithm for computing triangular} \\indented{5}{decomposition of algebraic varieties\" NAG Tech. Rep. 4/98.}")) (|toseSquareFreePart| (((|List| (|Record| (|:| |val| |#4|) (|:| |tower| |#5|))) |#4| |#5|) "\\axiom{toseSquareFreePart(\\spad{p},{}\\spad{ts})} has the same specifications as \\axiomOpFrom{squareFreePart}{RegularTriangularSetCategory}.")) (|toseInvertibleSet| (((|List| |#5|) |#4| |#5|) "\\axiom{toseInvertibleSet(\\spad{p1},{}\\spad{p2},{}\\spad{ts})} has the same specifications as \\axiomOpFrom{invertibleSet}{RegularTriangularSetCategory}.")) (|toseInvertible?| (((|List| (|Record| (|:| |val| (|Boolean|)) (|:| |tower| |#5|))) |#4| |#5|) "\\axiom{toseInvertible?(\\spad{p1},{}\\spad{p2},{}\\spad{ts})} has the same specifications as \\axiomOpFrom{invertible?}{RegularTriangularSetCategory}.") (((|Boolean|) |#4| |#5|) "\\axiom{toseInvertible?(\\spad{p1},{}\\spad{p2},{}\\spad{ts})} has the same specifications as \\axiomOpFrom{invertible?}{RegularTriangularSetCategory}.")) (|toseLastSubResultant| (((|List| (|Record| (|:| |val| |#4|) (|:| |tower| |#5|))) |#4| |#4| |#5|) "\\axiom{toseLastSubResultant(\\spad{p1},{}\\spad{p2},{}\\spad{ts})} has the same specifications as \\axiomOpFrom{lastSubResultant}{RegularTriangularSetCategory}.")) (|integralLastSubResultant| (((|List| (|Record| (|:| |val| |#4|) (|:| |tower| |#5|))) |#4| |#4| |#5|) "\\axiom{integralLastSubResultant(\\spad{p1},{}\\spad{p2},{}\\spad{ts})} is an internal subroutine,{} exported only for developement.")) (|internalLastSubResultant| (((|List| (|Record| (|:| |val| |#4|) (|:| |tower| |#5|))) (|List| (|Record| (|:| |val| (|List| |#4|)) (|:| |tower| |#5|))) |#3| (|Boolean|)) "\\axiom{internalLastSubResultant(lpwt,{}\\spad{v},{}flag)} is an internal subroutine,{} exported only for developement.") (((|List| (|Record| (|:| |val| |#4|) (|:| |tower| |#5|))) |#4| |#4| |#5| (|Boolean|) (|Boolean|)) "\\axiom{internalLastSubResultant(\\spad{p1},{}\\spad{p2},{}\\spad{ts},{}inv?,{}break?)} is an internal subroutine,{} exported only for developement.")) (|prepareSubResAlgo| (((|List| (|Record| (|:| |val| (|List| |#4|)) (|:| |tower| |#5|))) |#4| |#4| |#5|) "\\axiom{prepareSubResAlgo(\\spad{p1},{}\\spad{p2},{}\\spad{ts})} is an internal subroutine,{} exported only for developement.")) (|stopTableInvSet!| (((|Void|)) "\\axiom{stopTableInvSet!()} is an internal subroutine,{} exported only for developement.")) (|startTableInvSet!| (((|Void|) (|String|) (|String|) (|String|)) "\\axiom{startTableInvSet!(\\spad{s1},{}\\spad{s2},{}\\spad{s3})} is an internal subroutine,{} exported only for developement.")) (|stopTableGcd!| (((|Void|)) "\\axiom{stopTableGcd!()} is an internal subroutine,{} exported only for developement.")) (|startTableGcd!| (((|Void|) (|String|) (|String|) (|String|)) "\\axiom{startTableGcd!(\\spad{s1},{}\\spad{s2},{}\\spad{s3})} is an internal subroutine,{} exported only for developement."))) 
@@ -3915,7 +3915,7 @@ NIL
 (-996 R UP M) 
 ((|constructor| (NIL "Domain which represents simple algebraic extensions of arbitrary rings. The first argument to the domain,{} \\spad{R},{} is the underlying ring,{} the second argument is a domain of univariate polynomials over \\spad{K},{} while the last argument specifies the defining minimal polynomial. The elements of the domain are canonically represented as polynomials of degree less than that of the minimal polynomial with coefficients in \\spad{R}. The second argument is both the type of the third argument and the underlying representation used by \\spadtype{SAE} itself."))) 
 ((-4226 |has| |#1| (-337)) (-4231 |has| |#1| (-337)) (-4225 |has| |#1| (-337)) ((-4235 "*") . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
-((|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-323))) (|HasCategory| |#1| (QUOTE (-337))) (-3703 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-323)))) (|HasCategory| |#1| (QUOTE (-342))) (|HasCategory| |#1| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (LIST (QUOTE -829) (QUOTE (-1084))))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (LIST (QUOTE -829) (QUOTE (-1084))))) (-12 (|HasCategory| |#1| (QUOTE (-323))) (|HasCategory| |#1| (LIST (QUOTE -829) (QUOTE (-1084)))))) (-3703 (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| |#1| (QUOTE (-210))) (|HasCategory| |#1| (QUOTE (-337)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-210))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasCategory| |#1| (QUOTE (-323))))) 
+((|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-323))) (|HasCategory| |#1| (QUOTE (-337))) (-3703 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-323)))) (|HasCategory| |#1| (QUOTE (-342))) (|HasCategory| |#1| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1084))))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1084))))) (-12 (|HasCategory| |#1| (QUOTE (-323))) (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1084)))))) (-3703 (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| |#1| (QUOTE (-210))) (|HasCategory| |#1| (QUOTE (-337)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-210))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasCategory| |#1| (QUOTE (-323))))) 
 (-997 UP SAE UPA) 
 ((|constructor| (NIL "Factorization of univariate polynomials with coefficients in an algebraic extension of \\spadtype{Fraction Polynomial Integer}.")) (|factor| (((|Factored| |#3|) |#3|) "\\spad{factor(p)} returns a prime factorisation of \\spad{p}."))) 
 NIL 
@@ -3939,7 +3939,7 @@ NIL
 (-1002 R) 
 ((|constructor| (NIL "\\spadtype{SequentialDifferentialPolynomial} implements an ordinary differential polynomial ring in arbitrary number of differential indeterminates,{} with coefficients in a ring. The ranking on the differential indeterminate is sequential. \\blankline"))) 
 (((-4235 "*") |has| |#1| (-157)) (-4226 |has| |#1| (-513)) (-4231 |has| |#1| (-6 -4231)) (-4228 . T) (-4227 . T) (-4230 . T)) 
-((|HasCategory| |#1| (QUOTE (-838))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-157))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-513)))) (-12 (|HasCategory| (-1003 (-1084)) (LIST (QUOTE -815) (QUOTE (-353)))) (|HasCategory| |#1| (LIST (QUOTE -815) (QUOTE (-353))))) (-12 (|HasCategory| (-1003 (-1084)) (LIST (QUOTE -815) (QUOTE (-521)))) (|HasCategory| |#1| (LIST (QUOTE -815) (QUOTE (-521))))) (-12 (|HasCategory| (-1003 (-1084)) (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-353))))) (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-353)))))) (-12 (|HasCategory| (-1003 (-1084)) (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521)))))) (-12 (|HasCategory| (-1003 (-1084)) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497))))) (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| |#1| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-210))) (|HasCategory| |#1| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#1| (QUOTE (-337))) (-3703 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521)))))) (|HasAttribute| |#1| (QUOTE -4231)) (|HasCategory| |#1| (QUOTE (-425))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-838)))) (-3703 (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-838)))) (-3703 (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-838)))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-838)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-838)))) (|HasCategory| |#1| (QUOTE (-133))))) 
+((|HasCategory| |#1| (QUOTE (-837))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-157))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-513)))) (-12 (|HasCategory| (-1003 (-1084)) (LIST (QUOTE -814) (QUOTE (-353)))) (|HasCategory| |#1| (LIST (QUOTE -814) (QUOTE (-353))))) (-12 (|HasCategory| (-1003 (-1084)) (LIST (QUOTE -814) (QUOTE (-521)))) (|HasCategory| |#1| (LIST (QUOTE -814) (QUOTE (-521))))) (-12 (|HasCategory| (-1003 (-1084)) (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-353))))) (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-353)))))) (-12 (|HasCategory| (-1003 (-1084)) (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521)))))) (-12 (|HasCategory| (-1003 (-1084)) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497))))) (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#1| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-210))) (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#1| (QUOTE (-337))) (-3703 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521)))))) (|HasAttribute| |#1| (QUOTE -4231)) (|HasCategory| |#1| (QUOTE (-425))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-837)))) (-3703 (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-837)))) (-3703 (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-837)))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-837)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-837)))) (|HasCategory| |#1| (QUOTE (-133))))) 
 (-1003 S) 
 ((|constructor| (NIL "\\spadtype{OrderlyDifferentialVariable} adds a commonly used sequential ranking to the set of derivatives of an ordered list of differential indeterminates. A sequential ranking is a ranking \\spadfun{<} of the derivatives with the property that for any derivative \\spad{v},{} there are only a finite number of derivatives \\spad{u} with \\spad{u} \\spadfun{<} \\spad{v}. This domain belongs to \\spadtype{DifferentialVariableCategory}. It defines \\spadfun{weight} to be just \\spadfun{order},{} and it defines a sequential ranking \\spadfun{<} on derivatives \\spad{u} by the lexicographic order on the pair (\\spadfun{variable}(\\spad{u}),{} \\spadfun{order}(\\spad{u}))."))) 
 NIL 
@@ -3947,7 +3947,7 @@ NIL
 (-1004 R S) 
 ((|constructor| (NIL "This package provides operations for mapping functions onto segments.")) (|map| (((|List| |#2|) (|Mapping| |#2| |#1|) (|Segment| |#1|)) "\\spad{map(f,{}s)} expands the segment \\spad{s},{} applying \\spad{f} to each value. For example,{} if \\spad{s = l..h by k},{} then the list \\spad{[f(l),{} f(l+k),{}...,{} f(lN)]} is computed,{} where \\spad{lN <= h < lN+k}.") (((|Segment| |#2|) (|Mapping| |#2| |#1|) (|Segment| |#1|)) "\\spad{map(f,{}l..h)} returns a new segment \\spad{f(l)..f(h)}."))) 
 NIL 
-((|HasCategory| |#1| (QUOTE (-782)))) 
+((|HasCategory| |#1| (QUOTE (-781)))) 
 (-1005 R S) 
 ((|constructor| (NIL "This package provides operations for mapping functions onto \\spadtype{SegmentBinding}\\spad{s}.")) (|map| (((|SegmentBinding| |#2|) (|Mapping| |#2| |#1|) (|SegmentBinding| |#1|)) "\\spad{map(f,{}v=a..b)} returns the value given by \\spad{v=f(a)..f(b)}."))) 
 NIL 
@@ -3958,15 +3958,15 @@ NIL
 ((|HasCategory| |#1| (QUOTE (-1013)))) 
 (-1007 S) 
 ((|constructor| (NIL "This category provides operations on ranges,{} or {\\em segments} as they are called.")) (|convert| (($ |#1|) "\\spad{convert(i)} creates the segment \\spad{i..i}.")) (|segment| (($ |#1| |#1|) "\\spad{segment(i,{}j)} is an alternate way to create the segment \\spad{i..j}.")) (|incr| (((|Integer|) $) "\\spad{incr(s)} returns \\spad{n},{} where \\spad{s} is a segment in which every \\spad{n}\\spad{-}th element is used. Note: \\spad{incr(l..h by n) = n}.")) (|high| ((|#1| $) "\\spad{high(s)} returns the second endpoint of \\spad{s}. Note: \\spad{high(l..h) = h}.")) (|low| ((|#1| $) "\\spad{low(s)} returns the first endpoint of \\spad{s}. Note: \\spad{low(l..h) = l}.")) (|hi| ((|#1| $) "\\spad{\\spad{hi}(s)} returns the second endpoint of \\spad{s}. Note: \\spad{\\spad{hi}(l..h) = h}.")) (|lo| ((|#1| $) "\\spad{lo(s)} returns the first endpoint of \\spad{s}. Note: \\spad{lo(l..h) = l}.")) (BY (($ $ (|Integer|)) "\\spad{s by n} creates a new segment in which only every \\spad{n}\\spad{-}th element is used.")) (SEGMENT (($ |#1| |#1|) "\\spad{l..h} creates a segment with \\spad{l} and \\spad{h} as the endpoints."))) 
-((-2046 . T)) 
+((-2092 . T)) 
 NIL 
 (-1008 S) 
 ((|constructor| (NIL "This type is used to specify a range of values from type \\spad{S}."))) 
 NIL 
-((|HasCategory| |#1| (QUOTE (-782))) (|HasCategory| |#1| (QUOTE (-1013)))) 
+((|HasCategory| |#1| (QUOTE (-781))) (|HasCategory| |#1| (QUOTE (-1013)))) 
 (-1009 S L) 
 ((|constructor| (NIL "This category provides an interface for expanding segments to a stream of elements.")) (|map| ((|#2| (|Mapping| |#1| |#1|) $) "\\spad{map(f,{}l..h by k)} produces a value of type \\spad{L} by applying \\spad{f} to each of the succesive elements of the segment,{} that is,{} \\spad{[f(l),{} f(l+k),{} ...,{} f(lN)]},{} where \\spad{lN <= h < lN+k}.")) (|expand| ((|#2| $) "\\spad{expand(l..h by k)} creates value of type \\spad{L} with elements \\spad{l,{} l+k,{} ... lN} where \\spad{lN <= h < lN+k}. For example,{} \\spad{expand(1..5 by 2) = [1,{}3,{}5]}.") ((|#2| (|List| $)) "\\spad{expand(l)} creates a new value of type \\spad{L} in which each segment \\spad{l..h by k} is replaced with \\spad{l,{} l+k,{} ... lN},{} where \\spad{lN <= h < lN+k}. For example,{} \\spad{expand [1..4,{} 7..9] = [1,{}2,{}3,{}4,{}7,{}8,{}9]}."))) 
-((-2046 . T)) 
+((-2092 . T)) 
 NIL 
 (-1010 A S) 
 ((|constructor| (NIL "A set category lists a collection of set-theoretic operations useful for both finite sets and multisets. Note however that finite sets are distinct from multisets. Although the operations defined for set categories are common to both,{} the relationship between the two cannot be described by inclusion or inheritance.")) (|union| (($ |#2| $) "\\spad{union(x,{}u)} returns the set aggregate \\spad{u} with the element \\spad{x} added. If \\spad{u} already contains \\spad{x},{} \\axiom{union(\\spad{x},{}\\spad{u})} returns a copy of \\spad{u}.") (($ $ |#2|) "\\spad{union(u,{}x)} returns the set aggregate \\spad{u} with the element \\spad{x} added. If \\spad{u} already contains \\spad{x},{} \\axiom{union(\\spad{u},{}\\spad{x})} returns a copy of \\spad{u}.") (($ $ $) "\\spad{union(u,{}v)} returns the set aggregate of elements which are members of either set aggregate \\spad{u} or \\spad{v}.")) (|subset?| (((|Boolean|) $ $) "\\spad{subset?(u,{}v)} tests if \\spad{u} is a subset of \\spad{v}. Note: equivalent to \\axiom{reduce(and,{}{member?(\\spad{x},{}\\spad{v}) for \\spad{x} in \\spad{u}},{}\\spad{true},{}\\spad{false})}.")) (|symmetricDifference| (($ $ $) "\\spad{symmetricDifference(u,{}v)} returns the set aggregate of elements \\spad{x} which are members of set aggregate \\spad{u} or set aggregate \\spad{v} but not both. If \\spad{u} and \\spad{v} have no elements in common,{} \\axiom{symmetricDifference(\\spad{u},{}\\spad{v})} returns a copy of \\spad{u}. Note: \\axiom{symmetricDifference(\\spad{u},{}\\spad{v}) = union(difference(\\spad{u},{}\\spad{v}),{}difference(\\spad{v},{}\\spad{u}))}")) (|difference| (($ $ |#2|) "\\spad{difference(u,{}x)} returns the set aggregate \\spad{u} with element \\spad{x} removed. If \\spad{u} does not contain \\spad{x},{} a copy of \\spad{u} is returned. Note: \\axiom{difference(\\spad{s},{} \\spad{x}) = difference(\\spad{s},{} {\\spad{x}})}.") (($ $ $) "\\spad{difference(u,{}v)} returns the set aggregate \\spad{w} consisting of elements in set aggregate \\spad{u} but not in set aggregate \\spad{v}. If \\spad{u} and \\spad{v} have no elements in common,{} \\axiom{difference(\\spad{u},{}\\spad{v})} returns a copy of \\spad{u}. Note: equivalent to the notation (not currently supported) \\axiom{{\\spad{x} for \\spad{x} in \\spad{u} | not member?(\\spad{x},{}\\spad{v})}}.")) (|intersect| (($ $ $) "\\spad{intersect(u,{}v)} returns the set aggregate \\spad{w} consisting of elements common to both set aggregates \\spad{u} and \\spad{v}. Note: equivalent to the notation (not currently supported) {\\spad{x} for \\spad{x} in \\spad{u} | member?(\\spad{x},{}\\spad{v})}.")) (|set| (($ (|List| |#2|)) "\\spad{set([x,{}y,{}...,{}z])} creates a set aggregate containing items \\spad{x},{}\\spad{y},{}...,{}\\spad{z}.") (($) "\\spad{set()}\\$\\spad{D} creates an empty set aggregate of type \\spad{D}.")) (|brace| (($ (|List| |#2|)) "\\spad{brace([x,{}y,{}...,{}z])} creates a set aggregate containing items \\spad{x},{}\\spad{y},{}...,{}\\spad{z}. This form is considered obsolete. Use \\axiomFun{set} instead.") (($) "\\spad{brace()}\\$\\spad{D} (otherwise written {}\\$\\spad{D}) creates an empty set aggregate of type \\spad{D}. This form is considered obsolete. Use \\axiomFun{set} instead.")) (< (((|Boolean|) $ $) "\\spad{s < t} returns \\spad{true} if all elements of set aggregate \\spad{s} are also elements of set aggregate \\spad{t}."))) 
@@ -3974,7 +3974,7 @@ NIL
 NIL 
 (-1011 S) 
 ((|constructor| (NIL "A set category lists a collection of set-theoretic operations useful for both finite sets and multisets. Note however that finite sets are distinct from multisets. Although the operations defined for set categories are common to both,{} the relationship between the two cannot be described by inclusion or inheritance.")) (|union| (($ |#1| $) "\\spad{union(x,{}u)} returns the set aggregate \\spad{u} with the element \\spad{x} added. If \\spad{u} already contains \\spad{x},{} \\axiom{union(\\spad{x},{}\\spad{u})} returns a copy of \\spad{u}.") (($ $ |#1|) "\\spad{union(u,{}x)} returns the set aggregate \\spad{u} with the element \\spad{x} added. If \\spad{u} already contains \\spad{x},{} \\axiom{union(\\spad{u},{}\\spad{x})} returns a copy of \\spad{u}.") (($ $ $) "\\spad{union(u,{}v)} returns the set aggregate of elements which are members of either set aggregate \\spad{u} or \\spad{v}.")) (|subset?| (((|Boolean|) $ $) "\\spad{subset?(u,{}v)} tests if \\spad{u} is a subset of \\spad{v}. Note: equivalent to \\axiom{reduce(and,{}{member?(\\spad{x},{}\\spad{v}) for \\spad{x} in \\spad{u}},{}\\spad{true},{}\\spad{false})}.")) (|symmetricDifference| (($ $ $) "\\spad{symmetricDifference(u,{}v)} returns the set aggregate of elements \\spad{x} which are members of set aggregate \\spad{u} or set aggregate \\spad{v} but not both. If \\spad{u} and \\spad{v} have no elements in common,{} \\axiom{symmetricDifference(\\spad{u},{}\\spad{v})} returns a copy of \\spad{u}. Note: \\axiom{symmetricDifference(\\spad{u},{}\\spad{v}) = union(difference(\\spad{u},{}\\spad{v}),{}difference(\\spad{v},{}\\spad{u}))}")) (|difference| (($ $ |#1|) "\\spad{difference(u,{}x)} returns the set aggregate \\spad{u} with element \\spad{x} removed. If \\spad{u} does not contain \\spad{x},{} a copy of \\spad{u} is returned. Note: \\axiom{difference(\\spad{s},{} \\spad{x}) = difference(\\spad{s},{} {\\spad{x}})}.") (($ $ $) "\\spad{difference(u,{}v)} returns the set aggregate \\spad{w} consisting of elements in set aggregate \\spad{u} but not in set aggregate \\spad{v}. If \\spad{u} and \\spad{v} have no elements in common,{} \\axiom{difference(\\spad{u},{}\\spad{v})} returns a copy of \\spad{u}. Note: equivalent to the notation (not currently supported) \\axiom{{\\spad{x} for \\spad{x} in \\spad{u} | not member?(\\spad{x},{}\\spad{v})}}.")) (|intersect| (($ $ $) "\\spad{intersect(u,{}v)} returns the set aggregate \\spad{w} consisting of elements common to both set aggregates \\spad{u} and \\spad{v}. Note: equivalent to the notation (not currently supported) {\\spad{x} for \\spad{x} in \\spad{u} | member?(\\spad{x},{}\\spad{v})}.")) (|set| (($ (|List| |#1|)) "\\spad{set([x,{}y,{}...,{}z])} creates a set aggregate containing items \\spad{x},{}\\spad{y},{}...,{}\\spad{z}.") (($) "\\spad{set()}\\$\\spad{D} creates an empty set aggregate of type \\spad{D}.")) (|brace| (($ (|List| |#1|)) "\\spad{brace([x,{}y,{}...,{}z])} creates a set aggregate containing items \\spad{x},{}\\spad{y},{}...,{}\\spad{z}. This form is considered obsolete. Use \\axiomFun{set} instead.") (($) "\\spad{brace()}\\$\\spad{D} (otherwise written {}\\$\\spad{D}) creates an empty set aggregate of type \\spad{D}. This form is considered obsolete. Use \\axiomFun{set} instead.")) (< (((|Boolean|) $ $) "\\spad{s < t} returns \\spad{true} if all elements of set aggregate \\spad{s} are also elements of set aggregate \\spad{t}."))) 
-((-4223 . T) (-2046 . T)) 
+((-4223 . T) (-2092 . T)) 
 NIL 
 (-1012 S) 
 ((|constructor| (NIL "\\spadtype{SetCategory} is the basic category for describing a collection of elements with \\spadop{=} (equality) and \\spadfun{coerce} to output form. \\blankline Conditional Attributes: \\indented{3}{canonical\\tab{15}data structure equality is the same as \\spadop{=}}")) (|latex| (((|String|) $) "\\spad{latex(s)} returns a LaTeX-printable output representation of \\spad{s}.")) (|hash| (((|SingleInteger|) $) "\\spad{hash(s)} calculates a hash code for \\spad{s}."))) 
@@ -3991,7 +3991,7 @@ NIL
 (-1015 S) 
 ((|constructor| (NIL "A set over a domain \\spad{D} models the usual mathematical notion of a finite set of elements from \\spad{D}. Sets are unordered collections of distinct elements (that is,{} order and duplication does not matter). The notation \\spad{set [a,{}b,{}c]} can be used to create a set and the usual operations such as union and intersection are available to form new sets. In our implementation,{} \\Language{} maintains the entries in sorted order. Specifically,{} the parts function returns the entries as a list in ascending order and the extract operation returns the maximum entry. Given two sets \\spad{s} and \\spad{t} where \\spad{\\#s = m} and \\spad{\\#t = n},{} the complexity of \\indented{2}{\\spad{s = t} is \\spad{O(min(n,{}m))}} \\indented{2}{\\spad{s < t} is \\spad{O(max(n,{}m))}} \\indented{2}{\\spad{union(s,{}t)},{} \\spad{intersect(s,{}t)},{} \\spad{minus(s,{}t)},{} \\spad{symmetricDifference(s,{}t)} is \\spad{O(max(n,{}m))}} \\indented{2}{\\spad{member(x,{}t)} is \\spad{O(n log n)}} \\indented{2}{\\spad{insert(x,{}t)} and \\spad{remove(x,{}t)} is \\spad{O(n)}}"))) 
 ((-4233 . T) (-4223 . T) (-4234 . T)) 
-((|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (QUOTE (-342))) (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (QUOTE (-784))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-342))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|))))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792))))) 
+((|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (QUOTE (-342))) (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (QUOTE (-783))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-342))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|))))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791))))) 
 (-1016 |Str| |Sym| |Int| |Flt| |Expr|) 
 ((|constructor| (NIL "This category allows the manipulation of Lisp values while keeping the grunge fairly localized.")) (|elt| (($ $ (|List| (|Integer|))) "\\spad{elt((a1,{}...,{}an),{} [i1,{}...,{}im])} returns \\spad{(a_i1,{}...,{}a_im)}.") (($ $ (|Integer|)) "\\spad{elt((a1,{}...,{}an),{} i)} returns \\spad{\\spad{ai}}.")) (|#| (((|Integer|) $) "\\spad{\\#((a1,{}...,{}an))} returns \\spad{n}.")) (|cdr| (($ $) "\\spad{cdr((a1,{}...,{}an))} returns \\spad{(a2,{}...,{}an)}.")) (|car| (($ $) "\\spad{car((a1,{}...,{}an))} returns a1.")) (|convert| (($ |#5|) "\\spad{convert(x)} returns the Lisp atom \\spad{x}.") (($ |#4|) "\\spad{convert(x)} returns the Lisp atom \\spad{x}.") (($ |#3|) "\\spad{convert(x)} returns the Lisp atom \\spad{x}.") (($ |#2|) "\\spad{convert(x)} returns the Lisp atom \\spad{x}.") (($ |#1|) "\\spad{convert(x)} returns the Lisp atom \\spad{x}.") (($ (|List| $)) "\\spad{convert([a1,{}...,{}an])} returns the \\spad{S}-expression \\spad{(a1,{}...,{}an)}.")) (|expr| ((|#5| $) "\\spad{expr(s)} returns \\spad{s} as an element of Expr; Error: if \\spad{s} is not an atom that also belongs to Expr.")) (|float| ((|#4| $) "\\spad{float(s)} returns \\spad{s} as an element of \\spad{Flt}; Error: if \\spad{s} is not an atom that also belongs to \\spad{Flt}.")) (|integer| ((|#3| $) "\\spad{integer(s)} returns \\spad{s} as an element of Int. Error: if \\spad{s} is not an atom that also belongs to Int.")) (|symbol| ((|#2| $) "\\spad{symbol(s)} returns \\spad{s} as an element of \\spad{Sym}. Error: if \\spad{s} is not an atom that also belongs to \\spad{Sym}.")) (|string| ((|#1| $) "\\spad{string(s)} returns \\spad{s} as an element of \\spad{Str}. Error: if \\spad{s} is not an atom that also belongs to \\spad{Str}.")) (|destruct| (((|List| $) $) "\\spad{destruct((a1,{}...,{}an))} returns the list [a1,{}...,{}an].")) (|float?| (((|Boolean|) $) "\\spad{float?(s)} is \\spad{true} if \\spad{s} is an atom and belong to \\spad{Flt}.")) (|integer?| (((|Boolean|) $) "\\spad{integer?(s)} is \\spad{true} if \\spad{s} is an atom and belong to Int.")) (|symbol?| (((|Boolean|) $) "\\spad{symbol?(s)} is \\spad{true} if \\spad{s} is an atom and belong to \\spad{Sym}.")) (|string?| (((|Boolean|) $) "\\spad{string?(s)} is \\spad{true} if \\spad{s} is an atom and belong to \\spad{Str}.")) (|list?| (((|Boolean|) $) "\\spad{list?(s)} is \\spad{true} if \\spad{s} is a Lisp list,{} possibly ().")) (|pair?| (((|Boolean|) $) "\\spad{pair?(s)} is \\spad{true} if \\spad{s} has is a non-null Lisp list.")) (|atom?| (((|Boolean|) $) "\\spad{atom?(s)} is \\spad{true} if \\spad{s} is a Lisp atom.")) (|null?| (((|Boolean|) $) "\\spad{null?(s)} is \\spad{true} if \\spad{s} is the \\spad{S}-expression ().")) (|eq| (((|Boolean|) $ $) "\\spad{eq(s,{} t)} is \\spad{true} if EQ(\\spad{s},{}\\spad{t}) is \\spad{true} in Lisp."))) 
 NIL 
@@ -4018,7 +4018,7 @@ NIL
 NIL 
 (-1022 R E V P) 
 ((|constructor| (NIL "The category of square-free regular triangular sets. A regular triangular set \\spad{ts} is square-free if the \\spad{gcd} of any polynomial \\spad{p} in \\spad{ts} and \\spad{differentiate(p,{}mvar(p))} \\spad{w}.\\spad{r}.\\spad{t}. \\axiomOpFrom{collectUnder}{TriangularSetCategory}(\\spad{ts},{}\\axiomOpFrom{mvar}{RecursivePolynomialCategory}(\\spad{p})) has degree zero \\spad{w}.\\spad{r}.\\spad{t}. \\spad{mvar(p)}. Thus any square-free regular set defines a tower of square-free simple extensions.\\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}. KALKBRENER \"Algorithmic properties of polynomial rings\"} \\indented{5}{Habilitation Thesis,{} ETZH,{} Zurich,{} 1995.} \\indented{1}{[3] \\spad{M}. MORENO MAZA \"A new algorithm for computing triangular} \\indented{5}{decomposition of algebraic varieties\" NAG Tech. Rep. 4/98.}"))) 
-((-4234 . T) (-4233 . T) (-2046 . T)) 
+((-4234 . T) (-4233 . T) (-2092 . T)) 
 NIL 
 (-1023) 
 ((|constructor| (NIL "SymmetricGroupCombinatoricFunctions contains combinatoric functions concerning symmetric groups and representation theory: list young tableaus,{} improper partitions,{} subsets bijection of Coleman.")) (|unrankImproperPartitions1| (((|List| (|Integer|)) (|Integer|) (|Integer|) (|Integer|)) "\\spad{unrankImproperPartitions1(n,{}m,{}k)} computes the {\\em k}\\spad{-}th improper partition of nonnegative \\spad{n} in at most \\spad{m} nonnegative parts ordered as follows: first,{} in reverse lexicographically according to their non-zero parts,{} then according to their positions (\\spadignore{i.e.} lexicographical order using {\\em subSet}: {\\em [3,{}0,{}0] < [0,{}3,{}0] < [0,{}0,{}3] < [2,{}1,{}0] < [2,{}0,{}1] < [0,{}2,{}1] < [1,{}2,{}0] < [1,{}0,{}2] < [0,{}1,{}2] < [1,{}1,{}1]}). Note: counting of subtrees is done by {\\em numberOfImproperPartitionsInternal}.")) (|unrankImproperPartitions0| (((|List| (|Integer|)) (|Integer|) (|Integer|) (|Integer|)) "\\spad{unrankImproperPartitions0(n,{}m,{}k)} computes the {\\em k}\\spad{-}th improper partition of nonnegative \\spad{n} in \\spad{m} nonnegative parts in reverse lexicographical order. Example: {\\em [0,{}0,{}3] < [0,{}1,{}2] < [0,{}2,{}1] < [0,{}3,{}0] < [1,{}0,{}2] < [1,{}1,{}1] < [1,{}2,{}0] < [2,{}0,{}1] < [2,{}1,{}0] < [3,{}0,{}0]}. Error: if \\spad{k} is negative or too big. Note: counting of subtrees is done by \\spadfunFrom{numberOfImproperPartitions}{SymmetricGroupCombinatoricFunctions}.")) (|subSet| (((|List| (|Integer|)) (|Integer|) (|Integer|) (|Integer|)) "\\spad{subSet(n,{}m,{}k)} calculates the {\\em k}\\spad{-}th {\\em m}-subset of the set {\\em 0,{}1,{}...,{}(n-1)} in the lexicographic order considered as a decreasing map from {\\em 0,{}...,{}(m-1)} into {\\em 0,{}...,{}(n-1)}. See \\spad{S}.\\spad{G}. Williamson: Theorem 1.60. Error: if not {\\em (0 <= m <= n and 0 < = k < (n choose m))}.")) (|numberOfImproperPartitions| (((|Integer|) (|Integer|) (|Integer|)) "\\spad{numberOfImproperPartitions(n,{}m)} computes the number of partitions of the nonnegative integer \\spad{n} in \\spad{m} nonnegative parts with regarding the order (improper partitions). Example: {\\em numberOfImproperPartitions (3,{}3)} is 10,{} since {\\em [0,{}0,{}3],{} [0,{}1,{}2],{} [0,{}2,{}1],{} [0,{}3,{}0],{} [1,{}0,{}2],{} [1,{}1,{}1],{} [1,{}2,{}0],{} [2,{}0,{}1],{} [2,{}1,{}0],{} [3,{}0,{}0]} are the possibilities. Note: this operation has a recursive implementation.")) (|nextPartition| (((|Vector| (|Integer|)) (|List| (|Integer|)) (|Vector| (|Integer|)) (|Integer|)) "\\spad{nextPartition(gamma,{}part,{}number)} generates the partition of {\\em number} which follows {\\em part} according to the right-to-left lexicographical order. The partition has the property that its components do not exceed the corresponding components of {\\em gamma}. the first partition is achieved by {\\em part=[]}. Also,{} {\\em []} indicates that {\\em part} is the last partition.") (((|Vector| (|Integer|)) (|Vector| (|Integer|)) (|Vector| (|Integer|)) (|Integer|)) "\\spad{nextPartition(gamma,{}part,{}number)} generates the partition of {\\em number} which follows {\\em part} according to the right-to-left lexicographical order. The partition has the property that its components do not exceed the corresponding components of {\\em gamma}. The first partition is achieved by {\\em part=[]}. Also,{} {\\em []} indicates that {\\em part} is the last partition.")) (|nextLatticePermutation| (((|List| (|Integer|)) (|List| (|Integer|)) (|List| (|Integer|)) (|Boolean|)) "\\spad{nextLatticePermutation(lambda,{}lattP,{}constructNotFirst)} generates the lattice permutation according to the proper partition {\\em lambda} succeeding the lattice permutation {\\em lattP} in lexicographical order as long as {\\em constructNotFirst} is \\spad{true}. If {\\em constructNotFirst} is \\spad{false},{} the first lattice permutation is returned. The result {\\em nil} indicates that {\\em lattP} has no successor.")) (|nextColeman| (((|Matrix| (|Integer|)) (|List| (|Integer|)) (|List| (|Integer|)) (|Matrix| (|Integer|))) "\\spad{nextColeman(alpha,{}beta,{}C)} generates the next Coleman matrix of column sums {\\em alpha} and row sums {\\em beta} according to the lexicographical order from bottom-to-top. The first Coleman matrix is achieved by {\\em C=new(1,{}1,{}0)}. Also,{} {\\em new(1,{}1,{}0)} indicates that \\spad{C} is the last Coleman matrix.")) (|makeYoungTableau| (((|Matrix| (|Integer|)) (|List| (|Integer|)) (|List| (|Integer|))) "\\spad{makeYoungTableau(lambda,{}gitter)} computes for a given lattice permutation {\\em gitter} and for an improper partition {\\em lambda} the corresponding standard tableau of shape {\\em lambda}. Notes: see {\\em listYoungTableaus}. The entries are from {\\em 0,{}...,{}n-1}.")) (|listYoungTableaus| (((|List| (|Matrix| (|Integer|))) (|List| (|Integer|))) "\\spad{listYoungTableaus(lambda)} where {\\em lambda} is a proper partition generates the list of all standard tableaus of shape {\\em lambda} by means of lattice permutations. The numbers of the lattice permutation are interpreted as column labels. Hence the contents of these lattice permutations are the conjugate of {\\em lambda}. Notes: the functions {\\em nextLatticePermutation} and {\\em makeYoungTableau} are used. The entries are from {\\em 0,{}...,{}n-1}.")) (|inverseColeman| (((|List| (|Integer|)) (|List| (|Integer|)) (|List| (|Integer|)) (|Matrix| (|Integer|))) "\\spad{inverseColeman(alpha,{}beta,{}C)}: there is a bijection from the set of matrices having nonnegative entries and row sums {\\em alpha},{} column sums {\\em beta} to the set of {\\em Salpha - Sbeta} double cosets of the symmetric group {\\em Sn}. ({\\em Salpha} is the Young subgroup corresponding to the improper partition {\\em alpha}). For such a matrix \\spad{C},{} inverseColeman(\\spad{alpha},{}\\spad{beta},{}\\spad{C}) calculates the lexicographical smallest {\\em \\spad{pi}} in the corresponding double coset. Note: the resulting permutation {\\em \\spad{pi}} of {\\em {1,{}2,{}...,{}n}} is given in list form. Notes: the inverse of this map is {\\em coleman}. For details,{} see James/Kerber.")) (|coleman| (((|Matrix| (|Integer|)) (|List| (|Integer|)) (|List| (|Integer|)) (|List| (|Integer|))) "\\spad{coleman(alpha,{}beta,{}\\spad{pi})}: there is a bijection from the set of matrices having nonnegative entries and row sums {\\em alpha},{} column sums {\\em beta} to the set of {\\em Salpha - Sbeta} double cosets of the symmetric group {\\em Sn}. ({\\em Salpha} is the Young subgroup corresponding to the improper partition {\\em alpha}). For a representing element {\\em \\spad{pi}} of such a double coset,{} coleman(\\spad{alpha},{}\\spad{beta},{}\\spad{pi}) generates the Coleman-matrix corresponding to {\\em alpha,{} beta,{} \\spad{pi}}. Note: The permutation {\\em \\spad{pi}} of {\\em {1,{}2,{}...,{}n}} has to be given in list form. Note: the inverse of this map is {\\em inverseColeman} (if {\\em \\spad{pi}} is the lexicographical smallest permutation in the coset). For details see James/Kerber."))) 
@@ -4035,7 +4035,7 @@ NIL
 (-1026 |dimtot| |dim1| S) 
 ((|constructor| (NIL "\\indented{2}{This type represents the finite direct or cartesian product of an} underlying ordered component type. The vectors are ordered as if they were split into two blocks. The dim1 parameter specifies the length of the first block. The ordering is lexicographic between the blocks but acts like \\spadtype{HomogeneousDirectProduct} within each block. This type is a suitable third argument for \\spadtype{GeneralDistributedMultivariatePolynomial}."))) 
 ((-4227 |has| |#3| (-970)) (-4228 |has| |#3| (-970)) (-4230 |has| |#3| (-6 -4230)) ((-4235 "*") |has| |#3| (-157)) (-4233 . T)) 
-((|HasCategory| |#3| (QUOTE (-337))) (|HasCategory| |#3| (QUOTE (-970))) (|HasCategory| |#3| (QUOTE (-729))) (|HasCategory| |#3| (QUOTE (-782))) (-3703 (|HasCategory| |#3| (QUOTE (-729))) (|HasCategory| |#3| (QUOTE (-782)))) (|HasCategory| |#3| (QUOTE (-157))) (-3703 (|HasCategory| |#3| (QUOTE (-157))) (|HasCategory| |#3| (QUOTE (-337))) (|HasCategory| |#3| (QUOTE (-970)))) (-3703 (|HasCategory| |#3| (QUOTE (-157))) (|HasCategory| |#3| (QUOTE (-337)))) (-3703 (|HasCategory| |#3| (QUOTE (-157))) (|HasCategory| |#3| (QUOTE (-970)))) (|HasCategory| |#3| (QUOTE (-342))) (|HasCategory| |#3| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#3| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#3| (QUOTE (-210))) (-3703 (|HasCategory| |#3| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#3| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#3| (QUOTE (-157))) (|HasCategory| |#3| (QUOTE (-210))) (|HasCategory| |#3| (QUOTE (-337))) (|HasCategory| |#3| (QUOTE (-970)))) (-3703 (|HasCategory| |#3| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#3| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#3| (QUOTE (-157))) (|HasCategory| |#3| (QUOTE (-210))) (|HasCategory| |#3| (QUOTE (-970)))) (|HasCategory| |#3| (QUOTE (-1013))) (|HasCategory| (-521) (QUOTE (-784))) (-12 (|HasCategory| |#3| (QUOTE (-970))) (|HasCategory| |#3| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (QUOTE (-210))) (|HasCategory| |#3| (QUOTE (-970)))) (-12 (|HasCategory| |#3| (QUOTE (-970))) (|HasCategory| |#3| (LIST (QUOTE -829) (QUOTE (-1084))))) (|HasCategory| |#3| (QUOTE (-663))) (-12 (|HasCategory| |#3| (QUOTE (-1013))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521))))) (-3703 (|HasCategory| |#3| (QUOTE (-970))) (-12 (|HasCategory| |#3| (QUOTE (-1013))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521)))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#3| (QUOTE (-1013)))) (|HasAttribute| |#3| (QUOTE -4230)) (|HasCategory| |#3| (QUOTE (-124))) (-3703 (|HasCategory| |#3| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#3| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#3| (QUOTE (-124))) (|HasCategory| |#3| (QUOTE (-157))) (|HasCategory| |#3| (QUOTE (-210))) (|HasCategory| |#3| (QUOTE (-337))) (|HasCategory| |#3| (QUOTE (-970)))) (|HasCategory| |#3| (QUOTE (-25))) (-3703 (|HasCategory| |#3| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#3| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (QUOTE (-124))) (|HasCategory| |#3| (QUOTE (-157))) (|HasCategory| |#3| (QUOTE (-210))) (|HasCategory| |#3| (QUOTE (-337))) (|HasCategory| |#3| (QUOTE (-342))) (|HasCategory| |#3| (QUOTE (-729))) (|HasCategory| |#3| (QUOTE (-782))) (|HasCategory| |#3| (QUOTE (-970))) (|HasCategory| |#3| (QUOTE (-1013)))) (-3703 (|HasCategory| |#3| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#3| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (QUOTE (-124))) (|HasCategory| |#3| (QUOTE (-157))) (|HasCategory| |#3| (QUOTE (-210))) (|HasCategory| |#3| (QUOTE (-337))) (|HasCategory| |#3| (QUOTE (-970)))) (-3703 (-12 (|HasCategory| |#3| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#3| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#3| (LIST (QUOTE -829) (QUOTE (-1084))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#3| (QUOTE (-25)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#3| (QUOTE (-124)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#3| (QUOTE (-157)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#3| (QUOTE (-210)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#3| (QUOTE (-337)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#3| (QUOTE (-342)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#3| (QUOTE (-729)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#3| (QUOTE (-782)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#3| (QUOTE (-970)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#3| (QUOTE (-1013))))) (-3703 (-12 (|HasCategory| |#3| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (QUOTE (-124))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (QUOTE (-157))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (QUOTE (-210))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (QUOTE (-337))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (QUOTE (-342))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (QUOTE (-729))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (QUOTE (-782))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (QUOTE (-970))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (QUOTE (-1013))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521)))))) (-12 (|HasCategory| |#3| (QUOTE (-1013))) (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|)))) (-3703 (-12 (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-124))) (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-157))) (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-210))) (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-337))) (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-342))) (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-729))) (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-782))) (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-970))) (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1013))) (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|))) (|HasCategory| |#3| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|))) (|HasCategory| |#3| (LIST (QUOTE -829) (QUOTE (-1084)))))) (|HasCategory| |#3| (LIST (QUOTE -561) (QUOTE (-792)))) (-3703 (-12 (|HasCategory| |#3| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#3| (QUOTE (-1013)))) (-12 (|HasCategory| |#3| (QUOTE (-210))) (|HasCategory| |#3| (QUOTE (-970)))) (-12 (|HasCategory| |#3| (QUOTE (-970))) (|HasCategory| |#3| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (QUOTE (-970))) (|HasCategory| |#3| (LIST (QUOTE -829) (QUOTE (-1084))))) (-12 (|HasCategory| |#3| (QUOTE (-1013))) (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1013))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521))))) (|HasCategory| |#3| (LIST (QUOTE -561) (QUOTE (-792)))))) 
+((|HasCategory| |#3| (QUOTE (-337))) (|HasCategory| |#3| (QUOTE (-970))) (|HasCategory| |#3| (QUOTE (-729))) (|HasCategory| |#3| (QUOTE (-781))) (-3703 (|HasCategory| |#3| (QUOTE (-729))) (|HasCategory| |#3| (QUOTE (-781)))) (|HasCategory| |#3| (QUOTE (-157))) (-3703 (|HasCategory| |#3| (QUOTE (-157))) (|HasCategory| |#3| (QUOTE (-337))) (|HasCategory| |#3| (QUOTE (-970)))) (-3703 (|HasCategory| |#3| (QUOTE (-157))) (|HasCategory| |#3| (QUOTE (-337)))) (-3703 (|HasCategory| |#3| (QUOTE (-157))) (|HasCategory| |#3| (QUOTE (-970)))) (|HasCategory| |#3| (QUOTE (-342))) (|HasCategory| |#3| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#3| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#3| (QUOTE (-210))) (-3703 (|HasCategory| |#3| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#3| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#3| (QUOTE (-157))) (|HasCategory| |#3| (QUOTE (-210))) (|HasCategory| |#3| (QUOTE (-337))) (|HasCategory| |#3| (QUOTE (-970)))) (-3703 (|HasCategory| |#3| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#3| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#3| (QUOTE (-157))) (|HasCategory| |#3| (QUOTE (-210))) (|HasCategory| |#3| (QUOTE (-970)))) (|HasCategory| |#3| (QUOTE (-1013))) (|HasCategory| (-521) (QUOTE (-783))) (-12 (|HasCategory| |#3| (QUOTE (-970))) (|HasCategory| |#3| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (QUOTE (-210))) (|HasCategory| |#3| (QUOTE (-970)))) (-12 (|HasCategory| |#3| (QUOTE (-970))) (|HasCategory| |#3| (LIST (QUOTE -828) (QUOTE (-1084))))) (|HasCategory| |#3| (QUOTE (-663))) (-12 (|HasCategory| |#3| (QUOTE (-1013))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521))))) (-3703 (|HasCategory| |#3| (QUOTE (-970))) (-12 (|HasCategory| |#3| (QUOTE (-1013))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521)))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#3| (QUOTE (-1013)))) (|HasAttribute| |#3| (QUOTE -4230)) (|HasCategory| |#3| (QUOTE (-124))) (-3703 (|HasCategory| |#3| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#3| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#3| (QUOTE (-124))) (|HasCategory| |#3| (QUOTE (-157))) (|HasCategory| |#3| (QUOTE (-210))) (|HasCategory| |#3| (QUOTE (-337))) (|HasCategory| |#3| (QUOTE (-970)))) (|HasCategory| |#3| (QUOTE (-25))) (-3703 (|HasCategory| |#3| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#3| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (QUOTE (-124))) (|HasCategory| |#3| (QUOTE (-157))) (|HasCategory| |#3| (QUOTE (-210))) (|HasCategory| |#3| (QUOTE (-337))) (|HasCategory| |#3| (QUOTE (-342))) (|HasCategory| |#3| (QUOTE (-729))) (|HasCategory| |#3| (QUOTE (-781))) (|HasCategory| |#3| (QUOTE (-970))) (|HasCategory| |#3| (QUOTE (-1013)))) (-3703 (|HasCategory| |#3| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#3| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (QUOTE (-124))) (|HasCategory| |#3| (QUOTE (-157))) (|HasCategory| |#3| (QUOTE (-210))) (|HasCategory| |#3| (QUOTE (-337))) (|HasCategory| |#3| (QUOTE (-970)))) (-3703 (-12 (|HasCategory| |#3| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#3| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#3| (LIST (QUOTE -828) (QUOTE (-1084))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#3| (QUOTE (-25)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#3| (QUOTE (-124)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#3| (QUOTE (-157)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#3| (QUOTE (-210)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#3| (QUOTE (-337)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#3| (QUOTE (-342)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#3| (QUOTE (-729)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#3| (QUOTE (-781)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#3| (QUOTE (-970)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#3| (QUOTE (-1013))))) (-3703 (-12 (|HasCategory| |#3| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (QUOTE (-124))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (QUOTE (-157))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (QUOTE (-210))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (QUOTE (-337))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (QUOTE (-342))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (QUOTE (-729))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (QUOTE (-781))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (QUOTE (-970))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (QUOTE (-1013))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521)))))) (-12 (|HasCategory| |#3| (QUOTE (-1013))) (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|)))) (-3703 (-12 (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-124))) (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-157))) (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-210))) (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-337))) (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-342))) (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-729))) (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-781))) (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-970))) (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1013))) (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|))) (|HasCategory| |#3| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|))) (|HasCategory| |#3| (LIST (QUOTE -828) (QUOTE (-1084)))))) (|HasCategory| |#3| (LIST (QUOTE -561) (QUOTE (-791)))) (-3703 (-12 (|HasCategory| |#3| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#3| (QUOTE (-1013)))) (-12 (|HasCategory| |#3| (QUOTE (-210))) (|HasCategory| |#3| (QUOTE (-970)))) (-12 (|HasCategory| |#3| (QUOTE (-970))) (|HasCategory| |#3| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#3| (QUOTE (-970))) (|HasCategory| |#3| (LIST (QUOTE -828) (QUOTE (-1084))))) (-12 (|HasCategory| |#3| (QUOTE (-1013))) (|HasCategory| |#3| (LIST (QUOTE -284) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1013))) (|HasCategory| |#3| (LIST (QUOTE -961) (QUOTE (-521))))) (|HasCategory| |#3| (LIST (QUOTE -561) (QUOTE (-791)))))) 
 (-1027 R |x|) 
 ((|constructor| (NIL "This package produces functions for counting etc. real roots of univariate polynomials in \\spad{x} over \\spad{R},{} which must be an OrderedIntegralDomain")) (|countRealRootsMultiple| (((|Integer|) (|UnivariatePolynomial| |#2| |#1|)) "\\spad{countRealRootsMultiple(p)} says how many real roots \\spad{p} has,{} counted with multiplicity")) (|SturmHabichtMultiple| (((|Integer|) (|UnivariatePolynomial| |#2| |#1|) (|UnivariatePolynomial| |#2| |#1|)) "\\spad{SturmHabichtMultiple(p1,{}p2)} computes \\spad{c_}{+}\\spad{-c_}{-} where \\spad{c_}{+} is the number of real roots of \\spad{p1} with p2>0 and \\spad{c_}{-} is the number of real roots of \\spad{p1} with p2<0. If p2=1 what you get is the number of real roots of \\spad{p1}.")) (|countRealRoots| (((|Integer|) (|UnivariatePolynomial| |#2| |#1|)) "\\spad{countRealRoots(p)} says how many real roots \\spad{p} has")) (|SturmHabicht| (((|Integer|) (|UnivariatePolynomial| |#2| |#1|) (|UnivariatePolynomial| |#2| |#1|)) "\\spad{SturmHabicht(p1,{}p2)} computes \\spad{c_}{+}\\spad{-c_}{-} where \\spad{c_}{+} is the number of real roots of \\spad{p1} with p2>0 and \\spad{c_}{-} is the number of real roots of \\spad{p1} with p2<0. If p2=1 what you get is the number of real roots of \\spad{p1}.")) (|SturmHabichtCoefficients| (((|List| |#1|) (|UnivariatePolynomial| |#2| |#1|) (|UnivariatePolynomial| |#2| |#1|)) "\\spad{SturmHabichtCoefficients(p1,{}p2)} computes the principal Sturm-Habicht coefficients of \\spad{p1} and \\spad{p2}")) (|SturmHabichtSequence| (((|List| (|UnivariatePolynomial| |#2| |#1|)) (|UnivariatePolynomial| |#2| |#1|) (|UnivariatePolynomial| |#2| |#1|)) "\\spad{SturmHabichtSequence(p1,{}p2)} computes the Sturm-Habicht sequence of \\spad{p1} and \\spad{p2}")) (|subresultantSequence| (((|List| (|UnivariatePolynomial| |#2| |#1|)) (|UnivariatePolynomial| |#2| |#1|) (|UnivariatePolynomial| |#2| |#1|)) "\\spad{subresultantSequence(p1,{}p2)} computes the (standard) subresultant sequence of \\spad{p1} and \\spad{p2}"))) 
 NIL 
@@ -4058,7 +4058,7 @@ NIL
 NIL 
 (-1032 S) 
 ((|constructor| (NIL "A stack is a bag where the last item inserted is the first item extracted.")) (|depth| (((|NonNegativeInteger|) $) "\\spad{depth(s)} returns the number of elements of stack \\spad{s}. Note: \\axiom{depth(\\spad{s}) = \\spad{#s}}.")) (|top| ((|#1| $) "\\spad{top(s)} returns the top element \\spad{x} from \\spad{s}; \\spad{s} remains unchanged. Note: Use \\axiom{pop!(\\spad{s})} to obtain \\spad{x} and remove it from \\spad{s}.")) (|pop!| ((|#1| $) "\\spad{pop!(s)} returns the top element \\spad{x},{} destructively removing \\spad{x} from \\spad{s}. Note: Use \\axiom{top(\\spad{s})} to obtain \\spad{x} without removing it from \\spad{s}. Error: if \\spad{s} is empty.")) (|push!| ((|#1| |#1| $) "\\spad{push!(x,{}s)} pushes \\spad{x} onto stack \\spad{s},{} \\spadignore{i.e.} destructively changing \\spad{s} so as to have a new first (top) element \\spad{x}. Afterwards,{} pop!(\\spad{s}) produces \\spad{x} and pop!(\\spad{s}) produces the original \\spad{s}."))) 
-((-4233 . T) (-4234 . T) (-2046 . T)) 
+((-4233 . T) (-4234 . T) (-2092 . T)) 
 NIL 
 (-1033 S |ndim| R |Row| |Col|) 
 ((|constructor| (NIL "\\spadtype{SquareMatrixCategory} is a general square matrix category which allows different representations and indexing schemes. Rows and columns may be extracted with rows returned as objects of type Row and colums returned as objects of type Col.")) (** (($ $ (|Integer|)) "\\spad{m**n} computes an integral power of the matrix \\spad{m}. Error: if the matrix is not invertible.")) (|inverse| (((|Union| $ "failed") $) "\\spad{inverse(m)} returns the inverse of the matrix \\spad{m},{} if that matrix is invertible and returns \"failed\" otherwise.")) (|minordet| ((|#3| $) "\\spad{minordet(m)} computes the determinant of the matrix \\spad{m} using minors.")) (|determinant| ((|#3| $) "\\spad{determinant(m)} returns the determinant of the matrix \\spad{m}.")) (* ((|#4| |#4| $) "\\spad{r * x} is the product of the row vector \\spad{r} and the matrix \\spad{x}. Error: if the dimensions are incompatible.") ((|#5| $ |#5|) "\\spad{x * c} is the product of the matrix \\spad{x} and the column vector \\spad{c}. Error: if the dimensions are incompatible.")) (|diagonalProduct| ((|#3| $) "\\spad{diagonalProduct(m)} returns the product of the elements on the diagonal of the matrix \\spad{m}.")) (|trace| ((|#3| $) "\\spad{trace(m)} returns the trace of the matrix \\spad{m}. this is the sum of the elements on the diagonal of the matrix \\spad{m}.")) (|diagonal| ((|#4| $) "\\spad{diagonal(m)} returns a row consisting of the elements on the diagonal of the matrix \\spad{m}.")) (|diagonalMatrix| (($ (|List| |#3|)) "\\spad{diagonalMatrix(l)} returns a diagonal matrix with the elements of \\spad{l} on the diagonal.")) (|scalarMatrix| (($ |#3|) "\\spad{scalarMatrix(r)} returns an \\spad{n}-by-\\spad{n} matrix with \\spad{r}\\spad{'s} on the diagonal and zeroes elsewhere."))) 
@@ -4066,7 +4066,7 @@ NIL
 ((|HasCategory| |#3| (QUOTE (-337))) (|HasAttribute| |#3| (QUOTE (-4235 "*"))) (|HasCategory| |#3| (QUOTE (-157)))) 
 (-1034 |ndim| R |Row| |Col|) 
 ((|constructor| (NIL "\\spadtype{SquareMatrixCategory} is a general square matrix category which allows different representations and indexing schemes. Rows and columns may be extracted with rows returned as objects of type Row and colums returned as objects of type Col.")) (** (($ $ (|Integer|)) "\\spad{m**n} computes an integral power of the matrix \\spad{m}. Error: if the matrix is not invertible.")) (|inverse| (((|Union| $ "failed") $) "\\spad{inverse(m)} returns the inverse of the matrix \\spad{m},{} if that matrix is invertible and returns \"failed\" otherwise.")) (|minordet| ((|#2| $) "\\spad{minordet(m)} computes the determinant of the matrix \\spad{m} using minors.")) (|determinant| ((|#2| $) "\\spad{determinant(m)} returns the determinant of the matrix \\spad{m}.")) (* ((|#3| |#3| $) "\\spad{r * x} is the product of the row vector \\spad{r} and the matrix \\spad{x}. Error: if the dimensions are incompatible.") ((|#4| $ |#4|) "\\spad{x * c} is the product of the matrix \\spad{x} and the column vector \\spad{c}. Error: if the dimensions are incompatible.")) (|diagonalProduct| ((|#2| $) "\\spad{diagonalProduct(m)} returns the product of the elements on the diagonal of the matrix \\spad{m}.")) (|trace| ((|#2| $) "\\spad{trace(m)} returns the trace of the matrix \\spad{m}. this is the sum of the elements on the diagonal of the matrix \\spad{m}.")) (|diagonal| ((|#3| $) "\\spad{diagonal(m)} returns a row consisting of the elements on the diagonal of the matrix \\spad{m}.")) (|diagonalMatrix| (($ (|List| |#2|)) "\\spad{diagonalMatrix(l)} returns a diagonal matrix with the elements of \\spad{l} on the diagonal.")) (|scalarMatrix| (($ |#2|) "\\spad{scalarMatrix(r)} returns an \\spad{n}-by-\\spad{n} matrix with \\spad{r}\\spad{'s} on the diagonal and zeroes elsewhere."))) 
-((-2046 . T) (-4233 . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
+((-2092 . T) (-4233 . T) (-4227 . T) (-4228 . T) (-4230 . T)) 
 NIL 
 (-1035 R |Row| |Col| M) 
 ((|constructor| (NIL "\\spadtype{SmithNormalForm} is a package which provides some standard canonical forms for matrices.")) (|diophantineSystem| (((|Record| (|:| |particular| (|Union| |#3| "failed")) (|:| |basis| (|List| |#3|))) |#4| |#3|) "\\spad{diophantineSystem(A,{}B)} returns a particular integer solution and an integer basis of the equation \\spad{AX = B}.")) (|completeSmith| (((|Record| (|:| |Smith| |#4|) (|:| |leftEqMat| |#4|) (|:| |rightEqMat| |#4|)) |#4|) "\\spad{completeSmith} returns a record that contains the Smith normal form \\spad{H} of the matrix and the left and right equivalence matrices \\spad{U} and \\spad{V} such that U*m*v = \\spad{H}")) (|smith| ((|#4| |#4|) "\\spad{smith(m)} returns the Smith Normal form of the matrix \\spad{m}.")) (|completeHermite| (((|Record| (|:| |Hermite| |#4|) (|:| |eqMat| |#4|)) |#4|) "\\spad{completeHermite} returns a record that contains the Hermite normal form \\spad{H} of the matrix and the equivalence matrix \\spad{U} such that U*m = \\spad{H}")) (|hermite| ((|#4| |#4|) "\\spad{hermite(m)} returns the Hermite normal form of the matrix \\spad{m}."))) 
@@ -4075,14 +4075,14 @@ NIL
 (-1036 R |VarSet|) 
 ((|constructor| (NIL "\\indented{2}{This type is the basic representation of sparse recursive multivariate} polynomials. It is parameterized by the coefficient ring and the variable set which may be infinite. The variable ordering is determined by the variable set parameter. The coefficient ring may be non-commutative,{} but the variables are assumed to commute."))) 
 (((-4235 "*") |has| |#1| (-157)) (-4226 |has| |#1| (-513)) (-4231 |has| |#1| (-6 -4231)) (-4228 . T) (-4227 . T) (-4230 . T)) 
-((|HasCategory| |#1| (QUOTE (-838))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-157))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-513)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -815) (QUOTE (-353)))) (|HasCategory| |#2| (LIST (QUOTE -815) (QUOTE (-353))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -815) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -815) (QUOTE (-521))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-353))))) (|HasCategory| |#2| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-353)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#2| (LIST (QUOTE -562) (QUOTE (-497))))) (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| |#1| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-337))) (-3703 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521)))))) (|HasAttribute| |#1| (QUOTE -4231)) (|HasCategory| |#1| (QUOTE (-425))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-838)))) (-3703 (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-838)))) (-3703 (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-838)))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-838)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-838)))) (|HasCategory| |#1| (QUOTE (-133))))) 
+((|HasCategory| |#1| (QUOTE (-837))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-157))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-513)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -814) (QUOTE (-353)))) (|HasCategory| |#2| (LIST (QUOTE -814) (QUOTE (-353))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -814) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -814) (QUOTE (-521))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-353))))) (|HasCategory| |#2| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-353)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#2| (LIST (QUOTE -562) (QUOTE (-497))))) (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#1| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-337))) (-3703 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521)))))) (|HasAttribute| |#1| (QUOTE -4231)) (|HasCategory| |#1| (QUOTE (-425))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-837)))) (-3703 (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-837)))) (-3703 (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-837)))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-837)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-837)))) (|HasCategory| |#1| (QUOTE (-133))))) 
 (-1037 |Coef| |Var| SMP) 
 ((|constructor| (NIL "This domain provides multivariate Taylor series with variables from an arbitrary ordered set. A Taylor series is represented by a stream of polynomials from the polynomial domain \\spad{SMP}. The \\spad{n}th element of the stream is a form of degree \\spad{n}. SMTS is an internal domain.")) (|fintegrate| (($ (|Mapping| $) |#2| |#1|) "\\spad{fintegrate(f,{}v,{}c)} is the integral of \\spad{f()} with respect \\indented{1}{to \\spad{v} and having \\spad{c} as the constant of integration.} \\indented{1}{The evaluation of \\spad{f()} is delayed.}")) (|integrate| (($ $ |#2| |#1|) "\\spad{integrate(s,{}v,{}c)} is the integral of \\spad{s} with respect \\indented{1}{to \\spad{v} and having \\spad{c} as the constant of integration.}")) (|csubst| (((|Mapping| (|Stream| |#3|) |#3|) (|List| |#2|) (|List| (|Stream| |#3|))) "\\spad{csubst(a,{}b)} is for internal use only")) (* (($ |#3| $) "\\spad{smp*ts} multiplies a TaylorSeries by a monomial \\spad{SMP}.")) (|coerce| (($ |#3|) "\\spad{coerce(poly)} regroups the terms by total degree and forms a series.") (($ |#2|) "\\spad{coerce(var)} converts a variable to a Taylor series")) (|coefficient| ((|#3| $ (|NonNegativeInteger|)) "\\spad{coefficient(s,{} n)} gives the terms of total degree \\spad{n}."))) 
 (((-4235 "*") |has| |#1| (-157)) (-4226 |has| |#1| (-513)) (-4228 . T) (-4227 . T) (-4230 . T)) 
 ((|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-513))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-513)))) (|HasCategory| |#1| (QUOTE (-337)))) 
 (-1038 R E V P) 
 ((|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}"))) 
-((-4234 . T) (-4233 . T) (-2046 . T)) 
+((-4234 . T) (-4233 . T) (-2092 . T)) 
 NIL 
 (-1039 UP -4049) 
 ((|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"))) 
@@ -4103,7 +4103,7 @@ NIL
 (-1043 S A) 
 ((|constructor| (NIL "This package exports sorting algorithnms")) (|insertionSort!| ((|#2| |#2|) "\\spad{insertionSort! }\\undocumented") ((|#2| |#2| (|Mapping| (|Boolean|) |#1| |#1|)) "\\spad{insertionSort!(a,{}f)} \\undocumented")) (|bubbleSort!| ((|#2| |#2|) "\\spad{bubbleSort!(a)} \\undocumented") ((|#2| |#2| (|Mapping| (|Boolean|) |#1| |#1|)) "\\spad{bubbleSort!(a,{}f)} \\undocumented"))) 
 NIL 
-((|HasCategory| |#1| (QUOTE (-784)))) 
+((|HasCategory| |#1| (QUOTE (-783)))) 
 (-1044 R) 
 ((|constructor| (NIL "The domain ThreeSpace is used for creating three dimensional objects using functions for defining points,{} curves,{} polygons,{} constructs and the subspaces containing them."))) 
 NIL 
@@ -4131,18 +4131,18 @@ NIL
 (-1050 V C) 
 ((|constructor| (NIL "This domain exports a modest implementation of splitting trees. Spliiting trees are needed when the evaluation of some quantity under some hypothesis requires to split the hypothesis into sub-cases. For instance by adding some new hypothesis on one hand and its negation on another hand. The computations are terminated is a splitting tree \\axiom{a} when \\axiom{status(value(a))} is \\axiom{\\spad{true}}. Thus,{} if for the splitting tree \\axiom{a} the flag \\axiom{status(value(a))} is \\axiom{\\spad{true}},{} then \\axiom{status(value(\\spad{d}))} is \\axiom{\\spad{true}} for any subtree \\axiom{\\spad{d}} of \\axiom{a}. This property of splitting trees is called the termination condition. If no vertex in a splitting tree \\axiom{a} is equal to another,{} \\axiom{a} is said to satisfy the no-duplicates condition. The splitting tree \\axiom{a} will satisfy this condition if nodes are added to \\axiom{a} by mean of \\axiom{splitNodeOf!} and if \\axiom{construct} is only used to create the root of \\axiom{a} with no children.")) (|splitNodeOf!| (($ $ $ (|List| (|SplittingNode| |#1| |#2|)) (|Mapping| (|Boolean|) |#2| |#2|)) "\\axiom{splitNodeOf!(\\spad{l},{}a,{}\\spad{ls},{}sub?)} returns \\axiom{a} where the children list of \\axiom{\\spad{l}} has been set to \\axiom{[[\\spad{s}]\\$\\% for \\spad{s} in \\spad{ls} | not subNodeOf?(\\spad{s},{}a,{}sub?)]}. Thus,{} if \\axiom{\\spad{l}} is not a node of \\axiom{a},{} this latter splitting tree is unchanged.") (($ $ $ (|List| (|SplittingNode| |#1| |#2|))) "\\axiom{splitNodeOf!(\\spad{l},{}a,{}\\spad{ls})} returns \\axiom{a} where the children list of \\axiom{\\spad{l}} has been set to \\axiom{[[\\spad{s}]\\$\\% for \\spad{s} in \\spad{ls} | not nodeOf?(\\spad{s},{}a)]}. Thus,{} if \\axiom{\\spad{l}} is not a node of \\axiom{a},{} this latter splitting tree is unchanged.")) (|remove!| (($ (|SplittingNode| |#1| |#2|) $) "\\axiom{remove!(\\spad{s},{}a)} replaces a by remove(\\spad{s},{}a)")) (|remove| (($ (|SplittingNode| |#1| |#2|) $) "\\axiom{remove(\\spad{s},{}a)} returns the splitting tree obtained from a by removing every sub-tree \\axiom{\\spad{b}} such that \\axiom{value(\\spad{b})} and \\axiom{\\spad{s}} have the same value,{} condition and status.")) (|subNodeOf?| (((|Boolean|) (|SplittingNode| |#1| |#2|) $ (|Mapping| (|Boolean|) |#2| |#2|)) "\\axiom{subNodeOf?(\\spad{s},{}a,{}sub?)} returns \\spad{true} iff for some node \\axiom{\\spad{n}} in \\axiom{a} we have \\axiom{\\spad{s} = \\spad{n}} or \\axiom{status(\\spad{n})} and \\axiom{subNode?(\\spad{s},{}\\spad{n},{}sub?)}.")) (|nodeOf?| (((|Boolean|) (|SplittingNode| |#1| |#2|) $) "\\axiom{nodeOf?(\\spad{s},{}a)} returns \\spad{true} iff some node of \\axiom{a} is equal to \\axiom{\\spad{s}}")) (|result| (((|List| (|Record| (|:| |val| |#1|) (|:| |tower| |#2|))) $) "\\axiom{result(a)} where \\axiom{\\spad{ls}} is the leaves list of \\axiom{a} returns \\axiom{[[value(\\spad{s}),{}condition(\\spad{s})]\\$\\spad{VT} for \\spad{s} in \\spad{ls}]} if the computations are terminated in \\axiom{a} else an error is produced.")) (|conditions| (((|List| |#2|) $) "\\axiom{conditions(a)} returns the list of the conditions of the leaves of a")) (|construct| (($ |#1| |#2| |#1| (|List| |#2|)) "\\axiom{construct(\\spad{v1},{}\\spad{t},{}\\spad{v2},{}\\spad{lt})} creates a splitting tree with value (\\spadignore{i.e.} root vertex) given by \\axiom{[\\spad{v},{}\\spad{t}]\\$\\spad{S}} and with children list given by \\axiom{[[[\\spad{v},{}\\spad{t}]\\$\\spad{S}]\\$\\% for \\spad{s} in \\spad{ls}]}.") (($ |#1| |#2| (|List| (|SplittingNode| |#1| |#2|))) "\\axiom{construct(\\spad{v},{}\\spad{t},{}\\spad{ls})} creates a splitting tree with value (\\spadignore{i.e.} root vertex) given by \\axiom{[\\spad{v},{}\\spad{t}]\\$\\spad{S}} and with children list given by \\axiom{[[\\spad{s}]\\$\\% for \\spad{s} in \\spad{ls}]}.") (($ |#1| |#2| (|List| $)) "\\axiom{construct(\\spad{v},{}\\spad{t},{}la)} creates a splitting tree with value (\\spadignore{i.e.} root vertex) given by \\axiom{[\\spad{v},{}\\spad{t}]\\$\\spad{S}} and with \\axiom{la} as children list.") (($ (|SplittingNode| |#1| |#2|)) "\\axiom{construct(\\spad{s})} creates a splitting tree with value (\\spadignore{i.e.} root vertex) given by \\axiom{\\spad{s}} and no children. Thus,{} if the status of \\axiom{\\spad{s}} is \\spad{false},{} \\axiom{[\\spad{s}]} represents the starting point of the evaluation \\axiom{value(\\spad{s})} under the hypothesis \\axiom{condition(\\spad{s})}.")) (|updateStatus!| (($ $) "\\axiom{updateStatus!(a)} returns a where the status of the vertices are updated to satisfy the \"termination condition\".")) (|extractSplittingLeaf| (((|Union| $ "failed") $) "\\axiom{extractSplittingLeaf(a)} returns the left most leaf (as a tree) whose status is \\spad{false} if any,{} else \"failed\" is returned."))) 
 ((-4233 . T) (-4234 . T)) 
-((|HasCategory| (-1049 |#1| |#2|) (QUOTE (-1013))) (-12 (|HasCategory| (-1049 |#1| |#2|) (LIST (QUOTE -284) (LIST (QUOTE -1049) (|devaluate| |#1|) (|devaluate| |#2|)))) (|HasCategory| (-1049 |#1| |#2|) (QUOTE (-1013)))) (|HasCategory| (-1049 |#1| |#2|) (LIST (QUOTE -561) (QUOTE (-792)))) (-3703 (|HasCategory| (-1049 |#1| |#2|) (LIST (QUOTE -561) (QUOTE (-792)))) (-12 (|HasCategory| (-1049 |#1| |#2|) (LIST (QUOTE -284) (LIST (QUOTE -1049) (|devaluate| |#1|) (|devaluate| |#2|)))) (|HasCategory| (-1049 |#1| |#2|) (QUOTE (-1013)))))) 
+((|HasCategory| (-1049 |#1| |#2|) (QUOTE (-1013))) (-12 (|HasCategory| (-1049 |#1| |#2|) (LIST (QUOTE -284) (LIST (QUOTE -1049) (|devaluate| |#1|) (|devaluate| |#2|)))) (|HasCategory| (-1049 |#1| |#2|) (QUOTE (-1013)))) (|HasCategory| (-1049 |#1| |#2|) (LIST (QUOTE -561) (QUOTE (-791)))) (-3703 (|HasCategory| (-1049 |#1| |#2|) (LIST (QUOTE -561) (QUOTE (-791)))) (-12 (|HasCategory| (-1049 |#1| |#2|) (LIST (QUOTE -284) (LIST (QUOTE -1049) (|devaluate| |#1|) (|devaluate| |#2|)))) (|HasCategory| (-1049 |#1| |#2|) (QUOTE (-1013)))))) 
 (-1051 |ndim| R) 
 ((|constructor| (NIL "\\spadtype{SquareMatrix} is a matrix domain of square matrices,{} where the number of rows (= number of columns) is a parameter of the type.")) (|unitsKnown| ((|attribute|) "the invertible matrices are simply the matrices whose determinants are units in the Ring \\spad{R}.")) (|central| ((|attribute|) "the elements of the Ring \\spad{R},{} viewed as diagonal matrices,{} commute with all matrices and,{} indeed,{} are the only matrices which commute with all matrices.")) (|coerce| (((|Matrix| |#2|) $) "\\spad{coerce(m)} converts a matrix of type \\spadtype{SquareMatrix} to a matrix of type \\spadtype{Matrix}.")) (|squareMatrix| (($ (|Matrix| |#2|)) "\\spad{squareMatrix(m)} converts a matrix of type \\spadtype{Matrix} to a matrix of type \\spadtype{SquareMatrix}.")) (|transpose| (($ $) "\\spad{transpose(m)} returns the transpose of the matrix \\spad{m}."))) 
 ((-4230 . T) (-4222 |has| |#2| (-6 (-4235 "*"))) (-4233 . T) (-4227 . T) (-4228 . T)) 
-((|HasCategory| |#2| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-210))) (|HasAttribute| |#2| (QUOTE (-4235 "*"))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#2| (QUOTE (-282))) (|HasCategory| |#2| (QUOTE (-513))) (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (QUOTE (-337))) (-3703 (|HasAttribute| |#2| (QUOTE (-4235 "*"))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-210)))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-3703 (-12 (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -829) (QUOTE (-1084)))))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-792)))) (|HasCategory| |#2| (QUOTE (-157)))) 
+((|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-210))) (|HasAttribute| |#2| (QUOTE (-4235 "*"))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#2| (QUOTE (-282))) (|HasCategory| |#2| (QUOTE (-513))) (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (QUOTE (-337))) (-3703 (|HasAttribute| |#2| (QUOTE (-4235 "*"))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#2| (QUOTE (-210)))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-3703 (-12 (|HasCategory| |#2| (QUOTE (-210))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1084)))))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-791)))) (|HasCategory| |#2| (QUOTE (-157)))) 
 (-1052 S) 
 ((|constructor| (NIL "A string aggregate is a category for strings,{} that is,{} one dimensional arrays of characters.")) (|elt| (($ $ $) "\\spad{elt(s,{}t)} returns the concatenation of \\spad{s} and \\spad{t}. It is provided to allow juxtaposition of strings to work as concatenation. For example,{} \\axiom{\"smoo\" \"shed\"} returns \\axiom{\"smooshed\"}.")) (|rightTrim| (($ $ (|CharacterClass|)) "\\spad{rightTrim(s,{}cc)} returns \\spad{s} with all trailing occurences of characters in \\spad{cc} deleted. For example,{} \\axiom{rightTrim(\"(abc)\",{} charClass \"()\")} returns \\axiom{\"(abc\"}.") (($ $ (|Character|)) "\\spad{rightTrim(s,{}c)} returns \\spad{s} with all trailing occurrences of \\spad{c} deleted. For example,{} \\axiom{rightTrim(\" abc \",{} char \" \")} returns \\axiom{\" abc\"}.")) (|leftTrim| (($ $ (|CharacterClass|)) "\\spad{leftTrim(s,{}cc)} returns \\spad{s} with all leading characters in \\spad{cc} deleted. For example,{} \\axiom{leftTrim(\"(abc)\",{} charClass \"()\")} returns \\axiom{\"abc)\"}.") (($ $ (|Character|)) "\\spad{leftTrim(s,{}c)} returns \\spad{s} with all leading characters \\spad{c} deleted. For example,{} \\axiom{leftTrim(\" abc \",{} char \" \")} returns \\axiom{\"abc \"}.")) (|trim| (($ $ (|CharacterClass|)) "\\spad{trim(s,{}cc)} returns \\spad{s} with all characters in \\spad{cc} deleted from right and left ends. For example,{} \\axiom{trim(\"(abc)\",{} charClass \"()\")} returns \\axiom{\"abc\"}.") (($ $ (|Character|)) "\\spad{trim(s,{}c)} returns \\spad{s} with all characters \\spad{c} deleted from right and left ends. For example,{} \\axiom{trim(\" abc \",{} char \" \")} returns \\axiom{\"abc\"}.")) (|split| (((|List| $) $ (|CharacterClass|)) "\\spad{split(s,{}cc)} returns a list of substrings delimited by characters in \\spad{cc}.") (((|List| $) $ (|Character|)) "\\spad{split(s,{}c)} returns a list of substrings delimited by character \\spad{c}.")) (|coerce| (($ (|Character|)) "\\spad{coerce(c)} returns \\spad{c} as a string \\spad{s} with the character \\spad{c}.")) (|position| (((|Integer|) (|CharacterClass|) $ (|Integer|)) "\\spad{position(cc,{}t,{}i)} returns the position \\axiom{\\spad{j} \\spad{>=} \\spad{i}} in \\spad{t} of the first character belonging to \\spad{cc}.") (((|Integer|) $ $ (|Integer|)) "\\spad{position(s,{}t,{}i)} returns the position \\spad{j} of the substring \\spad{s} in string \\spad{t},{} where \\axiom{\\spad{j} \\spad{>=} \\spad{i}} is required.")) (|replace| (($ $ (|UniversalSegment| (|Integer|)) $) "\\spad{replace(s,{}i..j,{}t)} replaces the substring \\axiom{\\spad{s}(\\spad{i}..\\spad{j})} of \\spad{s} by string \\spad{t}.")) (|match?| (((|Boolean|) $ $ (|Character|)) "\\spad{match?(s,{}t,{}c)} tests if \\spad{s} matches \\spad{t} except perhaps for multiple and consecutive occurrences of character \\spad{c}. Typically \\spad{c} is the blank character.")) (|match| (((|NonNegativeInteger|) $ $ (|Character|)) "\\spad{match(p,{}s,{}wc)} tests if pattern \\axiom{\\spad{p}} matches subject \\axiom{\\spad{s}} where \\axiom{\\spad{wc}} is a wild card character. If no match occurs,{} the index \\axiom{0} is returned; otheriwse,{} the value returned is the first index of the first character in the subject matching the subject (excluding that matched by an initial wild-card). For example,{} \\axiom{match(\"*to*\",{}\"yorktown\",{}\\spad{\"*\"})} returns \\axiom{5} indicating a successful match starting at index \\axiom{5} of \\axiom{\"yorktown\"}.")) (|substring?| (((|Boolean|) $ $ (|Integer|)) "\\spad{substring?(s,{}t,{}i)} tests if \\spad{s} is a substring of \\spad{t} beginning at index \\spad{i}. Note: \\axiom{substring?(\\spad{s},{}\\spad{t},{}0) = prefix?(\\spad{s},{}\\spad{t})}.")) (|suffix?| (((|Boolean|) $ $) "\\spad{suffix?(s,{}t)} tests if the string \\spad{s} is the final substring of \\spad{t}. Note: \\axiom{suffix?(\\spad{s},{}\\spad{t}) \\spad{==} reduce(and,{}[\\spad{s}.\\spad{i} = \\spad{t}.(\\spad{n} - \\spad{m} + \\spad{i}) for \\spad{i} in 0..maxIndex \\spad{s}])} where \\spad{m} and \\spad{n} denote the maxIndex of \\spad{s} and \\spad{t} respectively.")) (|prefix?| (((|Boolean|) $ $) "\\spad{prefix?(s,{}t)} tests if the string \\spad{s} is the initial substring of \\spad{t}. Note: \\axiom{prefix?(\\spad{s},{}\\spad{t}) \\spad{==} reduce(and,{}[\\spad{s}.\\spad{i} = \\spad{t}.\\spad{i} for \\spad{i} in 0..maxIndex \\spad{s}])}.")) (|upperCase!| (($ $) "\\spad{upperCase!(s)} destructively replaces the alphabetic characters in \\spad{s} by upper case characters.")) (|upperCase| (($ $) "\\spad{upperCase(s)} returns the string with all characters in upper case.")) (|lowerCase!| (($ $) "\\spad{lowerCase!(s)} destructively replaces the alphabetic characters in \\spad{s} by lower case.")) (|lowerCase| (($ $) "\\spad{lowerCase(s)} returns the string with all characters in lower case."))) 
 NIL 
 NIL 
 (-1053) 
 ((|constructor| (NIL "A string aggregate is a category for strings,{} that is,{} one dimensional arrays of characters.")) (|elt| (($ $ $) "\\spad{elt(s,{}t)} returns the concatenation of \\spad{s} and \\spad{t}. It is provided to allow juxtaposition of strings to work as concatenation. For example,{} \\axiom{\"smoo\" \"shed\"} returns \\axiom{\"smooshed\"}.")) (|rightTrim| (($ $ (|CharacterClass|)) "\\spad{rightTrim(s,{}cc)} returns \\spad{s} with all trailing occurences of characters in \\spad{cc} deleted. For example,{} \\axiom{rightTrim(\"(abc)\",{} charClass \"()\")} returns \\axiom{\"(abc\"}.") (($ $ (|Character|)) "\\spad{rightTrim(s,{}c)} returns \\spad{s} with all trailing occurrences of \\spad{c} deleted. For example,{} \\axiom{rightTrim(\" abc \",{} char \" \")} returns \\axiom{\" abc\"}.")) (|leftTrim| (($ $ (|CharacterClass|)) "\\spad{leftTrim(s,{}cc)} returns \\spad{s} with all leading characters in \\spad{cc} deleted. For example,{} \\axiom{leftTrim(\"(abc)\",{} charClass \"()\")} returns \\axiom{\"abc)\"}.") (($ $ (|Character|)) "\\spad{leftTrim(s,{}c)} returns \\spad{s} with all leading characters \\spad{c} deleted. For example,{} \\axiom{leftTrim(\" abc \",{} char \" \")} returns \\axiom{\"abc \"}.")) (|trim| (($ $ (|CharacterClass|)) "\\spad{trim(s,{}cc)} returns \\spad{s} with all characters in \\spad{cc} deleted from right and left ends. For example,{} \\axiom{trim(\"(abc)\",{} charClass \"()\")} returns \\axiom{\"abc\"}.") (($ $ (|Character|)) "\\spad{trim(s,{}c)} returns \\spad{s} with all characters \\spad{c} deleted from right and left ends. For example,{} \\axiom{trim(\" abc \",{} char \" \")} returns \\axiom{\"abc\"}.")) (|split| (((|List| $) $ (|CharacterClass|)) "\\spad{split(s,{}cc)} returns a list of substrings delimited by characters in \\spad{cc}.") (((|List| $) $ (|Character|)) "\\spad{split(s,{}c)} returns a list of substrings delimited by character \\spad{c}.")) (|coerce| (($ (|Character|)) "\\spad{coerce(c)} returns \\spad{c} as a string \\spad{s} with the character \\spad{c}.")) (|position| (((|Integer|) (|CharacterClass|) $ (|Integer|)) "\\spad{position(cc,{}t,{}i)} returns the position \\axiom{\\spad{j} \\spad{>=} \\spad{i}} in \\spad{t} of the first character belonging to \\spad{cc}.") (((|Integer|) $ $ (|Integer|)) "\\spad{position(s,{}t,{}i)} returns the position \\spad{j} of the substring \\spad{s} in string \\spad{t},{} where \\axiom{\\spad{j} \\spad{>=} \\spad{i}} is required.")) (|replace| (($ $ (|UniversalSegment| (|Integer|)) $) "\\spad{replace(s,{}i..j,{}t)} replaces the substring \\axiom{\\spad{s}(\\spad{i}..\\spad{j})} of \\spad{s} by string \\spad{t}.")) (|match?| (((|Boolean|) $ $ (|Character|)) "\\spad{match?(s,{}t,{}c)} tests if \\spad{s} matches \\spad{t} except perhaps for multiple and consecutive occurrences of character \\spad{c}. Typically \\spad{c} is the blank character.")) (|match| (((|NonNegativeInteger|) $ $ (|Character|)) "\\spad{match(p,{}s,{}wc)} tests if pattern \\axiom{\\spad{p}} matches subject \\axiom{\\spad{s}} where \\axiom{\\spad{wc}} is a wild card character. If no match occurs,{} the index \\axiom{0} is returned; otheriwse,{} the value returned is the first index of the first character in the subject matching the subject (excluding that matched by an initial wild-card). For example,{} \\axiom{match(\"*to*\",{}\"yorktown\",{}\\spad{\"*\"})} returns \\axiom{5} indicating a successful match starting at index \\axiom{5} of \\axiom{\"yorktown\"}.")) (|substring?| (((|Boolean|) $ $ (|Integer|)) "\\spad{substring?(s,{}t,{}i)} tests if \\spad{s} is a substring of \\spad{t} beginning at index \\spad{i}. Note: \\axiom{substring?(\\spad{s},{}\\spad{t},{}0) = prefix?(\\spad{s},{}\\spad{t})}.")) (|suffix?| (((|Boolean|) $ $) "\\spad{suffix?(s,{}t)} tests if the string \\spad{s} is the final substring of \\spad{t}. Note: \\axiom{suffix?(\\spad{s},{}\\spad{t}) \\spad{==} reduce(and,{}[\\spad{s}.\\spad{i} = \\spad{t}.(\\spad{n} - \\spad{m} + \\spad{i}) for \\spad{i} in 0..maxIndex \\spad{s}])} where \\spad{m} and \\spad{n} denote the maxIndex of \\spad{s} and \\spad{t} respectively.")) (|prefix?| (((|Boolean|) $ $) "\\spad{prefix?(s,{}t)} tests if the string \\spad{s} is the initial substring of \\spad{t}. Note: \\axiom{prefix?(\\spad{s},{}\\spad{t}) \\spad{==} reduce(and,{}[\\spad{s}.\\spad{i} = \\spad{t}.\\spad{i} for \\spad{i} in 0..maxIndex \\spad{s}])}.")) (|upperCase!| (($ $) "\\spad{upperCase!(s)} destructively replaces the alphabetic characters in \\spad{s} by upper case characters.")) (|upperCase| (($ $) "\\spad{upperCase(s)} returns the string with all characters in upper case.")) (|lowerCase!| (($ $) "\\spad{lowerCase!(s)} destructively replaces the alphabetic characters in \\spad{s} by lower case.")) (|lowerCase| (($ $) "\\spad{lowerCase(s)} returns the string with all characters in lower case."))) 
-((-4234 . T) (-4233 . T) (-2046 . T)) 
+((-4234 . T) (-4233 . T) (-2092 . T)) 
 NIL 
 (-1054 R E V P TS) 
 ((|constructor| (NIL "A package providing a new algorithm for solving polynomial systems by means of regular chains. Two ways of solving are provided: in the sense of Zariski closure (like in Kalkbrener\\spad{'s} algorithm) or in the sense of the regular zeros (like in Wu,{} Wang or Lazard- Moreno methods). This algorithm is valid for nay type of regular set. It does not care about the way a polynomial is added in an regular set,{} or how two quasi-components are compared (by an inclusion-test),{} or how the invertibility test is made in the tower of simple extensions associated with a regular set. These operations are realized respectively by the domain \\spad{TS} and the packages \\spad{QCMPPK(R,{}E,{}V,{}P,{}TS)} and \\spad{RSETGCD(R,{}E,{}V,{}P,{}TS)}. The same way it does not care about the way univariate polynomial gcds (with coefficients in the tower of simple extensions associated with a regular set) are computed. The only requirement is that these gcds need to have invertible initials (normalized or not). WARNING. There is no need for a user to call diectly any operation of this package since they can be accessed by the domain \\axiomType{\\spad{TS}}. Thus,{} the operations of this package are not documented.\\newline References : \\indented{1}{[1] \\spad{M}. MORENO MAZA \"A new algorithm for computing triangular} \\indented{5}{decomposition of algebraic varieties\" NAG Tech. Rep. 4/98.}"))) 
@@ -4151,23 +4151,23 @@ NIL
 (-1055 R E V P) 
 ((|constructor| (NIL "This domain provides an implementation of square-free regular chains. Moreover,{} the operation \\axiomOpFrom{zeroSetSplit}{SquareFreeRegularTriangularSetCategory} is an implementation of a new algorithm for solving polynomial systems by means of regular chains.\\newline References : \\indented{1}{[1] \\spad{M}. MORENO MAZA \"A new algorithm for computing triangular} \\indented{5}{decomposition of algebraic varieties\" NAG Tech. Rep. 4/98.} \\indented{2}{Version: 2}")) (|preprocess| (((|Record| (|:| |val| (|List| |#4|)) (|:| |towers| (|List| $))) (|List| |#4|) (|Boolean|) (|Boolean|)) "\\axiom{pre_process(\\spad{lp},{}\\spad{b1},{}\\spad{b2})} is an internal subroutine,{} exported only for developement.")) (|internalZeroSetSplit| (((|List| $) (|List| |#4|) (|Boolean|) (|Boolean|) (|Boolean|)) "\\axiom{internalZeroSetSplit(\\spad{lp},{}\\spad{b1},{}\\spad{b2},{}\\spad{b3})} is an internal subroutine,{} exported only for developement.")) (|zeroSetSplit| (((|List| $) (|List| |#4|) (|Boolean|) (|Boolean|) (|Boolean|) (|Boolean|)) "\\axiom{zeroSetSplit(\\spad{lp},{}\\spad{b1},{}\\spad{b2}.\\spad{b3},{}\\spad{b4})} is an internal subroutine,{} exported only for developement.") (((|List| $) (|List| |#4|) (|Boolean|) (|Boolean|)) "\\axiom{zeroSetSplit(\\spad{lp},{}clos?,{}info?)} has the same specifications as \\axiomOpFrom{zeroSetSplit}{RegularTriangularSetCategory} from \\spadtype{RegularTriangularSetCategory} Moreover,{} if \\axiom{clos?} then solves in the sense of the Zariski closure else solves in the sense of the regular zeros. If \\axiom{info?} then do print messages during the computations.")) (|internalAugment| (((|List| $) |#4| $ (|Boolean|) (|Boolean|) (|Boolean|) (|Boolean|) (|Boolean|)) "\\axiom{internalAugment(\\spad{p},{}\\spad{ts},{}\\spad{b1},{}\\spad{b2},{}\\spad{b3},{}\\spad{b4},{}\\spad{b5})} is an internal subroutine,{} exported only for developement."))) 
 ((-4234 . T) (-4233 . T)) 
-((|HasCategory| |#4| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#4| (QUOTE (-1013))) (-12 (|HasCategory| |#4| (QUOTE (-1013))) (|HasCategory| |#4| (LIST (QUOTE -284) (|devaluate| |#4|)))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#3| (QUOTE (-342))) (|HasCategory| |#4| (LIST (QUOTE -561) (QUOTE (-792))))) 
+((|HasCategory| |#4| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#4| (QUOTE (-1013))) (-12 (|HasCategory| |#4| (QUOTE (-1013))) (|HasCategory| |#4| (LIST (QUOTE -284) (|devaluate| |#4|)))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#3| (QUOTE (-342))) (|HasCategory| |#4| (LIST (QUOTE -561) (QUOTE (-791))))) 
 (-1056 S) 
 ((|constructor| (NIL "Linked List implementation of a Stack")) (|stack| (($ (|List| |#1|)) "\\spad{stack([x,{}y,{}...,{}z])} creates a stack with first (top) element \\spad{x},{} second element \\spad{y},{}...,{}and last element \\spad{z}."))) 
 ((-4233 . T) (-4234 . T)) 
-((|HasCategory| |#1| (QUOTE (-1013))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))))) 
+((|HasCategory| |#1| (QUOTE (-1013))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))))) 
 (-1057 A S) 
 ((|constructor| (NIL "A stream aggregate is a linear aggregate which possibly has an infinite number of elements. A basic domain constructor which builds stream aggregates is \\spadtype{Stream}. From streams,{} a number of infinite structures such power series can be built. A stream aggregate may also be infinite since it may be cyclic. For example,{} see \\spadtype{DecimalExpansion}.")) (|possiblyInfinite?| (((|Boolean|) $) "\\spad{possiblyInfinite?(s)} tests if the stream \\spad{s} could possibly have an infinite number of elements. Note: for many datatypes,{} \\axiom{possiblyInfinite?(\\spad{s}) = not explictlyFinite?(\\spad{s})}.")) (|explicitlyFinite?| (((|Boolean|) $) "\\spad{explicitlyFinite?(s)} tests if the stream has a finite number of elements,{} and \\spad{false} otherwise. Note: for many datatypes,{} \\axiom{explicitlyFinite?(\\spad{s}) = not possiblyInfinite?(\\spad{s})}."))) 
 NIL 
 NIL 
 (-1058 S) 
 ((|constructor| (NIL "A stream aggregate is a linear aggregate which possibly has an infinite number of elements. A basic domain constructor which builds stream aggregates is \\spadtype{Stream}. From streams,{} a number of infinite structures such power series can be built. A stream aggregate may also be infinite since it may be cyclic. For example,{} see \\spadtype{DecimalExpansion}.")) (|possiblyInfinite?| (((|Boolean|) $) "\\spad{possiblyInfinite?(s)} tests if the stream \\spad{s} could possibly have an infinite number of elements. Note: for many datatypes,{} \\axiom{possiblyInfinite?(\\spad{s}) = not explictlyFinite?(\\spad{s})}.")) (|explicitlyFinite?| (((|Boolean|) $) "\\spad{explicitlyFinite?(s)} tests if the stream has a finite number of elements,{} and \\spad{false} otherwise. Note: for many datatypes,{} \\axiom{explicitlyFinite?(\\spad{s}) = not possiblyInfinite?(\\spad{s})}."))) 
-((-2046 . T)) 
+((-2092 . T)) 
 NIL 
 (-1059 |Key| |Ent| |dent|) 
 ((|constructor| (NIL "A sparse table has a default entry,{} which is returned if no other value has been explicitly stored for a key."))) 
 ((-4234 . T)) 
-((|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-792)))) (|HasCategory| |#2| (QUOTE (-1013))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (QUOTE (-1013))) (-12 (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (QUOTE (-1013))) (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (LIST (QUOTE -284) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2529) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3045) (|devaluate| |#2|)))))) (-3703 (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (QUOTE (-1013))) (|HasCategory| |#2| (QUOTE (-1013)))) (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (LIST (QUOTE -561) (QUOTE (-792)))) (-3703 (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (QUOTE (-1013))) (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (LIST (QUOTE -561) (QUOTE (-792)))) (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-792))))) (-3703 (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (LIST (QUOTE -561) (QUOTE (-792)))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-792)))))) 
+((|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-791)))) (|HasCategory| |#2| (QUOTE (-1013))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (QUOTE (-1013))) (-12 (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (QUOTE (-1013))) (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (LIST (QUOTE -284) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2535) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3050) (|devaluate| |#2|)))))) (-3703 (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (QUOTE (-1013))) (|HasCategory| |#2| (QUOTE (-1013)))) (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (LIST (QUOTE -561) (QUOTE (-791)))) (-3703 (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (QUOTE (-1013))) (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (LIST (QUOTE -561) (QUOTE (-791)))) (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-791))))) (-3703 (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (LIST (QUOTE -561) (QUOTE (-791)))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-791)))))) 
 (-1060) 
 ((|constructor| (NIL "A class of objects which can be 'stepped through'. Repeated applications of \\spadfun{nextItem} is guaranteed never to return duplicate items and only return \"failed\" after exhausting all elements of the domain. This assumes that the sequence starts with \\spad{init()}. For infinite domains,{} repeated application of \\spadfun{nextItem} is not required to reach all possible domain elements starting from any initial element. \\blankline Conditional attributes: \\indented{2}{infinite\\tab{15}repeated \\spad{nextItem}\\spad{'s} are never \"failed\".}")) (|nextItem| (((|Union| $ "failed") $) "\\spad{nextItem(x)} returns the next item,{} or \"failed\" if domain is exhausted.")) (|init| (($) "\\spad{init()} chooses an initial object for stepping."))) 
 NIL 
@@ -4191,19 +4191,19 @@ NIL
 (-1065 S) 
 ((|constructor| (NIL "A stream is an implementation of an infinite sequence using a list of terms that have been computed and a function closure to compute additional terms when needed.")) (|filterUntil| (($ (|Mapping| (|Boolean|) |#1|) $) "\\spad{filterUntil(p,{}s)} returns \\spad{[x0,{}x1,{}...,{}x(n)]} where \\spad{s = [x0,{}x1,{}x2,{}..]} and \\spad{n} is the smallest index such that \\spad{p(xn) = true}.")) (|filterWhile| (($ (|Mapping| (|Boolean|) |#1|) $) "\\spad{filterWhile(p,{}s)} returns \\spad{[x0,{}x1,{}...,{}x(n-1)]} where \\spad{s = [x0,{}x1,{}x2,{}..]} and \\spad{n} is the smallest index such that \\spad{p(xn) = false}.")) (|generate| (($ (|Mapping| |#1| |#1|) |#1|) "\\spad{generate(f,{}x)} creates an infinite stream whose first element is \\spad{x} and whose \\spad{n}th element (\\spad{n > 1}) is \\spad{f} applied to the previous element. Note: \\spad{generate(f,{}x) = [x,{}f(x),{}f(f(x)),{}...]}.") (($ (|Mapping| |#1|)) "\\spad{generate(f)} creates an infinite stream all of whose elements are equal to \\spad{f()}. Note: \\spad{generate(f) = [f(),{}f(),{}f(),{}...]}.")) (|setrest!| (($ $ (|Integer|) $) "\\spad{setrest!(x,{}n,{}y)} sets rest(\\spad{x},{}\\spad{n}) to \\spad{y}. The function will expand cycles if necessary.")) (|showAll?| (((|Boolean|)) "\\spad{showAll?()} returns \\spad{true} if all computed entries of streams will be displayed.")) (|showAllElements| (((|OutputForm|) $) "\\spad{showAllElements(s)} creates an output form which displays all computed elements.")) (|output| (((|Void|) (|Integer|) $) "\\spad{output(n,{}st)} computes and displays the first \\spad{n} entries of \\spad{st}.")) (|cons| (($ |#1| $) "\\spad{cons(a,{}s)} returns a stream whose \\spad{first} is \\spad{a} and whose \\spad{rest} is \\spad{s}. Note: \\spad{cons(a,{}s) = concat(a,{}s)}.")) (|delay| (($ (|Mapping| $)) "\\spad{delay(f)} creates a stream with a lazy evaluation defined by function \\spad{f}. Caution: This function can only be called in compiled code.")) (|findCycle| (((|Record| (|:| |cycle?| (|Boolean|)) (|:| |prefix| (|NonNegativeInteger|)) (|:| |period| (|NonNegativeInteger|))) (|NonNegativeInteger|) $) "\\spad{findCycle(n,{}st)} determines if \\spad{st} is periodic within \\spad{n}.")) (|repeating?| (((|Boolean|) (|List| |#1|) $) "\\spad{repeating?(l,{}s)} returns \\spad{true} if a stream \\spad{s} is periodic with period \\spad{l},{} and \\spad{false} otherwise.")) (|repeating| (($ (|List| |#1|)) "\\spad{repeating(l)} is a repeating stream whose period is the list \\spad{l}.")) (|coerce| (($ (|List| |#1|)) "\\spad{coerce(l)} converts a list \\spad{l} to a stream.")) (|shallowlyMutable| ((|attribute|) "one may destructively alter a stream by assigning new values to its entries."))) 
 ((-4234 . T)) 
-((|HasCategory| |#1| (QUOTE (-1013))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| (-521) (QUOTE (-784))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))))) 
+((|HasCategory| |#1| (QUOTE (-1013))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| (-521) (QUOTE (-783))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))))) 
 (-1066) 
 ((|constructor| (NIL "A category for string-like objects")) (|string| (($ (|Integer|)) "\\spad{string(i)} returns the decimal representation of \\spad{i} in a string"))) 
-((-4234 . T) (-4233 . T) (-2046 . T)) 
+((-4234 . T) (-4233 . T) (-2092 . T)) 
 NIL 
 (-1067) 
 NIL 
 ((-4234 . T) (-4233 . T)) 
-((|HasCategory| (-132) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| (-132) (QUOTE (-784))) (|HasCategory| (-521) (QUOTE (-784))) (|HasCategory| (-132) (QUOTE (-1013))) (-12 (|HasCategory| (-132) (QUOTE (-1013))) (|HasCategory| (-132) (LIST (QUOTE -284) (QUOTE (-132))))) (-3703 (-12 (|HasCategory| (-132) (QUOTE (-784))) (|HasCategory| (-132) (LIST (QUOTE -284) (QUOTE (-132))))) (-12 (|HasCategory| (-132) (QUOTE (-1013))) (|HasCategory| (-132) (LIST (QUOTE -284) (QUOTE (-132)))))) (|HasCategory| (-132) (LIST (QUOTE -561) (QUOTE (-792))))) 
+((|HasCategory| (-132) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| (-132) (QUOTE (-783))) (|HasCategory| (-521) (QUOTE (-783))) (|HasCategory| (-132) (QUOTE (-1013))) (-12 (|HasCategory| (-132) (QUOTE (-1013))) (|HasCategory| (-132) (LIST (QUOTE -284) (QUOTE (-132))))) (-3703 (-12 (|HasCategory| (-132) (QUOTE (-783))) (|HasCategory| (-132) (LIST (QUOTE -284) (QUOTE (-132))))) (-12 (|HasCategory| (-132) (QUOTE (-1013))) (|HasCategory| (-132) (LIST (QUOTE -284) (QUOTE (-132)))))) (|HasCategory| (-132) (LIST (QUOTE -561) (QUOTE (-791))))) 
 (-1068 |Entry|) 
 ((|constructor| (NIL "This domain provides tables where the keys are strings. A specialized hash function for strings is used."))) 
 ((-4233 . T) (-4234 . T)) 
-((|HasCategory| (-2 (|:| -2529 (-1067)) (|:| -3045 |#1|)) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| (-2 (|:| -2529 (-1067)) (|:| -3045 |#1|)) (QUOTE (-1013))) (-12 (|HasCategory| (-2 (|:| -2529 (-1067)) (|:| -3045 |#1|)) (QUOTE (-1013))) (|HasCategory| (-2 (|:| -2529 (-1067)) (|:| -3045 |#1|)) (LIST (QUOTE -284) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2529) (QUOTE (-1067))) (LIST (QUOTE |:|) (QUOTE -3045) (|devaluate| |#1|)))))) (|HasCategory| (-1067) (QUOTE (-784))) (|HasCategory| |#1| (QUOTE (-1013))) (-3703 (|HasCategory| (-2 (|:| -2529 (-1067)) (|:| -3045 |#1|)) (QUOTE (-1013))) (|HasCategory| |#1| (QUOTE (-1013)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))) (|HasCategory| (-2 (|:| -2529 (-1067)) (|:| -3045 |#1|)) (LIST (QUOTE -561) (QUOTE (-792)))) (-3703 (|HasCategory| (-2 (|:| -2529 (-1067)) (|:| -3045 |#1|)) (QUOTE (-1013))) (|HasCategory| (-2 (|:| -2529 (-1067)) (|:| -3045 |#1|)) (LIST (QUOTE -561) (QUOTE (-792)))) (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792))))) (-3703 (|HasCategory| (-2 (|:| -2529 (-1067)) (|:| -3045 |#1|)) (LIST (QUOTE -561) (QUOTE (-792)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))))) 
+((|HasCategory| (-2 (|:| -2535 (-1067)) (|:| -3050 |#1|)) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| (-2 (|:| -2535 (-1067)) (|:| -3050 |#1|)) (QUOTE (-1013))) (-12 (|HasCategory| (-2 (|:| -2535 (-1067)) (|:| -3050 |#1|)) (QUOTE (-1013))) (|HasCategory| (-2 (|:| -2535 (-1067)) (|:| -3050 |#1|)) (LIST (QUOTE -284) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2535) (QUOTE (-1067))) (LIST (QUOTE |:|) (QUOTE -3050) (|devaluate| |#1|)))))) (|HasCategory| (-1067) (QUOTE (-783))) (|HasCategory| |#1| (QUOTE (-1013))) (-3703 (|HasCategory| (-2 (|:| -2535 (-1067)) (|:| -3050 |#1|)) (QUOTE (-1013))) (|HasCategory| |#1| (QUOTE (-1013)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))) (|HasCategory| (-2 (|:| -2535 (-1067)) (|:| -3050 |#1|)) (LIST (QUOTE -561) (QUOTE (-791)))) (-3703 (|HasCategory| (-2 (|:| -2535 (-1067)) (|:| -3050 |#1|)) (QUOTE (-1013))) (|HasCategory| (-2 (|:| -2535 (-1067)) (|:| -3050 |#1|)) (LIST (QUOTE -561) (QUOTE (-791)))) (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791))))) (-3703 (|HasCategory| (-2 (|:| -2535 (-1067)) (|:| -3050 |#1|)) (LIST (QUOTE -561) (QUOTE (-791)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))))) 
 (-1069 A) 
 ((|constructor| (NIL "StreamTaylorSeriesOperations implements Taylor series arithmetic,{} where a Taylor series is represented by a stream of its coefficients.")) (|power| (((|Stream| |#1|) |#1| (|Stream| |#1|)) "\\spad{power(a,{}f)} returns the power series \\spad{f} raised to the power \\spad{a}.")) (|lazyGintegrate| (((|Stream| |#1|) (|Mapping| |#1| (|Integer|)) |#1| (|Mapping| (|Stream| |#1|))) "\\spad{lazyGintegrate(f,{}r,{}g)} is used for fixed point computations.")) (|mapdiv| (((|Stream| |#1|) (|Stream| |#1|) (|Stream| |#1|)) "\\spad{mapdiv([a0,{}a1,{}..],{}[b0,{}b1,{}..])} returns \\spad{[a0/b0,{}a1/b1,{}..]}.")) (|powern| (((|Stream| |#1|) (|Fraction| (|Integer|)) (|Stream| |#1|)) "\\spad{powern(r,{}f)} raises power series \\spad{f} to the power \\spad{r}.")) (|nlde| (((|Stream| |#1|) (|Stream| (|Stream| |#1|))) "\\spad{nlde(u)} solves a first order non-linear differential equation described by \\spad{u} of the form \\spad{[[b<0,{}0>,{}b<0,{}1>,{}...],{}[b<1,{}0>,{}b<1,{}1>,{}.],{}...]}. the differential equation has the form \\spad{y' = sum(i=0 to infinity,{}j=0 to infinity,{}b<i,{}j>*(x**i)*(y**j))}.")) (|lazyIntegrate| (((|Stream| |#1|) |#1| (|Mapping| (|Stream| |#1|))) "\\spad{lazyIntegrate(r,{}f)} is a local function used for fixed point computations.")) (|integrate| (((|Stream| |#1|) |#1| (|Stream| |#1|)) "\\spad{integrate(r,{}a)} returns the integral of the power series \\spad{a} with respect to the power series variableintegration where \\spad{r} denotes the constant of integration. Thus \\spad{integrate(a,{}[a0,{}a1,{}a2,{}...]) = [a,{}a0,{}a1/2,{}a2/3,{}...]}.")) (|invmultisect| (((|Stream| |#1|) (|Integer|) (|Integer|) (|Stream| |#1|)) "\\spad{invmultisect(a,{}b,{}st)} substitutes \\spad{x**((a+b)*n)} for \\spad{x**n} and multiplies by \\spad{x**b}.")) (|multisect| (((|Stream| |#1|) (|Integer|) (|Integer|) (|Stream| |#1|)) "\\spad{multisect(a,{}b,{}st)} selects the coefficients of \\spad{x**((a+b)*n+a)},{} and changes them to \\spad{x**n}.")) (|generalLambert| (((|Stream| |#1|) (|Stream| |#1|) (|Integer|) (|Integer|)) "\\spad{generalLambert(f(x),{}a,{}d)} returns \\spad{f(x**a) + f(x**(a + d)) + f(x**(a + 2 d)) + ...}. \\spad{f(x)} should have zero constant coefficient and \\spad{a} and \\spad{d} should be positive.")) (|evenlambert| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{evenlambert(st)} computes \\spad{f(x**2) + f(x**4) + f(x**6) + ...} if \\spad{st} is a stream representing \\spad{f(x)}. This function is used for computing infinite products. If \\spad{f(x)} is a power series with constant coefficient 1,{} then \\spad{prod(f(x**(2*n)),{}n=1..infinity) = exp(evenlambert(log(f(x))))}.")) (|oddlambert| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{oddlambert(st)} computes \\spad{f(x) + f(x**3) + f(x**5) + ...} if \\spad{st} is a stream representing \\spad{f(x)}. This function is used for computing infinite products. If \\spad{f}(\\spad{x}) is a power series with constant coefficient 1 then \\spad{prod(f(x**(2*n-1)),{}n=1..infinity) = exp(oddlambert(log(f(x))))}.")) (|lambert| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{lambert(st)} computes \\spad{f(x) + f(x**2) + f(x**3) + ...} if \\spad{st} is a stream representing \\spad{f(x)}. This function is used for computing infinite products. If \\spad{f(x)} is a power series with constant coefficient 1 then \\spad{prod(f(x**n),{}n = 1..infinity) = exp(lambert(log(f(x))))}.")) (|addiag| (((|Stream| |#1|) (|Stream| (|Stream| |#1|))) "\\spad{addiag(x)} performs diagonal addition of a stream of streams. if \\spad{x} = \\spad{[[a<0,{}0>,{}a<0,{}1>,{}..],{}[a<1,{}0>,{}a<1,{}1>,{}..],{}[a<2,{}0>,{}a<2,{}1>,{}..],{}..]} and \\spad{addiag(x) = [b<0,{}b<1>,{}...],{} then b<k> = sum(i+j=k,{}a<i,{}j>)}.")) (|revert| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{revert(a)} computes the inverse of a power series \\spad{a} with respect to composition. the series should have constant coefficient 0 and first order coefficient 1.")) (|lagrange| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{lagrange(g)} produces the power series for \\spad{f} where \\spad{f} is implicitly defined as \\spad{f(z) = z*g(f(z))}.")) (|compose| (((|Stream| |#1|) (|Stream| |#1|) (|Stream| |#1|)) "\\spad{compose(a,{}b)} composes the power series \\spad{a} with the power series \\spad{b}.")) (|eval| (((|Stream| |#1|) (|Stream| |#1|) |#1|) "\\spad{eval(a,{}r)} returns a stream of partial sums of the power series \\spad{a} evaluated at the power series variable equal to \\spad{r}.")) (|coerce| (((|Stream| |#1|) |#1|) "\\spad{coerce(r)} converts a ring element \\spad{r} to a stream with one element.")) (|gderiv| (((|Stream| |#1|) (|Mapping| |#1| (|Integer|)) (|Stream| |#1|)) "\\spad{gderiv(f,{}[a0,{}a1,{}a2,{}..])} returns \\spad{[f(0)*a0,{}f(1)*a1,{}f(2)*a2,{}..]}.")) (|deriv| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{deriv(a)} returns the derivative of the power series with respect to the power series variable. Thus \\spad{deriv([a0,{}a1,{}a2,{}...])} returns \\spad{[a1,{}2 a2,{}3 a3,{}...]}.")) (|mapmult| (((|Stream| |#1|) (|Stream| |#1|) (|Stream| |#1|)) "\\spad{mapmult([a0,{}a1,{}..],{}[b0,{}b1,{}..])} returns \\spad{[a0*b0,{}a1*b1,{}..]}.")) (|int| (((|Stream| |#1|) |#1|) "\\spad{int(r)} returns [\\spad{r},{}\\spad{r+1},{}\\spad{r+2},{}...],{} where \\spad{r} is a ring element.")) (|oddintegers| (((|Stream| (|Integer|)) (|Integer|)) "\\spad{oddintegers(n)} returns \\spad{[n,{}n+2,{}n+4,{}...]}.")) (|integers| (((|Stream| (|Integer|)) (|Integer|)) "\\spad{integers(n)} returns \\spad{[n,{}n+1,{}n+2,{}...]}.")) (|monom| (((|Stream| |#1|) |#1| (|Integer|)) "\\spad{monom(deg,{}coef)} is a monomial of degree \\spad{deg} with coefficient \\spad{coef}.")) (|recip| (((|Union| (|Stream| |#1|) "failed") (|Stream| |#1|)) "\\spad{recip(a)} returns the power series reciprocal of \\spad{a},{} or \"failed\" if not possible.")) (/ (((|Stream| |#1|) (|Stream| |#1|) (|Stream| |#1|)) "\\spad{a / b} returns the power series quotient of \\spad{a} by \\spad{b}. An error message is returned if \\spad{b} is not invertible. This function is used in fixed point computations.")) (|exquo| (((|Union| (|Stream| |#1|) "failed") (|Stream| |#1|) (|Stream| |#1|)) "\\spad{exquo(a,{}b)} returns the power series quotient of \\spad{a} by \\spad{b},{} if the quotient exists,{} and \"failed\" otherwise")) (* (((|Stream| |#1|) (|Stream| |#1|) |#1|) "\\spad{a * r} returns the power series scalar multiplication of \\spad{a} by \\spad{r:} \\spad{[a0,{}a1,{}...] * r = [a0 * r,{}a1 * r,{}...]}") (((|Stream| |#1|) |#1| (|Stream| |#1|)) "\\spad{r * a} returns the power series scalar multiplication of \\spad{r} by \\spad{a}: \\spad{r * [a0,{}a1,{}...] = [r * a0,{}r * a1,{}...]}") (((|Stream| |#1|) (|Stream| |#1|) (|Stream| |#1|)) "\\spad{a * b} returns the power series (Cauchy) product of \\spad{a} and \\spad{b:} \\spad{[a0,{}a1,{}...] * [b0,{}b1,{}...] = [c0,{}c1,{}...]} where \\spad{ck = sum(i + j = k,{}\\spad{ai} * bk)}.")) (- (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{- a} returns the power series negative of \\spad{a}: \\spad{- [a0,{}a1,{}...] = [- a0,{}- a1,{}...]}") (((|Stream| |#1|) (|Stream| |#1|) (|Stream| |#1|)) "\\spad{a - b} returns the power series difference of \\spad{a} and \\spad{b}: \\spad{[a0,{}a1,{}..] - [b0,{}b1,{}..] = [a0 - b0,{}a1 - b1,{}..]}")) (+ (((|Stream| |#1|) (|Stream| |#1|) (|Stream| |#1|)) "\\spad{a + b} returns the power series sum of \\spad{a} and \\spad{b}: \\spad{[a0,{}a1,{}..] + [b0,{}b1,{}..] = [a0 + b0,{}a1 + b1,{}..]}"))) 
 NIL 
@@ -4230,8 +4230,8 @@ NIL
 NIL 
 (-1075 |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."))) 
-(((-4235 "*") -3703 (-4009 (|has| |#1| (-337)) (|has| (-1082 |#1| |#2| |#3|) (-757))) (|has| |#1| (-157)) (-4009 (|has| |#1| (-337)) (|has| (-1082 |#1| |#2| |#3|) (-838)))) (-4226 -3703 (-4009 (|has| |#1| (-337)) (|has| (-1082 |#1| |#2| |#3|) (-757))) (|has| |#1| (-513)) (-4009 (|has| |#1| (-337)) (|has| (-1082 |#1| |#2| |#3|) (-838)))) (-4231 |has| |#1| (-337)) (-4225 |has| |#1| (-337)) (-4227 . T) (-4228 . T) (-4230 . T)) 
-((|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-157))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-513)))) (|HasCategory| (-521) (QUOTE (-1025))) (|HasCategory| |#1| (QUOTE (-337))) (-3703 (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasCategory| |#1| (QUOTE (-135)))) (-3703 (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-521)) (|devaluate| |#1|)))))) (-3703 (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-210))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-521)) (|devaluate| |#1|))))) (-3703 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-513)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (LIST (QUOTE -961) (QUOTE (-1084)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-946))) (|HasCategory| |#1| (QUOTE (-337)))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-513)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-757))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-1060))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (LIST (QUOTE -261) (LIST (QUOTE -1082) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1082) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (LIST (QUOTE -284) (LIST (QUOTE -1082) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (LIST (QUOTE -482) (QUOTE (-1084)) (LIST (QUOTE -1082) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-353))))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (LIST (QUOTE -815) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (LIST (QUOTE -815) (QUOTE (-353)))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-521))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-521))))) (|HasSignature| |#1| (LIST (QUOTE -2189) (LIST (|devaluate| |#1|) (QUOTE (-1084)))))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-506))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-282))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-838))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-838))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-133))) (-3703 (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasCategory| |#1| (QUOTE (-133)))) (-3703 (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-757))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-838))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasCategory| |#1| (QUOTE (-513)))) (-3703 (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-757))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-838))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasCategory| |#1| (QUOTE (-157)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-784))) (|HasCategory| |#1| (QUOTE (-337)))) (-3703 (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-757))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-784))) (|HasCategory| |#1| (QUOTE (-337))))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (-3703 (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-757))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-784))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-838))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-946))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-1060))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-353))))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (LIST (QUOTE -261) (LIST (QUOTE -1082) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1082) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (LIST (QUOTE -284) (LIST (QUOTE -1082) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (LIST (QUOTE -482) (QUOTE (-1084)) (LIST (QUOTE -1082) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (LIST (QUOTE -815) (QUOTE (-353)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (LIST (QUOTE -815) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (LIST (QUOTE -961) (QUOTE (-1084)))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521)))))) (-3703 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-887))) (|HasCategory| |#1| (QUOTE (-1105))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasSignature| |#1| (LIST (QUOTE -2184) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1084))))) (|HasSignature| |#1| (LIST (QUOTE -4084) (LIST (LIST (QUOTE -587) (QUOTE (-1084))) (|devaluate| |#1|)))))) (-3703 (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521)))))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-838))) (|HasCategory| |#1| (QUOTE (-337)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-838))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasCategory| |#1| (QUOTE (-133))))) 
+(((-4235 "*") -3703 (-4009 (|has| |#1| (-337)) (|has| (-1082 |#1| |#2| |#3|) (-756))) (|has| |#1| (-157)) (-4009 (|has| |#1| (-337)) (|has| (-1082 |#1| |#2| |#3|) (-837)))) (-4226 -3703 (-4009 (|has| |#1| (-337)) (|has| (-1082 |#1| |#2| |#3|) (-756))) (|has| |#1| (-513)) (-4009 (|has| |#1| (-337)) (|has| (-1082 |#1| |#2| |#3|) (-837)))) (-4231 |has| |#1| (-337)) (-4225 |has| |#1| (-337)) (-4227 . T) (-4228 . T) (-4230 . T)) 
+((|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-157))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-513)))) (|HasCategory| (-521) (QUOTE (-1025))) (|HasCategory| |#1| (QUOTE (-337))) (-3703 (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasCategory| |#1| (QUOTE (-135)))) (-3703 (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-521)) (|devaluate| |#1|)))))) (-3703 (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-210))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-521)) (|devaluate| |#1|))))) (-3703 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-513)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (LIST (QUOTE -961) (QUOTE (-1084)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-946))) (|HasCategory| |#1| (QUOTE (-337)))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-513)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-756))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-1060))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (LIST (QUOTE -261) (LIST (QUOTE -1082) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1082) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (LIST (QUOTE -284) (LIST (QUOTE -1082) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (LIST (QUOTE -482) (QUOTE (-1084)) (LIST (QUOTE -1082) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-353))))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (LIST (QUOTE -814) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (LIST (QUOTE -814) (QUOTE (-353)))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-521))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-521))))) (|HasSignature| |#1| (LIST (QUOTE -2223) (LIST (|devaluate| |#1|) (QUOTE (-1084)))))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-506))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-282))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-837))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-837))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-133))) (-3703 (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasCategory| |#1| (QUOTE (-133)))) (-3703 (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-756))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-837))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasCategory| |#1| (QUOTE (-513)))) (-3703 (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-756))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-837))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasCategory| |#1| (QUOTE (-157)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-783))) (|HasCategory| |#1| (QUOTE (-337)))) (-3703 (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-756))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-783))) (|HasCategory| |#1| (QUOTE (-337))))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (-3703 (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-756))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-783))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-837))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-946))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-1060))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-353))))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (LIST (QUOTE -261) (LIST (QUOTE -1082) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1082) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (LIST (QUOTE -284) (LIST (QUOTE -1082) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (LIST (QUOTE -482) (QUOTE (-1084)) (LIST (QUOTE -1082) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (LIST (QUOTE -814) (QUOTE (-353)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (LIST (QUOTE -814) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (LIST (QUOTE -961) (QUOTE (-1084)))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521)))))) (-3703 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-886))) (|HasCategory| |#1| (QUOTE (-1105))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasSignature| |#1| (LIST (QUOTE -1749) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1084))))) (|HasSignature| |#1| (LIST (QUOTE -4085) (LIST (LIST (QUOTE -587) (QUOTE (-1084))) (|devaluate| |#1|)))))) (-3703 (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521)))))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-837))) (|HasCategory| |#1| (QUOTE (-337)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-837))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1082 |#1| |#2| |#3|) (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasCategory| |#1| (QUOTE (-133))))) 
 (-1076 R -4049) 
 ((|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 
@@ -4251,15 +4251,15 @@ NIL
 (-1080 R) 
 ((|constructor| (NIL "This domain represents univariate polynomials over arbitrary (not necessarily commutative) coefficient rings. The variable is unspecified so that the variable displays as \\spad{?} on output. If it is necessary to specify the variable name,{} use type \\spadtype{UnivariatePolynomial}. The representation is sparse in the sense that only non-zero terms are represented.")) (|fmecg| (($ $ (|NonNegativeInteger|) |#1| $) "\\spad{fmecg(p1,{}e,{}r,{}p2)} finds \\spad{X} : \\spad{p1} - \\spad{r} * X**e * \\spad{p2}")) (|outputForm| (((|OutputForm|) $ (|OutputForm|)) "\\spad{outputForm(p,{}var)} converts the SparseUnivariatePolynomial \\spad{p} to an output form (see \\spadtype{OutputForm}) printed as a polynomial in the output form variable."))) 
 (((-4235 "*") |has| |#1| (-157)) (-4226 |has| |#1| (-513)) (-4229 |has| |#1| (-337)) (-4231 |has| |#1| (-6 -4231)) (-4228 . T) (-4227 . T) (-4230 . T)) 
-((|HasCategory| |#1| (QUOTE (-838))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-157))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-513)))) (-12 (|HasCategory| (-998) (LIST (QUOTE -815) (QUOTE (-353)))) (|HasCategory| |#1| (LIST (QUOTE -815) (QUOTE (-353))))) (-12 (|HasCategory| (-998) (LIST (QUOTE -815) (QUOTE (-521)))) (|HasCategory| |#1| (LIST (QUOTE -815) (QUOTE (-521))))) (-12 (|HasCategory| (-998) (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-353))))) (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-353)))))) (-12 (|HasCategory| (-998) (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521)))))) (-12 (|HasCategory| (-998) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497))))) (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| |#1| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-1060))) (|HasCategory| |#1| (LIST (QUOTE -829) (QUOTE (-1084)))) (-3703 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521)))))) (|HasCategory| |#1| (QUOTE (-210))) (|HasAttribute| |#1| (QUOTE -4231)) (|HasCategory| |#1| (QUOTE (-425))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-838)))) (-3703 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-838)))) (-3703 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-838)))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-838)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-838)))) (|HasCategory| |#1| (QUOTE (-133))))) 
+((|HasCategory| |#1| (QUOTE (-837))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-157))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-513)))) (-12 (|HasCategory| (-998) (LIST (QUOTE -814) (QUOTE (-353)))) (|HasCategory| |#1| (LIST (QUOTE -814) (QUOTE (-353))))) (-12 (|HasCategory| (-998) (LIST (QUOTE -814) (QUOTE (-521)))) (|HasCategory| |#1| (LIST (QUOTE -814) (QUOTE (-521))))) (-12 (|HasCategory| (-998) (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-353))))) (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-353)))))) (-12 (|HasCategory| (-998) (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521)))))) (-12 (|HasCategory| (-998) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497))))) (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#1| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-1060))) (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1084)))) (-3703 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521)))))) (|HasCategory| |#1| (QUOTE (-210))) (|HasAttribute| |#1| (QUOTE -4231)) (|HasCategory| |#1| (QUOTE (-425))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-837)))) (-3703 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-837)))) (-3703 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-425))) (|HasCategory| |#1| (QUOTE (-837)))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-837)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-837)))) (|HasCategory| |#1| (QUOTE (-133))))) 
 (-1081 |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}.")) (|coerce| (($ (|Variable| |#2|)) "\\spad{coerce(var)} converts the series variable \\spad{var} into a Puiseux series."))) 
 (((-4235 "*") |has| |#1| (-157)) (-4226 |has| |#1| (-513)) (-4231 |has| |#1| (-337)) (-4225 |has| |#1| (-337)) (-4227 . T) (-4228 . T) (-4230 . T)) 
-((|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-157))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-513)))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -381) (QUOTE (-521))) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -381) (QUOTE (-521))) (|devaluate| |#1|))))) (|HasCategory| (-381 (-521)) (QUOTE (-1025))) (|HasCategory| |#1| (QUOTE (-337))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-513)))) (-3703 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-513)))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -381) (QUOTE (-521)))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -381) (QUOTE (-521)))))) (|HasSignature| |#1| (LIST (QUOTE -2189) (LIST (|devaluate| |#1|) (QUOTE (-1084)))))) (-3703 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-887))) (|HasCategory| |#1| (QUOTE (-1105))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasSignature| |#1| (LIST (QUOTE -2184) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1084))))) (|HasSignature| |#1| (LIST (QUOTE -4084) (LIST (LIST (QUOTE -587) (QUOTE (-1084))) (|devaluate| |#1|))))))) 
+((|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-157))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-513)))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -381) (QUOTE (-521))) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -381) (QUOTE (-521))) (|devaluate| |#1|))))) (|HasCategory| (-381 (-521)) (QUOTE (-1025))) (|HasCategory| |#1| (QUOTE (-337))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-513)))) (-3703 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-513)))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -381) (QUOTE (-521)))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -381) (QUOTE (-521)))))) (|HasSignature| |#1| (LIST (QUOTE -2223) (LIST (|devaluate| |#1|) (QUOTE (-1084)))))) (-3703 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-886))) (|HasCategory| |#1| (QUOTE (-1105))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasSignature| |#1| (LIST (QUOTE -1749) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1084))))) (|HasSignature| |#1| (LIST (QUOTE -4085) (LIST (LIST (QUOTE -587) (QUOTE (-1084))) (|devaluate| |#1|))))))) 
 (-1082 |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}."))) 
 (((-4235 "*") |has| |#1| (-157)) (-4226 |has| |#1| (-513)) (-4227 . T) (-4228 . T) (-4230 . T)) 
-((|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-157))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-513)))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-707)) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-707)) (|devaluate| |#1|))))) (|HasCategory| (-707) (QUOTE (-1025))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-707))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-707))))) (|HasSignature| |#1| (LIST (QUOTE -2189) (LIST (|devaluate| |#1|) (QUOTE (-1084)))))) (|HasCategory| |#1| (QUOTE (-337))) (-3703 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-887))) (|HasCategory| |#1| (QUOTE (-1105))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasSignature| |#1| (LIST (QUOTE -2184) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1084))))) (|HasSignature| |#1| (LIST (QUOTE -4084) (LIST (LIST (QUOTE -587) (QUOTE (-1084))) (|devaluate| |#1|))))))) 
+((|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-157))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-513)))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-707)) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-707)) (|devaluate| |#1|))))) (|HasCategory| (-707) (QUOTE (-1025))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-707))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-707))))) (|HasSignature| |#1| (LIST (QUOTE -2223) (LIST (|devaluate| |#1|) (QUOTE (-1084)))))) (|HasCategory| |#1| (QUOTE (-337))) (-3703 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-886))) (|HasCategory| |#1| (QUOTE (-1105))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasSignature| |#1| (LIST (QUOTE -1749) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1084))))) (|HasSignature| |#1| (LIST (QUOTE -4085) (LIST (LIST (QUOTE -587) (QUOTE (-1084))) (|devaluate| |#1|))))))) 
 (-1083) 
 ((|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 
@@ -4303,7 +4303,7 @@ NIL
 (-1093 |Key| |Entry|) 
 ((|constructor| (NIL "This is the general purpose table type. The keys are hashed to look up the entries. This creates a \\spadtype{HashTable} if equal for the Key domain is consistent with Lisp EQUAL otherwise an \\spadtype{AssociationList}"))) 
 ((-4233 . T) (-4234 . T)) 
-((|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (QUOTE (-1013))) (-12 (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (QUOTE (-1013))) (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (LIST (QUOTE -284) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2529) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3045) (|devaluate| |#2|)))))) (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| |#2| (QUOTE (-1013))) (-3703 (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (QUOTE (-1013))) (|HasCategory| |#2| (QUOTE (-1013)))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-792)))) (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (LIST (QUOTE -561) (QUOTE (-792)))) (-3703 (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (QUOTE (-1013))) (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (LIST (QUOTE -561) (QUOTE (-792)))) (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-792))))) (-3703 (|HasCategory| (-2 (|:| -2529 |#1|) (|:| -3045 |#2|)) (LIST (QUOTE -561) (QUOTE (-792)))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-792)))))) 
+((|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (QUOTE (-1013))) (-12 (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (QUOTE (-1013))) (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (LIST (QUOTE -284) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2535) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3050) (|devaluate| |#2|)))))) (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#2| (QUOTE (-1013))) (-3703 (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (QUOTE (-1013))) (|HasCategory| |#2| (QUOTE (-1013)))) (-12 (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-791)))) (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (LIST (QUOTE -561) (QUOTE (-791)))) (-3703 (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (QUOTE (-1013))) (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (LIST (QUOTE -561) (QUOTE (-791)))) (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-791))))) (-3703 (|HasCategory| (-2 (|:| -2535 |#1|) (|:| -3050 |#2|)) (LIST (QUOTE -561) (QUOTE (-791)))) (|HasCategory| |#2| (LIST (QUOTE -561) (QUOTE (-791)))))) 
 (-1094 R) 
 ((|constructor| (NIL "Expands tangents of sums and scalar products.")) (|tanNa| ((|#1| |#1| (|Integer|)) "\\spad{tanNa(a,{} n)} returns \\spad{f(a)} such that if \\spad{a = tan(u)} then \\spad{f(a) = tan(n * u)}.")) (|tanAn| (((|SparseUnivariatePolynomial| |#1|) |#1| (|PositiveInteger|)) "\\spad{tanAn(a,{} n)} returns \\spad{P(x)} such that if \\spad{a = tan(u)} then \\spad{P(tan(u/n)) = 0}.")) (|tanSum| ((|#1| (|List| |#1|)) "\\spad{tanSum([a1,{}...,{}an])} returns \\spad{f(a1,{}...,{}an)} such that if \\spad{\\spad{ai} = tan(\\spad{ui})} then \\spad{f(a1,{}...,{}an) = tan(u1 + ... + un)}."))) 
 NIL 
@@ -4314,7 +4314,7 @@ NIL
 NIL 
 (-1096 |Key| |Entry|) 
 ((|constructor| (NIL "A table aggregate is a model of a table,{} \\spadignore{i.e.} a discrete many-to-one mapping from keys to entries.")) (|map| (($ (|Mapping| |#2| |#2| |#2|) $ $) "\\spad{map(fn,{}t1,{}t2)} creates a new table \\spad{t} from given tables \\spad{t1} and \\spad{t2} with elements \\spad{fn}(\\spad{x},{}\\spad{y}) where \\spad{x} and \\spad{y} are corresponding elements from \\spad{t1} and \\spad{t2} respectively.")) (|table| (($ (|List| (|Record| (|:| |key| |#1|) (|:| |entry| |#2|)))) "\\spad{table([x,{}y,{}...,{}z])} creates a table consisting of entries \\axiom{\\spad{x},{}\\spad{y},{}...,{}\\spad{z}}.") (($) "\\spad{table()}\\$\\spad{T} creates an empty table of type \\spad{T}.")) (|setelt| ((|#2| $ |#1| |#2|) "\\spad{setelt(t,{}k,{}e)} (also written \\axiom{\\spad{t}.\\spad{k} \\spad{:=} \\spad{e}}) is equivalent to \\axiom{(insert([\\spad{k},{}\\spad{e}],{}\\spad{t}); \\spad{e})}."))) 
-((-4234 . T) (-2046 . T)) 
+((-4234 . T) (-2092 . T)) 
 NIL 
 (-1097 |Key| |Entry|) 
 ((|constructor| (NIL "\\axiom{TabulatedComputationPackage(Key ,{}Entry)} provides some modest support for dealing with operations with type \\axiom{Key \\spad{->} Entry}. The result of such operations can be stored and retrieved with this package by using a hash-table. The user does not need to worry about the management of this hash-table. However,{} onnly one hash-table is built by calling \\axiom{TabulatedComputationPackage(Key ,{}Entry)}.")) (|insert!| (((|Void|) |#1| |#2|) "\\axiom{insert!(\\spad{x},{}\\spad{y})} stores the item whose key is \\axiom{\\spad{x}} and whose entry is \\axiom{\\spad{y}}.")) (|extractIfCan| (((|Union| |#2| "failed") |#1|) "\\axiom{extractIfCan(\\spad{x})} searches the item whose key is \\axiom{\\spad{x}}.")) (|makingStats?| (((|Boolean|)) "\\axiom{makingStats?()} returns \\spad{true} iff the statisitics process is running.")) (|printingInfo?| (((|Boolean|)) "\\axiom{printingInfo?()} returns \\spad{true} iff messages are printed when manipulating items from the hash-table.")) (|usingTable?| (((|Boolean|)) "\\axiom{usingTable?()} returns \\spad{true} iff the hash-table is used")) (|clearTable!| (((|Void|)) "\\axiom{clearTable!()} clears the hash-table and assumes that it will no longer be used.")) (|printStats!| (((|Void|)) "\\axiom{printStats!()} prints the statistics.")) (|startStats!| (((|Void|) (|String|)) "\\axiom{startStats!(\\spad{x})} initializes the statisitics process and sets the comments to display when statistics are printed")) (|printInfo!| (((|Void|) (|String|) (|String|)) "\\axiom{printInfo!(\\spad{x},{}\\spad{y})} initializes the mesages to be printed when manipulating items from the hash-table. If a key is retrieved then \\axiom{\\spad{x}} is displayed. If an item is stored then \\axiom{\\spad{y}} is displayed.")) (|initTable!| (((|Void|)) "\\axiom{initTable!()} initializes the hash-table."))) 
@@ -4355,7 +4355,7 @@ NIL
 (-1106 S) 
 ((|constructor| (NIL "\\spadtype{Tree(S)} is a basic domains of tree structures. Each tree is either empty or else is a {\\it node} consisting of a value and a list of (sub)trees.")) (|cyclicParents| (((|List| $) $) "\\spad{cyclicParents(t)} returns a list of cycles that are parents of \\spad{t}.")) (|cyclicEqual?| (((|Boolean|) $ $) "\\spad{cyclicEqual?(t1,{} t2)} tests of two cyclic trees have the same structure.")) (|cyclicEntries| (((|List| $) $) "\\spad{cyclicEntries(t)} returns a list of top-level cycles in tree \\spad{t}.")) (|cyclicCopy| (($ $) "\\spad{cyclicCopy(l)} makes a copy of a (possibly) cyclic tree \\spad{l}.")) (|cyclic?| (((|Boolean|) $) "\\spad{cyclic?(t)} tests if \\spad{t} is a cyclic tree.")) (|tree| (($ |#1|) "\\spad{tree(nd)} creates a tree with value \\spad{nd},{} and no children") (($ (|List| |#1|)) "\\spad{tree(ls)} creates a tree from a list of elements of \\spad{s}.") (($ |#1| (|List| $)) "\\spad{tree(nd,{}ls)} creates a tree with value \\spad{nd},{} and children \\spad{ls}."))) 
 ((-4234 . T) (-4233 . T)) 
-((|HasCategory| |#1| (QUOTE (-1013))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))))) 
+((|HasCategory| |#1| (QUOTE (-1013))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))))) 
 (-1107 S) 
 ((|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 
@@ -4375,14 +4375,14 @@ NIL
 (-1111 R -4049) 
 ((|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 -562) (LIST (QUOTE -821) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -815) (|devaluate| |#1|))) (|HasCategory| |#2| (LIST (QUOTE -562) (LIST (QUOTE -821) (|devaluate| |#1|)))) (|HasCategory| |#2| (LIST (QUOTE -815) (|devaluate| |#1|))))) 
+((-12 (|HasCategory| |#1| (LIST (QUOTE -562) (LIST (QUOTE -820) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -814) (|devaluate| |#1|))) (|HasCategory| |#2| (LIST (QUOTE -562) (LIST (QUOTE -820) (|devaluate| |#1|)))) (|HasCategory| |#2| (LIST (QUOTE -814) (|devaluate| |#1|))))) 
 (-1112 S R E V P) 
 ((|constructor| (NIL "The category of triangular sets of multivariate polynomials with coefficients in an integral domain. Let \\axiom{\\spad{R}} be an integral domain and \\axiom{\\spad{V}} a finite ordered set of variables,{} say \\axiom{\\spad{X1} < \\spad{X2} < ... < \\spad{Xn}}. A set \\axiom{\\spad{S}} of polynomials in \\axiom{\\spad{R}[\\spad{X1},{}\\spad{X2},{}...,{}\\spad{Xn}]} is triangular if no elements of \\axiom{\\spad{S}} lies in \\axiom{\\spad{R}},{} and if two distinct elements of \\axiom{\\spad{S}} have distinct main variables. Note that the empty set is a triangular set. A triangular set is not necessarily a (lexicographical) Groebner basis and the notion of reduction related to triangular sets is based on the recursive view of polynomials. We recall this notion here and refer to [1] for more details. A polynomial \\axiom{\\spad{P}} is reduced \\spad{w}.\\spad{r}.\\spad{t} a non-constant polynomial \\axiom{\\spad{Q}} if the degree of \\axiom{\\spad{P}} in the main variable of \\axiom{\\spad{Q}} is less than the main degree of \\axiom{\\spad{Q}}. A polynomial \\axiom{\\spad{P}} is reduced \\spad{w}.\\spad{r}.\\spad{t} a triangular set \\axiom{\\spad{T}} if it is reduced \\spad{w}.\\spad{r}.\\spad{t}. every polynomial of \\axiom{\\spad{T}}. \\newline References : \\indented{1}{[1] \\spad{P}. AUBRY,{} \\spad{D}. LAZARD and \\spad{M}. MORENO MAZA \"On the Theories} \\indented{5}{of Triangular Sets\" Journal of Symbol. Comp. (to appear)}")) (|coHeight| (((|NonNegativeInteger|) $) "\\axiom{coHeight(\\spad{ts})} returns \\axiom{size()\\spad{\\$}\\spad{V}} minus \\axiom{\\spad{\\#}\\spad{ts}}.")) (|extend| (($ $ |#5|) "\\axiom{extend(\\spad{ts},{}\\spad{p})} returns a triangular set which encodes the simple extension by \\axiom{\\spad{p}} of the extension of the base field defined by \\axiom{\\spad{ts}},{} according to the properties of triangular sets of the current category If the required properties do not hold an error is returned.")) (|extendIfCan| (((|Union| $ "failed") $ |#5|) "\\axiom{extendIfCan(\\spad{ts},{}\\spad{p})} returns a triangular set which encodes the simple extension by \\axiom{\\spad{p}} of the extension of the base field defined by \\axiom{\\spad{ts}},{} according to the properties of triangular sets of the current domain. If the required properties do not hold then \"failed\" is returned. This operation encodes in some sense the properties of the triangular sets of the current category. Is is used to implement the \\axiom{construct} operation to guarantee that every triangular set build from a list of polynomials has the required properties.")) (|select| (((|Union| |#5| "failed") $ |#4|) "\\axiom{select(\\spad{ts},{}\\spad{v})} returns the polynomial of \\axiom{\\spad{ts}} with \\axiom{\\spad{v}} as main variable,{} if any.")) (|algebraic?| (((|Boolean|) |#4| $) "\\axiom{algebraic?(\\spad{v},{}\\spad{ts})} returns \\spad{true} iff \\axiom{\\spad{v}} is the main variable of some polynomial in \\axiom{\\spad{ts}}.")) (|algebraicVariables| (((|List| |#4|) $) "\\axiom{algebraicVariables(\\spad{ts})} returns the decreasingly sorted list of the main variables of the polynomials of \\axiom{\\spad{ts}}.")) (|rest| (((|Union| $ "failed") $) "\\axiom{rest(\\spad{ts})} returns the polynomials of \\axiom{\\spad{ts}} with smaller main variable than \\axiom{mvar(\\spad{ts})} if \\axiom{\\spad{ts}} is not empty,{} otherwise returns \"failed\"")) (|last| (((|Union| |#5| "failed") $) "\\axiom{last(\\spad{ts})} returns the polynomial of \\axiom{\\spad{ts}} with smallest main variable if \\axiom{\\spad{ts}} is not empty,{} otherwise returns \\axiom{\"failed\"}.")) (|first| (((|Union| |#5| "failed") $) "\\axiom{first(\\spad{ts})} returns the polynomial of \\axiom{\\spad{ts}} with greatest main variable if \\axiom{\\spad{ts}} is not empty,{} otherwise returns \\axiom{\"failed\"}.")) (|zeroSetSplitIntoTriangularSystems| (((|List| (|Record| (|:| |close| $) (|:| |open| (|List| |#5|)))) (|List| |#5|)) "\\axiom{zeroSetSplitIntoTriangularSystems(\\spad{lp})} returns a list of triangular systems \\axiom{[[\\spad{ts1},{}\\spad{qs1}],{}...,{}[\\spad{tsn},{}\\spad{qsn}]]} such that the zero set of \\axiom{\\spad{lp}} is the union of the closures of the \\axiom{W_i} where \\axiom{W_i} consists of the zeros of \\axiom{\\spad{ts}} which do not cancel any polynomial in \\axiom{qsi}.")) (|zeroSetSplit| (((|List| $) (|List| |#5|)) "\\axiom{zeroSetSplit(\\spad{lp})} returns a list \\axiom{\\spad{lts}} of triangular sets such that the zero set of \\axiom{\\spad{lp}} is the union of the closures of the regular zero sets of the members of \\axiom{\\spad{lts}}.")) (|reduceByQuasiMonic| ((|#5| |#5| $) "\\axiom{reduceByQuasiMonic(\\spad{p},{}\\spad{ts})} returns the same as \\axiom{remainder(\\spad{p},{}collectQuasiMonic(\\spad{ts})).polnum}.")) (|collectQuasiMonic| (($ $) "\\axiom{collectQuasiMonic(\\spad{ts})} returns the subset of \\axiom{\\spad{ts}} consisting of the polynomials with initial in \\axiom{\\spad{R}}.")) (|removeZero| ((|#5| |#5| $) "\\axiom{removeZero(\\spad{p},{}\\spad{ts})} returns \\axiom{0} if \\axiom{\\spad{p}} reduces to \\axiom{0} by pseudo-division \\spad{w}.\\spad{r}.\\spad{t} \\axiom{\\spad{ts}} otherwise returns a polynomial \\axiom{\\spad{q}} computed from \\axiom{\\spad{p}} by removing any coefficient in \\axiom{\\spad{p}} reducing to \\axiom{0}.")) (|initiallyReduce| ((|#5| |#5| $) "\\axiom{initiallyReduce(\\spad{p},{}\\spad{ts})} returns a polynomial \\axiom{\\spad{r}} such that \\axiom{initiallyReduced?(\\spad{r},{}\\spad{ts})} holds and there exists some product \\axiom{\\spad{h}} of \\axiom{initials(\\spad{ts})} such that \\axiom{\\spad{h*p} - \\spad{r}} lies in the ideal generated by \\axiom{\\spad{ts}}.")) (|headReduce| ((|#5| |#5| $) "\\axiom{headReduce(\\spad{p},{}\\spad{ts})} returns a polynomial \\axiom{\\spad{r}} such that \\axiom{headReduce?(\\spad{r},{}\\spad{ts})} holds and there exists some product \\axiom{\\spad{h}} of \\axiom{initials(\\spad{ts})} such that \\axiom{\\spad{h*p} - \\spad{r}} lies in the ideal generated by \\axiom{\\spad{ts}}.")) (|stronglyReduce| ((|#5| |#5| $) "\\axiom{stronglyReduce(\\spad{p},{}\\spad{ts})} returns a polynomial \\axiom{\\spad{r}} such that \\axiom{stronglyReduced?(\\spad{r},{}\\spad{ts})} holds and there exists some product \\axiom{\\spad{h}} of \\axiom{initials(\\spad{ts})} such that \\axiom{\\spad{h*p} - \\spad{r}} lies in the ideal generated by \\axiom{\\spad{ts}}.")) (|rewriteSetWithReduction| (((|List| |#5|) (|List| |#5|) $ (|Mapping| |#5| |#5| |#5|) (|Mapping| (|Boolean|) |#5| |#5|)) "\\axiom{rewriteSetWithReduction(\\spad{lp},{}\\spad{ts},{}redOp,{}redOp?)} returns a list \\axiom{\\spad{lq}} of polynomials such that \\axiom{[reduce(\\spad{p},{}\\spad{ts},{}redOp,{}redOp?) for \\spad{p} in \\spad{lp}]} and \\axiom{\\spad{lp}} have the same zeros inside the regular zero set of \\axiom{\\spad{ts}}. Moreover,{} for every polynomial \\axiom{\\spad{q}} in \\axiom{\\spad{lq}} and every polynomial \\axiom{\\spad{t}} in \\axiom{\\spad{ts}} \\axiom{redOp?(\\spad{q},{}\\spad{t})} holds and there exists a polynomial \\axiom{\\spad{p}} in the ideal generated by \\axiom{\\spad{lp}} and a product \\axiom{\\spad{h}} of \\axiom{initials(\\spad{ts})} such that \\axiom{\\spad{h*p} - \\spad{r}} lies in the ideal generated by \\axiom{\\spad{ts}}. The operation \\axiom{redOp} must satisfy the following conditions. For every \\axiom{\\spad{p}} and \\axiom{\\spad{q}} we have \\axiom{redOp?(redOp(\\spad{p},{}\\spad{q}),{}\\spad{q})} and there exists an integer \\axiom{\\spad{e}} and a polynomial \\axiom{\\spad{f}} such that \\axiom{init(\\spad{q})^e*p = \\spad{f*q} + redOp(\\spad{p},{}\\spad{q})}.")) (|reduce| ((|#5| |#5| $ (|Mapping| |#5| |#5| |#5|) (|Mapping| (|Boolean|) |#5| |#5|)) "\\axiom{reduce(\\spad{p},{}\\spad{ts},{}redOp,{}redOp?)} returns a polynomial \\axiom{\\spad{r}} such that \\axiom{redOp?(\\spad{r},{}\\spad{p})} holds for every \\axiom{\\spad{p}} of \\axiom{\\spad{ts}} and there exists some product \\axiom{\\spad{h}} of the initials of the members of \\axiom{\\spad{ts}} such that \\axiom{\\spad{h*p} - \\spad{r}} lies in the ideal generated by \\axiom{\\spad{ts}}. The operation \\axiom{redOp} must satisfy the following conditions. For every \\axiom{\\spad{p}} and \\axiom{\\spad{q}} we have \\axiom{redOp?(redOp(\\spad{p},{}\\spad{q}),{}\\spad{q})} and there exists an integer \\axiom{\\spad{e}} and a polynomial \\axiom{\\spad{f}} such that \\axiom{init(\\spad{q})^e*p = \\spad{f*q} + redOp(\\spad{p},{}\\spad{q})}.")) (|autoReduced?| (((|Boolean|) $ (|Mapping| (|Boolean|) |#5| (|List| |#5|))) "\\axiom{autoReduced?(\\spad{ts},{}redOp?)} returns \\spad{true} iff every element of \\axiom{\\spad{ts}} is reduced \\spad{w}.\\spad{r}.\\spad{t} to every other in the sense of \\axiom{redOp?}")) (|initiallyReduced?| (((|Boolean|) $) "\\spad{initiallyReduced?(ts)} returns \\spad{true} iff for every element \\axiom{\\spad{p}} of \\axiom{\\spad{ts}} \\axiom{\\spad{p}} and all its iterated initials are reduced \\spad{w}.\\spad{r}.\\spad{t}. to the other elements of \\axiom{\\spad{ts}} with the same main variable.") (((|Boolean|) |#5| $) "\\axiom{initiallyReduced?(\\spad{p},{}\\spad{ts})} returns \\spad{true} iff \\axiom{\\spad{p}} and all its iterated initials are reduced \\spad{w}.\\spad{r}.\\spad{t}. to the elements of \\axiom{\\spad{ts}} with the same main variable.")) (|headReduced?| (((|Boolean|) $) "\\spad{headReduced?(ts)} returns \\spad{true} iff the head of every element of \\axiom{\\spad{ts}} is reduced \\spad{w}.\\spad{r}.\\spad{t} to any other element of \\axiom{\\spad{ts}}.") (((|Boolean|) |#5| $) "\\axiom{headReduced?(\\spad{p},{}\\spad{ts})} returns \\spad{true} iff the head of \\axiom{\\spad{p}} is reduced \\spad{w}.\\spad{r}.\\spad{t}. \\axiom{\\spad{ts}}.")) (|stronglyReduced?| (((|Boolean|) $) "\\axiom{stronglyReduced?(\\spad{ts})} returns \\spad{true} iff every element of \\axiom{\\spad{ts}} is reduced \\spad{w}.\\spad{r}.\\spad{t} to any other element of \\axiom{\\spad{ts}}.") (((|Boolean|) |#5| $) "\\axiom{stronglyReduced?(\\spad{p},{}\\spad{ts})} returns \\spad{true} iff \\axiom{\\spad{p}} is reduced \\spad{w}.\\spad{r}.\\spad{t}. \\axiom{\\spad{ts}}.")) (|reduced?| (((|Boolean|) |#5| $ (|Mapping| (|Boolean|) |#5| |#5|)) "\\axiom{reduced?(\\spad{p},{}\\spad{ts},{}redOp?)} returns \\spad{true} iff \\axiom{\\spad{p}} is reduced \\spad{w}.\\spad{r}.\\spad{t}. in the sense of the operation \\axiom{redOp?},{} that is if for every \\axiom{\\spad{t}} in \\axiom{\\spad{ts}} \\axiom{redOp?(\\spad{p},{}\\spad{t})} holds.")) (|normalized?| (((|Boolean|) $) "\\axiom{normalized?(\\spad{ts})} returns \\spad{true} iff for every axiom{\\spad{p}} in axiom{\\spad{ts}} we have \\axiom{normalized?(\\spad{p},{}us)} where \\axiom{us} is \\axiom{collectUnder(\\spad{ts},{}mvar(\\spad{p}))}.") (((|Boolean|) |#5| $) "\\axiom{normalized?(\\spad{p},{}\\spad{ts})} returns \\spad{true} iff \\axiom{\\spad{p}} and all its iterated initials have degree zero \\spad{w}.\\spad{r}.\\spad{t}. the main variables of the polynomials of \\axiom{\\spad{ts}}")) (|quasiComponent| (((|Record| (|:| |close| (|List| |#5|)) (|:| |open| (|List| |#5|))) $) "\\axiom{quasiComponent(\\spad{ts})} returns \\axiom{[\\spad{lp},{}\\spad{lq}]} where \\axiom{\\spad{lp}} is the list of the members of \\axiom{\\spad{ts}} and \\axiom{\\spad{lq}}is \\axiom{initials(\\spad{ts})}.")) (|degree| (((|NonNegativeInteger|) $) "\\axiom{degree(\\spad{ts})} returns the product of main degrees of the members of \\axiom{\\spad{ts}}.")) (|initials| (((|List| |#5|) $) "\\axiom{initials(\\spad{ts})} returns the list of the non-constant initials of the members of \\axiom{\\spad{ts}}.")) (|basicSet| (((|Union| (|Record| (|:| |bas| $) (|:| |top| (|List| |#5|))) "failed") (|List| |#5|) (|Mapping| (|Boolean|) |#5|) (|Mapping| (|Boolean|) |#5| |#5|)) "\\axiom{basicSet(\\spad{ps},{}pred?,{}redOp?)} returns the same as \\axiom{basicSet(\\spad{qs},{}redOp?)} where \\axiom{\\spad{qs}} consists of the polynomials of \\axiom{\\spad{ps}} satisfying property \\axiom{pred?}.") (((|Union| (|Record| (|:| |bas| $) (|:| |top| (|List| |#5|))) "failed") (|List| |#5|) (|Mapping| (|Boolean|) |#5| |#5|)) "\\axiom{basicSet(\\spad{ps},{}redOp?)} returns \\axiom{[\\spad{bs},{}\\spad{ts}]} where \\axiom{concat(\\spad{bs},{}\\spad{ts})} is \\axiom{\\spad{ps}} and \\axiom{\\spad{bs}} is a basic set in Wu Wen Tsun sense of \\axiom{\\spad{ps}} \\spad{w}.\\spad{r}.\\spad{t} the reduction-test \\axiom{redOp?},{} if no non-zero constant polynomial lie in \\axiom{\\spad{ps}},{} otherwise \\axiom{\"failed\"} is returned.")) (|infRittWu?| (((|Boolean|) $ $) "\\axiom{infRittWu?(\\spad{ts1},{}\\spad{ts2})} returns \\spad{true} iff \\axiom{\\spad{ts2}} has higher rank than \\axiom{\\spad{ts1}} in Wu Wen Tsun sense."))) 
 NIL 
 ((|HasCategory| |#4| (QUOTE (-342)))) 
 (-1113 R E V P) 
 ((|constructor| (NIL "The category of triangular sets of multivariate polynomials with coefficients in an integral domain. Let \\axiom{\\spad{R}} be an integral domain and \\axiom{\\spad{V}} a finite ordered set of variables,{} say \\axiom{\\spad{X1} < \\spad{X2} < ... < \\spad{Xn}}. A set \\axiom{\\spad{S}} of polynomials in \\axiom{\\spad{R}[\\spad{X1},{}\\spad{X2},{}...,{}\\spad{Xn}]} is triangular if no elements of \\axiom{\\spad{S}} lies in \\axiom{\\spad{R}},{} and if two distinct elements of \\axiom{\\spad{S}} have distinct main variables. Note that the empty set is a triangular set. A triangular set is not necessarily a (lexicographical) Groebner basis and the notion of reduction related to triangular sets is based on the recursive view of polynomials. We recall this notion here and refer to [1] for more details. A polynomial \\axiom{\\spad{P}} is reduced \\spad{w}.\\spad{r}.\\spad{t} a non-constant polynomial \\axiom{\\spad{Q}} if the degree of \\axiom{\\spad{P}} in the main variable of \\axiom{\\spad{Q}} is less than the main degree of \\axiom{\\spad{Q}}. A polynomial \\axiom{\\spad{P}} is reduced \\spad{w}.\\spad{r}.\\spad{t} a triangular set \\axiom{\\spad{T}} if it is reduced \\spad{w}.\\spad{r}.\\spad{t}. every polynomial of \\axiom{\\spad{T}}. \\newline References : \\indented{1}{[1] \\spad{P}. AUBRY,{} \\spad{D}. LAZARD and \\spad{M}. MORENO MAZA \"On the Theories} \\indented{5}{of Triangular Sets\" Journal of Symbol. Comp. (to appear)}")) (|coHeight| (((|NonNegativeInteger|) $) "\\axiom{coHeight(\\spad{ts})} returns \\axiom{size()\\spad{\\$}\\spad{V}} minus \\axiom{\\spad{\\#}\\spad{ts}}.")) (|extend| (($ $ |#4|) "\\axiom{extend(\\spad{ts},{}\\spad{p})} returns a triangular set which encodes the simple extension by \\axiom{\\spad{p}} of the extension of the base field defined by \\axiom{\\spad{ts}},{} according to the properties of triangular sets of the current category If the required properties do not hold an error is returned.")) (|extendIfCan| (((|Union| $ "failed") $ |#4|) "\\axiom{extendIfCan(\\spad{ts},{}\\spad{p})} returns a triangular set which encodes the simple extension by \\axiom{\\spad{p}} of the extension of the base field defined by \\axiom{\\spad{ts}},{} according to the properties of triangular sets of the current domain. If the required properties do not hold then \"failed\" is returned. This operation encodes in some sense the properties of the triangular sets of the current category. Is is used to implement the \\axiom{construct} operation to guarantee that every triangular set build from a list of polynomials has the required properties.")) (|select| (((|Union| |#4| "failed") $ |#3|) "\\axiom{select(\\spad{ts},{}\\spad{v})} returns the polynomial of \\axiom{\\spad{ts}} with \\axiom{\\spad{v}} as main variable,{} if any.")) (|algebraic?| (((|Boolean|) |#3| $) "\\axiom{algebraic?(\\spad{v},{}\\spad{ts})} returns \\spad{true} iff \\axiom{\\spad{v}} is the main variable of some polynomial in \\axiom{\\spad{ts}}.")) (|algebraicVariables| (((|List| |#3|) $) "\\axiom{algebraicVariables(\\spad{ts})} returns the decreasingly sorted list of the main variables of the polynomials of \\axiom{\\spad{ts}}.")) (|rest| (((|Union| $ "failed") $) "\\axiom{rest(\\spad{ts})} returns the polynomials of \\axiom{\\spad{ts}} with smaller main variable than \\axiom{mvar(\\spad{ts})} if \\axiom{\\spad{ts}} is not empty,{} otherwise returns \"failed\"")) (|last| (((|Union| |#4| "failed") $) "\\axiom{last(\\spad{ts})} returns the polynomial of \\axiom{\\spad{ts}} with smallest main variable if \\axiom{\\spad{ts}} is not empty,{} otherwise returns \\axiom{\"failed\"}.")) (|first| (((|Union| |#4| "failed") $) "\\axiom{first(\\spad{ts})} returns the polynomial of \\axiom{\\spad{ts}} with greatest main variable if \\axiom{\\spad{ts}} is not empty,{} otherwise returns \\axiom{\"failed\"}.")) (|zeroSetSplitIntoTriangularSystems| (((|List| (|Record| (|:| |close| $) (|:| |open| (|List| |#4|)))) (|List| |#4|)) "\\axiom{zeroSetSplitIntoTriangularSystems(\\spad{lp})} returns a list of triangular systems \\axiom{[[\\spad{ts1},{}\\spad{qs1}],{}...,{}[\\spad{tsn},{}\\spad{qsn}]]} such that the zero set of \\axiom{\\spad{lp}} is the union of the closures of the \\axiom{W_i} where \\axiom{W_i} consists of the zeros of \\axiom{\\spad{ts}} which do not cancel any polynomial in \\axiom{qsi}.")) (|zeroSetSplit| (((|List| $) (|List| |#4|)) "\\axiom{zeroSetSplit(\\spad{lp})} returns a list \\axiom{\\spad{lts}} of triangular sets such that the zero set of \\axiom{\\spad{lp}} is the union of the closures of the regular zero sets of the members of \\axiom{\\spad{lts}}.")) (|reduceByQuasiMonic| ((|#4| |#4| $) "\\axiom{reduceByQuasiMonic(\\spad{p},{}\\spad{ts})} returns the same as \\axiom{remainder(\\spad{p},{}collectQuasiMonic(\\spad{ts})).polnum}.")) (|collectQuasiMonic| (($ $) "\\axiom{collectQuasiMonic(\\spad{ts})} returns the subset of \\axiom{\\spad{ts}} consisting of the polynomials with initial in \\axiom{\\spad{R}}.")) (|removeZero| ((|#4| |#4| $) "\\axiom{removeZero(\\spad{p},{}\\spad{ts})} returns \\axiom{0} if \\axiom{\\spad{p}} reduces to \\axiom{0} by pseudo-division \\spad{w}.\\spad{r}.\\spad{t} \\axiom{\\spad{ts}} otherwise returns a polynomial \\axiom{\\spad{q}} computed from \\axiom{\\spad{p}} by removing any coefficient in \\axiom{\\spad{p}} reducing to \\axiom{0}.")) (|initiallyReduce| ((|#4| |#4| $) "\\axiom{initiallyReduce(\\spad{p},{}\\spad{ts})} returns a polynomial \\axiom{\\spad{r}} such that \\axiom{initiallyReduced?(\\spad{r},{}\\spad{ts})} holds and there exists some product \\axiom{\\spad{h}} of \\axiom{initials(\\spad{ts})} such that \\axiom{\\spad{h*p} - \\spad{r}} lies in the ideal generated by \\axiom{\\spad{ts}}.")) (|headReduce| ((|#4| |#4| $) "\\axiom{headReduce(\\spad{p},{}\\spad{ts})} returns a polynomial \\axiom{\\spad{r}} such that \\axiom{headReduce?(\\spad{r},{}\\spad{ts})} holds and there exists some product \\axiom{\\spad{h}} of \\axiom{initials(\\spad{ts})} such that \\axiom{\\spad{h*p} - \\spad{r}} lies in the ideal generated by \\axiom{\\spad{ts}}.")) (|stronglyReduce| ((|#4| |#4| $) "\\axiom{stronglyReduce(\\spad{p},{}\\spad{ts})} returns a polynomial \\axiom{\\spad{r}} such that \\axiom{stronglyReduced?(\\spad{r},{}\\spad{ts})} holds and there exists some product \\axiom{\\spad{h}} of \\axiom{initials(\\spad{ts})} such that \\axiom{\\spad{h*p} - \\spad{r}} lies in the ideal generated by \\axiom{\\spad{ts}}.")) (|rewriteSetWithReduction| (((|List| |#4|) (|List| |#4|) $ (|Mapping| |#4| |#4| |#4|) (|Mapping| (|Boolean|) |#4| |#4|)) "\\axiom{rewriteSetWithReduction(\\spad{lp},{}\\spad{ts},{}redOp,{}redOp?)} returns a list \\axiom{\\spad{lq}} of polynomials such that \\axiom{[reduce(\\spad{p},{}\\spad{ts},{}redOp,{}redOp?) for \\spad{p} in \\spad{lp}]} and \\axiom{\\spad{lp}} have the same zeros inside the regular zero set of \\axiom{\\spad{ts}}. Moreover,{} for every polynomial \\axiom{\\spad{q}} in \\axiom{\\spad{lq}} and every polynomial \\axiom{\\spad{t}} in \\axiom{\\spad{ts}} \\axiom{redOp?(\\spad{q},{}\\spad{t})} holds and there exists a polynomial \\axiom{\\spad{p}} in the ideal generated by \\axiom{\\spad{lp}} and a product \\axiom{\\spad{h}} of \\axiom{initials(\\spad{ts})} such that \\axiom{\\spad{h*p} - \\spad{r}} lies in the ideal generated by \\axiom{\\spad{ts}}. The operation \\axiom{redOp} must satisfy the following conditions. For every \\axiom{\\spad{p}} and \\axiom{\\spad{q}} we have \\axiom{redOp?(redOp(\\spad{p},{}\\spad{q}),{}\\spad{q})} and there exists an integer \\axiom{\\spad{e}} and a polynomial \\axiom{\\spad{f}} such that \\axiom{init(\\spad{q})^e*p = \\spad{f*q} + redOp(\\spad{p},{}\\spad{q})}.")) (|reduce| ((|#4| |#4| $ (|Mapping| |#4| |#4| |#4|) (|Mapping| (|Boolean|) |#4| |#4|)) "\\axiom{reduce(\\spad{p},{}\\spad{ts},{}redOp,{}redOp?)} returns a polynomial \\axiom{\\spad{r}} such that \\axiom{redOp?(\\spad{r},{}\\spad{p})} holds for every \\axiom{\\spad{p}} of \\axiom{\\spad{ts}} and there exists some product \\axiom{\\spad{h}} of the initials of the members of \\axiom{\\spad{ts}} such that \\axiom{\\spad{h*p} - \\spad{r}} lies in the ideal generated by \\axiom{\\spad{ts}}. The operation \\axiom{redOp} must satisfy the following conditions. For every \\axiom{\\spad{p}} and \\axiom{\\spad{q}} we have \\axiom{redOp?(redOp(\\spad{p},{}\\spad{q}),{}\\spad{q})} and there exists an integer \\axiom{\\spad{e}} and a polynomial \\axiom{\\spad{f}} such that \\axiom{init(\\spad{q})^e*p = \\spad{f*q} + redOp(\\spad{p},{}\\spad{q})}.")) (|autoReduced?| (((|Boolean|) $ (|Mapping| (|Boolean|) |#4| (|List| |#4|))) "\\axiom{autoReduced?(\\spad{ts},{}redOp?)} returns \\spad{true} iff every element of \\axiom{\\spad{ts}} is reduced \\spad{w}.\\spad{r}.\\spad{t} to every other in the sense of \\axiom{redOp?}")) (|initiallyReduced?| (((|Boolean|) $) "\\spad{initiallyReduced?(ts)} returns \\spad{true} iff for every element \\axiom{\\spad{p}} of \\axiom{\\spad{ts}} \\axiom{\\spad{p}} and all its iterated initials are reduced \\spad{w}.\\spad{r}.\\spad{t}. to the other elements of \\axiom{\\spad{ts}} with the same main variable.") (((|Boolean|) |#4| $) "\\axiom{initiallyReduced?(\\spad{p},{}\\spad{ts})} returns \\spad{true} iff \\axiom{\\spad{p}} and all its iterated initials are reduced \\spad{w}.\\spad{r}.\\spad{t}. to the elements of \\axiom{\\spad{ts}} with the same main variable.")) (|headReduced?| (((|Boolean|) $) "\\spad{headReduced?(ts)} returns \\spad{true} iff the head of every element of \\axiom{\\spad{ts}} is reduced \\spad{w}.\\spad{r}.\\spad{t} to any other element of \\axiom{\\spad{ts}}.") (((|Boolean|) |#4| $) "\\axiom{headReduced?(\\spad{p},{}\\spad{ts})} returns \\spad{true} iff the head of \\axiom{\\spad{p}} is reduced \\spad{w}.\\spad{r}.\\spad{t}. \\axiom{\\spad{ts}}.")) (|stronglyReduced?| (((|Boolean|) $) "\\axiom{stronglyReduced?(\\spad{ts})} returns \\spad{true} iff every element of \\axiom{\\spad{ts}} is reduced \\spad{w}.\\spad{r}.\\spad{t} to any other element of \\axiom{\\spad{ts}}.") (((|Boolean|) |#4| $) "\\axiom{stronglyReduced?(\\spad{p},{}\\spad{ts})} returns \\spad{true} iff \\axiom{\\spad{p}} is reduced \\spad{w}.\\spad{r}.\\spad{t}. \\axiom{\\spad{ts}}.")) (|reduced?| (((|Boolean|) |#4| $ (|Mapping| (|Boolean|) |#4| |#4|)) "\\axiom{reduced?(\\spad{p},{}\\spad{ts},{}redOp?)} returns \\spad{true} iff \\axiom{\\spad{p}} is reduced \\spad{w}.\\spad{r}.\\spad{t}. in the sense of the operation \\axiom{redOp?},{} that is if for every \\axiom{\\spad{t}} in \\axiom{\\spad{ts}} \\axiom{redOp?(\\spad{p},{}\\spad{t})} holds.")) (|normalized?| (((|Boolean|) $) "\\axiom{normalized?(\\spad{ts})} returns \\spad{true} iff for every axiom{\\spad{p}} in axiom{\\spad{ts}} we have \\axiom{normalized?(\\spad{p},{}us)} where \\axiom{us} is \\axiom{collectUnder(\\spad{ts},{}mvar(\\spad{p}))}.") (((|Boolean|) |#4| $) "\\axiom{normalized?(\\spad{p},{}\\spad{ts})} returns \\spad{true} iff \\axiom{\\spad{p}} and all its iterated initials have degree zero \\spad{w}.\\spad{r}.\\spad{t}. the main variables of the polynomials of \\axiom{\\spad{ts}}")) (|quasiComponent| (((|Record| (|:| |close| (|List| |#4|)) (|:| |open| (|List| |#4|))) $) "\\axiom{quasiComponent(\\spad{ts})} returns \\axiom{[\\spad{lp},{}\\spad{lq}]} where \\axiom{\\spad{lp}} is the list of the members of \\axiom{\\spad{ts}} and \\axiom{\\spad{lq}}is \\axiom{initials(\\spad{ts})}.")) (|degree| (((|NonNegativeInteger|) $) "\\axiom{degree(\\spad{ts})} returns the product of main degrees of the members of \\axiom{\\spad{ts}}.")) (|initials| (((|List| |#4|) $) "\\axiom{initials(\\spad{ts})} returns the list of the non-constant initials of the members of \\axiom{\\spad{ts}}.")) (|basicSet| (((|Union| (|Record| (|:| |bas| $) (|:| |top| (|List| |#4|))) "failed") (|List| |#4|) (|Mapping| (|Boolean|) |#4|) (|Mapping| (|Boolean|) |#4| |#4|)) "\\axiom{basicSet(\\spad{ps},{}pred?,{}redOp?)} returns the same as \\axiom{basicSet(\\spad{qs},{}redOp?)} where \\axiom{\\spad{qs}} consists of the polynomials of \\axiom{\\spad{ps}} satisfying property \\axiom{pred?}.") (((|Union| (|Record| (|:| |bas| $) (|:| |top| (|List| |#4|))) "failed") (|List| |#4|) (|Mapping| (|Boolean|) |#4| |#4|)) "\\axiom{basicSet(\\spad{ps},{}redOp?)} returns \\axiom{[\\spad{bs},{}\\spad{ts}]} where \\axiom{concat(\\spad{bs},{}\\spad{ts})} is \\axiom{\\spad{ps}} and \\axiom{\\spad{bs}} is a basic set in Wu Wen Tsun sense of \\axiom{\\spad{ps}} \\spad{w}.\\spad{r}.\\spad{t} the reduction-test \\axiom{redOp?},{} if no non-zero constant polynomial lie in \\axiom{\\spad{ps}},{} otherwise \\axiom{\"failed\"} is returned.")) (|infRittWu?| (((|Boolean|) $ $) "\\axiom{infRittWu?(\\spad{ts1},{}\\spad{ts2})} returns \\spad{true} iff \\axiom{\\spad{ts2}} has higher rank than \\axiom{\\spad{ts1}} in Wu Wen Tsun sense."))) 
-((-4234 . T) (-4233 . T) (-2046 . T)) 
+((-4234 . T) (-4233 . T) (-2092 . T)) 
 NIL 
 (-1114 |Coef|) 
 ((|constructor| (NIL "\\spadtype{TaylorSeries} is a general multivariate Taylor series domain over the ring Coef and with variables of type Symbol.")) (|fintegrate| (($ (|Mapping| $) (|Symbol|) |#1|) "\\spad{fintegrate(f,{}v,{}c)} is the integral of \\spad{f()} with respect \\indented{1}{to \\spad{v} and having \\spad{c} as the constant of integration.} \\indented{1}{The evaluation of \\spad{f()} is delayed.}")) (|integrate| (($ $ (|Symbol|) |#1|) "\\spad{integrate(s,{}v,{}c)} is the integral of \\spad{s} with respect \\indented{1}{to \\spad{v} and having \\spad{c} as the constant of integration.}")) (|coerce| (($ (|Polynomial| |#1|)) "\\spad{coerce(s)} regroups terms of \\spad{s} by total degree \\indented{1}{and forms a series.}") (($ (|Symbol|)) "\\spad{coerce(s)} converts a variable to a Taylor series")) (|coefficient| (((|Polynomial| |#1|) $ (|NonNegativeInteger|)) "\\spad{coefficient(s,{} n)} gives the terms of total degree \\spad{n}."))) 
@@ -4399,19 +4399,19 @@ NIL
 (-1117 S) 
 ((|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")) (|coerce| (($ (|PrimitiveArray| |#1|)) "\\spad{coerce(a)} makes a tuple from primitive array a"))) 
 NIL 
-((|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792))))) 
+((|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791))))) 
 (-1118 -4049) 
 ((|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 
 (-1119) 
 ((|constructor| (NIL "The fundamental Type."))) 
-((-2046 . T)) 
+((-2092 . T)) 
 NIL 
 (-1120 S) 
 ((|constructor| (NIL "Provides functions to force a partial ordering on any set.")) (|more?| (((|Boolean|) |#1| |#1|) "\\spad{more?(a,{} b)} compares \\spad{a} and \\spad{b} in the partial ordering induced by setOrder,{} and uses the ordering on \\spad{S} if \\spad{a} and \\spad{b} are not comparable in the partial ordering.")) (|userOrdered?| (((|Boolean|)) "\\spad{userOrdered?()} tests if the partial ordering induced by \\spadfunFrom{setOrder}{UserDefinedPartialOrdering} is not empty.")) (|largest| ((|#1| (|List| |#1|)) "\\spad{largest l} returns the largest element of \\spad{l} where the partial ordering induced by setOrder is completed into a total one by the ordering on \\spad{S}.") ((|#1| (|List| |#1|) (|Mapping| (|Boolean|) |#1| |#1|)) "\\spad{largest(l,{} fn)} returns the largest element of \\spad{l} where the partial ordering induced by setOrder is completed into a total one by \\spad{fn}.")) (|less?| (((|Boolean|) |#1| |#1| (|Mapping| (|Boolean|) |#1| |#1|)) "\\spad{less?(a,{} b,{} fn)} compares \\spad{a} and \\spad{b} in the partial ordering induced by setOrder,{} and returns \\spad{fn(a,{} b)} if \\spad{a} and \\spad{b} are not comparable in that ordering.") (((|Union| (|Boolean|) "failed") |#1| |#1|) "\\spad{less?(a,{} b)} compares \\spad{a} and \\spad{b} in the partial ordering induced by setOrder.")) (|getOrder| (((|Record| (|:| |low| (|List| |#1|)) (|:| |high| (|List| |#1|)))) "\\spad{getOrder()} returns \\spad{[[b1,{}...,{}bm],{} [a1,{}...,{}an]]} such that the partial ordering on \\spad{S} was given by \\spad{setOrder([b1,{}...,{}bm],{}[a1,{}...,{}an])}.")) (|setOrder| (((|Void|) (|List| |#1|) (|List| |#1|)) "\\spad{setOrder([b1,{}...,{}bm],{} [a1,{}...,{}an])} defines a partial ordering on \\spad{S} given \\spad{by:} \\indented{3}{(1)\\space{2}\\spad{b1 < b2 < ... < bm < a1 < a2 < ... < an}.} \\indented{3}{(2)\\space{2}\\spad{bj < c < \\spad{ai}}\\space{2}for \\spad{c} not among the \\spad{ai}\\spad{'s} and \\spad{bj}\\spad{'s}.} \\indented{3}{(3)\\space{2}undefined on \\spad{(c,{}d)} if neither is among the \\spad{ai}\\spad{'s},{}\\spad{bj}\\spad{'s}.}") (((|Void|) (|List| |#1|)) "\\spad{setOrder([a1,{}...,{}an])} defines a partial ordering on \\spad{S} given \\spad{by:} \\indented{3}{(1)\\space{2}\\spad{a1 < a2 < ... < an}.} \\indented{3}{(2)\\space{2}\\spad{b < \\spad{ai}\\space{3}for i = 1..n} and \\spad{b} not among the \\spad{ai}\\spad{'s}.} \\indented{3}{(3)\\space{2}undefined on \\spad{(b,{} c)} if neither is among the \\spad{ai}\\spad{'s}.}"))) 
 NIL 
-((|HasCategory| |#1| (QUOTE (-784)))) 
+((|HasCategory| |#1| (QUOTE (-783)))) 
 (-1121) 
 ((|constructor| (NIL "This packages provides functions to allow the user to select the ordering on the variables and operators for displaying polynomials,{} fractions and expressions. The ordering affects the display only and not the computations.")) (|resetVariableOrder| (((|Void|)) "\\spad{resetVariableOrder()} cancels any previous use of setVariableOrder and returns to the default system ordering.")) (|getVariableOrder| (((|Record| (|:| |high| (|List| (|Symbol|))) (|:| |low| (|List| (|Symbol|))))) "\\spad{getVariableOrder()} returns \\spad{[[b1,{}...,{}bm],{} [a1,{}...,{}an]]} such that the ordering on the variables was given by \\spad{setVariableOrder([b1,{}...,{}bm],{} [a1,{}...,{}an])}.")) (|setVariableOrder| (((|Void|) (|List| (|Symbol|)) (|List| (|Symbol|))) "\\spad{setVariableOrder([b1,{}...,{}bm],{} [a1,{}...,{}an])} defines an ordering on the variables given by \\spad{b1 > b2 > ... > bm >} other variables \\spad{> a1 > a2 > ... > an}.") (((|Void|) (|List| (|Symbol|))) "\\spad{setVariableOrder([a1,{}...,{}an])} defines an ordering on the variables given by \\spad{a1 > a2 > ... > an > other variables}."))) 
 NIL 
@@ -4438,16 +4438,16 @@ NIL
 ((|HasCategory| |#2| (QUOTE (-337)))) 
 (-1127 |Coef| UTS) 
 ((|constructor| (NIL "This is a category of univariate Laurent series constructed from univariate Taylor series. A Laurent series is 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)}.")) (|taylorIfCan| (((|Union| |#2| "failed") $) "\\spad{taylorIfCan(f(x))} converts the Laurent series \\spad{f(x)} to a Taylor series,{} if possible. If this is not possible,{} \"failed\" is returned.")) (|taylor| ((|#2| $) "\\spad{taylor(f(x))} converts the Laurent series \\spad{f}(\\spad{x}) to a Taylor series,{} if possible. Error: if this is not possible.")) (|coerce| (($ |#2|) "\\spad{coerce(f(x))} converts the Taylor series \\spad{f(x)} to a Laurent series.")) (|removeZeroes| (($ (|Integer|) $) "\\spad{removeZeroes(n,{}f(x))} removes up to \\spad{n} leading zeroes from the Laurent series \\spad{f(x)}. A Laurent series is represented by (1) an exponent and (2) a Taylor series which may have leading zero coefficients. When the Taylor series has a leading zero coefficient,{} the 'leading zero' is removed from the Laurent series as follows: the series is rewritten by increasing the exponent by 1 and dividing the Taylor series by its variable.") (($ $) "\\spad{removeZeroes(f(x))} removes leading zeroes from the representation of the Laurent series \\spad{f(x)}. A Laurent series is represented by (1) an exponent and (2) a Taylor series which may have leading zero coefficients. When the Taylor series has a leading zero coefficient,{} the 'leading zero' is removed from the Laurent series as follows: the series is rewritten by increasing the exponent by 1 and dividing the Taylor series by its variable. Note: \\spad{removeZeroes(f)} removes all leading zeroes from \\spad{f}")) (|taylorRep| ((|#2| $) "\\spad{taylorRep(f(x))} returns \\spad{g(x)},{} where \\spad{f = x**n * g(x)} is represented by \\spad{[n,{}g(x)]}.")) (|degree| (((|Integer|) $) "\\spad{degree(f(x))} returns the degree of the lowest order term of \\spad{f(x)},{} which may have zero as a coefficient.")) (|laurent| (($ (|Integer|) |#2|) "\\spad{laurent(n,{}f(x))} returns \\spad{x**n * f(x)}."))) 
-(((-4235 "*") |has| |#1| (-157)) (-4226 |has| |#1| (-513)) (-4231 |has| |#1| (-337)) (-4225 |has| |#1| (-337)) (-2046 |has| |#1| (-337)) (-4227 . T) (-4228 . T) (-4230 . T)) 
+(((-4235 "*") |has| |#1| (-157)) (-4226 |has| |#1| (-513)) (-4231 |has| |#1| (-337)) (-4225 |has| |#1| (-337)) (-2092 |has| |#1| (-337)) (-4227 . T) (-4228 . T) (-4230 . T)) 
 NIL 
 (-1128 |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)}."))) 
 (((-4235 "*") |has| |#1| (-157)) (-4226 |has| |#1| (-513)) (-4231 |has| |#1| (-337)) (-4225 |has| |#1| (-337)) (-4227 . T) (-4228 . T) (-4230 . T)) 
-((|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-157))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-513)))) (|HasCategory| (-521) (QUOTE (-1025))) (|HasCategory| |#1| (QUOTE (-337))) (-3703 (|HasCategory| |#1| (QUOTE (-135))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-135))))) (-3703 (-12 (|HasCategory| |#1| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-521)) (|devaluate| |#1|))))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (LIST (QUOTE -829) (QUOTE (-1084)))))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-210)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-521)) (|devaluate| |#1|))))) (-3703 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-513)))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-1084))))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (LIST (QUOTE -562) (QUOTE (-497))))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-946)))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-513)))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-757)))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-1060)))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (LIST (QUOTE -261) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (LIST (QUOTE -482) (QUOTE (-1084)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521)))))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-353)))))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (LIST (QUOTE -815) (QUOTE (-521))))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (LIST (QUOTE -815) (QUOTE (-353))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-521))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-521))))) (|HasSignature| |#1| (LIST (QUOTE -2189) (LIST (|devaluate| |#1|) (QUOTE (-1084)))))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-784)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-757)))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-784))))) (|HasCategory| |#2| (QUOTE (-838))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-838)))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-506)))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-282)))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-133))) (-3703 (|HasCategory| |#1| (QUOTE (-133))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-133))))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (-3703 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (LIST (QUOTE -261) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (LIST (QUOTE -482) (QUOTE (-1084)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-757)))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-784)))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-838)))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-946)))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-1060)))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (LIST (QUOTE -562) (QUOTE (-497))))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-1084)))))) (-3703 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-887))) (|HasCategory| |#1| (QUOTE (-1105))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasSignature| |#1| (LIST (QUOTE -2184) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1084))))) (|HasSignature| |#1| (LIST (QUOTE -4084) (LIST (LIST (QUOTE -587) (QUOTE (-1084))) (|devaluate| |#1|)))))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-838)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-838)))) (|HasCategory| |#1| (QUOTE (-133))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-133)))))) 
+((|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-157))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-513)))) (|HasCategory| (-521) (QUOTE (-1025))) (|HasCategory| |#1| (QUOTE (-337))) (-3703 (|HasCategory| |#1| (QUOTE (-135))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-135))))) (-3703 (-12 (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-521)) (|devaluate| |#1|))))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1084)))))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-210)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-521)) (|devaluate| |#1|))))) (-3703 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-513)))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-1084))))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (LIST (QUOTE -562) (QUOTE (-497))))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-946)))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-513)))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-756)))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-1060)))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (LIST (QUOTE -261) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (LIST (QUOTE -482) (QUOTE (-1084)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521))))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521)))))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-353)))))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (LIST (QUOTE -814) (QUOTE (-521))))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (LIST (QUOTE -814) (QUOTE (-353))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-521))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-521))))) (|HasSignature| |#1| (LIST (QUOTE -2223) (LIST (|devaluate| |#1|) (QUOTE (-1084)))))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-783)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-756)))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-783))))) (|HasCategory| |#2| (QUOTE (-837))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-837)))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-506)))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-282)))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-133))) (-3703 (|HasCategory| |#1| (QUOTE (-133))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-133))))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (-3703 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (LIST (QUOTE -261) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (LIST (QUOTE -482) (QUOTE (-1084)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-756)))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-783)))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-837)))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-946)))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-1060)))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (LIST (QUOTE -562) (QUOTE (-497))))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (LIST (QUOTE -284) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521))))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-1084)))))) (-3703 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-886))) (|HasCategory| |#1| (QUOTE (-1105))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasSignature| |#1| (LIST (QUOTE -1749) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1084))))) (|HasSignature| |#1| (LIST (QUOTE -4085) (LIST (LIST (QUOTE -587) (QUOTE (-1084))) (|devaluate| |#1|)))))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-837)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-837)))) (|HasCategory| |#1| (QUOTE (-133))) (-12 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-133)))))) 
 (-1129 |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."))) 
-(((-4235 "*") -3703 (-4009 (|has| |#1| (-337)) (|has| (-1157 |#1| |#2| |#3|) (-757))) (|has| |#1| (-157)) (-4009 (|has| |#1| (-337)) (|has| (-1157 |#1| |#2| |#3|) (-838)))) (-4226 -3703 (-4009 (|has| |#1| (-337)) (|has| (-1157 |#1| |#2| |#3|) (-757))) (|has| |#1| (-513)) (-4009 (|has| |#1| (-337)) (|has| (-1157 |#1| |#2| |#3|) (-838)))) (-4231 |has| |#1| (-337)) (-4225 |has| |#1| (-337)) (-4227 . T) (-4228 . T) (-4230 . T)) 
-((|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-157))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-513)))) (|HasCategory| (-521) (QUOTE (-1025))) (|HasCategory| |#1| (QUOTE (-337))) (-3703 (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasCategory| |#1| (QUOTE (-135)))) (-3703 (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-521)) (|devaluate| |#1|)))))) (-3703 (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-210))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-521)) (|devaluate| |#1|))))) (-3703 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-513)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (LIST (QUOTE -961) (QUOTE (-1084)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-946))) (|HasCategory| |#1| (QUOTE (-337)))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-513)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-757))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-1060))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (LIST (QUOTE -261) (LIST (QUOTE -1157) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1157) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (LIST (QUOTE -284) (LIST (QUOTE -1157) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (LIST (QUOTE -482) (QUOTE (-1084)) (LIST (QUOTE -1157) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-353))))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (LIST (QUOTE -815) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (LIST (QUOTE -815) (QUOTE (-353)))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-521))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-521))))) (|HasSignature| |#1| (LIST (QUOTE -2189) (LIST (|devaluate| |#1|) (QUOTE (-1084)))))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-506))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-282))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-838))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-838))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-133))) (-3703 (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasCategory| |#1| (QUOTE (-133)))) (-3703 (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-757))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-838))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasCategory| |#1| (QUOTE (-513)))) (-3703 (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-757))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-838))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasCategory| |#1| (QUOTE (-157)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-784))) (|HasCategory| |#1| (QUOTE (-337)))) (-3703 (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-757))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-784))) (|HasCategory| |#1| (QUOTE (-337))))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (-3703 (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-757))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-784))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-838))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-946))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-1060))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-353))))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (LIST (QUOTE -261) (LIST (QUOTE -1157) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1157) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (LIST (QUOTE -284) (LIST (QUOTE -1157) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (LIST (QUOTE -482) (QUOTE (-1084)) (LIST (QUOTE -1157) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (LIST (QUOTE -815) (QUOTE (-353)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (LIST (QUOTE -815) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (LIST (QUOTE -961) (QUOTE (-1084)))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521)))))) (-3703 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-887))) (|HasCategory| |#1| (QUOTE (-1105))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasSignature| |#1| (LIST (QUOTE -2184) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1084))))) (|HasSignature| |#1| (LIST (QUOTE -4084) (LIST (LIST (QUOTE -587) (QUOTE (-1084))) (|devaluate| |#1|)))))) (-3703 (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521)))))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-838))) (|HasCategory| |#1| (QUOTE (-337)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-838))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasCategory| |#1| (QUOTE (-133))))) 
+(((-4235 "*") -3703 (-4009 (|has| |#1| (-337)) (|has| (-1157 |#1| |#2| |#3|) (-756))) (|has| |#1| (-157)) (-4009 (|has| |#1| (-337)) (|has| (-1157 |#1| |#2| |#3|) (-837)))) (-4226 -3703 (-4009 (|has| |#1| (-337)) (|has| (-1157 |#1| |#2| |#3|) (-756))) (|has| |#1| (-513)) (-4009 (|has| |#1| (-337)) (|has| (-1157 |#1| |#2| |#3|) (-837)))) (-4231 |has| |#1| (-337)) (-4225 |has| |#1| (-337)) (-4227 . T) (-4228 . T) (-4230 . T)) 
+((|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-157))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-513)))) (|HasCategory| (-521) (QUOTE (-1025))) (|HasCategory| |#1| (QUOTE (-337))) (-3703 (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-135))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasCategory| |#1| (QUOTE (-135)))) (-3703 (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-521)) (|devaluate| |#1|)))))) (-3703 (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-210))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-521)) (|devaluate| |#1|))))) (-3703 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-513)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (LIST (QUOTE -961) (QUOTE (-1084)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-946))) (|HasCategory| |#1| (QUOTE (-337)))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-513)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-756))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-1060))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (LIST (QUOTE -261) (LIST (QUOTE -1157) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1157) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (LIST (QUOTE -284) (LIST (QUOTE -1157) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (LIST (QUOTE -482) (QUOTE (-1084)) (LIST (QUOTE -1157) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-353))))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (LIST (QUOTE -814) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (LIST (QUOTE -814) (QUOTE (-353)))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-521))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-521))))) (|HasSignature| |#1| (LIST (QUOTE -2223) (LIST (|devaluate| |#1|) (QUOTE (-1084)))))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-506))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-282))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-837))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-837))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-133))) (-3703 (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasCategory| |#1| (QUOTE (-133)))) (-3703 (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-756))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-837))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasCategory| |#1| (QUOTE (-513)))) (-3703 (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-756))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-837))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasCategory| |#1| (QUOTE (-157)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-783))) (|HasCategory| |#1| (QUOTE (-337)))) (-3703 (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-756))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-783))) (|HasCategory| |#1| (QUOTE (-337))))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (-3703 (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-756))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-783))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-837))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-946))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-1060))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-353))))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (LIST (QUOTE -261) (LIST (QUOTE -1157) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1157) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (LIST (QUOTE -284) (LIST (QUOTE -1157) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (LIST (QUOTE -482) (QUOTE (-1084)) (LIST (QUOTE -1157) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (LIST (QUOTE -814) (QUOTE (-353)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (LIST (QUOTE -814) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (LIST (QUOTE -961) (QUOTE (-1084)))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521)))))) (-3703 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-886))) (|HasCategory| |#1| (QUOTE (-1105))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasSignature| |#1| (LIST (QUOTE -1749) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1084))))) (|HasSignature| |#1| (LIST (QUOTE -4085) (LIST (LIST (QUOTE -587) (QUOTE (-1084))) (|devaluate| |#1|)))))) (-3703 (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521)))))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-837))) (|HasCategory| |#1| (QUOTE (-337)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-837))) (|HasCategory| |#1| (QUOTE (-337)))) (-12 (|HasCategory| (-1157 |#1| |#2| |#3|) (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-337)))) (|HasCategory| |#1| (QUOTE (-133))))) 
 (-1130 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 
@@ -4455,11 +4455,11 @@ NIL
 (-1131 R S) 
 ((|constructor| (NIL "This package provides operations for mapping functions onto segments.")) (|map| (((|Stream| |#2|) (|Mapping| |#2| |#1|) (|UniversalSegment| |#1|)) "\\spad{map(f,{}s)} expands the segment \\spad{s},{} applying \\spad{f} to each value.") (((|UniversalSegment| |#2|) (|Mapping| |#2| |#1|) (|UniversalSegment| |#1|)) "\\spad{map(f,{}seg)} returns the new segment obtained by applying \\spad{f} to the endpoints of \\spad{seg}."))) 
 NIL 
-((|HasCategory| |#1| (QUOTE (-782)))) 
+((|HasCategory| |#1| (QUOTE (-781)))) 
 (-1132 S) 
 ((|constructor| (NIL "This domain provides segments which may be half open. That is,{} ranges of the form \\spad{a..} or \\spad{a..b}.")) (|hasHi| (((|Boolean|) $) "\\spad{hasHi(s)} tests whether the segment \\spad{s} has an upper bound.")) (|coerce| (($ (|Segment| |#1|)) "\\spad{coerce(x)} allows \\spadtype{Segment} values to be used as \\%.")) (|segment| (($ |#1|) "\\spad{segment(l)} is an alternate way to construct the segment \\spad{l..}.")) (SEGMENT (($ |#1|) "\\spad{l..} produces a half open segment,{} that is,{} one with no upper bound."))) 
 NIL 
-((|HasCategory| |#1| (QUOTE (-782))) (|HasCategory| |#1| (QUOTE (-1013)))) 
+((|HasCategory| |#1| (QUOTE (-781))) (|HasCategory| |#1| (QUOTE (-1013)))) 
 (-1133 |x| R |y| S) 
 ((|constructor| (NIL "This package lifts a mapping from coefficient rings \\spad{R} to \\spad{S} to a mapping from \\spadtype{UnivariatePolynomial}(\\spad{x},{}\\spad{R}) to \\spadtype{UnivariatePolynomial}(\\spad{y},{}\\spad{S}). Note that the mapping is assumed to send zero to zero,{} since it will only be applied to the non-zero coefficients of the polynomial.")) (|map| (((|UnivariatePolynomial| |#3| |#4|) (|Mapping| |#4| |#2|) (|UnivariatePolynomial| |#1| |#2|)) "\\spad{map(func,{} poly)} creates a new polynomial by applying \\spad{func} to every non-zero coefficient of the polynomial poly."))) 
 NIL 
@@ -4483,7 +4483,7 @@ NIL
 (-1138 |x| R) 
 ((|constructor| (NIL "This domain represents univariate polynomials in some symbol over arbitrary (not necessarily commutative) coefficient rings. The representation is sparse in the sense that only non-zero terms are represented.")) (|fmecg| (($ $ (|NonNegativeInteger|) |#2| $) "\\spad{fmecg(p1,{}e,{}r,{}p2)} finds \\spad{X} : \\spad{p1} - \\spad{r} * X**e * \\spad{p2}")) (|coerce| (($ (|Variable| |#1|)) "\\spad{coerce(x)} converts the variable \\spad{x} to a univariate polynomial."))) 
 (((-4235 "*") |has| |#2| (-157)) (-4226 |has| |#2| (-513)) (-4229 |has| |#2| (-337)) (-4231 |has| |#2| (-6 -4231)) (-4228 . T) (-4227 . T) (-4230 . T)) 
-((|HasCategory| |#2| (QUOTE (-838))) (|HasCategory| |#2| (QUOTE (-513))) (|HasCategory| |#2| (QUOTE (-157))) (-3703 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-513)))) (-12 (|HasCategory| (-998) (LIST (QUOTE -815) (QUOTE (-353)))) (|HasCategory| |#2| (LIST (QUOTE -815) (QUOTE (-353))))) (-12 (|HasCategory| (-998) (LIST (QUOTE -815) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -815) (QUOTE (-521))))) (-12 (|HasCategory| (-998) (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-353))))) (|HasCategory| |#2| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-353)))))) (-12 (|HasCategory| (-998) (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -562) (LIST (QUOTE -821) (QUOTE (-521)))))) (-12 (|HasCategory| (-998) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#2| (LIST (QUOTE -562) (QUOTE (-497))))) (|HasCategory| |#2| (QUOTE (-784))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (QUOTE (-135))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (LIST (QUOTE -829) (QUOTE (-1084)))) (-3703 (|HasCategory| |#2| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521)))))) (|HasCategory| |#2| (QUOTE (-210))) (|HasAttribute| |#2| (QUOTE -4231)) (|HasCategory| |#2| (QUOTE (-425))) (-3703 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-425))) (|HasCategory| |#2| (QUOTE (-513))) (|HasCategory| |#2| (QUOTE (-838)))) (-3703 (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-425))) (|HasCategory| |#2| (QUOTE (-513))) (|HasCategory| |#2| (QUOTE (-838)))) (-3703 (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-425))) (|HasCategory| |#2| (QUOTE (-838)))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-838)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-838)))) (|HasCategory| |#2| (QUOTE (-133))))) 
+((|HasCategory| |#2| (QUOTE (-837))) (|HasCategory| |#2| (QUOTE (-513))) (|HasCategory| |#2| (QUOTE (-157))) (-3703 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-513)))) (-12 (|HasCategory| (-998) (LIST (QUOTE -814) (QUOTE (-353)))) (|HasCategory| |#2| (LIST (QUOTE -814) (QUOTE (-353))))) (-12 (|HasCategory| (-998) (LIST (QUOTE -814) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -814) (QUOTE (-521))))) (-12 (|HasCategory| (-998) (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-353))))) (|HasCategory| |#2| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-353)))))) (-12 (|HasCategory| (-998) (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -562) (LIST (QUOTE -820) (QUOTE (-521)))))) (-12 (|HasCategory| (-998) (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#2| (LIST (QUOTE -562) (QUOTE (-497))))) (|HasCategory| |#2| (QUOTE (-783))) (|HasCategory| |#2| (LIST (QUOTE -583) (QUOTE (-521)))) (|HasCategory| |#2| (QUOTE (-135))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -961) (QUOTE (-521)))) (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1084)))) (-3703 (|HasCategory| |#2| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (LIST (QUOTE -961) (LIST (QUOTE -381) (QUOTE (-521)))))) (|HasCategory| |#2| (QUOTE (-210))) (|HasAttribute| |#2| (QUOTE -4231)) (|HasCategory| |#2| (QUOTE (-425))) (-3703 (|HasCategory| |#2| (QUOTE (-157))) (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-425))) (|HasCategory| |#2| (QUOTE (-513))) (|HasCategory| |#2| (QUOTE (-837)))) (-3703 (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-425))) (|HasCategory| |#2| (QUOTE (-513))) (|HasCategory| |#2| (QUOTE (-837)))) (-3703 (|HasCategory| |#2| (QUOTE (-337))) (|HasCategory| |#2| (QUOTE (-425))) (|HasCategory| |#2| (QUOTE (-837)))) (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-837)))) (-3703 (-12 (|HasCategory| $ (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-837)))) (|HasCategory| |#2| (QUOTE (-133))))) 
 (-1139 R PR S PS) 
 ((|constructor| (NIL "Mapping from polynomials over \\spad{R} to polynomials over \\spad{S} given a map from \\spad{R} to \\spad{S} assumed to send zero to zero.")) (|map| ((|#4| (|Mapping| |#3| |#1|) |#2|) "\\spad{map(f,{} p)} takes a function \\spad{f} from \\spad{R} to \\spad{S},{} and applies it to each (non-zero) coefficient of a polynomial \\spad{p} over \\spad{R},{} getting a new polynomial over \\spad{S}. Note: since the map is not applied to zero elements,{} it may map zero to zero."))) 
 NIL 
@@ -4499,7 +4499,7 @@ NIL
 (-1142 S |Coef| |Expon|) 
 ((|constructor| (NIL "\\spadtype{UnivariatePowerSeriesCategory} is the most general univariate power series category with exponents in an ordered abelian monoid. Note: this category exports a substitution function if it is possible to multiply exponents. Note: this category exports a derivative operation if it is possible to multiply coefficients by exponents.")) (|eval| (((|Stream| |#2|) $ |#2|) "\\spad{eval(f,{}a)} evaluates a power series at a value in the ground ring by returning a stream of partial sums.")) (|extend| (($ $ |#3|) "\\spad{extend(f,{}n)} causes all terms of \\spad{f} of degree \\spad{<=} \\spad{n} to be computed.")) (|approximate| ((|#2| $ |#3|) "\\spad{approximate(f)} returns a truncated power series with the series variable viewed as an element of the coefficient domain.")) (|truncate| (($ $ |#3| |#3|) "\\spad{truncate(f,{}k1,{}k2)} returns a (finite) power series consisting of the sum of all terms of \\spad{f} of degree \\spad{d} with \\spad{k1 <= d <= k2}.") (($ $ |#3|) "\\spad{truncate(f,{}k)} returns a (finite) power series consisting of the sum of all terms of \\spad{f} of degree \\spad{<= k}.")) (|order| ((|#3| $ |#3|) "\\spad{order(f,{}n) = min(m,{}n)},{} where \\spad{m} is the degree of the lowest order non-zero term in \\spad{f}.") ((|#3| $) "\\spad{order(f)} is the degree of the lowest order non-zero term in \\spad{f}. This will result in an infinite loop if \\spad{f} has no non-zero terms.")) (|multiplyExponents| (($ $ (|PositiveInteger|)) "\\spad{multiplyExponents(f,{}n)} multiplies all exponents of the power series \\spad{f} by the positive integer \\spad{n}.")) (|center| ((|#2| $) "\\spad{center(f)} returns the point about which the series \\spad{f} is expanded.")) (|variable| (((|Symbol|) $) "\\spad{variable(f)} returns the (unique) power series variable of the power series \\spad{f}.")) (|elt| ((|#2| $ |#3|) "\\spad{elt(f(x),{}r)} returns the coefficient of the term of degree \\spad{r} in \\spad{f(x)}. This is the same as the function \\spadfun{coefficient}.")) (|terms| (((|Stream| (|Record| (|:| |k| |#3|) (|:| |c| |#2|))) $) "\\spad{terms(f(x))} returns a stream of non-zero terms,{} where a a term is an exponent-coefficient pair. The terms in the stream are ordered by increasing order of exponents."))) 
 NIL 
-((|HasCategory| |#2| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasSignature| |#2| (LIST (QUOTE *) (LIST (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#2|)))) (|HasCategory| |#3| (QUOTE (-1025))) (|HasSignature| |#2| (LIST (QUOTE **) (LIST (|devaluate| |#2|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasSignature| |#2| (LIST (QUOTE -2189) (LIST (|devaluate| |#2|) (QUOTE (-1084)))))) 
+((|HasCategory| |#2| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasSignature| |#2| (LIST (QUOTE *) (LIST (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#2|)))) (|HasCategory| |#3| (QUOTE (-1025))) (|HasSignature| |#2| (LIST (QUOTE **) (LIST (|devaluate| |#2|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasSignature| |#2| (LIST (QUOTE -2223) (LIST (|devaluate| |#2|) (QUOTE (-1084)))))) 
 (-1143 |Coef| |Expon|) 
 ((|constructor| (NIL "\\spadtype{UnivariatePowerSeriesCategory} is the most general univariate power series category with exponents in an ordered abelian monoid. Note: this category exports a substitution function if it is possible to multiply exponents. Note: this category exports a derivative operation if it is possible to multiply coefficients by exponents.")) (|eval| (((|Stream| |#1|) $ |#1|) "\\spad{eval(f,{}a)} evaluates a power series at a value in the ground ring by returning a stream of partial sums.")) (|extend| (($ $ |#2|) "\\spad{extend(f,{}n)} causes all terms of \\spad{f} of degree \\spad{<=} \\spad{n} to be computed.")) (|approximate| ((|#1| $ |#2|) "\\spad{approximate(f)} returns a truncated power series with the series variable viewed as an element of the coefficient domain.")) (|truncate| (($ $ |#2| |#2|) "\\spad{truncate(f,{}k1,{}k2)} returns a (finite) power series consisting of the sum of all terms of \\spad{f} of degree \\spad{d} with \\spad{k1 <= d <= k2}.") (($ $ |#2|) "\\spad{truncate(f,{}k)} returns a (finite) power series consisting of the sum of all terms of \\spad{f} of degree \\spad{<= k}.")) (|order| ((|#2| $ |#2|) "\\spad{order(f,{}n) = min(m,{}n)},{} where \\spad{m} is the degree of the lowest order non-zero term in \\spad{f}.") ((|#2| $) "\\spad{order(f)} is the degree of the lowest order non-zero term in \\spad{f}. This will result in an infinite loop if \\spad{f} has no non-zero terms.")) (|multiplyExponents| (($ $ (|PositiveInteger|)) "\\spad{multiplyExponents(f,{}n)} multiplies all exponents of the power series \\spad{f} by the positive integer \\spad{n}.")) (|center| ((|#1| $) "\\spad{center(f)} returns the point about which the series \\spad{f} is expanded.")) (|variable| (((|Symbol|) $) "\\spad{variable(f)} returns the (unique) power series variable of the power series \\spad{f}.")) (|elt| ((|#1| $ |#2|) "\\spad{elt(f(x),{}r)} returns the coefficient of the term of degree \\spad{r} in \\spad{f(x)}. This is the same as the function \\spadfun{coefficient}.")) (|terms| (((|Stream| (|Record| (|:| |k| |#2|) (|:| |c| |#1|))) $) "\\spad{terms(f(x))} returns a stream of non-zero terms,{} where a a term is an exponent-coefficient pair. The terms in the stream are ordered by increasing order of exponents."))) 
 (((-4235 "*") |has| |#1| (-157)) (-4226 |has| |#1| (-513)) (-4227 . T) (-4228 . T) (-4230 . T)) 
@@ -4527,11 +4527,11 @@ NIL
 (-1149 |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)}."))) 
 (((-4235 "*") |has| |#1| (-157)) (-4226 |has| |#1| (-513)) (-4231 |has| |#1| (-337)) (-4225 |has| |#1| (-337)) (-4227 . T) (-4228 . T) (-4230 . T)) 
-((|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-157))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-513)))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -381) (QUOTE (-521))) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -381) (QUOTE (-521))) (|devaluate| |#1|))))) (|HasCategory| (-381 (-521)) (QUOTE (-1025))) (|HasCategory| |#1| (QUOTE (-337))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-513)))) (-3703 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-513)))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -381) (QUOTE (-521)))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -381) (QUOTE (-521)))))) (|HasSignature| |#1| (LIST (QUOTE -2189) (LIST (|devaluate| |#1|) (QUOTE (-1084)))))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (-3703 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-887))) (|HasCategory| |#1| (QUOTE (-1105))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasSignature| |#1| (LIST (QUOTE -2184) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1084))))) (|HasSignature| |#1| (LIST (QUOTE -4084) (LIST (LIST (QUOTE -587) (QUOTE (-1084))) (|devaluate| |#1|))))))) 
+((|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-157))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-513)))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -381) (QUOTE (-521))) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -381) (QUOTE (-521))) (|devaluate| |#1|))))) (|HasCategory| (-381 (-521)) (QUOTE (-1025))) (|HasCategory| |#1| (QUOTE (-337))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-513)))) (-3703 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-513)))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -381) (QUOTE (-521)))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -381) (QUOTE (-521)))))) (|HasSignature| |#1| (LIST (QUOTE -2223) (LIST (|devaluate| |#1|) (QUOTE (-1084)))))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (-3703 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-886))) (|HasCategory| |#1| (QUOTE (-1105))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasSignature| |#1| (LIST (QUOTE -1749) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1084))))) (|HasSignature| |#1| (LIST (QUOTE -4085) (LIST (LIST (QUOTE -587) (QUOTE (-1084))) (|devaluate| |#1|))))))) 
 (-1150 |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}.")) (|coerce| (($ (|Variable| |#2|)) "\\spad{coerce(var)} converts the series variable \\spad{var} into a Puiseux series."))) 
 (((-4235 "*") |has| |#1| (-157)) (-4226 |has| |#1| (-513)) (-4231 |has| |#1| (-337)) (-4225 |has| |#1| (-337)) (-4227 . T) (-4228 . T) (-4230 . T)) 
-((|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-157))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-513)))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -381) (QUOTE (-521))) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -381) (QUOTE (-521))) (|devaluate| |#1|))))) (|HasCategory| (-381 (-521)) (QUOTE (-1025))) (|HasCategory| |#1| (QUOTE (-337))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-513)))) (-3703 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-513)))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -381) (QUOTE (-521)))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -381) (QUOTE (-521)))))) (|HasSignature| |#1| (LIST (QUOTE -2189) (LIST (|devaluate| |#1|) (QUOTE (-1084)))))) (-3703 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-887))) (|HasCategory| |#1| (QUOTE (-1105))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasSignature| |#1| (LIST (QUOTE -2184) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1084))))) (|HasSignature| |#1| (LIST (QUOTE -4084) (LIST (LIST (QUOTE -587) (QUOTE (-1084))) (|devaluate| |#1|))))))) 
+((|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-157))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-513)))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -381) (QUOTE (-521))) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -381) (QUOTE (-521))) (|devaluate| |#1|))))) (|HasCategory| (-381 (-521)) (QUOTE (-1025))) (|HasCategory| |#1| (QUOTE (-337))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-513)))) (-3703 (|HasCategory| |#1| (QUOTE (-337))) (|HasCategory| |#1| (QUOTE (-513)))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -381) (QUOTE (-521)))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -381) (QUOTE (-521)))))) (|HasSignature| |#1| (LIST (QUOTE -2223) (LIST (|devaluate| |#1|) (QUOTE (-1084)))))) (-3703 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-886))) (|HasCategory| |#1| (QUOTE (-1105))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasSignature| |#1| (LIST (QUOTE -1749) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1084))))) (|HasSignature| |#1| (LIST (QUOTE -4085) (LIST (LIST (QUOTE -587) (QUOTE (-1084))) (|devaluate| |#1|))))))) 
 (-1151 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))}."))) 
 (((-4235 "*") |has| (-1150 |#2| |#3| |#4|) (-157)) (-4226 |has| (-1150 |#2| |#3| |#4|) (-513)) (-4227 . T) (-4228 . T) (-4230 . T)) 
@@ -4542,7 +4542,7 @@ NIL
 ((|HasAttribute| |#1| (QUOTE -4234))) 
 (-1153 S) 
 ((|constructor| (NIL "A unary-recursive aggregate is a one where nodes may have either 0 or 1 children. This aggregate models,{} though not precisely,{} a linked list possibly with a single cycle. A node with one children models a non-empty list,{} with the \\spadfun{value} of the list designating the head,{} or \\spadfun{first},{} of the list,{} and the child designating the tail,{} or \\spadfun{rest},{} of the list. A node with no child then designates the empty list. Since these aggregates are recursive aggregates,{} they may be cyclic.")) (|split!| (($ $ (|Integer|)) "\\spad{split!(u,{}n)} splits \\spad{u} into two aggregates: \\axiom{\\spad{v} = rest(\\spad{u},{}\\spad{n})} and \\axiom{\\spad{w} = first(\\spad{u},{}\\spad{n})},{} returning \\axiom{\\spad{v}}. Note: afterwards \\axiom{rest(\\spad{u},{}\\spad{n})} returns \\axiom{empty()}.")) (|setlast!| ((|#1| $ |#1|) "\\spad{setlast!(u,{}x)} destructively changes the last element of \\spad{u} to \\spad{x}.")) (|setrest!| (($ $ $) "\\spad{setrest!(u,{}v)} destructively changes the rest of \\spad{u} to \\spad{v}.")) (|setelt| ((|#1| $ "last" |#1|) "\\spad{setelt(u,{}\"last\",{}x)} (also written: \\axiom{\\spad{u}.last \\spad{:=} \\spad{b}}) is equivalent to \\axiom{setlast!(\\spad{u},{}\\spad{v})}.") (($ $ "rest" $) "\\spad{setelt(u,{}\"rest\",{}v)} (also written: \\axiom{\\spad{u}.rest \\spad{:=} \\spad{v}}) is equivalent to \\axiom{setrest!(\\spad{u},{}\\spad{v})}.") ((|#1| $ "first" |#1|) "\\spad{setelt(u,{}\"first\",{}x)} (also written: \\axiom{\\spad{u}.first \\spad{:=} \\spad{x}}) is equivalent to \\axiom{setfirst!(\\spad{u},{}\\spad{x})}.")) (|setfirst!| ((|#1| $ |#1|) "\\spad{setfirst!(u,{}x)} destructively changes the first element of a to \\spad{x}.")) (|cycleSplit!| (($ $) "\\spad{cycleSplit!(u)} splits the aggregate by dropping off the cycle. The value returned is the cycle entry,{} or nil if none exists. For example,{} if \\axiom{\\spad{w} = concat(\\spad{u},{}\\spad{v})} is the cyclic list where \\spad{v} is the head of the cycle,{} \\axiom{cycleSplit!(\\spad{w})} will drop \\spad{v} off \\spad{w} thus destructively changing \\spad{w} to \\spad{u},{} and returning \\spad{v}.")) (|concat!| (($ $ |#1|) "\\spad{concat!(u,{}x)} destructively adds element \\spad{x} to the end of \\spad{u}. Note: \\axiom{concat!(a,{}\\spad{x}) = setlast!(a,{}[\\spad{x}])}.") (($ $ $) "\\spad{concat!(u,{}v)} destructively concatenates \\spad{v} to the end of \\spad{u}. Note: \\axiom{concat!(\\spad{u},{}\\spad{v}) = setlast_!(\\spad{u},{}\\spad{v})}.")) (|cycleTail| (($ $) "\\spad{cycleTail(u)} returns the last node in the cycle,{} or empty if none exists.")) (|cycleLength| (((|NonNegativeInteger|) $) "\\spad{cycleLength(u)} returns the length of a top-level cycle contained in aggregate \\spad{u},{} or 0 is \\spad{u} has no such cycle.")) (|cycleEntry| (($ $) "\\spad{cycleEntry(u)} returns the head of a top-level cycle contained in aggregate \\spad{u},{} or \\axiom{empty()} if none exists.")) (|third| ((|#1| $) "\\spad{third(u)} returns the third element of \\spad{u}. Note: \\axiom{third(\\spad{u}) = first(rest(rest(\\spad{u})))}.")) (|second| ((|#1| $) "\\spad{second(u)} returns the second element of \\spad{u}. Note: \\axiom{second(\\spad{u}) = first(rest(\\spad{u}))}.")) (|tail| (($ $) "\\spad{tail(u)} returns the last node of \\spad{u}. Note: if \\spad{u} is \\axiom{shallowlyMutable},{} \\axiom{setrest(tail(\\spad{u}),{}\\spad{v}) = concat(\\spad{u},{}\\spad{v})}.")) (|last| (($ $ (|NonNegativeInteger|)) "\\spad{last(u,{}n)} returns a copy of the last \\spad{n} (\\axiom{\\spad{n} \\spad{>=} 0}) nodes of \\spad{u}. Note: \\axiom{last(\\spad{u},{}\\spad{n})} is a list of \\spad{n} elements.") ((|#1| $) "\\spad{last(u)} resturn the last element of \\spad{u}. Note: for lists,{} \\axiom{last(\\spad{u}) = \\spad{u} . (maxIndex \\spad{u}) = \\spad{u} . (\\# \\spad{u} - 1)}.")) (|rest| (($ $ (|NonNegativeInteger|)) "\\spad{rest(u,{}n)} returns the \\axiom{\\spad{n}}th (\\spad{n} \\spad{>=} 0) node of \\spad{u}. Note: \\axiom{rest(\\spad{u},{}0) = \\spad{u}}.") (($ $) "\\spad{rest(u)} returns an aggregate consisting of all but the first element of \\spad{u} (equivalently,{} the next node of \\spad{u}).")) (|elt| ((|#1| $ "last") "\\spad{elt(u,{}\"last\")} (also written: \\axiom{\\spad{u} . last}) is equivalent to last \\spad{u}.") (($ $ "rest") "\\spad{elt(\\%,{}\"rest\")} (also written: \\axiom{\\spad{u}.rest}) is equivalent to \\axiom{rest \\spad{u}}.") ((|#1| $ "first") "\\spad{elt(u,{}\"first\")} (also written: \\axiom{\\spad{u} . first}) is equivalent to first \\spad{u}.")) (|first| (($ $ (|NonNegativeInteger|)) "\\spad{first(u,{}n)} returns a copy of the first \\spad{n} (\\axiom{\\spad{n} \\spad{>=} 0}) elements of \\spad{u}.") ((|#1| $) "\\spad{first(u)} returns the first element of \\spad{u} (equivalently,{} the value at the current node).")) (|concat| (($ |#1| $) "\\spad{concat(x,{}u)} returns aggregate consisting of \\spad{x} followed by the elements of \\spad{u}. Note: if \\axiom{\\spad{v} = concat(\\spad{x},{}\\spad{u})} then \\axiom{\\spad{x} = first \\spad{v}} and \\axiom{\\spad{u} = rest \\spad{v}}.") (($ $ $) "\\spad{concat(u,{}v)} returns an aggregate \\spad{w} consisting of the elements of \\spad{u} followed by the elements of \\spad{v}. Note: \\axiom{\\spad{v} = rest(\\spad{w},{}\\#a)}."))) 
-((-2046 . T)) 
+((-2092 . T)) 
 NIL 
 (-1154 |Coef1| |Coef2| UTS1 UTS2) 
 ((|constructor| (NIL "Mapping package for univariate Taylor series. \\indented{2}{This package allows one to apply a function to the coefficients of} \\indented{2}{a univariate Taylor series.}")) (|map| ((|#4| (|Mapping| |#2| |#1|) |#3|) "\\spad{map(f,{}g(x))} applies the map \\spad{f} to the coefficients of \\indented{1}{the Taylor series \\spad{g(x)}.}"))) 
@@ -4551,7 +4551,7 @@ NIL
 (-1155 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 (-521)))) (|HasCategory| |#2| (QUOTE (-887))) (|HasCategory| |#2| (QUOTE (-1105))) (|HasSignature| |#2| (LIST (QUOTE -4084) (LIST (LIST (QUOTE -587) (QUOTE (-1084))) (|devaluate| |#2|)))) (|HasSignature| |#2| (LIST (QUOTE -2184) (LIST (|devaluate| |#2|) (|devaluate| |#2|) (QUOTE (-1084))))) (|HasCategory| |#2| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-337)))) 
+((|HasCategory| |#2| (LIST (QUOTE -29) (QUOTE (-521)))) (|HasCategory| |#2| (QUOTE (-886))) (|HasCategory| |#2| (QUOTE (-1105))) (|HasSignature| |#2| (LIST (QUOTE -4085) (LIST (LIST (QUOTE -587) (QUOTE (-1084))) (|devaluate| |#2|)))) (|HasSignature| |#2| (LIST (QUOTE -1749) (LIST (|devaluate| |#2|) (|devaluate| |#2|) (QUOTE (-1084))))) (|HasCategory| |#2| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#2| (QUOTE (-337)))) 
 (-1156 |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."))) 
 (((-4235 "*") |has| |#1| (-157)) (-4226 |has| |#1| (-513)) (-4227 . T) (-4228 . T) (-4230 . T)) 
@@ -4559,7 +4559,7 @@ NIL
 (-1157 |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}."))) 
 (((-4235 "*") |has| |#1| (-157)) (-4226 |has| |#1| (-513)) (-4227 . T) (-4228 . T) (-4230 . T)) 
-((|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-157))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-513)))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-707)) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -829) (QUOTE (-1084)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-707)) (|devaluate| |#1|))))) (|HasCategory| (-707) (QUOTE (-1025))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-707))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-707))))) (|HasSignature| |#1| (LIST (QUOTE -2189) (LIST (|devaluate| |#1|) (QUOTE (-1084)))))) (|HasCategory| |#1| (QUOTE (-337))) (-3703 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-887))) (|HasCategory| |#1| (QUOTE (-1105))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasSignature| |#1| (LIST (QUOTE -2184) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1084))))) (|HasSignature| |#1| (LIST (QUOTE -4084) (LIST (LIST (QUOTE -587) (QUOTE (-1084))) (|devaluate| |#1|))))))) 
+((|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#1| (QUOTE (-157))) (-3703 (|HasCategory| |#1| (QUOTE (-157))) (|HasCategory| |#1| (QUOTE (-513)))) (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-135))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-707)) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -828) (QUOTE (-1084)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-707)) (|devaluate| |#1|))))) (|HasCategory| (-707) (QUOTE (-1025))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-707))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-707))))) (|HasSignature| |#1| (LIST (QUOTE -2223) (LIST (|devaluate| |#1|) (QUOTE (-1084)))))) (|HasCategory| |#1| (QUOTE (-337))) (-3703 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-521)))) (|HasCategory| |#1| (QUOTE (-886))) (|HasCategory| |#1| (QUOTE (-1105))) (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -37) (LIST (QUOTE -381) (QUOTE (-521))))) (|HasSignature| |#1| (LIST (QUOTE -1749) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1084))))) (|HasSignature| |#1| (LIST (QUOTE -4085) (LIST (LIST (QUOTE -587) (QUOTE (-1084))) (|devaluate| |#1|))))))) 
 (-1158 |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 
@@ -4570,7 +4570,7 @@ NIL
 ((|HasCategory| |#1| (QUOTE (-513)))) 
 (-1160) 
 ((|constructor| (NIL "The category of domains that act like unions. UnionType,{} like Type or Category,{} acts mostly as a take that communicates `union-like' intended semantics to the compiler. A domain \\spad{D} that satifies UnionType should provide definitions for `case' operators,{} with corresponding `autoCoerce' operators."))) 
-((-2046 . T)) 
+((-2092 . T)) 
 NIL 
 (-1161 |sym|) 
 ((|constructor| (NIL "This domain implements variables")) (|variable| (((|Symbol|)) "\\spad{variable()} returns the symbol")) (|coerce| (((|Symbol|) $) "\\spad{coerce(x)} returns the symbol"))) 
@@ -4582,7 +4582,7 @@ NIL
 ((|HasCategory| |#2| (QUOTE (-927))) (|HasCategory| |#2| (QUOTE (-970))) (|HasCategory| |#2| (QUOTE (-663))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-25)))) 
 (-1163 R) 
 ((|constructor| (NIL "\\spadtype{VectorCategory} represents the type of vector like objects,{} \\spadignore{i.e.} finite sequences indexed by some finite segment of the integers. The operations available on vectors depend on the structure of the underlying components. Many operations from the component domain are defined for vectors componentwise. It can by assumed that extraction or updating components can be done in constant time.")) (|magnitude| ((|#1| $) "\\spad{magnitude(v)} computes the sqrt(dot(\\spad{v},{}\\spad{v})),{} \\spadignore{i.e.} the length")) (|length| ((|#1| $) "\\spad{length(v)} computes the sqrt(dot(\\spad{v},{}\\spad{v})),{} \\spadignore{i.e.} the magnitude")) (|cross| (($ $ $) "vectorProduct(\\spad{u},{}\\spad{v}) constructs the cross product of \\spad{u} and \\spad{v}. Error: if \\spad{u} and \\spad{v} are not of length 3.")) (|outerProduct| (((|Matrix| |#1|) $ $) "\\spad{outerProduct(u,{}v)} constructs the matrix whose (\\spad{i},{}\\spad{j})\\spad{'}th element is \\spad{u}(\\spad{i})\\spad{*v}(\\spad{j}).")) (|dot| ((|#1| $ $) "\\spad{dot(x,{}y)} computes the inner product of the two vectors \\spad{x} and \\spad{y}. Error: if \\spad{x} and \\spad{y} are not of the same length.")) (* (($ $ |#1|) "\\spad{y * r} multiplies each component of the vector \\spad{y} by the element \\spad{r}.") (($ |#1| $) "\\spad{r * y} multiplies the element \\spad{r} times each component of the vector \\spad{y}.") (($ (|Integer|) $) "\\spad{n * y} multiplies each component of the vector \\spad{y} by the integer \\spad{n}.")) (- (($ $ $) "\\spad{x - y} returns the component-wise difference of the vectors \\spad{x} and \\spad{y}. Error: if \\spad{x} and \\spad{y} are not of the same length.") (($ $) "\\spad{-x} negates all components of the vector \\spad{x}.")) (|zero| (($ (|NonNegativeInteger|)) "\\spad{zero(n)} creates a zero vector of length \\spad{n}.")) (+ (($ $ $) "\\spad{x + y} returns the component-wise sum of the vectors \\spad{x} and \\spad{y}. Error: if \\spad{x} and \\spad{y} are not of the same length."))) 
-((-4234 . T) (-4233 . T) (-2046 . T)) 
+((-4234 . T) (-4233 . T) (-2092 . T)) 
 NIL 
 (-1164 A B) 
 ((|constructor| (NIL "\\indented{2}{This package provides operations which all take as arguments} vectors of elements of some type \\spad{A} and functions from \\spad{A} to another of type \\spad{B}. The operations all iterate over their vector argument and either return a value of type \\spad{B} or a vector over \\spad{B}.")) (|map| (((|Union| (|Vector| |#2|) "failed") (|Mapping| (|Union| |#2| "failed") |#1|) (|Vector| |#1|)) "\\spad{map(f,{} v)} applies the function \\spad{f} to every element of the vector \\spad{v} producing a new vector containing the values or \\spad{\"failed\"}.") (((|Vector| |#2|) (|Mapping| |#2| |#1|) (|Vector| |#1|)) "\\spad{map(f,{} v)} applies the function \\spad{f} to every element of the vector \\spad{v} producing a new vector containing the values.")) (|reduce| ((|#2| (|Mapping| |#2| |#1| |#2|) (|Vector| |#1|) |#2|) "\\spad{reduce(func,{}vec,{}ident)} combines the elements in \\spad{vec} using the binary function \\spad{func}. Argument \\spad{ident} is returned if \\spad{vec} is empty.")) (|scan| (((|Vector| |#2|) (|Mapping| |#2| |#1| |#2|) (|Vector| |#1|) |#2|) "\\spad{scan(func,{}vec,{}ident)} creates a new vector whose elements are the result of applying reduce to the binary function \\spad{func},{} increasing initial subsequences of the vector \\spad{vec},{} and the element \\spad{ident}."))) 
@@ -4591,7 +4591,7 @@ NIL
 (-1165 R) 
 ((|constructor| (NIL "This type represents vector like objects with varying lengths and indexed by a finite segment of integers starting at 1.")) (|vector| (($ (|List| |#1|)) "\\spad{vector(l)} converts the list \\spad{l} to a vector."))) 
 ((-4234 . T) (-4233 . T)) 
-((|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| (-521) (QUOTE (-784))) (|HasCategory| |#1| (QUOTE (-1013))) (-3703 (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| |#1| (QUOTE (-1013)))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-663))) (|HasCategory| |#1| (QUOTE (-970))) (-12 (|HasCategory| |#1| (QUOTE (-927))) (|HasCategory| |#1| (QUOTE (-970)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-784))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|))))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-792)))))) 
+((|HasCategory| |#1| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| (-521) (QUOTE (-783))) (|HasCategory| |#1| (QUOTE (-1013))) (-3703 (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#1| (QUOTE (-1013)))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-663))) (|HasCategory| |#1| (QUOTE (-970))) (-12 (|HasCategory| |#1| (QUOTE (-927))) (|HasCategory| |#1| (QUOTE (-970)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-783))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|))))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))) (-3703 (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (LIST (QUOTE -284) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -561) (QUOTE (-791)))))) 
 (-1166) 
 ((|constructor| (NIL "TwoDimensionalViewport creates viewports to display graphs.")) (|coerce| (((|OutputForm|) $) "\\spad{coerce(v)} returns the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport} as output of the domain \\spadtype{OutputForm}.")) (|key| (((|Integer|) $) "\\spad{key(v)} returns the process ID number of the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport}.")) (|reset| (((|Void|) $) "\\spad{reset(v)} sets the current state of the graph characteristics of the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} back to their initial settings.")) (|write| (((|String|) $ (|String|) (|List| (|String|))) "\\spad{write(v,{}s,{}lf)} takes the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} and creates a directory indicated by \\spad{s},{} which contains the graph data files for \\spad{v} and the optional file types indicated by the list \\spad{lf}.") (((|String|) $ (|String|) (|String|)) "\\spad{write(v,{}s,{}f)} takes the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} and creates a directory indicated by \\spad{s},{} which contains the graph data files for \\spad{v} and an optional file type \\spad{f}.") (((|String|) $ (|String|)) "\\spad{write(v,{}s)} takes the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} and creates a directory indicated by \\spad{s},{} which contains the graph data files for \\spad{v}.")) (|resize| (((|Void|) $ (|PositiveInteger|) (|PositiveInteger|)) "\\spad{resize(v,{}w,{}h)} displays the two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} with a width of \\spad{w} and a height of \\spad{h},{} keeping the upper left-hand corner position unchanged.")) (|update| (((|Void|) $ (|GraphImage|) (|PositiveInteger|)) "\\spad{update(v,{}gr,{}n)} drops the graph \\spad{gr} in slot \\spad{n} of viewport \\spad{v}. The graph \\spad{gr} must have been transmitted already and acquired an integer key.")) (|move| (((|Void|) $ (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{move(v,{}x,{}y)} displays the two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} with the upper left-hand corner of the viewport window at the screen coordinate position \\spad{x},{} \\spad{y}.")) (|show| (((|Void|) $ (|PositiveInteger|) (|String|)) "\\spad{show(v,{}n,{}s)} displays the graph in field \\spad{n} of the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} if \\spad{s} is \"on\",{} or does not display the graph if \\spad{s} is \"off\".")) (|translate| (((|Void|) $ (|PositiveInteger|) (|Float|) (|Float|)) "\\spad{translate(v,{}n,{}dx,{}dy)} displays the graph in field \\spad{n} of the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} translated by \\spad{dx} in the \\spad{x}-coordinate direction from the center of the viewport,{} and by \\spad{dy} in the \\spad{y}-coordinate direction from the center. Setting \\spad{dx} and \\spad{dy} to \\spad{0} places the center of the graph at the center of the viewport.")) (|scale| (((|Void|) $ (|PositiveInteger|) (|Float|) (|Float|)) "\\spad{scale(v,{}n,{}sx,{}sy)} displays the graph in field \\spad{n} of the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} scaled by the factor \\spad{sx} in the \\spad{x}-coordinate direction and by the factor \\spad{sy} in the \\spad{y}-coordinate direction.")) (|dimensions| (((|Void|) $ (|NonNegativeInteger|) (|NonNegativeInteger|) (|PositiveInteger|) (|PositiveInteger|)) "\\spad{dimensions(v,{}x,{}y,{}width,{}height)} sets the position of the upper left-hand corner of the two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} to the window coordinate \\spad{x},{} \\spad{y},{} and sets the dimensions of the window to that of \\spad{width},{} \\spad{height}. The new dimensions are not displayed until the function \\spadfun{makeViewport2D} is executed again for \\spad{v}.")) (|close| (((|Void|) $) "\\spad{close(v)} closes the viewport window of the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} and terminates the corresponding process ID.")) (|controlPanel| (((|Void|) $ (|String|)) "\\spad{controlPanel(v,{}s)} displays the control panel of the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} if \\spad{s} is \"on\",{} or hides the control panel if \\spad{s} is \"off\".")) (|connect| (((|Void|) $ (|PositiveInteger|) (|String|)) "\\spad{connect(v,{}n,{}s)} displays the lines connecting the graph points in field \\spad{n} of the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} if \\spad{s} is \"on\",{} or does not display the lines if \\spad{s} is \"off\".")) (|region| (((|Void|) $ (|PositiveInteger|) (|String|)) "\\spad{region(v,{}n,{}s)} displays the bounding box of the graph in field \\spad{n} of the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} if \\spad{s} is \"on\",{} or does not display the bounding box if \\spad{s} is \"off\".")) (|points| (((|Void|) $ (|PositiveInteger|) (|String|)) "\\spad{points(v,{}n,{}s)} displays the points of the graph in field \\spad{n} of the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} if \\spad{s} is \"on\",{} or does not display the points if \\spad{s} is \"off\".")) (|units| (((|Void|) $ (|PositiveInteger|) (|Palette|)) "\\spad{units(v,{}n,{}c)} displays the units of the graph in field \\spad{n} of the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} with the units color set to the given palette color \\spad{c}.") (((|Void|) $ (|PositiveInteger|) (|String|)) "\\spad{units(v,{}n,{}s)} displays the units of the graph in field \\spad{n} of the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} if \\spad{s} is \"on\",{} or does not display the units if \\spad{s} is \"off\".")) (|axes| (((|Void|) $ (|PositiveInteger|) (|Palette|)) "\\spad{axes(v,{}n,{}c)} displays the axes of the graph in field \\spad{n} of the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} with the axes color set to the given palette color \\spad{c}.") (((|Void|) $ (|PositiveInteger|) (|String|)) "\\spad{axes(v,{}n,{}s)} displays the axes of the graph in field \\spad{n} of the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} if \\spad{s} is \"on\",{} or does not display the axes if \\spad{s} is \"off\".")) (|getGraph| (((|GraphImage|) $ (|PositiveInteger|)) "\\spad{getGraph(v,{}n)} returns the graph which is of the domain \\spadtype{GraphImage} which is located in graph field \\spad{n} of the given two-dimensional viewport,{} \\spad{v},{} which is of the domain \\spadtype{TwoDimensionalViewport}.")) (|putGraph| (((|Void|) $ (|GraphImage|) (|PositiveInteger|)) "\\spad{putGraph(v,{}\\spad{gi},{}n)} sets the graph field indicated by \\spad{n},{} of the indicated two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} to be the graph,{} \\spad{\\spad{gi}} of domain \\spadtype{GraphImage}. The contents of viewport,{} \\spad{v},{} will contain \\spad{\\spad{gi}} when the function \\spadfun{makeViewport2D} is called to create the an updated viewport \\spad{v}.")) (|title| (((|Void|) $ (|String|)) "\\spad{title(v,{}s)} changes the title which is shown in the two-dimensional viewport window,{} \\spad{v} of domain \\spadtype{TwoDimensionalViewport}.")) (|graphs| (((|Vector| (|Union| (|GraphImage|) "undefined")) $) "\\spad{graphs(v)} returns a vector,{} or list,{} which is a union of all the graphs,{} of the domain \\spadtype{GraphImage},{} which are allocated for the two-dimensional viewport,{} \\spad{v},{} of domain \\spadtype{TwoDimensionalViewport}. Those graphs which have no data are labeled \"undefined\",{} otherwise their contents are shown.")) (|graphStates| (((|Vector| (|Record| (|:| |scaleX| (|DoubleFloat|)) (|:| |scaleY| (|DoubleFloat|)) (|:| |deltaX| (|DoubleFloat|)) (|:| |deltaY| (|DoubleFloat|)) (|:| |points| (|Integer|)) (|:| |connect| (|Integer|)) (|:| |spline| (|Integer|)) (|:| |axes| (|Integer|)) (|:| |axesColor| (|Palette|)) (|:| |units| (|Integer|)) (|:| |unitsColor| (|Palette|)) (|:| |showing| (|Integer|)))) $) "\\spad{graphStates(v)} returns and shows a listing of a record containing the current state of the characteristics of each of the ten graph records in the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport}.")) (|graphState| (((|Void|) $ (|PositiveInteger|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Palette|) (|Integer|) (|Palette|) (|Integer|)) "\\spad{graphState(v,{}num,{}sX,{}sY,{}dX,{}dY,{}pts,{}lns,{}box,{}axes,{}axesC,{}un,{}unC,{}cP)} sets the state of the characteristics for the graph indicated by \\spad{num} in the given two-dimensional viewport \\spad{v},{} of domain \\spadtype{TwoDimensionalViewport},{} to the values given as parameters. The scaling of the graph in the \\spad{x} and \\spad{y} component directions is set to be \\spad{sX} and \\spad{sY}; the window translation in the \\spad{x} and \\spad{y} component directions is set to be \\spad{dX} and \\spad{dY}; The graph points,{} lines,{} bounding \\spad{box},{} \\spad{axes},{} or units will be shown in the viewport if their given parameters \\spad{pts},{} \\spad{lns},{} \\spad{box},{} \\spad{axes} or \\spad{un} are set to be \\spad{1},{} but will not be shown if they are set to \\spad{0}. The color of the \\spad{axes} and the color of the units are indicated by the palette colors \\spad{axesC} and \\spad{unC} respectively. To display the control panel when the viewport window is displayed,{} set \\spad{cP} to \\spad{1},{} otherwise set it to \\spad{0}.")) (|options| (($ $ (|List| (|DrawOption|))) "\\spad{options(v,{}lopt)} takes the given two-dimensional viewport,{} \\spad{v},{} of the domain \\spadtype{TwoDimensionalViewport} and returns \\spad{v} with it\\spad{'s} draw options modified to be those which are indicated in the given list,{} \\spad{lopt} of domain \\spadtype{DrawOption}.") (((|List| (|DrawOption|)) $) "\\spad{options(v)} takes the given two-dimensional viewport,{} \\spad{v},{} of the domain \\spadtype{TwoDimensionalViewport} and returns a list containing the draw options from the domain \\spadtype{DrawOption} for \\spad{v}.")) (|makeViewport2D| (($ (|GraphImage|) (|List| (|DrawOption|))) "\\spad{makeViewport2D(\\spad{gi},{}lopt)} creates and displays a viewport window of the domain \\spadtype{TwoDimensionalViewport} whose graph field is assigned to be the given graph,{} \\spad{\\spad{gi}},{} of domain \\spadtype{GraphImage},{} and whose options field is set to be the list of options,{} \\spad{lopt} of domain \\spadtype{DrawOption}.") (($ $) "\\spad{makeViewport2D(v)} takes the given two-dimensional viewport,{} \\spad{v},{} of the domain \\spadtype{TwoDimensionalViewport} and displays a viewport window on the screen which contains the contents of \\spad{v}.")) (|viewport2D| (($) "\\spad{viewport2D()} returns an undefined two-dimensional viewport of the domain \\spadtype{TwoDimensionalViewport} whose contents are empty.")) (|getPickedPoints| (((|List| (|Point| (|DoubleFloat|))) $) "\\spad{getPickedPoints(x)} returns a list of small floats for the points the user interactively picked on the viewport for full integration into the system,{} some design issues need to be addressed: \\spadignore{e.g.} how to go through the GraphImage interface,{} how to default to graphs,{} etc."))) 
 NIL 
@@ -4635,7 +4635,7 @@ NIL
 (-1176 R E V P) 
 ((|constructor| (NIL "A domain constructor of the category \\axiomType{GeneralTriangularSet}. The only requirement for a list of polynomials to be a member of such a domain is the following: no polynomial is constant and two distinct polynomials have distinct main variables. Such a triangular set may not be auto-reduced or consistent. The \\axiomOpFrom{construct}{WuWenTsunTriangularSet} operation does not check the previous requirement. Triangular sets are stored as sorted lists \\spad{w}.\\spad{r}.\\spad{t}. the main variables of their members. Furthermore,{} this domain exports operations dealing with the characteristic set method of Wu Wen Tsun and some optimizations mainly proposed by Dong Ming Wang.\\newline References : \\indented{1}{[1] \\spad{W}. \\spad{T}. WU \"A Zero Structure Theorem for polynomial equations solving\"} \\indented{6}{\\spad{MM} Research Preprints,{} 1987.} \\indented{1}{[2] \\spad{D}. \\spad{M}. WANG \"An implementation of the characteristic set method in Maple\"} \\indented{6}{Proc. DISCO'92. Bath,{} England.}")) (|characteristicSerie| (((|List| $) (|List| |#4|)) "\\axiom{characteristicSerie(\\spad{ps})} returns the same as \\axiom{characteristicSerie(\\spad{ps},{}initiallyReduced?,{}initiallyReduce)}.") (((|List| $) (|List| |#4|) (|Mapping| (|Boolean|) |#4| |#4|) (|Mapping| |#4| |#4| |#4|)) "\\axiom{characteristicSerie(\\spad{ps},{}redOp?,{}redOp)} returns a list \\axiom{\\spad{lts}} of triangular sets such that the zero set of \\axiom{\\spad{ps}} is the union of the regular zero sets of the members of \\axiom{\\spad{lts}}. This is made by the Ritt and Wu Wen Tsun process applying the operation \\axiom{characteristicSet(\\spad{ps},{}redOp?,{}redOp)} to compute characteristic sets in Wu Wen Tsun sense.")) (|characteristicSet| (((|Union| $ "failed") (|List| |#4|)) "\\axiom{characteristicSet(\\spad{ps})} returns the same as \\axiom{characteristicSet(\\spad{ps},{}initiallyReduced?,{}initiallyReduce)}.") (((|Union| $ "failed") (|List| |#4|) (|Mapping| (|Boolean|) |#4| |#4|) (|Mapping| |#4| |#4| |#4|)) "\\axiom{characteristicSet(\\spad{ps},{}redOp?,{}redOp)} returns a non-contradictory characteristic set of \\axiom{\\spad{ps}} in Wu Wen Tsun sense \\spad{w}.\\spad{r}.\\spad{t} the reduction-test \\axiom{redOp?} (using \\axiom{redOp} to reduce polynomials \\spad{w}.\\spad{r}.\\spad{t} a \\axiom{redOp?} basic set),{} if no non-zero constant polynomial appear during those reductions,{} else \\axiom{\"failed\"} is returned. The operations \\axiom{redOp} and \\axiom{redOp?} must satisfy the following conditions: \\axiom{redOp?(redOp(\\spad{p},{}\\spad{q}),{}\\spad{q})} holds for every polynomials \\axiom{\\spad{p},{}\\spad{q}} and there exists an integer \\axiom{\\spad{e}} and a polynomial \\axiom{\\spad{f}} such that we have \\axiom{init(\\spad{q})^e*p = \\spad{f*q} + redOp(\\spad{p},{}\\spad{q})}.")) (|medialSet| (((|Union| $ "failed") (|List| |#4|)) "\\axiom{medial(\\spad{ps})} returns the same as \\axiom{medialSet(\\spad{ps},{}initiallyReduced?,{}initiallyReduce)}.") (((|Union| $ "failed") (|List| |#4|) (|Mapping| (|Boolean|) |#4| |#4|) (|Mapping| |#4| |#4| |#4|)) "\\axiom{medialSet(\\spad{ps},{}redOp?,{}redOp)} returns \\axiom{\\spad{bs}} a basic set (in Wu Wen Tsun sense \\spad{w}.\\spad{r}.\\spad{t} the reduction-test \\axiom{redOp?}) of some set generating the same ideal as \\axiom{\\spad{ps}} (with rank not higher than any basic set of \\axiom{\\spad{ps}}),{} if no non-zero constant polynomials appear during the computatioms,{} else \\axiom{\"failed\"} is returned. In the former case,{} \\axiom{\\spad{bs}} has to be understood as a candidate for being a characteristic set of \\axiom{\\spad{ps}}. In the original algorithm,{} \\axiom{\\spad{bs}} is simply a basic set of \\axiom{\\spad{ps}}."))) 
 ((-4234 . T) (-4233 . T)) 
-((|HasCategory| |#4| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#4| (QUOTE (-1013))) (-12 (|HasCategory| |#4| (QUOTE (-1013))) (|HasCategory| |#4| (LIST (QUOTE -284) (|devaluate| |#4|)))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#3| (QUOTE (-342))) (|HasCategory| |#4| (LIST (QUOTE -561) (QUOTE (-792))))) 
+((|HasCategory| |#4| (LIST (QUOTE -562) (QUOTE (-497)))) (|HasCategory| |#4| (QUOTE (-1013))) (-12 (|HasCategory| |#4| (QUOTE (-1013))) (|HasCategory| |#4| (LIST (QUOTE -284) (|devaluate| |#4|)))) (|HasCategory| |#1| (QUOTE (-513))) (|HasCategory| |#3| (QUOTE (-342))) (|HasCategory| |#4| (LIST (QUOTE -561) (QUOTE (-791))))) 
 (-1177 R) 
 ((|constructor| (NIL "This is the category of algebras over non-commutative rings. It is used by constructors of non-commutative algebras such as: \\indented{4}{\\spadtype{XPolynomialRing}.} \\indented{4}{\\spadtype{XFreeAlgebra}} Author: Michel Petitot (petitot@lifl.\\spad{fr})")) (|coerce| (($ |#1|) "\\spad{coerce(r)} equals \\spad{r*1}."))) 
 ((-4227 . T) (-4228 . T) (-4230 . T)) 
@@ -4716,4 +4716,4 @@ NIL
 NIL 
 NIL 
 NIL 
-((-1196 NIL 2233082 2233087 2233092 2233097) (-3 NIL 2233062 2233067 2233072 2233077) (-2 NIL 2233042 2233047 2233052 2233057) (-1 NIL 2233022 2233027 2233032 2233037) (0 NIL 2233002 2233007 2233012 2233017) (-1191 "ZMOD.spad" 2232811 2232824 2232940 2232997) (-1190 "ZLINDEP.spad" 2231855 2231866 2232801 2232806) (-1189 "ZDSOLVE.spad" 2221704 2221726 2231845 2231850) (-1188 "YSTREAM.spad" 2221197 2221208 2221694 2221699) (-1187 "XRPOLY.spad" 2220417 2220437 2221053 2221122) (-1186 "XPR.spad" 2218146 2218159 2220135 2220234) (-1185 "XPOLY.spad" 2217701 2217712 2218002 2218071) (-1184 "XPOLYC.spad" 2217018 2217034 2217627 2217696) (-1183 "XPBWPOLY.spad" 2215455 2215475 2216798 2216867) (-1182 "XF.spad" 2213916 2213931 2215357 2215450) (-1181 "XF.spad" 2212357 2212374 2213800 2213805) (-1180 "XFALG.spad" 2209381 2209397 2212283 2212352) (-1179 "XEXPPKG.spad" 2208632 2208658 2209371 2209376) (-1178 "XDPOLY.spad" 2208246 2208262 2208488 2208557) (-1177 "XALG.spad" 2207844 2207855 2208202 2208241) (-1176 "WUTSET.spad" 2203683 2203700 2207490 2207517) (-1175 "WP.spad" 2202697 2202741 2203541 2203608) (-1174 "WFFINTBS.spad" 2200260 2200282 2202687 2202692) (-1173 "WEIER.spad" 2198474 2198485 2200250 2200255) (-1172 "VSPACE.spad" 2198147 2198158 2198442 2198469) (-1171 "VSPACE.spad" 2197840 2197853 2198137 2198142) (-1170 "VOID.spad" 2197430 2197439 2197830 2197835) (-1169 "VIEW.spad" 2195052 2195061 2197420 2197425) (-1168 "VIEWDEF.spad" 2190249 2190258 2195042 2195047) (-1167 "VIEW3D.spad" 2174084 2174093 2190239 2190244) (-1166 "VIEW2D.spad" 2161821 2161830 2174074 2174079) (-1165 "VECTOR.spad" 2160498 2160509 2160749 2160776) (-1164 "VECTOR2.spad" 2159125 2159138 2160488 2160493) (-1163 "VECTCAT.spad" 2157013 2157024 2159081 2159120) (-1162 "VECTCAT.spad" 2154722 2154735 2156792 2156797) (-1161 "VARIABLE.spad" 2154502 2154517 2154712 2154717) (-1160 "UTYPE.spad" 2154136 2154145 2154482 2154497) (-1159 "UTSODETL.spad" 2153429 2153453 2154092 2154097) (-1158 "UTSODE.spad" 2151617 2151637 2153419 2153424) (-1157 "UTS.spad" 2146406 2146434 2150084 2150181) (-1156 "UTSCAT.spad" 2143857 2143873 2146304 2146401) (-1155 "UTSCAT.spad" 2140952 2140970 2143401 2143406) (-1154 "UTS2.spad" 2140545 2140580 2140942 2140947) (-1153 "URAGG.spad" 2135167 2135178 2140525 2140540) (-1152 "URAGG.spad" 2129763 2129776 2135123 2135128) (-1151 "UPXSSING.spad" 2127409 2127435 2128847 2128980) (-1150 "UPXS.spad" 2124436 2124464 2125541 2125690) (-1149 "UPXSCONS.spad" 2122193 2122213 2122568 2122717) (-1148 "UPXSCCA.spad" 2120651 2120671 2122039 2122188) (-1147 "UPXSCCA.spad" 2119251 2119273 2120641 2120646) (-1146 "UPXSCAT.spad" 2117832 2117848 2119097 2119246) (-1145 "UPXS2.spad" 2117373 2117426 2117822 2117827) (-1144 "UPSQFREE.spad" 2115785 2115799 2117363 2117368) (-1143 "UPSCAT.spad" 2113378 2113402 2115683 2115780) (-1142 "UPSCAT.spad" 2110677 2110703 2112984 2112989) (-1141 "UPOLYC.spad" 2105655 2105666 2110519 2110672) (-1140 "UPOLYC.spad" 2100525 2100538 2105391 2105396) (-1139 "UPOLYC2.spad" 2099994 2100013 2100515 2100520) (-1138 "UP.spad" 2097044 2097059 2097552 2097705) (-1137 "UPMP.spad" 2095934 2095947 2097034 2097039) (-1136 "UPDIVP.spad" 2095497 2095511 2095924 2095929) (-1135 "UPDECOMP.spad" 2093734 2093748 2095487 2095492) (-1134 "UPCDEN.spad" 2092941 2092957 2093724 2093729) (-1133 "UP2.spad" 2092303 2092324 2092931 2092936) (-1132 "UNISEG.spad" 2091656 2091667 2092222 2092227) (-1131 "UNISEG2.spad" 2091149 2091162 2091612 2091617) (-1130 "UNIFACT.spad" 2090250 2090262 2091139 2091144) (-1129 "ULS.spad" 2080809 2080837 2081902 2082331) (-1128 "ULSCONS.spad" 2074852 2074872 2075224 2075373) (-1127 "ULSCCAT.spad" 2072449 2072469 2074672 2074847) (-1126 "ULSCCAT.spad" 2070180 2070202 2072405 2072410) (-1125 "ULSCAT.spad" 2068396 2068412 2070026 2070175) (-1124 "ULS2.spad" 2067908 2067961 2068386 2068391) (-1123 "UFD.spad" 2066973 2066982 2067834 2067903) (-1122 "UFD.spad" 2066100 2066111 2066963 2066968) (-1121 "UDVO.spad" 2064947 2064956 2066090 2066095) (-1120 "UDPO.spad" 2062374 2062385 2064903 2064908) (-1119 "TYPE.spad" 2062296 2062305 2062354 2062369) (-1118 "TWOFACT.spad" 2060946 2060961 2062286 2062291) (-1117 "TUPLE.spad" 2060332 2060343 2060845 2060850) (-1116 "TUBETOOL.spad" 2057169 2057178 2060322 2060327) (-1115 "TUBE.spad" 2055810 2055827 2057159 2057164) (-1114 "TS.spad" 2054399 2054415 2055375 2055472) (-1113 "TSETCAT.spad" 2041514 2041531 2054355 2054394) (-1112 "TSETCAT.spad" 2028627 2028646 2041470 2041475) (-1111 "TRMANIP.spad" 2022993 2023010 2028333 2028338) (-1110 "TRIMAT.spad" 2021952 2021977 2022983 2022988) (-1109 "TRIGMNIP.spad" 2020469 2020486 2021942 2021947) (-1108 "TRIGCAT.spad" 2019981 2019990 2020459 2020464) (-1107 "TRIGCAT.spad" 2019491 2019502 2019971 2019976) (-1106 "TREE.spad" 2018062 2018073 2019098 2019125) (-1105 "TRANFUN.spad" 2017893 2017902 2018052 2018057) (-1104 "TRANFUN.spad" 2017722 2017733 2017883 2017888) (-1103 "TOPSP.spad" 2017396 2017405 2017712 2017717) (-1102 "TOOLSIGN.spad" 2017059 2017070 2017386 2017391) (-1101 "TEXTFILE.spad" 2015616 2015625 2017049 2017054) (-1100 "TEX.spad" 2012633 2012642 2015606 2015611) (-1099 "TEX1.spad" 2012189 2012200 2012623 2012628) (-1098 "TEMUTL.spad" 2011744 2011753 2012179 2012184) (-1097 "TBCMPPK.spad" 2009837 2009860 2011734 2011739) (-1096 "TBAGG.spad" 2008861 2008884 2009805 2009832) (-1095 "TBAGG.spad" 2007905 2007930 2008851 2008856) (-1094 "TANEXP.spad" 2007281 2007292 2007895 2007900) (-1093 "TABLE.spad" 2005692 2005715 2005962 2005989) (-1092 "TABLEAU.spad" 2005173 2005184 2005682 2005687) (-1091 "TABLBUMP.spad" 2001956 2001967 2005163 2005168) (-1090 "SYSSOLP.spad" 1999429 1999440 2001946 2001951) (-1089 "SYNTAX.spad" 1995714 1995723 1999419 1999424) (-1088 "SYMTAB.spad" 1993770 1993779 1995704 1995709) (-1087 "SYMS.spad" 1989755 1989764 1993760 1993765) (-1086 "SYMPOLY.spad" 1988765 1988776 1988847 1988974) (-1085 "SYMFUNC.spad" 1988240 1988251 1988755 1988760) (-1084 "SYMBOL.spad" 1985576 1985585 1988230 1988235) (-1083 "SWITCH.spad" 1982333 1982342 1985566 1985571) (-1082 "SUTS.spad" 1979232 1979260 1980800 1980897) (-1081 "SUPXS.spad" 1976246 1976274 1977364 1977513) (-1080 "SUP.spad" 1973023 1973034 1973804 1973957) (-1079 "SUPFRACF.spad" 1972128 1972146 1973013 1973018) (-1078 "SUP2.spad" 1971518 1971531 1972118 1972123) (-1077 "SUMRF.spad" 1970484 1970495 1971508 1971513) (-1076 "SUMFS.spad" 1970117 1970134 1970474 1970479) (-1075 "SULS.spad" 1960663 1960691 1961769 1962198) (-1074 "SUCH.spad" 1960343 1960358 1960653 1960658) (-1073 "SUBSPACE.spad" 1952350 1952365 1960333 1960338) (-1072 "SUBRESP.spad" 1951510 1951524 1952306 1952311) (-1071 "STTF.spad" 1947609 1947625 1951500 1951505) (-1070 "STTFNC.spad" 1944077 1944093 1947599 1947604) (-1069 "STTAYLOR.spad" 1936475 1936486 1943958 1943963) (-1068 "STRTBL.spad" 1934980 1934997 1935129 1935156) (-1067 "STRING.spad" 1934389 1934398 1934403 1934430) (-1066 "STRICAT.spad" 1934165 1934174 1934345 1934384) (-1065 "STREAM.spad" 1930933 1930944 1933690 1933705) (-1064 "STREAM3.spad" 1930478 1930493 1930923 1930928) (-1063 "STREAM2.spad" 1929546 1929559 1930468 1930473) (-1062 "STREAM1.spad" 1929250 1929261 1929536 1929541) (-1061 "STINPROD.spad" 1928156 1928172 1929240 1929245) (-1060 "STEP.spad" 1927357 1927366 1928146 1928151) (-1059 "STBL.spad" 1925883 1925911 1926050 1926065) (-1058 "STAGG.spad" 1924948 1924959 1925863 1925878) (-1057 "STAGG.spad" 1924021 1924034 1924938 1924943) (-1056 "STACK.spad" 1923372 1923383 1923628 1923655) (-1055 "SREGSET.spad" 1921076 1921093 1923018 1923045) (-1054 "SRDCMPK.spad" 1919621 1919641 1921066 1921071) (-1053 "SRAGG.spad" 1914706 1914715 1919577 1919616) (-1052 "SRAGG.spad" 1909823 1909834 1914696 1914701) (-1051 "SQMATRIX.spad" 1907449 1907467 1908357 1908444) (-1050 "SPLTREE.spad" 1902001 1902014 1906885 1906912) (-1049 "SPLNODE.spad" 1898589 1898602 1901991 1901996) (-1048 "SPFCAT.spad" 1897366 1897375 1898579 1898584) (-1047 "SPECOUT.spad" 1895916 1895925 1897356 1897361) (-1046 "spad-parser.spad" 1895381 1895390 1895906 1895911) (-1045 "SPACEC.spad" 1879394 1879405 1895371 1895376) (-1044 "SPACE3.spad" 1879170 1879181 1879384 1879389) (-1043 "SORTPAK.spad" 1878715 1878728 1879126 1879131) (-1042 "SOLVETRA.spad" 1876472 1876483 1878705 1878710) (-1041 "SOLVESER.spad" 1874992 1875003 1876462 1876467) (-1040 "SOLVERAD.spad" 1871002 1871013 1874982 1874987) (-1039 "SOLVEFOR.spad" 1869422 1869440 1870992 1870997) (-1038 "SNTSCAT.spad" 1869010 1869027 1869378 1869417) (-1037 "SMTS.spad" 1867270 1867296 1868575 1868672) (-1036 "SMP.spad" 1864712 1864732 1865102 1865229) (-1035 "SMITH.spad" 1863555 1863580 1864702 1864707) (-1034 "SMATCAT.spad" 1861653 1861683 1863487 1863550) (-1033 "SMATCAT.spad" 1859695 1859727 1861531 1861536) (-1032 "SKAGG.spad" 1858644 1858655 1859651 1859690) (-1031 "SINT.spad" 1856952 1856961 1858510 1858639) (-1030 "SIMPAN.spad" 1856680 1856689 1856942 1856947) (-1029 "SIGNRF.spad" 1855788 1855799 1856670 1856675) (-1028 "SIGNEF.spad" 1855057 1855074 1855778 1855783) (-1027 "SHP.spad" 1852975 1852990 1855013 1855018) (-1026 "SHDP.spad" 1844365 1844392 1844874 1845003) (-1025 "SGROUP.spad" 1843831 1843840 1844355 1844360) (-1024 "SGROUP.spad" 1843295 1843306 1843821 1843826) (-1023 "SGCF.spad" 1836176 1836185 1843285 1843290) (-1022 "SFRTCAT.spad" 1835092 1835109 1836132 1836171) (-1021 "SFRGCD.spad" 1834155 1834175 1835082 1835087) (-1020 "SFQCMPK.spad" 1828792 1828812 1834145 1834150) (-1019 "SFORT.spad" 1828227 1828241 1828782 1828787) (-1018 "SEXOF.spad" 1828070 1828110 1828217 1828222) (-1017 "SEX.spad" 1827962 1827971 1828060 1828065) (-1016 "SEXCAT.spad" 1825066 1825106 1827952 1827957) (-1015 "SET.spad" 1823366 1823377 1824487 1824526) (-1014 "SETMN.spad" 1821800 1821817 1823356 1823361) (-1013 "SETCAT.spad" 1821285 1821294 1821790 1821795) (-1012 "SETCAT.spad" 1820768 1820779 1821275 1821280) (-1011 "SETAGG.spad" 1817291 1817302 1820736 1820763) (-1010 "SETAGG.spad" 1813834 1813847 1817281 1817286) (-1009 "SEGXCAT.spad" 1812946 1812959 1813814 1813829) (-1008 "SEG.spad" 1812759 1812770 1812865 1812870) (-1007 "SEGCAT.spad" 1811578 1811589 1812739 1812754) (-1006 "SEGBIND.spad" 1810650 1810661 1811533 1811538) (-1005 "SEGBIND2.spad" 1810346 1810359 1810640 1810645) (-1004 "SEG2.spad" 1809771 1809784 1810302 1810307) (-1003 "SDVAR.spad" 1809047 1809058 1809761 1809766) (-1002 "SDPOL.spad" 1806440 1806451 1806731 1806858) (-1001 "SCPKG.spad" 1804519 1804530 1806430 1806435) (-1000 "SCOPE.spad" 1803664 1803673 1804509 1804514) (-999 "SCACHE.spad" 1802347 1802357 1803654 1803659) (-998 "SAOS.spad" 1802220 1802228 1802337 1802342) (-997 "SAERFFC.spad" 1801934 1801953 1802210 1802215) (-996 "SAE.spad" 1800113 1800128 1800723 1800858) (-995 "SAEFACT.spad" 1799815 1799834 1800103 1800108) (-994 "RURPK.spad" 1797457 1797472 1799805 1799810) (-993 "RULESET.spad" 1796899 1796922 1797447 1797452) (-992 "RULE.spad" 1795104 1795127 1796889 1796894) (-991 "RULECOLD.spad" 1794957 1794969 1795094 1795099) (-990 "RSETGCD.spad" 1791336 1791355 1794947 1794952) (-989 "RSETCAT.spad" 1781109 1781125 1791292 1791331) (-988 "RSETCAT.spad" 1770914 1770932 1781099 1781104) (-987 "RSDCMPK.spad" 1769367 1769386 1770904 1770909) (-986 "RRCC.spad" 1767752 1767781 1769357 1769362) (-985 "RRCC.spad" 1766135 1766166 1767742 1767747) (-984 "RPOLCAT.spad" 1745496 1745510 1766003 1766130) (-983 "RPOLCAT.spad" 1724572 1724588 1745081 1745086) (-982 "ROUTINE.spad" 1720436 1720444 1723219 1723246) (-981 "ROMAN.spad" 1719669 1719677 1720302 1720431) (-980 "ROIRC.spad" 1718750 1718781 1719659 1719664) (-979 "RNS.spad" 1717654 1717662 1718652 1718745) (-978 "RNS.spad" 1716644 1716654 1717644 1717649) (-977 "RNG.spad" 1716380 1716388 1716634 1716639) (-976 "RMODULE.spad" 1716019 1716029 1716370 1716375) (-975 "RMCAT2.spad" 1715428 1715484 1716009 1716014) (-974 "RMATRIX.spad" 1714108 1714126 1714595 1714634) (-973 "RMATCAT.spad" 1709630 1709660 1714052 1714103) (-972 "RMATCAT.spad" 1705054 1705086 1709478 1709483) (-971 "RINTERP.spad" 1704943 1704962 1705044 1705049) (-970 "RING.spad" 1704301 1704309 1704923 1704938) (-969 "RING.spad" 1703667 1703677 1704291 1704296) (-968 "RIDIST.spad" 1703052 1703060 1703657 1703662) (-967 "RGCHAIN.spad" 1701632 1701647 1702537 1702564) (-966 "RF.spad" 1699247 1699257 1701622 1701627) (-965 "RFFACTOR.spad" 1698710 1698720 1699237 1699242) (-964 "RFFACT.spad" 1698446 1698457 1698700 1698705) (-963 "RFDIST.spad" 1697435 1697443 1698436 1698441) (-962 "RETSOL.spad" 1696853 1696865 1697425 1697430) (-961 "RETRACT.spad" 1696203 1696213 1696843 1696848) (-960 "RETRACT.spad" 1695551 1695563 1696193 1696198) (-959 "RESULT.spad" 1693612 1693620 1694198 1694225) (-958 "RESRING.spad" 1692960 1693006 1693550 1693607) (-957 "RESLATC.spad" 1692285 1692295 1692950 1692955) (-956 "REPSQ.spad" 1692015 1692025 1692275 1692280) (-955 "REP.spad" 1689568 1689576 1692005 1692010) (-954 "REPDB.spad" 1689274 1689284 1689558 1689563) (-953 "REP2.spad" 1678847 1678857 1689116 1689121) (-952 "REP1.spad" 1672838 1672848 1678797 1678802) (-951 "REGSET.spad" 1670636 1670652 1672484 1672511) (-950 "REF.spad" 1669966 1669976 1670591 1670596) (-949 "REDORDER.spad" 1669143 1669159 1669956 1669961) (-948 "RECLOS.spad" 1667933 1667952 1668636 1668729) (-947 "REALSOLV.spad" 1667066 1667074 1667923 1667928) (-946 "REAL.spad" 1666939 1666947 1667056 1667061) (-945 "REAL0Q.spad" 1664222 1664236 1666929 1666934) (-944 "REAL0.spad" 1661051 1661065 1664212 1664217) (-943 "RDIV.spad" 1660703 1660727 1661041 1661046) (-942 "RDIST.spad" 1660267 1660277 1660693 1660698) (-941 "RDETRS.spad" 1659064 1659081 1660257 1660262) (-940 "RDETR.spad" 1657172 1657189 1659054 1659059) (-939 "RDEEFS.spad" 1656246 1656262 1657162 1657167) (-938 "RDEEF.spad" 1655243 1655259 1656236 1656241) (-937 "RCFIELD.spad" 1652427 1652435 1655145 1655238) (-936 "RCFIELD.spad" 1649697 1649707 1652417 1652422) (-935 "RCAGG.spad" 1647600 1647610 1649677 1649692) (-934 "RCAGG.spad" 1645440 1645452 1647519 1647524) (-933 "RATRET.spad" 1644801 1644811 1645430 1645435) (-932 "RATFACT.spad" 1644494 1644505 1644791 1644796) (-931 "RANDSRC.spad" 1643814 1643822 1644484 1644489) (-930 "RADUTIL.spad" 1643569 1643577 1643804 1643809) (-929 "RADIX.spad" 1640362 1640375 1642039 1642132) (-928 "RADFF.spad" 1638779 1638815 1638897 1639053) (-927 "RADCAT.spad" 1638373 1638381 1638769 1638774) (-926 "RADCAT.spad" 1637965 1637975 1638363 1638368) (-925 "QUEUE.spad" 1637308 1637318 1637572 1637599) (-924 "QUAT.spad" 1635894 1635904 1636236 1636301) (-923 "QUATCT2.spad" 1635513 1635531 1635884 1635889) (-922 "QUATCAT.spad" 1633678 1633688 1635443 1635508) (-921 "QUATCAT.spad" 1631595 1631607 1633362 1633367) (-920 "QUAGG.spad" 1630409 1630419 1631551 1631590) (-919 "QFORM.spad" 1629872 1629886 1630399 1630404) (-918 "QFCAT.spad" 1628563 1628573 1629762 1629867) (-917 "QFCAT.spad" 1626860 1626872 1628061 1628066) (-916 "QFCAT2.spad" 1626551 1626567 1626850 1626855) (-915 "QEQUAT.spad" 1626108 1626116 1626541 1626546) (-914 "QCMPACK.spad" 1620855 1620874 1626098 1626103) (-913 "QALGSET.spad" 1616930 1616962 1620769 1620774) (-912 "QALGSET2.spad" 1614926 1614944 1616920 1616925) (-911 "PWFFINTB.spad" 1612236 1612257 1614916 1614921) (-910 "PUSHVAR.spad" 1611565 1611584 1612226 1612231) (-909 "PTRANFN.spad" 1607691 1607701 1611555 1611560) (-908 "PTPACK.spad" 1604779 1604789 1607681 1607686) (-907 "PTFUNC2.spad" 1604600 1604614 1604769 1604774) (-906 "PTCAT.spad" 1603682 1603692 1604556 1604595) (-905 "PSQFR.spad" 1602989 1603013 1603672 1603677) (-904 "PSEUDLIN.spad" 1601847 1601857 1602979 1602984) (-903 "PSETPK.spad" 1587280 1587296 1601725 1601730) (-902 "PSETCAT.spad" 1581188 1581211 1587248 1587275) (-901 "PSETCAT.spad" 1575082 1575107 1581144 1581149) (-900 "PSCURVE.spad" 1574065 1574073 1575072 1575077) (-899 "PSCAT.spad" 1572832 1572861 1573963 1574060) (-898 "PSCAT.spad" 1571689 1571720 1572822 1572827) (-897 "PRTITION.spad" 1570532 1570540 1571679 1571684) (-896 "PRS.spad" 1560094 1560111 1570488 1570493) (-895 "PRQAGG.spad" 1559513 1559523 1560050 1560089) (-894 "PROPLOG.spad" 1558916 1558924 1559503 1559508) (-893 "PROPFRML.spad" 1556781 1556792 1558852 1558857) (-892 "PRODUCT.spad" 1554461 1554473 1554747 1554802) (-891 "PR.spad" 1552850 1552862 1553555 1553682) (-890 "PRINT.spad" 1552602 1552610 1552840 1552845) (-889 "PRIMES.spad" 1550853 1550863 1552592 1552597) (-888 "PRIMELT.spad" 1548834 1548848 1550843 1550848) (-887 "PRIMCAT.spad" 1548457 1548465 1548824 1548829) (-886 "PRIMARR.spad" 1547462 1547472 1547640 1547667) (-885 "PRIMARR2.spad" 1546185 1546197 1547452 1547457) (-884 "PREASSOC.spad" 1545557 1545569 1546175 1546180) (-883 "PPCURVE.spad" 1544694 1544702 1545547 1545552) (-882 "POLYROOT.spad" 1543466 1543488 1544650 1544655) (-881 "POLY.spad" 1540766 1540776 1541283 1541410) (-880 "POLYLIFT.spad" 1540027 1540050 1540756 1540761) (-879 "POLYCATQ.spad" 1538129 1538151 1540017 1540022) (-878 "POLYCAT.spad" 1531535 1531556 1537997 1538124) (-877 "POLYCAT.spad" 1524243 1524266 1530707 1530712) (-876 "POLY2UP.spad" 1523691 1523705 1524233 1524238) (-875 "POLY2.spad" 1523286 1523298 1523681 1523686) (-874 "POLUTIL.spad" 1522227 1522256 1523242 1523247) (-873 "POLTOPOL.spad" 1520975 1520990 1522217 1522222) (-872 "POINT.spad" 1519816 1519826 1519903 1519930) (-871 "PNTHEORY.spad" 1516482 1516490 1519806 1519811) (-870 "PMTOOLS.spad" 1515239 1515253 1516472 1516477) (-869 "PMSYM.spad" 1514784 1514794 1515229 1515234) (-868 "PMQFCAT.spad" 1514371 1514385 1514774 1514779) (-867 "PMPRED.spad" 1513840 1513854 1514361 1514366) (-866 "PMPREDFS.spad" 1513284 1513306 1513830 1513835) (-865 "PMPLCAT.spad" 1512354 1512372 1513216 1513221) (-864 "PMLSAGG.spad" 1511935 1511949 1512344 1512349) (-863 "PMKERNEL.spad" 1511502 1511514 1511925 1511930) (-862 "PMINS.spad" 1511078 1511088 1511492 1511497) (-861 "PMFS.spad" 1510651 1510669 1511068 1511073) (-860 "PMDOWN.spad" 1509937 1509951 1510641 1510646) (-859 "PMASS.spad" 1508949 1508957 1509927 1509932) (-858 "PMASSFS.spad" 1507918 1507934 1508939 1508944) (-857 "PLOTTOOL.spad" 1507698 1507706 1507908 1507913) (-856 "PLOT.spad" 1502529 1502537 1507688 1507693) (-855 "PLOT3D.spad" 1498949 1498957 1502519 1502524) (-854 "PLOT1.spad" 1498090 1498100 1498939 1498944) (-853 "PLEQN.spad" 1485306 1485333 1498080 1498085) (-852 "PINTERP.spad" 1484922 1484941 1485296 1485301) (-851 "PINTERPA.spad" 1484704 1484720 1484912 1484917) (-850 "PI.spad" 1484311 1484319 1484678 1484699) (-849 "PID.spad" 1483267 1483275 1484237 1484306) (-848 "PICOERCE.spad" 1482924 1482934 1483257 1483262) (-847 "PGROEB.spad" 1481521 1481535 1482914 1482919) (-846 "PGE.spad" 1472774 1472782 1481511 1481516) (-845 "PGCD.spad" 1471656 1471673 1472764 1472769) (-844 "PFRPAC.spad" 1470799 1470809 1471646 1471651) (-843 "PFR.spad" 1467456 1467466 1470701 1470794) (-842 "PFOTOOLS.spad" 1466714 1466730 1467446 1467451) (-841 "PFOQ.spad" 1466084 1466102 1466704 1466709) (-840 "PFO.spad" 1465503 1465530 1466074 1466079) (-839 "PF.spad" 1465077 1465089 1465308 1465401) (-838 "PFECAT.spad" 1462743 1462751 1465003 1465072) (-837 "PFECAT.spad" 1460437 1460447 1462699 1462704) (-836 "PFBRU.spad" 1458307 1458319 1460427 1460432) (-835 "PFBR.spad" 1455845 1455868 1458297 1458302) (-834 "PERM.spad" 1451526 1451536 1455675 1455690) (-833 "PERMGRP.spad" 1446262 1446272 1451516 1451521) (-832 "PERMCAT.spad" 1444814 1444824 1446242 1446257) (-831 "PERMAN.spad" 1443346 1443360 1444804 1444809) (-830 "PENDTREE.spad" 1442619 1442629 1442975 1442980) (-829 "PDRING.spad" 1441110 1441120 1442599 1442614) (-828 "PDRING.spad" 1439609 1439621 1441100 1441105) (-827 "PDEPROB.spad" 1438566 1438574 1439599 1439604) (-826 "PDEPACK.spad" 1432568 1432576 1438556 1438561) (-825 "PDECOMP.spad" 1432030 1432047 1432558 1432563) (-824 "PDECAT.spad" 1430384 1430392 1432020 1432025) (-823 "PCOMP.spad" 1430235 1430248 1430374 1430379) (-822 "PBWLB.spad" 1428817 1428834 1430225 1430230) (-821 "PATTERN.spad" 1423248 1423258 1428807 1428812) (-820 "PATTERN2.spad" 1422984 1422996 1423238 1423243) (-819 "PATTERN1.spad" 1421286 1421302 1422974 1422979) (-818 "PATRES.spad" 1418833 1418845 1421276 1421281) (-817 "PATRES2.spad" 1418495 1418509 1418823 1418828) (-816 "PATMATCH.spad" 1416657 1416688 1418208 1418213) (-815 "PATMAB.spad" 1416082 1416092 1416647 1416652) (-814 "PATLRES.spad" 1415166 1415180 1416072 1416077) (-813 "PATAB.spad" 1414930 1414940 1415156 1415161) (-812 "PARTPERM.spad" 1412292 1412300 1414920 1414925) (-811 "PARSURF.spad" 1411720 1411748 1412282 1412287) (-810 "PARSU2.spad" 1411515 1411531 1411710 1411715) (-809 "script-parser.spad" 1411035 1411043 1411505 1411510) (-808 "PARSCURV.spad" 1410463 1410491 1411025 1411030) (-807 "PARSC2.spad" 1410252 1410268 1410453 1410458) (-806 "PARPCURV.spad" 1409710 1409738 1410242 1410247) (-805 "PARPC2.spad" 1409499 1409515 1409700 1409705) (-804 "PAN2EXPR.spad" 1408911 1408919 1409489 1409494) (-803 "PALETTE.spad" 1407881 1407889 1408901 1408906) (-802 "PAIR.spad" 1406864 1406877 1407469 1407474) (-801 "PADICRC.spad" 1404197 1404215 1405372 1405465) (-800 "PADICRAT.spad" 1402215 1402227 1402436 1402529) (-799 "PADIC.spad" 1401910 1401922 1402141 1402210) (-798 "PADICCT.spad" 1400451 1400463 1401836 1401905) (-797 "PADEPAC.spad" 1399130 1399149 1400441 1400446) (-796 "PADE.spad" 1397870 1397886 1399120 1399125) (-795 "OWP.spad" 1396854 1396884 1397728 1397795) (-794 "OVAR.spad" 1396635 1396658 1396844 1396849) (-793 "OUT.spad" 1395719 1395727 1396625 1396630) (-792 "OUTFORM.spad" 1385133 1385141 1395709 1395714) (-791 "OSI.spad" 1384608 1384616 1385123 1385128) (-790 "ORTHPOL.spad" 1383069 1383079 1384525 1384530) (-789 "OREUP.spad" 1382429 1382457 1382751 1382790) (-788 "ORESUP.spad" 1381730 1381754 1382111 1382150) (-787 "OREPCTO.spad" 1379549 1379561 1381650 1381655) (-786 "OREPCAT.spad" 1373606 1373616 1379505 1379544) (-785 "OREPCAT.spad" 1367553 1367565 1373454 1373459) (-784 "ORDSET.spad" 1366719 1366727 1367543 1367548) (-783 "ORDSET.spad" 1365883 1365893 1366709 1366714) (-782 "ORDRING.spad" 1365273 1365281 1365863 1365878) (-781 "ORDRING.spad" 1364671 1364681 1365263 1365268) (-780 "ORDMON.spad" 1364526 1364534 1364661 1364666) (-779 "ORDFUNS.spad" 1363652 1363668 1364516 1364521) (-778 "ORDFIN.spad" 1363586 1363594 1363642 1363647) (-777 "ORDCOMP.spad" 1362054 1362064 1363136 1363165) (-776 "ORDCOMP2.spad" 1361339 1361351 1362044 1362049) (-775 "OPTPROB.spad" 1359919 1359927 1361329 1361334) (-774 "OPTPACK.spad" 1352304 1352312 1359909 1359914) (-773 "OPTCAT.spad" 1349979 1349987 1352294 1352299) (-772 "OPQUERY.spad" 1349528 1349536 1349969 1349974) (-771 "OP.spad" 1349270 1349280 1349350 1349417) (-770 "ONECOMP.spad" 1348018 1348028 1348820 1348849) (-769 "ONECOMP2.spad" 1347436 1347448 1348008 1348013) (-768 "OMSERVER.spad" 1346438 1346446 1347426 1347431) (-767 "OMSAGG.spad" 1346214 1346224 1346382 1346433) (-766 "OMPKG.spad" 1344826 1344834 1346204 1346209) (-765 "OM.spad" 1343791 1343799 1344816 1344821) (-764 "OMLO.spad" 1343216 1343228 1343677 1343716) (-763 "OMEXPR.spad" 1343050 1343060 1343206 1343211) (-762 "OMERR.spad" 1342593 1342601 1343040 1343045) (-761 "OMERRK.spad" 1341627 1341635 1342583 1342588) (-760 "OMENC.spad" 1340971 1340979 1341617 1341622) (-759 "OMDEV.spad" 1335260 1335268 1340961 1340966) (-758 "OMCONN.spad" 1334669 1334677 1335250 1335255) (-757 "OINTDOM.spad" 1334432 1334440 1334595 1334664) (-756 "OFMONOID.spad" 1330619 1330629 1334422 1334427) (-755 "ODVAR.spad" 1329880 1329890 1330609 1330614) (-754 "ODR.spad" 1329328 1329354 1329692 1329841) (-753 "ODPOL.spad" 1326677 1326687 1327017 1327144) (-752 "ODP.spad" 1318203 1318223 1318576 1318705) (-751 "ODETOOLS.spad" 1316786 1316805 1318193 1318198) (-750 "ODESYS.spad" 1314436 1314453 1316776 1316781) (-749 "ODERTRIC.spad" 1310377 1310394 1314393 1314398) (-748 "ODERED.spad" 1309764 1309788 1310367 1310372) (-747 "ODERAT.spad" 1307315 1307332 1309754 1309759) (-746 "ODEPRRIC.spad" 1304206 1304228 1307305 1307310) (-745 "ODEPROB.spad" 1303405 1303413 1304196 1304201) (-744 "ODEPRIM.spad" 1300679 1300701 1303395 1303400) (-743 "ODEPAL.spad" 1300055 1300079 1300669 1300674) (-742 "ODEPACK.spad" 1286657 1286665 1300045 1300050) (-741 "ODEINT.spad" 1286088 1286104 1286647 1286652) (-740 "ODEIFTBL.spad" 1283483 1283491 1286078 1286083) (-739 "ODEEF.spad" 1278850 1278866 1283473 1283478) (-738 "ODECONST.spad" 1278369 1278387 1278840 1278845) (-737 "ODECAT.spad" 1276965 1276973 1278359 1278364) (-736 "OCT.spad" 1275112 1275122 1275828 1275867) (-735 "OCTCT2.spad" 1274756 1274777 1275102 1275107) (-734 "OC.spad" 1272530 1272540 1274712 1274751) (-733 "OC.spad" 1270030 1270042 1272214 1272219) (-732 "OCAMON.spad" 1269878 1269886 1270020 1270025) (-731 "OBJPROP.spad" 1269366 1269374 1269868 1269873) (-730 "OASGP.spad" 1269181 1269189 1269356 1269361) (-729 "OAMONS.spad" 1268701 1268709 1269171 1269176) (-728 "OAMON.spad" 1268562 1268570 1268691 1268696) (-727 "OAGROUP.spad" 1268424 1268432 1268552 1268557) (-726 "NUMTUBE.spad" 1268011 1268027 1268414 1268419) (-725 "NUMQUAD.spad" 1255873 1255881 1268001 1268006) (-724 "NUMODE.spad" 1247009 1247017 1255863 1255868) (-723 "NUMINT.spad" 1244567 1244575 1246999 1247004) (-722 "NUMFMT.spad" 1243407 1243415 1244557 1244562) (-721 "NUMERIC.spad" 1235480 1235490 1243213 1243218) (-720 "NTSCAT.spad" 1233970 1233986 1235436 1235475) (-719 "NTPOLFN.spad" 1233515 1233525 1233887 1233892) (-718 "NSUP.spad" 1226533 1226543 1231073 1231226) (-717 "NSUP2.spad" 1225925 1225937 1226523 1226528) (-716 "NSMP.spad" 1222124 1222143 1222432 1222559) (-715 "NREP.spad" 1220496 1220510 1222114 1222119) (-714 "NPCOEF.spad" 1219742 1219762 1220486 1220491) (-713 "NORMRETR.spad" 1219340 1219379 1219732 1219737) (-712 "NORMPK.spad" 1217242 1217261 1219330 1219335) (-711 "NORMMA.spad" 1216930 1216956 1217232 1217237) (-710 "NONE.spad" 1216671 1216679 1216920 1216925) (-709 "NONE1.spad" 1216347 1216357 1216661 1216666) (-708 "NODE1.spad" 1215816 1215832 1216337 1216342) (-707 "NNI.spad" 1214703 1214711 1215790 1215811) (-706 "NLINSOL.spad" 1213325 1213335 1214693 1214698) (-705 "NIPROB.spad" 1211808 1211816 1213315 1213320) (-704 "NFINTBAS.spad" 1209268 1209285 1211798 1211803) (-703 "NCODIV.spad" 1207466 1207482 1209258 1209263) (-702 "NCNTFRAC.spad" 1207108 1207122 1207456 1207461) (-701 "NCEP.spad" 1205268 1205282 1207098 1207103) (-700 "NASRING.spad" 1204864 1204872 1205258 1205263) (-699 "NASRING.spad" 1204458 1204468 1204854 1204859) (-698 "NARNG.spad" 1203802 1203810 1204448 1204453) (-697 "NARNG.spad" 1203144 1203154 1203792 1203797) (-696 "NAGSP.spad" 1202217 1202225 1203134 1203139) (-695 "NAGS.spad" 1191742 1191750 1202207 1202212) (-694 "NAGF07.spad" 1190135 1190143 1191732 1191737) (-693 "NAGF04.spad" 1184367 1184375 1190125 1190130) (-692 "NAGF02.spad" 1178176 1178184 1184357 1184362) (-691 "NAGF01.spad" 1173779 1173787 1178166 1178171) (-690 "NAGE04.spad" 1167239 1167247 1173769 1173774) (-689 "NAGE02.spad" 1157581 1157589 1167229 1167234) (-688 "NAGE01.spad" 1153465 1153473 1157571 1157576) (-687 "NAGD03.spad" 1151385 1151393 1153455 1153460) (-686 "NAGD02.spad" 1143916 1143924 1151375 1151380) (-685 "NAGD01.spad" 1138029 1138037 1143906 1143911) (-684 "NAGC06.spad" 1133816 1133824 1138019 1138024) (-683 "NAGC05.spad" 1132285 1132293 1133806 1133811) (-682 "NAGC02.spad" 1131540 1131548 1132275 1132280) (-681 "NAALG.spad" 1131075 1131085 1131508 1131535) (-680 "NAALG.spad" 1130630 1130642 1131065 1131070) (-679 "MULTSQFR.spad" 1127588 1127605 1130620 1130625) (-678 "MULTFACT.spad" 1126971 1126988 1127578 1127583) (-677 "MTSCAT.spad" 1125005 1125026 1126869 1126966) (-676 "MTHING.spad" 1124662 1124672 1124995 1125000) (-675 "MSYSCMD.spad" 1124096 1124104 1124652 1124657) (-674 "MSET.spad" 1122038 1122048 1123802 1123841) (-673 "MSETAGG.spad" 1121871 1121881 1121994 1122033) (-672 "MRING.spad" 1118842 1118854 1121579 1121646) (-671 "MRF2.spad" 1118410 1118424 1118832 1118837) (-670 "MRATFAC.spad" 1117956 1117973 1118400 1118405) (-669 "MPRFF.spad" 1115986 1116005 1117946 1117951) (-668 "MPOLY.spad" 1113424 1113439 1113783 1113910) (-667 "MPCPF.spad" 1112688 1112707 1113414 1113419) (-666 "MPC3.spad" 1112503 1112543 1112678 1112683) (-665 "MPC2.spad" 1112145 1112178 1112493 1112498) (-664 "MONOTOOL.spad" 1110480 1110497 1112135 1112140) (-663 "MONOID.spad" 1109654 1109662 1110470 1110475) (-662 "MONOID.spad" 1108826 1108836 1109644 1109649) (-661 "MONOGEN.spad" 1107572 1107585 1108686 1108821) (-660 "MONOGEN.spad" 1106340 1106355 1107456 1107461) (-659 "MONADWU.spad" 1104354 1104362 1106330 1106335) (-658 "MONADWU.spad" 1102366 1102376 1104344 1104349) (-657 "MONAD.spad" 1101510 1101518 1102356 1102361) (-656 "MONAD.spad" 1100652 1100662 1101500 1101505) (-655 "MOEBIUS.spad" 1099338 1099352 1100632 1100647) (-654 "MODULE.spad" 1099208 1099218 1099306 1099333) (-653 "MODULE.spad" 1099098 1099110 1099198 1099203) (-652 "MODRING.spad" 1098429 1098468 1099078 1099093) (-651 "MODOP.spad" 1097088 1097100 1098251 1098318) (-650 "MODMONOM.spad" 1096620 1096638 1097078 1097083) (-649 "MODMON.spad" 1093330 1093346 1094106 1094259) (-648 "MODFIELD.spad" 1092688 1092727 1093232 1093325) (-647 "MMAP.spad" 1092428 1092462 1092678 1092683) (-646 "MLO.spad" 1090855 1090865 1092384 1092423) (-645 "MLIFT.spad" 1089427 1089444 1090845 1090850) (-644 "MKUCFUNC.spad" 1088960 1088978 1089417 1089422) (-643 "MKRECORD.spad" 1088562 1088575 1088950 1088955) (-642 "MKFUNC.spad" 1087943 1087953 1088552 1088557) (-641 "MKFLCFN.spad" 1086899 1086909 1087933 1087938) (-640 "MKCHSET.spad" 1086675 1086685 1086889 1086894) (-639 "MKBCFUNC.spad" 1086160 1086178 1086665 1086670) (-638 "MINT.spad" 1085599 1085607 1086062 1086155) (-637 "MHROWRED.spad" 1084100 1084110 1085589 1085594) (-636 "MFLOAT.spad" 1082545 1082553 1083990 1084095) (-635 "MFINFACT.spad" 1081945 1081967 1082535 1082540) (-634 "MESH.spad" 1079677 1079685 1081935 1081940) (-633 "MDDFACT.spad" 1077870 1077880 1079667 1079672) (-632 "MDAGG.spad" 1077145 1077155 1077838 1077865) (-631 "MCMPLX.spad" 1073125 1073133 1073739 1073940) (-630 "MCDEN.spad" 1072333 1072345 1073115 1073120) (-629 "MCALCFN.spad" 1069435 1069461 1072323 1072328) (-628 "MATSTOR.spad" 1066711 1066721 1069425 1069430) (-627 "MATRIX.spad" 1065415 1065425 1065899 1065926) (-626 "MATLIN.spad" 1062741 1062765 1065299 1065304) (-625 "MATCAT.spad" 1054314 1054336 1062697 1062736) (-624 "MATCAT.spad" 1045771 1045795 1054156 1054161) (-623 "MATCAT2.spad" 1045039 1045087 1045761 1045766) (-622 "MAPPKG3.spad" 1043938 1043952 1045029 1045034) (-621 "MAPPKG2.spad" 1043272 1043284 1043928 1043933) (-620 "MAPPKG1.spad" 1042090 1042100 1043262 1043267) (-619 "MAPHACK3.spad" 1041898 1041912 1042080 1042085) (-618 "MAPHACK2.spad" 1041663 1041675 1041888 1041893) (-617 "MAPHACK1.spad" 1041293 1041303 1041653 1041658) (-616 "MAGMA.spad" 1039083 1039100 1041283 1041288) (-615 "M3D.spad" 1036781 1036791 1038463 1038468) (-614 "LZSTAGG.spad" 1033999 1034009 1036761 1036776) (-613 "LZSTAGG.spad" 1031225 1031237 1033989 1033994) (-612 "LWORD.spad" 1027930 1027947 1031215 1031220) (-611 "LSQM.spad" 1026158 1026172 1026556 1026607) (-610 "LSPP.spad" 1025691 1025708 1026148 1026153) (-609 "LSMP.spad" 1024531 1024559 1025681 1025686) (-608 "LSMP1.spad" 1022335 1022349 1024521 1024526) (-607 "LSAGG.spad" 1021992 1022002 1022291 1022330) (-606 "LSAGG.spad" 1021681 1021693 1021982 1021987) (-605 "LPOLY.spad" 1020635 1020654 1021537 1021606) (-604 "LPEFRAC.spad" 1019892 1019902 1020625 1020630) (-603 "LO.spad" 1019293 1019307 1019826 1019853) (-602 "LOGIC.spad" 1018895 1018903 1019283 1019288) (-601 "LOGIC.spad" 1018495 1018505 1018885 1018890) (-600 "LODOOPS.spad" 1017413 1017425 1018485 1018490) (-599 "LODO.spad" 1016799 1016815 1017095 1017134) (-598 "LODOF.spad" 1015843 1015860 1016756 1016761) (-597 "LODOCAT.spad" 1014501 1014511 1015799 1015838) (-596 "LODOCAT.spad" 1013157 1013169 1014457 1014462) (-595 "LODO2.spad" 1012432 1012444 1012839 1012878) (-594 "LODO1.spad" 1011834 1011844 1012114 1012153) (-593 "LODEEF.spad" 1010606 1010624 1011824 1011829) (-592 "LNAGG.spad" 1006398 1006408 1010586 1010601) (-591 "LNAGG.spad" 1002164 1002176 1006354 1006359) (-590 "LMOPS.spad" 998900 998917 1002154 1002159) (-589 "LMODULE.spad" 998542 998552 998890 998895) (-588 "LMDICT.spad" 997825 997835 998093 998120) (-587 "LIST.spad" 995543 995553 996972 996999) (-586 "LIST3.spad" 994834 994848 995533 995538) (-585 "LIST2.spad" 993474 993486 994824 994829) (-584 "LIST2MAP.spad" 990351 990363 993464 993469) (-583 "LINEXP.spad" 989783 989793 990331 990346) (-582 "LINDEP.spad" 988560 988572 989695 989700) (-581 "LIMITRF.spad" 986474 986484 988550 988555) (-580 "LIMITPS.spad" 985357 985370 986464 986469) (-579 "LIE.spad" 983371 983383 984647 984792) (-578 "LIECAT.spad" 982847 982857 983297 983366) (-577 "LIECAT.spad" 982351 982363 982803 982808) (-576 "LIB.spad" 980399 980407 981010 981025) (-575 "LGROBP.spad" 977752 977771 980389 980394) (-574 "LF.spad" 976671 976687 977742 977747) (-573 "LFCAT.spad" 975690 975698 976661 976666) (-572 "LEXTRIPK.spad" 971193 971208 975680 975685) (-571 "LEXP.spad" 969196 969223 971173 971188) (-570 "LEADCDET.spad" 967580 967597 969186 969191) (-569 "LAZM3PK.spad" 966284 966306 967570 967575) (-568 "LAUPOL.spad" 964975 964988 965879 965948) (-567 "LAPLACE.spad" 964548 964564 964965 964970) (-566 "LA.spad" 963988 964002 964470 964509) (-565 "LALG.spad" 963764 963774 963968 963983) (-564 "LALG.spad" 963548 963560 963754 963759) (-563 "KOVACIC.spad" 962261 962278 963538 963543) (-562 "KONVERT.spad" 961983 961993 962251 962256) (-561 "KOERCE.spad" 961720 961730 961973 961978) (-560 "KERNEL.spad" 960255 960265 961504 961509) (-559 "KERNEL2.spad" 959958 959970 960245 960250) (-558 "KDAGG.spad" 959049 959071 959926 959953) (-557 "KDAGG.spad" 958160 958184 959039 959044) (-556 "KAFILE.spad" 957123 957139 957358 957385) (-555 "JORDAN.spad" 954950 954962 956413 956558) (-554 "IXAGG.spad" 953063 953087 954930 954945) (-553 "IXAGG.spad" 951041 951067 952910 952915) (-552 "IVECTOR.spad" 949814 949829 949969 949996) (-551 "ITUPLE.spad" 948959 948969 949804 949809) (-550 "ITRIGMNP.spad" 947770 947789 948949 948954) (-549 "ITFUN3.spad" 947264 947278 947760 947765) (-548 "ITFUN2.spad" 946994 947006 947254 947259) (-547 "ITAYLOR.spad" 944786 944801 946830 946955) (-546 "ISUPS.spad" 937197 937212 943760 943857) (-545 "ISUMP.spad" 936694 936710 937187 937192) (-544 "ISTRING.spad" 935697 935710 935863 935890) (-543 "IRURPK.spad" 934410 934429 935687 935692) (-542 "IRSN.spad" 932370 932378 934400 934405) (-541 "IRRF2F.spad" 930845 930855 932326 932331) (-540 "IRREDFFX.spad" 930446 930457 930835 930840) (-539 "IROOT.spad" 928777 928787 930436 930441) (-538 "IR.spad" 926567 926581 928633 928660) (-537 "IR2.spad" 925587 925603 926557 926562) (-536 "IR2F.spad" 924787 924803 925577 925582) (-535 "IPRNTPK.spad" 924547 924555 924777 924782) (-534 "IPF.spad" 924112 924124 924352 924445) (-533 "IPADIC.spad" 923873 923899 924038 924107) (-532 "INVLAPLA.spad" 923518 923534 923863 923868) (-531 "INTTR.spad" 916764 916781 923508 923513) (-530 "INTTOOLS.spad" 914476 914492 916339 916344) (-529 "INTSLPE.spad" 913782 913790 914466 914471) (-528 "INTRVL.spad" 913348 913358 913696 913777) (-527 "INTRF.spad" 911712 911726 913338 913343) (-526 "INTRET.spad" 911144 911154 911702 911707) (-525 "INTRAT.spad" 909819 909836 911134 911139) (-524 "INTPM.spad" 908182 908198 909462 909467) (-523 "INTPAF.spad" 905950 905968 908114 908119) (-522 "INTPACK.spad" 896260 896268 905940 905945) (-521 "INT.spad" 895621 895629 896114 896255) (-520 "INTHERTR.spad" 894887 894904 895611 895616) (-519 "INTHERAL.spad" 894553 894577 894877 894882) (-518 "INTHEORY.spad" 890966 890974 894543 894548) (-517 "INTG0.spad" 884429 884447 890898 890903) (-516 "INTFTBL.spad" 878458 878466 884419 884424) (-515 "INTFACT.spad" 877517 877527 878448 878453) (-514 "INTEF.spad" 875832 875848 877507 877512) (-513 "INTDOM.spad" 874447 874455 875758 875827) (-512 "INTDOM.spad" 873124 873134 874437 874442) (-511 "INTCAT.spad" 871377 871387 873038 873119) (-510 "INTBIT.spad" 870880 870888 871367 871372) (-509 "INTALG.spad" 870062 870089 870870 870875) (-508 "INTAF.spad" 869554 869570 870052 870057) (-507 "INTABL.spad" 868072 868103 868235 868262) (-506 "INS.spad" 865468 865476 867974 868067) (-505 "INS.spad" 862950 862960 865458 865463) (-504 "INPSIGN.spad" 862384 862397 862940 862945) (-503 "INPRODPF.spad" 861450 861469 862374 862379) (-502 "INPRODFF.spad" 860508 860532 861440 861445) (-501 "INNMFACT.spad" 859479 859496 860498 860503) (-500 "INMODGCD.spad" 858963 858993 859469 859474) (-499 "INFSP.spad" 857248 857270 858953 858958) (-498 "INFPROD0.spad" 856298 856317 857238 857243) (-497 "INFORM.spad" 853566 853574 856288 856293) (-496 "INFORM1.spad" 853191 853201 853556 853561) (-495 "INFINITY.spad" 852743 852751 853181 853186) (-494 "INEP.spad" 851275 851297 852733 852738) (-493 "INDE.spad" 851181 851198 851265 851270) (-492 "INCRMAPS.spad" 850602 850612 851171 851176) (-491 "INBFF.spad" 846372 846383 850592 850597) (-490 "IMATRIX.spad" 845317 845343 845829 845856) (-489 "IMATQF.spad" 844411 844455 845273 845278) (-488 "IMATLIN.spad" 843016 843040 844367 844372) (-487 "ILIST.spad" 841672 841687 842199 842226) (-486 "IIARRAY2.spad" 841060 841098 841279 841306) (-485 "IFF.spad" 840470 840486 840741 840834) (-484 "IFARRAY.spad" 837957 837972 839653 839680) (-483 "IFAMON.spad" 837819 837836 837913 837918) (-482 "IEVALAB.spad" 837208 837220 837809 837814) (-481 "IEVALAB.spad" 836595 836609 837198 837203) (-480 "IDPO.spad" 836393 836405 836585 836590) (-479 "IDPOAMS.spad" 836149 836161 836383 836388) (-478 "IDPOAM.spad" 835869 835881 836139 836144) (-477 "IDPC.spad" 834803 834815 835859 835864) (-476 "IDPAM.spad" 834548 834560 834793 834798) (-475 "IDPAG.spad" 834295 834307 834538 834543) (-474 "IDECOMP.spad" 831532 831550 834285 834290) (-473 "IDEAL.spad" 826455 826494 831467 831472) (-472 "ICDEN.spad" 825606 825622 826445 826450) (-471 "ICARD.spad" 824795 824803 825596 825601) (-470 "IBPTOOLS.spad" 823388 823405 824785 824790) (-469 "IBITS.spad" 822587 822600 823024 823051) (-468 "IBATOOL.spad" 819462 819481 822577 822582) (-467 "IBACHIN.spad" 817949 817964 819452 819457) (-466 "IARRAY2.spad" 816937 816963 817556 817583) (-465 "IARRAY1.spad" 815982 815997 816120 816147) (-464 "IAN.spad" 814197 814205 815800 815893) (-463 "IALGFACT.spad" 813798 813831 814187 814192) (-462 "HYPCAT.spad" 813222 813230 813788 813793) (-461 "HYPCAT.spad" 812644 812654 813212 813217) (-460 "HOAGG.spad" 809902 809912 812624 812639) (-459 "HOAGG.spad" 806945 806957 809669 809674) (-458 "HEXADEC.spad" 804817 804825 805415 805508) (-457 "HEUGCD.spad" 803832 803843 804807 804812) (-456 "HELLFDIV.spad" 803422 803446 803822 803827) (-455 "HEAP.spad" 802814 802824 803029 803056) (-454 "HDP.spad" 794336 794352 794713 794842) (-453 "HDMP.spad" 791515 791530 792133 792260) (-452 "HB.spad" 789752 789760 791505 791510) (-451 "HASHTBL.spad" 788222 788253 788433 788460) (-450 "HACKPI.spad" 787705 787713 788124 788217) (-449 "GTSET.spad" 786644 786660 787351 787378) (-448 "GSTBL.spad" 785163 785198 785337 785352) (-447 "GSERIES.spad" 782330 782357 783295 783444) (-446 "GROUP.spad" 781504 781512 782310 782325) (-445 "GROUP.spad" 780686 780696 781494 781499) (-444 "GROEBSOL.spad" 779174 779195 780676 780681) (-443 "GRMOD.spad" 777745 777757 779164 779169) (-442 "GRMOD.spad" 776314 776328 777735 777740) (-441 "GRIMAGE.spad" 768919 768927 776304 776309) (-440 "GRDEF.spad" 767298 767306 768909 768914) (-439 "GRAY.spad" 765757 765765 767288 767293) (-438 "GRALG.spad" 764804 764816 765747 765752) (-437 "GRALG.spad" 763849 763863 764794 764799) (-436 "GPOLSET.spad" 763303 763326 763531 763558) (-435 "GOSPER.spad" 762568 762586 763293 763298) (-434 "GMODPOL.spad" 761706 761733 762536 762563) (-433 "GHENSEL.spad" 760775 760789 761696 761701) (-432 "GENUPS.spad" 756876 756889 760765 760770) (-431 "GENUFACT.spad" 756453 756463 756866 756871) (-430 "GENPGCD.spad" 756037 756054 756443 756448) (-429 "GENMFACT.spad" 755489 755508 756027 756032) (-428 "GENEEZ.spad" 753428 753441 755479 755484) (-427 "GDMP.spad" 750449 750466 751225 751352) (-426 "GCNAALG.spad" 744344 744371 750243 750310) (-425 "GCDDOM.spad" 743516 743524 744270 744339) (-424 "GCDDOM.spad" 742750 742760 743506 743511) (-423 "GB.spad" 740268 740306 742706 742711) (-422 "GBINTERN.spad" 736288 736326 740258 740263) (-421 "GBF.spad" 732045 732083 736278 736283) (-420 "GBEUCLID.spad" 729919 729957 732035 732040) (-419 "GAUSSFAC.spad" 729216 729224 729909 729914) (-418 "GALUTIL.spad" 727538 727548 729172 729177) (-417 "GALPOLYU.spad" 725984 725997 727528 727533) (-416 "GALFACTU.spad" 724149 724168 725974 725979) (-415 "GALFACT.spad" 714282 714293 724139 724144) (-414 "FVFUN.spad" 711295 711303 714262 714277) (-413 "FVC.spad" 710337 710345 711275 711290) (-412 "FUNCTION.spad" 710186 710198 710327 710332) (-411 "FT.spad" 708398 708406 710176 710181) (-410 "FTEM.spad" 707561 707569 708388 708393) (-409 "FSUPFACT.spad" 706462 706481 707498 707503) (-408 "FST.spad" 704548 704556 706452 706457) (-407 "FSRED.spad" 704026 704042 704538 704543) (-406 "FSPRMELT.spad" 702850 702866 703983 703988) (-405 "FSPECF.spad" 700927 700943 702840 702845) (-404 "FS.spad" 694978 694988 700691 700922) (-403 "FS.spad" 688820 688832 694535 694540) (-402 "FSINT.spad" 688478 688494 688810 688815) (-401 "FSERIES.spad" 687665 687677 688298 688397) (-400 "FSCINT.spad" 686978 686994 687655 687660) (-399 "FSAGG.spad" 686083 686093 686922 686973) (-398 "FSAGG.spad" 685162 685174 686003 686008) (-397 "FSAGG2.spad" 683861 683877 685152 685157) (-396 "FS2UPS.spad" 678250 678284 683851 683856) (-395 "FS2.spad" 677895 677911 678240 678245) (-394 "FS2EXPXP.spad" 677018 677041 677885 677890) (-393 "FRUTIL.spad" 675960 675970 677008 677013) (-392 "FR.spad" 669657 669667 674987 675056) (-391 "FRNAALG.spad" 664744 664754 669599 669652) (-390 "FRNAALG.spad" 659843 659855 664700 664705) (-389 "FRNAAF2.spad" 659297 659315 659833 659838) (-388 "FRMOD.spad" 658692 658722 659229 659234) (-387 "FRIDEAL.spad" 657887 657908 658672 658687) (-386 "FRIDEAL2.spad" 657489 657521 657877 657882) (-385 "FRETRCT.spad" 657000 657010 657479 657484) (-384 "FRETRCT.spad" 656379 656391 656860 656865) (-383 "FRAMALG.spad" 654707 654720 656335 656374) (-382 "FRAMALG.spad" 653067 653082 654697 654702) (-381 "FRAC.spad" 650170 650180 650573 650746) (-380 "FRAC2.spad" 649773 649785 650160 650165) (-379 "FR2.spad" 649107 649119 649763 649768) (-378 "FPS.spad" 645916 645924 648997 649102) (-377 "FPS.spad" 642753 642763 645836 645841) (-376 "FPC.spad" 641795 641803 642655 642748) (-375 "FPC.spad" 640923 640933 641785 641790) (-374 "FPATMAB.spad" 640675 640685 640903 640918) (-373 "FPARFRAC.spad" 639148 639165 640665 640670) (-372 "FORTRAN.spad" 637654 637697 639138 639143) (-371 "FORT.spad" 636583 636591 637644 637649) (-370 "FORTFN.spad" 633743 633751 636563 636578) (-369 "FORTCAT.spad" 633417 633425 633723 633738) (-368 "FORMULA.spad" 630755 630763 633407 633412) (-367 "FORMULA1.spad" 630234 630244 630745 630750) (-366 "FORDER.spad" 629925 629949 630224 630229) (-365 "FOP.spad" 629126 629134 629915 629920) (-364 "FNLA.spad" 628550 628572 629094 629121) (-363 "FNCAT.spad" 626878 626886 628540 628545) (-362 "FNAME.spad" 626770 626778 626868 626873) (-361 "FMTC.spad" 626568 626576 626696 626765) (-360 "FMONOID.spad" 623623 623633 626524 626529) (-359 "FM.spad" 623318 623330 623557 623584) (-358 "FMFUN.spad" 620338 620346 623298 623313) (-357 "FMC.spad" 619380 619388 620318 620333) (-356 "FMCAT.spad" 617034 617052 619348 619375) (-355 "FM1.spad" 616391 616403 616968 616995) (-354 "FLOATRP.spad" 614112 614126 616381 616386) (-353 "FLOAT.spad" 607276 607284 613978 614107) (-352 "FLOATCP.spad" 604693 604707 607266 607271) (-351 "FLINEXP.spad" 604405 604415 604673 604688) (-350 "FLINEXP.spad" 604071 604083 604341 604346) (-349 "FLASORT.spad" 603391 603403 604061 604066) (-348 "FLALG.spad" 601037 601056 603317 603386) (-347 "FLAGG.spad" 598043 598053 601005 601032) (-346 "FLAGG.spad" 594962 594974 597926 597931) (-345 "FLAGG2.spad" 593643 593659 594952 594957) (-344 "FINRALG.spad" 591672 591685 593599 593638) (-343 "FINRALG.spad" 589627 589642 591556 591561) (-342 "FINITE.spad" 588779 588787 589617 589622) (-341 "FINAALG.spad" 577760 577770 588721 588774) (-340 "FINAALG.spad" 566753 566765 577716 577721) (-339 "FILE.spad" 566336 566346 566743 566748) (-338 "FILECAT.spad" 564854 564871 566326 566331) (-337 "FIELD.spad" 564260 564268 564756 564849) (-336 "FIELD.spad" 563752 563762 564250 564255) (-335 "FGROUP.spad" 562361 562371 563732 563747) (-334 "FGLMICPK.spad" 561148 561163 562351 562356) (-333 "FFX.spad" 560523 560538 560864 560957) (-332 "FFSLPE.spad" 560012 560033 560513 560518) (-331 "FFPOLY.spad" 551264 551275 560002 560007) (-330 "FFPOLY2.spad" 550324 550341 551254 551259) (-329 "FFP.spad" 549721 549741 550040 550133) (-328 "FF.spad" 549169 549185 549402 549495) (-327 "FFNBX.spad" 547681 547701 548885 548978) (-326 "FFNBP.spad" 546194 546211 547397 547490) (-325 "FFNB.spad" 544659 544680 545875 545968) (-324 "FFINTBAS.spad" 542073 542092 544649 544654) (-323 "FFIELDC.spad" 539648 539656 541975 542068) (-322 "FFIELDC.spad" 537309 537319 539638 539643) (-321 "FFHOM.spad" 536057 536074 537299 537304) (-320 "FFF.spad" 533492 533503 536047 536052) (-319 "FFCGX.spad" 532339 532359 533208 533301) (-318 "FFCGP.spad" 531228 531248 532055 532148) (-317 "FFCG.spad" 530020 530041 530909 531002) (-316 "FFCAT.spad" 522921 522943 529859 530015) (-315 "FFCAT.spad" 515901 515925 522841 522846) (-314 "FFCAT2.spad" 515646 515686 515891 515896) (-313 "FEXPR.spad" 507359 507405 515406 515445) (-312 "FEVALAB.spad" 507065 507075 507349 507354) (-311 "FEVALAB.spad" 506556 506568 506842 506847) (-310 "FDIV.spad" 505998 506022 506546 506551) (-309 "FDIVCAT.spad" 504040 504064 505988 505993) (-308 "FDIVCAT.spad" 502080 502106 504030 504035) (-307 "FDIV2.spad" 501734 501774 502070 502075) (-306 "FCPAK1.spad" 500287 500295 501724 501729) (-305 "FCOMP.spad" 499666 499676 500277 500282) (-304 "FC.spad" 489491 489499 499656 499661) (-303 "FAXF.spad" 482426 482440 489393 489486) (-302 "FAXF.spad" 475413 475429 482382 482387) (-301 "FARRAY.spad" 473559 473569 474596 474623) (-300 "FAMR.spad" 471679 471691 473457 473554) (-299 "FAMR.spad" 469783 469797 471563 471568) (-298 "FAMONOID.spad" 469433 469443 469737 469742) (-297 "FAMONC.spad" 467655 467667 469423 469428) (-296 "FAGROUP.spad" 467261 467271 467551 467578) (-295 "FACUTIL.spad" 465457 465474 467251 467256) (-294 "FACTFUNC.spad" 464633 464643 465447 465452) (-293 "EXPUPXS.spad" 461466 461489 462765 462914) (-292 "EXPRTUBE.spad" 458694 458702 461456 461461) (-291 "EXPRODE.spad" 455566 455582 458684 458689) (-290 "EXPR.spad" 450868 450878 451582 451985) (-289 "EXPR2UPS.spad" 446960 446973 450858 450863) (-288 "EXPR2.spad" 446663 446675 446950 446955) (-287 "EXPEXPAN.spad" 443604 443629 444238 444331) (-286 "EXIT.spad" 443275 443283 443594 443599) (-285 "EVALCYC.spad" 442733 442747 443265 443270) (-284 "EVALAB.spad" 442297 442307 442723 442728) (-283 "EVALAB.spad" 441859 441871 442287 442292) (-282 "EUCDOM.spad" 439401 439409 441785 441854) (-281 "EUCDOM.spad" 437005 437015 439391 439396) (-280 "ESTOOLS.spad" 428845 428853 436995 437000) (-279 "ESTOOLS2.spad" 428446 428460 428835 428840) (-278 "ESTOOLS1.spad" 428131 428142 428436 428441) (-277 "ES.spad" 420678 420686 428121 428126) (-276 "ES.spad" 413133 413143 420578 420583) (-275 "ESCONT.spad" 409906 409914 413123 413128) (-274 "ESCONT1.spad" 409655 409667 409896 409901) (-273 "ES2.spad" 409150 409166 409645 409650) (-272 "ES1.spad" 408716 408732 409140 409145) (-271 "ERROR.spad" 406037 406045 408706 408711) (-270 "EQTBL.spad" 404509 404531 404718 404745) (-269 "EQ.spad" 399393 399403 402192 402301) (-268 "EQ2.spad" 399109 399121 399383 399388) (-267 "EP.spad" 395423 395433 399099 399104) (-266 "ENV.spad" 394113 394121 395413 395418) (-265 "ENTIRER.spad" 393781 393789 394057 394108) (-264 "EMR.spad" 392982 393023 393707 393776) (-263 "ELTAGG.spad" 391222 391241 392972 392977) (-262 "ELTAGG.spad" 389426 389447 391178 391183) (-261 "ELTAB.spad" 388873 388891 389416 389421) (-260 "ELFUTS.spad" 388252 388271 388863 388868) (-259 "ELEMFUN.spad" 387941 387949 388242 388247) (-258 "ELEMFUN.spad" 387628 387638 387931 387936) (-257 "ELAGG.spad" 385559 385569 387596 387623) (-256 "ELAGG.spad" 383439 383451 385478 385483) (-255 "EFUPXS.spad" 380215 380245 383395 383400) (-254 "EFULS.spad" 377051 377074 380171 380176) (-253 "EFSTRUC.spad" 375006 375022 377041 377046) (-252 "EF.spad" 369772 369788 374996 375001) (-251 "EAB.spad" 368048 368056 369762 369767) (-250 "E04UCFA.spad" 367584 367592 368038 368043) (-249 "E04NAFA.spad" 367161 367169 367574 367579) (-248 "E04MBFA.spad" 366741 366749 367151 367156) (-247 "E04JAFA.spad" 366277 366285 366731 366736) (-246 "E04GCFA.spad" 365813 365821 366267 366272) (-245 "E04FDFA.spad" 365349 365357 365803 365808) (-244 "E04DGFA.spad" 364885 364893 365339 365344) (-243 "E04AGNT.spad" 360727 360735 364875 364880) (-242 "DVARCAT.spad" 357412 357422 360717 360722) (-241 "DVARCAT.spad" 354095 354107 357402 357407) (-240 "DSMP.spad" 351529 351543 351834 351961) (-239 "DROPT.spad" 345474 345482 351519 351524) (-238 "DROPT1.spad" 345137 345147 345464 345469) (-237 "DROPT0.spad" 339964 339972 345127 345132) (-236 "DRAWPT.spad" 338119 338127 339954 339959) (-235 "DRAW.spad" 330719 330732 338109 338114) (-234 "DRAWHACK.spad" 330027 330037 330709 330714) (-233 "DRAWCX.spad" 327469 327477 330017 330022) (-232 "DRAWCURV.spad" 327006 327021 327459 327464) (-231 "DRAWCFUN.spad" 316178 316186 326996 327001) (-230 "DQAGG.spad" 314334 314344 316134 316173) (-229 "DPOLCAT.spad" 309675 309691 314202 314329) (-228 "DPOLCAT.spad" 305102 305120 309631 309636) (-227 "DPMO.spad" 299089 299105 299227 299523) (-226 "DPMM.spad" 293089 293107 293214 293510) (-225 "domain.spad" 292360 292368 293079 293084) (-224 "DMP.spad" 289585 289600 290157 290284) (-223 "DLP.spad" 288933 288943 289575 289580) (-222 "DLIST.spad" 287345 287355 288116 288143) (-221 "DLAGG.spad" 285746 285756 287325 287340) (-220 "DIVRING.spad" 285193 285201 285690 285741) (-219 "DIVRING.spad" 284684 284694 285183 285188) (-218 "DISPLAY.spad" 282864 282872 284674 284679) (-217 "DIRPROD.spad" 274123 274139 274763 274892) (-216 "DIRPROD2.spad" 272931 272949 274113 274118) (-215 "DIRPCAT.spad" 271863 271879 272785 272926) (-214 "DIRPCAT.spad" 270535 270553 271459 271464) (-213 "DIOSP.spad" 269360 269368 270525 270530) (-212 "DIOPS.spad" 268332 268342 269328 269355) (-211 "DIOPS.spad" 267290 267302 268288 268293) (-210 "DIFRING.spad" 266582 266590 267270 267285) (-209 "DIFRING.spad" 265882 265892 266572 266577) (-208 "DIFEXT.spad" 265041 265051 265862 265877) (-207 "DIFEXT.spad" 264117 264129 264940 264945) (-206 "DIAGG.spad" 263735 263745 264085 264112) (-205 "DIAGG.spad" 263373 263385 263725 263730) (-204 "DHMATRIX.spad" 261677 261687 262830 262857) (-203 "DFSFUN.spad" 255085 255093 261667 261672) (-202 "DFLOAT.spad" 251608 251616 254975 255080) (-201 "DFINTTLS.spad" 249817 249833 251598 251603) (-200 "DERHAM.spad" 247727 247759 249797 249812) (-199 "DEQUEUE.spad" 247045 247055 247334 247361) (-198 "DEGRED.spad" 246660 246674 247035 247040) (-197 "DEFINTRF.spad" 244185 244195 246650 246655) (-196 "DEFINTEF.spad" 242681 242697 244175 244180) (-195 "DECIMAL.spad" 240565 240573 241151 241244) (-194 "DDFACT.spad" 238364 238381 240555 240560) (-193 "DBLRESP.spad" 237962 237986 238354 238359) (-192 "DBASE.spad" 236534 236544 237952 237957) (-191 "D03FAFA.spad" 236362 236370 236524 236529) (-190 "D03EEFA.spad" 236182 236190 236352 236357) (-189 "D03AGNT.spad" 235262 235270 236172 236177) (-188 "D02EJFA.spad" 234724 234732 235252 235257) (-187 "D02CJFA.spad" 234202 234210 234714 234719) (-186 "D02BHFA.spad" 233692 233700 234192 234197) (-185 "D02BBFA.spad" 233182 233190 233682 233687) (-184 "D02AGNT.spad" 227986 227994 233172 233177) (-183 "D01WGTS.spad" 226305 226313 227976 227981) (-182 "D01TRNS.spad" 226282 226290 226295 226300) (-181 "D01GBFA.spad" 225804 225812 226272 226277) (-180 "D01FCFA.spad" 225326 225334 225794 225799) (-179 "D01ASFA.spad" 224794 224802 225316 225321) (-178 "D01AQFA.spad" 224240 224248 224784 224789) (-177 "D01APFA.spad" 223664 223672 224230 224235) (-176 "D01ANFA.spad" 223158 223166 223654 223659) (-175 "D01AMFA.spad" 222668 222676 223148 223153) (-174 "D01ALFA.spad" 222208 222216 222658 222663) (-173 "D01AKFA.spad" 221734 221742 222198 222203) (-172 "D01AJFA.spad" 221257 221265 221724 221729) (-171 "D01AGNT.spad" 217316 217324 221247 221252) (-170 "CYCLOTOM.spad" 216822 216830 217306 217311) (-169 "CYCLES.spad" 213654 213662 216812 216817) (-168 "CVMP.spad" 213071 213081 213644 213649) (-167 "CTRIGMNP.spad" 211561 211577 213061 213066) (-166 "CTORCALL.spad" 211149 211157 211551 211556) (-165 "CSTTOOLS.spad" 210392 210405 211139 211144) (-164 "CRFP.spad" 204096 204109 210382 210387) (-163 "CRAPACK.spad" 203139 203149 204086 204091) (-162 "CPMATCH.spad" 202639 202654 203064 203069) (-161 "CPIMA.spad" 202344 202363 202629 202634) (-160 "COORDSYS.spad" 197237 197247 202334 202339) (-159 "CONTOUR.spad" 196639 196647 197227 197232) (-158 "CONTFRAC.spad" 192251 192261 196541 196634) (-157 "COMRING.spad" 191925 191933 192189 192246) (-156 "COMPPROP.spad" 191439 191447 191915 191920) (-155 "COMPLPAT.spad" 191206 191221 191429 191434) (-154 "COMPLEX.spad" 185239 185249 185483 185744) (-153 "COMPLEX2.spad" 184952 184964 185229 185234) (-152 "COMPFACT.spad" 184554 184568 184942 184947) (-151 "COMPCAT.spad" 182610 182620 184276 184549) (-150 "COMPCAT.spad" 180373 180385 182041 182046) (-149 "COMMUPC.spad" 180119 180137 180363 180368) (-148 "COMMONOP.spad" 179652 179660 180109 180114) (-147 "COMM.spad" 179461 179469 179642 179647) (-146 "COMBOPC.spad" 178366 178374 179451 179456) (-145 "COMBINAT.spad" 177111 177121 178356 178361) (-144 "COMBF.spad" 174479 174495 177101 177106) (-143 "COLOR.spad" 173316 173324 174469 174474) (-142 "CMPLXRT.spad" 173025 173042 173306 173311) (-141 "CLIP.spad" 169117 169125 173015 173020) (-140 "CLIF.spad" 167756 167772 169073 169112) (-139 "CLAGG.spad" 164231 164241 167736 167751) (-138 "CLAGG.spad" 160587 160599 164094 164099) (-137 "CINTSLPE.spad" 159912 159925 160577 160582) (-136 "CHVAR.spad" 157990 158012 159902 159907) (-135 "CHARZ.spad" 157905 157913 157970 157985) (-134 "CHARPOL.spad" 157413 157423 157895 157900) (-133 "CHARNZ.spad" 157166 157174 157393 157408) (-132 "CHAR.spad" 155056 155064 157156 157161) (-131 "CFCAT.spad" 154372 154380 155046 155051) (-130 "CDEN.spad" 153530 153544 154362 154367) (-129 "CCLASS.spad" 151679 151687 152941 152980) (-128 "CARTEN.spad" 146782 146806 151669 151674) (-127 "CARTEN2.spad" 146168 146195 146772 146777) (-126 "CARD.spad" 143457 143465 146142 146163) (-125 "CACHSET.spad" 143079 143087 143447 143452) (-124 "CABMON.spad" 142632 142640 143069 143074) (-123 "BTREE.spad" 141701 141711 142239 142266) (-122 "BTOURN.spad" 140704 140714 141308 141335) (-121 "BTCAT.spad" 140080 140090 140660 140699) (-120 "BTCAT.spad" 139488 139500 140070 140075) (-119 "BTAGG.spad" 138504 138512 139444 139483) (-118 "BTAGG.spad" 137552 137562 138494 138499) (-117 "BSTREE.spad" 136287 136297 137159 137186) (-116 "BRILL.spad" 134482 134493 136277 136282) (-115 "BRAGG.spad" 133396 133406 134462 134477) (-114 "BRAGG.spad" 132284 132296 133352 133357) (-113 "BPADICRT.spad" 130268 130280 130523 130616) (-112 "BPADIC.spad" 129932 129944 130194 130263) (-111 "BOUNDZRO.spad" 129588 129605 129922 129927) (-110 "BOP.spad" 125052 125060 129578 129583) (-109 "BOP1.spad" 122438 122448 125008 125013) (-108 "BOOLEAN.spad" 121691 121699 122428 122433) (-107 "BMODULE.spad" 121403 121415 121659 121686) (-106 "BITS.spad" 120822 120830 121039 121066) (-105 "BINFILE.spad" 120165 120173 120812 120817) (-104 "BINDING.spad" 119572 119580 120155 120160) (-103 "BINARY.spad" 117465 117473 118042 118135) (-102 "BGAGG.spad" 116650 116660 117433 117460) (-101 "BGAGG.spad" 115855 115867 116640 116645) (-100 "BFUNCT.spad" 115419 115427 115835 115850) (-99 "BEZOUT.spad" 114554 114580 115369 115374) (-98 "BBTREE.spad" 111374 111383 114161 114188) (-97 "BASTYPE.spad" 111047 111054 111364 111369) (-96 "BASTYPE.spad" 110718 110727 111037 111042) (-95 "BALFACT.spad" 110158 110170 110708 110713) (-94 "AUTOMOR.spad" 109605 109614 110138 110153) (-93 "ATTREG.spad" 106324 106331 109357 109600) (-92 "ATTRBUT.spad" 102347 102354 106304 106319) (-91 "ATRIG.spad" 101817 101824 102337 102342) (-90 "ATRIG.spad" 101285 101294 101807 101812) (-89 "ASTACK.spad" 100618 100627 100892 100919) (-88 "ASSOCEQ.spad" 99418 99429 100574 100579) (-87 "ASP9.spad" 98499 98512 99408 99413) (-86 "ASP8.spad" 97542 97555 98489 98494) (-85 "ASP80.spad" 96864 96877 97532 97537) (-84 "ASP7.spad" 96024 96037 96854 96859) (-83 "ASP78.spad" 95475 95488 96014 96019) (-82 "ASP77.spad" 94844 94857 95465 95470) (-81 "ASP74.spad" 93936 93949 94834 94839) (-80 "ASP73.spad" 93207 93220 93926 93931) (-79 "ASP6.spad" 91839 91852 93197 93202) (-78 "ASP55.spad" 90348 90361 91829 91834) (-77 "ASP50.spad" 88165 88178 90338 90343) (-76 "ASP4.spad" 87460 87473 88155 88160) (-75 "ASP49.spad" 86459 86472 87450 87455) (-74 "ASP42.spad" 84866 84905 86449 86454) (-73 "ASP41.spad" 83445 83484 84856 84861) (-72 "ASP35.spad" 82433 82446 83435 83440) (-71 "ASP34.spad" 81734 81747 82423 82428) (-70 "ASP33.spad" 81294 81307 81724 81729) (-69 "ASP31.spad" 80434 80447 81284 81289) (-68 "ASP30.spad" 79326 79339 80424 80429) (-67 "ASP29.spad" 78792 78805 79316 79321) (-66 "ASP28.spad" 70065 70078 78782 78787) (-65 "ASP27.spad" 68962 68975 70055 70060) (-64 "ASP24.spad" 68049 68062 68952 68957) (-63 "ASP20.spad" 67265 67278 68039 68044) (-62 "ASP1.spad" 66646 66659 67255 67260) (-61 "ASP19.spad" 61332 61345 66636 66641) (-60 "ASP12.spad" 60746 60759 61322 61327) (-59 "ASP10.spad" 60017 60030 60736 60741) (-58 "ARRAY2.spad" 59377 59386 59624 59651) (-57 "ARRAY1.spad" 58212 58221 58560 58587) (-56 "ARRAY12.spad" 56881 56892 58202 58207) (-55 "ARR2CAT.spad" 52531 52552 56837 56876) (-54 "ARR2CAT.spad" 48213 48236 52521 52526) (-53 "APPRULE.spad" 47457 47479 48203 48208) (-52 "APPLYORE.spad" 47072 47085 47447 47452) (-51 "ANY.spad" 45414 45421 47062 47067) (-50 "ANY1.spad" 44485 44494 45404 45409) (-49 "ANTISYM.spad" 42924 42940 44465 44480) (-48 "ANON.spad" 42837 42844 42914 42919) (-47 "AN.spad" 41140 41147 42655 42748) (-46 "AMR.spad" 39319 39330 41038 41135) (-45 "AMR.spad" 37335 37348 39056 39061) (-44 "ALIST.spad" 34747 34768 35097 35124) (-43 "ALGSC.spad" 33870 33896 34619 34672) (-42 "ALGPKG.spad" 29579 29590 33826 33831) (-41 "ALGMFACT.spad" 28768 28782 29569 29574) (-40 "ALGMANIP.spad" 26189 26204 28566 28571) (-39 "ALGFF.spad" 24507 24534 24724 24880) (-38 "ALGFACT.spad" 23628 23638 24497 24502) (-37 "ALGEBRA.spad" 23359 23368 23584 23623) (-36 "ALGEBRA.spad" 23122 23133 23349 23354) (-35 "ALAGG.spad" 22620 22641 23078 23117) (-34 "AHYP.spad" 22001 22008 22610 22615) (-33 "AGG.spad" 20300 20307 21981 21996) (-32 "AGG.spad" 18573 18582 20256 20261) (-31 "AF.spad" 16999 17014 18509 18514) (-30 "ACPLOT.spad" 15570 15577 16989 16994) (-29 "ACFS.spad" 13309 13318 15460 15565) (-28 "ACFS.spad" 11146 11157 13299 13304) (-27 "ACF.spad" 7748 7755 11048 11141) (-26 "ACF.spad" 4436 4445 7738 7743) (-25 "ABELSG.spad" 3977 3984 4426 4431) (-24 "ABELSG.spad" 3516 3525 3967 3972) (-23 "ABELMON.spad" 3059 3066 3506 3511) (-22 "ABELMON.spad" 2600 2609 3049 3054) (-21 "ABELGRP.spad" 2172 2179 2590 2595) (-20 "ABELGRP.spad" 1742 1751 2162 2167) (-19 "A1AGG.spad" 870 879 1698 1737) (-18 "A1AGG.spad" 30 41 860 865)) 
-\ No newline at end of file
+((-1196 NIL 2233052 2233057 2233062 2233067) (-3 NIL 2233032 2233037 2233042 2233047) (-2 NIL 2233012 2233017 2233022 2233027) (-1 NIL 2232992 2232997 2233002 2233007) (0 NIL 2232972 2232977 2232982 2232987) (-1191 "ZMOD.spad" 2232781 2232794 2232910 2232967) (-1190 "ZLINDEP.spad" 2231825 2231836 2232771 2232776) (-1189 "ZDSOLVE.spad" 2221674 2221696 2231815 2231820) (-1188 "YSTREAM.spad" 2221167 2221178 2221664 2221669) (-1187 "XRPOLY.spad" 2220387 2220407 2221023 2221092) (-1186 "XPR.spad" 2218116 2218129 2220105 2220204) (-1185 "XPOLY.spad" 2217671 2217682 2217972 2218041) (-1184 "XPOLYC.spad" 2216988 2217004 2217597 2217666) (-1183 "XPBWPOLY.spad" 2215425 2215445 2216768 2216837) (-1182 "XF.spad" 2213886 2213901 2215327 2215420) (-1181 "XF.spad" 2212327 2212344 2213770 2213775) (-1180 "XFALG.spad" 2209351 2209367 2212253 2212322) (-1179 "XEXPPKG.spad" 2208602 2208628 2209341 2209346) (-1178 "XDPOLY.spad" 2208216 2208232 2208458 2208527) (-1177 "XALG.spad" 2207814 2207825 2208172 2208211) (-1176 "WUTSET.spad" 2203653 2203670 2207460 2207487) (-1175 "WP.spad" 2202667 2202711 2203511 2203578) (-1174 "WFFINTBS.spad" 2200230 2200252 2202657 2202662) (-1173 "WEIER.spad" 2198444 2198455 2200220 2200225) (-1172 "VSPACE.spad" 2198117 2198128 2198412 2198439) (-1171 "VSPACE.spad" 2197810 2197823 2198107 2198112) (-1170 "VOID.spad" 2197400 2197409 2197800 2197805) (-1169 "VIEW.spad" 2195022 2195031 2197390 2197395) (-1168 "VIEWDEF.spad" 2190219 2190228 2195012 2195017) (-1167 "VIEW3D.spad" 2174054 2174063 2190209 2190214) (-1166 "VIEW2D.spad" 2161791 2161800 2174044 2174049) (-1165 "VECTOR.spad" 2160468 2160479 2160719 2160746) (-1164 "VECTOR2.spad" 2159095 2159108 2160458 2160463) (-1163 "VECTCAT.spad" 2156983 2156994 2159051 2159090) (-1162 "VECTCAT.spad" 2154692 2154705 2156762 2156767) (-1161 "VARIABLE.spad" 2154472 2154487 2154682 2154687) (-1160 "UTYPE.spad" 2154106 2154115 2154452 2154467) (-1159 "UTSODETL.spad" 2153399 2153423 2154062 2154067) (-1158 "UTSODE.spad" 2151587 2151607 2153389 2153394) (-1157 "UTS.spad" 2146376 2146404 2150054 2150151) (-1156 "UTSCAT.spad" 2143827 2143843 2146274 2146371) (-1155 "UTSCAT.spad" 2140922 2140940 2143371 2143376) (-1154 "UTS2.spad" 2140515 2140550 2140912 2140917) (-1153 "URAGG.spad" 2135137 2135148 2140495 2140510) (-1152 "URAGG.spad" 2129733 2129746 2135093 2135098) (-1151 "UPXSSING.spad" 2127379 2127405 2128817 2128950) (-1150 "UPXS.spad" 2124406 2124434 2125511 2125660) (-1149 "UPXSCONS.spad" 2122163 2122183 2122538 2122687) (-1148 "UPXSCCA.spad" 2120621 2120641 2122009 2122158) (-1147 "UPXSCCA.spad" 2119221 2119243 2120611 2120616) (-1146 "UPXSCAT.spad" 2117802 2117818 2119067 2119216) (-1145 "UPXS2.spad" 2117343 2117396 2117792 2117797) (-1144 "UPSQFREE.spad" 2115755 2115769 2117333 2117338) (-1143 "UPSCAT.spad" 2113348 2113372 2115653 2115750) (-1142 "UPSCAT.spad" 2110647 2110673 2112954 2112959) (-1141 "UPOLYC.spad" 2105625 2105636 2110489 2110642) (-1140 "UPOLYC.spad" 2100495 2100508 2105361 2105366) (-1139 "UPOLYC2.spad" 2099964 2099983 2100485 2100490) (-1138 "UP.spad" 2097014 2097029 2097522 2097675) (-1137 "UPMP.spad" 2095904 2095917 2097004 2097009) (-1136 "UPDIVP.spad" 2095467 2095481 2095894 2095899) (-1135 "UPDECOMP.spad" 2093704 2093718 2095457 2095462) (-1134 "UPCDEN.spad" 2092911 2092927 2093694 2093699) (-1133 "UP2.spad" 2092273 2092294 2092901 2092906) (-1132 "UNISEG.spad" 2091626 2091637 2092192 2092197) (-1131 "UNISEG2.spad" 2091119 2091132 2091582 2091587) (-1130 "UNIFACT.spad" 2090220 2090232 2091109 2091114) (-1129 "ULS.spad" 2080779 2080807 2081872 2082301) (-1128 "ULSCONS.spad" 2074822 2074842 2075194 2075343) (-1127 "ULSCCAT.spad" 2072419 2072439 2074642 2074817) (-1126 "ULSCCAT.spad" 2070150 2070172 2072375 2072380) (-1125 "ULSCAT.spad" 2068366 2068382 2069996 2070145) (-1124 "ULS2.spad" 2067878 2067931 2068356 2068361) (-1123 "UFD.spad" 2066943 2066952 2067804 2067873) (-1122 "UFD.spad" 2066070 2066081 2066933 2066938) (-1121 "UDVO.spad" 2064917 2064926 2066060 2066065) (-1120 "UDPO.spad" 2062344 2062355 2064873 2064878) (-1119 "TYPE.spad" 2062266 2062275 2062324 2062339) (-1118 "TWOFACT.spad" 2060916 2060931 2062256 2062261) (-1117 "TUPLE.spad" 2060302 2060313 2060815 2060820) (-1116 "TUBETOOL.spad" 2057139 2057148 2060292 2060297) (-1115 "TUBE.spad" 2055780 2055797 2057129 2057134) (-1114 "TS.spad" 2054369 2054385 2055345 2055442) (-1113 "TSETCAT.spad" 2041484 2041501 2054325 2054364) (-1112 "TSETCAT.spad" 2028597 2028616 2041440 2041445) (-1111 "TRMANIP.spad" 2022963 2022980 2028303 2028308) (-1110 "TRIMAT.spad" 2021922 2021947 2022953 2022958) (-1109 "TRIGMNIP.spad" 2020439 2020456 2021912 2021917) (-1108 "TRIGCAT.spad" 2019951 2019960 2020429 2020434) (-1107 "TRIGCAT.spad" 2019461 2019472 2019941 2019946) (-1106 "TREE.spad" 2018032 2018043 2019068 2019095) (-1105 "TRANFUN.spad" 2017863 2017872 2018022 2018027) (-1104 "TRANFUN.spad" 2017692 2017703 2017853 2017858) (-1103 "TOPSP.spad" 2017366 2017375 2017682 2017687) (-1102 "TOOLSIGN.spad" 2017029 2017040 2017356 2017361) (-1101 "TEXTFILE.spad" 2015586 2015595 2017019 2017024) (-1100 "TEX.spad" 2012603 2012612 2015576 2015581) (-1099 "TEX1.spad" 2012159 2012170 2012593 2012598) (-1098 "TEMUTL.spad" 2011714 2011723 2012149 2012154) (-1097 "TBCMPPK.spad" 2009807 2009830 2011704 2011709) (-1096 "TBAGG.spad" 2008831 2008854 2009775 2009802) (-1095 "TBAGG.spad" 2007875 2007900 2008821 2008826) (-1094 "TANEXP.spad" 2007251 2007262 2007865 2007870) (-1093 "TABLE.spad" 2005662 2005685 2005932 2005959) (-1092 "TABLEAU.spad" 2005143 2005154 2005652 2005657) (-1091 "TABLBUMP.spad" 2001926 2001937 2005133 2005138) (-1090 "SYSSOLP.spad" 1999399 1999410 2001916 2001921) (-1089 "SYNTAX.spad" 1995684 1995693 1999389 1999394) (-1088 "SYMTAB.spad" 1993740 1993749 1995674 1995679) (-1087 "SYMS.spad" 1989725 1989734 1993730 1993735) (-1086 "SYMPOLY.spad" 1988735 1988746 1988817 1988944) (-1085 "SYMFUNC.spad" 1988210 1988221 1988725 1988730) (-1084 "SYMBOL.spad" 1985546 1985555 1988200 1988205) (-1083 "SWITCH.spad" 1982303 1982312 1985536 1985541) (-1082 "SUTS.spad" 1979202 1979230 1980770 1980867) (-1081 "SUPXS.spad" 1976216 1976244 1977334 1977483) (-1080 "SUP.spad" 1972993 1973004 1973774 1973927) (-1079 "SUPFRACF.spad" 1972098 1972116 1972983 1972988) (-1078 "SUP2.spad" 1971488 1971501 1972088 1972093) (-1077 "SUMRF.spad" 1970454 1970465 1971478 1971483) (-1076 "SUMFS.spad" 1970087 1970104 1970444 1970449) (-1075 "SULS.spad" 1960633 1960661 1961739 1962168) (-1074 "SUCH.spad" 1960313 1960328 1960623 1960628) (-1073 "SUBSPACE.spad" 1952320 1952335 1960303 1960308) (-1072 "SUBRESP.spad" 1951480 1951494 1952276 1952281) (-1071 "STTF.spad" 1947579 1947595 1951470 1951475) (-1070 "STTFNC.spad" 1944047 1944063 1947569 1947574) (-1069 "STTAYLOR.spad" 1936445 1936456 1943928 1943933) (-1068 "STRTBL.spad" 1934950 1934967 1935099 1935126) (-1067 "STRING.spad" 1934359 1934368 1934373 1934400) (-1066 "STRICAT.spad" 1934135 1934144 1934315 1934354) (-1065 "STREAM.spad" 1930903 1930914 1933660 1933675) (-1064 "STREAM3.spad" 1930448 1930463 1930893 1930898) (-1063 "STREAM2.spad" 1929516 1929529 1930438 1930443) (-1062 "STREAM1.spad" 1929220 1929231 1929506 1929511) (-1061 "STINPROD.spad" 1928126 1928142 1929210 1929215) (-1060 "STEP.spad" 1927327 1927336 1928116 1928121) (-1059 "STBL.spad" 1925853 1925881 1926020 1926035) (-1058 "STAGG.spad" 1924918 1924929 1925833 1925848) (-1057 "STAGG.spad" 1923991 1924004 1924908 1924913) (-1056 "STACK.spad" 1923342 1923353 1923598 1923625) (-1055 "SREGSET.spad" 1921046 1921063 1922988 1923015) (-1054 "SRDCMPK.spad" 1919591 1919611 1921036 1921041) (-1053 "SRAGG.spad" 1914676 1914685 1919547 1919586) (-1052 "SRAGG.spad" 1909793 1909804 1914666 1914671) (-1051 "SQMATRIX.spad" 1907419 1907437 1908327 1908414) (-1050 "SPLTREE.spad" 1901971 1901984 1906855 1906882) (-1049 "SPLNODE.spad" 1898559 1898572 1901961 1901966) (-1048 "SPFCAT.spad" 1897336 1897345 1898549 1898554) (-1047 "SPECOUT.spad" 1895886 1895895 1897326 1897331) (-1046 "spad-parser.spad" 1895351 1895360 1895876 1895881) (-1045 "SPACEC.spad" 1879364 1879375 1895341 1895346) (-1044 "SPACE3.spad" 1879140 1879151 1879354 1879359) (-1043 "SORTPAK.spad" 1878685 1878698 1879096 1879101) (-1042 "SOLVETRA.spad" 1876442 1876453 1878675 1878680) (-1041 "SOLVESER.spad" 1874962 1874973 1876432 1876437) (-1040 "SOLVERAD.spad" 1870972 1870983 1874952 1874957) (-1039 "SOLVEFOR.spad" 1869392 1869410 1870962 1870967) (-1038 "SNTSCAT.spad" 1868980 1868997 1869348 1869387) (-1037 "SMTS.spad" 1867240 1867266 1868545 1868642) (-1036 "SMP.spad" 1864682 1864702 1865072 1865199) (-1035 "SMITH.spad" 1863525 1863550 1864672 1864677) (-1034 "SMATCAT.spad" 1861623 1861653 1863457 1863520) (-1033 "SMATCAT.spad" 1859665 1859697 1861501 1861506) (-1032 "SKAGG.spad" 1858614 1858625 1859621 1859660) (-1031 "SINT.spad" 1856922 1856931 1858480 1858609) (-1030 "SIMPAN.spad" 1856650 1856659 1856912 1856917) (-1029 "SIGNRF.spad" 1855758 1855769 1856640 1856645) (-1028 "SIGNEF.spad" 1855027 1855044 1855748 1855753) (-1027 "SHP.spad" 1852945 1852960 1854983 1854988) (-1026 "SHDP.spad" 1844335 1844362 1844844 1844973) (-1025 "SGROUP.spad" 1843801 1843810 1844325 1844330) (-1024 "SGROUP.spad" 1843265 1843276 1843791 1843796) (-1023 "SGCF.spad" 1836146 1836155 1843255 1843260) (-1022 "SFRTCAT.spad" 1835062 1835079 1836102 1836141) (-1021 "SFRGCD.spad" 1834125 1834145 1835052 1835057) (-1020 "SFQCMPK.spad" 1828762 1828782 1834115 1834120) (-1019 "SFORT.spad" 1828197 1828211 1828752 1828757) (-1018 "SEXOF.spad" 1828040 1828080 1828187 1828192) (-1017 "SEX.spad" 1827932 1827941 1828030 1828035) (-1016 "SEXCAT.spad" 1825036 1825076 1827922 1827927) (-1015 "SET.spad" 1823336 1823347 1824457 1824496) (-1014 "SETMN.spad" 1821770 1821787 1823326 1823331) (-1013 "SETCAT.spad" 1821255 1821264 1821760 1821765) (-1012 "SETCAT.spad" 1820738 1820749 1821245 1821250) (-1011 "SETAGG.spad" 1817261 1817272 1820706 1820733) (-1010 "SETAGG.spad" 1813804 1813817 1817251 1817256) (-1009 "SEGXCAT.spad" 1812916 1812929 1813784 1813799) (-1008 "SEG.spad" 1812729 1812740 1812835 1812840) (-1007 "SEGCAT.spad" 1811548 1811559 1812709 1812724) (-1006 "SEGBIND.spad" 1810620 1810631 1811503 1811508) (-1005 "SEGBIND2.spad" 1810316 1810329 1810610 1810615) (-1004 "SEG2.spad" 1809741 1809754 1810272 1810277) (-1003 "SDVAR.spad" 1809017 1809028 1809731 1809736) (-1002 "SDPOL.spad" 1806410 1806421 1806701 1806828) (-1001 "SCPKG.spad" 1804489 1804500 1806400 1806405) (-1000 "SCOPE.spad" 1803634 1803643 1804479 1804484) (-999 "SCACHE.spad" 1802317 1802327 1803624 1803629) (-998 "SAOS.spad" 1802190 1802198 1802307 1802312) (-997 "SAERFFC.spad" 1801904 1801923 1802180 1802185) (-996 "SAE.spad" 1800083 1800098 1800693 1800828) (-995 "SAEFACT.spad" 1799785 1799804 1800073 1800078) (-994 "RURPK.spad" 1797427 1797442 1799775 1799780) (-993 "RULESET.spad" 1796869 1796892 1797417 1797422) (-992 "RULE.spad" 1795074 1795097 1796859 1796864) (-991 "RULECOLD.spad" 1794927 1794939 1795064 1795069) (-990 "RSETGCD.spad" 1791306 1791325 1794917 1794922) (-989 "RSETCAT.spad" 1781079 1781095 1791262 1791301) (-988 "RSETCAT.spad" 1770884 1770902 1781069 1781074) (-987 "RSDCMPK.spad" 1769337 1769356 1770874 1770879) (-986 "RRCC.spad" 1767722 1767751 1769327 1769332) (-985 "RRCC.spad" 1766105 1766136 1767712 1767717) (-984 "RPOLCAT.spad" 1745466 1745480 1765973 1766100) (-983 "RPOLCAT.spad" 1724542 1724558 1745051 1745056) (-982 "ROUTINE.spad" 1720406 1720414 1723189 1723216) (-981 "ROMAN.spad" 1719639 1719647 1720272 1720401) (-980 "ROIRC.spad" 1718720 1718751 1719629 1719634) (-979 "RNS.spad" 1717624 1717632 1718622 1718715) (-978 "RNS.spad" 1716614 1716624 1717614 1717619) (-977 "RNG.spad" 1716350 1716358 1716604 1716609) (-976 "RMODULE.spad" 1715989 1715999 1716340 1716345) (-975 "RMCAT2.spad" 1715398 1715454 1715979 1715984) (-974 "RMATRIX.spad" 1714078 1714096 1714565 1714604) (-973 "RMATCAT.spad" 1709600 1709630 1714022 1714073) (-972 "RMATCAT.spad" 1705024 1705056 1709448 1709453) (-971 "RINTERP.spad" 1704913 1704932 1705014 1705019) (-970 "RING.spad" 1704271 1704279 1704893 1704908) (-969 "RING.spad" 1703637 1703647 1704261 1704266) (-968 "RIDIST.spad" 1703022 1703030 1703627 1703632) (-967 "RGCHAIN.spad" 1701602 1701617 1702507 1702534) (-966 "RF.spad" 1699217 1699227 1701592 1701597) (-965 "RFFACTOR.spad" 1698680 1698690 1699207 1699212) (-964 "RFFACT.spad" 1698416 1698427 1698670 1698675) (-963 "RFDIST.spad" 1697405 1697413 1698406 1698411) (-962 "RETSOL.spad" 1696823 1696835 1697395 1697400) (-961 "RETRACT.spad" 1696173 1696183 1696813 1696818) (-960 "RETRACT.spad" 1695521 1695533 1696163 1696168) (-959 "RESULT.spad" 1693582 1693590 1694168 1694195) (-958 "RESRING.spad" 1692930 1692976 1693520 1693577) (-957 "RESLATC.spad" 1692255 1692265 1692920 1692925) (-956 "REPSQ.spad" 1691985 1691995 1692245 1692250) (-955 "REP.spad" 1689538 1689546 1691975 1691980) (-954 "REPDB.spad" 1689244 1689254 1689528 1689533) (-953 "REP2.spad" 1678817 1678827 1689086 1689091) (-952 "REP1.spad" 1672808 1672818 1678767 1678772) (-951 "REGSET.spad" 1670606 1670622 1672454 1672481) (-950 "REF.spad" 1669936 1669946 1670561 1670566) (-949 "REDORDER.spad" 1669113 1669129 1669926 1669931) (-948 "RECLOS.spad" 1667903 1667922 1668606 1668699) (-947 "REALSOLV.spad" 1667036 1667044 1667893 1667898) (-946 "REAL.spad" 1666909 1666917 1667026 1667031) (-945 "REAL0Q.spad" 1664192 1664206 1666899 1666904) (-944 "REAL0.spad" 1661021 1661035 1664182 1664187) (-943 "RDIV.spad" 1660673 1660697 1661011 1661016) (-942 "RDIST.spad" 1660237 1660247 1660663 1660668) (-941 "RDETRS.spad" 1659034 1659051 1660227 1660232) (-940 "RDETR.spad" 1657142 1657159 1659024 1659029) (-939 "RDEEFS.spad" 1656216 1656232 1657132 1657137) (-938 "RDEEF.spad" 1655213 1655229 1656206 1656211) (-937 "RCFIELD.spad" 1652397 1652405 1655115 1655208) (-936 "RCFIELD.spad" 1649667 1649677 1652387 1652392) (-935 "RCAGG.spad" 1647570 1647580 1649647 1649662) (-934 "RCAGG.spad" 1645410 1645422 1647489 1647494) (-933 "RATRET.spad" 1644771 1644781 1645400 1645405) (-932 "RATFACT.spad" 1644464 1644475 1644761 1644766) (-931 "RANDSRC.spad" 1643784 1643792 1644454 1644459) (-930 "RADUTIL.spad" 1643539 1643547 1643774 1643779) (-929 "RADIX.spad" 1640332 1640345 1642009 1642102) (-928 "RADFF.spad" 1638749 1638785 1638867 1639023) (-927 "RADCAT.spad" 1638343 1638351 1638739 1638744) (-926 "RADCAT.spad" 1637935 1637945 1638333 1638338) (-925 "QUEUE.spad" 1637278 1637288 1637542 1637569) (-924 "QUAT.spad" 1635864 1635874 1636206 1636271) (-923 "QUATCT2.spad" 1635483 1635501 1635854 1635859) (-922 "QUATCAT.spad" 1633648 1633658 1635413 1635478) (-921 "QUATCAT.spad" 1631565 1631577 1633332 1633337) (-920 "QUAGG.spad" 1630379 1630389 1631521 1631560) (-919 "QFORM.spad" 1629842 1629856 1630369 1630374) (-918 "QFCAT.spad" 1628533 1628543 1629732 1629837) (-917 "QFCAT.spad" 1626830 1626842 1628031 1628036) (-916 "QFCAT2.spad" 1626521 1626537 1626820 1626825) (-915 "QEQUAT.spad" 1626078 1626086 1626511 1626516) (-914 "QCMPACK.spad" 1620825 1620844 1626068 1626073) (-913 "QALGSET.spad" 1616900 1616932 1620739 1620744) (-912 "QALGSET2.spad" 1614896 1614914 1616890 1616895) (-911 "PWFFINTB.spad" 1612206 1612227 1614886 1614891) (-910 "PUSHVAR.spad" 1611535 1611554 1612196 1612201) (-909 "PTRANFN.spad" 1607661 1607671 1611525 1611530) (-908 "PTPACK.spad" 1604749 1604759 1607651 1607656) (-907 "PTFUNC2.spad" 1604570 1604584 1604739 1604744) (-906 "PTCAT.spad" 1603652 1603662 1604526 1604565) (-905 "PSQFR.spad" 1602959 1602983 1603642 1603647) (-904 "PSEUDLIN.spad" 1601817 1601827 1602949 1602954) (-903 "PSETPK.spad" 1587250 1587266 1601695 1601700) (-902 "PSETCAT.spad" 1581158 1581181 1587218 1587245) (-901 "PSETCAT.spad" 1575052 1575077 1581114 1581119) (-900 "PSCURVE.spad" 1574035 1574043 1575042 1575047) (-899 "PSCAT.spad" 1572802 1572831 1573933 1574030) (-898 "PSCAT.spad" 1571659 1571690 1572792 1572797) (-897 "PRTITION.spad" 1570502 1570510 1571649 1571654) (-896 "PRS.spad" 1560064 1560081 1570458 1570463) (-895 "PRQAGG.spad" 1559483 1559493 1560020 1560059) (-894 "PROPLOG.spad" 1558886 1558894 1559473 1559478) (-893 "PROPFRML.spad" 1556751 1556762 1558822 1558827) (-892 "PROPERTY.spad" 1556245 1556253 1556741 1556746) (-891 "PRODUCT.spad" 1553925 1553937 1554211 1554266) (-890 "PR.spad" 1552314 1552326 1553019 1553146) (-889 "PRINT.spad" 1552066 1552074 1552304 1552309) (-888 "PRIMES.spad" 1550317 1550327 1552056 1552061) (-887 "PRIMELT.spad" 1548298 1548312 1550307 1550312) (-886 "PRIMCAT.spad" 1547921 1547929 1548288 1548293) (-885 "PRIMARR.spad" 1546926 1546936 1547104 1547131) (-884 "PRIMARR2.spad" 1545649 1545661 1546916 1546921) (-883 "PREASSOC.spad" 1545021 1545033 1545639 1545644) (-882 "PPCURVE.spad" 1544158 1544166 1545011 1545016) (-881 "POLYROOT.spad" 1542930 1542952 1544114 1544119) (-880 "POLY.spad" 1540230 1540240 1540747 1540874) (-879 "POLYLIFT.spad" 1539491 1539514 1540220 1540225) (-878 "POLYCATQ.spad" 1537593 1537615 1539481 1539486) (-877 "POLYCAT.spad" 1530999 1531020 1537461 1537588) (-876 "POLYCAT.spad" 1523707 1523730 1530171 1530176) (-875 "POLY2UP.spad" 1523155 1523169 1523697 1523702) (-874 "POLY2.spad" 1522750 1522762 1523145 1523150) (-873 "POLUTIL.spad" 1521691 1521720 1522706 1522711) (-872 "POLTOPOL.spad" 1520439 1520454 1521681 1521686) (-871 "POINT.spad" 1519280 1519290 1519367 1519394) (-870 "PNTHEORY.spad" 1515946 1515954 1519270 1519275) (-869 "PMTOOLS.spad" 1514703 1514717 1515936 1515941) (-868 "PMSYM.spad" 1514248 1514258 1514693 1514698) (-867 "PMQFCAT.spad" 1513835 1513849 1514238 1514243) (-866 "PMPRED.spad" 1513304 1513318 1513825 1513830) (-865 "PMPREDFS.spad" 1512748 1512770 1513294 1513299) (-864 "PMPLCAT.spad" 1511818 1511836 1512680 1512685) (-863 "PMLSAGG.spad" 1511399 1511413 1511808 1511813) (-862 "PMKERNEL.spad" 1510966 1510978 1511389 1511394) (-861 "PMINS.spad" 1510542 1510552 1510956 1510961) (-860 "PMFS.spad" 1510115 1510133 1510532 1510537) (-859 "PMDOWN.spad" 1509401 1509415 1510105 1510110) (-858 "PMASS.spad" 1508413 1508421 1509391 1509396) (-857 "PMASSFS.spad" 1507382 1507398 1508403 1508408) (-856 "PLOTTOOL.spad" 1507162 1507170 1507372 1507377) (-855 "PLOT.spad" 1501993 1502001 1507152 1507157) (-854 "PLOT3D.spad" 1498413 1498421 1501983 1501988) (-853 "PLOT1.spad" 1497554 1497564 1498403 1498408) (-852 "PLEQN.spad" 1484770 1484797 1497544 1497549) (-851 "PINTERP.spad" 1484386 1484405 1484760 1484765) (-850 "PINTERPA.spad" 1484168 1484184 1484376 1484381) (-849 "PI.spad" 1483775 1483783 1484142 1484163) (-848 "PID.spad" 1482731 1482739 1483701 1483770) (-847 "PICOERCE.spad" 1482388 1482398 1482721 1482726) (-846 "PGROEB.spad" 1480985 1480999 1482378 1482383) (-845 "PGE.spad" 1472238 1472246 1480975 1480980) (-844 "PGCD.spad" 1471120 1471137 1472228 1472233) (-843 "PFRPAC.spad" 1470263 1470273 1471110 1471115) (-842 "PFR.spad" 1466920 1466930 1470165 1470258) (-841 "PFOTOOLS.spad" 1466178 1466194 1466910 1466915) (-840 "PFOQ.spad" 1465548 1465566 1466168 1466173) (-839 "PFO.spad" 1464967 1464994 1465538 1465543) (-838 "PF.spad" 1464541 1464553 1464772 1464865) (-837 "PFECAT.spad" 1462207 1462215 1464467 1464536) (-836 "PFECAT.spad" 1459901 1459911 1462163 1462168) (-835 "PFBRU.spad" 1457771 1457783 1459891 1459896) (-834 "PFBR.spad" 1455309 1455332 1457761 1457766) (-833 "PERM.spad" 1450990 1451000 1455139 1455154) (-832 "PERMGRP.spad" 1445726 1445736 1450980 1450985) (-831 "PERMCAT.spad" 1444278 1444288 1445706 1445721) (-830 "PERMAN.spad" 1442810 1442824 1444268 1444273) (-829 "PENDTREE.spad" 1442083 1442093 1442439 1442444) (-828 "PDRING.spad" 1440574 1440584 1442063 1442078) (-827 "PDRING.spad" 1439073 1439085 1440564 1440569) (-826 "PDEPROB.spad" 1438030 1438038 1439063 1439068) (-825 "PDEPACK.spad" 1432032 1432040 1438020 1438025) (-824 "PDECOMP.spad" 1431494 1431511 1432022 1432027) (-823 "PDECAT.spad" 1429848 1429856 1431484 1431489) (-822 "PCOMP.spad" 1429699 1429712 1429838 1429843) (-821 "PBWLB.spad" 1428281 1428298 1429689 1429694) (-820 "PATTERN.spad" 1422712 1422722 1428271 1428276) (-819 "PATTERN2.spad" 1422448 1422460 1422702 1422707) (-818 "PATTERN1.spad" 1420750 1420766 1422438 1422443) (-817 "PATRES.spad" 1418297 1418309 1420740 1420745) (-816 "PATRES2.spad" 1417959 1417973 1418287 1418292) (-815 "PATMATCH.spad" 1416121 1416152 1417672 1417677) (-814 "PATMAB.spad" 1415546 1415556 1416111 1416116) (-813 "PATLRES.spad" 1414630 1414644 1415536 1415541) (-812 "PATAB.spad" 1414394 1414404 1414620 1414625) (-811 "PARTPERM.spad" 1411756 1411764 1414384 1414389) (-810 "PARSURF.spad" 1411184 1411212 1411746 1411751) (-809 "PARSU2.spad" 1410979 1410995 1411174 1411179) (-808 "script-parser.spad" 1410499 1410507 1410969 1410974) (-807 "PARSCURV.spad" 1409927 1409955 1410489 1410494) (-806 "PARSC2.spad" 1409716 1409732 1409917 1409922) (-805 "PARPCURV.spad" 1409174 1409202 1409706 1409711) (-804 "PARPC2.spad" 1408963 1408979 1409164 1409169) (-803 "PAN2EXPR.spad" 1408375 1408383 1408953 1408958) (-802 "PALETTE.spad" 1407345 1407353 1408365 1408370) (-801 "PAIR.spad" 1406328 1406341 1406933 1406938) (-800 "PADICRC.spad" 1403661 1403679 1404836 1404929) (-799 "PADICRAT.spad" 1401679 1401691 1401900 1401993) (-798 "PADIC.spad" 1401374 1401386 1401605 1401674) (-797 "PADICCT.spad" 1399915 1399927 1401300 1401369) (-796 "PADEPAC.spad" 1398594 1398613 1399905 1399910) (-795 "PADE.spad" 1397334 1397350 1398584 1398589) (-794 "OWP.spad" 1396318 1396348 1397192 1397259) (-793 "OVAR.spad" 1396099 1396122 1396308 1396313) (-792 "OUT.spad" 1395183 1395191 1396089 1396094) (-791 "OUTFORM.spad" 1384597 1384605 1395173 1395178) (-790 "OSI.spad" 1384072 1384080 1384587 1384592) (-789 "ORTHPOL.spad" 1382533 1382543 1383989 1383994) (-788 "OREUP.spad" 1381893 1381921 1382215 1382254) (-787 "ORESUP.spad" 1381194 1381218 1381575 1381614) (-786 "OREPCTO.spad" 1379013 1379025 1381114 1381119) (-785 "OREPCAT.spad" 1373070 1373080 1378969 1379008) (-784 "OREPCAT.spad" 1367017 1367029 1372918 1372923) (-783 "ORDSET.spad" 1366183 1366191 1367007 1367012) (-782 "ORDSET.spad" 1365347 1365357 1366173 1366178) (-781 "ORDRING.spad" 1364737 1364745 1365327 1365342) (-780 "ORDRING.spad" 1364135 1364145 1364727 1364732) (-779 "ORDMON.spad" 1363990 1363998 1364125 1364130) (-778 "ORDFUNS.spad" 1363116 1363132 1363980 1363985) (-777 "ORDFIN.spad" 1363050 1363058 1363106 1363111) (-776 "ORDCOMP.spad" 1361518 1361528 1362600 1362629) (-775 "ORDCOMP2.spad" 1360803 1360815 1361508 1361513) (-774 "OPTPROB.spad" 1359383 1359391 1360793 1360798) (-773 "OPTPACK.spad" 1351768 1351776 1359373 1359378) (-772 "OPTCAT.spad" 1349443 1349451 1351758 1351763) (-771 "OPQUERY.spad" 1348992 1349000 1349433 1349438) (-770 "OP.spad" 1348734 1348744 1348814 1348881) (-769 "ONECOMP.spad" 1347482 1347492 1348284 1348313) (-768 "ONECOMP2.spad" 1346900 1346912 1347472 1347477) (-767 "OMSERVER.spad" 1345902 1345910 1346890 1346895) (-766 "OMSAGG.spad" 1345678 1345688 1345846 1345897) (-765 "OMPKG.spad" 1344290 1344298 1345668 1345673) (-764 "OM.spad" 1343255 1343263 1344280 1344285) (-763 "OMLO.spad" 1342680 1342692 1343141 1343180) (-762 "OMEXPR.spad" 1342514 1342524 1342670 1342675) (-761 "OMERR.spad" 1342057 1342065 1342504 1342509) (-760 "OMERRK.spad" 1341091 1341099 1342047 1342052) (-759 "OMENC.spad" 1340435 1340443 1341081 1341086) (-758 "OMDEV.spad" 1334724 1334732 1340425 1340430) (-757 "OMCONN.spad" 1334133 1334141 1334714 1334719) (-756 "OINTDOM.spad" 1333896 1333904 1334059 1334128) (-755 "OFMONOID.spad" 1330083 1330093 1333886 1333891) (-754 "ODVAR.spad" 1329344 1329354 1330073 1330078) (-753 "ODR.spad" 1328792 1328818 1329156 1329305) (-752 "ODPOL.spad" 1326141 1326151 1326481 1326608) (-751 "ODP.spad" 1317667 1317687 1318040 1318169) (-750 "ODETOOLS.spad" 1316250 1316269 1317657 1317662) (-749 "ODESYS.spad" 1313900 1313917 1316240 1316245) (-748 "ODERTRIC.spad" 1309841 1309858 1313857 1313862) (-747 "ODERED.spad" 1309228 1309252 1309831 1309836) (-746 "ODERAT.spad" 1306779 1306796 1309218 1309223) (-745 "ODEPRRIC.spad" 1303670 1303692 1306769 1306774) (-744 "ODEPROB.spad" 1302869 1302877 1303660 1303665) (-743 "ODEPRIM.spad" 1300143 1300165 1302859 1302864) (-742 "ODEPAL.spad" 1299519 1299543 1300133 1300138) (-741 "ODEPACK.spad" 1286121 1286129 1299509 1299514) (-740 "ODEINT.spad" 1285552 1285568 1286111 1286116) (-739 "ODEIFTBL.spad" 1282947 1282955 1285542 1285547) (-738 "ODEEF.spad" 1278314 1278330 1282937 1282942) (-737 "ODECONST.spad" 1277833 1277851 1278304 1278309) (-736 "ODECAT.spad" 1276429 1276437 1277823 1277828) (-735 "OCT.spad" 1274576 1274586 1275292 1275331) (-734 "OCTCT2.spad" 1274220 1274241 1274566 1274571) (-733 "OC.spad" 1271994 1272004 1274176 1274215) (-732 "OC.spad" 1269494 1269506 1271678 1271683) (-731 "OCAMON.spad" 1269342 1269350 1269484 1269489) (-730 "OASGP.spad" 1269157 1269165 1269332 1269337) (-729 "OAMONS.spad" 1268677 1268685 1269147 1269152) (-728 "OAMON.spad" 1268538 1268546 1268667 1268672) (-727 "OAGROUP.spad" 1268400 1268408 1268528 1268533) (-726 "NUMTUBE.spad" 1267987 1268003 1268390 1268395) (-725 "NUMQUAD.spad" 1255849 1255857 1267977 1267982) (-724 "NUMODE.spad" 1246985 1246993 1255839 1255844) (-723 "NUMINT.spad" 1244543 1244551 1246975 1246980) (-722 "NUMFMT.spad" 1243383 1243391 1244533 1244538) (-721 "NUMERIC.spad" 1235456 1235466 1243189 1243194) (-720 "NTSCAT.spad" 1233946 1233962 1235412 1235451) (-719 "NTPOLFN.spad" 1233491 1233501 1233863 1233868) (-718 "NSUP.spad" 1226509 1226519 1231049 1231202) (-717 "NSUP2.spad" 1225901 1225913 1226499 1226504) (-716 "NSMP.spad" 1222100 1222119 1222408 1222535) (-715 "NREP.spad" 1220472 1220486 1222090 1222095) (-714 "NPCOEF.spad" 1219718 1219738 1220462 1220467) (-713 "NORMRETR.spad" 1219316 1219355 1219708 1219713) (-712 "NORMPK.spad" 1217218 1217237 1219306 1219311) (-711 "NORMMA.spad" 1216906 1216932 1217208 1217213) (-710 "NONE.spad" 1216647 1216655 1216896 1216901) (-709 "NONE1.spad" 1216323 1216333 1216637 1216642) (-708 "NODE1.spad" 1215792 1215808 1216313 1216318) (-707 "NNI.spad" 1214679 1214687 1215766 1215787) (-706 "NLINSOL.spad" 1213301 1213311 1214669 1214674) (-705 "NIPROB.spad" 1211784 1211792 1213291 1213296) (-704 "NFINTBAS.spad" 1209244 1209261 1211774 1211779) (-703 "NCODIV.spad" 1207442 1207458 1209234 1209239) (-702 "NCNTFRAC.spad" 1207084 1207098 1207432 1207437) (-701 "NCEP.spad" 1205244 1205258 1207074 1207079) (-700 "NASRING.spad" 1204840 1204848 1205234 1205239) (-699 "NASRING.spad" 1204434 1204444 1204830 1204835) (-698 "NARNG.spad" 1203778 1203786 1204424 1204429) (-697 "NARNG.spad" 1203120 1203130 1203768 1203773) (-696 "NAGSP.spad" 1202193 1202201 1203110 1203115) (-695 "NAGS.spad" 1191718 1191726 1202183 1202188) (-694 "NAGF07.spad" 1190111 1190119 1191708 1191713) (-693 "NAGF04.spad" 1184343 1184351 1190101 1190106) (-692 "NAGF02.spad" 1178152 1178160 1184333 1184338) (-691 "NAGF01.spad" 1173755 1173763 1178142 1178147) (-690 "NAGE04.spad" 1167215 1167223 1173745 1173750) (-689 "NAGE02.spad" 1157557 1157565 1167205 1167210) (-688 "NAGE01.spad" 1153441 1153449 1157547 1157552) (-687 "NAGD03.spad" 1151361 1151369 1153431 1153436) (-686 "NAGD02.spad" 1143892 1143900 1151351 1151356) (-685 "NAGD01.spad" 1138005 1138013 1143882 1143887) (-684 "NAGC06.spad" 1133792 1133800 1137995 1138000) (-683 "NAGC05.spad" 1132261 1132269 1133782 1133787) (-682 "NAGC02.spad" 1131516 1131524 1132251 1132256) (-681 "NAALG.spad" 1131051 1131061 1131484 1131511) (-680 "NAALG.spad" 1130606 1130618 1131041 1131046) (-679 "MULTSQFR.spad" 1127564 1127581 1130596 1130601) (-678 "MULTFACT.spad" 1126947 1126964 1127554 1127559) (-677 "MTSCAT.spad" 1124981 1125002 1126845 1126942) (-676 "MTHING.spad" 1124638 1124648 1124971 1124976) (-675 "MSYSCMD.spad" 1124072 1124080 1124628 1124633) (-674 "MSET.spad" 1122014 1122024 1123778 1123817) (-673 "MSETAGG.spad" 1121847 1121857 1121970 1122009) (-672 "MRING.spad" 1118818 1118830 1121555 1121622) (-671 "MRF2.spad" 1118386 1118400 1118808 1118813) (-670 "MRATFAC.spad" 1117932 1117949 1118376 1118381) (-669 "MPRFF.spad" 1115962 1115981 1117922 1117927) (-668 "MPOLY.spad" 1113400 1113415 1113759 1113886) (-667 "MPCPF.spad" 1112664 1112683 1113390 1113395) (-666 "MPC3.spad" 1112479 1112519 1112654 1112659) (-665 "MPC2.spad" 1112121 1112154 1112469 1112474) (-664 "MONOTOOL.spad" 1110456 1110473 1112111 1112116) (-663 "MONOID.spad" 1109630 1109638 1110446 1110451) (-662 "MONOID.spad" 1108802 1108812 1109620 1109625) (-661 "MONOGEN.spad" 1107548 1107561 1108662 1108797) (-660 "MONOGEN.spad" 1106316 1106331 1107432 1107437) (-659 "MONADWU.spad" 1104330 1104338 1106306 1106311) (-658 "MONADWU.spad" 1102342 1102352 1104320 1104325) (-657 "MONAD.spad" 1101486 1101494 1102332 1102337) (-656 "MONAD.spad" 1100628 1100638 1101476 1101481) (-655 "MOEBIUS.spad" 1099314 1099328 1100608 1100623) (-654 "MODULE.spad" 1099184 1099194 1099282 1099309) (-653 "MODULE.spad" 1099074 1099086 1099174 1099179) (-652 "MODRING.spad" 1098405 1098444 1099054 1099069) (-651 "MODOP.spad" 1097064 1097076 1098227 1098294) (-650 "MODMONOM.spad" 1096596 1096614 1097054 1097059) (-649 "MODMON.spad" 1093306 1093322 1094082 1094235) (-648 "MODFIELD.spad" 1092664 1092703 1093208 1093301) (-647 "MMAP.spad" 1092404 1092438 1092654 1092659) (-646 "MLO.spad" 1090831 1090841 1092360 1092399) (-645 "MLIFT.spad" 1089403 1089420 1090821 1090826) (-644 "MKUCFUNC.spad" 1088936 1088954 1089393 1089398) (-643 "MKRECORD.spad" 1088538 1088551 1088926 1088931) (-642 "MKFUNC.spad" 1087919 1087929 1088528 1088533) (-641 "MKFLCFN.spad" 1086875 1086885 1087909 1087914) (-640 "MKCHSET.spad" 1086651 1086661 1086865 1086870) (-639 "MKBCFUNC.spad" 1086136 1086154 1086641 1086646) (-638 "MINT.spad" 1085575 1085583 1086038 1086131) (-637 "MHROWRED.spad" 1084076 1084086 1085565 1085570) (-636 "MFLOAT.spad" 1082521 1082529 1083966 1084071) (-635 "MFINFACT.spad" 1081921 1081943 1082511 1082516) (-634 "MESH.spad" 1079653 1079661 1081911 1081916) (-633 "MDDFACT.spad" 1077846 1077856 1079643 1079648) (-632 "MDAGG.spad" 1077121 1077131 1077814 1077841) (-631 "MCMPLX.spad" 1073101 1073109 1073715 1073916) (-630 "MCDEN.spad" 1072309 1072321 1073091 1073096) (-629 "MCALCFN.spad" 1069411 1069437 1072299 1072304) (-628 "MATSTOR.spad" 1066687 1066697 1069401 1069406) (-627 "MATRIX.spad" 1065391 1065401 1065875 1065902) (-626 "MATLIN.spad" 1062717 1062741 1065275 1065280) (-625 "MATCAT.spad" 1054290 1054312 1062673 1062712) (-624 "MATCAT.spad" 1045747 1045771 1054132 1054137) (-623 "MATCAT2.spad" 1045015 1045063 1045737 1045742) (-622 "MAPPKG3.spad" 1043914 1043928 1045005 1045010) (-621 "MAPPKG2.spad" 1043248 1043260 1043904 1043909) (-620 "MAPPKG1.spad" 1042066 1042076 1043238 1043243) (-619 "MAPHACK3.spad" 1041874 1041888 1042056 1042061) (-618 "MAPHACK2.spad" 1041639 1041651 1041864 1041869) (-617 "MAPHACK1.spad" 1041269 1041279 1041629 1041634) (-616 "MAGMA.spad" 1039059 1039076 1041259 1041264) (-615 "M3D.spad" 1036757 1036767 1038439 1038444) (-614 "LZSTAGG.spad" 1033975 1033985 1036737 1036752) (-613 "LZSTAGG.spad" 1031201 1031213 1033965 1033970) (-612 "LWORD.spad" 1027906 1027923 1031191 1031196) (-611 "LSQM.spad" 1026134 1026148 1026532 1026583) (-610 "LSPP.spad" 1025667 1025684 1026124 1026129) (-609 "LSMP.spad" 1024507 1024535 1025657 1025662) (-608 "LSMP1.spad" 1022311 1022325 1024497 1024502) (-607 "LSAGG.spad" 1021968 1021978 1022267 1022306) (-606 "LSAGG.spad" 1021657 1021669 1021958 1021963) (-605 "LPOLY.spad" 1020611 1020630 1021513 1021582) (-604 "LPEFRAC.spad" 1019868 1019878 1020601 1020606) (-603 "LO.spad" 1019269 1019283 1019802 1019829) (-602 "LOGIC.spad" 1018871 1018879 1019259 1019264) (-601 "LOGIC.spad" 1018471 1018481 1018861 1018866) (-600 "LODOOPS.spad" 1017389 1017401 1018461 1018466) (-599 "LODO.spad" 1016775 1016791 1017071 1017110) (-598 "LODOF.spad" 1015819 1015836 1016732 1016737) (-597 "LODOCAT.spad" 1014477 1014487 1015775 1015814) (-596 "LODOCAT.spad" 1013133 1013145 1014433 1014438) (-595 "LODO2.spad" 1012408 1012420 1012815 1012854) (-594 "LODO1.spad" 1011810 1011820 1012090 1012129) (-593 "LODEEF.spad" 1010582 1010600 1011800 1011805) (-592 "LNAGG.spad" 1006374 1006384 1010562 1010577) (-591 "LNAGG.spad" 1002140 1002152 1006330 1006335) (-590 "LMOPS.spad" 998876 998893 1002130 1002135) (-589 "LMODULE.spad" 998518 998528 998866 998871) (-588 "LMDICT.spad" 997801 997811 998069 998096) (-587 "LIST.spad" 995519 995529 996948 996975) (-586 "LIST3.spad" 994810 994824 995509 995514) (-585 "LIST2.spad" 993450 993462 994800 994805) (-584 "LIST2MAP.spad" 990327 990339 993440 993445) (-583 "LINEXP.spad" 989759 989769 990307 990322) (-582 "LINDEP.spad" 988536 988548 989671 989676) (-581 "LIMITRF.spad" 986450 986460 988526 988531) (-580 "LIMITPS.spad" 985333 985346 986440 986445) (-579 "LIE.spad" 983347 983359 984623 984768) (-578 "LIECAT.spad" 982823 982833 983273 983342) (-577 "LIECAT.spad" 982327 982339 982779 982784) (-576 "LIB.spad" 980375 980383 980986 981001) (-575 "LGROBP.spad" 977728 977747 980365 980370) (-574 "LF.spad" 976647 976663 977718 977723) (-573 "LFCAT.spad" 975666 975674 976637 976642) (-572 "LEXTRIPK.spad" 971169 971184 975656 975661) (-571 "LEXP.spad" 969172 969199 971149 971164) (-570 "LEADCDET.spad" 967556 967573 969162 969167) (-569 "LAZM3PK.spad" 966260 966282 967546 967551) (-568 "LAUPOL.spad" 964951 964964 965855 965924) (-567 "LAPLACE.spad" 964524 964540 964941 964946) (-566 "LA.spad" 963964 963978 964446 964485) (-565 "LALG.spad" 963740 963750 963944 963959) (-564 "LALG.spad" 963524 963536 963730 963735) (-563 "KOVACIC.spad" 962237 962254 963514 963519) (-562 "KONVERT.spad" 961959 961969 962227 962232) (-561 "KOERCE.spad" 961696 961706 961949 961954) (-560 "KERNEL.spad" 960231 960241 961480 961485) (-559 "KERNEL2.spad" 959934 959946 960221 960226) (-558 "KDAGG.spad" 959025 959047 959902 959929) (-557 "KDAGG.spad" 958136 958160 959015 959020) (-556 "KAFILE.spad" 957099 957115 957334 957361) (-555 "JORDAN.spad" 954926 954938 956389 956534) (-554 "IXAGG.spad" 953039 953063 954906 954921) (-553 "IXAGG.spad" 951017 951043 952886 952891) (-552 "IVECTOR.spad" 949790 949805 949945 949972) (-551 "ITUPLE.spad" 948935 948945 949780 949785) (-550 "ITRIGMNP.spad" 947746 947765 948925 948930) (-549 "ITFUN3.spad" 947240 947254 947736 947741) (-548 "ITFUN2.spad" 946970 946982 947230 947235) (-547 "ITAYLOR.spad" 944762 944777 946806 946931) (-546 "ISUPS.spad" 937173 937188 943736 943833) (-545 "ISUMP.spad" 936670 936686 937163 937168) (-544 "ISTRING.spad" 935673 935686 935839 935866) (-543 "IRURPK.spad" 934386 934405 935663 935668) (-542 "IRSN.spad" 932346 932354 934376 934381) (-541 "IRRF2F.spad" 930821 930831 932302 932307) (-540 "IRREDFFX.spad" 930422 930433 930811 930816) (-539 "IROOT.spad" 928753 928763 930412 930417) (-538 "IR.spad" 926543 926557 928609 928636) (-537 "IR2.spad" 925563 925579 926533 926538) (-536 "IR2F.spad" 924763 924779 925553 925558) (-535 "IPRNTPK.spad" 924523 924531 924753 924758) (-534 "IPF.spad" 924088 924100 924328 924421) (-533 "IPADIC.spad" 923849 923875 924014 924083) (-532 "INVLAPLA.spad" 923494 923510 923839 923844) (-531 "INTTR.spad" 916740 916757 923484 923489) (-530 "INTTOOLS.spad" 914452 914468 916315 916320) (-529 "INTSLPE.spad" 913758 913766 914442 914447) (-528 "INTRVL.spad" 913324 913334 913672 913753) (-527 "INTRF.spad" 911688 911702 913314 913319) (-526 "INTRET.spad" 911120 911130 911678 911683) (-525 "INTRAT.spad" 909795 909812 911110 911115) (-524 "INTPM.spad" 908158 908174 909438 909443) (-523 "INTPAF.spad" 905926 905944 908090 908095) (-522 "INTPACK.spad" 896236 896244 905916 905921) (-521 "INT.spad" 895597 895605 896090 896231) (-520 "INTHERTR.spad" 894863 894880 895587 895592) (-519 "INTHERAL.spad" 894529 894553 894853 894858) (-518 "INTHEORY.spad" 890942 890950 894519 894524) (-517 "INTG0.spad" 884405 884423 890874 890879) (-516 "INTFTBL.spad" 878434 878442 884395 884400) (-515 "INTFACT.spad" 877493 877503 878424 878429) (-514 "INTEF.spad" 875808 875824 877483 877488) (-513 "INTDOM.spad" 874423 874431 875734 875803) (-512 "INTDOM.spad" 873100 873110 874413 874418) (-511 "INTCAT.spad" 871353 871363 873014 873095) (-510 "INTBIT.spad" 870856 870864 871343 871348) (-509 "INTALG.spad" 870038 870065 870846 870851) (-508 "INTAF.spad" 869530 869546 870028 870033) (-507 "INTABL.spad" 868048 868079 868211 868238) (-506 "INS.spad" 865444 865452 867950 868043) (-505 "INS.spad" 862926 862936 865434 865439) (-504 "INPSIGN.spad" 862360 862373 862916 862921) (-503 "INPRODPF.spad" 861426 861445 862350 862355) (-502 "INPRODFF.spad" 860484 860508 861416 861421) (-501 "INNMFACT.spad" 859455 859472 860474 860479) (-500 "INMODGCD.spad" 858939 858969 859445 859450) (-499 "INFSP.spad" 857224 857246 858929 858934) (-498 "INFPROD0.spad" 856274 856293 857214 857219) (-497 "INFORM.spad" 853542 853550 856264 856269) (-496 "INFORM1.spad" 853167 853177 853532 853537) (-495 "INFINITY.spad" 852719 852727 853157 853162) (-494 "INEP.spad" 851251 851273 852709 852714) (-493 "INDE.spad" 851157 851174 851241 851246) (-492 "INCRMAPS.spad" 850578 850588 851147 851152) (-491 "INBFF.spad" 846348 846359 850568 850573) (-490 "IMATRIX.spad" 845293 845319 845805 845832) (-489 "IMATQF.spad" 844387 844431 845249 845254) (-488 "IMATLIN.spad" 842992 843016 844343 844348) (-487 "ILIST.spad" 841648 841663 842175 842202) (-486 "IIARRAY2.spad" 841036 841074 841255 841282) (-485 "IFF.spad" 840446 840462 840717 840810) (-484 "IFARRAY.spad" 837933 837948 839629 839656) (-483 "IFAMON.spad" 837795 837812 837889 837894) (-482 "IEVALAB.spad" 837184 837196 837785 837790) (-481 "IEVALAB.spad" 836571 836585 837174 837179) (-480 "IDPO.spad" 836369 836381 836561 836566) (-479 "IDPOAMS.spad" 836125 836137 836359 836364) (-478 "IDPOAM.spad" 835845 835857 836115 836120) (-477 "IDPC.spad" 834779 834791 835835 835840) (-476 "IDPAM.spad" 834524 834536 834769 834774) (-475 "IDPAG.spad" 834271 834283 834514 834519) (-474 "IDECOMP.spad" 831508 831526 834261 834266) (-473 "IDEAL.spad" 826431 826470 831443 831448) (-472 "ICDEN.spad" 825582 825598 826421 826426) (-471 "ICARD.spad" 824771 824779 825572 825577) (-470 "IBPTOOLS.spad" 823364 823381 824761 824766) (-469 "IBITS.spad" 822563 822576 823000 823027) (-468 "IBATOOL.spad" 819438 819457 822553 822558) (-467 "IBACHIN.spad" 817925 817940 819428 819433) (-466 "IARRAY2.spad" 816913 816939 817532 817559) (-465 "IARRAY1.spad" 815958 815973 816096 816123) (-464 "IAN.spad" 814173 814181 815776 815869) (-463 "IALGFACT.spad" 813774 813807 814163 814168) (-462 "HYPCAT.spad" 813198 813206 813764 813769) (-461 "HYPCAT.spad" 812620 812630 813188 813193) (-460 "HOAGG.spad" 809878 809888 812600 812615) (-459 "HOAGG.spad" 806921 806933 809645 809650) (-458 "HEXADEC.spad" 804793 804801 805391 805484) (-457 "HEUGCD.spad" 803808 803819 804783 804788) (-456 "HELLFDIV.spad" 803398 803422 803798 803803) (-455 "HEAP.spad" 802790 802800 803005 803032) (-454 "HDP.spad" 794312 794328 794689 794818) (-453 "HDMP.spad" 791491 791506 792109 792236) (-452 "HB.spad" 789728 789736 791481 791486) (-451 "HASHTBL.spad" 788198 788229 788409 788436) (-450 "HACKPI.spad" 787681 787689 788100 788193) (-449 "GTSET.spad" 786620 786636 787327 787354) (-448 "GSTBL.spad" 785139 785174 785313 785328) (-447 "GSERIES.spad" 782306 782333 783271 783420) (-446 "GROUP.spad" 781480 781488 782286 782301) (-445 "GROUP.spad" 780662 780672 781470 781475) (-444 "GROEBSOL.spad" 779150 779171 780652 780657) (-443 "GRMOD.spad" 777721 777733 779140 779145) (-442 "GRMOD.spad" 776290 776304 777711 777716) (-441 "GRIMAGE.spad" 768895 768903 776280 776285) (-440 "GRDEF.spad" 767274 767282 768885 768890) (-439 "GRAY.spad" 765733 765741 767264 767269) (-438 "GRALG.spad" 764780 764792 765723 765728) (-437 "GRALG.spad" 763825 763839 764770 764775) (-436 "GPOLSET.spad" 763279 763302 763507 763534) (-435 "GOSPER.spad" 762544 762562 763269 763274) (-434 "GMODPOL.spad" 761682 761709 762512 762539) (-433 "GHENSEL.spad" 760751 760765 761672 761677) (-432 "GENUPS.spad" 756852 756865 760741 760746) (-431 "GENUFACT.spad" 756429 756439 756842 756847) (-430 "GENPGCD.spad" 756013 756030 756419 756424) (-429 "GENMFACT.spad" 755465 755484 756003 756008) (-428 "GENEEZ.spad" 753404 753417 755455 755460) (-427 "GDMP.spad" 750425 750442 751201 751328) (-426 "GCNAALG.spad" 744320 744347 750219 750286) (-425 "GCDDOM.spad" 743492 743500 744246 744315) (-424 "GCDDOM.spad" 742726 742736 743482 743487) (-423 "GB.spad" 740244 740282 742682 742687) (-422 "GBINTERN.spad" 736264 736302 740234 740239) (-421 "GBF.spad" 732021 732059 736254 736259) (-420 "GBEUCLID.spad" 729895 729933 732011 732016) (-419 "GAUSSFAC.spad" 729192 729200 729885 729890) (-418 "GALUTIL.spad" 727514 727524 729148 729153) (-417 "GALPOLYU.spad" 725960 725973 727504 727509) (-416 "GALFACTU.spad" 724125 724144 725950 725955) (-415 "GALFACT.spad" 714258 714269 724115 724120) (-414 "FVFUN.spad" 711271 711279 714238 714253) (-413 "FVC.spad" 710313 710321 711251 711266) (-412 "FUNCTION.spad" 710162 710174 710303 710308) (-411 "FT.spad" 708374 708382 710152 710157) (-410 "FTEM.spad" 707537 707545 708364 708369) (-409 "FSUPFACT.spad" 706438 706457 707474 707479) (-408 "FST.spad" 704524 704532 706428 706433) (-407 "FSRED.spad" 704002 704018 704514 704519) (-406 "FSPRMELT.spad" 702826 702842 703959 703964) (-405 "FSPECF.spad" 700903 700919 702816 702821) (-404 "FS.spad" 694954 694964 700667 700898) (-403 "FS.spad" 688796 688808 694511 694516) (-402 "FSINT.spad" 688454 688470 688786 688791) (-401 "FSERIES.spad" 687641 687653 688274 688373) (-400 "FSCINT.spad" 686954 686970 687631 687636) (-399 "FSAGG.spad" 686059 686069 686898 686949) (-398 "FSAGG.spad" 685138 685150 685979 685984) (-397 "FSAGG2.spad" 683837 683853 685128 685133) (-396 "FS2UPS.spad" 678226 678260 683827 683832) (-395 "FS2.spad" 677871 677887 678216 678221) (-394 "FS2EXPXP.spad" 676994 677017 677861 677866) (-393 "FRUTIL.spad" 675936 675946 676984 676989) (-392 "FR.spad" 669633 669643 674963 675032) (-391 "FRNAALG.spad" 664720 664730 669575 669628) (-390 "FRNAALG.spad" 659819 659831 664676 664681) (-389 "FRNAAF2.spad" 659273 659291 659809 659814) (-388 "FRMOD.spad" 658668 658698 659205 659210) (-387 "FRIDEAL.spad" 657863 657884 658648 658663) (-386 "FRIDEAL2.spad" 657465 657497 657853 657858) (-385 "FRETRCT.spad" 656976 656986 657455 657460) (-384 "FRETRCT.spad" 656355 656367 656836 656841) (-383 "FRAMALG.spad" 654683 654696 656311 656350) (-382 "FRAMALG.spad" 653043 653058 654673 654678) (-381 "FRAC.spad" 650146 650156 650549 650722) (-380 "FRAC2.spad" 649749 649761 650136 650141) (-379 "FR2.spad" 649083 649095 649739 649744) (-378 "FPS.spad" 645892 645900 648973 649078) (-377 "FPS.spad" 642729 642739 645812 645817) (-376 "FPC.spad" 641771 641779 642631 642724) (-375 "FPC.spad" 640899 640909 641761 641766) (-374 "FPATMAB.spad" 640651 640661 640879 640894) (-373 "FPARFRAC.spad" 639124 639141 640641 640646) (-372 "FORTRAN.spad" 637630 637673 639114 639119) (-371 "FORT.spad" 636559 636567 637620 637625) (-370 "FORTFN.spad" 633719 633727 636539 636554) (-369 "FORTCAT.spad" 633393 633401 633699 633714) (-368 "FORMULA.spad" 630731 630739 633383 633388) (-367 "FORMULA1.spad" 630210 630220 630721 630726) (-366 "FORDER.spad" 629901 629925 630200 630205) (-365 "FOP.spad" 629102 629110 629891 629896) (-364 "FNLA.spad" 628526 628548 629070 629097) (-363 "FNCAT.spad" 626854 626862 628516 628521) (-362 "FNAME.spad" 626746 626754 626844 626849) (-361 "FMTC.spad" 626544 626552 626672 626741) (-360 "FMONOID.spad" 623599 623609 626500 626505) (-359 "FM.spad" 623294 623306 623533 623560) (-358 "FMFUN.spad" 620314 620322 623274 623289) (-357 "FMC.spad" 619356 619364 620294 620309) (-356 "FMCAT.spad" 617010 617028 619324 619351) (-355 "FM1.spad" 616367 616379 616944 616971) (-354 "FLOATRP.spad" 614088 614102 616357 616362) (-353 "FLOAT.spad" 607252 607260 613954 614083) (-352 "FLOATCP.spad" 604669 604683 607242 607247) (-351 "FLINEXP.spad" 604381 604391 604649 604664) (-350 "FLINEXP.spad" 604047 604059 604317 604322) (-349 "FLASORT.spad" 603367 603379 604037 604042) (-348 "FLALG.spad" 601013 601032 603293 603362) (-347 "FLAGG.spad" 598019 598029 600981 601008) (-346 "FLAGG.spad" 594938 594950 597902 597907) (-345 "FLAGG2.spad" 593619 593635 594928 594933) (-344 "FINRALG.spad" 591648 591661 593575 593614) (-343 "FINRALG.spad" 589603 589618 591532 591537) (-342 "FINITE.spad" 588755 588763 589593 589598) (-341 "FINAALG.spad" 577736 577746 588697 588750) (-340 "FINAALG.spad" 566729 566741 577692 577697) (-339 "FILE.spad" 566312 566322 566719 566724) (-338 "FILECAT.spad" 564830 564847 566302 566307) (-337 "FIELD.spad" 564236 564244 564732 564825) (-336 "FIELD.spad" 563728 563738 564226 564231) (-335 "FGROUP.spad" 562337 562347 563708 563723) (-334 "FGLMICPK.spad" 561124 561139 562327 562332) (-333 "FFX.spad" 560499 560514 560840 560933) (-332 "FFSLPE.spad" 559988 560009 560489 560494) (-331 "FFPOLY.spad" 551240 551251 559978 559983) (-330 "FFPOLY2.spad" 550300 550317 551230 551235) (-329 "FFP.spad" 549697 549717 550016 550109) (-328 "FF.spad" 549145 549161 549378 549471) (-327 "FFNBX.spad" 547657 547677 548861 548954) (-326 "FFNBP.spad" 546170 546187 547373 547466) (-325 "FFNB.spad" 544635 544656 545851 545944) (-324 "FFINTBAS.spad" 542049 542068 544625 544630) (-323 "FFIELDC.spad" 539624 539632 541951 542044) (-322 "FFIELDC.spad" 537285 537295 539614 539619) (-321 "FFHOM.spad" 536033 536050 537275 537280) (-320 "FFF.spad" 533468 533479 536023 536028) (-319 "FFCGX.spad" 532315 532335 533184 533277) (-318 "FFCGP.spad" 531204 531224 532031 532124) (-317 "FFCG.spad" 529996 530017 530885 530978) (-316 "FFCAT.spad" 522897 522919 529835 529991) (-315 "FFCAT.spad" 515877 515901 522817 522822) (-314 "FFCAT2.spad" 515622 515662 515867 515872) (-313 "FEXPR.spad" 507335 507381 515382 515421) (-312 "FEVALAB.spad" 507041 507051 507325 507330) (-311 "FEVALAB.spad" 506532 506544 506818 506823) (-310 "FDIV.spad" 505974 505998 506522 506527) (-309 "FDIVCAT.spad" 504016 504040 505964 505969) (-308 "FDIVCAT.spad" 502056 502082 504006 504011) (-307 "FDIV2.spad" 501710 501750 502046 502051) (-306 "FCPAK1.spad" 500263 500271 501700 501705) (-305 "FCOMP.spad" 499642 499652 500253 500258) (-304 "FC.spad" 489467 489475 499632 499637) (-303 "FAXF.spad" 482402 482416 489369 489462) (-302 "FAXF.spad" 475389 475405 482358 482363) (-301 "FARRAY.spad" 473535 473545 474572 474599) (-300 "FAMR.spad" 471655 471667 473433 473530) (-299 "FAMR.spad" 469759 469773 471539 471544) (-298 "FAMONOID.spad" 469409 469419 469713 469718) (-297 "FAMONC.spad" 467631 467643 469399 469404) (-296 "FAGROUP.spad" 467237 467247 467527 467554) (-295 "FACUTIL.spad" 465433 465450 467227 467232) (-294 "FACTFUNC.spad" 464609 464619 465423 465428) (-293 "EXPUPXS.spad" 461442 461465 462741 462890) (-292 "EXPRTUBE.spad" 458670 458678 461432 461437) (-291 "EXPRODE.spad" 455542 455558 458660 458665) (-290 "EXPR.spad" 450844 450854 451558 451961) (-289 "EXPR2UPS.spad" 446936 446949 450834 450839) (-288 "EXPR2.spad" 446639 446651 446926 446931) (-287 "EXPEXPAN.spad" 443580 443605 444214 444307) (-286 "EXIT.spad" 443251 443259 443570 443575) (-285 "EVALCYC.spad" 442709 442723 443241 443246) (-284 "EVALAB.spad" 442273 442283 442699 442704) (-283 "EVALAB.spad" 441835 441847 442263 442268) (-282 "EUCDOM.spad" 439377 439385 441761 441830) (-281 "EUCDOM.spad" 436981 436991 439367 439372) (-280 "ESTOOLS.spad" 428821 428829 436971 436976) (-279 "ESTOOLS2.spad" 428422 428436 428811 428816) (-278 "ESTOOLS1.spad" 428107 428118 428412 428417) (-277 "ES.spad" 420654 420662 428097 428102) (-276 "ES.spad" 413109 413119 420554 420559) (-275 "ESCONT.spad" 409882 409890 413099 413104) (-274 "ESCONT1.spad" 409631 409643 409872 409877) (-273 "ES2.spad" 409126 409142 409621 409626) (-272 "ES1.spad" 408692 408708 409116 409121) (-271 "ERROR.spad" 406013 406021 408682 408687) (-270 "EQTBL.spad" 404485 404507 404694 404721) (-269 "EQ.spad" 399369 399379 402168 402277) (-268 "EQ2.spad" 399085 399097 399359 399364) (-267 "EP.spad" 395399 395409 399075 399080) (-266 "ENV.spad" 394101 394109 395389 395394) (-265 "ENTIRER.spad" 393769 393777 394045 394096) (-264 "EMR.spad" 392970 393011 393695 393764) (-263 "ELTAGG.spad" 391210 391229 392960 392965) (-262 "ELTAGG.spad" 389414 389435 391166 391171) (-261 "ELTAB.spad" 388861 388879 389404 389409) (-260 "ELFUTS.spad" 388240 388259 388851 388856) (-259 "ELEMFUN.spad" 387929 387937 388230 388235) (-258 "ELEMFUN.spad" 387616 387626 387919 387924) (-257 "ELAGG.spad" 385547 385557 387584 387611) (-256 "ELAGG.spad" 383427 383439 385466 385471) (-255 "EFUPXS.spad" 380203 380233 383383 383388) (-254 "EFULS.spad" 377039 377062 380159 380164) (-253 "EFSTRUC.spad" 374994 375010 377029 377034) (-252 "EF.spad" 369760 369776 374984 374989) (-251 "EAB.spad" 368036 368044 369750 369755) (-250 "E04UCFA.spad" 367572 367580 368026 368031) (-249 "E04NAFA.spad" 367149 367157 367562 367567) (-248 "E04MBFA.spad" 366729 366737 367139 367144) (-247 "E04JAFA.spad" 366265 366273 366719 366724) (-246 "E04GCFA.spad" 365801 365809 366255 366260) (-245 "E04FDFA.spad" 365337 365345 365791 365796) (-244 "E04DGFA.spad" 364873 364881 365327 365332) (-243 "E04AGNT.spad" 360715 360723 364863 364868) (-242 "DVARCAT.spad" 357400 357410 360705 360710) (-241 "DVARCAT.spad" 354083 354095 357390 357395) (-240 "DSMP.spad" 351517 351531 351822 351949) (-239 "DROPT.spad" 345462 345470 351507 351512) (-238 "DROPT1.spad" 345125 345135 345452 345457) (-237 "DROPT0.spad" 339952 339960 345115 345120) (-236 "DRAWPT.spad" 338107 338115 339942 339947) (-235 "DRAW.spad" 330707 330720 338097 338102) (-234 "DRAWHACK.spad" 330015 330025 330697 330702) (-233 "DRAWCX.spad" 327457 327465 330005 330010) (-232 "DRAWCURV.spad" 326994 327009 327447 327452) (-231 "DRAWCFUN.spad" 316166 316174 326984 326989) (-230 "DQAGG.spad" 314322 314332 316122 316161) (-229 "DPOLCAT.spad" 309663 309679 314190 314317) (-228 "DPOLCAT.spad" 305090 305108 309619 309624) (-227 "DPMO.spad" 299077 299093 299215 299511) (-226 "DPMM.spad" 293077 293095 293202 293498) (-225 "domain.spad" 292348 292356 293067 293072) (-224 "DMP.spad" 289573 289588 290145 290272) (-223 "DLP.spad" 288921 288931 289563 289568) (-222 "DLIST.spad" 287333 287343 288104 288131) (-221 "DLAGG.spad" 285734 285744 287313 287328) (-220 "DIVRING.spad" 285181 285189 285678 285729) (-219 "DIVRING.spad" 284672 284682 285171 285176) (-218 "DISPLAY.spad" 282852 282860 284662 284667) (-217 "DIRPROD.spad" 274111 274127 274751 274880) (-216 "DIRPROD2.spad" 272919 272937 274101 274106) (-215 "DIRPCAT.spad" 271851 271867 272773 272914) (-214 "DIRPCAT.spad" 270523 270541 271447 271452) (-213 "DIOSP.spad" 269348 269356 270513 270518) (-212 "DIOPS.spad" 268320 268330 269316 269343) (-211 "DIOPS.spad" 267278 267290 268276 268281) (-210 "DIFRING.spad" 266570 266578 267258 267273) (-209 "DIFRING.spad" 265870 265880 266560 266565) (-208 "DIFEXT.spad" 265029 265039 265850 265865) (-207 "DIFEXT.spad" 264105 264117 264928 264933) (-206 "DIAGG.spad" 263723 263733 264073 264100) (-205 "DIAGG.spad" 263361 263373 263713 263718) (-204 "DHMATRIX.spad" 261665 261675 262818 262845) (-203 "DFSFUN.spad" 255073 255081 261655 261660) (-202 "DFLOAT.spad" 251596 251604 254963 255068) (-201 "DFINTTLS.spad" 249805 249821 251586 251591) (-200 "DERHAM.spad" 247715 247747 249785 249800) (-199 "DEQUEUE.spad" 247033 247043 247322 247349) (-198 "DEGRED.spad" 246648 246662 247023 247028) (-197 "DEFINTRF.spad" 244173 244183 246638 246643) (-196 "DEFINTEF.spad" 242669 242685 244163 244168) (-195 "DECIMAL.spad" 240553 240561 241139 241232) (-194 "DDFACT.spad" 238352 238369 240543 240548) (-193 "DBLRESP.spad" 237950 237974 238342 238347) (-192 "DBASE.spad" 236522 236532 237940 237945) (-191 "D03FAFA.spad" 236350 236358 236512 236517) (-190 "D03EEFA.spad" 236170 236178 236340 236345) (-189 "D03AGNT.spad" 235250 235258 236160 236165) (-188 "D02EJFA.spad" 234712 234720 235240 235245) (-187 "D02CJFA.spad" 234190 234198 234702 234707) (-186 "D02BHFA.spad" 233680 233688 234180 234185) (-185 "D02BBFA.spad" 233170 233178 233670 233675) (-184 "D02AGNT.spad" 227974 227982 233160 233165) (-183 "D01WGTS.spad" 226293 226301 227964 227969) (-182 "D01TRNS.spad" 226270 226278 226283 226288) (-181 "D01GBFA.spad" 225792 225800 226260 226265) (-180 "D01FCFA.spad" 225314 225322 225782 225787) (-179 "D01ASFA.spad" 224782 224790 225304 225309) (-178 "D01AQFA.spad" 224228 224236 224772 224777) (-177 "D01APFA.spad" 223652 223660 224218 224223) (-176 "D01ANFA.spad" 223146 223154 223642 223647) (-175 "D01AMFA.spad" 222656 222664 223136 223141) (-174 "D01ALFA.spad" 222196 222204 222646 222651) (-173 "D01AKFA.spad" 221722 221730 222186 222191) (-172 "D01AJFA.spad" 221245 221253 221712 221717) (-171 "D01AGNT.spad" 217304 217312 221235 221240) (-170 "CYCLOTOM.spad" 216810 216818 217294 217299) (-169 "CYCLES.spad" 213642 213650 216800 216805) (-168 "CVMP.spad" 213059 213069 213632 213637) (-167 "CTRIGMNP.spad" 211549 211565 213049 213054) (-166 "CTORCALL.spad" 211137 211145 211539 211544) (-165 "CSTTOOLS.spad" 210380 210393 211127 211132) (-164 "CRFP.spad" 204084 204097 210370 210375) (-163 "CRAPACK.spad" 203127 203137 204074 204079) (-162 "CPMATCH.spad" 202627 202642 203052 203057) (-161 "CPIMA.spad" 202332 202351 202617 202622) (-160 "COORDSYS.spad" 197225 197235 202322 202327) (-159 "CONTOUR.spad" 196627 196635 197215 197220) (-158 "CONTFRAC.spad" 192239 192249 196529 196622) (-157 "COMRING.spad" 191913 191921 192177 192234) (-156 "COMPPROP.spad" 191427 191435 191903 191908) (-155 "COMPLPAT.spad" 191194 191209 191417 191422) (-154 "COMPLEX.spad" 185227 185237 185471 185732) (-153 "COMPLEX2.spad" 184940 184952 185217 185222) (-152 "COMPFACT.spad" 184542 184556 184930 184935) (-151 "COMPCAT.spad" 182598 182608 184264 184537) (-150 "COMPCAT.spad" 180361 180373 182029 182034) (-149 "COMMUPC.spad" 180107 180125 180351 180356) (-148 "COMMONOP.spad" 179640 179648 180097 180102) (-147 "COMM.spad" 179449 179457 179630 179635) (-146 "COMBOPC.spad" 178354 178362 179439 179444) (-145 "COMBINAT.spad" 177099 177109 178344 178349) (-144 "COMBF.spad" 174467 174483 177089 177094) (-143 "COLOR.spad" 173304 173312 174457 174462) (-142 "CMPLXRT.spad" 173013 173030 173294 173299) (-141 "CLIP.spad" 169105 169113 173003 173008) (-140 "CLIF.spad" 167744 167760 169061 169100) (-139 "CLAGG.spad" 164219 164229 167724 167739) (-138 "CLAGG.spad" 160575 160587 164082 164087) (-137 "CINTSLPE.spad" 159900 159913 160565 160570) (-136 "CHVAR.spad" 157978 158000 159890 159895) (-135 "CHARZ.spad" 157893 157901 157958 157973) (-134 "CHARPOL.spad" 157401 157411 157883 157888) (-133 "CHARNZ.spad" 157154 157162 157381 157396) (-132 "CHAR.spad" 155044 155052 157144 157149) (-131 "CFCAT.spad" 154360 154368 155034 155039) (-130 "CDEN.spad" 153518 153532 154350 154355) (-129 "CCLASS.spad" 151667 151675 152929 152968) (-128 "CARTEN.spad" 146770 146794 151657 151662) (-127 "CARTEN2.spad" 146156 146183 146760 146765) (-126 "CARD.spad" 143445 143453 146130 146151) (-125 "CACHSET.spad" 143067 143075 143435 143440) (-124 "CABMON.spad" 142620 142628 143057 143062) (-123 "BTREE.spad" 141689 141699 142227 142254) (-122 "BTOURN.spad" 140692 140702 141296 141323) (-121 "BTCAT.spad" 140068 140078 140648 140687) (-120 "BTCAT.spad" 139476 139488 140058 140063) (-119 "BTAGG.spad" 138492 138500 139432 139471) (-118 "BTAGG.spad" 137540 137550 138482 138487) (-117 "BSTREE.spad" 136275 136285 137147 137174) (-116 "BRILL.spad" 134470 134481 136265 136270) (-115 "BRAGG.spad" 133384 133394 134450 134465) (-114 "BRAGG.spad" 132272 132284 133340 133345) (-113 "BPADICRT.spad" 130256 130268 130511 130604) (-112 "BPADIC.spad" 129920 129932 130182 130251) (-111 "BOUNDZRO.spad" 129576 129593 129910 129915) (-110 "BOP.spad" 125040 125048 129566 129571) (-109 "BOP1.spad" 122426 122436 124996 125001) (-108 "BOOLEAN.spad" 121679 121687 122416 122421) (-107 "BMODULE.spad" 121391 121403 121647 121674) (-106 "BITS.spad" 120810 120818 121027 121054) (-105 "BINFILE.spad" 120153 120161 120800 120805) (-104 "BINDING.spad" 119572 119580 120143 120148) (-103 "BINARY.spad" 117465 117473 118042 118135) (-102 "BGAGG.spad" 116650 116660 117433 117460) (-101 "BGAGG.spad" 115855 115867 116640 116645) (-100 "BFUNCT.spad" 115419 115427 115835 115850) (-99 "BEZOUT.spad" 114554 114580 115369 115374) (-98 "BBTREE.spad" 111374 111383 114161 114188) (-97 "BASTYPE.spad" 111047 111054 111364 111369) (-96 "BASTYPE.spad" 110718 110727 111037 111042) (-95 "BALFACT.spad" 110158 110170 110708 110713) (-94 "AUTOMOR.spad" 109605 109614 110138 110153) (-93 "ATTREG.spad" 106324 106331 109357 109600) (-92 "ATTRBUT.spad" 102347 102354 106304 106319) (-91 "ATRIG.spad" 101817 101824 102337 102342) (-90 "ATRIG.spad" 101285 101294 101807 101812) (-89 "ASTACK.spad" 100618 100627 100892 100919) (-88 "ASSOCEQ.spad" 99418 99429 100574 100579) (-87 "ASP9.spad" 98499 98512 99408 99413) (-86 "ASP8.spad" 97542 97555 98489 98494) (-85 "ASP80.spad" 96864 96877 97532 97537) (-84 "ASP7.spad" 96024 96037 96854 96859) (-83 "ASP78.spad" 95475 95488 96014 96019) (-82 "ASP77.spad" 94844 94857 95465 95470) (-81 "ASP74.spad" 93936 93949 94834 94839) (-80 "ASP73.spad" 93207 93220 93926 93931) (-79 "ASP6.spad" 91839 91852 93197 93202) (-78 "ASP55.spad" 90348 90361 91829 91834) (-77 "ASP50.spad" 88165 88178 90338 90343) (-76 "ASP4.spad" 87460 87473 88155 88160) (-75 "ASP49.spad" 86459 86472 87450 87455) (-74 "ASP42.spad" 84866 84905 86449 86454) (-73 "ASP41.spad" 83445 83484 84856 84861) (-72 "ASP35.spad" 82433 82446 83435 83440) (-71 "ASP34.spad" 81734 81747 82423 82428) (-70 "ASP33.spad" 81294 81307 81724 81729) (-69 "ASP31.spad" 80434 80447 81284 81289) (-68 "ASP30.spad" 79326 79339 80424 80429) (-67 "ASP29.spad" 78792 78805 79316 79321) (-66 "ASP28.spad" 70065 70078 78782 78787) (-65 "ASP27.spad" 68962 68975 70055 70060) (-64 "ASP24.spad" 68049 68062 68952 68957) (-63 "ASP20.spad" 67265 67278 68039 68044) (-62 "ASP1.spad" 66646 66659 67255 67260) (-61 "ASP19.spad" 61332 61345 66636 66641) (-60 "ASP12.spad" 60746 60759 61322 61327) (-59 "ASP10.spad" 60017 60030 60736 60741) (-58 "ARRAY2.spad" 59377 59386 59624 59651) (-57 "ARRAY1.spad" 58212 58221 58560 58587) (-56 "ARRAY12.spad" 56881 56892 58202 58207) (-55 "ARR2CAT.spad" 52531 52552 56837 56876) (-54 "ARR2CAT.spad" 48213 48236 52521 52526) (-53 "APPRULE.spad" 47457 47479 48203 48208) (-52 "APPLYORE.spad" 47072 47085 47447 47452) (-51 "ANY.spad" 45414 45421 47062 47067) (-50 "ANY1.spad" 44485 44494 45404 45409) (-49 "ANTISYM.spad" 42924 42940 44465 44480) (-48 "ANON.spad" 42837 42844 42914 42919) (-47 "AN.spad" 41140 41147 42655 42748) (-46 "AMR.spad" 39319 39330 41038 41135) (-45 "AMR.spad" 37335 37348 39056 39061) (-44 "ALIST.spad" 34747 34768 35097 35124) (-43 "ALGSC.spad" 33870 33896 34619 34672) (-42 "ALGPKG.spad" 29579 29590 33826 33831) (-41 "ALGMFACT.spad" 28768 28782 29569 29574) (-40 "ALGMANIP.spad" 26189 26204 28566 28571) (-39 "ALGFF.spad" 24507 24534 24724 24880) (-38 "ALGFACT.spad" 23628 23638 24497 24502) (-37 "ALGEBRA.spad" 23359 23368 23584 23623) (-36 "ALGEBRA.spad" 23122 23133 23349 23354) (-35 "ALAGG.spad" 22620 22641 23078 23117) (-34 "AHYP.spad" 22001 22008 22610 22615) (-33 "AGG.spad" 20300 20307 21981 21996) (-32 "AGG.spad" 18573 18582 20256 20261) (-31 "AF.spad" 16999 17014 18509 18514) (-30 "ACPLOT.spad" 15570 15577 16989 16994) (-29 "ACFS.spad" 13309 13318 15460 15565) (-28 "ACFS.spad" 11146 11157 13299 13304) (-27 "ACF.spad" 7748 7755 11048 11141) (-26 "ACF.spad" 4436 4445 7738 7743) (-25 "ABELSG.spad" 3977 3984 4426 4431) (-24 "ABELSG.spad" 3516 3525 3967 3972) (-23 "ABELMON.spad" 3059 3066 3506 3511) (-22 "ABELMON.spad" 2600 2609 3049 3054) (-21 "ABELGRP.spad" 2172 2179 2590 2595) (-20 "ABELGRP.spad" 1742 1751 2162 2167) (-19 "A1AGG.spad" 870 879 1698 1737) (-18 "A1AGG.spad" 30 41 860 865)) 
+\ No newline at end of file
author	dos-reis <gdr@axiomatics.org>	2008-01-20 21:17:21 +0000
committer	dos-reis <gdr@axiomatics.org>	2008-01-20 21:17:21 +0000
commit	92db1817aed73ac8a38e9d3070a021d7153ca1ba (patch)
tree	1e59d7655578549ff3d3f45084d9f657cd730572 /src/share/algebra/browse.daase
parent	7fc5f46ef3c26ff7b1c5a5876736f9a1c27c3c13 (diff)
download	open-axiom-92db1817aed73ac8a38e9d3070a021d7153ca1ba.tar.gz