author: dos-reis <gdr@axiomatics.org> 2010-11-19 00:57:55 +0000
committer: dos-reis <gdr@axiomatics.org> 2010-11-19 00:57:55 +0000
commit: 32a0482710c76733805bca604c2089c231cd733f (patch)
tree: d1fbac95b8b029d2d789b41fcb3770e1b16fb72a /src/share/algebra/browse.daase
parent: 1b31c2ee8c940986d448dfc226b00fc6f6af6639 (diff)
download: open-axiom-32a0482710c76733805bca604c2089c231cd733f.tar.gz
1 files changed, 185 insertions, 185 deletions
diff --git a/src/share/algebra/browse.daase b/src/share/algebra/browse.daase
index dc9722a4..3a87657e 100644
--- a/src/share/algebra/browse.daase
+++ b/src/share/algebra/browse.daase
@@ -1,5 +1,5 @@
 
-(2300691 . 3498909339)       
+(2300614 . 3499115852)       
 (-18 A S) 
 ((|constructor| (NIL "One-dimensional-array aggregates serves as models for one-dimensional arrays. Categorically,{} these aggregates are finite linear aggregates with the \\spadatt{shallowlyMutable} property,{} that is,{} any component of the array may be changed without affecting the identity of the overall array. Array data structures are typically represented by a fixed area in storage and therefore cannot efficiently grow or shrink on demand as can list structures (see however \\spadtype{FlexibleArray} for a data structure which is a cross between a list and an array). Iteration over,{} and access to,{} elements of arrays is extremely fast (and often can be optimized to open-code). Insertion and deletion however is generally slow since an entirely new data structure must be created for the result."))) 
 NIL 
@@ -56,7 +56,7 @@ NIL
 ((|constructor| (NIL "This domain represents the syntax for an add-expression.")) (|body| (((|SpadAst|) $) "base(\\spad{d}) returns the actual body of the add-domain expression \\spad{`d'}.")) (|base| (((|SpadAst|) $) "\\spad{base(d)} returns the base domain(\\spad{s}) of the add-domain expression."))) 
 NIL 
 NIL 
-(-32 R -2174) 
+(-32 R -2173) 
 ((|constructor| (NIL "This package provides algebraic functions over an integral domain.")) (|iroot| ((|#2| |#1| (|Integer|)) "\\spad{iroot(p, n)} should be a non-exported function.")) (|definingPolynomial| ((|#2| |#2|) "\\spad{definingPolynomial(f)} returns the defining polynomial of \\spad{f} as an element of \\spad{F}. Error: if \\spad{f} is not a kernel.")) (|minPoly| (((|SparseUnivariatePolynomial| |#2|) (|Kernel| |#2|)) "\\spad{minPoly(k)} returns the defining polynomial of \\spad{k}.")) (** ((|#2| |#2| (|Fraction| (|Integer|))) "\\spad{x ** q} is \\spad{x} raised to the rational power \\spad{q}.")) (|droot| (((|OutputForm|) (|List| |#2|)) "\\spad{droot(l)} should be a non-exported function.")) (|inrootof| ((|#2| (|SparseUnivariatePolynomial| |#2|) |#2|) "\\spad{inrootof(p, x)} should be a non-exported function.")) (|belong?| (((|Boolean|) (|BasicOperator|)) "\\spad{belong?(op)} is \\spad{true} if \\spad{op} is an algebraic operator,{} that is,{} an \\spad{n}th root or implicit algebraic operator.")) (|operator| (((|BasicOperator|) (|BasicOperator|)) "\\spad{operator(op)} returns a copy of \\spad{op} with the domain-dependent properties appropriate for \\spad{F}. Error: if \\spad{op} is not an algebraic operator,{} that is,{} an \\spad{n}th root or implicit algebraic operator.")) (|rootOf| ((|#2| (|SparseUnivariatePolynomial| |#2|) (|Symbol|)) "\\spad{rootOf(p, y)} returns \\spad{y} such that \\spad{p(y) = 0}. The object returned displays as \\spad{'y}."))) 
 NIL 
 ((|HasCategory| |#1| (LIST (QUOTE -1069) (QUOTE (-578))))) 
@@ -88,11 +88,11 @@ NIL
 ((|constructor| (NIL "Factorization of univariate polynomials with coefficients in \\spadtype{AlgebraicNumber}.")) (|doublyTransitive?| (((|Boolean|) |#1|) "\\spad{doublyTransitive?(p)} is \\spad{true} if \\spad{p} is irreducible over over the field \\spad{K} generated by its coefficients,{} and if \\spad{p(X) / (X - a)} is irreducible over \\spad{K(a)} where \\spad{p(a) = 0}.")) (|split| (((|Factored| |#1|) |#1|) "\\spad{split(p)} returns a prime factorisation of \\spad{p} over its splitting field.")) (|factor| (((|Factored| |#1|) |#1|) "\\spad{factor(p)} returns a prime factorisation of \\spad{p} over the field generated by its coefficients.") (((|Factored| |#1|) |#1| (|List| (|AlgebraicNumber|))) "\\spad{factor(p, [a1,...,an])} returns a prime factorisation of \\spad{p} over the field generated by its coefficients and a1,{}...,{}an."))) 
 NIL 
 NIL 
-(-40 -2174 UP UPUP -2027) 
+(-40 -2173 UP UPUP -3372) 
 ((|constructor| (NIL "Function field defined by \\spad{f}(\\spad{x},{} \\spad{y}) = 0.")) (|knownInfBasis| (((|Void|) (|NonNegativeInteger|)) "\\spad{knownInfBasis(n)} \\undocumented{}"))) 
 ((-4500 |has| (-421 |#2|) (-376)) (-4505 |has| (-421 |#2|) (-376)) (-4499 |has| (-421 |#2|) (-376)) ((-4509 "*") . T) (-4501 . T) (-4502 . T) (-4504 . T)) 
 ((|HasCategory| (-421 |#2|) (QUOTE (-147))) (|HasCategory| (-421 |#2|) (QUOTE (-149))) (|HasCategory| (-421 |#2|) (QUOTE (-362))) (-2225 (|HasCategory| (-421 |#2|) (QUOTE (-376))) (|HasCategory| (-421 |#2|) (QUOTE (-362)))) (|HasCategory| (-421 |#2|) (QUOTE (-376))) (|HasCategory| (-421 |#2|) (QUOTE (-381))) (-2225 (-12 (|HasCategory| (-421 |#2|) (QUOTE (-240))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (|HasCategory| (-421 |#2|) (QUOTE (-362)))) (-2225 (-12 (|HasCategory| (-421 |#2|) (QUOTE (-240))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (-12 (|HasCategory| (-421 |#2|) (QUOTE (-239))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (|HasCategory| (-421 |#2|) (QUOTE (-362)))) (-2225 (-12 (|HasCategory| (-421 |#2|) (LIST (QUOTE -927) (QUOTE (-1207)))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (-12 (|HasCategory| (-421 |#2|) (LIST (QUOTE -927) (QUOTE (-1207)))) (|HasCategory| (-421 |#2|) (QUOTE (-362))))) (-2225 (-12 (|HasCategory| (-421 |#2|) (LIST (QUOTE -927) (QUOTE (-1207)))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (-12 (|HasCategory| (-421 |#2|) (LIST (QUOTE -929) (QUOTE (-1207)))) (|HasCategory| (-421 |#2|) (QUOTE (-376))))) (|HasCategory| (-421 |#2|) (LIST (QUOTE -660) (QUOTE (-578)))) (-2225 (|HasCategory| (-421 |#2|) (LIST (QUOTE -1069) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (|HasCategory| (-421 |#2|) (LIST (QUOTE -1069) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasCategory| (-421 |#2|) (LIST (QUOTE -1069) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-381))) (-12 (|HasCategory| (-421 |#2|) (QUOTE (-239))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (-12 (|HasCategory| (-421 |#2|) (LIST (QUOTE -929) (QUOTE (-1207)))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (-12 (|HasCategory| (-421 |#2|) (QUOTE (-240))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (-12 (|HasCategory| (-421 |#2|) (LIST (QUOTE -927) (QUOTE (-1207)))) (|HasCategory| (-421 |#2|) (QUOTE (-376))))) 
-(-41 R -2174) 
+(-41 R -2173) 
 ((|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 (-466))) (|HasCategory| |#1| (LIST (QUOTE -1069) (QUOTE (-578)))) (|HasCategory| |#2| (LIST (QUOTE -444) (|devaluate| |#1|))))) 
@@ -111,7 +111,7 @@ NIL
 (-45 |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."))) 
 ((-4507 . T) (-4508 . T)) 
-((-2225 (-12 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-871))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (LIST (QUOTE -321) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2338) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -2078) (|devaluate| |#2|)))))) (-12 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-1131))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (LIST (QUOTE -321) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2338) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -2078) (|devaluate| |#2|))))))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-871))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-1131))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| |#2| (QUOTE (-1131))) (|HasCategory| |#2| (LIST (QUOTE -632) (QUOTE (-886))))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (LIST (QUOTE -633) (QUOTE (-550)))) (-12 (|HasCategory| |#2| (QUOTE (-1131))) (|HasCategory| |#2| (LIST (QUOTE -321) (|devaluate| |#2|)))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-871))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-1131))) (|HasCategory| |#2| (QUOTE (-1131)))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-871))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-871))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-1131))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-1131)))) (|HasCategory| |#1| (QUOTE (-871))) (|HasCategory| |#2| (QUOTE (-1131))) (|HasCategory| (-578) (QUOTE (-871))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-1131))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-1131))) (|HasCategory| |#2| (QUOTE (-1131)))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| |#2| (LIST (QUOTE -632) (QUOTE (-886))))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-102)))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-102))) (-12 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-1131))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (LIST (QUOTE -321) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2338) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -2078) (|devaluate| |#2|))))))) 
+((-2225 (-12 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-871))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (LIST (QUOTE -321) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2338) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -2079) (|devaluate| |#2|)))))) (-12 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-1131))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (LIST (QUOTE -321) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2338) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -2079) (|devaluate| |#2|))))))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-871))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-1131))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| |#2| (QUOTE (-1131))) (|HasCategory| |#2| (LIST (QUOTE -632) (QUOTE (-886))))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (LIST (QUOTE -633) (QUOTE (-550)))) (-12 (|HasCategory| |#2| (QUOTE (-1131))) (|HasCategory| |#2| (LIST (QUOTE -321) (|devaluate| |#2|)))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-871))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-1131))) (|HasCategory| |#2| (QUOTE (-1131)))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-871))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-871))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-1131))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-1131)))) (|HasCategory| |#1| (QUOTE (-871))) (|HasCategory| |#2| (QUOTE (-1131))) (|HasCategory| (-578) (QUOTE (-871))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-1131))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-1131))) (|HasCategory| |#2| (QUOTE (-1131)))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| |#2| (LIST (QUOTE -632) (QUOTE (-886))))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-102)))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-102))) (-12 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-1131))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (LIST (QUOTE -321) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2338) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -2079) (|devaluate| |#2|))))))) 
 (-46 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 
@@ -144,7 +144,7 @@ NIL
 ((|constructor| (NIL "\\spad{ApplyUnivariateSkewPolynomial} (internal) allows univariate skew polynomials to be applied to appropriate modules.")) (|apply| ((|#2| |#3| (|Mapping| |#2| |#2|) |#2|) "\\spad{apply(p, f, m)} returns \\spad{p(m)} where the action is given by \\spad{x m = f(m)}. \\spad{f} must be an \\spad{R}-pseudo linear map on \\spad{M}."))) 
 NIL 
 NIL 
-(-54 |Base| R -2174) 
+(-54 |Base| R -2173) 
 ((|constructor| (NIL "This package apply rewrite rules to expressions,{} calling the pattern matcher.")) (|localUnquote| ((|#3| |#3| (|List| (|Symbol|))) "\\spad{localUnquote(f,ls)} is a local function.")) (|applyRules| ((|#3| (|List| (|RewriteRule| |#1| |#2| |#3|)) |#3| (|PositiveInteger|)) "\\spad{applyRules([r1,...,rn], expr, n)} applies the rules \\spad{r1},{}...,{}\\spad{rn} to \\spad{f} a most \\spad{n} times.") ((|#3| (|List| (|RewriteRule| |#1| |#2| |#3|)) |#3|) "\\spad{applyRules([r1,...,rn], expr)} applies the rules \\spad{r1},{}...,{}\\spad{rn} to \\spad{f} an unlimited number of times,{} \\spadignore{i.e.} until none of \\spad{r1},{}...,{}\\spad{rn} is applicable to the expression."))) 
 NIL 
 NIL 
@@ -172,59 +172,59 @@ NIL
 ((|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}."))) 
 ((-4507 . T) (-4508 . T)) 
 ((-12 (|HasCategory| |#1| (QUOTE (-1131))) (|HasCategory| |#1| (LIST (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1131))) (-2225 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1131)))) (-2225 (-12 (|HasCategory| |#1| (QUOTE (-1131))) (|HasCategory| |#1| (LIST (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -632) (QUOTE (-886))))) (|HasCategory| |#1| (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| |#1| (QUOTE (-102)))) 
-(-61 -2178) 
+(-61 -2179) 
 ((|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 
-(-62 -2178) 
+(-62 -2179) 
 ((|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 
-(-63 -2178) 
+(-63 -2179) 
 ((|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 
-(-64 -2178) 
+(-64 -2179) 
 ((|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 
-(-65 -2178) 
+(-65 -2179) 
 ((|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}"))) 
 NIL 
 NIL 
-(-66 -2178) 
+(-66 -2179) 
 ((|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 
-(-67 -2178) 
+(-67 -2179) 
 ((|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 
-(-68 -2178) 
+(-68 -2179) 
 ((|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 
-(-69 -2178) 
+(-69 -2179) 
 ((|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 
-(-70 -2178) 
+(-70 -2179) 
 ((|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 
-(-71 -2178) 
+(-71 -2179) 
 ((|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 
-(-72 -2178) 
+(-72 -2179) 
 ((|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 
-(-73 -2178) 
+(-73 -2179) 
 ((|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 
-(-74 -2178) 
+(-74 -2179) 
 ((|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 
@@ -236,55 +236,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 
-(-77 -2178) 
+(-77 -2179) 
 ((|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 
-(-78 -2178) 
+(-78 -2179) 
 ((|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 
-(-79 -2178) 
+(-79 -2179) 
 ((|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 
-(-80 -2178) 
+(-80 -2179) 
 ((|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 
-(-81 -2178) 
+(-81 -2179) 
 ((|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}"))) 
 NIL 
 NIL 
-(-82 -2178) 
+(-82 -2179) 
 ((|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 
-(-83 -2178) 
+(-83 -2179) 
 ((|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 
-(-84 -2178) 
+(-84 -2179) 
 ((|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 
-(-85 -2178) 
+(-85 -2179) 
 ((|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 
-(-86 -2178) 
+(-86 -2179) 
 ((|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 
-(-87 -2178) 
+(-87 -2179) 
 ((|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 
-(-88 -2178) 
+(-88 -2179) 
 ((|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 
-(-89 -2178) 
+(-89 -2179) 
 ((|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 
@@ -396,7 +396,7 @@ NIL
 ((|constructor| (NIL "A basic operator is an object that can be applied to a list of arguments from a set,{} the result being a kernel over that set.")) (|setProperties| (($ $ (|AssociationList| (|String|) (|None|))) "\\spad{setProperties(op, l)} sets the property list of \\spad{op} to \\spad{l}. Argument \\spad{op} is modified \"in place\",{} \\spadignore{i.e.} no copy is made.")) (|setProperty| (($ $ (|Identifier|) (|None|)) "\\spad{setProperty(op, p, v)} attaches property \\spad{p} to \\spad{op},{} and sets its value to \\spad{v}. Argument \\spad{op} is modified \"in place\",{} \\spadignore{i.e.} no copy is made.") (($ $ (|String|) (|None|)) "\\spad{setProperty(op, s, v)} attaches property \\spad{s} to \\spad{op},{} and sets its value to \\spad{v}. Argument \\spad{op} is modified \"in place\",{} \\spadignore{i.e.} no copy is made.")) (|property| (((|Maybe| (|None|)) $ (|Identifier|)) "\\spad{property(op, p)} returns the value of property \\spad{p} if it is attached to \\spad{op},{} otherwise \\spad{nothing}.") (((|Union| (|None|) "failed") $ (|String|)) "\\spad{property(op, s)} returns the value of property \\spad{s} if it is attached to \\spad{op},{} and \"failed\" otherwise.")) (|deleteProperty!| (($ $ (|Identifier|)) "\\spad{deleteProperty!(op, p)} unattaches property \\spad{p} from \\spad{op}. Argument \\spad{op} is modified \"in place\",{} \\spadignore{i.e.} no copy is made.") (($ $ (|String|)) "\\spad{deleteProperty!(op, s)} unattaches property \\spad{s} from \\spad{op}. Argument \\spad{op} is modified \"in place\",{} \\spadignore{i.e.} no copy is made.")) (|assert| (($ $ (|Identifier|)) "\\spad{assert(op, p)} attaches property \\spad{p} to \\spad{op}. Argument \\spad{op} is modified \"in place\",{} \\spadignore{i.e.} no copy is made.")) (|has?| (((|Boolean|) $ (|Identifier|)) "\\spad{has?(op,p)} tests if property \\spad{s} is attached to \\spad{op}.")) (|input| (((|Union| (|Mapping| (|InputForm|) (|List| (|InputForm|))) "failed") $) "\\spad{input(op)} returns the \"\\%input\" property of \\spad{op} if it has one attached,{} \"failed\" otherwise.") (($ $ (|Mapping| (|InputForm|) (|List| (|InputForm|)))) "\\spad{input(op, foo)} attaches foo as the \"\\%input\" property of \\spad{op}. If \\spad{op} has a \"\\%input\" property \\spad{f},{} then \\spad{op(a1,...,an)} gets converted to InputForm as \\spad{f(a1,...,an)}.")) (|display| (($ $ (|Mapping| (|OutputForm|) (|OutputForm|))) "\\spad{display(op, foo)} attaches foo as the \"\\%display\" property of \\spad{op}. If \\spad{op} has a \"\\%display\" property \\spad{f},{} then \\spad{op(a)} gets converted to OutputForm as \\spad{f(a)}. Argument \\spad{op} must be unary.") (($ $ (|Mapping| (|OutputForm|) (|List| (|OutputForm|)))) "\\spad{display(op, foo)} attaches foo as the \"\\%display\" property of \\spad{op}. If \\spad{op} has a \"\\%display\" property \\spad{f},{} then \\spad{op(a1,...,an)} gets converted to OutputForm as \\spad{f(a1,...,an)}.") (((|Union| (|Mapping| (|OutputForm|) (|List| (|OutputForm|))) "failed") $) "\\spad{display(op)} returns the \"\\%display\" property of \\spad{op} if it has one attached,{} and \"failed\" otherwise.")) (|comparison| (($ $ (|Mapping| (|Boolean|) $ $)) "\\spad{comparison(op, foo?)} attaches foo? as the \"\\%less?\" property to \\spad{op}. If op1 and op2 have the same name,{} and one of them has a \"\\%less?\" property \\spad{f},{} then \\spad{f(op1, op2)} is called to decide whether \\spad{op1 < op2}.")) (|equality| (($ $ (|Mapping| (|Boolean|) $ $)) "\\spad{equality(op, foo?)} attaches foo? as the \"\\%equal?\" property to \\spad{op}. If op1 and op2 have the same name,{} and one of them has an \"\\%equal?\" property \\spad{f},{} then \\spad{f(op1, op2)} is called to decide whether op1 and op2 should be considered equal.")) (|weight| (($ $ (|NonNegativeInteger|)) "\\spad{weight(op, n)} attaches the weight \\spad{n} to \\spad{op}.") (((|NonNegativeInteger|) $) "\\spad{weight(op)} returns the weight attached to \\spad{op}.")) (|nary?| (((|Boolean|) $) "\\spad{nary?(op)} tests if \\spad{op} has arbitrary arity.")) (|unary?| (((|Boolean|) $) "\\spad{unary?(op)} tests if \\spad{op} is unary.")) (|nullary?| (((|Boolean|) $) "\\spad{nullary?(op)} tests if \\spad{op} is nullary.")) (|operator| (($ (|Symbol|) (|Arity|)) "\\spad{operator(f, a)} makes \\spad{f} into an operator of arity \\spad{a}.") (($ (|Symbol|) (|NonNegativeInteger|)) "\\spad{operator(f, n)} makes \\spad{f} into an \\spad{n}-ary operator.") (($ (|Symbol|)) "\\spad{operator(f)} makes \\spad{f} into an operator with arbitrary arity.")) (|copy| (($ $) "\\spad{copy(op)} returns a copy of \\spad{op}.")) (|properties| (((|AssociationList| (|String|) (|None|)) $) "\\spad{properties(op)} returns the list of all the properties currently attached to \\spad{op}."))) 
 NIL 
 NIL 
-(-117 -2174 UP) 
+(-117 -2173 UP) 
 ((|constructor| (NIL "\\spadtype{BoundIntegerRoots} provides functions to find lower bounds on the integer roots of a polynomial.")) (|integerBound| (((|Integer|) |#2|) "\\spad{integerBound(p)} returns a lower bound on the negative integer roots of \\spad{p},{} and 0 if \\spad{p} has no negative integer roots."))) 
 NIL 
 NIL 
@@ -513,7 +513,7 @@ NIL
 NIL 
 NIL 
 (-146) 
-((|constructor| (NIL "This domain provides the basic character data type.")) (|alphanumeric?| (((|Boolean|) $) "\\spad{alphanumeric?(c)} tests if \\spad{c} is either a letter or number,{} \\spadignore{i.e.} one of 0..9,{} a..\\spad{z} or A..\\spad{Z}.")) (|lowerCase?| (((|Boolean|) $) "\\spad{lowerCase?(c)} tests if \\spad{c} is an lower case letter,{} \\spadignore{i.e.} one of a..\\spad{z}.")) (|upperCase?| (((|Boolean|) $) "\\spad{upperCase?(c)} tests if \\spad{c} is an upper case letter,{} \\spadignore{i.e.} one of A..\\spad{Z}.")) (|alphabetic?| (((|Boolean|) $) "\\spad{alphabetic?(c)} tests if \\spad{c} is a letter,{} \\spadignore{i.e.} one of a..\\spad{z} or A..\\spad{Z}.")) (|hexDigit?| (((|Boolean|) $) "\\spad{hexDigit?(c)} tests if \\spad{c} is a hexadecimal numeral,{} \\spadignore{i.e.} one of 0..9,{} a..\\spad{f} or A..\\spad{F}.")) (|digit?| (((|Boolean|) $) "\\spad{digit?(c)} tests if \\spad{c} is a digit character,{} \\spadignore{i.e.} one of 0..9.")) (|lowerCase| (($ $) "\\spad{lowerCase(c)} converts an upper case letter to the corresponding lower case letter. If \\spad{c} is not an upper case letter,{} then it is returned unchanged.")) (|upperCase| (($ $) "\\spad{upperCase(c)} converts a lower case letter to the corresponding upper case letter. If \\spad{c} is not a lower case letter,{} then it is returned unchanged.")) (|verticalTab| (($) "\\spad{verticalTab} designates vertical tab.")) (|horizontalTab| (($) "\\spad{horizontalTab} designates horizontal tab.")) (|backspace| (($) "\\spad{backspace} designates the backspace character.")) (|formfeed| (($) "\\spad{formfeed} designates the form feed character.")) (|linefeed| (($) "\\spad{linefeed} designates the line feed character.")) (|carriageReturn| (($) "\\spad{carriageReturn} designates carriage return.")) (|newline| (($) "\\spad{newline} designates the new line character.")) (|escape| (($) "\\spad{escape} provides the escape character,{} \\spad{_},{} which is used to allow quotes and other characters {\\em within} strings.")) (|quote| (($) "\\spad{quote} provides the string quote character,{} \\spad{\"}.")) (|space| (($) "\\spad{space} provides the blank character.")) (|char| (($ (|String|)) "\\spad{char(s)} provides a character from a string \\spad{s} of length one.") (($ (|NonNegativeInteger|)) "\\spad{char(i)} provides a character corresponding to the integer code \\spad{i}.	It is always \\spad{true} that \\spad{ord char i = i}.")) (|ord| (((|NonNegativeInteger|) $) "\\spad{ord(c)} provides an integral code corresponding to the character \\spad{c}. It is always \\spad{true} that \\spad{char ord c = c}."))) 
+((|constructor| (NIL "This domain provides the basic character data type.")) (|alphanumeric?| (((|Boolean|) $) "\\spad{alphanumeric?(c)} tests if \\spad{c} is either a letter or number,{} \\spadignore{i.e.} one of 0..9,{} a..\\spad{z} or A..\\spad{Z}.")) (|lowerCase?| (((|Boolean|) $) "\\spad{lowerCase?(c)} tests if \\spad{c} is an lower case letter,{} \\spadignore{i.e.} one of a..\\spad{z}.")) (|upperCase?| (((|Boolean|) $) "\\spad{upperCase?(c)} tests if \\spad{c} is an upper case letter,{} \\spadignore{i.e.} one of A..\\spad{Z}.")) (|alphabetic?| (((|Boolean|) $) "\\spad{alphabetic?(c)} tests if \\spad{c} is a letter,{} \\spadignore{i.e.} one of a..\\spad{z} or A..\\spad{Z}.")) (|hexDigit?| (((|Boolean|) $) "\\spad{hexDigit?(c)} tests if \\spad{c} is a hexadecimal numeral,{} \\spadignore{i.e.} one of 0..9,{} a..\\spad{f} or A..\\spad{F}.")) (|digit?| (((|Boolean|) $) "\\spad{digit?(c)} tests if \\spad{c} is a digit character,{} \\spadignore{i.e.} one of 0..9.")) (|lowerCase| (($ $) "\\spad{lowerCase(c)} converts an upper case letter to the corresponding lower case letter. If \\spad{c} is not an upper case letter,{} then it is returned unchanged.")) (|upperCase| (($ $) "\\spad{upperCase(c)} converts a lower case letter to the corresponding upper case letter. If \\spad{c} is not a lower case letter,{} then it is returned unchanged.")) (|verticalTab| (($) "\\spad{verticalTab} designates vertical tab.")) (|horizontalTab| (($) "\\spad{horizontalTab} designates horizontal tab.")) (|backspace| (($) "\\spad{backspace} designates the backspace character.")) (|formfeed| (($) "\\spad{formfeed} designates the form feed character.")) (|linefeed| (($) "\\spad{linefeed} designates the line feed character.")) (|carriageReturn| (($) "\\spad{carriageReturn} designates carriage return.")) (|newline| (($) "\\spad{newline} designates the new line character.")) (|underscore| (($) "\\spad{underscore} designates the underbar character.")) (|quote| (($) "\\spad{quote} provides the string quote character,{} \\spad{\"}.")) (|space| (($) "\\spad{space} provides the blank character.")) (|char| (($ (|String|)) "\\spad{char(s)} provides a character from a string \\spad{s} of length one.") (($ (|NonNegativeInteger|)) "\\spad{char(i)} provides a character corresponding to the integer code \\spad{i}.	It is always \\spad{true} that \\spad{ord char i = i}.")) (|ord| (((|NonNegativeInteger|) $) "\\spad{ord(c)} provides an integral code corresponding to the character \\spad{c}. It is always \\spad{true} that \\spad{char ord c = c}."))) 
 NIL 
 NIL 
 (-147) 
@@ -528,7 +528,7 @@ NIL
 ((|constructor| (NIL "Rings of Characteristic Zero."))) 
 ((-4504 . T)) 
 NIL 
-(-150 -2174 UP UPUP) 
+(-150 -2173 UP UPUP) 
 ((|constructor| (NIL "Tools to send a point to infinity on an algebraic curve.")) (|chvar| (((|Record| (|:| |func| |#3|) (|:| |poly| |#3|) (|:| |c1| (|Fraction| |#2|)) (|:| |c2| (|Fraction| |#2|)) (|:| |deg| (|NonNegativeInteger|))) |#3| |#3|) "\\spad{chvar(f(x,y), p(x,y))} returns \\spad{[g(z,t), q(z,t), c1(z), c2(z), n]} such that under the change of variable \\spad{x = c1(z)},{} \\spad{y = t * c2(z)},{} one gets \\spad{f(x,y) = g(z,t)}. The algebraic relation between \\spad{x} and \\spad{y} is \\spad{p(x, y) = 0}. The algebraic relation between \\spad{z} and \\spad{t} is \\spad{q(z, t) = 0}.")) (|eval| ((|#3| |#3| (|Fraction| |#2|) (|Fraction| |#2|)) "\\spad{eval(p(x,y), f(x), g(x))} returns \\spad{p(f(x), y * g(x))}.")) (|goodPoint| ((|#1| |#3| |#3|) "\\spad{goodPoint(p, q)} returns an integer a such that a is neither a pole of \\spad{p(x,y)} nor a branch point of \\spad{q(x,y) = 0}.")) (|rootPoly| (((|Record| (|:| |exponent| (|NonNegativeInteger|)) (|:| |coef| (|Fraction| |#2|)) (|:| |radicand| |#2|)) (|Fraction| |#2|) (|NonNegativeInteger|)) "\\spad{rootPoly(g, n)} returns \\spad{[m, c, P]} such that \\spad{c * g ** (1/n) = P ** (1/m)} thus if \\spad{y**n = g},{} then \\spad{z**m = P} where \\spad{z = c * y}.")) (|radPoly| (((|Union| (|Record| (|:| |radicand| (|Fraction| |#2|)) (|:| |deg| (|NonNegativeInteger|))) "failed") |#3|) "\\spad{radPoly(p(x, y))} returns \\spad{[c(x), n]} if \\spad{p} is of the form \\spad{y**n - c(x)},{} \"failed\" otherwise.")) (|mkIntegral| (((|Record| (|:| |coef| (|Fraction| |#2|)) (|:| |poly| |#3|)) |#3|) "\\spad{mkIntegral(p(x,y))} returns \\spad{[c(x), q(x,z)]} such that \\spad{z = c * y} is integral. The algebraic relation between \\spad{x} and \\spad{y} is \\spad{p(x, y) = 0}. The algebraic relation between \\spad{x} and \\spad{z} is \\spad{q(x, z) = 0}."))) 
 NIL 
 NIL 
@@ -568,7 +568,7 @@ NIL
 ((|constructor| (NIL "Color() specifies a domain of 27 colors provided in the \\Language{} system (the colors mix additively).")) (|color| (($ (|Integer|)) "\\spad{color(i)} returns a color of the indicated hue \\spad{i}.")) (|numberOfHues| (((|PositiveInteger|)) "\\spad{numberOfHues()} returns the number of total hues,{} set in totalHues.")) (|hue| (((|Integer|) $) "\\spad{hue(c)} returns the hue index of the indicated color \\spad{c}.")) (|blue| (($) "\\spad{blue()} returns the position of the blue hue from total hues.")) (|green| (($) "\\spad{green()} returns the position of the green hue from total hues.")) (|yellow| (($) "\\spad{yellow()} returns the position of the yellow hue from total hues.")) (|red| (($) "\\spad{red()} returns the position of the red hue from total hues.")) (+ (($ $ $) "\\spad{c1 + c2} additively mixes the two colors \\spad{c1} and \\spad{c2}.")) (* (($ (|DoubleFloat|) $) "\\spad{s * c},{} returns the color \\spad{c},{} whose weighted shade has been scaled by \\spad{s}.") (($ (|PositiveInteger|) $) "\\spad{s * c},{} returns the color \\spad{c},{} whose weighted shade has been scaled by \\spad{s}."))) 
 NIL 
 NIL 
-(-160 R -2174) 
+(-160 R -2173) 
 ((|constructor| (NIL "Provides combinatorial functions over an integral domain.")) (|ipow| ((|#2| (|List| |#2|)) "\\spad{ipow(l)} should be local but conditional.")) (|iidprod| ((|#2| (|List| |#2|)) "\\spad{iidprod(l)} should be local but conditional.")) (|iidsum| ((|#2| (|List| |#2|)) "\\spad{iidsum(l)} should be local but conditional.")) (|iipow| ((|#2| (|List| |#2|)) "\\spad{iipow(l)} should be local but conditional.")) (|iiperm| ((|#2| (|List| |#2|)) "\\spad{iiperm(l)} should be local but conditional.")) (|iibinom| ((|#2| (|List| |#2|)) "\\spad{iibinom(l)} should be local but conditional.")) (|iifact| ((|#2| |#2|) "\\spad{iifact(x)} should be local but conditional.")) (|product| ((|#2| |#2| (|SegmentBinding| |#2|)) "\\spad{product(f(n), n = a..b)} returns \\spad{f}(a) * ... * \\spad{f}(\\spad{b}) as a formal product.") ((|#2| |#2| (|Symbol|)) "\\spad{product(f(n), n)} returns the formal product \\spad{P}(\\spad{n}) which verifies \\spad{P}(\\spad{n+1})\\spad{/P}(\\spad{n}) = \\spad{f}(\\spad{n}).")) (|summation| ((|#2| |#2| (|SegmentBinding| |#2|)) "\\spad{summation(f(n), n = a..b)} returns \\spad{f}(a) + ... + \\spad{f}(\\spad{b}) as a formal sum.") ((|#2| |#2| (|Symbol|)) "\\spad{summation(f(n), n)} returns the formal sum \\spad{S}(\\spad{n}) which verifies \\spad{S}(\\spad{n+1}) - \\spad{S}(\\spad{n}) = \\spad{f}(\\spad{n}).")) (|factorials| ((|#2| |#2| (|Symbol|)) "\\spad{factorials(f, x)} rewrites the permutations and binomials in \\spad{f} involving \\spad{x} in terms of factorials.") ((|#2| |#2|) "\\spad{factorials(f)} rewrites the permutations and binomials in \\spad{f} in terms of factorials.")) (|factorial| ((|#2| |#2|) "\\spad{factorial(n)} returns the factorial of \\spad{n},{} \\spadignore{i.e.} \\spad{n!}.")) (|permutation| ((|#2| |#2| |#2|) "\\spad{permutation(n, r)} returns the number of permutations of \\spad{n} objects taken \\spad{r} at a time,{} \\spadignore{i.e.} \\spad{n!/}(\\spad{n}-\\spad{r})!.")) (|binomial| ((|#2| |#2| |#2|) "\\spad{binomial(n, r)} returns the number of subsets of \\spad{r} objects taken among \\spad{n} objects,{} \\spadignore{i.e.} \\spad{n!/}(\\spad{r!} * (\\spad{n}-\\spad{r})!).")) (** ((|#2| |#2| |#2|) "\\spad{a ** b} is the formal exponential a**b.")) (|operator| (((|BasicOperator|) (|BasicOperator|)) "\\spad{operator(op)} returns a copy of \\spad{op} with the domain-dependent properties appropriate for \\spad{F}; error if \\spad{op} is not a combinatorial operator.")) (|belong?| (((|Boolean|) (|BasicOperator|)) "\\spad{belong?(op)} is \\spad{true} if \\spad{op} is a combinatorial operator."))) 
 NIL 
 NIL 
@@ -692,7 +692,7 @@ NIL
 ((|constructor| (NIL "This domain provides implementations for constructors.")) (|findConstructor| (((|Maybe| $) (|Identifier|)) "\\spad{findConstructor(s)} attempts to find a constructor named \\spad{s}. If successful,{} returns that constructor; otherwise,{} returns \\spad{nothing}."))) 
 NIL 
 NIL 
-(-191 R -2174) 
+(-191 R -2173) 
 ((|constructor| (NIL "\\spadtype{ComplexTrigonometricManipulations} provides function that compute the real and imaginary parts of complex functions.")) (|complexForm| (((|Complex| (|Expression| |#1|)) |#2|) "\\spad{complexForm(f)} returns \\spad{[real f, imag f]}.")) (|trigs| ((|#2| |#2|) "\\spad{trigs(f)} rewrites all the complex logs and exponentials appearing in \\spad{f} in terms of trigonometric functions.")) (|real?| (((|Boolean|) |#2|) "\\spad{real?(f)} returns \\spad{true} if \\spad{f = real f}.")) (|imag| (((|Expression| |#1|) |#2|) "\\spad{imag(f)} returns the imaginary part of \\spad{f} where \\spad{f} is a complex function.")) (|real| (((|Expression| |#1|) |#2|) "\\spad{real(f)} returns the real part of \\spad{f} where \\spad{f} is a complex function.")) (|complexElementary| ((|#2| |#2| (|Symbol|)) "\\spad{complexElementary(f, x)} rewrites the kernels of \\spad{f} involving \\spad{x} in terms of the 2 fundamental complex transcendental elementary functions: \\spad{log, exp}.") ((|#2| |#2|) "\\spad{complexElementary(f)} rewrites \\spad{f} in terms of the 2 fundamental complex transcendental elementary functions: \\spad{log, exp}.")) (|complexNormalize| ((|#2| |#2| (|Symbol|)) "\\spad{complexNormalize(f, x)} rewrites \\spad{f} using the least possible number of complex independent kernels involving \\spad{x}.") ((|#2| |#2|) "\\spad{complexNormalize(f)} rewrites \\spad{f} using the least possible number of complex independent kernels."))) 
 NIL 
 NIL 
@@ -804,11 +804,11 @@ NIL
 ((|constructor| (NIL "\\indented{1}{Author: Gabriel Dos Reis} Date Created: July 2,{} 2010 Date Last Modified: July 2,{} 2010 Descrption: \\indented{2}{Representation of a dual vector space basis,{} given by symbols.}")) (|dual| (($ (|LinearBasis| |#1|)) "\\spad{dual x} constructs the dual vector of a linear element which is part of a basis."))) 
 NIL 
 NIL 
-(-219 -2174 UP UPUP R) 
+(-219 -2173 UP UPUP R) 
 ((|constructor| (NIL "This package provides functions for computing the residues of a function on an algebraic curve.")) (|doubleResultant| ((|#2| |#4| (|Mapping| |#2| |#2|)) "\\spad{doubleResultant(f, ')} returns \\spad{p}(\\spad{x}) whose roots are rational multiples of the residues of \\spad{f} at all its finite poles. Argument ' is the derivation to use."))) 
 NIL 
 NIL 
-(-220 -2174 FP) 
+(-220 -2173 FP) 
 ((|constructor| (NIL "Package for the factorization of a univariate polynomial with coefficients in a finite field. The algorithm used is the \"distinct degree\" algorithm of Cantor-Zassenhaus,{} modified to use trace instead of the norm and a table for computing Frobenius as suggested by Naudin and Quitte .")) (|irreducible?| (((|Boolean|) |#2|) "\\spad{irreducible?(p)} tests whether the polynomial \\spad{p} is irreducible.")) (|tracePowMod| ((|#2| |#2| (|NonNegativeInteger|) |#2|) "\\spad{tracePowMod(u,k,v)} produces the sum of \\spad{u**(q**i)} for \\spad{i} running and \\spad{q=} size \\spad{F}")) (|trace2PowMod| ((|#2| |#2| (|NonNegativeInteger|) |#2|) "\\spad{trace2PowMod(u,k,v)} produces the sum of \\spad{u**(2**i)} for \\spad{i} running from 1 to \\spad{k} all computed modulo the polynomial \\spad{v}.")) (|exptMod| ((|#2| |#2| (|NonNegativeInteger|) |#2|) "\\spad{exptMod(u,k,v)} raises the polynomial \\spad{u} to the \\spad{k}th power modulo the polynomial \\spad{v}.")) (|separateFactors| (((|List| |#2|) (|List| (|Record| (|:| |deg| (|NonNegativeInteger|)) (|:| |prod| |#2|)))) "\\spad{separateFactors(lfact)} takes the list produced by \\spadfunFrom{separateDegrees}{DistinctDegreeFactorization} and produces the complete list of factors.")) (|separateDegrees| (((|List| (|Record| (|:| |deg| (|NonNegativeInteger|)) (|:| |prod| |#2|))) |#2|) "\\spad{separateDegrees(p)} splits the square free polynomial \\spad{p} into factors each of which is a product of irreducibles of the same degree.")) (|distdfact| (((|Record| (|:| |cont| |#1|) (|:| |factors| (|List| (|Record| (|:| |irr| |#2|) (|:| |pow| (|Integer|)))))) |#2| (|Boolean|)) "\\spad{distdfact(p,sqfrflag)} produces the complete factorization of the polynomial \\spad{p} returning an internal data structure. If argument \\spad{sqfrflag} is \\spad{true},{} the polynomial is assumed square free.")) (|factorSquareFree| (((|Factored| |#2|) |#2|) "\\spad{factorSquareFree(p)} produces the complete factorization of the square free polynomial \\spad{p}.")) (|factor| (((|Factored| |#2|) |#2|) "\\spad{factor(p)} produces the complete factorization of the polynomial \\spad{p}."))) 
 NIL 
 NIL 
@@ -820,7 +820,7 @@ NIL
 ((|constructor| (NIL "This domain represents the syntax of a definition.")) (|body| (((|SpadAst|) $) "\\spad{body(d)} returns the right hand side of the definition \\spad{`d'}.")) (|signature| (((|Signature|) $) "\\spad{signature(d)} returns the signature of the operation being defined. Note that this list may be partial in that it contains only the types actually specified in the definition.")) (|head| (((|HeadAst|) $) "\\spad{head(d)} returns the head of the definition \\spad{`d'}. This is a list of identifiers starting with the name of the operation followed by the name of the parameters,{} if any."))) 
 NIL 
 NIL 
-(-223 R -2174) 
+(-223 R -2173) 
 ((|constructor| (NIL "\\spadtype{ElementaryFunctionDefiniteIntegration} provides functions to compute definite integrals of elementary functions.")) (|innerint| (((|Union| (|:| |f1| (|OrderedCompletion| |#2|)) (|:| |f2| (|List| (|OrderedCompletion| |#2|))) (|:| |fail| "failed") (|:| |pole| "potentialPole")) |#2| (|Symbol|) (|OrderedCompletion| |#2|) (|OrderedCompletion| |#2|) (|Boolean|)) "\\spad{innerint(f, x, a, b, ignore?)} should be local but conditional")) (|integrate| (((|Union| (|:| |f1| (|OrderedCompletion| |#2|)) (|:| |f2| (|List| (|OrderedCompletion| |#2|))) (|:| |fail| "failed") (|:| |pole| "potentialPole")) |#2| (|SegmentBinding| (|OrderedCompletion| |#2|)) (|String|)) "\\spad{integrate(f, x = a..b, \"noPole\")} returns the integral of \\spad{f(x)dx} from a to \\spad{b}. If it is not possible to check whether \\spad{f} has a pole for \\spad{x} between a and \\spad{b} (because of parameters),{} then this function will assume that \\spad{f} has no such pole. Error: if \\spad{f} has a pole for \\spad{x} between a and \\spad{b} or if the last argument is not \"noPole\".") (((|Union| (|:| |f1| (|OrderedCompletion| |#2|)) (|:| |f2| (|List| (|OrderedCompletion| |#2|))) (|:| |fail| "failed") (|:| |pole| "potentialPole")) |#2| (|SegmentBinding| (|OrderedCompletion| |#2|))) "\\spad{integrate(f, x = a..b)} returns the integral of \\spad{f(x)dx} from a to \\spad{b}. Error: if \\spad{f} has a pole for \\spad{x} between a and \\spad{b}."))) 
 NIL 
 NIL 
@@ -840,7 +840,7 @@ NIL
 ((|constructor| (NIL "The deRham complex of Euclidean space,{} that is,{} the class of differential forms of arbitary degree over a coefficient ring. See Flanders,{} Harley,{} Differential Forms,{} With Applications to the Physical Sciences,{} New York,{} Academic Press,{} 1963.")) (|exteriorDifferential| (($ $) "\\spad{exteriorDifferential(df)} returns the exterior derivative (gradient,{} curl,{} divergence,{} ...) of the differential form \\spad{df}.")) (|totalDifferential| (($ (|Expression| |#1|)) "\\spad{totalDifferential(x)} returns the total differential (gradient) form for element \\spad{x}.")) (|map| (($ (|Mapping| (|Expression| |#1|) (|Expression| |#1|)) $) "\\spad{map(f,df)} replaces each coefficient \\spad{x} of differential form \\spad{df} by \\spad{f(x)}.")) (|degree| (((|Integer|) $) "\\spad{degree(df)} returns the homogeneous degree of differential form \\spad{df}.")) (|retractable?| (((|Boolean|) $) "\\spad{retractable?(df)} tests if differential form \\spad{df} is a 0-form,{} \\spadignore{i.e.} if degree(\\spad{df}) = 0.")) (|homogeneous?| (((|Boolean|) $) "\\spad{homogeneous?(df)} tests if all of the terms of differential form \\spad{df} have the same degree.")) (|generator| (($ (|NonNegativeInteger|)) "\\spad{generator(n)} returns the \\spad{n}th basis term for a differential form.")) (|coefficient| (((|Expression| |#1|) $ $) "\\spad{coefficient(df,u)},{} where \\spad{df} is a differential form,{} returns the coefficient of \\spad{df} containing the basis term \\spad{u} if such a term exists,{} and 0 otherwise.")) (|reductum| (($ $) "\\spad{reductum(df)},{} where \\spad{df} is a differential form,{} returns \\spad{df} minus the leading term of \\spad{df} if \\spad{df} has two or more terms,{} and 0 otherwise.")) (|leadingBasisTerm| (($ $) "\\spad{leadingBasisTerm(df)} returns the leading basis term of differential form \\spad{df}.")) (|leadingCoefficient| (((|Expression| |#1|) $) "\\spad{leadingCoefficient(df)} returns the leading coefficient of differential form \\spad{df}."))) 
 ((-4504 . T)) 
 NIL 
-(-228 R -2174) 
+(-228 R -2173) 
 ((|constructor| (NIL "\\spadtype{DefiniteIntegrationTools} provides common tools used by the definite integration of both rational and elementary functions.")) (|checkForZero| (((|Union| (|Boolean|) "failed") (|SparseUnivariatePolynomial| |#2|) (|OrderedCompletion| |#2|) (|OrderedCompletion| |#2|) (|Boolean|)) "\\spad{checkForZero(p, a, b, incl?)} is \\spad{true} if \\spad{p} has a zero between a and \\spad{b},{} \\spad{false} otherwise,{} \"failed\" if this cannot be determined. Check for a and \\spad{b} inclusive if incl? is \\spad{true},{} exclusive otherwise.") (((|Union| (|Boolean|) "failed") (|Polynomial| |#1|) (|Symbol|) (|OrderedCompletion| |#2|) (|OrderedCompletion| |#2|) (|Boolean|)) "\\spad{checkForZero(p, x, a, b, incl?)} is \\spad{true} if \\spad{p} has a zero for \\spad{x} between a and \\spad{b},{} \\spad{false} otherwise,{} \"failed\" if this cannot be determined. Check for a and \\spad{b} inclusive if incl? is \\spad{true},{} exclusive otherwise.")) (|computeInt| (((|Union| (|OrderedCompletion| |#2|) "failed") (|Kernel| |#2|) |#2| (|OrderedCompletion| |#2|) (|OrderedCompletion| |#2|) (|Boolean|)) "\\spad{computeInt(x, g, a, b, eval?)} returns the integral of \\spad{f} for \\spad{x} between a and \\spad{b},{} assuming that \\spad{g} is an indefinite integral of \\spad{f} and \\spad{f} has no pole between a and \\spad{b}. If \\spad{eval?} is \\spad{true},{} then \\spad{g} can be evaluated safely at \\spad{a} and \\spad{b},{} provided that they are finite values. Otherwise,{} limits must be computed.")) (|ignore?| (((|Boolean|) (|String|)) "\\spad{ignore?(s)} is \\spad{true} if \\spad{s} is the string that tells the integrator to assume that the function has no pole in the integration interval."))) 
 NIL 
 NIL 
@@ -1076,11 +1076,11 @@ NIL
 ((|constructor| (NIL "A domain used in the construction of the exterior algebra on a set \\spad{X} over a ring \\spad{R}. This domain represents the set of all ordered subsets of the set \\spad{X},{} assumed to be in correspondance with {1,{}2,{}3,{} ...}. The ordered subsets are themselves ordered lexicographically and are in bijective correspondance with an ordered basis of the exterior algebra. In this domain we are dealing strictly with the exponents of basis elements which can only be 0 or 1. \\blankline The multiplicative identity element of the exterior algebra corresponds to the empty subset of \\spad{X}. A coerce from List Integer to an ordered basis element is provided to allow the convenient input of expressions. Another exported function forgets the ordered structure and simply returns the list corresponding to an ordered subset.")) (|Nul| (($ (|NonNegativeInteger|)) "\\spad{Nul()} gives the basis element 1 for the algebra generated by \\spad{n} generators.")) (|exponents| (((|List| (|Integer|)) $) "\\spad{exponents(x)} converts a domain element into a list of zeros and ones corresponding to the exponents in the basis element that \\spad{x} represents.")) (|degree| (((|NonNegativeInteger|) $) "\\spad{degree(x)} gives the numbers of 1\\spad{'s} in \\spad{x},{} \\spadignore{i.e.} the number of non-zero exponents in the basis element that \\spad{x} represents.")) (|coerce| (($ (|List| (|Integer|))) "\\spad{coerce(l)} converts a list of 0\\spad{'s} and 1\\spad{'s} into a basis element,{} where 1 (respectively 0) designates that the variable of the corresponding index of \\spad{l} is (respectively,{} is not) present. Error: if an element of \\spad{l} is not 0 or 1."))) 
 NIL 
 NIL 
-(-287 R -2174) 
+(-287 R -2173) 
 ((|constructor| (NIL "Provides elementary functions over an integral domain.")) (|localReal?| (((|Boolean|) |#2|) "\\spad{localReal?(x)} should be local but conditional")) (|specialTrigs| (((|Union| |#2| "failed") |#2| (|List| (|Record| (|:| |func| |#2|) (|:| |pole| (|Boolean|))))) "\\spad{specialTrigs(x,l)} should be local but conditional")) (|iiacsch| ((|#2| |#2|) "\\spad{iiacsch(x)} should be local but conditional")) (|iiasech| ((|#2| |#2|) "\\spad{iiasech(x)} should be local but conditional")) (|iiacoth| ((|#2| |#2|) "\\spad{iiacoth(x)} should be local but conditional")) (|iiatanh| ((|#2| |#2|) "\\spad{iiatanh(x)} should be local but conditional")) (|iiacosh| ((|#2| |#2|) "\\spad{iiacosh(x)} should be local but conditional")) (|iiasinh| ((|#2| |#2|) "\\spad{iiasinh(x)} should be local but conditional")) (|iicsch| ((|#2| |#2|) "\\spad{iicsch(x)} should be local but conditional")) (|iisech| ((|#2| |#2|) "\\spad{iisech(x)} should be local but conditional")) (|iicoth| ((|#2| |#2|) "\\spad{iicoth(x)} should be local but conditional")) (|iitanh| ((|#2| |#2|) "\\spad{iitanh(x)} should be local but conditional")) (|iicosh| ((|#2| |#2|) "\\spad{iicosh(x)} should be local but conditional")) (|iisinh| ((|#2| |#2|) "\\spad{iisinh(x)} should be local but conditional")) (|iiacsc| ((|#2| |#2|) "\\spad{iiacsc(x)} should be local but conditional")) (|iiasec| ((|#2| |#2|) "\\spad{iiasec(x)} should be local but conditional")) (|iiacot| ((|#2| |#2|) "\\spad{iiacot(x)} should be local but conditional")) (|iiatan| ((|#2| |#2|) "\\spad{iiatan(x)} should be local but conditional")) (|iiacos| ((|#2| |#2|) "\\spad{iiacos(x)} should be local but conditional")) (|iiasin| ((|#2| |#2|) "\\spad{iiasin(x)} should be local but conditional")) (|iicsc| ((|#2| |#2|) "\\spad{iicsc(x)} should be local but conditional")) (|iisec| ((|#2| |#2|) "\\spad{iisec(x)} should be local but conditional")) (|iicot| ((|#2| |#2|) "\\spad{iicot(x)} should be local but conditional")) (|iitan| ((|#2| |#2|) "\\spad{iitan(x)} should be local but conditional")) (|iicos| ((|#2| |#2|) "\\spad{iicos(x)} should be local but conditional")) (|iisin| ((|#2| |#2|) "\\spad{iisin(x)} should be local but conditional")) (|iilog| ((|#2| |#2|) "\\spad{iilog(x)} should be local but conditional")) (|iiexp| ((|#2| |#2|) "\\spad{iiexp(x)} should be local but conditional")) (|iisqrt3| ((|#2|) "\\spad{iisqrt3()} should be local but conditional")) (|iisqrt2| ((|#2|) "\\spad{iisqrt2()} should be local but conditional")) (|operator| (((|BasicOperator|) (|BasicOperator|)) "\\spad{operator(p)} returns an elementary operator with the same symbol as \\spad{p}")) (|belong?| (((|Boolean|) (|BasicOperator|)) "\\spad{belong?(p)} returns \\spad{true} if operator \\spad{p} is elementary")) (|pi| ((|#2|) "\\spad{pi()} returns the \\spad{pi} operator")) (|acsch| ((|#2| |#2|) "\\spad{acsch(x)} applies the inverse hyperbolic cosecant operator to \\spad{x}")) (|asech| ((|#2| |#2|) "\\spad{asech(x)} applies the	inverse hyperbolic secant operator to \\spad{x}")) (|acoth| ((|#2| |#2|) "\\spad{acoth(x)} applies the inverse hyperbolic cotangent operator to \\spad{x}")) (|atanh| ((|#2| |#2|) "\\spad{atanh(x)} applies the inverse hyperbolic tangent operator to \\spad{x}")) (|acosh| ((|#2| |#2|) "\\spad{acosh(x)} applies the inverse hyperbolic cosine operator to \\spad{x}")) (|asinh| ((|#2| |#2|) "\\spad{asinh(x)} applies the inverse hyperbolic sine operator to \\spad{x}")) (|csch| ((|#2| |#2|) "\\spad{csch(x)} applies the hyperbolic cosecant operator to \\spad{x}")) (|sech| ((|#2| |#2|) "\\spad{sech(x)} applies the hyperbolic secant operator to \\spad{x}")) (|coth| ((|#2| |#2|) "\\spad{coth(x)} applies the hyperbolic cotangent operator to \\spad{x}")) (|tanh| ((|#2| |#2|) "\\spad{tanh(x)} applies the hyperbolic tangent operator to \\spad{x}")) (|cosh| ((|#2| |#2|) "\\spad{cosh(x)} applies the hyperbolic cosine operator to \\spad{x}")) (|sinh| ((|#2| |#2|) "\\spad{sinh(x)} applies the hyperbolic sine operator to \\spad{x}")) (|acsc| ((|#2| |#2|) "\\spad{acsc(x)} applies the inverse cosecant operator to \\spad{x}")) (|asec| ((|#2| |#2|) "\\spad{asec(x)} applies the inverse secant operator to \\spad{x}")) (|acot| ((|#2| |#2|) "\\spad{acot(x)} applies the inverse cotangent operator to \\spad{x}")) (|atan| ((|#2| |#2|) "\\spad{atan(x)} applies the inverse tangent operator to \\spad{x}")) (|acos| ((|#2| |#2|) "\\spad{acos(x)} applies the inverse cosine operator to \\spad{x}")) (|asin| ((|#2| |#2|) "\\spad{asin(x)} applies the inverse sine operator to \\spad{x}")) (|csc| ((|#2| |#2|) "\\spad{csc(x)} applies the cosecant operator to \\spad{x}")) (|sec| ((|#2| |#2|) "\\spad{sec(x)} applies the secant operator to \\spad{x}")) (|cot| ((|#2| |#2|) "\\spad{cot(x)} applies the cotangent operator to \\spad{x}")) (|tan| ((|#2| |#2|) "\\spad{tan(x)} applies the tangent operator to \\spad{x}")) (|cos| ((|#2| |#2|) "\\spad{cos(x)} applies the cosine operator to \\spad{x}")) (|sin| ((|#2| |#2|) "\\spad{sin(x)} applies the sine operator to \\spad{x}")) (|log| ((|#2| |#2|) "\\spad{log(x)} applies the logarithm operator to \\spad{x}")) (|exp| ((|#2| |#2|) "\\spad{exp(x)} applies the exponential operator to \\spad{x}"))) 
 NIL 
 NIL 
-(-288 R -2174) 
+(-288 R -2173) 
 ((|constructor| (NIL "ElementaryFunctionStructurePackage provides functions to test the algebraic independence of various elementary functions,{} using the Risch structure theorem (real and complex versions). It also provides transformations on elementary functions which are not considered simplifications.")) (|tanQ| ((|#2| (|Fraction| (|Integer|)) |#2|) "\\spad{tanQ(q,a)} is a local function with a conditional implementation.")) (|rootNormalize| ((|#2| |#2| (|Kernel| |#2|)) "\\spad{rootNormalize(f, k)} returns \\spad{f} rewriting either \\spad{k} which must be an \\spad{n}th-root in terms of radicals already in \\spad{f},{} or some radicals in \\spad{f} in terms of \\spad{k}.")) (|validExponential| (((|Union| |#2| "failed") (|List| (|Kernel| |#2|)) |#2| (|Symbol|)) "\\spad{validExponential([k1,...,kn],f,x)} returns \\spad{g} if \\spad{exp(f)=g} and \\spad{g} involves only \\spad{k1...kn},{} and \"failed\" otherwise.")) (|realElementary| ((|#2| |#2| (|Symbol|)) "\\spad{realElementary(f,x)} rewrites the kernels of \\spad{f} involving \\spad{x} in terms of the 4 fundamental real transcendental elementary functions: \\spad{log, exp, tan, atan}.") ((|#2| |#2|) "\\spad{realElementary(f)} rewrites \\spad{f} in terms of the 4 fundamental real transcendental elementary functions: \\spad{log, exp, tan, atan}.")) (|rischNormalize| (((|Record| (|:| |func| |#2|) (|:| |kers| (|List| (|Kernel| |#2|))) (|:| |vals| (|List| |#2|))) |#2| (|Symbol|)) "\\spad{rischNormalize(f, x)} returns \\spad{[g, [k1,...,kn], [h1,...,hn]]} such that \\spad{g = normalize(f, x)} and each \\spad{ki} was rewritten as \\spad{hi} during the normalization.")) (|normalize| ((|#2| |#2| (|Symbol|)) "\\spad{normalize(f, x)} rewrites \\spad{f} using the least possible number of real algebraically independent kernels involving \\spad{x}.") ((|#2| |#2|) "\\spad{normalize(f)} rewrites \\spad{f} using the least possible number of real algebraically independent kernels."))) 
 NIL 
 NIL 
@@ -1132,7 +1132,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 
-(-301 S R |Mod| -1606 -3949 |exactQuo|) 
+(-301 S R |Mod| -3674 -1695 |exactQuo|) 
 ((|constructor| (NIL "These domains are used for the factorization and gcds of univariate polynomials over the integers in order to work modulo different primes. See \\spadtype{ModularRing},{} \\spadtype{ModularField}")) (|inv| (($ $) "\\spad{inv(x)} \\undocumented")) (|recip| (((|Union| $ "failed") $) "\\spad{recip(x)} \\undocumented")) (|exQuo| (((|Union| $ "failed") $ $) "\\spad{exQuo(x,y)} \\undocumented")) (|reduce| (($ |#2| |#3|) "\\spad{reduce(r,m)} \\undocumented")) (|coerce| ((|#2| $) "\\spad{coerce(x)} \\undocumented")) (|modulus| ((|#3| $) "\\spad{modulus(x)} \\undocumented"))) 
 ((-4500 . T) ((-4509 "*") . T) (-4501 . T) (-4502 . T) (-4504 . T)) 
 NIL 
@@ -1159,16 +1159,16 @@ NIL
 (-307 |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."))) 
 ((-4507 . T) (-4508 . T)) 
-((-12 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-1131))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (LIST (QUOTE -321) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2338) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -2078) (|devaluate| |#2|)))))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-1131))) (|HasCategory| |#2| (QUOTE (-1131)))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-1131))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-1131)))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-1131))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| |#2| (QUOTE (-1131))) (|HasCategory| |#2| (LIST (QUOTE -632) (QUOTE (-886))))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (LIST (QUOTE -633) (QUOTE (-550)))) (-12 (|HasCategory| |#2| (QUOTE (-1131))) (|HasCategory| |#2| (LIST (QUOTE -321) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-1131))) (|HasCategory| |#1| (QUOTE (-871))) (|HasCategory| |#2| (QUOTE (-1131))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| |#2| (LIST (QUOTE -632) (QUOTE (-886))))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-102)))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-102)))) 
+((-12 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-1131))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (LIST (QUOTE -321) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2338) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -2079) (|devaluate| |#2|)))))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-1131))) (|HasCategory| |#2| (QUOTE (-1131)))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-1131))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-1131)))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-1131))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| |#2| (QUOTE (-1131))) (|HasCategory| |#2| (LIST (QUOTE -632) (QUOTE (-886))))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (LIST (QUOTE -633) (QUOTE (-550)))) (-12 (|HasCategory| |#2| (QUOTE (-1131))) (|HasCategory| |#2| (LIST (QUOTE -321) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-1131))) (|HasCategory| |#1| (QUOTE (-871))) (|HasCategory| |#2| (QUOTE (-1131))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| |#2| (LIST (QUOTE -632) (QUOTE (-886))))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-102)))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-102)))) 
 (-308) 
 ((|constructor| (NIL "ErrorFunctions implements error functions callable from the system interpreter. Typically,{} these functions would be called in user functions. The simple forms of the functions take one argument which is either a string (an error message) or a list of strings which all together make up a message. The list can contain formatting codes (see below). The more sophisticated versions takes two arguments where the first argument is the name of the function from which the error was invoked and the second argument is either a string or a list of strings,{} as above. When you use the one argument version in an interpreter function,{} the system will automatically insert the name of the function as the new first argument. Thus in the user interpreter function \\indented{2}{\\spad{f x == if x < 0 then error \"negative argument\" else x}} the call to error will actually be of the form \\indented{2}{\\spad{error(\"f\",\"negative argument\")}} because the interpreter will have created a new first argument. \\blankline Formatting codes: error messages may contain the following formatting codes (they should either start or end a string or else have blanks around them): \\indented{3}{\\spad{\\%l}\\space{6}start a new line} \\indented{3}{\\spad{\\%b}\\space{6}start printing in a bold font (where available)} \\indented{3}{\\spad{\\%d}\\space{6}stop\\space{2}printing in a bold font (where available)} \\indented{3}{\\spad{ \\%ceon}\\space{2}start centering message lines} \\indented{3}{\\spad{\\%ceoff}\\space{2}stop\\space{2}centering message lines} \\indented{3}{\\spad{\\%rjon}\\space{3}start displaying lines \"ragged left\"} \\indented{3}{\\spad{\\%rjoff}\\space{2}stop\\space{2}displaying lines \"ragged left\"} \\indented{3}{\\spad{\\%i}\\space{6}indent\\space{3}following lines 3 additional spaces} \\indented{3}{\\spad{\\%u}\\space{6}unindent following lines 3 additional spaces} \\indented{3}{\\spad{\\%xN}\\space{5}insert \\spad{N} blanks (eg,{} \\spad{\\%x10} inserts 10 blanks)} \\blankline")) (|error| (((|Exit|) (|String|) (|List| (|String|))) "\\spad{error(nam,lmsg)} displays error messages \\spad{lmsg} preceded by a message containing the name \\spad{nam} of the function in which the error is contained.") (((|Exit|) (|String|) (|String|)) "\\spad{error(nam,msg)} displays error message \\spad{msg} preceded by a message containing the name \\spad{nam} of the function in which the error is contained.") (((|Exit|) (|List| (|String|))) "\\spad{error(lmsg)} displays error message \\spad{lmsg} and terminates.") (((|Exit|) (|String|)) "\\spad{error(msg)} displays error message \\spad{msg} and terminates."))) 
 NIL 
 NIL 
-(-309 -2174 S) 
+(-309 -2173 S) 
 ((|constructor| (NIL "This package allows a map from any expression space into any object to be lifted to a kernel over the expression set,{} using a given property of the operator of the kernel.")) (|map| ((|#2| (|Mapping| |#2| |#1|) (|String|) (|Kernel| |#1|)) "\\spad{map(f, p, k)} uses the property \\spad{p} of the operator of \\spad{k},{} in order to lift \\spad{f} and apply it to \\spad{k}."))) 
 NIL 
 NIL 
-(-310 E -2174) 
+(-310 E -2173) 
 ((|constructor| (NIL "This package allows a mapping \\spad{E} \\spad{->} \\spad{F} to be lifted to a kernel over \\spad{E}; This lifting can fail if the operator of the kernel cannot be applied in \\spad{F}; Do not use this package with \\spad{E} = \\spad{F},{} since this may drop some properties of the operators.")) (|map| ((|#2| (|Mapping| |#2| |#1|) (|Kernel| |#1|)) "\\spad{map(f, k)} returns \\spad{g = op(f(a1),...,f(an))} where \\spad{k = op(a1,...,an)}."))) 
 NIL 
 NIL 
@@ -1216,7 +1216,7 @@ NIL
 ((|constructor| (NIL "This category provides \\spadfun{eval} operations. A domain may belong to this category if it is possible to make ``evaluation\\spad{''} substitutions.")) (|eval| (($ $ (|List| (|Equation| |#1|))) "\\spad{eval(f, [x1 = v1,...,xn = vn])} replaces \\spad{xi} by \\spad{vi} in \\spad{f}.") (($ $ (|Equation| |#1|)) "\\spad{eval(f,x = v)} replaces \\spad{x} by \\spad{v} in \\spad{f}."))) 
 NIL 
 NIL 
-(-322 -2174) 
+(-322 -2173) 
 ((|constructor| (NIL "This package is to be used in conjuction with \\indented{12}{the CycleIndicators package. It provides an evaluation} \\indented{12}{function for SymmetricPolynomials.}")) (|eval| ((|#1| (|Mapping| |#1| (|Integer|)) (|SymmetricPolynomial| (|Fraction| (|Integer|)))) "\\spad{eval(f,s)} evaluates the cycle index \\spad{s} by applying \\indented{1}{the function \\spad{f} to each integer in a monomial partition,{}} \\indented{1}{forms their product and sums the results over all monomials.}"))) 
 NIL 
 NIL 
@@ -1244,7 +1244,7 @@ NIL
 ((|constructor| (NIL "Expressions involving symbolic functions.")) (|squareFreePolynomial| (((|Factored| (|SparseUnivariatePolynomial| $)) (|SparseUnivariatePolynomial| $)) "\\spad{squareFreePolynomial(p)} \\undocumented{}")) (|factorPolynomial| (((|Factored| (|SparseUnivariatePolynomial| $)) (|SparseUnivariatePolynomial| $)) "\\spad{factorPolynomial(p)} \\undocumented{}")) (|simplifyPower| (($ $ (|Integer|)) "simplifyPower?(\\spad{f},{}\\spad{n}) \\undocumented{}")) (|number?| (((|Boolean|) $) "\\spad{number?(f)} tests if \\spad{f} is rational")) (|reduce| (($ $) "\\spad{reduce(f)} simplifies all the unreduced algebraic quantities present in \\spad{f} by applying their defining relations."))) 
 ((-4504 -2225 (-12 (|has| |#1| (-570)) (-2225 (|has| |#1| (-1080)) (|has| |#1| (-487)))) (|has| |#1| (-1080)) (|has| |#1| (-487))) (-4502 |has| |#1| (-175)) (-4501 |has| |#1| (-175)) ((-4509 "*") |has| |#1| (-570)) (-4500 |has| |#1| (-570)) (-4505 |has| |#1| (-570)) (-4499 |has| |#1| (-570))) 
 ((-2225 (|HasCategory| |#1| (LIST (QUOTE -1069) (LIST (QUOTE -421) (QUOTE (-578))))) (-12 (|HasCategory| |#1| (QUOTE (-570))) (|HasCategory| |#1| (LIST (QUOTE -1069) (QUOTE (-578)))))) (|HasCategory| |#1| (QUOTE (-570))) (-2225 (|HasCategory| |#1| (QUOTE (-570))) (|HasCategory| |#1| (QUOTE (-1080)))) (|HasCategory| |#1| (QUOTE (-21))) (-2225 (|HasCategory| |#1| (LIST (QUOTE -1069) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasCategory| |#1| (QUOTE (-570)))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-2225 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-1080)))) (|HasCategory| |#1| (QUOTE (-1080))) (-2225 (-12 (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (LIST (QUOTE -660) (QUOTE (-578))))) (-12 (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (LIST (QUOTE -660) (QUOTE (-578))))) (-12 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (LIST (QUOTE -660) (QUOTE (-578))))) (-12 (|HasCategory| |#1| (QUOTE (-570))) (|HasCategory| |#1| (LIST (QUOTE -660) (QUOTE (-578))))) (-12 (|HasCategory| |#1| (QUOTE (-1080))) (|HasCategory| |#1| (LIST (QUOTE -660) (QUOTE (-578)))))) (-2225 (|HasCategory| |#1| (QUOTE (-487))) (|HasCategory| |#1| (QUOTE (-1143)))) (|HasCategory| |#1| (QUOTE (-487))) (|HasCategory| |#1| (LIST (QUOTE -633) (QUOTE (-550)))) (-2225 (|HasCategory| |#1| (QUOTE (-1080))) (|HasCategory| |#1| (LIST (QUOTE -1069) (QUOTE (-578))))) (|HasCategory| |#1| (LIST (QUOTE -1069) (QUOTE (-578)))) (|HasCategory| |#1| (LIST (QUOTE -911) (QUOTE (-392)))) (|HasCategory| |#1| (LIST (QUOTE -911) (QUOTE (-578)))) (|HasCategory| |#1| (LIST (QUOTE -633) (LIST (QUOTE -917) (QUOTE (-392))))) (|HasCategory| |#1| (LIST (QUOTE -633) (LIST (QUOTE -917) (QUOTE (-578))))) (-12 (|HasCategory| |#1| (QUOTE (-570))) (|HasCategory| |#1| (LIST (QUOTE -1069) (QUOTE (-578))))) (-2225 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-570))) (|HasCategory| |#1| (QUOTE (-1080)))) (-2225 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-570))) (|HasCategory| |#1| (QUOTE (-1080)))) (-2225 (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-570))) (|HasCategory| |#1| (QUOTE (-1080)))) (-12 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-570)))) (-2225 (|HasCategory| |#1| (QUOTE (-487))) (|HasCategory| |#1| (QUOTE (-570)))) (-12 (|HasCategory| |#1| (QUOTE (-1080))) (|HasCategory| |#1| (LIST (QUOTE -660) (QUOTE (-578))))) (-2225 (|HasCategory| |#1| (QUOTE (-21))) (-12 (|HasCategory| |#1| (QUOTE (-1080))) (|HasCategory| |#1| (LIST (QUOTE -660) (QUOTE (-578)))))) (-2225 (|HasCategory| |#1| (QUOTE (-25))) (-12 (|HasCategory| |#1| (QUOTE (-1080))) (|HasCategory| |#1| (LIST (QUOTE -660) (QUOTE (-578))))) (|HasCategory| |#1| (QUOTE (-1143)))) (-2225 (|HasCategory| |#1| (QUOTE (-25))) (-12 (|HasCategory| |#1| (QUOTE (-1080))) (|HasCategory| |#1| (LIST (QUOTE -660) (QUOTE (-578)))))) (-2225 (|HasCategory| |#1| (QUOTE (-487))) (|HasCategory| |#1| (QUOTE (-1080)))) (-2225 (-12 (|HasCategory| |#1| (LIST (QUOTE -1069) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasCategory| |#1| (QUOTE (-570)))) (-12 (|HasCategory| |#1| (QUOTE (-570))) (|HasCategory| |#1| (LIST (QUOTE -1069) (QUOTE (-578)))))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-1143))) (|HasCategory| |#1| (LIST (QUOTE -1069) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasCategory| $ (QUOTE (-1080))) (|HasCategory| $ (LIST (QUOTE -1069) (QUOTE (-578))))) 
-(-329 R -2174) 
+(-329 R -2173) 
 ((|constructor| (NIL "Taylor series solutions of explicit ODE\\spad{'s}.")) (|seriesSolve| (((|Any|) |#2| (|BasicOperator|) (|Equation| |#2|) (|List| |#2|)) "\\spad{seriesSolve(eq, y, x = a, [b0,...,bn])} is equivalent to \\spad{seriesSolve(eq = 0, y, x = a, [b0,...,b(n-1)])}.") (((|Any|) |#2| (|BasicOperator|) (|Equation| |#2|) (|Equation| |#2|)) "\\spad{seriesSolve(eq, y, x = a, y a = b)} is equivalent to \\spad{seriesSolve(eq=0, y, x=a, y a = b)}.") (((|Any|) |#2| (|BasicOperator|) (|Equation| |#2|) |#2|) "\\spad{seriesSolve(eq, y, x = a, b)} is equivalent to \\spad{seriesSolve(eq = 0, y, x = a, y a = b)}.") (((|Any|) (|Equation| |#2|) (|BasicOperator|) (|Equation| |#2|) |#2|) "\\spad{seriesSolve(eq,y, x=a, b)} is equivalent to \\spad{seriesSolve(eq, y, x=a, y a = b)}.") (((|Any|) (|List| |#2|) (|List| (|BasicOperator|)) (|Equation| |#2|) (|List| (|Equation| |#2|))) "\\spad{seriesSolve([eq1,...,eqn], [y1,...,yn], x = a,[y1 a = b1,..., yn a = bn])} is equivalent to \\spad{seriesSolve([eq1=0,...,eqn=0], [y1,...,yn], x = a, [y1 a = b1,..., yn a = bn])}.") (((|Any|) (|List| |#2|) (|List| (|BasicOperator|)) (|Equation| |#2|) (|List| |#2|)) "\\spad{seriesSolve([eq1,...,eqn], [y1,...,yn], x=a, [b1,...,bn])} is equivalent to \\spad{seriesSolve([eq1=0,...,eqn=0], [y1,...,yn], x=a, [b1,...,bn])}.") (((|Any|) (|List| (|Equation| |#2|)) (|List| (|BasicOperator|)) (|Equation| |#2|) (|List| |#2|)) "\\spad{seriesSolve([eq1,...,eqn], [y1,...,yn], x=a, [b1,...,bn])} is equivalent to \\spad{seriesSolve([eq1,...,eqn], [y1,...,yn], x = a, [y1 a = b1,..., yn a = bn])}.") (((|Any|) (|List| (|Equation| |#2|)) (|List| (|BasicOperator|)) (|Equation| |#2|) (|List| (|Equation| |#2|))) "\\spad{seriesSolve([eq1,...,eqn],[y1,...,yn],x = a,[y1 a = b1,...,yn a = bn])} returns a taylor series solution of \\spad{[eq1,...,eqn]} around \\spad{x = a} with initial conditions \\spad{yi(a) = bi}. Note: eqi must be of the form \\spad{fi(x, y1 x, y2 x,..., yn x) y1'(x) + gi(x, y1 x, y2 x,..., yn x) = h(x, y1 x, y2 x,..., yn x)}.") (((|Any|) (|Equation| |#2|) (|BasicOperator|) (|Equation| |#2|) (|List| |#2|)) "\\spad{seriesSolve(eq,y,x=a,[b0,...,b(n-1)])} returns a Taylor series solution of \\spad{eq} around \\spad{x = a} with initial conditions \\spad{y(a) = b0},{} \\spad{y'(a) = b1},{} \\spad{y''(a) = b2},{} ...,{}\\spad{y(n-1)(a) = b(n-1)} \\spad{eq} must be of the form \\spad{f(x, y x, y'(x),..., y(n-1)(x)) y(n)(x) + g(x,y x,y'(x),...,y(n-1)(x)) = h(x,y x, y'(x),..., y(n-1)(x))}.") (((|Any|) (|Equation| |#2|) (|BasicOperator|) (|Equation| |#2|) (|Equation| |#2|)) "\\spad{seriesSolve(eq,y,x=a, y a = b)} returns a Taylor series solution of \\spad{eq} around \\spad{x} = a with initial condition \\spad{y(a) = b}. Note: \\spad{eq} must be of the form \\spad{f(x, y x) y'(x) + g(x, y x) = h(x, y x)}."))) 
 NIL 
 NIL 
@@ -1255,7 +1255,7 @@ NIL
 (-331 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."))) 
 (((-4509 "*") |has| |#1| (-175)) (-4500 |has| |#1| (-570)) (-4505 |has| |#1| (-376)) (-4499 |has| |#1| (-376)) (-4501 . T) (-4502 . T) (-4504 . T)) 
-((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasCategory| |#1| (QUOTE (-570))) (|HasCategory| |#1| (QUOTE (-175))) (-2225 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-570)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (LIST (QUOTE -927) (QUOTE (-1207)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -421) (QUOTE (-578))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -421) (QUOTE (-578))) (|devaluate| |#1|)))) (|HasCategory| (-421 (-578)) (QUOTE (-1143))) (|HasCategory| |#1| (QUOTE (-376))) (-2225 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-570)))) (-2225 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-570)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -421) (QUOTE (-578)))))) (|HasSignature| |#1| (LIST (QUOTE -2863) (LIST (|devaluate| |#1|) (QUOTE (-1207)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -421) (QUOTE (-578)))))) (-2225 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-988))) (|HasCategory| |#1| (QUOTE (-1233))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasSignature| |#1| (LIST (QUOTE -1369) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1207))))) (|HasSignature| |#1| (LIST (QUOTE -1880) (LIST (LIST (QUOTE -666) (QUOTE (-1207))) (|devaluate| |#1|))))))) 
+((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasCategory| |#1| (QUOTE (-570))) (|HasCategory| |#1| (QUOTE (-175))) (-2225 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-570)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (LIST (QUOTE -927) (QUOTE (-1207)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -421) (QUOTE (-578))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -421) (QUOTE (-578))) (|devaluate| |#1|)))) (|HasCategory| (-421 (-578)) (QUOTE (-1143))) (|HasCategory| |#1| (QUOTE (-376))) (-2225 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-570)))) (-2225 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-570)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -421) (QUOTE (-578)))))) (|HasSignature| |#1| (LIST (QUOTE -2864) (LIST (|devaluate| |#1|) (QUOTE (-1207)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -421) (QUOTE (-578)))))) (-2225 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-988))) (|HasCategory| |#1| (QUOTE (-1233))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasSignature| |#1| (LIST (QUOTE -2924) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1207))))) (|HasSignature| |#1| (LIST (QUOTE -1880) (LIST (LIST (QUOTE -666) (QUOTE (-1207))) (|devaluate| |#1|))))))) 
 (-332 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 
@@ -1288,11 +1288,11 @@ NIL
 ((|constructor| (NIL "\\indented{1}{A FlexibleArray is the notion of an array intended to allow for growth} at the end only. Hence the following efficient operations \\indented{2}{\\spad{append(x,a)} meaning append item \\spad{x} at the end of the array \\spad{a}} \\indented{2}{\\spad{delete(a,n)} meaning delete the last item from the array \\spad{a}} Flexible arrays support the other operations inherited from \\spadtype{ExtensibleLinearAggregate}. However,{} these are not efficient. Flexible arrays combine the \\spad{O(1)} access time property of arrays with growing and shrinking at the end in \\spad{O(1)} (average) time. This is done by using an ordinary array which may have zero or more empty slots at the end. When the array becomes full it is copied into a new larger (50\\% larger) array. Conversely,{} when the array becomes less than 1/2 full,{} it is copied into a smaller array. Flexible arrays provide for an efficient implementation of many data structures in particular heaps,{} stacks and sets."))) 
 ((-4508 . T) (-4507 . T)) 
 ((-2225 (-12 (|HasCategory| |#1| (QUOTE (-871))) (|HasCategory| |#1| (LIST (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1131))) (|HasCategory| |#1| (LIST (QUOTE -321) (|devaluate| |#1|))))) (-2225 (-12 (|HasCategory| |#1| (QUOTE (-1131))) (|HasCategory| |#1| (LIST (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -632) (QUOTE (-886))))) (|HasCategory| |#1| (LIST (QUOTE -633) (QUOTE (-550)))) (-2225 (|HasCategory| |#1| (QUOTE (-871))) (|HasCategory| |#1| (QUOTE (-1131)))) (|HasCategory| |#1| (QUOTE (-871))) (-2225 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-871))) (|HasCategory| |#1| (QUOTE (-1131)))) (|HasCategory| (-578) (QUOTE (-871))) (|HasCategory| |#1| (QUOTE (-1131))) (|HasCategory| |#1| (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1131))) (|HasCategory| |#1| (LIST (QUOTE -321) (|devaluate| |#1|))))) 
-(-340 S -2174) 
+(-340 S -2173) 
 ((|constructor| (NIL "FiniteAlgebraicExtensionField {\\em F} is the category of fields which are finite algebraic extensions of the field {\\em F}. If {\\em F} is finite then any finite algebraic extension of {\\em F} is finite,{} too. Let {\\em K} be a finite algebraic extension of the finite field {\\em F}. The exponentiation of elements of {\\em K} defines a \\spad{Z}-module structure on the multiplicative group of {\\em K}. The additive group of {\\em K} becomes a module over the ring of polynomials over {\\em F} via the operation \\spadfun{linearAssociatedExp}(a:K,{}f:SparseUnivariatePolynomial \\spad{F}) which is linear over {\\em F},{} \\spadignore{i.e.} for elements {\\em a} from {\\em K},{} {\\em c,d} from {\\em F} and {\\em f,g} univariate polynomials over {\\em F} we have \\spadfun{linearAssociatedExp}(a,{}cf+dg) equals {\\em c} times \\spadfun{linearAssociatedExp}(a,{}\\spad{f}) plus {\\em d} times \\spadfun{linearAssociatedExp}(a,{}\\spad{g}). Therefore \\spadfun{linearAssociatedExp} is defined completely by its action on monomials from {\\em F[X]}: \\spadfun{linearAssociatedExp}(a,{}monomial(1,{}\\spad{k})\\spad{\\$}SUP(\\spad{F})) is defined to be \\spadfun{Frobenius}(a,{}\\spad{k}) which is {\\em a**(q**k)} where {\\em q=size()\\$F}. The operations order and discreteLog associated with the multiplicative exponentiation have additive analogues associated to the operation \\spadfun{linearAssociatedExp}. These are the functions \\spadfun{linearAssociatedOrder} and \\spadfun{linearAssociatedLog},{} respectively.")) (|linearAssociatedLog| (((|Union| (|SparseUnivariatePolynomial| |#2|) "failed") $ $) "\\spad{linearAssociatedLog(b,a)} returns a polynomial {\\em g},{} such that the \\spadfun{linearAssociatedExp}(\\spad{b},{}\\spad{g}) equals {\\em a}. If there is no such polynomial {\\em g},{} then \\spadfun{linearAssociatedLog} fails.") (((|SparseUnivariatePolynomial| |#2|) $) "\\spad{linearAssociatedLog(a)} returns a polynomial {\\em g},{} such that \\spadfun{linearAssociatedExp}(normalElement(),{}\\spad{g}) equals {\\em a}.")) (|linearAssociatedOrder| (((|SparseUnivariatePolynomial| |#2|) $) "\\spad{linearAssociatedOrder(a)} retruns the monic polynomial {\\em g} of least degree,{} such that \\spadfun{linearAssociatedExp}(a,{}\\spad{g}) is 0.")) (|linearAssociatedExp| (($ $ (|SparseUnivariatePolynomial| |#2|)) "\\spad{linearAssociatedExp(a,f)} is linear over {\\em F},{} \\spadignore{i.e.} for elements {\\em a} from {\\em \\$},{} {\\em c,d} form {\\em F} and {\\em f,g} univariate polynomials over {\\em F} we have \\spadfun{linearAssociatedExp}(a,{}cf+dg) equals {\\em c} times \\spadfun{linearAssociatedExp}(a,{}\\spad{f}) plus {\\em d} times \\spadfun{linearAssociatedExp}(a,{}\\spad{g}). Therefore \\spadfun{linearAssociatedExp} is defined completely by its action on monomials from {\\em F[X]}: \\spadfun{linearAssociatedExp}(a,{}monomial(1,{}\\spad{k})\\spad{\\$}SUP(\\spad{F})) is defined to be \\spadfun{Frobenius}(a,{}\\spad{k}) which is {\\em a**(q**k)},{} where {\\em q=size()\\$F}.")) (|generator| (($) "\\spad{generator()} returns a root of the defining polynomial. This element generates the field as an algebra over the ground field.")) (|normal?| (((|Boolean|) $) "\\spad{normal?(a)} tests whether the element \\spad{a} is normal over the ground field \\spad{F},{} \\spadignore{i.e.} \\spad{a**(q**i), 0 <= i <= extensionDegree()-1} is an \\spad{F}-basis,{} where \\spad{q = size()\\$F}. Implementation according to Lidl/Niederreiter: Theorem 2.39.")) (|normalElement| (($) "\\spad{normalElement()} returns a element,{} normal over the ground field \\spad{F},{} \\spadignore{i.e.} \\spad{a**(q**i), 0 <= i < extensionDegree()} is an \\spad{F}-basis,{} where \\spad{q = size()\\$F}. At the first call,{} the element is computed by \\spadfunFrom{createNormalElement}{FiniteAlgebraicExtensionField} then cached in a global variable. On subsequent calls,{} the element is retrieved by referencing the global variable.")) (|createNormalElement| (($) "\\spad{createNormalElement()} computes a normal element over the ground field \\spad{F},{} that is,{} \\spad{a**(q**i), 0 <= i < extensionDegree()} is an \\spad{F}-basis,{} where \\spad{q = size()\\$F}. Reference: Such an element exists Lidl/Niederreiter: Theorem 2.35.")) (|trace| (($ $ (|PositiveInteger|)) "\\spad{trace(a,d)} computes the trace of \\spad{a} with respect to the field of extension degree \\spad{d} over the ground field of size \\spad{q}. Error: if \\spad{d} does not divide the extension degree of \\spad{a}. Note: \\spad{trace(a,d) = reduce(+,[a**(q**(d*i)) for i in 0..n/d])}.") ((|#2| $) "\\spad{trace(a)} computes the trace of \\spad{a} with respect to the field considered as an algebra with 1 over the ground field \\spad{F}.")) (|norm| (($ $ (|PositiveInteger|)) "\\spad{norm(a,d)} computes the norm of \\spad{a} with respect to the field of extension degree \\spad{d} over the ground field of size. Error: if \\spad{d} does not divide the extension degree of \\spad{a}. Note: norm(a,{}\\spad{d}) = reduce(*,{}[a**(\\spad{q**}(d*i)) for \\spad{i} in 0..\\spad{n/d}])") ((|#2| $) "\\spad{norm(a)} computes the norm of \\spad{a} with respect to the field considered as an algebra with 1 over the ground field \\spad{F}.")) (|degree| (((|PositiveInteger|) $) "\\spad{degree(a)} returns the degree of the minimal polynomial of an element \\spad{a} over the ground field \\spad{F}.")) (|extensionDegree| (((|PositiveInteger|)) "\\spad{extensionDegree()} returns the degree of field extension.")) (|definingPolynomial| (((|SparseUnivariatePolynomial| |#2|)) "\\spad{definingPolynomial()} returns the polynomial used to define the field extension.")) (|minimalPolynomial| (((|SparseUnivariatePolynomial| $) $ (|PositiveInteger|)) "\\spad{minimalPolynomial(x,n)} computes the minimal polynomial of \\spad{x} over the field of extension degree \\spad{n} over the ground field \\spad{F}.") (((|SparseUnivariatePolynomial| |#2|) $) "\\spad{minimalPolynomial(a)} returns the minimal polynomial of an element \\spad{a} over the ground field \\spad{F}.")) (|represents| (($ (|Vector| |#2|)) "\\spad{represents([a1,..,an])} returns \\spad{a1*v1 + ... + an*vn},{} where \\spad{v1},{}...,{}\\spad{vn} are the elements of the fixed basis.")) (|coordinates| (((|Matrix| |#2|) (|Vector| $)) "\\spad{coordinates([v1,...,vm])} returns the coordinates of the \\spad{vi}\\spad{'s} with to the fixed basis. The coordinates of \\spad{vi} are contained in the \\spad{i}th row of the matrix returned by this function.") (((|Vector| |#2|) $) "\\spad{coordinates(a)} returns the coordinates of \\spad{a} with respect to the fixed \\spad{F}-vectorspace basis.")) (|basis| (((|Vector| $) (|PositiveInteger|)) "\\spad{basis(n)} returns a fixed basis of a subfield of \\spad{\\$} as \\spad{F}-vectorspace.") (((|Vector| $)) "\\spad{basis()} returns a fixed basis of \\spad{\\$} as \\spad{F}-vectorspace."))) 
 NIL 
 ((|HasCategory| |#2| (QUOTE (-381)))) 
-(-341 -2174) 
+(-341 -2173) 
 ((|constructor| (NIL "FiniteAlgebraicExtensionField {\\em F} is the category of fields which are finite algebraic extensions of the field {\\em F}. If {\\em F} is finite then any finite algebraic extension of {\\em F} is finite,{} too. Let {\\em K} be a finite algebraic extension of the finite field {\\em F}. The exponentiation of elements of {\\em K} defines a \\spad{Z}-module structure on the multiplicative group of {\\em K}. The additive group of {\\em K} becomes a module over the ring of polynomials over {\\em F} via the operation \\spadfun{linearAssociatedExp}(a:K,{}f:SparseUnivariatePolynomial \\spad{F}) which is linear over {\\em F},{} \\spadignore{i.e.} for elements {\\em a} from {\\em K},{} {\\em c,d} from {\\em F} and {\\em f,g} univariate polynomials over {\\em F} we have \\spadfun{linearAssociatedExp}(a,{}cf+dg) equals {\\em c} times \\spadfun{linearAssociatedExp}(a,{}\\spad{f}) plus {\\em d} times \\spadfun{linearAssociatedExp}(a,{}\\spad{g}). Therefore \\spadfun{linearAssociatedExp} is defined completely by its action on monomials from {\\em F[X]}: \\spadfun{linearAssociatedExp}(a,{}monomial(1,{}\\spad{k})\\spad{\\$}SUP(\\spad{F})) is defined to be \\spadfun{Frobenius}(a,{}\\spad{k}) which is {\\em a**(q**k)} where {\\em q=size()\\$F}. The operations order and discreteLog associated with the multiplicative exponentiation have additive analogues associated to the operation \\spadfun{linearAssociatedExp}. These are the functions \\spadfun{linearAssociatedOrder} and \\spadfun{linearAssociatedLog},{} respectively.")) (|linearAssociatedLog| (((|Union| (|SparseUnivariatePolynomial| |#1|) "failed") $ $) "\\spad{linearAssociatedLog(b,a)} returns a polynomial {\\em g},{} such that the \\spadfun{linearAssociatedExp}(\\spad{b},{}\\spad{g}) equals {\\em a}. If there is no such polynomial {\\em g},{} then \\spadfun{linearAssociatedLog} fails.") (((|SparseUnivariatePolynomial| |#1|) $) "\\spad{linearAssociatedLog(a)} returns a polynomial {\\em g},{} such that \\spadfun{linearAssociatedExp}(normalElement(),{}\\spad{g}) equals {\\em a}.")) (|linearAssociatedOrder| (((|SparseUnivariatePolynomial| |#1|) $) "\\spad{linearAssociatedOrder(a)} retruns the monic polynomial {\\em g} of least degree,{} such that \\spadfun{linearAssociatedExp}(a,{}\\spad{g}) is 0.")) (|linearAssociatedExp| (($ $ (|SparseUnivariatePolynomial| |#1|)) "\\spad{linearAssociatedExp(a,f)} is linear over {\\em F},{} \\spadignore{i.e.} for elements {\\em a} from {\\em \\$},{} {\\em c,d} form {\\em F} and {\\em f,g} univariate polynomials over {\\em F} we have \\spadfun{linearAssociatedExp}(a,{}cf+dg) equals {\\em c} times \\spadfun{linearAssociatedExp}(a,{}\\spad{f}) plus {\\em d} times \\spadfun{linearAssociatedExp}(a,{}\\spad{g}). Therefore \\spadfun{linearAssociatedExp} is defined completely by its action on monomials from {\\em F[X]}: \\spadfun{linearAssociatedExp}(a,{}monomial(1,{}\\spad{k})\\spad{\\$}SUP(\\spad{F})) is defined to be \\spadfun{Frobenius}(a,{}\\spad{k}) which is {\\em a**(q**k)},{} where {\\em q=size()\\$F}.")) (|generator| (($) "\\spad{generator()} returns a root of the defining polynomial. This element generates the field as an algebra over the ground field.")) (|normal?| (((|Boolean|) $) "\\spad{normal?(a)} tests whether the element \\spad{a} is normal over the ground field \\spad{F},{} \\spadignore{i.e.} \\spad{a**(q**i), 0 <= i <= extensionDegree()-1} is an \\spad{F}-basis,{} where \\spad{q = size()\\$F}. Implementation according to Lidl/Niederreiter: Theorem 2.39.")) (|normalElement| (($) "\\spad{normalElement()} returns a element,{} normal over the ground field \\spad{F},{} \\spadignore{i.e.} \\spad{a**(q**i), 0 <= i < extensionDegree()} is an \\spad{F}-basis,{} where \\spad{q = size()\\$F}. At the first call,{} the element is computed by \\spadfunFrom{createNormalElement}{FiniteAlgebraicExtensionField} then cached in a global variable. On subsequent calls,{} the element is retrieved by referencing the global variable.")) (|createNormalElement| (($) "\\spad{createNormalElement()} computes a normal element over the ground field \\spad{F},{} that is,{} \\spad{a**(q**i), 0 <= i < extensionDegree()} is an \\spad{F}-basis,{} where \\spad{q = size()\\$F}. Reference: Such an element exists Lidl/Niederreiter: Theorem 2.35.")) (|trace| (($ $ (|PositiveInteger|)) "\\spad{trace(a,d)} computes the trace of \\spad{a} with respect to the field of extension degree \\spad{d} over the ground field of size \\spad{q}. Error: if \\spad{d} does not divide the extension degree of \\spad{a}. Note: \\spad{trace(a,d) = reduce(+,[a**(q**(d*i)) for i in 0..n/d])}.") ((|#1| $) "\\spad{trace(a)} computes the trace of \\spad{a} with respect to the field considered as an algebra with 1 over the ground field \\spad{F}.")) (|norm| (($ $ (|PositiveInteger|)) "\\spad{norm(a,d)} computes the norm of \\spad{a} with respect to the field of extension degree \\spad{d} over the ground field of size. Error: if \\spad{d} does not divide the extension degree of \\spad{a}. Note: norm(a,{}\\spad{d}) = reduce(*,{}[a**(\\spad{q**}(d*i)) for \\spad{i} in 0..\\spad{n/d}])") ((|#1| $) "\\spad{norm(a)} computes the norm of \\spad{a} with respect to the field considered as an algebra with 1 over the ground field \\spad{F}.")) (|degree| (((|PositiveInteger|) $) "\\spad{degree(a)} returns the degree of the minimal polynomial of an element \\spad{a} over the ground field \\spad{F}.")) (|extensionDegree| (((|PositiveInteger|)) "\\spad{extensionDegree()} returns the degree of field extension.")) (|definingPolynomial| (((|SparseUnivariatePolynomial| |#1|)) "\\spad{definingPolynomial()} returns the polynomial used to define the field extension.")) (|minimalPolynomial| (((|SparseUnivariatePolynomial| $) $ (|PositiveInteger|)) "\\spad{minimalPolynomial(x,n)} computes the minimal polynomial of \\spad{x} over the field of extension degree \\spad{n} over the ground field \\spad{F}.") (((|SparseUnivariatePolynomial| |#1|) $) "\\spad{minimalPolynomial(a)} returns the minimal polynomial of an element \\spad{a} over the ground field \\spad{F}.")) (|represents| (($ (|Vector| |#1|)) "\\spad{represents([a1,..,an])} returns \\spad{a1*v1 + ... + an*vn},{} where \\spad{v1},{}...,{}\\spad{vn} are the elements of the fixed basis.")) (|coordinates| (((|Matrix| |#1|) (|Vector| $)) "\\spad{coordinates([v1,...,vm])} returns the coordinates of the \\spad{vi}\\spad{'s} with to the fixed basis. The coordinates of \\spad{vi} are contained in the \\spad{i}th row of the matrix returned by this function.") (((|Vector| |#1|) $) "\\spad{coordinates(a)} returns the coordinates of \\spad{a} with respect to the fixed \\spad{F}-vectorspace basis.")) (|basis| (((|Vector| $) (|PositiveInteger|)) "\\spad{basis(n)} returns a fixed basis of a subfield of \\spad{\\$} as \\spad{F}-vectorspace.") (((|Vector| $)) "\\spad{basis()} returns a fixed basis of \\spad{\\$} as \\spad{F}-vectorspace."))) 
 ((-4499 . T) (-4505 . T) (-4500 . T) ((-4509 "*") . T) (-4501 . T) (-4502 . T) (-4504 . T)) 
 NIL 
@@ -1316,15 +1316,15 @@ NIL
 ((|constructor| (NIL "\\indented{1}{Lift a map to finite divisors.} Author: Manuel Bronstein Date Created: 1988 Date Last Updated: 19 May 1993")) (|map| (((|FiniteDivisor| |#5| |#6| |#7| |#8|) (|Mapping| |#5| |#1|) (|FiniteDivisor| |#1| |#2| |#3| |#4|)) "\\spad{map(f,d)} \\undocumented{}"))) 
 NIL 
 NIL 
-(-347 S -2174 UP UPUP R) 
+(-347 S -2173 UP UPUP R) 
 ((|constructor| (NIL "This category describes finite rational divisors on a curve,{} that is finite formal sums SUM(\\spad{n} * \\spad{P}) where the \\spad{n}\\spad{'s} are integers and the \\spad{P}\\spad{'s} are finite rational points on the curve.")) (|generator| (((|Union| |#5| "failed") $) "\\spad{generator(d)} returns \\spad{f} if \\spad{(f) = d},{} \"failed\" if \\spad{d} is not principal.")) (|principal?| (((|Boolean|) $) "\\spad{principal?(D)} tests if the argument is the divisor of a function.")) (|reduce| (($ $) "\\spad{reduce(D)} converts \\spad{D} to some reduced form (the reduced forms can be differents in different implementations).")) (|decompose| (((|Record| (|:| |id| (|FractionalIdeal| |#3| (|Fraction| |#3|) |#4| |#5|)) (|:| |principalPart| |#5|)) $) "\\spad{decompose(d)} returns \\spad{[id, f]} where \\spad{d = (id) + div(f)}.")) (|divisor| (($ |#5| |#3| |#3| |#3| |#2|) "\\spad{divisor(h, d, d', g, r)} returns the sum of all the finite points where \\spad{h/d} has residue \\spad{r}. \\spad{h} must be integral. \\spad{d} must be squarefree. \\spad{d'} is some derivative of \\spad{d} (not necessarily dd/dx). \\spad{g = gcd(d,discriminant)} contains the ramified zeros of \\spad{d}") (($ |#2| |#2| (|Integer|)) "\\spad{divisor(a, b, n)} makes the divisor \\spad{nP} where \\spad{P:} \\spad{(x = a, y = b)}. \\spad{P} is allowed to be singular if \\spad{n} is a multiple of the rank.") (($ |#2| |#2|) "\\spad{divisor(a, b)} makes the divisor \\spad{P:} \\spad{(x = a, y = b)}. Error: if \\spad{P} is singular.") (($ |#5|) "\\spad{divisor(g)} returns the divisor of the function \\spad{g}.") (($ (|FractionalIdeal| |#3| (|Fraction| |#3|) |#4| |#5|)) "\\spad{divisor(I)} makes a divisor \\spad{D} from an ideal \\spad{I}.")) (|ideal| (((|FractionalIdeal| |#3| (|Fraction| |#3|) |#4| |#5|) $) "\\spad{ideal(D)} returns the ideal corresponding to a divisor \\spad{D}."))) 
 NIL 
 NIL 
-(-348 -2174 UP UPUP R) 
+(-348 -2173 UP UPUP R) 
 ((|constructor| (NIL "This category describes finite rational divisors on a curve,{} that is finite formal sums SUM(\\spad{n} * \\spad{P}) where the \\spad{n}\\spad{'s} are integers and the \\spad{P}\\spad{'s} are finite rational points on the curve.")) (|generator| (((|Union| |#4| "failed") $) "\\spad{generator(d)} returns \\spad{f} if \\spad{(f) = d},{} \"failed\" if \\spad{d} is not principal.")) (|principal?| (((|Boolean|) $) "\\spad{principal?(D)} tests if the argument is the divisor of a function.")) (|reduce| (($ $) "\\spad{reduce(D)} converts \\spad{D} to some reduced form (the reduced forms can be differents in different implementations).")) (|decompose| (((|Record| (|:| |id| (|FractionalIdeal| |#2| (|Fraction| |#2|) |#3| |#4|)) (|:| |principalPart| |#4|)) $) "\\spad{decompose(d)} returns \\spad{[id, f]} where \\spad{d = (id) + div(f)}.")) (|divisor| (($ |#4| |#2| |#2| |#2| |#1|) "\\spad{divisor(h, d, d', g, r)} returns the sum of all the finite points where \\spad{h/d} has residue \\spad{r}. \\spad{h} must be integral. \\spad{d} must be squarefree. \\spad{d'} is some derivative of \\spad{d} (not necessarily dd/dx). \\spad{g = gcd(d,discriminant)} contains the ramified zeros of \\spad{d}") (($ |#1| |#1| (|Integer|)) "\\spad{divisor(a, b, n)} makes the divisor \\spad{nP} where \\spad{P:} \\spad{(x = a, y = b)}. \\spad{P} is allowed to be singular if \\spad{n} is a multiple of the rank.") (($ |#1| |#1|) "\\spad{divisor(a, b)} makes the divisor \\spad{P:} \\spad{(x = a, y = b)}. Error: if \\spad{P} is singular.") (($ |#4|) "\\spad{divisor(g)} returns the divisor of the function \\spad{g}.") (($ (|FractionalIdeal| |#2| (|Fraction| |#2|) |#3| |#4|)) "\\spad{divisor(I)} makes a divisor \\spad{D} from an ideal \\spad{I}.")) (|ideal| (((|FractionalIdeal| |#2| (|Fraction| |#2|) |#3| |#4|) $) "\\spad{ideal(D)} returns the ideal corresponding to a divisor \\spad{D}."))) 
 NIL 
 NIL 
-(-349 -2174 UP UPUP R) 
+(-349 -2173 UP UPUP R) 
 ((|constructor| (NIL "This domains implements finite rational divisors on a curve,{} that is finite formal sums SUM(\\spad{n} * \\spad{P}) where the \\spad{n}\\spad{'s} are integers and the \\spad{P}\\spad{'s} are finite rational points on the curve.")) (|lSpaceBasis| (((|Vector| |#4|) $) "\\spad{lSpaceBasis(d)} returns a basis for \\spad{L(d) = {f | (f) >= -d}} as a module over \\spad{K[x]}.")) (|finiteBasis| (((|Vector| |#4|) $) "\\spad{finiteBasis(d)} returns a basis for \\spad{d} as a module over {\\em K[x]}."))) 
 NIL 
 NIL 
@@ -1344,11 +1344,11 @@ NIL
 ((|constructor| (NIL "Lifts a map from rings to function fields over them.")) (|map| ((|#8| (|Mapping| |#5| |#1|) |#4|) "\\spad{map(f, p)} lifts \\spad{f} to \\spad{F1} and applies it to \\spad{p}."))) 
 NIL 
 NIL 
-(-354 S -2174 UP UPUP) 
+(-354 S -2173 UP UPUP) 
 ((|constructor| (NIL "This category is a model for the function field of a plane algebraic curve.")) (|rationalPoints| (((|List| (|List| |#2|))) "\\spad{rationalPoints()} returns the list of all the affine rational points.")) (|nonSingularModel| (((|List| (|Polynomial| |#2|)) (|Symbol|)) "\\spad{nonSingularModel(u)} returns the equations in u1,{}...,{}un of an affine non-singular model for the curve.")) (|algSplitSimple| (((|Record| (|:| |num| $) (|:| |den| |#3|) (|:| |derivden| |#3|) (|:| |gd| |#3|)) $ (|Mapping| |#3| |#3|)) "\\spad{algSplitSimple(f, D)} returns \\spad{[h,d,d',g]} such that \\spad{f=h/d},{} \\spad{h} is integral at all the normal places \\spad{w}.\\spad{r}.\\spad{t}. \\spad{D},{} \\spad{d' = Dd},{} \\spad{g = gcd(d, discriminant())} and \\spad{D} is the derivation to use. \\spad{f} must have at most simple finite poles.")) (|hyperelliptic| (((|Union| |#3| "failed")) "\\spad{hyperelliptic()} returns \\spad{p(x)} if the curve is the hyperelliptic defined by \\spad{y**2 = p(x)},{} \"failed\" otherwise.")) (|elliptic| (((|Union| |#3| "failed")) "\\spad{elliptic()} returns \\spad{p(x)} if the curve is the elliptic defined by \\spad{y**2 = p(x)},{} \"failed\" otherwise.")) (|elt| ((|#2| $ |#2| |#2|) "\\spad{elt(f,a,b)} or \\spad{f}(a,{} \\spad{b}) returns the value of \\spad{f} at the point \\spad{(x = a, y = b)} if it is not singular.")) (|primitivePart| (($ $) "\\spad{primitivePart(f)} removes the content of the denominator and the common content of the numerator of \\spad{f}.")) (|differentiate| (($ $ (|Mapping| |#3| |#3|)) "\\spad{differentiate(x, d)} extends the derivation \\spad{d} from UP to \\$ and applies it to \\spad{x}.")) (|integralDerivationMatrix| (((|Record| (|:| |num| (|Matrix| |#3|)) (|:| |den| |#3|)) (|Mapping| |#3| |#3|)) "\\spad{integralDerivationMatrix(d)} extends the derivation \\spad{d} from UP to \\$ and returns (\\spad{M},{} \\spad{Q}) such that the i^th row of \\spad{M} divided by \\spad{Q} form the coordinates of \\spad{d(wi)} with respect to \\spad{(w1,...,wn)} where \\spad{(w1,...,wn)} is the integral basis returned by integralBasis().")) (|integralRepresents| (($ (|Vector| |#3|) |#3|) "\\spad{integralRepresents([A1,...,An], D)} returns \\spad{(A1 w1+...+An wn)/D} where \\spad{(w1,...,wn)} is the integral basis of \\spad{integralBasis()}.")) (|integralCoordinates| (((|Record| (|:| |num| (|Vector| |#3|)) (|:| |den| |#3|)) $) "\\spad{integralCoordinates(f)} returns \\spad{[[A1,...,An], D]} such that \\spad{f = (A1 w1 +...+ An wn) / D} where \\spad{(w1,...,wn)} is the integral basis returned by \\spad{integralBasis()}.")) (|represents| (($ (|Vector| |#3|) |#3|) "\\spad{represents([A0,...,A(n-1)],D)} returns \\spad{(A0 + A1 y +...+ A(n-1)*y**(n-1))/D}.")) (|yCoordinates| (((|Record| (|:| |num| (|Vector| |#3|)) (|:| |den| |#3|)) $) "\\spad{yCoordinates(f)} returns \\spad{[[A1,...,An], D]} such that \\spad{f = (A1 + A2 y +...+ An y**(n-1)) / D}.")) (|inverseIntegralMatrixAtInfinity| (((|Matrix| (|Fraction| |#3|))) "\\spad{inverseIntegralMatrixAtInfinity()} returns \\spad{M} such that \\spad{M (v1,...,vn) = (1, y, ..., y**(n-1))} where \\spad{(v1,...,vn)} is the local integral basis at infinity returned by \\spad{infIntBasis()}.")) (|integralMatrixAtInfinity| (((|Matrix| (|Fraction| |#3|))) "\\spad{integralMatrixAtInfinity()} returns \\spad{M} such that \\spad{(v1,...,vn) = M (1, y, ..., y**(n-1))} where \\spad{(v1,...,vn)} is the local integral basis at infinity returned by \\spad{infIntBasis()}.")) (|inverseIntegralMatrix| (((|Matrix| (|Fraction| |#3|))) "\\spad{inverseIntegralMatrix()} returns \\spad{M} such that \\spad{M (w1,...,wn) = (1, y, ..., y**(n-1))} where \\spad{(w1,...,wn)} is the integral basis of \\spadfunFrom{integralBasis}{FunctionFieldCategory}.")) (|integralMatrix| (((|Matrix| (|Fraction| |#3|))) "\\spad{integralMatrix()} returns \\spad{M} such that \\spad{(w1,...,wn) = M (1, y, ..., y**(n-1))},{} where \\spad{(w1,...,wn)} is the integral basis of \\spadfunFrom{integralBasis}{FunctionFieldCategory}.")) (|reduceBasisAtInfinity| (((|Vector| $) (|Vector| $)) "\\spad{reduceBasisAtInfinity(b1,...,bn)} returns \\spad{(x**i * bj)} for all \\spad{i},{}\\spad{j} such that \\spad{x**i*bj} is locally integral at infinity.")) (|normalizeAtInfinity| (((|Vector| $) (|Vector| $)) "\\spad{normalizeAtInfinity(v)} makes \\spad{v} normal at infinity.")) (|complementaryBasis| (((|Vector| $) (|Vector| $)) "\\spad{complementaryBasis(b1,...,bn)} returns the complementary basis \\spad{(b1',...,bn')} of \\spad{(b1,...,bn)}.")) (|integral?| (((|Boolean|) $ |#3|) "\\spad{integral?(f, p)} tests whether \\spad{f} is locally integral at \\spad{p(x) = 0}.") (((|Boolean|) $ |#2|) "\\spad{integral?(f, a)} tests whether \\spad{f} is locally integral at \\spad{x = a}.") (((|Boolean|) $) "\\spad{integral?()} tests if \\spad{f} is integral over \\spad{k[x]}.")) (|integralAtInfinity?| (((|Boolean|) $) "\\spad{integralAtInfinity?()} tests if \\spad{f} is locally integral at infinity.")) (|integralBasisAtInfinity| (((|Vector| $)) "\\spad{integralBasisAtInfinity()} returns the local integral basis at infinity.")) (|integralBasis| (((|Vector| $)) "\\spad{integralBasis()} returns the integral basis for the curve.")) (|ramified?| (((|Boolean|) |#3|) "\\spad{ramified?(p)} tests whether \\spad{p(x) = 0} is ramified.") (((|Boolean|) |#2|) "\\spad{ramified?(a)} tests whether \\spad{x = a} is ramified.")) (|ramifiedAtInfinity?| (((|Boolean|)) "\\spad{ramifiedAtInfinity?()} tests if infinity is ramified.")) (|singular?| (((|Boolean|) |#3|) "\\spad{singular?(p)} tests whether \\spad{p(x) = 0} is singular.") (((|Boolean|) |#2|) "\\spad{singular?(a)} tests whether \\spad{x = a} is singular.")) (|singularAtInfinity?| (((|Boolean|)) "\\spad{singularAtInfinity?()} tests if there is a singularity at infinity.")) (|branchPoint?| (((|Boolean|) |#3|) "\\spad{branchPoint?(p)} tests whether \\spad{p(x) = 0} is a branch point.") (((|Boolean|) |#2|) "\\spad{branchPoint?(a)} tests whether \\spad{x = a} is a branch point.")) (|branchPointAtInfinity?| (((|Boolean|)) "\\spad{branchPointAtInfinity?()} tests if there is a branch point at infinity.")) (|rationalPoint?| (((|Boolean|) |#2| |#2|) "\\spad{rationalPoint?(a, b)} tests if \\spad{(x=a,y=b)} is on the curve.")) (|absolutelyIrreducible?| (((|Boolean|)) "\\spad{absolutelyIrreducible?()} tests if the curve absolutely irreducible?")) (|genus| (((|NonNegativeInteger|)) "\\spad{genus()} returns the genus of one absolutely irreducible component")) (|numberOfComponents| (((|NonNegativeInteger|)) "\\spad{numberOfComponents()} returns the number of absolutely irreducible components."))) 
 NIL 
 ((|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (QUOTE (-376)))) 
-(-355 -2174 UP UPUP) 
+(-355 -2173 UP UPUP) 
 ((|constructor| (NIL "This category is a model for the function field of a plane algebraic curve.")) (|rationalPoints| (((|List| (|List| |#1|))) "\\spad{rationalPoints()} returns the list of all the affine rational points.")) (|nonSingularModel| (((|List| (|Polynomial| |#1|)) (|Symbol|)) "\\spad{nonSingularModel(u)} returns the equations in u1,{}...,{}un of an affine non-singular model for the curve.")) (|algSplitSimple| (((|Record| (|:| |num| $) (|:| |den| |#2|) (|:| |derivden| |#2|) (|:| |gd| |#2|)) $ (|Mapping| |#2| |#2|)) "\\spad{algSplitSimple(f, D)} returns \\spad{[h,d,d',g]} such that \\spad{f=h/d},{} \\spad{h} is integral at all the normal places \\spad{w}.\\spad{r}.\\spad{t}. \\spad{D},{} \\spad{d' = Dd},{} \\spad{g = gcd(d, discriminant())} and \\spad{D} is the derivation to use. \\spad{f} must have at most simple finite poles.")) (|hyperelliptic| (((|Union| |#2| "failed")) "\\spad{hyperelliptic()} returns \\spad{p(x)} if the curve is the hyperelliptic defined by \\spad{y**2 = p(x)},{} \"failed\" otherwise.")) (|elliptic| (((|Union| |#2| "failed")) "\\spad{elliptic()} returns \\spad{p(x)} if the curve is the elliptic defined by \\spad{y**2 = p(x)},{} \"failed\" otherwise.")) (|elt| ((|#1| $ |#1| |#1|) "\\spad{elt(f,a,b)} or \\spad{f}(a,{} \\spad{b}) returns the value of \\spad{f} at the point \\spad{(x = a, y = b)} if it is not singular.")) (|primitivePart| (($ $) "\\spad{primitivePart(f)} removes the content of the denominator and the common content of the numerator of \\spad{f}.")) (|differentiate| (($ $ (|Mapping| |#2| |#2|)) "\\spad{differentiate(x, d)} extends the derivation \\spad{d} from UP to \\$ and applies it to \\spad{x}.")) (|integralDerivationMatrix| (((|Record| (|:| |num| (|Matrix| |#2|)) (|:| |den| |#2|)) (|Mapping| |#2| |#2|)) "\\spad{integralDerivationMatrix(d)} extends the derivation \\spad{d} from UP to \\$ and returns (\\spad{M},{} \\spad{Q}) such that the i^th row of \\spad{M} divided by \\spad{Q} form the coordinates of \\spad{d(wi)} with respect to \\spad{(w1,...,wn)} where \\spad{(w1,...,wn)} is the integral basis returned by integralBasis().")) (|integralRepresents| (($ (|Vector| |#2|) |#2|) "\\spad{integralRepresents([A1,...,An], D)} returns \\spad{(A1 w1+...+An wn)/D} where \\spad{(w1,...,wn)} is the integral basis of \\spad{integralBasis()}.")) (|integralCoordinates| (((|Record| (|:| |num| (|Vector| |#2|)) (|:| |den| |#2|)) $) "\\spad{integralCoordinates(f)} returns \\spad{[[A1,...,An], D]} such that \\spad{f = (A1 w1 +...+ An wn) / D} where \\spad{(w1,...,wn)} is the integral basis returned by \\spad{integralBasis()}.")) (|represents| (($ (|Vector| |#2|) |#2|) "\\spad{represents([A0,...,A(n-1)],D)} returns \\spad{(A0 + A1 y +...+ A(n-1)*y**(n-1))/D}.")) (|yCoordinates| (((|Record| (|:| |num| (|Vector| |#2|)) (|:| |den| |#2|)) $) "\\spad{yCoordinates(f)} returns \\spad{[[A1,...,An], D]} such that \\spad{f = (A1 + A2 y +...+ An y**(n-1)) / D}.")) (|inverseIntegralMatrixAtInfinity| (((|Matrix| (|Fraction| |#2|))) "\\spad{inverseIntegralMatrixAtInfinity()} returns \\spad{M} such that \\spad{M (v1,...,vn) = (1, y, ..., y**(n-1))} where \\spad{(v1,...,vn)} is the local integral basis at infinity returned by \\spad{infIntBasis()}.")) (|integralMatrixAtInfinity| (((|Matrix| (|Fraction| |#2|))) "\\spad{integralMatrixAtInfinity()} returns \\spad{M} such that \\spad{(v1,...,vn) = M (1, y, ..., y**(n-1))} where \\spad{(v1,...,vn)} is the local integral basis at infinity returned by \\spad{infIntBasis()}.")) (|inverseIntegralMatrix| (((|Matrix| (|Fraction| |#2|))) "\\spad{inverseIntegralMatrix()} returns \\spad{M} such that \\spad{M (w1,...,wn) = (1, y, ..., y**(n-1))} where \\spad{(w1,...,wn)} is the integral basis of \\spadfunFrom{integralBasis}{FunctionFieldCategory}.")) (|integralMatrix| (((|Matrix| (|Fraction| |#2|))) "\\spad{integralMatrix()} returns \\spad{M} such that \\spad{(w1,...,wn) = M (1, y, ..., y**(n-1))},{} where \\spad{(w1,...,wn)} is the integral basis of \\spadfunFrom{integralBasis}{FunctionFieldCategory}.")) (|reduceBasisAtInfinity| (((|Vector| $) (|Vector| $)) "\\spad{reduceBasisAtInfinity(b1,...,bn)} returns \\spad{(x**i * bj)} for all \\spad{i},{}\\spad{j} such that \\spad{x**i*bj} is locally integral at infinity.")) (|normalizeAtInfinity| (((|Vector| $) (|Vector| $)) "\\spad{normalizeAtInfinity(v)} makes \\spad{v} normal at infinity.")) (|complementaryBasis| (((|Vector| $) (|Vector| $)) "\\spad{complementaryBasis(b1,...,bn)} returns the complementary basis \\spad{(b1',...,bn')} of \\spad{(b1,...,bn)}.")) (|integral?| (((|Boolean|) $ |#2|) "\\spad{integral?(f, p)} tests whether \\spad{f} is locally integral at \\spad{p(x) = 0}.") (((|Boolean|) $ |#1|) "\\spad{integral?(f, a)} tests whether \\spad{f} is locally integral at \\spad{x = a}.") (((|Boolean|) $) "\\spad{integral?()} tests if \\spad{f} is integral over \\spad{k[x]}.")) (|integralAtInfinity?| (((|Boolean|) $) "\\spad{integralAtInfinity?()} tests if \\spad{f} is locally integral at infinity.")) (|integralBasisAtInfinity| (((|Vector| $)) "\\spad{integralBasisAtInfinity()} returns the local integral basis at infinity.")) (|integralBasis| (((|Vector| $)) "\\spad{integralBasis()} returns the integral basis for the curve.")) (|ramified?| (((|Boolean|) |#2|) "\\spad{ramified?(p)} tests whether \\spad{p(x) = 0} is ramified.") (((|Boolean|) |#1|) "\\spad{ramified?(a)} tests whether \\spad{x = a} is ramified.")) (|ramifiedAtInfinity?| (((|Boolean|)) "\\spad{ramifiedAtInfinity?()} tests if infinity is ramified.")) (|singular?| (((|Boolean|) |#2|) "\\spad{singular?(p)} tests whether \\spad{p(x) = 0} is singular.") (((|Boolean|) |#1|) "\\spad{singular?(a)} tests whether \\spad{x = a} is singular.")) (|singularAtInfinity?| (((|Boolean|)) "\\spad{singularAtInfinity?()} tests if there is a singularity at infinity.")) (|branchPoint?| (((|Boolean|) |#2|) "\\spad{branchPoint?(p)} tests whether \\spad{p(x) = 0} is a branch point.") (((|Boolean|) |#1|) "\\spad{branchPoint?(a)} tests whether \\spad{x = a} is a branch point.")) (|branchPointAtInfinity?| (((|Boolean|)) "\\spad{branchPointAtInfinity?()} tests if there is a branch point at infinity.")) (|rationalPoint?| (((|Boolean|) |#1| |#1|) "\\spad{rationalPoint?(a, b)} tests if \\spad{(x=a,y=b)} is on the curve.")) (|absolutelyIrreducible?| (((|Boolean|)) "\\spad{absolutelyIrreducible?()} tests if the curve absolutely irreducible?")) (|genus| (((|NonNegativeInteger|)) "\\spad{genus()} returns the genus of one absolutely irreducible component")) (|numberOfComponents| (((|NonNegativeInteger|)) "\\spad{numberOfComponents()} returns the number of absolutely irreducible components."))) 
 ((-4500 |has| (-421 |#2|) (-376)) (-4505 |has| (-421 |#2|) (-376)) (-4499 |has| (-421 |#2|) (-376)) ((-4509 "*") . T) (-4501 . T) (-4502 . T) (-4504 . T)) 
 NIL 
@@ -1380,7 +1380,7 @@ NIL
 ((|constructor| (NIL "FiniteFieldCategory is the category of finite fields")) (|representationType| (((|Union| "prime" "polynomial" "normal" "cyclic")) "\\spad{representationType()} returns the type of the representation,{} one of: \\spad{prime},{} \\spad{polynomial},{} \\spad{normal},{} or \\spad{cyclic}.")) (|order| (((|PositiveInteger|) $) "\\spad{order(b)} computes the order of an element \\spad{b} in the multiplicative group of the field. Error: if \\spad{b} equals 0.")) (|discreteLog| (((|NonNegativeInteger|) $) "\\spad{discreteLog(a)} computes the discrete logarithm of \\spad{a} with respect to \\spad{primitiveElement()} of the field.")) (|primitive?| (((|Boolean|) $) "\\spad{primitive?(b)} tests whether the element \\spad{b} is a generator of the (cyclic) multiplicative group of the field,{} \\spadignore{i.e.} is a primitive element. Implementation Note: see \\spad{ch}.IX.1.3,{} th.2 in \\spad{D}. Lipson.")) (|primitiveElement| (($) "\\spad{primitiveElement()} returns a primitive element stored in a global variable in the domain. At first call,{} the primitive element is computed by calling \\spadfun{createPrimitiveElement}.")) (|createPrimitiveElement| (($) "\\spad{createPrimitiveElement()} computes a generator of the (cyclic) multiplicative group of the field.")) (|tableForDiscreteLogarithm| (((|Table| (|PositiveInteger|) (|NonNegativeInteger|)) (|Integer|)) "\\spad{tableForDiscreteLogarithm(a,n)} returns a table of the discrete logarithms of \\spad{a**0} up to \\spad{a**(n-1)} which,{} called with key \\spad{lookup(a**i)} returns \\spad{i} for \\spad{i} in \\spad{0..n-1}. Error: if not called for prime divisors of order of \\indented{7}{multiplicative group.}")) (|factorsOfCyclicGroupSize| (((|List| (|Record| (|:| |factor| (|Integer|)) (|:| |exponent| (|Integer|))))) "\\spad{factorsOfCyclicGroupSize()} returns the factorization of size()\\spad{-1}")) (|conditionP| (((|Union| (|Vector| $) "failed") (|Matrix| $)) "\\spad{conditionP(mat)},{} given a matrix representing a homogeneous system of equations,{} returns a vector whose characteristic'th powers is a non-trivial solution,{} or \"failed\" if no such vector exists.")) (|charthRoot| (($ $) "\\spad{charthRoot(a)} takes the characteristic'th root of {\\em a}. Note: such a root is alway defined in finite fields."))) 
 ((-4499 . T) (-4505 . T) (-4500 . T) ((-4509 "*") . T) (-4501 . T) (-4502 . T) (-4504 . T)) 
 NIL 
-(-363 R UP -2174) 
+(-363 R UP -2173) 
 ((|constructor| (NIL "In this package \\spad{R} is a Euclidean domain and \\spad{F} is a framed algebra over \\spad{R}. The package provides functions to compute the integral closure of \\spad{R} in the quotient field of \\spad{F}. It is assumed that \\spad{char(R/P) = char(R)} for any prime \\spad{P} of \\spad{R}. A typical instance of this is when \\spad{R = K[x]} and \\spad{F} is a function field over \\spad{R}.")) (|localIntegralBasis| (((|Record| (|:| |basis| (|Matrix| |#1|)) (|:| |basisDen| |#1|) (|:| |basisInv| (|Matrix| |#1|))) |#1|) "\\spad{integralBasis(p)} returns a record \\spad{[basis,basisDen,basisInv]} containing information regarding the local integral closure of \\spad{R} at the prime \\spad{p} in the quotient field of \\spad{F},{} where \\spad{F} is a framed algebra with \\spad{R}-module basis \\spad{w1,w2,...,wn}. If \\spad{basis} is the matrix \\spad{(aij, i = 1..n, j = 1..n)},{} then the \\spad{i}th element of the local integral basis is \\spad{vi = (1/basisDen) * sum(aij * wj, j = 1..n)},{} \\spadignore{i.e.} the \\spad{i}th row of \\spad{basis} contains the coordinates of the \\spad{i}th basis vector. Similarly,{} the \\spad{i}th row of the matrix \\spad{basisInv} contains the coordinates of \\spad{wi} with respect to the basis \\spad{v1,...,vn}: if \\spad{basisInv} is the matrix \\spad{(bij, i = 1..n, j = 1..n)},{} then \\spad{wi = sum(bij * vj, j = 1..n)}.")) (|integralBasis| (((|Record| (|:| |basis| (|Matrix| |#1|)) (|:| |basisDen| |#1|) (|:| |basisInv| (|Matrix| |#1|)))) "\\spad{integralBasis()} returns a record \\spad{[basis,basisDen,basisInv]} containing information regarding the integral closure of \\spad{R} in the quotient field of \\spad{F},{} where \\spad{F} is a framed algebra with \\spad{R}-module basis \\spad{w1,w2,...,wn}. If \\spad{basis} is the matrix \\spad{(aij, i = 1..n, j = 1..n)},{} then the \\spad{i}th element of the integral basis is \\spad{vi = (1/basisDen) * sum(aij * wj, j = 1..n)},{} \\spadignore{i.e.} the \\spad{i}th row of \\spad{basis} contains the coordinates of the \\spad{i}th basis vector. Similarly,{} the \\spad{i}th row of the matrix \\spad{basisInv} contains the coordinates of \\spad{wi} with respect to the basis \\spad{v1,...,vn}: if \\spad{basisInv} is the matrix \\spad{(bij, i = 1..n, j = 1..n)},{} then \\spad{wi = sum(bij * vj, j = 1..n)}.")) (|squareFree| (((|Factored| $) $) "\\spad{squareFree(x)} returns a square-free factorisation of \\spad{x}"))) 
 NIL 
 NIL 
@@ -1404,7 +1404,7 @@ NIL
 ((|constructor| (NIL "FiniteFieldExtensionByPolynomial(\\spad{GF},{} defpol) implements the extension of the finite field {\\em GF} generated by the extension polynomial {\\em defpol} which MUST be irreducible. Note: the user has the responsibility to ensure that {\\em defpol} is irreducible."))) 
 ((-4499 . T) (-4505 . T) (-4500 . T) ((-4509 "*") . T) (-4501 . T) (-4502 . T) (-4504 . T)) 
 ((-2225 (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-381)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-381))) (|HasCategory| |#1| (QUOTE (-147)))) 
-(-369 -2174 GF) 
+(-369 -2173 GF) 
 ((|constructor| (NIL "FiniteFieldPolynomialPackage2(\\spad{F},{}\\spad{GF}) exports some functions concerning finite fields,{} which depend on a finite field {\\em GF} and an algebraic extension \\spad{F} of {\\em GF},{} \\spadignore{e.g.} a zero of a polynomial over {\\em GF} in \\spad{F}.")) (|rootOfIrreduciblePoly| ((|#1| (|SparseUnivariatePolynomial| |#2|)) "\\spad{rootOfIrreduciblePoly(f)} computes one root of the monic,{} irreducible polynomial \\spad{f},{} which degree must divide the extension degree of {\\em F} over {\\em GF},{} \\spadignore{i.e.} \\spad{f} splits into linear factors over {\\em F}.")) (|Frobenius| ((|#1| |#1|) "\\spad{Frobenius(x)} \\undocumented{}")) (|basis| (((|Vector| |#1|) (|PositiveInteger|)) "\\spad{basis(n)} \\undocumented{}")) (|lookup| (((|PositiveInteger|) |#1|) "\\spad{lookup(x)} \\undocumented{}")) (|coerce| ((|#1| |#2|) "\\spad{coerce(x)} \\undocumented{}"))) 
 NIL 
 NIL 
@@ -1412,7 +1412,7 @@ NIL
 ((|constructor| (NIL "This package provides a number of functions for generating,{} counting and testing irreducible,{} normal,{} primitive,{} random polynomials over finite fields.")) (|reducedQPowers| (((|PrimitiveArray| (|SparseUnivariatePolynomial| |#1|)) (|SparseUnivariatePolynomial| |#1|)) "\\spad{reducedQPowers(f)} generates \\spad{[x,x**q,x**(q**2),...,x**(q**(n-1))]} reduced modulo \\spad{f} where \\spad{q = size()\\$GF} and \\spad{n = degree f}.")) (|leastAffineMultiple| (((|SparseUnivariatePolynomial| |#1|) (|SparseUnivariatePolynomial| |#1|)) "\\spad{leastAffineMultiple(f)} computes the least affine polynomial which is divisible by the polynomial \\spad{f} over the finite field {\\em GF},{} \\spadignore{i.e.} a polynomial whose exponents are 0 or a power of \\spad{q},{} the size of {\\em GF}.")) (|random| (((|SparseUnivariatePolynomial| |#1|) (|PositiveInteger|) (|PositiveInteger|)) "\\spad{random(m,n)}\\$FFPOLY(\\spad{GF}) generates a random monic polynomial of degree \\spad{d} over the finite field {\\em GF},{} \\spad{d} between \\spad{m} and \\spad{n}.") (((|SparseUnivariatePolynomial| |#1|) (|PositiveInteger|)) "\\spad{random(n)}\\$FFPOLY(\\spad{GF}) generates a random monic polynomial of degree \\spad{n} over the finite field {\\em GF}.")) (|nextPrimitiveNormalPoly| (((|Union| (|SparseUnivariatePolynomial| |#1|) "failed") (|SparseUnivariatePolynomial| |#1|)) "\\spad{nextPrimitiveNormalPoly(f)} yields the next primitive normal polynomial over a finite field {\\em GF} of the same degree as \\spad{f} in the following order,{} or \"failed\" if there are no greater ones. Error: if \\spad{f} has degree 0. Note: the input polynomial \\spad{f} is made monic. Also,{} \\spad{f < g} if the {\\em lookup} of the constant term of \\spad{f} is less than this number for \\spad{g} or,{} in case these numbers are equal,{} if the {\\em lookup} of the coefficient of the term of degree {\\em n-1} of \\spad{f} is less than this number for \\spad{g}. If these numbers are equals,{} \\spad{f < g} if the number of monomials of \\spad{f} is less than that for \\spad{g},{} or if the lists of exponents for \\spad{f} are lexicographically less than those for \\spad{g}. If these lists are also equal,{} the lists of coefficients are coefficients according to the lexicographic ordering induced by the ordering of the elements of {\\em GF} given by {\\em lookup}. This operation is equivalent to nextNormalPrimitivePoly(\\spad{f}).")) (|nextNormalPrimitivePoly| (((|Union| (|SparseUnivariatePolynomial| |#1|) "failed") (|SparseUnivariatePolynomial| |#1|)) "\\spad{nextNormalPrimitivePoly(f)} yields the next normal primitive polynomial over a finite field {\\em GF} of the same degree as \\spad{f} in the following order,{} or \"failed\" if there are no greater ones. Error: if \\spad{f} has degree 0. Note: the input polynomial \\spad{f} is made monic. Also,{} \\spad{f < g} if the {\\em lookup} of the constant term of \\spad{f} is less than this number for \\spad{g} or if {\\em lookup} of the coefficient of the term of degree {\\em n-1} of \\spad{f} is less than this number for \\spad{g}. Otherwise,{} \\spad{f < g} if the number of monomials of \\spad{f} is less than that for \\spad{g} or if the lists of exponents for \\spad{f} are lexicographically less than those for \\spad{g}. If these lists are also equal,{} the lists of coefficients are compared according to the lexicographic ordering induced by the ordering of the elements of {\\em GF} given by {\\em lookup}. This operation is equivalent to nextPrimitiveNormalPoly(\\spad{f}).")) (|nextNormalPoly| (((|Union| (|SparseUnivariatePolynomial| |#1|) "failed") (|SparseUnivariatePolynomial| |#1|)) "\\spad{nextNormalPoly(f)} yields the next normal polynomial over a finite field {\\em GF} of the same degree as \\spad{f} in the following order,{} or \"failed\" if there are no greater ones. Error: if \\spad{f} has degree 0. Note: the input polynomial \\spad{f} is made monic. Also,{} \\spad{f < g} if the {\\em lookup} of the coefficient of the term of degree {\\em n-1} of \\spad{f} is less than that for \\spad{g}. In case these numbers are equal,{} \\spad{f < g} if if the number of monomials of \\spad{f} is less that for \\spad{g} or if the list of exponents of \\spad{f} are lexicographically less than the corresponding list for \\spad{g}. If these lists are also equal,{} the lists of coefficients are compared according to the lexicographic ordering induced by the ordering of the elements of {\\em GF} given by {\\em lookup}.")) (|nextPrimitivePoly| (((|Union| (|SparseUnivariatePolynomial| |#1|) "failed") (|SparseUnivariatePolynomial| |#1|)) "\\spad{nextPrimitivePoly(f)} yields the next primitive polynomial over a finite field {\\em GF} of the same degree as \\spad{f} in the following order,{} or \"failed\" if there are no greater ones. Error: if \\spad{f} has degree 0. Note: the input polynomial \\spad{f} is made monic. Also,{} \\spad{f < g} if the {\\em lookup} of the constant term of \\spad{f} is less than this number for \\spad{g}. If these values are equal,{} then \\spad{f < g} if if the number of monomials of \\spad{f} is less than that for \\spad{g} or if the lists of exponents of \\spad{f} are lexicographically less than the corresponding list for \\spad{g}. If these lists are also equal,{} the lists of coefficients are compared according to the lexicographic ordering induced by the ordering of the elements of {\\em GF} given by {\\em lookup}.")) (|nextIrreduciblePoly| (((|Union| (|SparseUnivariatePolynomial| |#1|) "failed") (|SparseUnivariatePolynomial| |#1|)) "\\spad{nextIrreduciblePoly(f)} yields the next monic irreducible polynomial over a finite field {\\em GF} of the same degree as \\spad{f} in the following order,{} or \"failed\" if there are no greater ones. Error: if \\spad{f} has degree 0. Note: the input polynomial \\spad{f} is made monic. Also,{} \\spad{f < g} if the number of monomials of \\spad{f} is less than this number for \\spad{g}. If \\spad{f} and \\spad{g} have the same number of monomials,{} the lists of exponents are compared lexicographically. If these lists are also equal,{} the lists of coefficients are compared according to the lexicographic ordering induced by the ordering of the elements of {\\em GF} given by {\\em lookup}.")) (|createPrimitiveNormalPoly| (((|SparseUnivariatePolynomial| |#1|) (|PositiveInteger|)) "\\spad{createPrimitiveNormalPoly(n)}\\$FFPOLY(\\spad{GF}) generates a normal and primitive polynomial of degree \\spad{n} over the field {\\em GF}. polynomial of degree \\spad{n} over the field {\\em GF}.")) (|createNormalPrimitivePoly| (((|SparseUnivariatePolynomial| |#1|) (|PositiveInteger|)) "\\spad{createNormalPrimitivePoly(n)}\\$FFPOLY(\\spad{GF}) generates a normal and primitive polynomial of degree \\spad{n} over the field {\\em GF}. Note: this function is equivalent to createPrimitiveNormalPoly(\\spad{n})")) (|createNormalPoly| (((|SparseUnivariatePolynomial| |#1|) (|PositiveInteger|)) "\\spad{createNormalPoly(n)}\\$FFPOLY(\\spad{GF}) generates a normal polynomial of degree \\spad{n} over the finite field {\\em GF}.")) (|createPrimitivePoly| (((|SparseUnivariatePolynomial| |#1|) (|PositiveInteger|)) "\\spad{createPrimitivePoly(n)}\\$FFPOLY(\\spad{GF}) generates a primitive polynomial of degree \\spad{n} over the finite field {\\em GF}.")) (|createIrreduciblePoly| (((|SparseUnivariatePolynomial| |#1|) (|PositiveInteger|)) "\\spad{createIrreduciblePoly(n)}\\$FFPOLY(\\spad{GF}) generates a monic irreducible univariate polynomial of degree \\spad{n} over the finite field {\\em GF}.")) (|numberOfNormalPoly| (((|PositiveInteger|) (|PositiveInteger|)) "\\spad{numberOfNormalPoly(n)}\\$FFPOLY(\\spad{GF}) yields the number of normal polynomials of degree \\spad{n} over the finite field {\\em GF}.")) (|numberOfPrimitivePoly| (((|PositiveInteger|) (|PositiveInteger|)) "\\spad{numberOfPrimitivePoly(n)}\\$FFPOLY(\\spad{GF}) yields the number of primitive polynomials of degree \\spad{n} over the finite field {\\em GF}.")) (|numberOfIrreduciblePoly| (((|PositiveInteger|) (|PositiveInteger|)) "\\spad{numberOfIrreduciblePoly(n)}\\$FFPOLY(\\spad{GF}) yields the number of monic irreducible univariate polynomials of degree \\spad{n} over the finite field {\\em GF}.")) (|normal?| (((|Boolean|) (|SparseUnivariatePolynomial| |#1|)) "\\spad{normal?(f)} tests whether the polynomial \\spad{f} over a finite field is normal,{} \\spadignore{i.e.} its roots are linearly independent over the field.")) (|primitive?| (((|Boolean|) (|SparseUnivariatePolynomial| |#1|)) "\\spad{primitive?(f)} tests whether the polynomial \\spad{f} over a finite field is primitive,{} \\spadignore{i.e.} all its roots are primitive."))) 
 NIL 
 NIL 
-(-371 -2174 FP FPP) 
+(-371 -2173 FP FPP) 
 ((|constructor| (NIL "This package solves linear diophantine equations for Bivariate polynomials over finite fields")) (|solveLinearPolynomialEquation| (((|Union| (|List| |#3|) "failed") (|List| |#3|) |#3|) "\\spad{solveLinearPolynomialEquation([f1, ..., fn], g)} (where the \\spad{fi} are relatively prime to each other) returns a list of \\spad{ai} such that \\spad{g/prod fi = sum ai/fi} or returns \"failed\" if no such list of \\spad{ai}\\spad{'s} exists."))) 
 NIL 
 NIL 
@@ -1552,7 +1552,7 @@ NIL
 ((|constructor| (NIL "Code to manipulate Fortran Output Stack")) (|topFortranOutputStack| (((|String|)) "\\spad{topFortranOutputStack()} returns the top element of the Fortran output stack")) (|pushFortranOutputStack| (((|Void|) (|String|)) "\\spad{pushFortranOutputStack(f)} pushes \\spad{f} onto the Fortran output stack") (((|Void|) (|FileName|)) "\\spad{pushFortranOutputStack(f)} pushes \\spad{f} onto the Fortran output stack")) (|popFortranOutputStack| (((|Void|)) "\\spad{popFortranOutputStack()} pops the Fortran output stack")) (|showFortranOutputStack| (((|Stack| (|String|))) "\\spad{showFortranOutputStack()} returns the Fortran output stack")) (|clearFortranOutputStack| (((|Stack| (|String|))) "\\spad{clearFortranOutputStack()} clears the Fortran output stack"))) 
 NIL 
 NIL 
-(-406 -2174 UP UPUP R) 
+(-406 -2173 UP UPUP R) 
 ((|constructor| (NIL "\\indented{1}{Finds the order of a divisor over a finite field} Author: Manuel Bronstein Date Created: 1988 Date Last Updated: 11 Jul 1990")) (|order| (((|NonNegativeInteger|) (|FiniteDivisor| |#1| |#2| |#3| |#4|)) "\\spad{order(x)} \\undocumented"))) 
 NIL 
 NIL 
@@ -1576,11 +1576,11 @@ NIL
 ((|constructor| (NIL "provides an interface to the boot code for calling Fortran")) (|setLegalFortranSourceExtensions| (((|List| (|String|)) (|List| (|String|))) "\\spad{setLegalFortranSourceExtensions(l)} \\undocumented{}")) (|outputAsFortran| (((|Void|) (|FileName|)) "\\spad{outputAsFortran(fn)} \\undocumented{}")) (|linkToFortran| (((|SExpression|) (|Symbol|) (|List| (|Symbol|)) (|TheSymbolTable|) (|List| (|Symbol|))) "\\spad{linkToFortran(s,l,t,lv)} \\undocumented{}") (((|SExpression|) (|Symbol|) (|List| (|Union| (|:| |array| (|List| (|Symbol|))) (|:| |scalar| (|Symbol|)))) (|List| (|List| (|Union| (|:| |array| (|List| (|Symbol|))) (|:| |scalar| (|Symbol|))))) (|List| (|Symbol|)) (|Symbol|)) "\\spad{linkToFortran(s,l,ll,lv,t)} \\undocumented{}") (((|SExpression|) (|Symbol|) (|List| (|Union| (|:| |array| (|List| (|Symbol|))) (|:| |scalar| (|Symbol|)))) (|List| (|List| (|Union| (|:| |array| (|List| (|Symbol|))) (|:| |scalar| (|Symbol|))))) (|List| (|Symbol|))) "\\spad{linkToFortran(s,l,ll,lv)} \\undocumented{}"))) 
 NIL 
 NIL 
-(-412 -2178 |returnType| -3588 |symbols|) 
+(-412 -2179 |returnType| -3589 |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 
-(-413 -2174 UP) 
+(-413 -2173 UP) 
 ((|constructor| (NIL "\\indented{1}{Full partial fraction expansion of rational functions} Author: Manuel Bronstein Date Created: 9 December 1992 Date Last Updated: June 18,{} 2010 References: \\spad{M}.Bronstein & \\spad{B}.Salvy,{} \\indented{12}{Full Partial Fraction Decomposition of Rational Functions,{}} \\indented{12}{in Proceedings of ISSAC'93,{} Kiev,{} ACM Press.}")) (|construct| (($ (|List| (|Record| (|:| |exponent| (|NonNegativeInteger|)) (|:| |center| |#2|) (|:| |num| |#2|)))) "\\spad{construct(l)} is the inverse of fracPart.")) (|fracPart| (((|List| (|Record| (|:| |exponent| (|NonNegativeInteger|)) (|:| |center| |#2|) (|:| |num| |#2|))) $) "\\spad{fracPart(f)} returns the list of summands of the fractional part of \\spad{f}.")) (|polyPart| ((|#2| $) "\\spad{polyPart(f)} returns the polynomial part of \\spad{f}.")) (|fullPartialFraction| (($ (|Fraction| |#2|)) "\\spad{fullPartialFraction(f)} returns \\spad{[p, [[j, Dj, Hj]...]]} such that \\spad{f = p(x) + \\sum_{[j,Dj,Hj] in l} \\sum_{Dj(a)=0} Hj(a)/(x - a)\\^j}.")) (+ (($ |#2| $) "\\spad{p + x} returns the sum of \\spad{p} and \\spad{x}"))) 
 NIL 
 NIL 
@@ -1636,11 +1636,11 @@ NIL
 ((|constructor| (NIL "\\indented{1}{Lifting of morphisms to fractional ideals.} Author: Manuel Bronstein Date Created: 1 Feb 1989 Date Last Updated: 27 Feb 1990 Keywords: ideal,{} algebra,{} module.")) (|map| (((|FractionalIdeal| |#5| |#6| |#7| |#8|) (|Mapping| |#5| |#1|) (|FractionalIdeal| |#1| |#2| |#3| |#4|)) "\\spad{map(f,i)} \\undocumented{}"))) 
 NIL 
 NIL 
-(-427 R -2174 UP A) 
+(-427 R -2173 UP A) 
 ((|constructor| (NIL "Fractional ideals in a framed algebra.")) (|randomLC| ((|#4| (|NonNegativeInteger|) (|Vector| |#4|)) "\\spad{randomLC(n,x)} should be local but conditional.")) (|minimize| (($ $) "\\spad{minimize(I)} returns a reduced set of generators for \\spad{I}.")) (|denom| ((|#1| $) "\\spad{denom(1/d * (f1,...,fn))} returns \\spad{d}.")) (|numer| (((|Vector| |#4|) $) "\\spad{numer(1/d * (f1,...,fn))} = the vector \\spad{[f1,...,fn]}.")) (|norm| ((|#2| $) "\\spad{norm(I)} returns the norm of the ideal \\spad{I}.")) (|basis| (((|Vector| |#4|) $) "\\spad{basis((f1,...,fn))} returns the vector \\spad{[f1,...,fn]}.")) (|ideal| (($ (|Vector| |#4|)) "\\spad{ideal([f1,...,fn])} returns the ideal \\spad{(f1,...,fn)}."))) 
 ((-4504 . T)) 
 NIL 
-(-428 R -2174 UP A |ibasis|) 
+(-428 R -2173 UP A |ibasis|) 
 ((|constructor| (NIL "Module representation of fractional ideals.")) (|module| (($ (|FractionalIdeal| |#1| |#2| |#3| |#4|)) "\\spad{module(I)} returns \\spad{I} viewed has a module over \\spad{R}.") (($ (|Vector| |#4|)) "\\spad{module([f1,...,fn])} = the module generated by \\spad{(f1,...,fn)} over \\spad{R}.")) (|norm| ((|#2| $) "\\spad{norm(f)} returns the norm of the module \\spad{f}.")) (|basis| (((|Vector| |#4|) $) "\\spad{basis((f1,...,fn))} = the vector \\spad{[f1,...,fn]}."))) 
 NIL 
 ((|HasCategory| |#4| (LIST (QUOTE -1069) (|devaluate| |#2|)))) 
@@ -1688,7 +1688,7 @@ NIL
 ((|constructor| (NIL "A finite-set aggregate models the notion of a finite set,{} that is,{} a collection of elements characterized by membership,{} but not by order or multiplicity. See \\spadtype{Set} for an example.")) (|min| ((|#1| $) "\\spad{min(u)} returns the smallest element of aggregate \\spad{u}.")) (|max| ((|#1| $) "\\spad{max(u)} returns the largest element of aggregate \\spad{u}.")) (|universe| (($) "\\spad{universe()}\\$\\spad{D} returns the universal set for finite set aggregate \\spad{D}.")) (|complement| (($ $) "\\spad{complement(u)} returns the complement of the set \\spad{u},{} \\spadignore{i.e.} the set of all values not in \\spad{u}.")) (|cardinality| (((|NonNegativeInteger|) $) "\\spad{cardinality(u)} returns the number of elements of \\spad{u}. Note: \\axiom{cardinality(\\spad{u}) = \\#u}."))) 
 ((-4507 . T) (-4497 . T) (-4508 . T)) 
 NIL 
-(-440 R -2174) 
+(-440 R -2173) 
 ((|constructor| (NIL "\\spadtype{FunctionSpaceComplexIntegration} provides functions for the indefinite integration of complex-valued functions.")) (|complexIntegrate| ((|#2| |#2| (|Symbol|)) "\\spad{complexIntegrate(f, x)} returns the integral of \\spad{f(x)dx} where \\spad{x} is viewed as a complex variable.")) (|internalIntegrate0| (((|IntegrationResult| |#2|) |#2| (|Symbol|)) "\\spad{internalIntegrate0 should} be a local function,{} but is conditional.")) (|internalIntegrate| (((|IntegrationResult| |#2|) |#2| (|Symbol|)) "\\spad{internalIntegrate(f, x)} returns the integral of \\spad{f(x)dx} where \\spad{x} is viewed as a complex variable."))) 
 NIL 
 NIL 
@@ -1696,7 +1696,7 @@ NIL
 ((|constructor| (NIL "\\indented{1}{Author: James Davenport} Date Created: 17 April 1992 Date Last Updated: Basic Functions: Related Constructors: Also See: AMS Classifications: Keywords: References: Description:")) (|makeCos| (($ |#2| |#1|) "\\spad{makeCos(e,r)} makes a sin expression with given argument and coefficient")) (|makeSin| (($ |#2| |#1|) "\\spad{makeSin(e,r)} makes a sin expression with given argument and coefficient")) (|coerce| (($ (|FourierComponent| |#2|)) "\\spad{coerce(c)} converts sin/cos terms into Fourier Series") (($ |#1|) "\\spad{coerce(r)} converts coefficients into Fourier Series"))) 
 ((-4494 -12 (|has| |#1| (-6 -4494)) (|has| |#2| (-6 -4494))) (-4501 . T) (-4502 . T) (-4504 . T)) 
 ((-12 (|HasAttribute| |#1| (QUOTE -4494)) (|HasAttribute| |#2| (QUOTE -4494)))) 
-(-442 R -2174) 
+(-442 R -2173) 
 ((|constructor| (NIL "\\spadtype{FunctionSpaceIntegration} provides functions for the indefinite integration of real-valued functions.")) (|integrate| (((|Union| |#2| (|List| |#2|)) |#2| (|Symbol|)) "\\spad{integrate(f, x)} returns the integral of \\spad{f(x)dx} where \\spad{x} is viewed as a real variable."))) 
 NIL 
 NIL 
@@ -1708,15 +1708,15 @@ NIL
 ((|constructor| (NIL "A space of formal functions with arguments in an arbitrary ordered set.")) (|univariate| (((|Fraction| (|SparseUnivariatePolynomial| $)) $ (|Kernel| $)) "\\spad{univariate(f, k)} returns \\spad{f} viewed as a univariate fraction in \\spad{k}.")) (/ (($ (|SparseMultivariatePolynomial| |#1| (|Kernel| $)) (|SparseMultivariatePolynomial| |#1| (|Kernel| $))) "\\spad{p1/p2} returns the quotient of \\spad{p1} and \\spad{p2} as an element of \\%.")) (|denominator| (($ $) "\\spad{denominator(f)} returns the denominator of \\spad{f} converted to \\%.")) (|denom| (((|SparseMultivariatePolynomial| |#1| (|Kernel| $)) $) "\\spad{denom(f)} returns the denominator of \\spad{f} viewed as a polynomial in the kernels over \\spad{R}.")) (|convert| (($ (|Factored| $)) "\\spad{convert(f1\\^e1 ... fm\\^em)} returns \\spad{(f1)\\^e1 ... (fm)\\^em} as an element of \\%,{} using formal kernels created using a \\spadfunFrom{paren}{ExpressionSpace}.")) (|isPower| (((|Union| (|Record| (|:| |val| $) (|:| |exponent| (|Integer|))) "failed") $) "\\spad{isPower(p)} returns \\spad{[x, n]} if \\spad{p = x**n} and \\spad{n <> 0}.")) (|numerator| (($ $) "\\spad{numerator(f)} returns the numerator of \\spad{f} converted to \\%.")) (|numer| (((|SparseMultivariatePolynomial| |#1| (|Kernel| $)) $) "\\spad{numer(f)} returns the numerator of \\spad{f} viewed as a polynomial in the kernels over \\spad{R} if \\spad{R} is an integral domain. If not,{} then numer(\\spad{f}) = \\spad{f} viewed as a polynomial in the kernels over \\spad{R}.")) (|coerce| (($ (|Fraction| (|Polynomial| (|Fraction| |#1|)))) "\\spad{coerce(f)} returns \\spad{f} as an element of \\%.") (($ (|Polynomial| (|Fraction| |#1|))) "\\spad{coerce(p)} returns \\spad{p} as an element of \\%.") (($ (|Fraction| |#1|)) "\\spad{coerce(q)} returns \\spad{q} as an element of \\%.") (($ (|SparseMultivariatePolynomial| |#1| (|Kernel| $))) "\\spad{coerce(p)} returns \\spad{p} as an element of \\%.")) (|isMult| (((|Union| (|Record| (|:| |coef| (|Integer|)) (|:| |var| (|Kernel| $))) "failed") $) "\\spad{isMult(p)} returns \\spad{[n, x]} if \\spad{p = n * x} and \\spad{n <> 0}.")) (|isPlus| (((|Union| (|List| $) "failed") $) "\\spad{isPlus(p)} returns \\spad{[m1,...,mn]} if \\spad{p = m1 +...+ mn} and \\spad{n > 1}.")) (|isExpt| (((|Union| (|Record| (|:| |var| (|Kernel| $)) (|:| |exponent| (|Integer|))) "failed") $ (|Symbol|)) "\\spad{isExpt(p,f)} returns \\spad{[x, n]} if \\spad{p = x**n} and \\spad{n <> 0} and \\spad{x = f(a)}.") (((|Union| (|Record| (|:| |var| (|Kernel| $)) (|:| |exponent| (|Integer|))) "failed") $ (|BasicOperator|)) "\\spad{isExpt(p,op)} returns \\spad{[x, n]} if \\spad{p = x**n} and \\spad{n <> 0} and \\spad{x = op(a)}.") (((|Union| (|Record| (|:| |var| (|Kernel| $)) (|:| |exponent| (|Integer|))) "failed") $) "\\spad{isExpt(p)} returns \\spad{[x, n]} if \\spad{p = x**n} and \\spad{n <> 0}.")) (|isTimes| (((|Union| (|List| $) "failed") $) "\\spad{isTimes(p)} returns \\spad{[a1,...,an]} if \\spad{p = a1*...*an} and \\spad{n > 1}.")) (** (($ $ (|NonNegativeInteger|)) "\\spad{x**n} returns \\spad{x} * \\spad{x} * \\spad{x} * ... * \\spad{x} (\\spad{n} times).")) (|eval| (($ $ (|Symbol|) (|NonNegativeInteger|) (|Mapping| $ $)) "\\spad{eval(x, s, n, f)} replaces every \\spad{s(a)**n} in \\spad{x} by \\spad{f(a)} for any \\spad{a}.") (($ $ (|Symbol|) (|NonNegativeInteger|) (|Mapping| $ (|List| $))) "\\spad{eval(x, s, n, f)} replaces every \\spad{s(a1,...,am)**n} in \\spad{x} by \\spad{f(a1,...,am)} for any a1,{}...,{}am.") (($ $ (|List| (|Symbol|)) (|List| (|NonNegativeInteger|)) (|List| (|Mapping| $ (|List| $)))) "\\spad{eval(x, [s1,...,sm], [n1,...,nm], [f1,...,fm])} replaces every \\spad{si(a1,...,an)**ni} in \\spad{x} by \\spad{fi(a1,...,an)} for any a1,{}...,{}am.") (($ $ (|List| (|Symbol|)) (|List| (|NonNegativeInteger|)) (|List| (|Mapping| $ $))) "\\spad{eval(x, [s1,...,sm], [n1,...,nm], [f1,...,fm])} replaces every \\spad{si(a)**ni} in \\spad{x} by \\spad{fi(a)} for any \\spad{a}.") (($ $ (|List| (|BasicOperator|)) (|List| $) (|Symbol|)) "\\spad{eval(x, [s1,...,sm], [f1,...,fm], y)} replaces every \\spad{si(a)} in \\spad{x} by \\spad{fi(y)} with \\spad{y} replaced by \\spad{a} for any \\spad{a}.") (($ $ (|BasicOperator|) $ (|Symbol|)) "\\spad{eval(x, s, f, y)} replaces every \\spad{s(a)} in \\spad{x} by \\spad{f(y)} with \\spad{y} replaced by \\spad{a} for any \\spad{a}.") (($ $) "\\spad{eval(f)} unquotes all the quoted operators in \\spad{f}.") (($ $ (|List| (|Symbol|))) "\\spad{eval(f, [foo1,...,foon])} unquotes all the \\spad{fooi}\\spad{'s} in \\spad{f}.") (($ $ (|Symbol|)) "\\spad{eval(f, foo)} unquotes all the foo\\spad{'s} in \\spad{f}.")) (|applyQuote| (($ (|Symbol|) (|List| $)) "\\spad{applyQuote(foo, [x1,...,xn])} returns \\spad{'foo(x1,...,xn)}.") (($ (|Symbol|) $ $ $ $) "\\spad{applyQuote(foo, x, y, z, t)} returns \\spad{'foo(x,y,z,t)}.") (($ (|Symbol|) $ $ $) "\\spad{applyQuote(foo, x, y, z)} returns \\spad{'foo(x,y,z)}.") (($ (|Symbol|) $ $) "\\spad{applyQuote(foo, x, y)} returns \\spad{'foo(x,y)}.") (($ (|Symbol|) $) "\\spad{applyQuote(foo, x)} returns \\spad{'foo(x)}.")) (|variables| (((|List| (|Symbol|)) $) "\\spad{variables(f)} returns the list of all the variables of \\spad{f}.")) (|ground| ((|#1| $) "\\spad{ground(f)} returns \\spad{f} as an element of \\spad{R}. An error occurs if \\spad{f} is not an element of \\spad{R}.")) (|ground?| (((|Boolean|) $) "\\spad{ground?(f)} tests if \\spad{f} is an element of \\spad{R}."))) 
 ((-4504 -2225 (|has| |#1| (-1080)) (|has| |#1| (-487))) (-4502 |has| |#1| (-175)) (-4501 |has| |#1| (-175)) ((-4509 "*") |has| |#1| (-570)) (-4500 |has| |#1| (-570)) (-4505 |has| |#1| (-570)) (-4499 |has| |#1| (-570))) 
 NIL 
-(-445 R -2174) 
+(-445 R -2173) 
 ((|constructor| (NIL "Provides some special functions over an integral domain.")) (|iiabs| ((|#2| |#2|) "\\spad{iiabs(x)} should be local but conditional.")) (|iiGamma| ((|#2| |#2|) "\\spad{iiGamma(x)} should be local but conditional.")) (|airyBi| ((|#2| |#2|) "\\spad{airyBi(x)} returns the airybi function applied to \\spad{x}")) (|airyAi| ((|#2| |#2|) "\\spad{airyAi(x)} returns the airyai function applied to \\spad{x}")) (|besselK| ((|#2| |#2| |#2|) "\\spad{besselK(x,y)} returns the besselk function applied to \\spad{x} and \\spad{y}")) (|besselI| ((|#2| |#2| |#2|) "\\spad{besselI(x,y)} returns the besseli function applied to \\spad{x} and \\spad{y}")) (|besselY| ((|#2| |#2| |#2|) "\\spad{besselY(x,y)} returns the bessely function applied to \\spad{x} and \\spad{y}")) (|besselJ| ((|#2| |#2| |#2|) "\\spad{besselJ(x,y)} returns the besselj function applied to \\spad{x} and \\spad{y}")) (|polygamma| ((|#2| |#2| |#2|) "\\spad{polygamma(x,y)} returns the polygamma function applied to \\spad{x} and \\spad{y}")) (|digamma| ((|#2| |#2|) "\\spad{digamma(x)} returns the digamma function applied to \\spad{x}")) (|Beta| ((|#2| |#2| |#2|) "\\spad{Beta(x,y)} returns the beta function applied to \\spad{x} and \\spad{y}")) (|Gamma| ((|#2| |#2| |#2|) "\\spad{Gamma(a,x)} returns the incomplete Gamma function applied to a and \\spad{x}") ((|#2| |#2|) "\\spad{Gamma(f)} returns the formal Gamma function applied to \\spad{f}")) (|abs| ((|#2| |#2|) "\\spad{abs(f)} returns the absolute value operator applied to \\spad{f}")) (|operator| (((|BasicOperator|) (|BasicOperator|)) "\\spad{operator(op)} returns a copy of \\spad{op} with the domain-dependent properties appropriate for \\spad{F}; error if \\spad{op} is not a special function operator")) (|belong?| (((|Boolean|) (|BasicOperator|)) "\\spad{belong?(op)} is \\spad{true} if \\spad{op} is a special function operator."))) 
 NIL 
 NIL 
-(-446 R -2174) 
+(-446 R -2173) 
 ((|constructor| (NIL "FunctionsSpacePrimitiveElement provides functions to compute primitive elements in functions spaces.")) (|primitiveElement| (((|Record| (|:| |primelt| |#2|) (|:| |pol1| (|SparseUnivariatePolynomial| |#2|)) (|:| |pol2| (|SparseUnivariatePolynomial| |#2|)) (|:| |prim| (|SparseUnivariatePolynomial| |#2|))) |#2| |#2|) "\\spad{primitiveElement(a1, a2)} returns \\spad{[a, q1, q2, q]} such that \\spad{k(a1, a2) = k(a)},{} \\spad{ai = qi(a)},{} and \\spad{q(a) = 0}. The minimal polynomial for a2 may involve \\spad{a1},{} but the minimal polynomial for \\spad{a1} may not involve a2; This operations uses \\spadfun{resultant}.") (((|Record| (|:| |primelt| |#2|) (|:| |poly| (|List| (|SparseUnivariatePolynomial| |#2|))) (|:| |prim| (|SparseUnivariatePolynomial| |#2|))) (|List| |#2|)) "\\spad{primitiveElement([a1,...,an])} returns \\spad{[a, [q1,...,qn], q]} such that then \\spad{k(a1,...,an) = k(a)},{} \\spad{ai = qi(a)},{} and \\spad{q(a) = 0}. This operation uses the technique of \\spadglossSee{groebner bases}{Groebner basis}."))) 
 NIL 
 ((|HasCategory| |#2| (QUOTE (-27)))) 
-(-447 R -2174) 
+(-447 R -2173) 
 ((|constructor| (NIL "This package provides function which replaces transcendental kernels in a function space by random integers. The correspondence between the kernels and the integers is fixed between calls to new().")) (|newReduc| (((|Void|)) "\\spad{newReduc()} \\undocumented")) (|bringDown| (((|SparseUnivariatePolynomial| (|Fraction| (|Integer|))) |#2| (|Kernel| |#2|)) "\\spad{bringDown(f,k)} \\undocumented") (((|Fraction| (|Integer|)) |#2|) "\\spad{bringDown(f)} \\undocumented"))) 
 NIL 
 NIL 
@@ -1724,7 +1724,7 @@ NIL
 ((|constructor| (NIL "Creates and manipulates objects which correspond to the basic FORTRAN data types: REAL,{} INTEGER,{} COMPLEX,{} LOGICAL and CHARACTER")) (= (((|Boolean|) $ $) "\\spad{x=y} tests for equality")) (|logical?| (((|Boolean|) $) "\\spad{logical?(t)} tests whether \\spad{t} is equivalent to the FORTRAN type LOGICAL.")) (|character?| (((|Boolean|) $) "\\spad{character?(t)} tests whether \\spad{t} is equivalent to the FORTRAN type CHARACTER.")) (|doubleComplex?| (((|Boolean|) $) "\\spad{doubleComplex?(t)} tests whether \\spad{t} is equivalent to the (non-standard) FORTRAN type DOUBLE COMPLEX.")) (|complex?| (((|Boolean|) $) "\\spad{complex?(t)} tests whether \\spad{t} is equivalent to the FORTRAN type COMPLEX.")) (|integer?| (((|Boolean|) $) "\\spad{integer?(t)} tests whether \\spad{t} is equivalent to the FORTRAN type INTEGER.")) (|double?| (((|Boolean|) $) "\\spad{double?(t)} tests whether \\spad{t} is equivalent to the FORTRAN type DOUBLE PRECISION")) (|real?| (((|Boolean|) $) "\\spad{real?(t)} tests whether \\spad{t} is equivalent to the FORTRAN type REAL.")) (|coerce| (((|SExpression|) $) "\\spad{coerce(x)} returns the \\spad{s}-expression associated with \\spad{x}") (((|Symbol|) $) "\\spad{coerce(x)} returns the symbol associated with \\spad{x}") (($ (|Symbol|)) "\\spad{coerce(s)} transforms the symbol \\spad{s} into an element of FortranScalarType provided \\spad{s} is one of real,{} complex,{}double precision,{} logical,{} integer,{} character,{} REAL,{} COMPLEX,{} LOGICAL,{} INTEGER,{} CHARACTER,{} DOUBLE PRECISION") (($ (|String|)) "\\spad{coerce(s)} transforms the string \\spad{s} into an element of FortranScalarType provided \\spad{s} is one of \"real\",{} \"double precision\",{} \"complex\",{} \"logical\",{} \"integer\",{} \"character\",{} \"REAL\",{} \"COMPLEX\",{} \"LOGICAL\",{} \"INTEGER\",{} \"CHARACTER\",{} \"DOUBLE PRECISION\""))) 
 NIL 
 NIL 
-(-449 R -2174 UP) 
+(-449 R -2173 UP) 
 ((|constructor| (NIL "\\indented{1}{Used internally by IR2F} Author: Manuel Bronstein Date Created: 12 May 1988 Date Last Updated: 22 September 1993 Keywords: function,{} space,{} polynomial,{} factoring")) (|anfactor| (((|Union| (|Factored| (|SparseUnivariatePolynomial| (|AlgebraicNumber|))) "failed") |#3|) "\\spad{anfactor(p)} tries to factor \\spad{p} over algebraic numbers,{} returning \"failed\" if it cannot")) (|UP2ifCan| (((|Union| (|:| |overq| (|SparseUnivariatePolynomial| (|Fraction| (|Integer|)))) (|:| |overan| (|SparseUnivariatePolynomial| (|AlgebraicNumber|))) (|:| |failed| (|Boolean|))) |#3|) "\\spad{UP2ifCan(x)} should be local but conditional.")) (|qfactor| (((|Union| (|Factored| (|SparseUnivariatePolynomial| (|Fraction| (|Integer|)))) "failed") |#3|) "\\spad{qfactor(p)} tries to factor \\spad{p} over fractions of integers,{} returning \"failed\" if it cannot")) (|ffactor| (((|Factored| |#3|) |#3|) "\\spad{ffactor(p)} tries to factor a univariate polynomial \\spad{p} over \\spad{F}"))) 
 NIL 
 ((|HasCategory| |#2| (LIST (QUOTE -1069) (QUOTE (-48))))) 
@@ -1756,7 +1756,7 @@ NIL
 ((|constructor| (NIL "\\spadtype{GaloisGroupFactorizer} provides functions to factor resolvents.")) (|btwFact| (((|Record| (|:| |contp| (|Integer|)) (|:| |factors| (|List| (|Record| (|:| |irr| |#1|) (|:| |pow| (|Integer|)))))) |#1| (|Boolean|) (|Set| (|NonNegativeInteger|)) (|NonNegativeInteger|)) "\\spad{btwFact(p,sqf,pd,r)} returns the factorization of \\spad{p},{} the result is a Record such that \\spad{contp=}content \\spad{p},{} \\spad{factors=}List of irreducible factors of \\spad{p} with exponent. If \\spad{sqf=true} the polynomial is assumed to be square free (\\spadignore{i.e.} without repeated factors). \\spad{pd} is the \\spadtype{Set} of possible degrees. \\spad{r} is a lower bound for the number of factors of \\spad{p}. Please do not use this function in your code because its design may change.")) (|henselFact| (((|Record| (|:| |contp| (|Integer|)) (|:| |factors| (|List| (|Record| (|:| |irr| |#1|) (|:| |pow| (|Integer|)))))) |#1| (|Boolean|)) "\\spad{henselFact(p,sqf)} returns the factorization of \\spad{p},{} the result is a Record such that \\spad{contp=}content \\spad{p},{} \\spad{factors=}List of irreducible factors of \\spad{p} with exponent. If \\spad{sqf=true} the polynomial is assumed to be square free (\\spadignore{i.e.} without repeated factors).")) (|factorOfDegree| (((|Union| |#1| "failed") (|PositiveInteger|) |#1| (|List| (|NonNegativeInteger|)) (|NonNegativeInteger|) (|Boolean|)) "\\spad{factorOfDegree(d,p,listOfDegrees,r,sqf)} returns a factor of \\spad{p} of degree \\spad{d} knowing that \\spad{p} has for possible splitting of its degree \\spad{listOfDegrees},{} and that \\spad{p} has at least \\spad{r} factors. If \\spad{sqf=true} the polynomial is assumed to be square free (\\spadignore{i.e.} without repeated factors).") (((|Union| |#1| "failed") (|PositiveInteger|) |#1| (|List| (|NonNegativeInteger|)) (|NonNegativeInteger|)) "\\spad{factorOfDegree(d,p,listOfDegrees,r)} returns a factor of \\spad{p} of degree \\spad{d} knowing that \\spad{p} has for possible splitting of its degree \\spad{listOfDegrees},{} and that \\spad{p} has at least \\spad{r} factors.") (((|Union| |#1| "failed") (|PositiveInteger|) |#1| (|List| (|NonNegativeInteger|))) "\\spad{factorOfDegree(d,p,listOfDegrees)} returns a factor of \\spad{p} of degree \\spad{d} knowing that \\spad{p} has for possible splitting of its degree \\spad{listOfDegrees}.") (((|Union| |#1| "failed") (|PositiveInteger|) |#1| (|NonNegativeInteger|)) "\\spad{factorOfDegree(d,p,r)} returns a factor of \\spad{p} of degree \\spad{d} knowing that \\spad{p} has at least \\spad{r} factors.") (((|Union| |#1| "failed") (|PositiveInteger|) |#1|) "\\spad{factorOfDegree(d,p)} returns a factor of \\spad{p} of degree \\spad{d}.")) (|factorSquareFree| (((|Factored| |#1|) |#1| (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{factorSquareFree(p,d,r)} factorizes the polynomial \\spad{p} using the single factor bound algorithm,{} knowing that \\spad{d} divides the degree of all factors of \\spad{p} and that \\spad{p} has at least \\spad{r} factors. \\spad{f} is supposed not having any repeated factor (this is not checked).") (((|Factored| |#1|) |#1| (|List| (|NonNegativeInteger|)) (|NonNegativeInteger|)) "\\spad{factorSquareFree(p,listOfDegrees,r)} factorizes the polynomial \\spad{p} using the single factor bound algorithm,{} knowing that \\spad{p} has for possible splitting of its degree \\spad{listOfDegrees} and that \\spad{p} has at least \\spad{r} factors. \\spad{f} is supposed not having any repeated factor (this is not checked).") (((|Factored| |#1|) |#1| (|List| (|NonNegativeInteger|))) "\\spad{factorSquareFree(p,listOfDegrees)} factorizes the polynomial \\spad{p} using the single factor bound algorithm and knowing that \\spad{p} has for possible splitting of its degree \\spad{listOfDegrees}. \\spad{f} is supposed not having any repeated factor (this is not checked).") (((|Factored| |#1|) |#1| (|NonNegativeInteger|)) "\\spad{factorSquareFree(p,r)} factorizes the polynomial \\spad{p} using the single factor bound algorithm and knowing that \\spad{p} has at least \\spad{r} factors. \\spad{f} is supposed not having any repeated factor (this is not checked).") (((|Factored| |#1|) |#1|) "\\spad{factorSquareFree(p)} returns the factorization of \\spad{p} which is supposed not having any repeated factor (this is not checked).")) (|factor| (((|Factored| |#1|) |#1| (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{factor(p,d,r)} factorizes the polynomial \\spad{p} using the single factor bound algorithm,{} knowing that \\spad{d} divides the degree of all factors of \\spad{p} and that \\spad{p} has at least \\spad{r} factors.") (((|Factored| |#1|) |#1| (|List| (|NonNegativeInteger|)) (|NonNegativeInteger|)) "\\spad{factor(p,listOfDegrees,r)} factorizes the polynomial \\spad{p} using the single factor bound algorithm,{} knowing that \\spad{p} has for possible splitting of its degree \\spad{listOfDegrees} and that \\spad{p} has at least \\spad{r} factors.") (((|Factored| |#1|) |#1| (|List| (|NonNegativeInteger|))) "\\spad{factor(p,listOfDegrees)} factorizes the polynomial \\spad{p} using the single factor bound algorithm and knowing that \\spad{p} has for possible splitting of its degree \\spad{listOfDegrees}.") (((|Factored| |#1|) |#1| (|NonNegativeInteger|)) "\\spad{factor(p,r)} factorizes the polynomial \\spad{p} using the single factor bound algorithm and knowing that \\spad{p} has at least \\spad{r} factors.") (((|Factored| |#1|) |#1|) "\\spad{factor(p)} returns the factorization of \\spad{p} over the integers.")) (|tryFunctionalDecomposition| (((|Boolean|) (|Boolean|)) "\\spad{tryFunctionalDecomposition(b)} chooses whether factorizers have to look for functional decomposition of polynomials (\\spad{true}) or not (\\spad{false}). Returns the previous value.")) (|tryFunctionalDecomposition?| (((|Boolean|)) "\\spad{tryFunctionalDecomposition?()} returns \\spad{true} if factorizers try functional decomposition of polynomials before factoring them.")) (|eisensteinIrreducible?| (((|Boolean|) |#1|) "\\spad{eisensteinIrreducible?(p)} returns \\spad{true} if \\spad{p} can be shown to be irreducible by Eisenstein\\spad{'s} criterion,{} \\spad{false} is inconclusive.")) (|useEisensteinCriterion| (((|Boolean|) (|Boolean|)) "\\spad{useEisensteinCriterion(b)} chooses whether factorizers check Eisenstein\\spad{'s} criterion before factoring: \\spad{true} for using it,{} \\spad{false} else. Returns the previous value.")) (|useEisensteinCriterion?| (((|Boolean|)) "\\spad{useEisensteinCriterion?()} returns \\spad{true} if factorizers check Eisenstein\\spad{'s} criterion before factoring.")) (|useSingleFactorBound| (((|Boolean|) (|Boolean|)) "\\spad{useSingleFactorBound(b)} chooses the algorithm to be used by the factorizers: \\spad{true} for algorithm with single factor bound,{} \\spad{false} for algorithm with overall bound. Returns the previous value.")) (|useSingleFactorBound?| (((|Boolean|)) "\\spad{useSingleFactorBound?()} returns \\spad{true} if algorithm with single factor bound is used for factorization,{} \\spad{false} for algorithm with overall bound.")) (|modularFactor| (((|Record| (|:| |prime| (|Integer|)) (|:| |factors| (|List| |#1|))) |#1|) "\\spad{modularFactor(f)} chooses a \"good\" prime and returns the factorization of \\spad{f} modulo this prime in a form that may be used by \\spadfunFrom{completeHensel}{GeneralHenselPackage}. If prime is zero it means that \\spad{f} has been proved to be irreducible over the integers or that \\spad{f} is a unit (\\spadignore{i.e.} 1 or \\spad{-1}). \\spad{f} shall be primitive (\\spadignore{i.e.} content(\\spad{p})\\spad{=1}) and square free (\\spadignore{i.e.} without repeated factors).")) (|numberOfFactors| (((|NonNegativeInteger|) (|List| (|Record| (|:| |factor| |#1|) (|:| |degree| (|Integer|))))) "\\spad{numberOfFactors(ddfactorization)} returns the number of factors of the polynomial \\spad{f} modulo \\spad{p} where \\spad{ddfactorization} is the distinct degree factorization of \\spad{f} computed by \\spadfunFrom{ddFact}{ModularDistinctDegreeFactorizer} for some prime \\spad{p}.")) (|stopMusserTrials| (((|PositiveInteger|) (|PositiveInteger|)) "\\spad{stopMusserTrials(n)} sets to \\spad{n} the bound on the number of factors for which \\spadfun{modularFactor} stops to look for an other prime. You will have to remember that the step of recombining the extraneous factors may take up to \\spad{2**n} trials. Returns the previous value.") (((|PositiveInteger|)) "\\spad{stopMusserTrials()} returns the bound on the number of factors for which \\spadfun{modularFactor} stops to look for an other prime. You will have to remember that the step of recombining the extraneous factors may take up to \\spad{2**stopMusserTrials()} trials.")) (|musserTrials| (((|PositiveInteger|) (|PositiveInteger|)) "\\spad{musserTrials(n)} sets to \\spad{n} the number of primes to be tried in \\spadfun{modularFactor} and returns the previous value.") (((|PositiveInteger|)) "\\spad{musserTrials()} returns the number of primes that are tried in \\spadfun{modularFactor}.")) (|degreePartition| (((|Multiset| (|NonNegativeInteger|)) (|List| (|Record| (|:| |factor| |#1|) (|:| |degree| (|Integer|))))) "\\spad{degreePartition(ddfactorization)} returns the degree partition of the polynomial \\spad{f} modulo \\spad{p} where \\spad{ddfactorization} is the distinct degree factorization of \\spad{f} computed by \\spadfunFrom{ddFact}{ModularDistinctDegreeFactorizer} for some prime \\spad{p}.")) (|makeFR| (((|Factored| |#1|) (|Record| (|:| |contp| (|Integer|)) (|:| |factors| (|List| (|Record| (|:| |irr| |#1|) (|:| |pow| (|Integer|))))))) "\\spad{makeFR(flist)} turns the final factorization of henselFact into a \\spadtype{Factored} object."))) 
 NIL 
 NIL 
-(-457 R UP -2174) 
+(-457 R UP -2173) 
 ((|constructor| (NIL "\\spadtype{GaloisGroupFactorizationUtilities} provides functions that will be used by the factorizer.")) (|length| ((|#3| |#2|) "\\spad{length(p)} returns the sum of the absolute values of the coefficients of the polynomial \\spad{p}.")) (|height| ((|#3| |#2|) "\\spad{height(p)} returns the maximal absolute value of the coefficients of the polynomial \\spad{p}.")) (|infinityNorm| ((|#3| |#2|) "\\spad{infinityNorm(f)} returns the maximal absolute value of the coefficients of the polynomial \\spad{f}.")) (|quadraticNorm| ((|#3| |#2|) "\\spad{quadraticNorm(f)} returns the \\spad{l2} norm of the polynomial \\spad{f}.")) (|norm| ((|#3| |#2| (|PositiveInteger|)) "\\spad{norm(f,p)} returns the \\spad{lp} norm of the polynomial \\spad{f}.")) (|singleFactorBound| (((|Integer|) |#2|) "\\spad{singleFactorBound(p,r)} returns a bound on the infinite norm of the factor of \\spad{p} with smallest Bombieri\\spad{'s} norm. \\spad{p} shall be of degree higher or equal to 2.") (((|Integer|) |#2| (|NonNegativeInteger|)) "\\spad{singleFactorBound(p,r)} returns a bound on the infinite norm of the factor of \\spad{p} with smallest Bombieri\\spad{'s} norm. \\spad{r} is a lower bound for the number of factors of \\spad{p}. \\spad{p} shall be of degree higher or equal to 2.")) (|rootBound| (((|Integer|) |#2|) "\\spad{rootBound(p)} returns a bound on the largest norm of the complex roots of \\spad{p}.")) (|bombieriNorm| ((|#3| |#2| (|PositiveInteger|)) "\\spad{bombieriNorm(p,n)} returns the \\spad{n}th Bombieri\\spad{'s} norm of \\spad{p}.") ((|#3| |#2|) "\\spad{bombieriNorm(p)} returns quadratic Bombieri\\spad{'s} norm of \\spad{p}.")) (|beauzamyBound| (((|Integer|) |#2|) "\\spad{beauzamyBound(p)} returns a bound on the larger coefficient of any factor of \\spad{p}."))) 
 NIL 
 NIL 
@@ -1868,7 +1868,7 @@ NIL
 ((|constructor| (NIL "GradedModule(\\spad{R},{}\\spad{E}) denotes ``E-graded \\spad{R}-module\\spad{''},{} \\spadignore{i.e.} collection of \\spad{R}-modules indexed by an abelian monoid \\spad{E}. An element \\spad{g} of \\spad{G[s]} for some specific \\spad{s} in \\spad{E} is said to be an element of \\spad{G} with {\\em degree} \\spad{s}. Sums are defined in each module \\spad{G[s]} so two elements of \\spad{G} have a sum if they have the same degree. \\blankline Morphisms can be defined and composed by degree to give the mathematical category of graded modules.")) (+ (($ $ $) "\\spad{g+h} is the sum of \\spad{g} and \\spad{h} in the module of elements of the same degree as \\spad{g} and \\spad{h}. Error: if \\spad{g} and \\spad{h} have different degrees.")) (- (($ $ $) "\\spad{g-h} is the difference of \\spad{g} and \\spad{h} in the module of elements of the same degree as \\spad{g} and \\spad{h}. Error: if \\spad{g} and \\spad{h} have different degrees.") (($ $) "\\spad{-g} is the additive inverse of \\spad{g} in the module of elements of the same grade as \\spad{g}.")) (* (($ $ |#1|) "\\spad{g*r} is right module multiplication.") (($ |#1| $) "\\spad{r*g} is left module multiplication.")) ((|Zero|) (($) "0 denotes the zero of degree 0.")) (|degree| ((|#2| $) "\\spad{degree(g)} names the degree of \\spad{g}. The set of all elements of a given degree form an \\spad{R}-module."))) 
 NIL 
 NIL 
-(-485 |lv| -2174 R) 
+(-485 |lv| -2173 R) 
 ((|constructor| (NIL "\\indented{1}{Author : \\spad{P}.Gianni,{} Summer \\spad{'88},{} revised November \\spad{'89}} Solve systems of polynomial equations using Groebner bases Total order Groebner bases are computed and then converted to lex ones This package is mostly intended for internal use.")) (|genericPosition| (((|Record| (|:| |dpolys| (|List| (|DistributedMultivariatePolynomial| |#1| |#2|))) (|:| |coords| (|List| (|Integer|)))) (|List| (|DistributedMultivariatePolynomial| |#1| |#2|)) (|List| (|OrderedVariableList| |#1|))) "\\spad{genericPosition(lp,lv)} puts a radical zero dimensional ideal in general position,{} for system \\spad{lp} in variables \\spad{lv}.")) (|testDim| (((|Union| (|List| (|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|)) "failed") (|List| (|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|)) (|List| (|OrderedVariableList| |#1|))) "\\spad{testDim(lp,lv)} tests if the polynomial system \\spad{lp} in variables \\spad{lv} is zero dimensional.")) (|groebSolve| (((|List| (|List| (|DistributedMultivariatePolynomial| |#1| |#2|))) (|List| (|DistributedMultivariatePolynomial| |#1| |#2|)) (|List| (|OrderedVariableList| |#1|))) "\\spad{groebSolve(lp,lv)} reduces the polynomial system \\spad{lp} in variables \\spad{lv} to triangular form. Algorithm based on groebner bases algorithm with linear algebra for change of ordering. Preprocessing for the general solver. The polynomials in input are of type \\spadtype{DMP}."))) 
 NIL 
 NIL 
@@ -1883,11 +1883,11 @@ NIL
 (-488 |Coef| |var| |cen|) 
 ((|constructor| (NIL "This is a category of univariate Puiseux series constructed from univariate Laurent series. A Puiseux series is represented by a pair \\spad{[r,f(x)]},{} where \\spad{r} is a positive rational number and \\spad{f(x)} is a Laurent series. This pair represents the Puiseux series \\spad{f(x\\^r)}.")) (|integrate| (($ $ (|Variable| |#2|)) "\\spad{integrate(f(x))} returns an anti-derivative of the power series \\spad{f(x)} with constant coefficient 0. We may integrate a series when we can divide coefficients by integers.")) (|coerce| (($ (|UnivariatePuiseuxSeries| |#1| |#2| |#3|)) "\\spad{coerce(f)} converts a Puiseux series to a general power series.") (($ (|Variable| |#2|)) "\\spad{coerce(var)} converts the series variable \\spad{var} into a Puiseux series."))) 
 (((-4509 "*") |has| |#1| (-175)) (-4500 |has| |#1| (-570)) (-4505 |has| |#1| (-376)) (-4499 |has| |#1| (-376)) (-4501 . T) (-4502 . T) (-4504 . T)) 
-((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasCategory| |#1| (QUOTE (-570))) (|HasCategory| |#1| (QUOTE (-175))) (-2225 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-570)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (LIST (QUOTE -927) (QUOTE (-1207)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -421) (QUOTE (-578))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -421) (QUOTE (-578))) (|devaluate| |#1|)))) (|HasCategory| (-421 (-578)) (QUOTE (-1143))) (|HasCategory| |#1| (QUOTE (-376))) (-2225 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-570)))) (-2225 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-570)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -421) (QUOTE (-578)))))) (|HasSignature| |#1| (LIST (QUOTE -2863) (LIST (|devaluate| |#1|) (QUOTE (-1207)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -421) (QUOTE (-578)))))) (-2225 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-988))) (|HasCategory| |#1| (QUOTE (-1233))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasSignature| |#1| (LIST (QUOTE -1369) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1207))))) (|HasSignature| |#1| (LIST (QUOTE -1880) (LIST (LIST (QUOTE -666) (QUOTE (-1207))) (|devaluate| |#1|))))))) 
+((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasCategory| |#1| (QUOTE (-570))) (|HasCategory| |#1| (QUOTE (-175))) (-2225 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-570)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (LIST (QUOTE -927) (QUOTE (-1207)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -421) (QUOTE (-578))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -421) (QUOTE (-578))) (|devaluate| |#1|)))) (|HasCategory| (-421 (-578)) (QUOTE (-1143))) (|HasCategory| |#1| (QUOTE (-376))) (-2225 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-570)))) (-2225 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-570)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -421) (QUOTE (-578)))))) (|HasSignature| |#1| (LIST (QUOTE -2864) (LIST (|devaluate| |#1|) (QUOTE (-1207)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -421) (QUOTE (-578)))))) (-2225 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-988))) (|HasCategory| |#1| (QUOTE (-1233))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasSignature| |#1| (LIST (QUOTE -2924) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1207))))) (|HasSignature| |#1| (LIST (QUOTE -1880) (LIST (LIST (QUOTE -666) (QUOTE (-1207))) (|devaluate| |#1|))))))) 
 (-489 |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."))) 
 ((-4508 . T)) 
-((-12 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-1131))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (LIST (QUOTE -321) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2338) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -2078) (|devaluate| |#2|)))))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-1131))) (|HasCategory| |#2| (QUOTE (-1131)))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-1131))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-1131)))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-1131))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| |#2| (QUOTE (-1131))) (|HasCategory| |#2| (LIST (QUOTE -632) (QUOTE (-886))))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (LIST (QUOTE -633) (QUOTE (-550)))) (-12 (|HasCategory| |#2| (QUOTE (-1131))) (|HasCategory| |#2| (LIST (QUOTE -321) (|devaluate| |#2|)))) (|HasCategory| |#1| (QUOTE (-871))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-102)))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| |#2| (LIST (QUOTE -632) (QUOTE (-886))))) (|HasCategory| |#2| (QUOTE (-1131))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-1131)))) 
+((-12 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-1131))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (LIST (QUOTE -321) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2338) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -2079) (|devaluate| |#2|)))))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-1131))) (|HasCategory| |#2| (QUOTE (-1131)))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-1131))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-1131)))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-1131))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| |#2| (QUOTE (-1131))) (|HasCategory| |#2| (LIST (QUOTE -632) (QUOTE (-886))))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (LIST (QUOTE -633) (QUOTE (-550)))) (-12 (|HasCategory| |#2| (QUOTE (-1131))) (|HasCategory| |#2| (LIST (QUOTE -321) (|devaluate| |#2|)))) (|HasCategory| |#1| (QUOTE (-871))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-102)))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| |#2| (LIST (QUOTE -632) (QUOTE (-886))))) (|HasCategory| |#2| (QUOTE (-1131))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-1131)))) 
 (-490 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)}"))) 
 ((-4508 . T) (-4507 . T)) 
@@ -1903,7 +1903,7 @@ NIL
 (-493 |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."))) 
 ((-4507 . T) (-4508 . T)) 
-((-12 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-1131))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (LIST (QUOTE -321) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2338) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -2078) (|devaluate| |#2|)))))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-1131))) (|HasCategory| |#2| (QUOTE (-1131)))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-1131))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-1131)))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-1131))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| |#2| (QUOTE (-1131))) (|HasCategory| |#2| (LIST (QUOTE -632) (QUOTE (-886))))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (LIST (QUOTE -633) (QUOTE (-550)))) (-12 (|HasCategory| |#2| (QUOTE (-1131))) (|HasCategory| |#2| (LIST (QUOTE -321) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-1131))) (|HasCategory| |#1| (QUOTE (-871))) (|HasCategory| |#2| (QUOTE (-1131))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| |#2| (LIST (QUOTE -632) (QUOTE (-886))))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-102)))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-102)))) 
+((-12 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-1131))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (LIST (QUOTE -321) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2338) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -2079) (|devaluate| |#2|)))))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-1131))) (|HasCategory| |#2| (QUOTE (-1131)))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-1131))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-1131)))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-1131))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| |#2| (QUOTE (-1131))) (|HasCategory| |#2| (LIST (QUOTE -632) (QUOTE (-886))))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (LIST (QUOTE -633) (QUOTE (-550)))) (-12 (|HasCategory| |#2| (QUOTE (-1131))) (|HasCategory| |#2| (LIST (QUOTE -321) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-1131))) (|HasCategory| |#1| (QUOTE (-871))) (|HasCategory| |#2| (QUOTE (-1131))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| |#2| (LIST (QUOTE -632) (QUOTE (-886))))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-102)))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-102)))) 
 (-494) 
 ((|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 
@@ -1924,7 +1924,7 @@ NIL
 ((|constructor| (NIL "Heap implemented in a flexible array to allow for insertions")) (|heap| (($ (|List| |#1|)) "\\spad{heap(ls)} creates a heap of elements consisting of the elements of \\spad{ls}."))) 
 ((-4507 . T) (-4508 . T)) 
 ((-12 (|HasCategory| |#1| (QUOTE (-1131))) (|HasCategory| |#1| (LIST (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1131))) (-2225 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1131)))) (-2225 (-12 (|HasCategory| |#1| (QUOTE (-1131))) (|HasCategory| |#1| (LIST (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -632) (QUOTE (-886))))) (|HasCategory| |#1| (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| |#1| (QUOTE (-102)))) 
-(-499 -2174 UP UPUP R) 
+(-499 -2173 UP UPUP R) 
 ((|constructor| (NIL "This domains implements finite rational divisors on an hyperelliptic curve,{} that is finite formal sums SUM(\\spad{n} * \\spad{P}) where the \\spad{n}\\spad{'s} are integers and the \\spad{P}\\spad{'s} are finite rational points on the curve. The equation of the curve must be \\spad{y^2} = \\spad{f}(\\spad{x}) and \\spad{f} must have odd degree."))) 
 NIL 
 NIL 
@@ -1960,7 +1960,7 @@ NIL
 ((|constructor| (NIL "Category for the hyperbolic trigonometric functions.")) (|tanh| (($ $) "\\spad{tanh(x)} returns the hyperbolic tangent of \\spad{x}.")) (|sinh| (($ $) "\\spad{sinh(x)} returns the hyperbolic sine of \\spad{x}.")) (|sech| (($ $) "\\spad{sech(x)} returns the hyperbolic secant of \\spad{x}.")) (|csch| (($ $) "\\spad{csch(x)} returns the hyperbolic cosecant of \\spad{x}.")) (|coth| (($ $) "\\spad{coth(x)} returns the hyperbolic cotangent of \\spad{x}.")) (|cosh| (($ $) "\\spad{cosh(x)} returns the hyperbolic cosine of \\spad{x}."))) 
 NIL 
 NIL 
-(-508 -2174 UP |AlExt| |AlPol|) 
+(-508 -2173 UP |AlExt| |AlPol|) 
 ((|constructor| (NIL "Factorization of univariate polynomials with coefficients in an algebraic extension of a field over which we can factor UP\\spad{'s}.")) (|factor| (((|Factored| |#4|) |#4| (|Mapping| (|Factored| |#2|) |#2|)) "\\spad{factor(p, f)} returns a prime factorisation of \\spad{p}; \\spad{f} is a factorisation map for elements of UP."))) 
 NIL 
 NIL 
@@ -1980,7 +1980,7 @@ NIL
 ((|constructor| (NIL "\\indented{1}{Author: Clifton Williamson} Date Created: 9 August 1993 Date Last Updated: 3 December 1993 Basic Operations: chineseRemainder,{} factorList Related Domains: PAdicWildFunctionFieldIntegralBasis(\\spad{K},{}\\spad{R},{}UP,{}\\spad{F}) Also See: WildFunctionFieldIntegralBasis,{} FunctionFieldIntegralBasis AMS Classifications: Keywords: function field,{} finite field,{} integral basis Examples: References: Description:")) (|chineseRemainder| (((|Record| (|:| |basis| (|Matrix| |#2|)) (|:| |basisDen| |#2|) (|:| |basisInv| (|Matrix| |#2|))) (|List| |#3|) (|List| (|Record| (|:| |basis| (|Matrix| |#2|)) (|:| |basisDen| |#2|) (|:| |basisInv| (|Matrix| |#2|)))) (|NonNegativeInteger|)) "\\spad{chineseRemainder(lu,lr,n)} \\undocumented")) (|listConjugateBases| (((|List| (|Record| (|:| |basis| (|Matrix| |#2|)) (|:| |basisDen| |#2|) (|:| |basisInv| (|Matrix| |#2|)))) (|Record| (|:| |basis| (|Matrix| |#2|)) (|:| |basisDen| |#2|) (|:| |basisInv| (|Matrix| |#2|))) (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{listConjugateBases(bas,q,n)} returns the list \\spad{[bas,bas^Frob,bas^(Frob^2),...bas^(Frob^(n-1))]},{} where \\spad{Frob} raises the coefficients of all polynomials appearing in the basis \\spad{bas} to the \\spad{q}th power.")) (|factorList| (((|List| (|SparseUnivariatePolynomial| |#1|)) |#1| (|NonNegativeInteger|) (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{factorList(k,n,m,j)} \\undocumented"))) 
 NIL 
 NIL 
-(-513 R UP -2174) 
+(-513 R UP -2173) 
 ((|constructor| (NIL "This package contains functions used in the packages FunctionFieldIntegralBasis and NumberFieldIntegralBasis.")) (|moduleSum| (((|Record| (|:| |basis| (|Matrix| |#1|)) (|:| |basisDen| |#1|) (|:| |basisInv| (|Matrix| |#1|))) (|Record| (|:| |basis| (|Matrix| |#1|)) (|:| |basisDen| |#1|) (|:| |basisInv| (|Matrix| |#1|))) (|Record| (|:| |basis| (|Matrix| |#1|)) (|:| |basisDen| |#1|) (|:| |basisInv| (|Matrix| |#1|)))) "\\spad{moduleSum(m1,m2)} returns the sum of two modules in the framed algebra \\spad{F}. Each module \\spad{mi} is represented as follows: \\spad{F} is a framed algebra with \\spad{R}-module basis \\spad{w1,w2,...,wn} and \\spad{mi} is a record \\spad{[basis,basisDen,basisInv]}. If \\spad{basis} is the matrix \\spad{(aij, i = 1..n, j = 1..n)},{} then a basis \\spad{v1,...,vn} for \\spad{mi} is given by \\spad{vi = (1/basisDen) * sum(aij * wj, j = 1..n)},{} \\spadignore{i.e.} the \\spad{i}th row of 'basis' contains the coordinates of the \\spad{i}th basis vector. Similarly,{} the \\spad{i}th row of the matrix \\spad{basisInv} contains the coordinates of \\spad{wi} with respect to the basis \\spad{v1,...,vn}: if \\spad{basisInv} is the matrix \\spad{(bij, i = 1..n, j = 1..n)},{} then \\spad{wi = sum(bij * vj, j = 1..n)}.")) (|idealiserMatrix| (((|Matrix| |#1|) (|Matrix| |#1|) (|Matrix| |#1|)) "\\spad{idealiserMatrix(m1, m2)} returns the matrix representing the linear conditions on the Ring associatied with an ideal defined by \\spad{m1} and \\spad{m2}.")) (|idealiser| (((|Matrix| |#1|) (|Matrix| |#1|) (|Matrix| |#1|) |#1|) "\\spad{idealiser(m1,m2,d)} computes the order of an ideal defined by \\spad{m1} and \\spad{m2} where \\spad{d} is the known part of the denominator") (((|Matrix| |#1|) (|Matrix| |#1|) (|Matrix| |#1|)) "\\spad{idealiser(m1,m2)} computes the order of an ideal defined by \\spad{m1} and \\spad{m2}")) (|leastPower| (((|NonNegativeInteger|) (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{leastPower(p,n)} returns \\spad{e},{} where \\spad{e} is the smallest integer such that \\spad{p **e >= n}")) (|divideIfCan!| ((|#1| (|Matrix| |#1|) (|Matrix| |#1|) |#1| (|Integer|)) "\\spad{divideIfCan!(matrix,matrixOut,prime,n)} attempts to divide the entries of \\spad{matrix} by \\spad{prime} and store the result in \\spad{matrixOut}. If it is successful,{} 1 is returned and if not,{} \\spad{prime} is returned. Here both \\spad{matrix} and \\spad{matrixOut} are \\spad{n}-by-\\spad{n} upper triangular matrices.")) (|matrixGcd| ((|#1| (|Matrix| |#1|) |#1| (|NonNegativeInteger|)) "\\spad{matrixGcd(mat,sing,n)} is \\spad{gcd(sing,g)} where \\spad{g} is the \\spad{gcd} of the entries of the \\spad{n}-by-\\spad{n} upper-triangular matrix \\spad{mat}.")) (|diagonalProduct| ((|#1| (|Matrix| |#1|)) "\\spad{diagonalProduct(m)} returns the product of the elements on the diagonal of the matrix \\spad{m}")) (|squareFree| (((|Factored| $) $) "\\spad{squareFree(x)} returns a square-free factorisation of \\spad{x}"))) 
 NIL 
 NIL 
@@ -2000,7 +2000,7 @@ NIL
 ((|constructor| (NIL "InnerCommonDenominator provides functions to compute the common denominator of a finite linear aggregate of elements of the quotient field of an integral domain.")) (|splitDenominator| (((|Record| (|:| |num| |#3|) (|:| |den| |#1|)) |#4|) "\\spad{splitDenominator([q1,...,qn])} returns \\spad{[[p1,...,pn], d]} such that \\spad{qi = pi/d} and \\spad{d} is a common denominator for the \\spad{qi}\\spad{'s}.")) (|clearDenominator| ((|#3| |#4|) "\\spad{clearDenominator([q1,...,qn])} returns \\spad{[p1,...,pn]} such that \\spad{qi = pi/d} where \\spad{d} is a common denominator for the \\spad{qi}\\spad{'s}.")) (|commonDenominator| ((|#1| |#4|) "\\spad{commonDenominator([q1,...,qn])} returns a common denominator \\spad{d} for \\spad{q1},{}...,{}\\spad{qn}."))) 
 NIL 
 NIL 
-(-518 -2174 |Expon| |VarSet| |DPoly|) 
+(-518 -2173 |Expon| |VarSet| |DPoly|) 
 ((|constructor| (NIL "This domain represents polynomial ideals with coefficients in any field and supports the basic ideal operations,{} including intersection sum and quotient. An ideal is represented by a list of polynomials (the generators of the ideal) and a boolean that is \\spad{true} if the generators are a Groebner basis. The algorithms used are based on Groebner basis computations. The ordering is determined by the datatype of the input polynomials. Users may use refinements of total degree orderings.")) (|relationsIdeal| (((|SuchThat| (|List| (|Polynomial| |#1|)) (|List| (|Equation| (|Polynomial| |#1|)))) (|List| |#4|)) "\\spad{relationsIdeal(polyList)} returns the ideal of relations among the polynomials in \\spad{polyList}.")) (|saturate| (($ $ |#4| (|List| |#3|)) "\\spad{saturate(I,f,lvar)} is the saturation with respect to the prime principal ideal which is generated by \\spad{f} in the polynomial ring \\spad{F[lvar]}.") (($ $ |#4|) "\\spad{saturate(I,f)} is the saturation of the ideal \\spad{I} with respect to the multiplicative set generated by the polynomial \\spad{f}.")) (|coerce| (($ (|List| |#4|)) "\\spad{coerce(polyList)} converts the list of polynomials \\spad{polyList} to an ideal.")) (|generators| (((|List| |#4|) $) "\\spad{generators(I)} returns a list of generators for the ideal \\spad{I}.")) (|groebner?| (((|Boolean|) $) "\\spad{groebner?(I)} tests if the generators of the ideal \\spad{I} are a Groebner basis.")) (|groebnerIdeal| (($ (|List| |#4|)) "\\spad{groebnerIdeal(polyList)} constructs the ideal generated by the list of polynomials \\spad{polyList} which are assumed to be a Groebner basis. Note: this operation avoids a Groebner basis computation.")) (|ideal| (($ (|List| |#4|)) "\\spad{ideal(polyList)} constructs the ideal generated by the list of polynomials \\spad{polyList}.")) (|leadingIdeal| (($ $) "\\spad{leadingIdeal(I)} is the ideal generated by the leading terms of the elements of the ideal \\spad{I}.")) (|dimension| (((|Integer|) $) "\\spad{dimension(I)} gives the dimension of the ideal \\spad{I}. in the ring \\spad{F[lvar]},{} where lvar are the variables appearing in \\spad{I}") (((|Integer|) $ (|List| |#3|)) "\\spad{dimension(I,lvar)} gives the dimension of the ideal \\spad{I},{} in the ring \\spad{F[lvar]}")) (|backOldPos| (($ (|Record| (|:| |mval| (|Matrix| |#1|)) (|:| |invmval| (|Matrix| |#1|)) (|:| |genIdeal| $))) "\\spad{backOldPos(genPos)} takes the result produced by \\spadfunFrom{generalPosition}{PolynomialIdeals} and performs the inverse transformation,{} returning the original ideal \\spad{backOldPos(generalPosition(I,listvar))} = \\spad{I}.")) (|generalPosition| (((|Record| (|:| |mval| (|Matrix| |#1|)) (|:| |invmval| (|Matrix| |#1|)) (|:| |genIdeal| $)) $ (|List| |#3|)) "\\spad{generalPosition(I,listvar)} perform a random linear transformation on the variables in \\spad{listvar} and returns the transformed ideal along with the change of basis matrix.")) (|groebner| (($ $) "\\spad{groebner(I)} returns a set of generators of \\spad{I} that are a Groebner basis for \\spad{I}.")) (|quotient| (($ $ |#4|) "\\spad{quotient(I,f)} computes the quotient of the ideal \\spad{I} by the principal ideal generated by the polynomial \\spad{f},{} \\spad{(I:(f))}.") (($ $ $) "\\spad{quotient(I,J)} computes the quotient of the ideals \\spad{I} and \\spad{J},{} \\spad{(I:J)}.")) (|intersect| (($ (|List| $)) "\\spad{intersect(LI)} computes the intersection of the list of ideals \\spad{LI}.") (($ $ $) "\\spad{intersect(I,J)} computes the intersection of the ideals \\spad{I} and \\spad{J}.")) (|zeroDim?| (((|Boolean|) $) "\\spad{zeroDim?(I)} tests if the ideal \\spad{I} is zero dimensional,{} \\spadignore{i.e.} all its associated primes are maximal,{} in the ring \\spad{F[lvar]},{} where lvar are the variables appearing in \\spad{I}") (((|Boolean|) $ (|List| |#3|)) "\\spad{zeroDim?(I,lvar)} tests if the ideal \\spad{I} is zero dimensional,{} \\spadignore{i.e.} all its associated primes are maximal,{} in the ring \\spad{F[lvar]}")) (|inRadical?| (((|Boolean|) |#4| $) "\\spad{inRadical?(f,I)} tests if some power of the polynomial \\spad{f} belongs to the ideal \\spad{I}.")) (|in?| (((|Boolean|) $ $) "\\spad{in?(I,J)} tests if the ideal \\spad{I} is contained in the ideal \\spad{J}.")) (|element?| (((|Boolean|) |#4| $) "\\spad{element?(f,I)} tests whether the polynomial \\spad{f} belongs to the ideal \\spad{I}.")) (|zero?| (((|Boolean|) $) "\\spad{zero?(I)} tests whether the ideal \\spad{I} is the zero ideal")) (|one?| (((|Boolean|) $) "\\spad{one?(I)} tests whether the ideal \\spad{I} is the unit ideal,{} \\spadignore{i.e.} contains 1.")) (+ (($ $ $) "\\spad{I+J} computes the ideal generated by the union of \\spad{I} and \\spad{J}.")) (** (($ $ (|NonNegativeInteger|)) "\\spad{I**n} computes the \\spad{n}th power of the ideal \\spad{I}.")) (* (($ $ $) "\\spad{I*J} computes the product of the ideal \\spad{I} and \\spad{J}."))) 
 NIL 
 ((|HasCategory| |#3| (LIST (QUOTE -633) (QUOTE (-1207))))) 
@@ -2112,7 +2112,7 @@ NIL
 ((|constructor| (NIL "\\indented{2}{IndexedExponents of an ordered set of variables gives a representation} for the degree of polynomials in commuting variables. It gives an ordered pairing of non negative integer exponents with variables"))) 
 NIL 
 ((-12 (|HasCategory| (-793) (QUOTE (-1131))) (|HasCategory| |#1| (QUOTE (-1131))))) 
-(-546 K -2174 |Par|) 
+(-546 K -2173 |Par|) 
 ((|constructor| (NIL "This package is the inner package to be used by NumericRealEigenPackage and NumericComplexEigenPackage for the computation of numeric eigenvalues and eigenvectors.")) (|innerEigenvectors| (((|List| (|Record| (|:| |outval| |#2|) (|:| |outmult| (|Integer|)) (|:| |outvect| (|List| (|Matrix| |#2|))))) (|Matrix| |#1|) |#3| (|Mapping| (|Factored| (|SparseUnivariatePolynomial| |#1|)) (|SparseUnivariatePolynomial| |#1|))) "\\spad{innerEigenvectors(m,eps,factor)} computes explicitly the eigenvalues and the correspondent eigenvectors of the matrix \\spad{m}. The parameter \\spad{eps} determines the type of the output,{} \\spad{factor} is the univariate factorizer to \\spad{br} used to reduce the characteristic polynomial into irreducible factors.")) (|solve1| (((|List| |#2|) (|SparseUnivariatePolynomial| |#1|) |#3|) "\\spad{solve1(pol, eps)} finds the roots of the univariate polynomial polynomial \\spad{pol} to precision eps. If \\spad{K} is \\spad{Fraction Integer} then only the real roots are returned,{} if \\spad{K} is \\spad{Complex Fraction Integer} then all roots are found.")) (|charpol| (((|SparseUnivariatePolynomial| |#1|) (|Matrix| |#1|)) "\\spad{charpol(m)} computes the characteristic polynomial of a matrix \\spad{m} with entries in \\spad{K}. This function returns a polynomial over \\spad{K},{} while the general one (that is in EiegenPackage) returns Fraction \\spad{P} \\spad{K}"))) 
 NIL 
 NIL 
@@ -2136,7 +2136,7 @@ NIL
 ((|constructor| (NIL "This package computes infinite products of univariate Taylor series over an integral domain of characteristic 0.")) (|generalInfiniteProduct| ((|#2| |#2| (|Integer|) (|Integer|)) "\\spad{generalInfiniteProduct(f(x),a,d)} computes \\spad{product(n=a,a+d,a+2*d,...,f(x**n))}. The series \\spad{f(x)} should have constant coefficient 1.")) (|oddInfiniteProduct| ((|#2| |#2|) "\\spad{oddInfiniteProduct(f(x))} computes \\spad{product(n=1,3,5...,f(x**n))}. The series \\spad{f(x)} should have constant coefficient 1.")) (|evenInfiniteProduct| ((|#2| |#2|) "\\spad{evenInfiniteProduct(f(x))} computes \\spad{product(n=2,4,6...,f(x**n))}. The series \\spad{f(x)} should have constant coefficient 1.")) (|infiniteProduct| ((|#2| |#2|) "\\spad{infiniteProduct(f(x))} computes \\spad{product(n=1,2,3...,f(x**n))}. The series \\spad{f(x)} should have constant coefficient 1."))) 
 NIL 
 NIL 
-(-552 K -2174 |Par|) 
+(-552 K -2173 |Par|) 
 ((|constructor| (NIL "This is an internal package for computing approximate solutions to systems of polynomial equations. The parameter \\spad{K} specifies the coefficient field of the input polynomials and must be either \\spad{Fraction(Integer)} or \\spad{Complex(Fraction Integer)}. The parameter \\spad{F} specifies where the solutions must lie and can be one of the following: \\spad{Float},{} \\spad{Fraction(Integer)},{} \\spad{Complex(Float)},{} \\spad{Complex(Fraction Integer)}. The last parameter specifies the type of the precision operand and must be either \\spad{Fraction(Integer)} or \\spad{Float}.")) (|makeEq| (((|List| (|Equation| (|Polynomial| |#2|))) (|List| |#2|) (|List| (|Symbol|))) "\\spad{makeEq(lsol,lvar)} returns a list of equations formed by corresponding members of \\spad{lvar} and \\spad{lsol}.")) (|innerSolve| (((|List| (|List| |#2|)) (|List| (|Polynomial| |#1|)) (|List| (|Polynomial| |#1|)) (|List| (|Symbol|)) |#3|) "\\spad{innerSolve(lnum,lden,lvar,eps)} returns a list of solutions of the system of polynomials \\spad{lnum},{} with the side condition that none of the members of \\spad{lden} vanish identically on any solution. Each solution is expressed as a list corresponding to the list of variables in \\spad{lvar} and with precision specified by \\spad{eps}.")) (|innerSolve1| (((|List| |#2|) (|Polynomial| |#1|) |#3|) "\\spad{innerSolve1(p,eps)} returns the list of the zeros of the polynomial \\spad{p} with precision \\spad{eps}.") (((|List| |#2|) (|SparseUnivariatePolynomial| |#1|) |#3|) "\\spad{innerSolve1(up,eps)} returns the list of the zeros of the univariate polynomial \\spad{up} with precision \\spad{eps}."))) 
 NIL 
 NIL 
@@ -2187,12 +2187,12 @@ NIL
 (-564 |Key| |Entry| |addDom|) 
 ((|constructor| (NIL "This domain is used to provide a conditional \"add\" domain for the implementation of \\spadtype{Table}."))) 
 ((-4507 . T) (-4508 . T)) 
-((-12 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-1131))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (LIST (QUOTE -321) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2338) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -2078) (|devaluate| |#2|)))))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-1131))) (|HasCategory| |#2| (QUOTE (-1131)))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-1131))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-1131)))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-1131))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| |#2| (QUOTE (-1131))) (|HasCategory| |#2| (LIST (QUOTE -632) (QUOTE (-886))))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (LIST (QUOTE -633) (QUOTE (-550)))) (-12 (|HasCategory| |#2| (QUOTE (-1131))) (|HasCategory| |#2| (LIST (QUOTE -321) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-1131))) (|HasCategory| |#1| (QUOTE (-871))) (|HasCategory| |#2| (QUOTE (-1131))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| |#2| (LIST (QUOTE -632) (QUOTE (-886))))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-102)))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-102)))) 
-(-565 R -2174) 
+((-12 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-1131))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (LIST (QUOTE -321) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2338) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -2079) (|devaluate| |#2|)))))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-1131))) (|HasCategory| |#2| (QUOTE (-1131)))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-1131))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-1131)))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-1131))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| |#2| (QUOTE (-1131))) (|HasCategory| |#2| (LIST (QUOTE -632) (QUOTE (-886))))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (LIST (QUOTE -633) (QUOTE (-550)))) (-12 (|HasCategory| |#2| (QUOTE (-1131))) (|HasCategory| |#2| (LIST (QUOTE -321) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-1131))) (|HasCategory| |#1| (QUOTE (-871))) (|HasCategory| |#2| (QUOTE (-1131))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| |#2| (LIST (QUOTE -632) (QUOTE (-886))))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-102)))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-102)))) 
+(-565 R -2173) 
 ((|constructor| (NIL "This package provides functions for the integration of algebraic integrands over transcendental functions.")) (|algint| (((|IntegrationResult| |#2|) |#2| (|Kernel| |#2|) (|Kernel| |#2|) (|Mapping| (|SparseUnivariatePolynomial| |#2|) (|SparseUnivariatePolynomial| |#2|))) "\\spad{algint(f, x, y, d)} returns the integral of \\spad{f(x,y)dx} where \\spad{y} is an algebraic function of \\spad{x}; \\spad{d} is the derivation to use on \\spad{k[x]}."))) 
 NIL 
 NIL 
-(-566 R0 -2174 UP UPUP R) 
+(-566 R0 -2173 UP UPUP R) 
 ((|constructor| (NIL "This package provides functions for integrating a function on an algebraic curve.")) (|palginfieldint| (((|Union| |#5| "failed") |#5| (|Mapping| |#3| |#3|)) "\\spad{palginfieldint(f, d)} returns an algebraic function \\spad{g} such that \\spad{dg = f} if such a \\spad{g} exists,{} \"failed\" otherwise. Argument \\spad{f} must be a pure algebraic function.")) (|palgintegrate| (((|IntegrationResult| |#5|) |#5| (|Mapping| |#3| |#3|)) "\\spad{palgintegrate(f, d)} integrates \\spad{f} with respect to the derivation \\spad{d}. Argument \\spad{f} must be a pure algebraic function.")) (|algintegrate| (((|IntegrationResult| |#5|) |#5| (|Mapping| |#3| |#3|)) "\\spad{algintegrate(f, d)} integrates \\spad{f} with respect to the derivation \\spad{d}."))) 
 NIL 
 NIL 
@@ -2212,7 +2212,7 @@ NIL
 ((|constructor| (NIL "The category of commutative integral domains,{} \\spadignore{i.e.} commutative rings with no zero divisors. \\blankline Conditional attributes: \\indented{2}{canonicalUnitNormal\\tab{20}the canonical field is the same for all associates} \\indented{2}{canonicalsClosed\\tab{20}the product of two canonicals is itself canonical}")) (|unit?| (((|Boolean|) $) "\\spad{unit?(x)} tests whether \\spad{x} is a unit,{} \\spadignore{i.e.} is invertible.")) (|associates?| (((|Boolean|) $ $) "\\spad{associates?(x,y)} tests whether \\spad{x} and \\spad{y} are associates,{} \\spadignore{i.e.} differ by a unit factor.")) (|unitCanonical| (($ $) "\\spad{unitCanonical(x)} returns \\spad{unitNormal(x).canonical}.")) (|unitNormal| (((|Record| (|:| |unit| $) (|:| |canonical| $) (|:| |associate| $)) $) "\\spad{unitNormal(x)} tries to choose a canonical element from the associate class of \\spad{x}. The attribute canonicalUnitNormal,{} if asserted,{} means that the \"canonical\" element is the same across all associates of \\spad{x} if \\spad{unitNormal(x) = [u,c,a]} then \\spad{u*c = x},{} \\spad{a*u = 1}.")) (|exquo| (((|Union| $ "failed") $ $) "\\spad{exquo(a,b)} either returns an element \\spad{c} such that \\spad{c*b=a} or \"failed\" if no such element can be found."))) 
 ((-4500 . T) ((-4509 "*") . T) (-4501 . T) (-4502 . T) (-4504 . T)) 
 NIL 
-(-571 R -2174) 
+(-571 R -2173) 
 ((|constructor| (NIL "This package provides functions for integration,{} limited integration,{} extended integration and the risch differential equation for elemntary functions.")) (|lfextlimint| (((|Union| (|Record| (|:| |ratpart| |#2|) (|:| |coeff| |#2|)) "failed") |#2| (|Symbol|) (|Kernel| |#2|) (|List| (|Kernel| |#2|))) "\\spad{lfextlimint(f,x,k,[k1,...,kn])} returns functions \\spad{[h, c]} such that \\spad{dh/dx = f - c dk/dx}. Value \\spad{h} is looked for in a field containing \\spad{f} and \\spad{k1},{}...,{}\\spad{kn} (the \\spad{ki}\\spad{'s} must be logs).")) (|lfintegrate| (((|IntegrationResult| |#2|) |#2| (|Symbol|)) "\\spad{lfintegrate(f, x)} = \\spad{g} such that \\spad{dg/dx = f}.")) (|lfinfieldint| (((|Union| |#2| "failed") |#2| (|Symbol|)) "\\spad{lfinfieldint(f, x)} returns a function \\spad{g} such that \\spad{dg/dx = f} if \\spad{g} exists,{} \"failed\" otherwise.")) (|lflimitedint| (((|Union| (|Record| (|:| |mainpart| |#2|) (|:| |limitedlogs| (|List| (|Record| (|:| |coeff| |#2|) (|:| |logand| |#2|))))) "failed") |#2| (|Symbol|) (|List| |#2|)) "\\spad{lflimitedint(f,x,[g1,...,gn])} returns functions \\spad{[h,[[ci, gi]]]} such that the \\spad{gi}\\spad{'s} are among \\spad{[g1,...,gn]},{} and \\spad{d(h+sum(ci log(gi)))/dx = f},{} if possible,{} \"failed\" otherwise.")) (|lfextendedint| (((|Union| (|Record| (|:| |ratpart| |#2|) (|:| |coeff| |#2|)) "failed") |#2| (|Symbol|) |#2|) "\\spad{lfextendedint(f, x, g)} returns functions \\spad{[h, c]} such that \\spad{dh/dx = f - cg},{} if (\\spad{h},{} \\spad{c}) exist,{} \"failed\" otherwise."))) 
 NIL 
 NIL 
@@ -2224,7 +2224,7 @@ NIL
 ((|constructor| (NIL "\\blankline")) (|entry| (((|Record| (|:| |endPointContinuity| (|Union| (|:| |continuous| "Continuous at the end points") (|:| |lowerSingular| "There is a singularity at the lower end point") (|:| |upperSingular| "There is a singularity at the upper end point") (|:| |bothSingular| "There are singularities at both end points") (|:| |notEvaluated| "End point continuity not yet evaluated"))) (|:| |singularitiesStream| (|Union| (|:| |str| (|Stream| (|DoubleFloat|))) (|:| |notEvaluated| "Internal singularities not yet evaluated"))) (|:| |range| (|Union| (|:| |finite| "The range is finite") (|:| |lowerInfinite| "The bottom of range is infinite") (|:| |upperInfinite| "The top of range is infinite") (|:| |bothInfinite| "Both top and bottom points are infinite") (|:| |notEvaluated| "Range not yet evaluated")))) (|Record| (|:| |var| (|Symbol|)) (|:| |fn| (|Expression| (|DoubleFloat|))) (|:| |range| (|Segment| (|OrderedCompletion| (|DoubleFloat|)))) (|:| |abserr| (|DoubleFloat|)) (|:| |relerr| (|DoubleFloat|)))) "\\spad{entry(n)} \\undocumented{}")) (|entries| (((|List| (|Record| (|:| |key| (|Record| (|:| |var| (|Symbol|)) (|:| |fn| (|Expression| (|DoubleFloat|))) (|:| |range| (|Segment| (|OrderedCompletion| (|DoubleFloat|)))) (|:| |abserr| (|DoubleFloat|)) (|:| |relerr| (|DoubleFloat|)))) (|:| |entry| (|Record| (|:| |endPointContinuity| (|Union| (|:| |continuous| "Continuous at the end points") (|:| |lowerSingular| "There is a singularity at the lower end point") (|:| |upperSingular| "There is a singularity at the upper end point") (|:| |bothSingular| "There are singularities at both end points") (|:| |notEvaluated| "End point continuity not yet evaluated"))) (|:| |singularitiesStream| (|Union| (|:| |str| (|Stream| (|DoubleFloat|))) (|:| |notEvaluated| "Internal singularities not yet evaluated"))) (|:| |range| (|Union| (|:| |finite| "The range is finite") (|:| |lowerInfinite| "The bottom of range is infinite") (|:| |upperInfinite| "The top of range is infinite") (|:| |bothInfinite| "Both top and bottom points are infinite") (|:| |notEvaluated| "Range not yet evaluated"))))))) $) "\\spad{entries(x)} \\undocumented{}")) (|showAttributes| (((|Union| (|Record| (|:| |endPointContinuity| (|Union| (|:| |continuous| "Continuous at the end points") (|:| |lowerSingular| "There is a singularity at the lower end point") (|:| |upperSingular| "There is a singularity at the upper end point") (|:| |bothSingular| "There are singularities at both end points") (|:| |notEvaluated| "End point continuity not yet evaluated"))) (|:| |singularitiesStream| (|Union| (|:| |str| (|Stream| (|DoubleFloat|))) (|:| |notEvaluated| "Internal singularities not yet evaluated"))) (|:| |range| (|Union| (|:| |finite| "The range is finite") (|:| |lowerInfinite| "The bottom of range is infinite") (|:| |upperInfinite| "The top of range is infinite") (|:| |bothInfinite| "Both top and bottom points are infinite") (|:| |notEvaluated| "Range not yet evaluated")))) "failed") (|Record| (|:| |var| (|Symbol|)) (|:| |fn| (|Expression| (|DoubleFloat|))) (|:| |range| (|Segment| (|OrderedCompletion| (|DoubleFloat|)))) (|:| |abserr| (|DoubleFloat|)) (|:| |relerr| (|DoubleFloat|)))) "\\spad{showAttributes(x)} \\undocumented{}")) (|insert!| (($ (|Record| (|:| |key| (|Record| (|:| |var| (|Symbol|)) (|:| |fn| (|Expression| (|DoubleFloat|))) (|:| |range| (|Segment| (|OrderedCompletion| (|DoubleFloat|)))) (|:| |abserr| (|DoubleFloat|)) (|:| |relerr| (|DoubleFloat|)))) (|:| |entry| (|Record| (|:| |endPointContinuity| (|Union| (|:| |continuous| "Continuous at the end points") (|:| |lowerSingular| "There is a singularity at the lower end point") (|:| |upperSingular| "There is a singularity at the upper end point") (|:| |bothSingular| "There are singularities at both end points") (|:| |notEvaluated| "End point continuity not yet evaluated"))) (|:| |singularitiesStream| (|Union| (|:| |str| (|Stream| (|DoubleFloat|))) (|:| |notEvaluated| "Internal singularities not yet evaluated"))) (|:| |range| (|Union| (|:| |finite| "The range is finite") (|:| |lowerInfinite| "The bottom of range is infinite") (|:| |upperInfinite| "The top of range is infinite") (|:| |bothInfinite| "Both top and bottom points are infinite") (|:| |notEvaluated| "Range not yet evaluated"))))))) "\\spad{insert!(r)} inserts an entry \\spad{r} into theIFTable")) (|fTable| (($ (|List| (|Record| (|:| |key| (|Record| (|:| |var| (|Symbol|)) (|:| |fn| (|Expression| (|DoubleFloat|))) (|:| |range| (|Segment| (|OrderedCompletion| (|DoubleFloat|)))) (|:| |abserr| (|DoubleFloat|)) (|:| |relerr| (|DoubleFloat|)))) (|:| |entry| (|Record| (|:| |endPointContinuity| (|Union| (|:| |continuous| "Continuous at the end points") (|:| |lowerSingular| "There is a singularity at the lower end point") (|:| |upperSingular| "There is a singularity at the upper end point") (|:| |bothSingular| "There are singularities at both end points") (|:| |notEvaluated| "End point continuity not yet evaluated"))) (|:| |singularitiesStream| (|Union| (|:| |str| (|Stream| (|DoubleFloat|))) (|:| |notEvaluated| "Internal singularities not yet evaluated"))) (|:| |range| (|Union| (|:| |finite| "The range is finite") (|:| |lowerInfinite| "The bottom of range is infinite") (|:| |upperInfinite| "The top of range is infinite") (|:| |bothInfinite| "Both top and bottom points are infinite") (|:| |notEvaluated| "Range not yet evaluated")))))))) "\\spad{fTable(l)} creates a functions table from the elements of \\spad{l}.")) (|keys| (((|List| (|Record| (|:| |var| (|Symbol|)) (|:| |fn| (|Expression| (|DoubleFloat|))) (|:| |range| (|Segment| (|OrderedCompletion| (|DoubleFloat|)))) (|:| |abserr| (|DoubleFloat|)) (|:| |relerr| (|DoubleFloat|)))) $) "\\spad{keys(f)} returns the list of keys of \\spad{f}")) (|clearTheFTable| (((|Void|)) "\\spad{clearTheFTable()} clears the current table of functions.")) (|showTheFTable| (($) "\\spad{showTheFTable()} returns the current table of functions."))) 
 NIL 
 NIL 
-(-574 R -2174 L) 
+(-574 R -2173 L) 
 ((|constructor| (NIL "This internal package rationalises integrands on curves of the form: \\indented{2}{\\spad{y\\^2 = a x\\^2 + b x + c}} \\indented{2}{\\spad{y\\^2 = (a x + b) / (c x + d)}} \\indented{2}{\\spad{f(x, y) = 0} where \\spad{f} has degree 1 in \\spad{x}} The rationalization is done for integration,{} limited integration,{} extended integration and the risch differential equation.")) (|palgLODE0| (((|Record| (|:| |particular| (|Union| |#2| "failed")) (|:| |basis| (|List| |#2|))) |#3| |#2| (|Kernel| |#2|) (|Kernel| |#2|) (|Kernel| |#2|) |#2| (|Fraction| (|SparseUnivariatePolynomial| |#2|))) "\\spad{palgLODE0(op,g,x,y,z,t,c)} returns the solution of \\spad{op f = g} Argument \\spad{y} is an algebraic function of \\spad{x} satisfying \\spad{f(x,y)dx = c f(t,y) dy}; \\spad{c} and \\spad{t} are rational functions of \\spad{y}.") (((|Record| (|:| |particular| (|Union| |#2| "failed")) (|:| |basis| (|List| |#2|))) |#3| |#2| (|Kernel| |#2|) (|Kernel| |#2|) |#2| (|SparseUnivariatePolynomial| |#2|)) "\\spad{palgLODE0(op, g, x, y, d, p)} returns the solution of \\spad{op f = g}. Argument \\spad{y} is an algebraic function of \\spad{x} satisfying \\spad{d(x)\\^2y(x)\\^2 = P(x)}.")) (|lift| (((|SparseUnivariatePolynomial| (|Fraction| (|SparseUnivariatePolynomial| |#2|))) (|SparseUnivariatePolynomial| |#2|) (|Kernel| |#2|)) "\\spad{lift(u,k)} \\undocumented")) (|multivariate| ((|#2| (|SparseUnivariatePolynomial| (|Fraction| (|SparseUnivariatePolynomial| |#2|))) (|Kernel| |#2|) |#2|) "\\spad{multivariate(u,k,f)} \\undocumented")) (|univariate| (((|SparseUnivariatePolynomial| (|Fraction| (|SparseUnivariatePolynomial| |#2|))) |#2| (|Kernel| |#2|) (|Kernel| |#2|) (|SparseUnivariatePolynomial| |#2|)) "\\spad{univariate(f,k,k,p)} \\undocumented")) (|palgRDE0| (((|Union| |#2| "failed") |#2| |#2| (|Kernel| |#2|) (|Kernel| |#2|) (|Mapping| (|Union| |#2| "failed") |#2| |#2| (|Symbol|)) (|Kernel| |#2|) |#2| (|Fraction| (|SparseUnivariatePolynomial| |#2|))) "\\spad{palgRDE0(f, g, x, y, foo, t, c)} returns a function \\spad{z(x,y)} such that \\spad{dz/dx + n * df/dx z(x,y) = g(x,y)} if such a \\spad{z} exists,{} and \"failed\" otherwise. Argument \\spad{y} is an algebraic function of \\spad{x} satisfying \\spad{f(x,y)dx = c f(t,y) dy}; \\spad{c} and \\spad{t} are rational functions of \\spad{y}. Argument \\spad{foo},{} called by \\spad{foo(a, b, x)},{} is a function that solves \\spad{du/dx + n * da/dx u(x) = u(x)} for an unknown \\spad{u(x)} not involving \\spad{y}.") (((|Union| |#2| "failed") |#2| |#2| (|Kernel| |#2|) (|Kernel| |#2|) (|Mapping| (|Union| |#2| "failed") |#2| |#2| (|Symbol|)) |#2| (|SparseUnivariatePolynomial| |#2|)) "\\spad{palgRDE0(f, g, x, y, foo, d, p)} returns a function \\spad{z(x,y)} such that \\spad{dz/dx + n * df/dx z(x,y) = g(x,y)} if such a \\spad{z} exists,{} and \"failed\" otherwise. Argument \\spad{y} is an algebraic function of \\spad{x} satisfying \\spad{d(x)\\^2y(x)\\^2 = P(x)}. Argument \\spad{foo},{} called by \\spad{foo(a, b, x)},{} is a function that solves \\spad{du/dx + n * da/dx u(x) = u(x)} for an unknown \\spad{u(x)} not involving \\spad{y}.")) (|palglimint0| (((|Union| (|Record| (|:| |mainpart| |#2|) (|:| |limitedlogs| (|List| (|Record| (|:| |coeff| |#2|) (|:| |logand| |#2|))))) "failed") |#2| (|Kernel| |#2|) (|Kernel| |#2|) (|List| |#2|) (|Kernel| |#2|) |#2| (|Fraction| (|SparseUnivariatePolynomial| |#2|))) "\\spad{palglimint0(f, x, y, [u1,...,un], z, t, c)} returns functions \\spad{[h,[[ci, ui]]]} such that the \\spad{ui}\\spad{'s} are among \\spad{[u1,...,un]} and \\spad{d(h + sum(ci log(ui)))/dx = f(x,y)} if such functions exist,{} and \"failed\" otherwise. Argument \\spad{y} is an algebraic function of \\spad{x} satisfying \\spad{f(x,y)dx = c f(t,y) dy}; \\spad{c} and \\spad{t} are rational functions of \\spad{y}.") (((|Union| (|Record| (|:| |mainpart| |#2|) (|:| |limitedlogs| (|List| (|Record| (|:| |coeff| |#2|) (|:| |logand| |#2|))))) "failed") |#2| (|Kernel| |#2|) (|Kernel| |#2|) (|List| |#2|) |#2| (|SparseUnivariatePolynomial| |#2|)) "\\spad{palglimint0(f, x, y, [u1,...,un], d, p)} returns functions \\spad{[h,[[ci, ui]]]} such that the \\spad{ui}\\spad{'s} are among \\spad{[u1,...,un]} and \\spad{d(h + sum(ci log(ui)))/dx = f(x,y)} if such functions exist,{} and \"failed\" otherwise. Argument \\spad{y} is an algebraic function of \\spad{x} satisfying \\spad{d(x)\\^2y(x)\\^2 = P(x)}.")) (|palgextint0| (((|Union| (|Record| (|:| |ratpart| |#2|) (|:| |coeff| |#2|)) "failed") |#2| (|Kernel| |#2|) (|Kernel| |#2|) |#2| (|Kernel| |#2|) |#2| (|Fraction| (|SparseUnivariatePolynomial| |#2|))) "\\spad{palgextint0(f, x, y, g, z, t, c)} returns functions \\spad{[h, d]} such that \\spad{dh/dx = f(x,y) - d g},{} where \\spad{y} is an algebraic function of \\spad{x} satisfying \\spad{f(x,y)dx = c f(t,y) dy},{} and \\spad{c} and \\spad{t} are rational functions of \\spad{y}. Argument \\spad{z} is a dummy variable not appearing in \\spad{f(x,y)}. The operation returns \"failed\" if no such functions exist.") (((|Union| (|Record| (|:| |ratpart| |#2|) (|:| |coeff| |#2|)) "failed") |#2| (|Kernel| |#2|) (|Kernel| |#2|) |#2| |#2| (|SparseUnivariatePolynomial| |#2|)) "\\spad{palgextint0(f, x, y, g, d, p)} returns functions \\spad{[h, c]} such that \\spad{dh/dx = f(x,y) - c g},{} where \\spad{y} is an algebraic function of \\spad{x} satisfying \\spad{d(x)\\^2 y(x)\\^2 = P(x)},{} or \"failed\" if no such functions exist.")) (|palgint0| (((|IntegrationResult| |#2|) |#2| (|Kernel| |#2|) (|Kernel| |#2|) (|Kernel| |#2|) |#2| (|Fraction| (|SparseUnivariatePolynomial| |#2|))) "\\spad{palgint0(f, x, y, z, t, c)} returns the integral of \\spad{f(x,y)dx} where \\spad{y} is an algebraic function of \\spad{x} satisfying \\spad{f(x,y)dx = c f(t,y) dy}; \\spad{c} and \\spad{t} are rational functions of \\spad{y}. Argument \\spad{z} is a dummy variable not appearing in \\spad{f(x,y)}.") (((|IntegrationResult| |#2|) |#2| (|Kernel| |#2|) (|Kernel| |#2|) |#2| (|SparseUnivariatePolynomial| |#2|)) "\\spad{palgint0(f, x, y, d, p)} returns the integral of \\spad{f(x,y)dx} where \\spad{y} is an algebraic function of \\spad{x} satisfying \\spad{d(x)\\^2 y(x)\\^2 = P(x)}."))) 
 NIL 
 ((|HasCategory| |#3| (LIST (QUOTE -678) (|devaluate| |#2|)))) 
@@ -2232,11 +2232,11 @@ NIL
 ((|constructor| (NIL "This package provides various number theoretic functions on the integers.")) (|sumOfKthPowerDivisors| (((|Integer|) (|Integer|) (|NonNegativeInteger|)) "\\spad{sumOfKthPowerDivisors(n,k)} returns the sum of the \\spad{k}th powers of the integers between 1 and \\spad{n} (inclusive) which divide \\spad{n}. the sum of the \\spad{k}th powers of the divisors of \\spad{n} is often denoted by \\spad{sigma_k(n)}.")) (|sumOfDivisors| (((|Integer|) (|Integer|)) "\\spad{sumOfDivisors(n)} returns the sum of the integers between 1 and \\spad{n} (inclusive) which divide \\spad{n}. The sum of the divisors of \\spad{n} is often denoted by \\spad{sigma(n)}.")) (|numberOfDivisors| (((|Integer|) (|Integer|)) "\\spad{numberOfDivisors(n)} returns the number of integers between 1 and \\spad{n} (inclusive) which divide \\spad{n}. The number of divisors of \\spad{n} is often denoted by \\spad{tau(n)}.")) (|moebiusMu| (((|Integer|) (|Integer|)) "\\spad{moebiusMu(n)} returns the Moebius function \\spad{mu(n)}. \\spad{mu(n)} is either \\spad{-1},{}0 or 1 as follows: \\spad{mu(n) = 0} if \\spad{n} is divisible by a square > 1,{} \\spad{mu(n) = (-1)^k} if \\spad{n} is square-free and has \\spad{k} distinct prime divisors.")) (|legendre| (((|Integer|) (|Integer|) (|Integer|)) "\\spad{legendre(a,p)} returns the Legendre symbol \\spad{L(a/p)}. \\spad{L(a/p) = (-1)**((p-1)/2) mod p} (\\spad{p} prime),{} which is 0 if \\spad{a} is 0,{} 1 if \\spad{a} is a quadratic residue \\spad{mod p} and \\spad{-1} otherwise. Note: because the primality test is expensive,{} if it is known that \\spad{p} is prime then use \\spad{jacobi(a,p)}.")) (|jacobi| (((|Integer|) (|Integer|) (|Integer|)) "\\spad{jacobi(a,b)} returns the Jacobi symbol \\spad{J(a/b)}. When \\spad{b} is odd,{} \\spad{J(a/b) = product(L(a/p) for p in factor b )}. Note: by convention,{} 0 is returned if \\spad{gcd(a,b) ~= 1}. Iterative \\spad{O(log(b)^2)} version coded by Michael Monagan June 1987.")) (|harmonic| (((|Fraction| (|Integer|)) (|Integer|)) "\\spad{harmonic(n)} returns the \\spad{n}th harmonic number. This is \\spad{H[n] = sum(1/k,k=1..n)}.")) (|fibonacci| (((|Integer|) (|Integer|)) "\\spad{fibonacci(n)} returns the \\spad{n}th Fibonacci number. the Fibonacci numbers \\spad{F[n]} are defined by \\spad{F[0] = F[1] = 1} and \\spad{F[n] = F[n-1] + F[n-2]}. The algorithm has running time \\spad{O(log(n)^3)}. Reference: Knuth,{} The Art of Computer Programming Vol 2,{} Semi-Numerical Algorithms.")) (|eulerPhi| (((|Integer|) (|Integer|)) "\\spad{eulerPhi(n)} returns the number of integers between 1 and \\spad{n} (including 1) which are relatively prime to \\spad{n}. This is the Euler phi function \\spad{\\phi(n)} is also called the totient function.")) (|euler| (((|Integer|) (|Integer|)) "\\spad{euler(n)} returns the \\spad{n}th Euler number. This is \\spad{2^n E(n,1/2)},{} where \\spad{E(n,x)} is the \\spad{n}th Euler polynomial.")) (|divisors| (((|List| (|Integer|)) (|Integer|)) "\\spad{divisors(n)} returns a list of the divisors of \\spad{n}.")) (|chineseRemainder| (((|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Integer|)) "\\spad{chineseRemainder(x1,m1,x2,m2)} returns \\spad{w},{} where \\spad{w} is such that \\spad{w = x1 mod m1} and \\spad{w = x2 mod m2}. Note: \\spad{m1} and \\spad{m2} must be relatively prime.")) (|bernoulli| (((|Fraction| (|Integer|)) (|Integer|)) "\\spad{bernoulli(n)} returns the \\spad{n}th Bernoulli number. this is \\spad{B(n,0)},{} where \\spad{B(n,x)} is the \\spad{n}th Bernoulli polynomial."))) 
 NIL 
 NIL 
-(-576 -2174 UP UPUP R) 
+(-576 -2173 UP UPUP R) 
 ((|constructor| (NIL "algebraic Hermite redution.")) (|HermiteIntegrate| (((|Record| (|:| |answer| |#4|) (|:| |logpart| |#4|)) |#4| (|Mapping| |#2| |#2|)) "\\spad{HermiteIntegrate(f, ')} returns \\spad{[g,h]} such that \\spad{f = g' + h} and \\spad{h} has a only simple finite normal poles."))) 
 NIL 
 NIL 
-(-577 -2174 UP) 
+(-577 -2173 UP) 
 ((|constructor| (NIL "Hermite integration,{} transcendental case.")) (|HermiteIntegrate| (((|Record| (|:| |answer| (|Fraction| |#2|)) (|:| |logpart| (|Fraction| |#2|)) (|:| |specpart| (|Fraction| |#2|)) (|:| |polypart| |#2|)) (|Fraction| |#2|) (|Mapping| |#2| |#2|)) "\\spad{HermiteIntegrate(f, D)} returns \\spad{[g, h, s, p]} such that \\spad{f = Dg + h + s + p},{} \\spad{h} has a squarefree denominator normal \\spad{w}.\\spad{r}.\\spad{t}. \\spad{D},{} and all the squarefree factors of the denominator of \\spad{s} are special \\spad{w}.\\spad{r}.\\spad{t}. \\spad{D}. Furthermore,{} \\spad{h} and \\spad{s} have no polynomial parts. \\spad{D} is the derivation to use on \\spadtype{UP}."))) 
 NIL 
 NIL 
@@ -2248,15 +2248,15 @@ NIL
 ((|measure| (((|Record| (|:| |measure| (|Float|)) (|:| |name| (|String|)) (|:| |explanations| (|List| (|String|))) (|:| |extra| (|Result|))) (|NumericalIntegrationProblem|) (|RoutinesTable|)) "\\spad{measure(prob,R)} is a top level ANNA function for identifying the most appropriate numerical routine from those in the routines table provided for solving the numerical integration problem defined by \\axiom{\\spad{prob}}. \\blankline It calls each \\axiom{domain} listed in \\axiom{\\spad{R}} of \\axiom{category} \\axiomType{NumericalIntegrationCategory} in turn to calculate all measures and returns the best \\spadignore{i.e.} the name of the most appropriate domain and any other relevant information.") (((|Record| (|:| |measure| (|Float|)) (|:| |name| (|String|)) (|:| |explanations| (|List| (|String|))) (|:| |extra| (|Result|))) (|NumericalIntegrationProblem|)) "\\spad{measure(prob)} is a top level ANNA function for identifying the most appropriate numerical routine for solving the numerical integration problem defined by \\axiom{\\spad{prob}}. \\blankline It calls each \\axiom{domain} of \\axiom{category} \\axiomType{NumericalIntegrationCategory} in turn to calculate all measures and returns the best \\spadignore{i.e.} the name of the most appropriate domain and any other relevant information.")) (|integrate| (((|Union| (|Result|) "failed") (|Expression| (|Float|)) (|SegmentBinding| (|OrderedCompletion| (|Float|))) (|Symbol|)) "\\spad{integrate(exp, x = a..b, numerical)} is a top level ANNA function to integrate an expression,{} {\\spad{\\tt} \\spad{exp}},{} over a given range,{} {\\spad{\\tt} a} to {\\spad{\\tt} \\spad{b}}. \\blankline It iterates over the \\axiom{domains} of \\axiomType{NumericalIntegrationCategory} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline It then performs the integration of the given expression on that \\axiom{domain}.\\newline \\blankline Default values for the absolute and relative error are used. \\blankline It is an error if the last argument is not {\\spad{\\tt} numerical}.") (((|Union| (|Result|) "failed") (|Expression| (|Float|)) (|SegmentBinding| (|OrderedCompletion| (|Float|))) (|String|)) "\\spad{integrate(exp, x = a..b, \"numerical\")} is a top level ANNA function to integrate an expression,{} {\\spad{\\tt} \\spad{exp}},{} over a given range,{} {\\spad{\\tt} a} to {\\spad{\\tt} \\spad{b}}. \\blankline It iterates over the \\axiom{domains} of \\axiomType{NumericalIntegrationCategory} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline It then performs the integration of the given expression on that \\axiom{domain}.\\newline \\blankline Default values for the absolute and relative error are used. \\blankline It is an error of the last argument is not {\\spad{\\tt} \"numerical\"}.") (((|Result|) (|Expression| (|Float|)) (|List| (|Segment| (|OrderedCompletion| (|Float|)))) (|Float|) (|Float|) (|RoutinesTable|)) "\\spad{integrate(exp, [a..b,c..d,...], epsabs, epsrel, routines)} is a top level ANNA function to integrate a multivariate expression,{} {\\spad{\\tt} \\spad{exp}},{} over a given set of ranges to the required absolute and relative accuracy,{} using the routines available in the RoutinesTable provided. \\blankline It iterates over the \\axiom{domains} of \\axiomType{NumericalIntegrationCategory} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline It then performs the integration of the given expression on that \\axiom{domain}.") (((|Result|) (|Expression| (|Float|)) (|List| (|Segment| (|OrderedCompletion| (|Float|)))) (|Float|) (|Float|)) "\\spad{integrate(exp, [a..b,c..d,...], epsabs, epsrel)} is a top level ANNA function to integrate a multivariate expression,{} {\\spad{\\tt} \\spad{exp}},{} over a given set of ranges to the required absolute and relative accuracy. \\blankline It iterates over the \\axiom{domains} of \\axiomType{NumericalIntegrationCategory} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline It then performs the integration of the given expression on that \\axiom{domain}.") (((|Result|) (|Expression| (|Float|)) (|List| (|Segment| (|OrderedCompletion| (|Float|)))) (|Float|)) "\\spad{integrate(exp, [a..b,c..d,...], epsrel)} is a top level ANNA function to integrate a multivariate expression,{} {\\spad{\\tt} \\spad{exp}},{} over a given set of ranges to the required relative accuracy. \\blankline It iterates over the \\axiom{domains} of \\axiomType{NumericalIntegrationCategory} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline It then performs the integration of the given expression on that \\axiom{domain}. \\blankline If epsrel = 0,{} a default absolute accuracy is used.") (((|Result|) (|Expression| (|Float|)) (|List| (|Segment| (|OrderedCompletion| (|Float|))))) "\\spad{integrate(exp, [a..b,c..d,...])} is a top level ANNA function to integrate a multivariate expression,{} {\\spad{\\tt} \\spad{exp}},{} over a given set of ranges. \\blankline It iterates over the \\axiom{domains} of \\axiomType{NumericalIntegrationCategory} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline It then performs the integration of the given expression on that \\axiom{domain}. \\blankline Default values for the absolute and relative error are used.") (((|Result|) (|Expression| (|Float|)) (|Segment| (|OrderedCompletion| (|Float|)))) "\\spad{integrate(exp, a..b)} is a top level ANNA function to integrate an expression,{} {\\spad{\\tt} \\spad{exp}},{} over a given range {\\spad{\\tt} a} to {\\spad{\\tt} \\spad{b}}. \\blankline It iterates over the \\axiom{domains} of \\axiomType{NumericalIntegrationCategory} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline It then performs the integration of the given expression on that \\axiom{domain}. \\blankline Default values for the absolute and relative error are used.") (((|Result|) (|Expression| (|Float|)) (|Segment| (|OrderedCompletion| (|Float|))) (|Float|)) "\\spad{integrate(exp, a..b, epsrel)} is a top level ANNA function to integrate an expression,{} {\\spad{\\tt} \\spad{exp}},{} over a given range {\\spad{\\tt} a} to {\\spad{\\tt} \\spad{b}} to the required relative accuracy. \\blankline It iterates over the \\axiom{domains} of \\axiomType{NumericalIntegrationCategory} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline It then performs the integration of the given expression on that \\axiom{domain}. \\blankline If epsrel = 0,{} a default absolute accuracy is used.") (((|Result|) (|Expression| (|Float|)) (|Segment| (|OrderedCompletion| (|Float|))) (|Float|) (|Float|)) "\\spad{integrate(exp, a..b, epsabs, epsrel)} is a top level ANNA function to integrate an expression,{} {\\spad{\\tt} \\spad{exp}},{} over a given range {\\spad{\\tt} a} to {\\spad{\\tt} \\spad{b}} to the required absolute and relative accuracy. \\blankline It iterates over the \\axiom{domains} of \\axiomType{NumericalIntegrationCategory} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline It then performs the integration of the given expression on that \\axiom{domain}.") (((|Result|) (|NumericalIntegrationProblem|)) "\\spad{integrate(IntegrationProblem)} is a top level ANNA function to integrate an expression over a given range or ranges to the required absolute and relative accuracy. \\blankline It iterates over the \\axiom{domains} of \\axiomType{NumericalIntegrationCategory} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline It then performs the integration of the given expression on that \\axiom{domain}.") (((|Result|) (|Expression| (|Float|)) (|Segment| (|OrderedCompletion| (|Float|))) (|Float|) (|Float|) (|RoutinesTable|)) "\\spad{integrate(exp, a..b, epsrel, routines)} is a top level ANNA function to integrate an expression,{} {\\spad{\\tt} \\spad{exp}},{} over a given range {\\spad{\\tt} a} to {\\spad{\\tt} \\spad{b}} to the required absolute and relative accuracy using the routines available in the RoutinesTable provided. \\blankline It iterates over the \\axiom{domains} of \\axiomType{NumericalIntegrationCategory} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline It then performs the integration of the given expression on that \\axiom{domain}."))) 
 NIL 
 NIL 
-(-580 R -2174 L) 
+(-580 R -2173 L) 
 ((|constructor| (NIL "This package provides functions for integration,{} limited integration,{} extended integration and the risch differential equation for pure algebraic integrands.")) (|palgLODE| (((|Record| (|:| |particular| (|Union| |#2| "failed")) (|:| |basis| (|List| |#2|))) |#3| |#2| (|Kernel| |#2|) (|Kernel| |#2|) (|Symbol|)) "\\spad{palgLODE(op, g, kx, y, x)} returns the solution of \\spad{op f = g}. \\spad{y} is an algebraic function of \\spad{x}.")) (|palgRDE| (((|Union| |#2| "failed") |#2| |#2| |#2| (|Kernel| |#2|) (|Kernel| |#2|) (|Mapping| (|Union| |#2| "failed") |#2| |#2| (|Symbol|))) "\\spad{palgRDE(nfp, f, g, x, y, foo)} returns a function \\spad{z(x,y)} such that \\spad{dz/dx + n * df/dx z(x,y) = g(x,y)} if such a \\spad{z} exists,{} \"failed\" otherwise; \\spad{y} is an algebraic function of \\spad{x}; \\spad{foo(a, b, x)} is a function that solves \\spad{du/dx + n * da/dx u(x) = u(x)} for an unknown \\spad{u(x)} not involving \\spad{y}. \\spad{nfp} is \\spad{n * df/dx}.")) (|palglimint| (((|Union| (|Record| (|:| |mainpart| |#2|) (|:| |limitedlogs| (|List| (|Record| (|:| |coeff| |#2|) (|:| |logand| |#2|))))) "failed") |#2| (|Kernel| |#2|) (|Kernel| |#2|) (|List| |#2|)) "\\spad{palglimint(f, x, y, [u1,...,un])} returns functions \\spad{[h,[[ci, ui]]]} such that the \\spad{ui}\\spad{'s} are among \\spad{[u1,...,un]} and \\spad{d(h + sum(ci log(ui)))/dx = f(x,y)} if such functions exist,{} \"failed\" otherwise; \\spad{y} is an algebraic function of \\spad{x}.")) (|palgextint| (((|Union| (|Record| (|:| |ratpart| |#2|) (|:| |coeff| |#2|)) "failed") |#2| (|Kernel| |#2|) (|Kernel| |#2|) |#2|) "\\spad{palgextint(f, x, y, g)} returns functions \\spad{[h, c]} such that \\spad{dh/dx = f(x,y) - c g},{} where \\spad{y} is an algebraic function of \\spad{x}; returns \"failed\" if no such functions exist.")) (|palgint| (((|IntegrationResult| |#2|) |#2| (|Kernel| |#2|) (|Kernel| |#2|)) "\\spad{palgint(f, x, y)} returns the integral of \\spad{f(x,y)dx} where \\spad{y} is an algebraic function of \\spad{x}."))) 
 NIL 
 ((|HasCategory| |#3| (LIST (QUOTE -678) (|devaluate| |#2|)))) 
-(-581 R -2174) 
+(-581 R -2173) 
 ((|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 -633) (LIST (QUOTE -917) (QUOTE (-578))))) (|HasCategory| |#1| (LIST (QUOTE -911) (QUOTE (-578)))) (|HasCategory| |#2| (QUOTE (-1170)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -633) (LIST (QUOTE -917) (QUOTE (-578))))) (|HasCategory| |#1| (LIST (QUOTE -911) (QUOTE (-578)))) (|HasCategory| |#2| (QUOTE (-648))))) 
-(-582 -2174 UP) 
+(-582 -2173 UP) 
 ((|constructor| (NIL "This package provides functions for the base case of the Risch algorithm.")) (|limitedint| (((|Union| (|Record| (|:| |mainpart| (|Fraction| |#2|)) (|:| |limitedlogs| (|List| (|Record| (|:| |coeff| (|Fraction| |#2|)) (|:| |logand| (|Fraction| |#2|)))))) "failed") (|Fraction| |#2|) (|List| (|Fraction| |#2|))) "\\spad{limitedint(f, [g1,...,gn])} returns fractions \\spad{[h,[[ci, gi]]]} such that the \\spad{gi}\\spad{'s} are among \\spad{[g1,...,gn]},{} \\spad{ci' = 0},{} and \\spad{(h+sum(ci log(gi)))' = f},{} if possible,{} \"failed\" otherwise.")) (|extendedint| (((|Union| (|Record| (|:| |ratpart| (|Fraction| |#2|)) (|:| |coeff| (|Fraction| |#2|))) "failed") (|Fraction| |#2|) (|Fraction| |#2|)) "\\spad{extendedint(f, g)} returns fractions \\spad{[h, c]} such that \\spad{c' = 0} and \\spad{h' = f - cg},{} if \\spad{(h, c)} exist,{} \"failed\" otherwise.")) (|infieldint| (((|Union| (|Fraction| |#2|) "failed") (|Fraction| |#2|)) "\\spad{infieldint(f)} returns \\spad{g} such that \\spad{g' = f} or \"failed\" if the integral of \\spad{f} is not a rational function.")) (|integrate| (((|IntegrationResult| (|Fraction| |#2|)) (|Fraction| |#2|)) "\\spad{integrate(f)} returns \\spad{g} such that \\spad{g' = f}."))) 
 NIL 
 NIL 
@@ -2264,7 +2264,7 @@ NIL
 ((|constructor| (NIL "Provides integer testing and retraction functions. Date Created: March 1990 Date Last Updated: 9 April 1991")) (|integerIfCan| (((|Union| (|Integer|) "failed") |#1|) "\\spad{integerIfCan(x)} returns \\spad{x} as an integer,{} \"failed\" if \\spad{x} is not an integer.")) (|integer?| (((|Boolean|) |#1|) "\\spad{integer?(x)} is \\spad{true} if \\spad{x} is an integer,{} \\spad{false} otherwise.")) (|integer| (((|Integer|) |#1|) "\\spad{integer(x)} returns \\spad{x} as an integer; error if \\spad{x} is not an integer."))) 
 NIL 
 NIL 
-(-584 -2174) 
+(-584 -2173) 
 ((|constructor| (NIL "This package provides functions for the integration of rational functions.")) (|extendedIntegrate| (((|Union| (|Record| (|:| |ratpart| (|Fraction| (|Polynomial| |#1|))) (|:| |coeff| (|Fraction| (|Polynomial| |#1|)))) "failed") (|Fraction| (|Polynomial| |#1|)) (|Symbol|) (|Fraction| (|Polynomial| |#1|))) "\\spad{extendedIntegrate(f, x, g)} returns fractions \\spad{[h, c]} such that \\spad{dc/dx = 0} and \\spad{dh/dx = f - cg},{} if \\spad{(h, c)} exist,{} \"failed\" otherwise.")) (|limitedIntegrate| (((|Union| (|Record| (|:| |mainpart| (|Fraction| (|Polynomial| |#1|))) (|:| |limitedlogs| (|List| (|Record| (|:| |coeff| (|Fraction| (|Polynomial| |#1|))) (|:| |logand| (|Fraction| (|Polynomial| |#1|))))))) "failed") (|Fraction| (|Polynomial| |#1|)) (|Symbol|) (|List| (|Fraction| (|Polynomial| |#1|)))) "\\spad{limitedIntegrate(f, x, [g1,...,gn])} returns fractions \\spad{[h, [[ci,gi]]]} such that the \\spad{gi}\\spad{'s} are among \\spad{[g1,...,gn]},{} \\spad{dci/dx = 0},{} and \\spad{d(h + sum(ci log(gi)))/dx = f} if possible,{} \"failed\" otherwise.")) (|infieldIntegrate| (((|Union| (|Fraction| (|Polynomial| |#1|)) "failed") (|Fraction| (|Polynomial| |#1|)) (|Symbol|)) "\\spad{infieldIntegrate(f, x)} returns a fraction \\spad{g} such that \\spad{dg/dx = f} if \\spad{g} exists,{} \"failed\" otherwise.")) (|internalIntegrate| (((|IntegrationResult| (|Fraction| (|Polynomial| |#1|))) (|Fraction| (|Polynomial| |#1|)) (|Symbol|)) "\\spad{internalIntegrate(f, x)} returns \\spad{g} such that \\spad{dg/dx = f}."))) 
 NIL 
 NIL 
@@ -2276,15 +2276,15 @@ NIL
 ((|constructor| (NIL "This package provides the implementation for the \\spadfun{solveLinearPolynomialEquation} operation over the integers. It uses a lifting technique from the package GenExEuclid")) (|solveLinearPolynomialEquation| (((|Union| (|List| (|SparseUnivariatePolynomial| (|Integer|))) "failed") (|List| (|SparseUnivariatePolynomial| (|Integer|))) (|SparseUnivariatePolynomial| (|Integer|))) "\\spad{solveLinearPolynomialEquation([f1, ..., fn], g)} (where the \\spad{fi} are relatively prime to each other) returns a list of \\spad{ai} such that \\spad{g/prod fi = sum ai/fi} or returns \"failed\" if no such list of \\spad{ai}\\spad{'s} exists."))) 
 NIL 
 NIL 
-(-587 R -2174) 
+(-587 R -2173) 
 ((|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 -633) (LIST (QUOTE -917) (QUOTE (-578))))) (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (LIST (QUOTE -911) (QUOTE (-578)))) (|HasCategory| |#2| (QUOTE (-296))) (|HasCategory| |#2| (QUOTE (-648))) (|HasCategory| |#2| (LIST (QUOTE -1069) (QUOTE (-1207))))) (-12 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#2| (QUOTE (-296)))) (|HasCategory| |#1| (QUOTE (-570)))) 
-(-588 -2174 UP) 
+(-588 -2173 UP) 
 ((|constructor| (NIL "This package provides functions for the transcendental case of the Risch algorithm.")) (|monomialIntPoly| (((|Record| (|:| |answer| |#2|) (|:| |polypart| |#2|)) |#2| (|Mapping| |#2| |#2|)) "\\spad{monomialIntPoly(p, ')} returns [\\spad{q},{} \\spad{r}] such that \\spad{p = q' + r} and \\spad{degree(r) < degree(t')}. Error if \\spad{degree(t') < 2}.")) (|monomialIntegrate| (((|Record| (|:| |ir| (|IntegrationResult| (|Fraction| |#2|))) (|:| |specpart| (|Fraction| |#2|)) (|:| |polypart| |#2|)) (|Fraction| |#2|) (|Mapping| |#2| |#2|)) "\\spad{monomialIntegrate(f, ')} returns \\spad{[ir, s, p]} such that \\spad{f = ir' + s + p} and all the squarefree factors of the denominator of \\spad{s} are special \\spad{w}.\\spad{r}.\\spad{t} the derivation '.")) (|expintfldpoly| (((|Union| (|LaurentPolynomial| |#1| |#2|) "failed") (|LaurentPolynomial| |#1| |#2|) (|Mapping| (|Record| (|:| |ans| |#1|) (|:| |right| |#1|) (|:| |sol?| (|Boolean|))) (|Integer|) |#1|)) "\\spad{expintfldpoly(p, foo)} returns \\spad{q} such that \\spad{p' = q} or \"failed\" if no such \\spad{q} exists. Argument foo is a Risch differential equation function on \\spad{F}.")) (|primintfldpoly| (((|Union| |#2| "failed") |#2| (|Mapping| (|Union| (|Record| (|:| |ratpart| |#1|) (|:| |coeff| |#1|)) "failed") |#1|) |#1|) "\\spad{primintfldpoly(p, ', t')} returns \\spad{q} such that \\spad{p' = q} or \"failed\" if no such \\spad{q} exists. Argument \\spad{t'} is the derivative of the primitive generating the extension.")) (|primlimintfrac| (((|Union| (|Record| (|:| |mainpart| (|Fraction| |#2|)) (|:| |limitedlogs| (|List| (|Record| (|:| |coeff| (|Fraction| |#2|)) (|:| |logand| (|Fraction| |#2|)))))) "failed") (|Fraction| |#2|) (|Mapping| |#2| |#2|) (|List| (|Fraction| |#2|))) "\\spad{primlimintfrac(f, ', [u1,...,un])} returns \\spad{[v, [c1,...,cn]]} such that \\spad{ci' = 0} and \\spad{f = v' + +/[ci * ui'/ui]}. Error: if \\spad{degree numer f >= degree denom f}.")) (|primextintfrac| (((|Union| (|Record| (|:| |ratpart| (|Fraction| |#2|)) (|:| |coeff| (|Fraction| |#2|))) "failed") (|Fraction| |#2|) (|Mapping| |#2| |#2|) (|Fraction| |#2|)) "\\spad{primextintfrac(f, ', g)} returns \\spad{[v, c]} such that \\spad{f = v' + c g} and \\spad{c' = 0}. Error: if \\spad{degree numer f >= degree denom f} or if \\spad{degree numer g >= degree denom g} or if \\spad{denom g} is not squarefree.")) (|explimitedint| (((|Union| (|Record| (|:| |answer| (|Record| (|:| |mainpart| (|Fraction| |#2|)) (|:| |limitedlogs| (|List| (|Record| (|:| |coeff| (|Fraction| |#2|)) (|:| |logand| (|Fraction| |#2|))))))) (|:| |a0| |#1|)) "failed") (|Fraction| |#2|) (|Mapping| |#2| |#2|) (|Mapping| (|Record| (|:| |ans| |#1|) (|:| |right| |#1|) (|:| |sol?| (|Boolean|))) (|Integer|) |#1|) (|List| (|Fraction| |#2|))) "\\spad{explimitedint(f, ', foo, [u1,...,un])} returns \\spad{[v, [c1,...,cn], a]} such that \\spad{ci' = 0},{} \\spad{f = v' + a + reduce(+,[ci * ui'/ui])},{} and \\spad{a = 0} or \\spad{a} has no integral in \\spad{F}. Returns \"failed\" if no such \\spad{v},{} \\spad{ci},{} a exist. Argument \\spad{foo} is a Risch differential equation function on \\spad{F}.")) (|primlimitedint| (((|Union| (|Record| (|:| |answer| (|Record| (|:| |mainpart| (|Fraction| |#2|)) (|:| |limitedlogs| (|List| (|Record| (|:| |coeff| (|Fraction| |#2|)) (|:| |logand| (|Fraction| |#2|))))))) (|:| |a0| |#1|)) "failed") (|Fraction| |#2|) (|Mapping| |#2| |#2|) (|Mapping| (|Union| (|Record| (|:| |ratpart| |#1|) (|:| |coeff| |#1|)) "failed") |#1|) (|List| (|Fraction| |#2|))) "\\spad{primlimitedint(f, ', foo, [u1,...,un])} returns \\spad{[v, [c1,...,cn], a]} such that \\spad{ci' = 0},{} \\spad{f = v' + a + reduce(+,[ci * ui'/ui])},{} and \\spad{a = 0} or \\spad{a} has no integral in UP. Returns \"failed\" if no such \\spad{v},{} \\spad{ci},{} a exist. Argument \\spad{foo} is an extended integration function on \\spad{F}.")) (|expextendedint| (((|Union| (|Record| (|:| |answer| (|Fraction| |#2|)) (|:| |a0| |#1|)) (|Record| (|:| |ratpart| (|Fraction| |#2|)) (|:| |coeff| (|Fraction| |#2|))) "failed") (|Fraction| |#2|) (|Mapping| |#2| |#2|) (|Mapping| (|Record| (|:| |ans| |#1|) (|:| |right| |#1|) (|:| |sol?| (|Boolean|))) (|Integer|) |#1|) (|Fraction| |#2|)) "\\spad{expextendedint(f, ', foo, g)} returns either \\spad{[v, c]} such that \\spad{f = v' + c g} and \\spad{c' = 0},{} or \\spad{[v, a]} such that \\spad{f = g' + a},{} and \\spad{a = 0} or \\spad{a} has no integral in \\spad{F}. Returns \"failed\" if neither case can hold. Argument \\spad{foo} is a Risch differential equation function on \\spad{F}.")) (|primextendedint| (((|Union| (|Record| (|:| |answer| (|Fraction| |#2|)) (|:| |a0| |#1|)) (|Record| (|:| |ratpart| (|Fraction| |#2|)) (|:| |coeff| (|Fraction| |#2|))) "failed") (|Fraction| |#2|) (|Mapping| |#2| |#2|) (|Mapping| (|Union| (|Record| (|:| |ratpart| |#1|) (|:| |coeff| |#1|)) "failed") |#1|) (|Fraction| |#2|)) "\\spad{primextendedint(f, ', foo, g)} returns either \\spad{[v, c]} such that \\spad{f = v' + c g} and \\spad{c' = 0},{} or \\spad{[v, a]} such that \\spad{f = g' + a},{} and \\spad{a = 0} or \\spad{a} has no integral in UP. Returns \"failed\" if neither case can hold. Argument \\spad{foo} is an extended integration function on \\spad{F}.")) (|tanintegrate| (((|Record| (|:| |answer| (|IntegrationResult| (|Fraction| |#2|))) (|:| |a0| |#1|)) (|Fraction| |#2|) (|Mapping| |#2| |#2|) (|Mapping| (|Union| (|List| |#1|) "failed") (|Integer|) |#1| |#1|)) "\\spad{tanintegrate(f, ', foo)} returns \\spad{[g, a]} such that \\spad{f = g' + a},{} and \\spad{a = 0} or \\spad{a} has no integral in \\spad{F}; Argument foo is a Risch differential system solver on \\spad{F}.")) (|expintegrate| (((|Record| (|:| |answer| (|IntegrationResult| (|Fraction| |#2|))) (|:| |a0| |#1|)) (|Fraction| |#2|) (|Mapping| |#2| |#2|) (|Mapping| (|Record| (|:| |ans| |#1|) (|:| |right| |#1|) (|:| |sol?| (|Boolean|))) (|Integer|) |#1|)) "\\spad{expintegrate(f, ', foo)} returns \\spad{[g, a]} such that \\spad{f = g' + a},{} and \\spad{a = 0} or \\spad{a} has no integral in \\spad{F}; Argument foo is a Risch differential equation solver on \\spad{F}.")) (|primintegrate| (((|Record| (|:| |answer| (|IntegrationResult| (|Fraction| |#2|))) (|:| |a0| |#1|)) (|Fraction| |#2|) (|Mapping| |#2| |#2|) (|Mapping| (|Union| (|Record| (|:| |ratpart| |#1|) (|:| |coeff| |#1|)) "failed") |#1|)) "\\spad{primintegrate(f, ', foo)} returns \\spad{[g, a]} such that \\spad{f = g' + a},{} and \\spad{a = 0} or \\spad{a} has no integral in UP. Argument foo is an extended integration function on \\spad{F}."))) 
 NIL 
 NIL 
-(-589 R -2174) 
+(-589 R -2173) 
 ((|constructor| (NIL "This package computes the inverse Laplace Transform.")) (|inverseLaplace| (((|Union| |#2| "failed") |#2| (|Symbol|) (|Symbol|)) "\\spad{inverseLaplace(f, s, t)} returns the Inverse Laplace transform of \\spad{f(s)} using \\spad{t} as the new variable or \"failed\" if unable to find a closed form."))) 
 NIL 
 NIL 
@@ -2316,11 +2316,11 @@ NIL
 ((|constructor| (NIL "A package to print strings without line-feed nor carriage-return.")) (|iprint| (((|Void|) (|String|)) "\\axiom{iprint(\\spad{s})} prints \\axiom{\\spad{s}} at the current position of the cursor."))) 
 NIL 
 NIL 
-(-597 R -2174) 
+(-597 R -2173) 
 ((|constructor| (NIL "This package allows a sum of logs over the roots of a polynomial to be expressed as explicit logarithms and arc tangents,{} provided that the indexing polynomial can be factored into quadratics.")) (|complexExpand| ((|#2| (|IntegrationResult| |#2|)) "\\spad{complexExpand(i)} returns the expanded complex function corresponding to \\spad{i}.")) (|expand| (((|List| |#2|) (|IntegrationResult| |#2|)) "\\spad{expand(i)} returns the list of possible real functions corresponding to \\spad{i}.")) (|split| (((|IntegrationResult| |#2|) (|IntegrationResult| |#2|)) "\\spad{split(u(x) + sum_{P(a)=0} Q(a,x))} returns \\spad{u(x) + sum_{P1(a)=0} Q(a,x) + ... + sum_{Pn(a)=0} Q(a,x)} where \\spad{P1},{}...,{}\\spad{Pn} are the factors of \\spad{P}."))) 
 NIL 
 NIL 
-(-598 E -2174) 
+(-598 E -2173) 
 ((|constructor| (NIL "\\indented{1}{Internally used by the integration packages} Author: Manuel Bronstein Date Created: 1987 Date Last Updated: 12 August 1992 Keywords: integration.")) (|map| (((|Union| (|Record| (|:| |mainpart| |#2|) (|:| |limitedlogs| (|List| (|Record| (|:| |coeff| |#2|) (|:| |logand| |#2|))))) "failed") (|Mapping| |#2| |#1|) (|Union| (|Record| (|:| |mainpart| |#1|) (|:| |limitedlogs| (|List| (|Record| (|:| |coeff| |#1|) (|:| |logand| |#1|))))) "failed")) "\\spad{map(f,ufe)} \\undocumented") (((|Union| |#2| "failed") (|Mapping| |#2| |#1|) (|Union| |#1| "failed")) "\\spad{map(f,ue)} \\undocumented") (((|Union| (|Record| (|:| |ratpart| |#2|) (|:| |coeff| |#2|)) "failed") (|Mapping| |#2| |#1|) (|Union| (|Record| (|:| |ratpart| |#1|) (|:| |coeff| |#1|)) "failed")) "\\spad{map(f,ure)} \\undocumented") (((|IntegrationResult| |#2|) (|Mapping| |#2| |#1|) (|IntegrationResult| |#1|)) "\\spad{map(f,ire)} \\undocumented"))) 
 NIL 
 NIL 
@@ -2328,7 +2328,7 @@ NIL
 ((|constructor| (NIL "This domain provides representations for the intermediate form data structure used by the Spad elaborator.")) (|irDef| (($ (|Identifier|) (|InternalTypeForm|) $) "\\spad{irDef(f,ts,e)} returns an IR representation for a definition of a function named \\spad{f},{} with signature \\spad{ts} and body \\spad{e}.")) (|irCtor| (($ (|Identifier|) (|InternalTypeForm|)) "\\spad{irCtor(n,t)} returns an IR for a constructor reference of type designated by the type form \\spad{t}")) (|irVar| (($ (|Identifier|) (|InternalTypeForm|)) "\\spad{irVar(x,t)} returns an IR for a variable reference of type designated by the type form \\spad{t}"))) 
 NIL 
 NIL 
-(-600 -2174) 
+(-600 -2173) 
 ((|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}."))) 
 ((-4502 . T) (-4501 . T)) 
 ((|HasCategory| |#1| (LIST (QUOTE -927) (QUOTE (-1207)))) (|HasCategory| |#1| (LIST (QUOTE -1069) (QUOTE (-1207))))) 
@@ -2367,7 +2367,7 @@ NIL
 (-609 |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}."))) 
 (((-4509 "*") |has| |#1| (-175)) (-4500 |has| |#1| (-570)) (-4501 . T) (-4502 . T) (-4504 . T)) 
-((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasCategory| |#1| (QUOTE (-570))) (-2225 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-570)))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (LIST (QUOTE -927) (QUOTE (-1207)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-578)) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-578)) (|devaluate| |#1|)))) (|HasCategory| (-578) (QUOTE (-1143))) (|HasCategory| |#1| (QUOTE (-376))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-578))))) (|HasSignature| |#1| (LIST (QUOTE -2863) (LIST (|devaluate| |#1|) (QUOTE (-1207)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-578)))))) 
+((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasCategory| |#1| (QUOTE (-570))) (-2225 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-570)))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (LIST (QUOTE -927) (QUOTE (-1207)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-578)) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-578)) (|devaluate| |#1|)))) (|HasCategory| (-578) (QUOTE (-1143))) (|HasCategory| |#1| (QUOTE (-376))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-578))))) (|HasSignature| |#1| (LIST (QUOTE -2864) (LIST (|devaluate| |#1|) (QUOTE (-1207)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-578)))))) 
 (-610 |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}.")) (|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.}"))) 
 (((-4509 "*") |has| |#1| (-570)) (-4500 |has| |#1| (-570)) (-4501 . T) (-4502 . T) (-4504 . T)) 
@@ -2384,7 +2384,7 @@ NIL
 ((|constructor| (NIL "Functions defined on streams with entries in two sets.")) (|map| (((|Stream| |#3|) (|Mapping| |#3| |#1| |#2|) (|InfiniteTuple| |#1|) (|Stream| |#2|)) "\\spad{map(f,a,b)} \\undocumented") (((|Stream| |#3|) (|Mapping| |#3| |#1| |#2|) (|Stream| |#1|) (|InfiniteTuple| |#2|)) "\\spad{map(f,a,b)} \\undocumented") (((|InfiniteTuple| |#3|) (|Mapping| |#3| |#1| |#2|) (|InfiniteTuple| |#1|) (|InfiniteTuple| |#2|)) "\\spad{map(f,a,b)} \\undocumented"))) 
 NIL 
 NIL 
-(-614 R -2174 FG) 
+(-614 R -2173 FG) 
 ((|constructor| (NIL "This package provides transformations from trigonometric functions to exponentials and logarithms,{} and back. \\spad{F} and \\spad{FG} should be the same type of function space.")) (|trigs2explogs| ((|#3| |#3| (|List| (|Kernel| |#3|)) (|List| (|Symbol|))) "\\spad{trigs2explogs(f, [k1,...,kn], [x1,...,xm])} rewrites all the trigonometric functions appearing in \\spad{f} and involving one of the \\spad{xi's} in terms of complex logarithms and exponentials. A kernel of the form \\spad{tan(u)} is expressed using \\spad{exp(u)**2} if it is one of the \\spad{ki's},{} in terms of \\spad{exp(2*u)} otherwise.")) (|explogs2trigs| (((|Complex| |#2|) |#3|) "\\spad{explogs2trigs(f)} rewrites all the complex logs and exponentials appearing in \\spad{f} in terms of trigonometric functions.")) (F2FG ((|#3| |#2|) "\\spad{F2FG(a + sqrt(-1) b)} returns \\spad{a + i b}.")) (FG2F ((|#2| |#3|) "\\spad{FG2F(a + i b)} returns \\spad{a + sqrt(-1) b}.")) (GF2FG ((|#3| (|Complex| |#2|)) "\\spad{GF2FG(a + i b)} returns \\spad{a + i b} viewed as a function with the \\spad{i} pushed down into the coefficient domain."))) 
 NIL 
 NIL 
@@ -2439,7 +2439,7 @@ NIL
 (-627 |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."))) 
 ((-4507 . T) (-4508 . T)) 
-((-12 (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2078 |#1|)) (QUOTE (-1131))) (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2078 |#1|)) (LIST (QUOTE -321) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2338) (QUOTE (-1189))) (LIST (QUOTE |:|) (QUOTE -2078) (|devaluate| |#1|)))))) (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2078 |#1|)) (LIST (QUOTE -633) (QUOTE (-550)))) (-12 (|HasCategory| |#1| (QUOTE (-1131))) (|HasCategory| |#1| (LIST (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1131))) (|HasCategory| (-1189) (QUOTE (-871))) (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2078 |#1|)) (QUOTE (-1131))) (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2078 |#1|)) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2078 |#1|)) (QUOTE (-102)))) 
+((-12 (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2079 |#1|)) (QUOTE (-1131))) (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2079 |#1|)) (LIST (QUOTE -321) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2338) (QUOTE (-1189))) (LIST (QUOTE |:|) (QUOTE -2079) (|devaluate| |#1|)))))) (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2079 |#1|)) (LIST (QUOTE -633) (QUOTE (-550)))) (-12 (|HasCategory| |#1| (QUOTE (-1131))) (|HasCategory| |#1| (LIST (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1131))) (|HasCategory| (-1189) (QUOTE (-871))) (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2079 |#1|)) (QUOTE (-1131))) (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2079 |#1|)) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2079 |#1|)) (QUOTE (-102)))) 
 (-628 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 
@@ -2464,7 +2464,7 @@ NIL
 ((|constructor| (NIL "A is convertible to \\spad{B} means any element of A can be converted into an element of \\spad{B},{} but not automatically by the interpreter.")) (|convert| ((|#1| $) "\\spad{convert(a)} transforms a into an element of \\spad{S}."))) 
 NIL 
 NIL 
-(-634 -2174 UP) 
+(-634 -2173 UP) 
 ((|constructor| (NIL "\\spadtype{Kovacic} provides a modified Kovacic\\spad{'s} algorithm for solving explicitely irreducible 2nd order linear ordinary differential equations.")) (|kovacic| (((|Union| (|SparseUnivariatePolynomial| (|Fraction| |#2|)) "failed") (|Fraction| |#2|) (|Fraction| |#2|) (|Fraction| |#2|) (|Mapping| (|Factored| |#2|) |#2|)) "\\spad{kovacic(a_0,a_1,a_2,ezfactor)} returns either \"failed\" or \\spad{P}(\\spad{u}) such that \\spad{\\$e^{\\int(-a_1/2a_2)} e^{\\int u}\\$} is a solution of \\indented{5}{\\spad{\\$a_2 y'' + a_1 y' + a0 y = 0\\$}} whenever \\spad{u} is a solution of \\spad{P u = 0}. The equation must be already irreducible over the rational functions. Argument \\spad{ezfactor} is a factorisation in \\spad{UP},{} not necessarily into irreducibles.") (((|Union| (|SparseUnivariatePolynomial| (|Fraction| |#2|)) "failed") (|Fraction| |#2|) (|Fraction| |#2|) (|Fraction| |#2|)) "\\spad{kovacic(a_0,a_1,a_2)} returns either \"failed\" or \\spad{P}(\\spad{u}) such that \\spad{\\$e^{\\int(-a_1/2a_2)} e^{\\int u}\\$} is a solution of \\indented{5}{\\spad{a_2 y'' + a_1 y' + a0 y = 0}} whenever \\spad{u} is a solution of \\spad{P u = 0}. The equation must be already irreducible over the rational functions."))) 
 NIL 
 NIL 
@@ -2492,7 +2492,7 @@ NIL
 ((|constructor| (NIL "LocalAlgebra produces the localization of an algebra,{} \\spadignore{i.e.} fractions whose numerators come from some \\spad{R} algebra.")) (|denom| ((|#3| $) "\\spad{denom x} returns the denominator of \\spad{x}.")) (|numer| ((|#1| $) "\\spad{numer x} returns the numerator of \\spad{x}.")) (/ (($ |#1| |#3|) "\\spad{a / d} divides the element \\spad{a} by \\spad{d}.") (($ $ |#3|) "\\spad{x / d} divides the element \\spad{x} by \\spad{d}."))) 
 ((-4501 . T) (-4502 . T) (-4504 . T)) 
 ((|HasCategory| |#1| (QUOTE (-870)))) 
-(-641 R -2174) 
+(-641 R -2173) 
 ((|constructor| (NIL "This package computes the forward Laplace Transform.")) (|laplace| ((|#2| |#2| (|Symbol|) (|Symbol|)) "\\spad{laplace(f, t, s)} returns the Laplace transform of \\spad{f(t)} using \\spad{s} as the new variable. This is \\spad{integral(exp(-s*t)*f(t), t = 0..\\%plusInfinity)}. Returns the formal object \\spad{laplace(f, t, s)} if it cannot compute the transform."))) 
 NIL 
 NIL 
@@ -2524,18 +2524,18 @@ NIL
 ((|constructor| (NIL "Category for the transcendental Liouvillian functions.")) (|erf| (($ $) "\\spad{erf(x)} returns the error function of \\spad{x},{} \\spadignore{i.e.} \\spad{2 / sqrt(\\%pi)} times the integral of \\spad{exp(-x**2) dx}.")) (|dilog| (($ $) "\\spad{dilog(x)} returns the dilogarithm of \\spad{x},{} \\spadignore{i.e.} the integral of \\spad{log(x) / (1 - x) dx}.")) (|li| (($ $) "\\spad{li(x)} returns the logarithmic integral of \\spad{x},{} \\spadignore{i.e.} the integral of \\spad{dx / log(x)}.")) (|Ci| (($ $) "\\spad{Ci(x)} returns the cosine integral of \\spad{x},{} \\spadignore{i.e.} the integral of \\spad{cos(x) / x dx}.")) (|Si| (($ $) "\\spad{Si(x)} returns the sine integral of \\spad{x},{} \\spadignore{i.e.} the integral of \\spad{sin(x) / x dx}.")) (|Ei| (($ $) "\\spad{Ei(x)} returns the exponential integral of \\spad{x},{} \\spadignore{i.e.} the integral of \\spad{exp(x)/x dx}."))) 
 NIL 
 NIL 
-(-649 R -2174) 
+(-649 R -2173) 
 ((|constructor| (NIL "This package provides liouvillian functions over an integral domain.")) (|integral| ((|#2| |#2| (|SegmentBinding| |#2|)) "\\spad{integral(f,x = a..b)} denotes the definite integral of \\spad{f} with respect to \\spad{x} from \\spad{a} to \\spad{b}.") ((|#2| |#2| (|Symbol|)) "\\spad{integral(f,x)} indefinite integral of \\spad{f} with respect to \\spad{x}.")) (|dilog| ((|#2| |#2|) "\\spad{dilog(f)} denotes the dilogarithm")) (|erf| ((|#2| |#2|) "\\spad{erf(f)} denotes the error function")) (|li| ((|#2| |#2|) "\\spad{li(f)} denotes the logarithmic integral")) (|Ci| ((|#2| |#2|) "\\spad{Ci(f)} denotes the cosine integral")) (|Si| ((|#2| |#2|) "\\spad{Si(f)} denotes the sine integral")) (|Ei| ((|#2| |#2|) "\\spad{Ei(f)} denotes the exponential integral")) (|operator| (((|BasicOperator|) (|BasicOperator|)) "\\spad{operator(op)} returns the Liouvillian operator based on \\spad{op}")) (|belong?| (((|Boolean|) (|BasicOperator|)) "\\spad{belong?(op)} checks if \\spad{op} is Liouvillian"))) 
 NIL 
 NIL 
-(-650 |lv| -2174) 
+(-650 |lv| -2173) 
 ((|constructor| (NIL "\\indented{1}{Given a Groebner basis \\spad{B} with respect to the total degree ordering for} a zero-dimensional ideal \\spad{I},{} compute a Groebner basis with respect to the lexicographical ordering by using linear algebra.")) (|transform| (((|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|) (|DistributedMultivariatePolynomial| |#1| |#2|)) "\\spad{transform }\\undocumented")) (|choosemon| (((|DistributedMultivariatePolynomial| |#1| |#2|) (|DistributedMultivariatePolynomial| |#1| |#2|) (|List| (|DistributedMultivariatePolynomial| |#1| |#2|))) "\\spad{choosemon }\\undocumented")) (|intcompBasis| (((|List| (|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|)) (|OrderedVariableList| |#1|) (|List| (|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|)) (|List| (|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|))) "\\spad{intcompBasis }\\undocumented")) (|anticoord| (((|DistributedMultivariatePolynomial| |#1| |#2|) (|List| |#2|) (|DistributedMultivariatePolynomial| |#1| |#2|) (|List| (|DistributedMultivariatePolynomial| |#1| |#2|))) "\\spad{anticoord }\\undocumented")) (|coord| (((|Vector| |#2|) (|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|) (|List| (|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|))) "\\spad{coord }\\undocumented")) (|computeBasis| (((|List| (|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|)) (|List| (|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|))) "\\spad{computeBasis }\\undocumented")) (|minPol| (((|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|) (|List| (|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|)) (|OrderedVariableList| |#1|)) "\\spad{minPol }\\undocumented") (((|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|) (|List| (|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|)) (|List| (|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|)) (|OrderedVariableList| |#1|)) "\\spad{minPol }\\undocumented")) (|totolex| (((|List| (|DistributedMultivariatePolynomial| |#1| |#2|)) (|List| (|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|))) "\\spad{totolex }\\undocumented")) (|groebgen| (((|Record| (|:| |glbase| (|List| (|DistributedMultivariatePolynomial| |#1| |#2|))) (|:| |glval| (|List| (|Integer|)))) (|List| (|DistributedMultivariatePolynomial| |#1| |#2|))) "\\spad{groebgen }\\undocumented")) (|linGenPos| (((|Record| (|:| |gblist| (|List| (|DistributedMultivariatePolynomial| |#1| |#2|))) (|:| |gvlist| (|List| (|Integer|)))) (|List| (|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|))) "\\spad{linGenPos }\\undocumented"))) 
 NIL 
 NIL 
 (-651) 
 ((|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}.")) (|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."))) 
 ((-4508 . T)) 
-((-12 (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2078 (-52))) (QUOTE (-1131))) (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2078 (-52))) (LIST (QUOTE -321) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2338) (QUOTE (-1189))) (LIST (QUOTE |:|) (QUOTE -2078) (QUOTE (-52))))))) (-2225 (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2078 (-52))) (QUOTE (-1131))) (|HasCategory| (-52) (QUOTE (-1131)))) (-2225 (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2078 (-52))) (QUOTE (-102))) (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2078 (-52))) (QUOTE (-1131))) (|HasCategory| (-52) (QUOTE (-102))) (|HasCategory| (-52) (QUOTE (-1131)))) (-2225 (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2078 (-52))) (QUOTE (-1131))) (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2078 (-52))) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-52) (QUOTE (-1131))) (|HasCategory| (-52) (LIST (QUOTE -632) (QUOTE (-886))))) (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2078 (-52))) (LIST (QUOTE -633) (QUOTE (-550)))) (-12 (|HasCategory| (-52) (QUOTE (-1131))) (|HasCategory| (-52) (LIST (QUOTE -321) (QUOTE (-52))))) (|HasCategory| (-1189) (QUOTE (-871))) (-2225 (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2078 (-52))) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-52) (LIST (QUOTE -632) (QUOTE (-886))))) (-2225 (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2078 (-52))) (QUOTE (-102))) (|HasCategory| (-52) (QUOTE (-102)))) (|HasCategory| (-52) (QUOTE (-1131))) (|HasCategory| (-52) (QUOTE (-102))) (|HasCategory| (-52) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2078 (-52))) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2078 (-52))) (QUOTE (-102))) (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2078 (-52))) (QUOTE (-1131)))) 
+((-12 (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2079 (-52))) (QUOTE (-1131))) (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2079 (-52))) (LIST (QUOTE -321) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2338) (QUOTE (-1189))) (LIST (QUOTE |:|) (QUOTE -2079) (QUOTE (-52))))))) (-2225 (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2079 (-52))) (QUOTE (-1131))) (|HasCategory| (-52) (QUOTE (-1131)))) (-2225 (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2079 (-52))) (QUOTE (-102))) (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2079 (-52))) (QUOTE (-1131))) (|HasCategory| (-52) (QUOTE (-102))) (|HasCategory| (-52) (QUOTE (-1131)))) (-2225 (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2079 (-52))) (QUOTE (-1131))) (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2079 (-52))) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-52) (QUOTE (-1131))) (|HasCategory| (-52) (LIST (QUOTE -632) (QUOTE (-886))))) (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2079 (-52))) (LIST (QUOTE -633) (QUOTE (-550)))) (-12 (|HasCategory| (-52) (QUOTE (-1131))) (|HasCategory| (-52) (LIST (QUOTE -321) (QUOTE (-52))))) (|HasCategory| (-1189) (QUOTE (-871))) (-2225 (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2079 (-52))) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-52) (LIST (QUOTE -632) (QUOTE (-886))))) (-2225 (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2079 (-52))) (QUOTE (-102))) (|HasCategory| (-52) (QUOTE (-102)))) (|HasCategory| (-52) (QUOTE (-1131))) (|HasCategory| (-52) (QUOTE (-102))) (|HasCategory| (-52) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2079 (-52))) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2079 (-52))) (QUOTE (-102))) (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2079 (-52))) (QUOTE (-1131)))) 
 (-652 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 
@@ -2624,7 +2624,7 @@ NIL
 ((|constructor| (NIL "A linear aggregate is an aggregate whose elements are indexed by integers. Examples of linear aggregates are strings,{} lists,{} and arrays. Most of the exported operations for linear aggregates are non-destructive but are not always efficient for a particular aggregate. For example,{} \\spadfun{concat} of two lists needs only to copy its first argument,{} whereas \\spadfun{concat} of two arrays needs to copy both arguments. Most of the operations exported here apply to infinite objects (\\spadignore{e.g.} streams) as well to finite ones. For finite linear aggregates,{} see \\spadtype{FiniteLinearAggregate}.")) (|setelt| ((|#1| $ (|UniversalSegment| (|Integer|)) |#1|) "\\spad{setelt(u,i..j,x)} (also written: \\axiom{\\spad{u}(\\spad{i}..\\spad{j}) \\spad{:=} \\spad{x}}) destructively replaces each element in the segment \\axiom{\\spad{u}(\\spad{i}..\\spad{j})} by \\spad{x}. The value \\spad{x} is returned. Note: \\spad{u} is destructively change so that \\axiom{\\spad{u}.\\spad{k} \\spad{:=} \\spad{x} for \\spad{k} in \\spad{i}..\\spad{j}}; its length remains unchanged.")) (|insert| (($ $ $ (|Integer|)) "\\spad{insert(v,u,k)} returns a copy of \\spad{u} having \\spad{v} inserted beginning at the \\axiom{\\spad{i}}th element. Note: \\axiom{insert(\\spad{v},{}\\spad{u},{}\\spad{k}) = concat( \\spad{u}(0..\\spad{k}-1),{} \\spad{v},{} \\spad{u}(\\spad{k}..) )}.") (($ |#1| $ (|Integer|)) "\\spad{insert(x,u,i)} returns a copy of \\spad{u} having \\spad{x} as its \\axiom{\\spad{i}}th element. Note: \\axiom{insert(\\spad{x},{}a,{}\\spad{k}) = concat(concat(a(0..\\spad{k}-1),{}\\spad{x}),{}a(\\spad{k}..))}.")) (|delete| (($ $ (|UniversalSegment| (|Integer|))) "\\spad{delete(u,i..j)} returns a copy of \\spad{u} with the \\axiom{\\spad{i}}th through \\axiom{\\spad{j}}th element deleted. Note: \\axiom{delete(a,{}\\spad{i}..\\spad{j}) = concat(a(0..\\spad{i}-1),{}a(\\spad{j+1}..))}.") (($ $ (|Integer|)) "\\spad{delete(u,i)} returns a copy of \\spad{u} with the \\axiom{\\spad{i}}th element deleted. Note: for lists,{} \\axiom{delete(a,{}\\spad{i}) \\spad{==} concat(a(0..\\spad{i} - 1),{}a(\\spad{i} + 1,{}..))}.")) (|map| (($ (|Mapping| |#1| |#1| |#1|) $ $) "\\spad{map(f,u,v)} returns a new collection \\spad{w} with elements \\axiom{\\spad{z} = \\spad{f}(\\spad{x},{}\\spad{y})} for corresponding elements \\spad{x} and \\spad{y} from \\spad{u} and \\spad{v}. Note: for linear aggregates,{} \\axiom{\\spad{w}.\\spad{i} = \\spad{f}(\\spad{u}.\\spad{i},{}\\spad{v}.\\spad{i})}.")) (|concat| (($ (|List| $)) "\\spad{concat(u)},{} where \\spad{u} is a lists of aggregates \\axiom{[a,{}\\spad{b},{}...,{}\\spad{c}]},{} returns a single aggregate consisting of the elements of \\axiom{a} followed by those of \\spad{b} followed ... by the elements of \\spad{c}. Note: \\axiom{concat(a,{}\\spad{b},{}...,{}\\spad{c}) = concat(a,{}concat(\\spad{b},{}...,{}\\spad{c}))}.") (($ $ $) "\\spad{concat(u,v)} returns an aggregate consisting of the elements of \\spad{u} followed by the elements of \\spad{v}. Note: if \\axiom{\\spad{w} = concat(\\spad{u},{}\\spad{v})} then \\axiom{\\spad{w}.\\spad{i} = \\spad{u}.\\spad{i} for \\spad{i} in indices \\spad{u}} and \\axiom{\\spad{w}.(\\spad{j} + maxIndex \\spad{u}) = \\spad{v}.\\spad{j} for \\spad{j} in indices \\spad{v}}.") (($ |#1| $) "\\spad{concat(x,u)} returns aggregate \\spad{u} with additional element at the front. Note: for lists: \\axiom{concat(\\spad{x},{}\\spad{u}) \\spad{==} concat([\\spad{x}],{}\\spad{u})}.") (($ $ |#1|) "\\spad{concat(u,x)} returns aggregate \\spad{u} with additional element \\spad{x} at the end. Note: for lists,{} \\axiom{concat(\\spad{u},{}\\spad{x}) \\spad{==} concat(\\spad{u},{}[\\spad{x}])}")) (|new| (($ (|NonNegativeInteger|) |#1|) "\\spad{new(n,x)} returns \\axiom{fill!(new \\spad{n},{}\\spad{x})}."))) 
 NIL 
 NIL 
-(-674 R -2174 L) 
+(-674 R -2173 L) 
 ((|constructor| (NIL "\\spad{ElementaryFunctionLODESolver} provides the top-level functions for finding closed form solutions of linear ordinary differential equations and initial value problems.")) (|solve| (((|Union| |#2| "failed") |#3| |#2| (|Symbol|) |#2| (|List| |#2|)) "\\spad{solve(op, g, x, a, [y0,...,ym])} returns either the solution of the initial value problem \\spad{op y = g, y(a) = y0, y'(a) = y1,...} or \"failed\" if the solution cannot be found; \\spad{x} is the dependent variable.") (((|Union| (|Record| (|:| |particular| |#2|) (|:| |basis| (|List| |#2|))) "failed") |#3| |#2| (|Symbol|)) "\\spad{solve(op, g, x)} returns either a solution of the ordinary differential equation \\spad{op y = g} or \"failed\" if no non-trivial solution can be found; When found,{} the solution is returned in the form \\spad{[h, [b1,...,bm]]} where \\spad{h} is a particular solution and and \\spad{[b1,...bm]} are linearly independent solutions of the associated homogenuous equation \\spad{op y = 0}. A full basis for the solutions of the homogenuous equation is not always returned,{} only the solutions which were found; \\spad{x} is the dependent variable."))) 
 NIL 
 NIL 
@@ -2644,11 +2644,11 @@ NIL
 ((|constructor| (NIL "\\spad{LinearOrdinaryDifferentialOperatorCategory} is the category of differential operators with coefficients in a ring A with a given derivation. Multiplication of operators corresponds to functional composition: \\indented{4}{\\spad{(L1 * L2).(f) = L1 L2 f}}")) (|directSum| (($ $ $) "\\spad{directSum(a,b)} computes an operator \\spad{c} of minimal order such that the nullspace of \\spad{c} is generated by all the sums of a solution of \\spad{a} by a solution of \\spad{b}.")) (|symmetricSquare| (($ $) "\\spad{symmetricSquare(a)} computes \\spad{symmetricProduct(a,a)} using a more efficient method.")) (|symmetricPower| (($ $ (|NonNegativeInteger|)) "\\spad{symmetricPower(a,n)} computes an operator \\spad{c} of minimal order such that the nullspace of \\spad{c} is generated by all the products of \\spad{n} solutions of \\spad{a}.")) (|symmetricProduct| (($ $ $) "\\spad{symmetricProduct(a,b)} computes an operator \\spad{c} of minimal order such that the nullspace of \\spad{c} is generated by all the products of a solution of \\spad{a} by a solution of \\spad{b}.")) (|adjoint| (($ $) "\\spad{adjoint(a)} returns the adjoint operator of a.")) (D (($) "\\spad{D()} provides the operator corresponding to a derivation in the ring \\spad{A}."))) 
 ((-4501 . T) (-4502 . T) (-4504 . T)) 
 NIL 
-(-679 -2174 UP) 
+(-679 -2173 UP) 
 ((|constructor| (NIL "\\spadtype{LinearOrdinaryDifferentialOperatorFactorizer} provides a factorizer for linear ordinary differential operators whose coefficients are rational functions.")) (|factor1| (((|List| (|LinearOrdinaryDifferentialOperator1| (|Fraction| |#2|))) (|LinearOrdinaryDifferentialOperator1| (|Fraction| |#2|))) "\\spad{factor1(a)} returns the factorisation of a,{} assuming that a has no first-order right factor.")) (|factor| (((|List| (|LinearOrdinaryDifferentialOperator1| (|Fraction| |#2|))) (|LinearOrdinaryDifferentialOperator1| (|Fraction| |#2|))) "\\spad{factor(a)} returns the factorisation of a.") (((|List| (|LinearOrdinaryDifferentialOperator1| (|Fraction| |#2|))) (|LinearOrdinaryDifferentialOperator1| (|Fraction| |#2|)) (|Mapping| (|List| |#1|) |#2|)) "\\spad{factor(a, zeros)} returns the factorisation of a. \\spad{zeros} is a zero finder in \\spad{UP}."))) 
 NIL 
 ((|HasCategory| |#1| (QUOTE (-27)))) 
-(-680 A -3370) 
+(-680 A -4019) 
 ((|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}}"))) 
 ((-4501 . T) (-4502 . T) (-4504 . T)) 
 ((|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (LIST (QUOTE -1069) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasCategory| |#1| (LIST (QUOTE -1069) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-570))) (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-376)))) 
@@ -2684,11 +2684,11 @@ NIL
 ((|constructor| (NIL "A list aggregate is a model for a linked list data structure. A linked list is a versatile data structure. Insertion and deletion are efficient and searching is a linear operation.")) (|list| (($ |#1|) "\\spad{list(x)} returns the list of one element \\spad{x}."))) 
 ((-4508 . T) (-4507 . T)) 
 NIL 
-(-689 -2174) 
+(-689 -2173) 
 ((|constructor| (NIL "This package solves linear system in the matrix form \\spad{AX = B}. It is essentially a particular instantiation of the package \\spadtype{LinearSystemMatrixPackage} for Matrix and Vector. This package\\spad{'s} existence makes it easier to use \\spadfun{solve} in the AXIOM interpreter.")) (|rank| (((|NonNegativeInteger|) (|Matrix| |#1|) (|Vector| |#1|)) "\\spad{rank(A,B)} computes the rank of the complete matrix \\spad{(A|B)} of the linear system \\spad{AX = B}.")) (|hasSolution?| (((|Boolean|) (|Matrix| |#1|) (|Vector| |#1|)) "\\spad{hasSolution?(A,B)} tests if the linear system \\spad{AX = B} has a solution.")) (|particularSolution| (((|Union| (|Vector| |#1|) "failed") (|Matrix| |#1|) (|Vector| |#1|)) "\\spad{particularSolution(A,B)} finds a particular solution of the linear system \\spad{AX = B}.")) (|solve| (((|List| (|Record| (|:| |particular| (|Union| (|Vector| |#1|) "failed")) (|:| |basis| (|List| (|Vector| |#1|))))) (|List| (|List| |#1|)) (|List| (|Vector| |#1|))) "\\spad{solve(A,LB)} finds a particular soln of the systems \\spad{AX = B} and a basis of the associated homogeneous systems \\spad{AX = 0} where \\spad{B} varies in the list of column vectors \\spad{LB}.") (((|List| (|Record| (|:| |particular| (|Union| (|Vector| |#1|) "failed")) (|:| |basis| (|List| (|Vector| |#1|))))) (|Matrix| |#1|) (|List| (|Vector| |#1|))) "\\spad{solve(A,LB)} finds a particular soln of the systems \\spad{AX = B} and a basis of the associated homogeneous systems \\spad{AX = 0} where \\spad{B} varies in the list of column vectors \\spad{LB}.") (((|Record| (|:| |particular| (|Union| (|Vector| |#1|) "failed")) (|:| |basis| (|List| (|Vector| |#1|)))) (|List| (|List| |#1|)) (|Vector| |#1|)) "\\spad{solve(A,B)} finds a particular solution of the system \\spad{AX = B} and a basis of the associated homogeneous system \\spad{AX = 0}.") (((|Record| (|:| |particular| (|Union| (|Vector| |#1|) "failed")) (|:| |basis| (|List| (|Vector| |#1|)))) (|Matrix| |#1|) (|Vector| |#1|)) "\\spad{solve(A,B)} finds a particular solution of the system \\spad{AX = B} and a basis of the associated homogeneous system \\spad{AX = 0}."))) 
 NIL 
 NIL 
-(-690 -2174 |Row| |Col| M) 
+(-690 -2173 |Row| |Col| M) 
 ((|constructor| (NIL "This package solves linear system in the matrix form \\spad{AX = B}.")) (|rank| (((|NonNegativeInteger|) |#4| |#3|) "\\spad{rank(A,B)} computes the rank of the complete matrix \\spad{(A|B)} of the linear system \\spad{AX = B}.")) (|hasSolution?| (((|Boolean|) |#4| |#3|) "\\spad{hasSolution?(A,B)} tests if the linear system \\spad{AX = B} has a solution.")) (|particularSolution| (((|Union| |#3| "failed") |#4| |#3|) "\\spad{particularSolution(A,B)} finds a particular solution of the linear system \\spad{AX = B}.")) (|solve| (((|List| (|Record| (|:| |particular| (|Union| |#3| "failed")) (|:| |basis| (|List| |#3|)))) |#4| (|List| |#3|)) "\\spad{solve(A,LB)} finds a particular soln of the systems \\spad{AX = B} and a basis of the associated homogeneous systems \\spad{AX = 0} where \\spad{B} varies in the list of column vectors \\spad{LB}.") (((|Record| (|:| |particular| (|Union| |#3| "failed")) (|:| |basis| (|List| |#3|))) |#4| |#3|) "\\spad{solve(A,B)} finds a particular solution of the system \\spad{AX = B} and a basis of the associated homogeneous system \\spad{AX = 0}."))) 
 NIL 
 NIL 
@@ -2784,7 +2784,7 @@ NIL
 ((|constructor| (NIL "This domain implements the notion of optional value,{} where a computation may fail to produce expected value.")) (|nothing| (($) "\\spad{nothing} represents failure or absence of value.")) (|autoCoerce| ((|#1| $) "\\spad{autoCoerce} is a courtesy coercion function used by the compiler in case it knows that \\spad{`x'} really is a \\spadtype{T}.")) (|case| (((|Boolean|) $ (|[\|\|]| |nothing|)) "\\spad{x case nothing} holds if the value for \\spad{x} is missing.") (((|Boolean|) $ (|[\|\|]| |#1|)) "\\spad{x case T} returns \\spad{true} if \\spad{x} is actually a data of type \\spad{T}.")) (|just| (($ |#1|) "\\spad{just x} injects the value \\spad{`x'} into \\%."))) 
 NIL 
 NIL 
-(-714 S -2174 FLAF FLAS) 
+(-714 S -2173 FLAF FLAS) 
 ((|constructor| (NIL "\\indented{1}{\\spadtype{MultiVariableCalculusFunctions} Package provides several} \\indented{1}{functions for multivariable calculus.} These include gradient,{} hessian and jacobian,{} divergence and laplacian. Various forms for banded and sparse storage of matrices are included.")) (|bandedJacobian| (((|Matrix| |#2|) |#3| |#4| (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{bandedJacobian(vf,xlist,kl,ku)} computes the jacobian,{} the matrix of first partial derivatives,{} of the vector field \\spad{vf},{} \\spad{vf} a vector function of the variables listed in \\spad{xlist},{} \\spad{kl} is the number of nonzero subdiagonals,{} \\spad{ku} is the number of nonzero superdiagonals,{} kl+ku+1 being actual bandwidth. Stores the nonzero band in a matrix,{} dimensions kl+ku+1 by \\#xlist. The upper triangle is in the top \\spad{ku} rows,{} the diagonal is in row ku+1,{} the lower triangle in the last \\spad{kl} rows. Entries in a column in the band store correspond to entries in same column of full store. (The notation conforms to LAPACK/NAG-\\spad{F07} conventions.)")) (|jacobian| (((|Matrix| |#2|) |#3| |#4|) "\\spad{jacobian(vf,xlist)} computes the jacobian,{} the matrix of first partial derivatives,{} of the vector field \\spad{vf},{} \\spad{vf} a vector function of the variables listed in \\spad{xlist}.")) (|bandedHessian| (((|Matrix| |#2|) |#2| |#4| (|NonNegativeInteger|)) "\\spad{bandedHessian(v,xlist,k)} computes the hessian,{} the matrix of second partial derivatives,{} of the scalar field \\spad{v},{} \\spad{v} a function of the variables listed in \\spad{xlist},{} \\spad{k} is the semi-bandwidth,{} the number of nonzero subdiagonals,{} 2*k+1 being actual bandwidth. Stores the nonzero band in lower triangle in a matrix,{} dimensions \\spad{k+1} by \\#xlist,{} whose rows are the vectors formed by diagonal,{} subdiagonal,{} etc. of the real,{} full-matrix,{} hessian. (The notation conforms to LAPACK/NAG-\\spad{F07} conventions.)")) (|hessian| (((|Matrix| |#2|) |#2| |#4|) "\\spad{hessian(v,xlist)} computes the hessian,{} the matrix of second partial derivatives,{} of the scalar field \\spad{v},{} \\spad{v} a function of the variables listed in \\spad{xlist}.")) (|laplacian| ((|#2| |#2| |#4|) "\\spad{laplacian(v,xlist)} computes the laplacian of the scalar field \\spad{v},{} \\spad{v} a function of the variables listed in \\spad{xlist}.")) (|divergence| ((|#2| |#3| |#4|) "\\spad{divergence(vf,xlist)} computes the divergence of the vector field \\spad{vf},{} \\spad{vf} a vector function of the variables listed in \\spad{xlist}.")) (|gradient| (((|Vector| |#2|) |#2| |#4|) "\\spad{gradient(v,xlist)} computes the gradient,{} the vector of first partial derivatives,{} of the scalar field \\spad{v},{} \\spad{v} a function of the variables listed in \\spad{xlist}."))) 
 NIL 
 NIL 
@@ -2808,7 +2808,7 @@ NIL
 ((|constructor| (NIL "\\indented{1}{<description of package>} Author: Jim Wen Date Created: \\spad{??} Date Last Updated: October 1991 by Jon Steinbach Keywords: Examples: References:")) (|ptFunc| (((|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|))) "\\spad{ptFunc(a,b,c,d)} is an internal function exported in order to compile packages.")) (|meshPar1Var| (((|ThreeSpace| (|DoubleFloat|)) (|Expression| (|Integer|)) (|Expression| (|Integer|)) (|Expression| (|Integer|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|List| (|DrawOption|))) "\\spad{meshPar1Var(s,t,u,f,s1,l)} \\undocumented")) (|meshFun2Var| (((|ThreeSpace| (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) (|Union| (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) "undefined") (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|List| (|DrawOption|))) "\\spad{meshFun2Var(f,g,s1,s2,l)} \\undocumented")) (|meshPar2Var| (((|ThreeSpace| (|DoubleFloat|)) (|ThreeSpace| (|DoubleFloat|)) (|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|List| (|DrawOption|))) "\\spad{meshPar2Var(sp,f,s1,s2,l)} \\undocumented") (((|ThreeSpace| (|DoubleFloat|)) (|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|List| (|DrawOption|))) "\\spad{meshPar2Var(f,s1,s2,l)} \\undocumented") (((|ThreeSpace| (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) (|Union| (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) "undefined") (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|List| (|DrawOption|))) "\\spad{meshPar2Var(f,g,h,j,s1,s2,l)} \\undocumented"))) 
 NIL 
 NIL 
-(-720 OV E -2174 PG) 
+(-720 OV E -2173 PG) 
 ((|constructor| (NIL "Package for factorization of multivariate polynomials over finite fields.")) (|factor| (((|Factored| (|SparseUnivariatePolynomial| |#4|)) (|SparseUnivariatePolynomial| |#4|)) "\\spad{factor(p)} produces the complete factorization of the multivariate polynomial \\spad{p} over a finite field. \\spad{p} is represented as a univariate polynomial with multivariate coefficients over a finite field.") (((|Factored| |#4|) |#4|) "\\spad{factor(p)} produces the complete factorization of the multivariate polynomial \\spad{p} over a finite field."))) 
 NIL 
 NIL 
@@ -2860,7 +2860,7 @@ NIL
 ((|constructor| (NIL "\\spadtype{MathMLFormat} provides a coercion from \\spadtype{OutputForm} to MathML format.")) (|display| (((|Void|) (|String|)) "prints the string returned by coerce,{} adding <math ...> tags.")) (|exprex| (((|String|) (|OutputForm|)) "coverts \\spadtype{OutputForm} to \\spadtype{String} with the structure preserved with braces. Actually this is not quite accurate. The function \\spadfun{precondition} is first applied to the \\spadtype{OutputForm} expression before \\spadfun{exprex}. The raw \\spadtype{OutputForm} and the nature of the \\spadfun{precondition} function is still obscure to me at the time of this writing (2007-02-14).")) (|coerceL| (((|String|) (|OutputForm|)) "coerceS(\\spad{o}) changes \\spad{o} in the standard output format to MathML format and displays result as one long string.")) (|coerceS| (((|String|) (|OutputForm|)) "\\spad{coerceS(o)} changes \\spad{o} in the standard output format to MathML format and displays formatted result.")) (|coerce| (((|String|) (|OutputForm|)) "coerceS(\\spad{o}) changes \\spad{o} in the standard output format to MathML format."))) 
 NIL 
 NIL 
-(-733 R |Mod| -1606 -3949 |exactQuo|) 
+(-733 R |Mod| -3674 -1695 |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"))) 
 ((-4499 . T) (-4505 . T) (-4500 . T) ((-4509 "*") . T) (-4501 . T) (-4502 . T) (-4504 . T)) 
 NIL 
@@ -2876,7 +2876,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}."))) 
 ((-4502 |has| |#1| (-175)) (-4501 |has| |#1| (-175)) (-4504 . T)) 
 ((|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149)))) 
-(-737 R |Mod| -1606 -3949 |exactQuo|) 
+(-737 R |Mod| -3674 -1695 |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"))) 
 ((-4504 . T)) 
 NIL 
@@ -2888,7 +2888,7 @@ NIL
 ((|constructor| (NIL "The category of modules over a commutative ring. \\blankline"))) 
 ((-4502 . T) (-4501 . T)) 
 NIL 
-(-740 -2174) 
+(-740 -2173) 
 ((|constructor| (NIL "\\indented{1}{MoebiusTransform(\\spad{F}) is the domain of fractional linear (Moebius)} transformations over \\spad{F}.")) (|eval| (((|OnePointCompletion| |#1|) $ (|OnePointCompletion| |#1|)) "\\spad{eval(m,x)} returns \\spad{(a*x + b)/(c*x + d)} where \\spad{m = moebius(a,b,c,d)} (see \\spadfunFrom{moebius}{MoebiusTransform}).") ((|#1| $ |#1|) "\\spad{eval(m,x)} returns \\spad{(a*x + b)/(c*x + d)} where \\spad{m = moebius(a,b,c,d)} (see \\spadfunFrom{moebius}{MoebiusTransform}).")) (|recip| (($ $) "\\spad{recip(m)} = recip() * \\spad{m}") (($) "\\spad{recip()} returns \\spad{matrix [[0,1],[1,0]]} representing the map \\spad{x -> 1 / x}.")) (|scale| (($ $ |#1|) "\\spad{scale(m,h)} returns \\spad{scale(h) * m} (see \\spadfunFrom{shift}{MoebiusTransform}).") (($ |#1|) "\\spad{scale(k)} returns \\spad{matrix [[k,0],[0,1]]} representing the map \\spad{x -> k * x}.")) (|shift| (($ $ |#1|) "\\spad{shift(m,h)} returns \\spad{shift(h) * m} (see \\spadfunFrom{shift}{MoebiusTransform}).") (($ |#1|) "\\spad{shift(k)} returns \\spad{matrix [[1,k],[0,1]]} representing the map \\spad{x -> x + k}.")) (|moebius| (($ |#1| |#1| |#1| |#1|) "\\spad{moebius(a,b,c,d)} returns \\spad{matrix [[a,b],[c,d]]}."))) 
 ((-4504 . T)) 
 NIL 
@@ -2924,7 +2924,7 @@ NIL
 ((|constructor| (NIL "The class of multiplicative monoids,{} \\spadignore{i.e.} semigroups with a multiplicative identity element. \\blankline")) (|recip| (((|Union| $ "failed") $) "\\spad{recip(x)} tries to compute the multiplicative inverse for \\spad{x} or \"failed\" if it cannot find the inverse (see unitsKnown).")) (** (($ $ (|NonNegativeInteger|)) "\\spad{x**n} returns the repeated product of \\spad{x} \\spad{n} times,{} \\spadignore{i.e.} exponentiation.")) (|one?| (((|Boolean|) $) "\\spad{one?(x)} tests if \\spad{x} is equal to 1.")) (|sample| (($) "\\spad{sample yields} a value of type \\%")) ((|One|) (($) "1 is the multiplicative identity."))) 
 NIL 
 NIL 
-(-749 -2174 UP) 
+(-749 -2173 UP) 
 ((|constructor| (NIL "Tools for handling monomial extensions.")) (|decompose| (((|Record| (|:| |poly| |#2|) (|:| |normal| (|Fraction| |#2|)) (|:| |special| (|Fraction| |#2|))) (|Fraction| |#2|) (|Mapping| |#2| |#2|)) "\\spad{decompose(f, D)} returns \\spad{[p,n,s]} such that \\spad{f = p+n+s},{} all the squarefree factors of \\spad{denom(n)} are normal \\spad{w}.\\spad{r}.\\spad{t}. \\spad{D},{} \\spad{denom(s)} is special \\spad{w}.\\spad{r}.\\spad{t}. \\spad{D},{} and \\spad{n} and \\spad{s} are proper fractions (no pole at infinity). \\spad{D} is the derivation to use.")) (|normalDenom| ((|#2| (|Fraction| |#2|) (|Mapping| |#2| |#2|)) "\\spad{normalDenom(f, D)} returns the product of all the normal factors of \\spad{denom(f)}. \\spad{D} is the derivation to use.")) (|splitSquarefree| (((|Record| (|:| |normal| (|Factored| |#2|)) (|:| |special| (|Factored| |#2|))) |#2| (|Mapping| |#2| |#2|)) "\\spad{splitSquarefree(p, D)} returns \\spad{[n_1 n_2\\^2 ... n_m\\^m, s_1 s_2\\^2 ... s_q\\^q]} such that \\spad{p = n_1 n_2\\^2 ... n_m\\^m s_1 s_2\\^2 ... s_q\\^q},{} each \\spad{n_i} is normal \\spad{w}.\\spad{r}.\\spad{t}. \\spad{D} and each \\spad{s_i} is special \\spad{w}.\\spad{r}.\\spad{t} \\spad{D}. \\spad{D} is the derivation to use.")) (|split| (((|Record| (|:| |normal| |#2|) (|:| |special| |#2|)) |#2| (|Mapping| |#2| |#2|)) "\\spad{split(p, D)} returns \\spad{[n,s]} such that \\spad{p = n s},{} all the squarefree factors of \\spad{n} are normal \\spad{w}.\\spad{r}.\\spad{t}. \\spad{D},{} and \\spad{s} is special \\spad{w}.\\spad{r}.\\spad{t}. \\spad{D}. \\spad{D} is the derivation to use."))) 
 NIL 
 NIL 
@@ -3076,11 +3076,11 @@ NIL
 ((|constructor| (NIL "This package computes explicitly eigenvalues and eigenvectors of matrices with entries over the complex rational numbers. The results are expressed either as complex floating numbers or as complex rational numbers depending on the type of the precision parameter.")) (|complexEigenvectors| (((|List| (|Record| (|:| |outval| (|Complex| |#1|)) (|:| |outmult| (|Integer|)) (|:| |outvect| (|List| (|Matrix| (|Complex| |#1|)))))) (|Matrix| (|Complex| (|Fraction| (|Integer|)))) |#1|) "\\spad{complexEigenvectors(m,eps)} returns a list of records each one containing a complex eigenvalue,{} its algebraic multiplicity,{} and a list of associated eigenvectors. All these results are computed to precision \\spad{eps} and are expressed as complex floats or complex rational numbers depending on the type of \\spad{eps} (float or rational).")) (|complexEigenvalues| (((|List| (|Complex| |#1|)) (|Matrix| (|Complex| (|Fraction| (|Integer|)))) |#1|) "\\spad{complexEigenvalues(m,eps)} computes the eigenvalues of the matrix \\spad{m} to precision \\spad{eps}. The eigenvalues are expressed as complex floats or complex rational numbers depending on the type of \\spad{eps} (float or rational).")) (|characteristicPolynomial| (((|Polynomial| (|Complex| (|Fraction| (|Integer|)))) (|Matrix| (|Complex| (|Fraction| (|Integer|)))) (|Symbol|)) "\\spad{characteristicPolynomial(m,x)} returns the characteristic polynomial of the matrix \\spad{m} expressed as polynomial over Complex Rationals with variable \\spad{x}.") (((|Polynomial| (|Complex| (|Fraction| (|Integer|)))) (|Matrix| (|Complex| (|Fraction| (|Integer|))))) "\\spad{characteristicPolynomial(m)} returns the characteristic polynomial of the matrix \\spad{m} expressed as polynomial over complex rationals with a new symbol as variable."))) 
 NIL 
 NIL 
-(-787 -2174) 
+(-787 -2173) 
 ((|constructor| (NIL "\\spadtype{NumericContinuedFraction} provides functions \\indented{2}{for converting floating point numbers to continued fractions.}")) (|continuedFraction| (((|ContinuedFraction| (|Integer|)) |#1|) "\\spad{continuedFraction(f)} converts the floating point number \\spad{f} to a reduced continued fraction."))) 
 NIL 
 NIL 
-(-788 P -2174) 
+(-788 P -2173) 
 ((|constructor| (NIL "This package provides a division and related operations for \\spadtype{MonogenicLinearOperator}\\spad{s} over a \\spadtype{Field}. Since the multiplication is in general non-commutative,{} these operations all have left- and right-hand versions. This package provides the operations based on left-division.")) (|leftLcm| ((|#1| |#1| |#1|) "\\spad{leftLcm(a,b)} computes the value \\spad{m} of lowest degree such that \\spad{m = a*aa = b*bb} for some values \\spad{aa} and \\spad{bb}. The value \\spad{m} is computed using left-division.")) (|leftGcd| ((|#1| |#1| |#1|) "\\spad{leftGcd(a,b)} computes the value \\spad{g} of highest degree such that \\indented{3}{\\spad{a = aa*g}} \\indented{3}{\\spad{b = bb*g}} for some values \\spad{aa} and \\spad{bb}. The value \\spad{g} is computed using left-division.")) (|leftExactQuotient| (((|Union| |#1| "failed") |#1| |#1|) "\\spad{leftExactQuotient(a,b)} computes the value \\spad{q},{} if it exists,{} \\indented{1}{such that \\spad{a = b*q}.}")) (|leftRemainder| ((|#1| |#1| |#1|) "\\spad{leftRemainder(a,b)} computes the pair \\spad{[q,r]} such that \\spad{a = b*q + r} and the degree of \\spad{r} is less than the degree of \\spad{b}. The value \\spad{r} is returned.")) (|leftQuotient| ((|#1| |#1| |#1|) "\\spad{leftQuotient(a,b)} computes the pair \\spad{[q,r]} such that \\spad{a = b*q + r} and the degree of \\spad{r} is less than the degree of \\spad{b}. The value \\spad{q} is returned.")) (|leftDivide| (((|Record| (|:| |quotient| |#1|) (|:| |remainder| |#1|)) |#1| |#1|) "\\spad{leftDivide(a,b)} returns the pair \\spad{[q,r]} such that \\spad{a = b*q + r} and the degree of \\spad{r} is less than the degree of \\spad{b}. This process is called ``left division\\spad{''}."))) 
 NIL 
 NIL 
@@ -3088,7 +3088,7 @@ NIL
 NIL 
 NIL 
 NIL 
-(-790 UP -2174) 
+(-790 UP -2173) 
 ((|constructor| (NIL "In this package \\spad{F} is a framed algebra over the integers (typically \\spad{F = Z[a]} for some algebraic integer a). The package provides functions to compute the integral closure of \\spad{Z} in the quotient quotient field of \\spad{F}.")) (|localIntegralBasis| (((|Record| (|:| |basis| (|Matrix| (|Integer|))) (|:| |basisDen| (|Integer|)) (|:| |basisInv| (|Matrix| (|Integer|)))) (|Integer|)) "\\spad{integralBasis(p)} returns a record \\spad{[basis,basisDen,basisInv]} containing information regarding the local integral closure of \\spad{Z} at the prime \\spad{p} in the quotient field of \\spad{F},{} where \\spad{F} is a framed algebra with \\spad{Z}-module basis \\spad{w1,w2,...,wn}. If \\spad{basis} is the matrix \\spad{(aij, i = 1..n, j = 1..n)},{} then the \\spad{i}th element of the integral basis is \\spad{vi = (1/basisDen) * sum(aij * wj, j = 1..n)},{} \\spadignore{i.e.} the \\spad{i}th row of \\spad{basis} contains the coordinates of the \\spad{i}th basis vector. Similarly,{} the \\spad{i}th row of the matrix \\spad{basisInv} contains the coordinates of \\spad{wi} with respect to the basis \\spad{v1,...,vn}: if \\spad{basisInv} is the matrix \\spad{(bij, i = 1..n, j = 1..n)},{} then \\spad{wi = sum(bij * vj, j = 1..n)}.")) (|integralBasis| (((|Record| (|:| |basis| (|Matrix| (|Integer|))) (|:| |basisDen| (|Integer|)) (|:| |basisInv| (|Matrix| (|Integer|))))) "\\spad{integralBasis()} returns a record \\spad{[basis,basisDen,basisInv]} containing information regarding the integral closure of \\spad{Z} in the quotient field of \\spad{F},{} where \\spad{F} is a framed algebra with \\spad{Z}-module basis \\spad{w1,w2,...,wn}. If \\spad{basis} is the matrix \\spad{(aij, i = 1..n, j = 1..n)},{} then the \\spad{i}th element of the integral basis is \\spad{vi = (1/basisDen) * sum(aij * wj, j = 1..n)},{} \\spadignore{i.e.} the \\spad{i}th row of \\spad{basis} contains the coordinates of the \\spad{i}th basis vector. Similarly,{} the \\spad{i}th row of the matrix \\spad{basisInv} contains the coordinates of \\spad{wi} with respect to the basis \\spad{v1,...,vn}: if \\spad{basisInv} is the matrix \\spad{(bij, i = 1..n, j = 1..n)},{} then \\spad{wi = sum(bij * vj, j = 1..n)}.")) (|discriminant| (((|Integer|)) "\\spad{discriminant()} returns the discriminant of the integral closure of \\spad{Z} in the quotient field of the framed algebra \\spad{F}."))) 
 NIL 
 NIL 
@@ -3104,7 +3104,7 @@ NIL
 ((|constructor| (NIL "\\spadtype{NonNegativeInteger} provides functions for non \\indented{2}{negative integers.}")) (|commutative| ((|attribute| "*") "\\spad{commutative(\"*\")} means multiplication is commutative : \\spad{x*y = y*x}.")) (|random| (($ $) "\\spad{random(n)} returns a random integer from 0 to \\spad{n-1}.")) (|shift| (($ $ (|Integer|)) "\\spad{shift(a,i)} shift \\spad{a} by \\spad{i} bits.")) (|exquo| (((|Union| $ "failed") $ $) "\\spad{exquo(a,b)} returns the quotient of \\spad{a} and \\spad{b},{} or \"failed\" if \\spad{b} is zero or \\spad{a} rem \\spad{b} is zero.")) (|divide| (((|Record| (|:| |quotient| $) (|:| |remainder| $)) $ $) "\\spad{divide(a,b)} returns a record containing both remainder and quotient.")) (|gcd| (($ $ $) "\\spad{gcd(a,b)} computes the greatest common divisor of two non negative integers \\spad{a} and \\spad{b}.")) (|rem| (($ $ $) "\\spad{a rem b} returns the remainder of \\spad{a} and \\spad{b}.")) (|quo| (($ $ $) "\\spad{a quo b} returns the quotient of \\spad{a} and \\spad{b},{} forgetting the remainder."))) 
 (((-4509 "*") . T)) 
 NIL 
-(-794 R -2174) 
+(-794 R -2173) 
 ((|constructor| (NIL "NonLinearFirstOrderODESolver provides a function for finding closed form first integrals of nonlinear ordinary differential equations of order 1.")) (|solve| (((|Union| |#2| "failed") |#2| |#2| (|BasicOperator|) (|Symbol|)) "\\spad{solve(M(x,y), N(x,y), y, x)} returns \\spad{F(x,y)} such that \\spad{F(x,y) = c} for a constant \\spad{c} is a first integral of the equation \\spad{M(x,y) dx + N(x,y) dy = 0},{} or \"failed\" if no first-integral can be found."))) 
 NIL 
 NIL 
@@ -3124,7 +3124,7 @@ NIL
 ((|constructor| (NIL "A package for computing normalized assocites of univariate polynomials with coefficients in a tower of simple extensions of a field.\\newline References : \\indented{1}{[1] \\spad{D}. LAZARD \"A new method for solving algebraic systems of} \\indented{5}{positive dimension\" Discr. App. Math. 33:147-160,{}1991} \\indented{1}{[2] \\spad{M}. MORENO MAZA and \\spad{R}. RIOBOO \"Computations of \\spad{gcd} over} \\indented{5}{algebraic towers of simple extensions\" In proceedings of AAECC11} \\indented{5}{Paris,{} 1995.} \\indented{1}{[3] \\spad{M}. MORENO MAZA \"Calculs de pgcd au-dessus des tours} \\indented{5}{d'extensions simples et resolution des systemes d'equations} \\indented{5}{algebriques\" These,{} Universite \\spad{P}.etM. Curie,{} Paris,{} 1997.}")) (|normInvertible?| (((|List| (|Record| (|:| |val| (|Boolean|)) (|:| |tower| |#5|))) |#4| |#5|) "\\axiom{normInvertible?(\\spad{p},{}\\spad{ts})} is an internal subroutine,{} exported only for developement.")) (|outputArgs| (((|Void|) (|String|) (|String|) |#4| |#5|) "\\axiom{outputArgs(\\spad{s1},{}\\spad{s2},{}\\spad{p},{}\\spad{ts})} is an internal subroutine,{} exported only for developement.")) (|normalize| (((|List| (|Record| (|:| |val| |#4|) (|:| |tower| |#5|))) |#4| |#5|) "\\axiom{normalize(\\spad{p},{}\\spad{ts})} normalizes \\axiom{\\spad{p}} \\spad{w}.\\spad{r}.\\spad{t} \\spad{ts}.")) (|normalizedAssociate| ((|#4| |#4| |#5|) "\\axiom{normalizedAssociate(\\spad{p},{}\\spad{ts})} returns a normalized polynomial \\axiom{\\spad{n}} \\spad{w}.\\spad{r}.\\spad{t}. \\spad{ts} such that \\axiom{\\spad{n}} and \\axiom{\\spad{p}} are associates \\spad{w}.\\spad{r}.\\spad{t} \\spad{ts} and assuming that \\axiom{\\spad{p}} is invertible \\spad{w}.\\spad{r}.\\spad{t} \\spad{ts}.")) (|recip| (((|Record| (|:| |num| |#4|) (|:| |den| |#4|)) |#4| |#5|) "\\axiom{recip(\\spad{p},{}\\spad{ts})} returns the inverse of \\axiom{\\spad{p}} \\spad{w}.\\spad{r}.\\spad{t} \\spad{ts} assuming that \\axiom{\\spad{p}} is invertible \\spad{w}.\\spad{r}.\\spad{t} \\spad{ts}."))) 
 NIL 
 NIL 
-(-799 -2174 |ExtF| |SUEx| |ExtP| |n|) 
+(-799 -2173 |ExtF| |SUEx| |ExtP| |n|) 
 ((|constructor| (NIL "This package \\undocumented")) (|Frobenius| ((|#4| |#4|) "\\spad{Frobenius(x)} \\undocumented")) (|retractIfCan| (((|Union| (|SparseUnivariatePolynomial| (|SparseUnivariatePolynomial| |#1|)) "failed") |#4|) "\\spad{retractIfCan(x)} \\undocumented")) (|normFactors| (((|List| |#4|) |#4|) "\\spad{normFactors(x)} \\undocumented"))) 
 NIL 
 NIL 
@@ -3220,11 +3220,11 @@ NIL
 ((|ODESolve| (((|Result|) (|Record| (|:| |xinit| (|DoubleFloat|)) (|:| |xend| (|DoubleFloat|)) (|:| |fn| (|Vector| (|Expression| (|DoubleFloat|)))) (|:| |yinit| (|List| (|DoubleFloat|))) (|:| |intvals| (|List| (|DoubleFloat|))) (|:| |g| (|Expression| (|DoubleFloat|))) (|:| |abserr| (|DoubleFloat|)) (|:| |relerr| (|DoubleFloat|)))) "\\spad{ODESolve(args)} performs the integration of the function given the strategy or method returned by \\axiomFun{measure}.")) (|measure| (((|Record| (|:| |measure| (|Float|)) (|:| |explanations| (|String|))) (|RoutinesTable|) (|Record| (|:| |xinit| (|DoubleFloat|)) (|:| |xend| (|DoubleFloat|)) (|:| |fn| (|Vector| (|Expression| (|DoubleFloat|)))) (|:| |yinit| (|List| (|DoubleFloat|))) (|:| |intvals| (|List| (|DoubleFloat|))) (|:| |g| (|Expression| (|DoubleFloat|))) (|:| |abserr| (|DoubleFloat|)) (|:| |relerr| (|DoubleFloat|)))) "\\spad{measure(R,args)} calculates an estimate of the ability of a particular method to solve a problem. \\blankline This method may be either a specific NAG routine or a strategy (such as transforming the function from one which is difficult to one which is easier to solve). \\blankline It will call whichever agents are needed to perform analysis on the problem in order to calculate the measure. There is a parameter,{} labelled \\axiom{sofar},{} which would contain the best compatibility found so far."))) 
 NIL 
 NIL 
-(-823 R -2174 L) 
+(-823 R -2173 L) 
 ((|constructor| (NIL "Solution of linear ordinary differential equations,{} constant coefficient case.")) (|constDsolve| (((|Record| (|:| |particular| |#2|) (|:| |basis| (|List| |#2|))) |#3| |#2| (|Symbol|)) "\\spad{constDsolve(op, g, x)} returns \\spad{[f, [y1,...,ym]]} where \\spad{f} is a particular solution of the equation \\spad{op y = g},{} and the \\spad{yi}\\spad{'s} form a basis for the solutions of \\spad{op y = 0}."))) 
 NIL 
 NIL 
-(-824 R -2174) 
+(-824 R -2173) 
 ((|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 
@@ -3232,7 +3232,7 @@ NIL
 ((|constructor| (NIL "\\axiom{ODEIntensityFunctionsTable()} provides a dynamic table and a set of functions to store details found out about sets of ODE\\spad{'s}.")) (|showIntensityFunctions| (((|Union| (|Record| (|:| |stiffness| (|Float|)) (|:| |stability| (|Float|)) (|:| |expense| (|Float|)) (|:| |accuracy| (|Float|)) (|:| |intermediateResults| (|Float|))) "failed") (|Record| (|:| |xinit| (|DoubleFloat|)) (|:| |xend| (|DoubleFloat|)) (|:| |fn| (|Vector| (|Expression| (|DoubleFloat|)))) (|:| |yinit| (|List| (|DoubleFloat|))) (|:| |intvals| (|List| (|DoubleFloat|))) (|:| |g| (|Expression| (|DoubleFloat|))) (|:| |abserr| (|DoubleFloat|)) (|:| |relerr| (|DoubleFloat|)))) "\\spad{showIntensityFunctions(k)} returns the entries in the table of intensity functions \\spad{k}.")) (|insert!| (($ (|Record| (|:| |key| (|Record| (|:| |xinit| (|DoubleFloat|)) (|:| |xend| (|DoubleFloat|)) (|:| |fn| (|Vector| (|Expression| (|DoubleFloat|)))) (|:| |yinit| (|List| (|DoubleFloat|))) (|:| |intvals| (|List| (|DoubleFloat|))) (|:| |g| (|Expression| (|DoubleFloat|))) (|:| |abserr| (|DoubleFloat|)) (|:| |relerr| (|DoubleFloat|)))) (|:| |entry| (|Record| (|:| |stiffness| (|Float|)) (|:| |stability| (|Float|)) (|:| |expense| (|Float|)) (|:| |accuracy| (|Float|)) (|:| |intermediateResults| (|Float|)))))) "\\spad{insert!(r)} inserts an entry \\spad{r} into theIFTable")) (|iFTable| (($ (|List| (|Record| (|:| |key| (|Record| (|:| |xinit| (|DoubleFloat|)) (|:| |xend| (|DoubleFloat|)) (|:| |fn| (|Vector| (|Expression| (|DoubleFloat|)))) (|:| |yinit| (|List| (|DoubleFloat|))) (|:| |intvals| (|List| (|DoubleFloat|))) (|:| |g| (|Expression| (|DoubleFloat|))) (|:| |abserr| (|DoubleFloat|)) (|:| |relerr| (|DoubleFloat|)))) (|:| |entry| (|Record| (|:| |stiffness| (|Float|)) (|:| |stability| (|Float|)) (|:| |expense| (|Float|)) (|:| |accuracy| (|Float|)) (|:| |intermediateResults| (|Float|))))))) "\\spad{iFTable(l)} creates an intensity-functions table from the elements of \\spad{l}.")) (|keys| (((|List| (|Record| (|:| |xinit| (|DoubleFloat|)) (|:| |xend| (|DoubleFloat|)) (|:| |fn| (|Vector| (|Expression| (|DoubleFloat|)))) (|:| |yinit| (|List| (|DoubleFloat|))) (|:| |intvals| (|List| (|DoubleFloat|))) (|:| |g| (|Expression| (|DoubleFloat|))) (|:| |abserr| (|DoubleFloat|)) (|:| |relerr| (|DoubleFloat|)))) $) "\\spad{keys(tab)} returns the list of keys of \\spad{f}")) (|clearTheIFTable| (((|Void|)) "\\spad{clearTheIFTable()} clears the current table of intensity functions.")) (|showTheIFTable| (($) "\\spad{showTheIFTable()} returns the current table of intensity functions."))) 
 NIL 
 NIL 
-(-826 R -2174) 
+(-826 R -2173) 
 ((|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 
@@ -3240,11 +3240,11 @@ NIL
 ((|measure| (((|Record| (|:| |measure| (|Float|)) (|:| |name| (|String|)) (|:| |explanations| (|List| (|String|)))) (|NumericalODEProblem|) (|RoutinesTable|)) "\\spad{measure(prob,R)} is a top level ANNA function for identifying the most appropriate numerical routine from those in the routines table provided for solving the numerical ODE problem defined by \\axiom{\\spad{prob}}. \\blankline It calls each \\axiom{domain} listed in \\axiom{\\spad{R}} of \\axiom{category} \\axiomType{OrdinaryDifferentialEquationsSolverCategory} in turn to calculate all measures and returns the best \\spadignore{i.e.} the name of the most appropriate domain and any other relevant information. It predicts the likely most effective NAG numerical Library routine to solve the input set of ODEs by checking various attributes of the system of ODEs and calculating a measure of compatibility of each routine to these attributes.") (((|Record| (|:| |measure| (|Float|)) (|:| |name| (|String|)) (|:| |explanations| (|List| (|String|)))) (|NumericalODEProblem|)) "\\spad{measure(prob)} is a top level ANNA function for identifying the most appropriate numerical routine from those in the routines table provided for solving the numerical ODE problem defined by \\axiom{\\spad{prob}}. \\blankline It calls each \\axiom{domain} of \\axiom{category} \\axiomType{OrdinaryDifferentialEquationsSolverCategory} in turn to calculate all measures and returns the best \\spadignore{i.e.} the name of the most appropriate domain and any other relevant information. It predicts the likely most effective NAG numerical Library routine to solve the input set of ODEs by checking various attributes of the system of ODEs and calculating a measure of compatibility of each routine to these attributes.")) (|solve| (((|Result|) (|Vector| (|Expression| (|Float|))) (|Float|) (|Float|) (|List| (|Float|)) (|Expression| (|Float|)) (|List| (|Float|)) (|Float|) (|Float|)) "\\spad{solve(f,xStart,xEnd,yInitial,G,intVals,epsabs,epsrel)} is a top level ANNA function to solve numerically a system of ordinary differential equations,{} \\axiom{\\spad{f}},{} \\spadignore{i.e.} equations for the derivatives \\spad{Y}[1]'..\\spad{Y}[\\spad{n}]' defined in terms of \\spad{X},{}\\spad{Y}[1]..\\spad{Y}[\\spad{n}] from \\axiom{\\spad{xStart}} to \\axiom{\\spad{xEnd}} with the initial values for \\spad{Y}[1]..\\spad{Y}[\\spad{n}] (\\axiom{\\spad{yInitial}}) to an absolute error requirement \\axiom{\\spad{epsabs}} and relative error \\axiom{\\spad{epsrel}}. The values of \\spad{Y}[1]..\\spad{Y}[\\spad{n}] will be output for the values of \\spad{X} in \\axiom{\\spad{intVals}}. The calculation will stop if the function \\spad{G}(\\spad{X},{}\\spad{Y}[1],{}..,{}\\spad{Y}[\\spad{n}]) evaluates to zero before \\spad{X} = \\spad{xEnd}. \\blankline It iterates over the \\axiom{domains} of \\axiomType{OrdinaryDifferentialEquationsSolverCategory} contained in the table of routines \\axiom{\\spad{R}} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline The method used to perform the numerical process will be one of the routines contained in the NAG numerical Library. The function predicts the likely most effective routine by checking various attributes of the system of ODE\\spad{'s} and calculating a measure of compatibility of each routine to these attributes. \\blankline It then calls the resulting `best' routine.") (((|Result|) (|Vector| (|Expression| (|Float|))) (|Float|) (|Float|) (|List| (|Float|)) (|Expression| (|Float|)) (|List| (|Float|)) (|Float|)) "\\spad{solve(f,xStart,xEnd,yInitial,G,intVals,tol)} is a top level ANNA function to solve numerically a system of ordinary differential equations,{} \\axiom{\\spad{f}},{} \\spadignore{i.e.} equations for the derivatives \\spad{Y}[1]'..\\spad{Y}[\\spad{n}]' defined in terms of \\spad{X},{}\\spad{Y}[1]..\\spad{Y}[\\spad{n}] from \\axiom{\\spad{xStart}} to \\axiom{\\spad{xEnd}} with the initial values for \\spad{Y}[1]..\\spad{Y}[\\spad{n}] (\\axiom{\\spad{yInitial}}) to a tolerance \\axiom{\\spad{tol}}. The values of \\spad{Y}[1]..\\spad{Y}[\\spad{n}] will be output for the values of \\spad{X} in \\axiom{\\spad{intVals}}. The calculation will stop if the function \\spad{G}(\\spad{X},{}\\spad{Y}[1],{}..,{}\\spad{Y}[\\spad{n}]) evaluates to zero before \\spad{X} = \\spad{xEnd}. \\blankline It iterates over the \\axiom{domains} of \\axiomType{OrdinaryDifferentialEquationsSolverCategory} contained in the table of routines \\axiom{\\spad{R}} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline The method used to perform the numerical process will be one of the routines contained in the NAG numerical Library. The function predicts the likely most effective routine by checking various attributes of the system of ODE\\spad{'s} and calculating a measure of compatibility of each routine to these attributes. \\blankline It then calls the resulting `best' routine.") (((|Result|) (|Vector| (|Expression| (|Float|))) (|Float|) (|Float|) (|List| (|Float|)) (|List| (|Float|)) (|Float|)) "\\spad{solve(f,xStart,xEnd,yInitial,intVals,tol)} is a top level ANNA function to solve numerically a system of ordinary differential equations,{} \\axiom{\\spad{f}},{} \\spadignore{i.e.} equations for the derivatives \\spad{Y}[1]'..\\spad{Y}[\\spad{n}]' defined in terms of \\spad{X},{}\\spad{Y}[1]..\\spad{Y}[\\spad{n}] from \\axiom{\\spad{xStart}} to \\axiom{\\spad{xEnd}} with the initial values for \\spad{Y}[1]..\\spad{Y}[\\spad{n}] (\\axiom{\\spad{yInitial}}) to a tolerance \\axiom{\\spad{tol}}. The values of \\spad{Y}[1]..\\spad{Y}[\\spad{n}] will be output for the values of \\spad{X} in \\axiom{\\spad{intVals}}. \\blankline It iterates over the \\axiom{domains} of \\axiomType{OrdinaryDifferentialEquationsSolverCategory} contained in the table of routines \\axiom{\\spad{R}} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline The method used to perform the numerical process will be one of the routines contained in the NAG numerical Library. The function predicts the likely most effective routine by checking various attributes of the system of ODE\\spad{'s} and calculating a measure of compatibility of each routine to these attributes. \\blankline It then calls the resulting `best' routine.") (((|Result|) (|Vector| (|Expression| (|Float|))) (|Float|) (|Float|) (|List| (|Float|)) (|Expression| (|Float|)) (|Float|)) "\\spad{solve(f,xStart,xEnd,yInitial,G,tol)} is a top level ANNA function to solve numerically a system of ordinary differential equations,{} \\axiom{\\spad{f}},{} \\spadignore{i.e.} equations for the derivatives \\spad{Y}[1]'..\\spad{Y}[\\spad{n}]' defined in terms of \\spad{X},{}\\spad{Y}[1]..\\spad{Y}[\\spad{n}] from \\axiom{\\spad{xStart}} to \\axiom{\\spad{xEnd}} with the initial values for \\spad{Y}[1]..\\spad{Y}[\\spad{n}] (\\axiom{\\spad{yInitial}}) to a tolerance \\axiom{\\spad{tol}}. The calculation will stop if the function \\spad{G}(\\spad{X},{}\\spad{Y}[1],{}..,{}\\spad{Y}[\\spad{n}]) evaluates to zero before \\spad{X} = \\spad{xEnd}. \\blankline It iterates over the \\axiom{domains} of \\axiomType{OrdinaryDifferentialEquationsSolverCategory} contained in the table of routines \\axiom{\\spad{R}} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline The method used to perform the numerical process will be one of the routines contained in the NAG numerical Library. The function predicts the likely most effective routine by checking various attributes of the system of ODE\\spad{'s} and calculating a measure of compatibility of each routine to these attributes. \\blankline It then calls the resulting `best' routine.") (((|Result|) (|Vector| (|Expression| (|Float|))) (|Float|) (|Float|) (|List| (|Float|)) (|Float|)) "\\spad{solve(f,xStart,xEnd,yInitial,tol)} is a top level ANNA function to solve numerically a system of ordinary differential equations,{} \\axiom{\\spad{f}},{} \\spadignore{i.e.} equations for the derivatives \\spad{Y}[1]'..\\spad{Y}[\\spad{n}]' defined in terms of \\spad{X},{}\\spad{Y}[1]..\\spad{Y}[\\spad{n}] from \\axiom{\\spad{xStart}} to \\axiom{\\spad{xEnd}} with the initial values for \\spad{Y}[1]..\\spad{Y}[\\spad{n}] (\\axiom{\\spad{yInitial}}) to a tolerance \\axiom{\\spad{tol}}. \\blankline It iterates over the \\axiom{domains} of \\axiomType{OrdinaryDifferentialEquationsSolverCategory} contained in the table of routines \\axiom{\\spad{R}} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline The method used to perform the numerical process will be one of the routines contained in the NAG numerical Library. The function predicts the likely most effective routine by checking various attributes of the system of ODE\\spad{'s} and calculating a measure of compatibility of each routine to these attributes. \\blankline It then calls the resulting `best' routine.") (((|Result|) (|Vector| (|Expression| (|Float|))) (|Float|) (|Float|) (|List| (|Float|))) "\\spad{solve(f,xStart,xEnd,yInitial)} is a top level ANNA function to solve numerically a system of ordinary differential equations \\spadignore{i.e.} equations for the derivatives \\spad{Y}[1]'..\\spad{Y}[\\spad{n}]' defined in terms of \\spad{X},{}\\spad{Y}[1]..\\spad{Y}[\\spad{n}],{} together with a starting value for \\spad{X} and \\spad{Y}[1]..\\spad{Y}[\\spad{n}] (called the initial conditions) and a final value of \\spad{X}. A default value is used for the accuracy requirement. \\blankline It iterates over the \\axiom{domains} of \\axiomType{OrdinaryDifferentialEquationsSolverCategory} contained in the table of routines \\axiom{\\spad{R}} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline The method used to perform the numerical process will be one of the routines contained in the NAG numerical Library. The function predicts the likely most effective routine by checking various attributes of the system of ODE\\spad{'s} and calculating a measure of compatibility of each routine to these attributes. \\blankline It then calls the resulting `best' routine.") (((|Result|) (|NumericalODEProblem|) (|RoutinesTable|)) "\\spad{solve(odeProblem,R)} is a top level ANNA function to solve numerically a system of ordinary differential equations \\spadignore{i.e.} equations for the derivatives \\spad{Y}[1]'..\\spad{Y}[\\spad{n}]' defined in terms of \\spad{X},{}\\spad{Y}[1]..\\spad{Y}[\\spad{n}],{} together with starting values for \\spad{X} and \\spad{Y}[1]..\\spad{Y}[\\spad{n}] (called the initial conditions),{} a final value of \\spad{X},{} an accuracy requirement and any intermediate points at which the result is required. \\blankline It iterates over the \\axiom{domains} of \\axiomType{OrdinaryDifferentialEquationsSolverCategory} contained in the table of routines \\axiom{\\spad{R}} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline The method used to perform the numerical process will be one of the routines contained in the NAG numerical Library. The function predicts the likely most effective routine by checking various attributes of the system of ODE\\spad{'s} and calculating a measure of compatibility of each routine to these attributes. \\blankline It then calls the resulting `best' routine.") (((|Result|) (|NumericalODEProblem|)) "\\spad{solve(odeProblem)} is a top level ANNA function to solve numerically a system of ordinary differential equations \\spadignore{i.e.} equations for the derivatives \\spad{Y}[1]'..\\spad{Y}[\\spad{n}]' defined in terms of \\spad{X},{}\\spad{Y}[1]..\\spad{Y}[\\spad{n}],{} together with starting values for \\spad{X} and \\spad{Y}[1]..\\spad{Y}[\\spad{n}] (called the initial conditions),{} a final value of \\spad{X},{} an accuracy requirement and any intermediate points at which the result is required. \\blankline It iterates over the \\axiom{domains} of \\axiomType{OrdinaryDifferentialEquationsSolverCategory} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline The method used to perform the numerical process will be one of the routines contained in the NAG numerical Library. The function predicts the likely most effective routine by checking various attributes of the system of ODE\\spad{'s} and calculating a measure of compatibility of each routine to these attributes. \\blankline It then calls the resulting `best' routine."))) 
 NIL 
 NIL 
-(-828 -2174 UP UPUP R) 
+(-828 -2173 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 
-(-829 -2174 UP L LQ) 
+(-829 -2173 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 
@@ -3252,27 +3252,27 @@ NIL
 ((|retract| (((|Record| (|:| |xinit| (|DoubleFloat|)) (|:| |xend| (|DoubleFloat|)) (|:| |fn| (|Vector| (|Expression| (|DoubleFloat|)))) (|:| |yinit| (|List| (|DoubleFloat|))) (|:| |intvals| (|List| (|DoubleFloat|))) (|:| |g| (|Expression| (|DoubleFloat|))) (|:| |abserr| (|DoubleFloat|)) (|:| |relerr| (|DoubleFloat|))) $) "\\spad{retract(x)} \\undocumented{}")) (|coerce| (($ (|Record| (|:| |xinit| (|DoubleFloat|)) (|:| |xend| (|DoubleFloat|)) (|:| |fn| (|Vector| (|Expression| (|DoubleFloat|)))) (|:| |yinit| (|List| (|DoubleFloat|))) (|:| |intvals| (|List| (|DoubleFloat|))) (|:| |g| (|Expression| (|DoubleFloat|))) (|:| |abserr| (|DoubleFloat|)) (|:| |relerr| (|DoubleFloat|)))) "\\spad{coerce(x)} \\undocumented{}"))) 
 NIL 
 NIL 
-(-831 -2174 UP L LQ) 
+(-831 -2173 UP L LQ) 
 ((|constructor| (NIL "In-field solution of Riccati equations,{} primitive case.")) (|changeVar| ((|#3| |#3| (|Fraction| |#2|)) "\\spad{changeVar(+/[ai D^i], a)} returns the operator \\spad{+/[ai (D+a)^i]}.") ((|#3| |#3| |#2|) "\\spad{changeVar(+/[ai D^i], a)} returns the operator \\spad{+/[ai (D+a)^i]}.")) (|singRicDE| (((|List| (|Record| (|:| |frac| (|Fraction| |#2|)) (|:| |eq| |#3|))) |#3| (|Mapping| (|List| |#2|) |#2| (|SparseUnivariatePolynomial| |#2|)) (|Mapping| (|Factored| |#2|) |#2|)) "\\spad{singRicDE(op, zeros, ezfactor)} returns \\spad{[[f1, L1], [f2, L2], ... , [fk, Lk]]} such that the singular part of any rational solution of the associated Riccati equation of \\spad{op y=0} must be one of the \\spad{fi}\\spad{'s} (up to the constant coefficient),{} in which case the equation for \\spad{z=y e^{-int p}} is \\spad{Li z=0}. \\spad{zeros(C(x),H(x,y))} returns all the \\spad{P_i(x)}\\spad{'s} such that \\spad{H(x,P_i(x)) = 0 modulo C(x)}. Argument \\spad{ezfactor} is a factorisation in \\spad{UP},{} not necessarily into irreducibles.")) (|polyRicDE| (((|List| (|Record| (|:| |poly| |#2|) (|:| |eq| |#3|))) |#3| (|Mapping| (|List| |#1|) |#2|)) "\\spad{polyRicDE(op, zeros)} returns \\spad{[[p1, L1], [p2, L2], ... , [pk, Lk]]} such that the polynomial part of any rational solution of the associated Riccati equation of \\spad{op y=0} must be one of the \\spad{pi}\\spad{'s} (up to the constant coefficient),{} in which case the equation for \\spad{z=y e^{-int p}} is \\spad{Li z =0}. \\spad{zeros} is a zero finder in \\spad{UP}.")) (|constantCoefficientRicDE| (((|List| (|Record| (|:| |constant| |#1|) (|:| |eq| |#3|))) |#3| (|Mapping| (|List| |#1|) |#2|)) "\\spad{constantCoefficientRicDE(op, ric)} returns \\spad{[[a1, L1], [a2, L2], ... , [ak, Lk]]} such that any rational solution with no polynomial part of the associated Riccati equation of \\spad{op y = 0} must be one of the \\spad{ai}\\spad{'s} in which case the equation for \\spad{z = y e^{-int ai}} is \\spad{Li z = 0}. \\spad{ric} is a Riccati equation solver over \\spad{F},{} whose input is the associated linear equation.")) (|leadingCoefficientRicDE| (((|List| (|Record| (|:| |deg| (|NonNegativeInteger|)) (|:| |eq| |#2|))) |#3|) "\\spad{leadingCoefficientRicDE(op)} returns \\spad{[[m1, p1], [m2, p2], ... , [mk, pk]]} such that the polynomial part of any rational solution of the associated Riccati equation of \\spad{op y = 0} must have degree \\spad{mj} for some \\spad{j},{} and its leading coefficient is then a zero of \\spad{pj}. In addition,{}\\spad{m1>m2> ... >mk}.")) (|denomRicDE| ((|#2| |#3|) "\\spad{denomRicDE(op)} returns a polynomial \\spad{d} such that any rational solution of the associated Riccati equation of \\spad{op y = 0} is of the form \\spad{p/d + q'/q + r} for some polynomials \\spad{p} and \\spad{q} and a reduced \\spad{r}. Also,{} \\spad{deg(p) < deg(d)} and {\\spad{gcd}(\\spad{d},{}\\spad{q}) = 1}."))) 
 NIL 
 NIL 
-(-832 -2174 UP) 
+(-832 -2173 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 
-(-833 -2174 L UP A LO) 
+(-833 -2173 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 
-(-834 -2174 UP) 
+(-834 -2173 UP) 
 ((|constructor| (NIL "In-field solution of Riccati equations,{} rational case.")) (|polyRicDE| (((|List| (|Record| (|:| |poly| |#2|) (|:| |eq| (|LinearOrdinaryDifferentialOperator2| |#2| (|Fraction| |#2|))))) (|LinearOrdinaryDifferentialOperator2| |#2| (|Fraction| |#2|)) (|Mapping| (|List| |#1|) |#2|)) "\\spad{polyRicDE(op, zeros)} returns \\spad{[[p1, L1], [p2, L2], ... , [pk,Lk]]} such that the polynomial part of any rational solution of the associated Riccati equation of \\spad{op y = 0} must be one of the \\spad{pi}\\spad{'s} (up to the constant coefficient),{} in which case the equation for \\spad{z = y e^{-int p}} is \\spad{Li z = 0}. \\spad{zeros} is a zero finder in \\spad{UP}.")) (|singRicDE| (((|List| (|Record| (|:| |frac| (|Fraction| |#2|)) (|:| |eq| (|LinearOrdinaryDifferentialOperator2| |#2| (|Fraction| |#2|))))) (|LinearOrdinaryDifferentialOperator2| |#2| (|Fraction| |#2|)) (|Mapping| (|Factored| |#2|) |#2|)) "\\spad{singRicDE(op, ezfactor)} returns \\spad{[[f1,L1], [f2,L2],..., [fk,Lk]]} such that the singular \\spad{++} part of any rational solution of the associated Riccati equation of \\spad{op y = 0} must be one of the \\spad{fi}\\spad{'s} (up to the constant coefficient),{} in which case the equation for \\spad{z = y e^{-int ai}} is \\spad{Li z = 0}. Argument \\spad{ezfactor} is a factorisation in \\spad{UP},{} not necessarily into irreducibles.")) (|ricDsolve| (((|List| (|Fraction| |#2|)) (|LinearOrdinaryDifferentialOperator2| |#2| (|Fraction| |#2|)) (|Mapping| (|Factored| |#2|) |#2|)) "\\spad{ricDsolve(op, ezfactor)} returns the rational solutions of the associated Riccati equation of \\spad{op y = 0}. Argument \\spad{ezfactor} is a factorisation in \\spad{UP},{} not necessarily into irreducibles.") (((|List| (|Fraction| |#2|)) (|LinearOrdinaryDifferentialOperator2| |#2| (|Fraction| |#2|))) "\\spad{ricDsolve(op)} returns the rational solutions of the associated Riccati equation of \\spad{op y = 0}.") (((|List| (|Fraction| |#2|)) (|LinearOrdinaryDifferentialOperator1| (|Fraction| |#2|)) (|Mapping| (|Factored| |#2|) |#2|)) "\\spad{ricDsolve(op, ezfactor)} returns the rational solutions of the associated Riccati equation of \\spad{op y = 0}. Argument \\spad{ezfactor} is a factorisation in \\spad{UP},{} not necessarily into irreducibles.") (((|List| (|Fraction| |#2|)) (|LinearOrdinaryDifferentialOperator1| (|Fraction| |#2|))) "\\spad{ricDsolve(op)} returns the rational solutions of the associated Riccati equation of \\spad{op y = 0}.") (((|List| (|Fraction| |#2|)) (|LinearOrdinaryDifferentialOperator2| |#2| (|Fraction| |#2|)) (|Mapping| (|List| |#1|) |#2|) (|Mapping| (|Factored| |#2|) |#2|)) "\\spad{ricDsolve(op, zeros, ezfactor)} returns the rational solutions of the associated Riccati equation of \\spad{op y = 0}. \\spad{zeros} is a zero finder in \\spad{UP}. Argument \\spad{ezfactor} is a factorisation in \\spad{UP},{} not necessarily into irreducibles.") (((|List| (|Fraction| |#2|)) (|LinearOrdinaryDifferentialOperator2| |#2| (|Fraction| |#2|)) (|Mapping| (|List| |#1|) |#2|)) "\\spad{ricDsolve(op, zeros)} returns the rational solutions of the associated Riccati equation of \\spad{op y = 0}. \\spad{zeros} is a zero finder in \\spad{UP}.") (((|List| (|Fraction| |#2|)) (|LinearOrdinaryDifferentialOperator1| (|Fraction| |#2|)) (|Mapping| (|List| |#1|) |#2|) (|Mapping| (|Factored| |#2|) |#2|)) "\\spad{ricDsolve(op, zeros, ezfactor)} returns the rational solutions of the associated Riccati equation of \\spad{op y = 0}. \\spad{zeros} is a zero finder in \\spad{UP}. Argument \\spad{ezfactor} is a factorisation in \\spad{UP},{} not necessarily into irreducibles.") (((|List| (|Fraction| |#2|)) (|LinearOrdinaryDifferentialOperator1| (|Fraction| |#2|)) (|Mapping| (|List| |#1|) |#2|)) "\\spad{ricDsolve(op, zeros)} returns the rational solutions of the associated Riccati equation of \\spad{op y = 0}. \\spad{zeros} is a zero finder in \\spad{UP}."))) 
 NIL 
 ((|HasCategory| |#1| (QUOTE (-27)))) 
-(-835 -2174 LO) 
+(-835 -2173 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 
-(-836 -2174 LODO) 
+(-836 -2173 LODO) 
 ((|constructor| (NIL "\\spad{ODETools} provides tools for the linear ODE solver.")) (|particularSolution| (((|Union| |#1| "failed") |#2| |#1| (|List| |#1|) (|Mapping| |#1| |#1|)) "\\spad{particularSolution(op, g, [f1,...,fm], I)} returns a particular solution \\spad{h} of the equation \\spad{op y = g} where \\spad{[f1,...,fm]} are linearly independent and \\spad{op(fi)=0}. The value \"failed\" is returned if no particular solution is found. Note: the method of variations of parameters is used.")) (|variationOfParameters| (((|Union| (|Vector| |#1|) "failed") |#2| |#1| (|List| |#1|)) "\\spad{variationOfParameters(op, g, [f1,...,fm])} returns \\spad{[u1,...,um]} such that a particular solution of the equation \\spad{op y = g} is \\spad{f1 int(u1) + ... + fm int(um)} where \\spad{[f1,...,fm]} are linearly independent and \\spad{op(fi)=0}. The value \"failed\" is returned if \\spad{m < n} and no particular solution is found.")) (|wronskianMatrix| (((|Matrix| |#1|) (|List| |#1|) (|NonNegativeInteger|)) "\\spad{wronskianMatrix([f1,...,fn], q, D)} returns the \\spad{q x n} matrix \\spad{m} whose i^th row is \\spad{[f1^(i-1),...,fn^(i-1)]}.") (((|Matrix| |#1|) (|List| |#1|)) "\\spad{wronskianMatrix([f1,...,fn])} returns the \\spad{n x n} matrix \\spad{m} whose i^th row is \\spad{[f1^(i-1),...,fn^(i-1)]}."))) 
 NIL 
 NIL 
@@ -3440,11 +3440,11 @@ NIL
 ((|constructor| (NIL "\\spad{UnivariateSkewPolynomialCategoryOps} provides products and \\indented{1}{divisions of univariate skew polynomials.}")) (|rightDivide| (((|Record| (|:| |quotient| |#2|) (|:| |remainder| |#2|)) |#2| |#2| (|Automorphism| |#1|)) "\\spad{rightDivide(a, b, sigma)} returns the pair \\spad{[q,r]} such that \\spad{a = q*b + r} and the degree of \\spad{r} is less than the degree of \\spad{b}. This process is called ``right division\\spad{''}. \\spad{\\sigma} is the morphism to use.")) (|leftDivide| (((|Record| (|:| |quotient| |#2|) (|:| |remainder| |#2|)) |#2| |#2| (|Automorphism| |#1|)) "\\spad{leftDivide(a, b, sigma)} returns the pair \\spad{[q,r]} such that \\spad{a = b*q + r} and the degree of \\spad{r} is less than the degree of \\spad{b}. This process is called ``left division\\spad{''}. \\spad{\\sigma} is the morphism to use.")) (|monicRightDivide| (((|Record| (|:| |quotient| |#2|) (|:| |remainder| |#2|)) |#2| |#2| (|Automorphism| |#1|)) "\\spad{monicRightDivide(a, b, sigma)} returns the pair \\spad{[q,r]} such that \\spad{a = q*b + r} and the degree of \\spad{r} is less than the degree of \\spad{b}. \\spad{b} must be monic. This process is called ``right division\\spad{''}. \\spad{\\sigma} is the morphism to use.")) (|monicLeftDivide| (((|Record| (|:| |quotient| |#2|) (|:| |remainder| |#2|)) |#2| |#2| (|Automorphism| |#1|)) "\\spad{monicLeftDivide(a, b, sigma)} returns the pair \\spad{[q,r]} such that \\spad{a = b*q + r} and the degree of \\spad{r} is less than the degree of \\spad{b}. \\spad{b} must be monic. This process is called ``left division\\spad{''}. \\spad{\\sigma} is the morphism to use.")) (|apply| ((|#1| |#2| |#1| |#1| (|Automorphism| |#1|) (|Mapping| |#1| |#1|)) "\\spad{apply(p, c, m, sigma, delta)} returns \\spad{p(m)} where the action is given by \\spad{x m = c sigma(m) + delta(m)}.")) (|times| ((|#2| |#2| |#2| (|Automorphism| |#1|) (|Mapping| |#1| |#1|)) "\\spad{times(p, q, sigma, delta)} returns \\spad{p * q}. \\spad{\\sigma} and \\spad{\\delta} are the maps to use."))) 
 NIL 
 ((|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-570)))) 
-(-878 R |sigma| -4147) 
+(-878 R |sigma| -4148) 
 ((|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."))) 
 ((-4501 . T) (-4502 . T) (-4504 . T)) 
 ((|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (LIST (QUOTE -1069) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasCategory| |#1| (LIST (QUOTE -1069) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-570))) (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-376)))) 
-(-879 |x| R |sigma| -4147) 
+(-879 |x| R |sigma| -4148) 
 ((|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}."))) 
 ((-4501 . T) (-4502 . T) (-4504 . T)) 
 ((|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (LIST (QUOTE -1069) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasCategory| |#2| (LIST (QUOTE -1069) (QUOTE (-578)))) (|HasCategory| |#2| (QUOTE (-570))) (|HasCategory| |#2| (QUOTE (-466))) (|HasCategory| |#2| (QUOTE (-376)))) 
@@ -3620,7 +3620,7 @@ NIL
 ((|PDESolve| (((|Result|) (|Record| (|:| |pde| (|List| (|Expression| (|DoubleFloat|)))) (|:| |constraints| (|List| (|Record| (|:| |start| (|DoubleFloat|)) (|:| |finish| (|DoubleFloat|)) (|:| |grid| (|NonNegativeInteger|)) (|:| |boundaryType| (|Integer|)) (|:| |dStart| (|Matrix| (|DoubleFloat|))) (|:| |dFinish| (|Matrix| (|DoubleFloat|)))))) (|:| |f| (|List| (|List| (|Expression| (|DoubleFloat|))))) (|:| |st| (|String|)) (|:| |tol| (|DoubleFloat|)))) "\\spad{PDESolve(args)} performs the integration of the function given the strategy or method returned by \\axiomFun{measure}.")) (|measure| (((|Record| (|:| |measure| (|Float|)) (|:| |explanations| (|String|))) (|RoutinesTable|) (|Record| (|:| |pde| (|List| (|Expression| (|DoubleFloat|)))) (|:| |constraints| (|List| (|Record| (|:| |start| (|DoubleFloat|)) (|:| |finish| (|DoubleFloat|)) (|:| |grid| (|NonNegativeInteger|)) (|:| |boundaryType| (|Integer|)) (|:| |dStart| (|Matrix| (|DoubleFloat|))) (|:| |dFinish| (|Matrix| (|DoubleFloat|)))))) (|:| |f| (|List| (|List| (|Expression| (|DoubleFloat|))))) (|:| |st| (|String|)) (|:| |tol| (|DoubleFloat|)))) "\\spad{measure(R,args)} calculates an estimate of the ability of a particular method to solve a problem. \\blankline This method may be either a specific NAG routine or a strategy (such as transforming the function from one which is difficult to one which is easier to solve). \\blankline It will call whichever agents are needed to perform analysis on the problem in order to calculate the measure. There is a parameter,{} labelled \\axiom{sofar},{} which would contain the best compatibility found so far."))) 
 NIL 
 NIL 
-(-923 UP -2174) 
+(-923 UP -2173) 
 ((|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 
@@ -3688,7 +3688,7 @@ NIL
 ((|constructor| (NIL "PrimeField(\\spad{p}) implements the field with \\spad{p} elements if \\spad{p} is a prime number. Error: if \\spad{p} is not prime. Note: this domain does not check that argument is a prime."))) 
 ((-4499 . T) (-4505 . T) (-4500 . T) ((-4509 "*") . T) (-4501 . T) (-4502 . T) (-4504 . T)) 
 ((|HasCategory| $ (QUOTE (-149))) (|HasCategory| $ (QUOTE (-147))) (|HasCategory| $ (QUOTE (-381)))) 
-(-940 R0 -2174 UP UPUP R) 
+(-940 R0 -2173 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 
@@ -3716,7 +3716,7 @@ NIL
 ((|constructor| (NIL "PermutationGroupExamples provides permutation groups for some classes of groups: symmetric,{} alternating,{} dihedral,{} cyclic,{} direct products of cyclic,{} which are in fact the finite abelian groups of symmetric groups called Young subgroups. Furthermore,{} Rubik\\spad{'s} group as permutation group of 48 integers and a list of sporadic simple groups derived from the atlas of finite groups.")) (|youngGroup| (((|PermutationGroup| (|Integer|)) (|Partition|)) "\\spad{youngGroup(lambda)} constructs the direct product of the symmetric groups given by the parts of the partition {\\em lambda}.") (((|PermutationGroup| (|Integer|)) (|List| (|Integer|))) "\\spad{youngGroup([n1,...,nk])} constructs the direct product of the symmetric groups {\\em Sn1},{}...,{}{\\em Snk}.")) (|rubiksGroup| (((|PermutationGroup| (|Integer|))) "\\spad{rubiksGroup constructs} the permutation group representing Rubic\\spad{'s} Cube acting on integers {\\em 10*i+j} for {\\em 1 <= i <= 6},{} {\\em 1 <= j <= 8}. The faces of Rubik\\spad{'s} Cube are labelled in the obvious way Front,{} Right,{} Up,{} Down,{} Left,{} Back and numbered from 1 to 6 in this given ordering,{} the pieces on each face (except the unmoveable center piece) are clockwise numbered from 1 to 8 starting with the piece in the upper left corner. The moves of the cube are represented as permutations on these pieces,{} represented as a two digit integer {\\em ij} where \\spad{i} is the numer of theface (1 to 6) and \\spad{j} is the number of the piece on this face. The remaining ambiguities are resolved by looking at the 6 generators,{} which represent a 90 degree turns of the faces,{} or from the following pictorial description. Permutation group representing Rubic\\spad{'s} Cube acting on integers 10*i+j for 1 \\spad{<=} \\spad{i} \\spad{<=} 6,{} 1 \\spad{<=} \\spad{j} \\spad{<=8}. \\blankline\\begin{verbatim}Rubik's Cube:   +-----+ +-- B   where: marks Side # :               / U   /|/              /     / |         F(ront)    <->    1      L -->  +-----+ R|         R(ight)    <->    2             |     |  +         U(p)       <->    3             |  F  | /          D(own)     <->    4             |     |/           L(eft)     <->    5             +-----+            B(ack)     <->    6                ^                |                DThe Cube's surface:                               The pieces on each side            +---+              (except the unmoveable center            |567|              piece) are clockwise numbered            |4U8|              from 1 to 8 starting with the            |321|              piece in the upper left        +---+---+---+          corner (see figure on the        |781|123|345|          left).  The moves of the cube        |6L2|8F4|2R6|          are represented as        |543|765|187|          permutations on these pieces.        +---+---+---+          Each of the pieces is            |123|              represented as a two digit            |8D4|              integer ij where i is the            |765|              # of the side ( 1 to 6 for            +---+              F to B (see table above ))            |567|              and j is the # of the piece.            |4B8|            |321|            +---+\\end{verbatim}")) (|janko2| (((|PermutationGroup| (|Integer|))) "\\spad{janko2 constructs} the janko group acting on the integers 1,{}...,{}100.") (((|PermutationGroup| (|Integer|)) (|List| (|Integer|))) "\\spad{janko2(li)} constructs the janko group acting on the 100 integers given in the list {\\em li}. Note: duplicates in the list will be removed. Error: if {\\em li} has less or more than 100 different entries")) (|mathieu24| (((|PermutationGroup| (|Integer|))) "\\spad{mathieu24 constructs} the mathieu group acting on the integers 1,{}...,{}24.") (((|PermutationGroup| (|Integer|)) (|List| (|Integer|))) "\\spad{mathieu24(li)} constructs the mathieu group acting on the 24 integers given in the list {\\em li}. Note: duplicates in the list will be removed. Error: if {\\em li} has less or more than 24 different entries.")) (|mathieu23| (((|PermutationGroup| (|Integer|))) "\\spad{mathieu23 constructs} the mathieu group acting on the integers 1,{}...,{}23.") (((|PermutationGroup| (|Integer|)) (|List| (|Integer|))) "\\spad{mathieu23(li)} constructs the mathieu group acting on the 23 integers given in the list {\\em li}. Note: duplicates in the list will be removed. Error: if {\\em li} has less or more than 23 different entries.")) (|mathieu22| (((|PermutationGroup| (|Integer|))) "\\spad{mathieu22 constructs} the mathieu group acting on the integers 1,{}...,{}22.") (((|PermutationGroup| (|Integer|)) (|List| (|Integer|))) "\\spad{mathieu22(li)} constructs the mathieu group acting on the 22 integers given in the list {\\em li}. Note: duplicates in the list will be removed. Error: if {\\em li} has less or more than 22 different entries.")) (|mathieu12| (((|PermutationGroup| (|Integer|))) "\\spad{mathieu12 constructs} the mathieu group acting on the integers 1,{}...,{}12.") (((|PermutationGroup| (|Integer|)) (|List| (|Integer|))) "\\spad{mathieu12(li)} constructs the mathieu group acting on the 12 integers given in the list {\\em li}. Note: duplicates in the list will be removed Error: if {\\em li} has less or more than 12 different entries.")) (|mathieu11| (((|PermutationGroup| (|Integer|))) "\\spad{mathieu11 constructs} the mathieu group acting on the integers 1,{}...,{}11.") (((|PermutationGroup| (|Integer|)) (|List| (|Integer|))) "\\spad{mathieu11(li)} constructs the mathieu group acting on the 11 integers given in the list {\\em li}. Note: duplicates in the list will be removed. error,{} if {\\em li} has less or more than 11 different entries.")) (|dihedralGroup| (((|PermutationGroup| (|Integer|)) (|List| (|Integer|))) "\\spad{dihedralGroup([i1,...,ik])} constructs the dihedral group of order 2k acting on the integers out of {\\em i1},{}...,{}{\\em ik}. Note: duplicates in the list will be removed.") (((|PermutationGroup| (|Integer|)) (|PositiveInteger|)) "\\spad{dihedralGroup(n)} constructs the dihedral group of order 2n acting on integers 1,{}...,{}\\spad{N}.")) (|cyclicGroup| (((|PermutationGroup| (|Integer|)) (|List| (|Integer|))) "\\spad{cyclicGroup([i1,...,ik])} constructs the cyclic group of order \\spad{k} acting on the integers {\\em i1},{}...,{}{\\em ik}. Note: duplicates in the list will be removed.") (((|PermutationGroup| (|Integer|)) (|PositiveInteger|)) "\\spad{cyclicGroup(n)} constructs the cyclic group of order \\spad{n} acting on the integers 1,{}...,{}\\spad{n}.")) (|abelianGroup| (((|PermutationGroup| (|Integer|)) (|List| (|PositiveInteger|))) "\\spad{abelianGroup([n1,...,nk])} constructs the abelian group that is the direct product of cyclic groups with order {\\em ni}.")) (|alternatingGroup| (((|PermutationGroup| (|Integer|)) (|List| (|Integer|))) "\\spad{alternatingGroup(li)} constructs the alternating group acting on the integers in the list {\\em li},{} generators are in general the {\\em n-2}-cycle {\\em (li.3,...,li.n)} and the 3-cycle {\\em (li.1,li.2,li.3)},{} if \\spad{n} is odd and product of the 2-cycle {\\em (li.1,li.2)} with {\\em n-2}-cycle {\\em (li.3,...,li.n)} and the 3-cycle {\\em (li.1,li.2,li.3)},{} if \\spad{n} is even. Note: duplicates in the list will be removed.") (((|PermutationGroup| (|Integer|)) (|PositiveInteger|)) "\\spad{alternatingGroup(n)} constructs the alternating group {\\em An} acting on the integers 1,{}...,{}\\spad{n},{} generators are in general the {\\em n-2}-cycle {\\em (3,...,n)} and the 3-cycle {\\em (1,2,3)} if \\spad{n} is odd and the product of the 2-cycle {\\em (1,2)} with {\\em n-2}-cycle {\\em (3,...,n)} and the 3-cycle {\\em (1,2,3)} if \\spad{n} is even.")) (|symmetricGroup| (((|PermutationGroup| (|Integer|)) (|List| (|Integer|))) "\\spad{symmetricGroup(li)} constructs the symmetric group acting on the integers in the list {\\em li},{} generators are the cycle given by {\\em li} and the 2-cycle {\\em (li.1,li.2)}. Note: duplicates in the list will be removed.") (((|PermutationGroup| (|Integer|)) (|PositiveInteger|)) "\\spad{symmetricGroup(n)} constructs the symmetric group {\\em Sn} acting on the integers 1,{}...,{}\\spad{n},{} generators are the {\\em n}-cycle {\\em (1,...,n)} and the 2-cycle {\\em (1,2)}."))) 
 NIL 
 NIL 
-(-947 -2174) 
+(-947 -2173) 
 ((|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 
@@ -3732,11 +3732,11 @@ NIL
 ((|constructor| (NIL "\\spadtype{PositiveInteger} provides functions for \\indented{2}{positive integers.}")) (|commutative| ((|attribute| "*") "\\spad{commutative(\"*\")} means multiplication is commutative : x*y = \\spad{y*x}")) (|gcd| (($ $ $) "\\spad{gcd(a,b)} computes the greatest common divisor of two positive integers \\spad{a} and \\spad{b}."))) 
 (((-4509 "*") . T)) 
 NIL 
-(-951 -2174 P) 
+(-951 -2173 P) 
 ((|constructor| (NIL "This package exports interpolation algorithms")) (|LagrangeInterpolation| ((|#2| (|List| |#1|) (|List| |#1|)) "\\spad{LagrangeInterpolation(l1,l2)} \\undocumented"))) 
 NIL 
 NIL 
-(-952 |xx| -2174) 
+(-952 |xx| -2173) 
 ((|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 
@@ -3760,7 +3760,7 @@ NIL
 ((|constructor| (NIL "This package exports plotting tools")) (|calcRanges| (((|List| (|Segment| (|DoubleFloat|))) (|List| (|List| (|Point| (|DoubleFloat|))))) "\\spad{calcRanges(l)} \\undocumented"))) 
 NIL 
 NIL 
-(-958 R -2174) 
+(-958 R -2173) 
 ((|constructor| (NIL "Attaching assertions to symbols for pattern matching; Date Created: 21 Mar 1989 Date Last Updated: 23 May 1990")) (|multiple| ((|#2| |#2|) "\\spad{multiple(x)} tells the pattern matcher that \\spad{x} should preferably match a multi-term quantity in a sum or product. For matching on lists,{} multiple(\\spad{x}) tells the pattern matcher that \\spad{x} should match a list instead of an element of a list. Error: if \\spad{x} is not a symbol.")) (|optional| ((|#2| |#2|) "\\spad{optional(x)} tells the pattern matcher that \\spad{x} can match an identity (0 in a sum,{} 1 in a product or exponentiation). Error: if \\spad{x} is not a symbol.")) (|constant| ((|#2| |#2|) "\\spad{constant(x)} tells the pattern matcher that \\spad{x} should match only the symbol \\spad{'x} and no other quantity. Error: if \\spad{x} is not a symbol.")) (|assert| ((|#2| |#2| (|Identifier|)) "\\spad{assert(x, s)} makes the assertion \\spad{s} about \\spad{x}. Error: if \\spad{x} is not a symbol."))) 
 NIL 
 NIL 
@@ -3772,7 +3772,7 @@ NIL
 ((|constructor| (NIL "This packages provides tools for matching recursively in type towers.")) (|patternMatch| (((|PatternMatchResult| |#1| |#3|) |#2| (|Pattern| |#1|) (|PatternMatchResult| |#1| |#3|)) "\\spad{patternMatch(expr, pat, res)} matches the pattern \\spad{pat} to the expression \\spad{expr}; res contains the variables of \\spad{pat} which are already matched and their matches. Note: this function handles type towers by changing the predicates and calling the matching function provided by \\spad{A}.")) (|fixPredicate| (((|Mapping| (|Boolean|) |#2|) (|Mapping| (|Boolean|) |#3|)) "\\spad{fixPredicate(f)} returns \\spad{g} defined by \\spad{g}(a) = \\spad{f}(a::B)."))) 
 NIL 
 NIL 
-(-961 S R -2174) 
+(-961 S R -2173) 
 ((|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 
@@ -3792,7 +3792,7 @@ NIL
 ((|constructor| (NIL "This package provides pattern matching functions on polynomials.")) (|patternMatch| (((|PatternMatchResult| |#1| |#5|) |#5| (|Pattern| |#1|) (|PatternMatchResult| |#1| |#5|)) "\\spad{patternMatch(p, pat, res)} matches the pattern \\spad{pat} to the polynomial \\spad{p}; res contains the variables of \\spad{pat} which are already matched and their matches.") (((|PatternMatchResult| |#1| |#5|) |#5| (|Pattern| |#1|) (|PatternMatchResult| |#1| |#5|) (|Mapping| (|PatternMatchResult| |#1| |#5|) |#3| (|Pattern| |#1|) (|PatternMatchResult| |#1| |#5|))) "\\spad{patternMatch(p, pat, res, vmatch)} matches the pattern \\spad{pat} to the polynomial \\spad{p}. \\spad{res} contains the variables of \\spad{pat} which are already matched and their matches; vmatch is the matching function to use on the variables."))) 
 NIL 
 ((|HasCategory| |#3| (LIST (QUOTE -911) (|devaluate| |#1|)))) 
-(-966 R -2174 -4247) 
+(-966 R -2173 -4247) 
 ((|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 
@@ -3844,7 +3844,7 @@ NIL
 ((|constructor| (NIL "The category for general multi-variate polynomials over a ring \\spad{R},{} in variables from VarSet,{} with exponents from the \\spadtype{OrderedAbelianMonoidSup}.")) (|canonicalUnitNormal| ((|attribute|) "we can choose a unique representative for each associate class. This normalization is chosen to be normalization of leading coefficient (by default).")) (|squareFreePart| (($ $) "\\spad{squareFreePart(p)} returns product of all the irreducible factors of polynomial \\spad{p} each taken with multiplicity one.")) (|squareFree| (((|Factored| $) $) "\\spad{squareFree(p)} returns the square free factorization of the polynomial \\spad{p}.")) (|primitivePart| (($ $ |#3|) "\\spad{primitivePart(p,v)} returns the unitCanonical associate of the polynomial \\spad{p} with its content with respect to the variable \\spad{v} divided out.") (($ $) "\\spad{primitivePart(p)} returns the unitCanonical associate of the polynomial \\spad{p} with its content divided out.")) (|content| (($ $ |#3|) "\\spad{content(p,v)} is the \\spad{gcd} of the coefficients of the polynomial \\spad{p} when \\spad{p} is viewed as a univariate polynomial with respect to the variable \\spad{v}. Thus,{} for polynomial 7*x**2*y + 14*x*y**2,{} the \\spad{gcd} of the coefficients with respect to \\spad{x} is 7*y.")) (|discriminant| (($ $ |#3|) "\\spad{discriminant(p,v)} returns the disriminant of the polynomial \\spad{p} with respect to the variable \\spad{v}.")) (|resultant| (($ $ $ |#3|) "\\spad{resultant(p,q,v)} returns the resultant of the polynomials \\spad{p} and \\spad{q} with respect to the variable \\spad{v}.")) (|primitiveMonomials| (((|List| $) $) "\\spad{primitiveMonomials(p)} gives the list of monomials of the polynomial \\spad{p} with their coefficients removed. Note: \\spad{primitiveMonomials(sum(a_(i) X^(i))) = [X^(1),...,X^(n)]}.")) (|variables| (((|List| |#3|) $) "\\spad{variables(p)} returns the list of those variables actually appearing in the polynomial \\spad{p}.")) (|totalDegree| (((|NonNegativeInteger|) $ (|List| |#3|)) "\\spad{totalDegree(p, lv)} returns the maximum sum (over all monomials of polynomial \\spad{p}) of the variables in the list \\spad{lv}.") (((|NonNegativeInteger|) $) "\\spad{totalDegree(p)} returns the largest sum over all monomials of all exponents of a monomial.")) (|isExpt| (((|Union| (|Record| (|:| |var| |#3|) (|:| |exponent| (|NonNegativeInteger|))) "failed") $) "\\spad{isExpt(p)} returns \\spad{[x, n]} if polynomial \\spad{p} has the form \\spad{x**n} and \\spad{n > 0}.")) (|isTimes| (((|Union| (|List| $) "failed") $) "\\spad{isTimes(p)} returns \\spad{[a1,...,an]} if polynomial \\spad{p = a1 ... an} and \\spad{n >= 2},{} and,{} for each \\spad{i},{} \\spad{ai} is either a nontrivial constant in \\spad{R} or else of the form \\spad{x**e},{} where \\spad{e > 0} is an integer and \\spad{x} in a member of VarSet.")) (|isPlus| (((|Union| (|List| $) "failed") $) "\\spad{isPlus(p)} returns \\spad{[m1,...,mn]} if polynomial \\spad{p = m1 + ... + mn} and \\spad{n >= 2} and each \\spad{mi} is a nonzero monomial.")) (|multivariate| (($ (|SparseUnivariatePolynomial| $) |#3|) "\\spad{multivariate(sup,v)} converts an anonymous univariable polynomial \\spad{sup} to a polynomial in the variable \\spad{v}.") (($ (|SparseUnivariatePolynomial| |#1|) |#3|) "\\spad{multivariate(sup,v)} converts an anonymous univariable polynomial \\spad{sup} to a polynomial in the variable \\spad{v}.")) (|monomial| (($ $ (|List| |#3|) (|List| (|NonNegativeInteger|))) "\\spad{monomial(a,[v1..vn],[e1..en])} returns \\spad{a*prod(vi**ei)}.") (($ $ |#3| (|NonNegativeInteger|)) "\\spad{monomial(a,x,n)} creates the monomial \\spad{a*x**n} where \\spad{a} is a polynomial,{} \\spad{x} is a variable and \\spad{n} is a nonnegative integer.")) (|monicDivide| (((|Record| (|:| |quotient| $) (|:| |remainder| $)) $ $ |#3|) "\\spad{monicDivide(a,b,v)} divides the polynomial a by the polynomial \\spad{b},{} with each viewed as a univariate polynomial in \\spad{v} returning both the quotient and remainder. Error: if \\spad{b} is not monic with respect to \\spad{v}.")) (|minimumDegree| (((|List| (|NonNegativeInteger|)) $ (|List| |#3|)) "\\spad{minimumDegree(p, lv)} gives the list of minimum degrees of the polynomial \\spad{p} with respect to each of the variables in the list \\spad{lv}") (((|NonNegativeInteger|) $ |#3|) "\\spad{minimumDegree(p,v)} gives the minimum degree of polynomial \\spad{p} with respect to \\spad{v},{} \\spadignore{i.e.} viewed a univariate polynomial in \\spad{v}")) (|mainVariable| (((|Union| |#3| "failed") $) "\\spad{mainVariable(p)} returns the biggest variable which actually occurs in the polynomial \\spad{p},{} or \"failed\" if no variables are present. fails precisely if polynomial satisfies ground?")) (|univariate| (((|SparseUnivariatePolynomial| |#1|) $) "\\spad{univariate(p)} converts the multivariate polynomial \\spad{p},{} which should actually involve only one variable,{} into a univariate polynomial in that variable,{} whose coefficients are in the ground ring. Error: if polynomial is genuinely multivariate") (((|SparseUnivariatePolynomial| $) $ |#3|) "\\spad{univariate(p,v)} converts the multivariate polynomial \\spad{p} into a univariate polynomial in \\spad{v},{} whose coefficients are still multivariate polynomials (in all the other variables).")) (|monomials| (((|List| $) $) "\\spad{monomials(p)} returns the list of non-zero monomials of polynomial \\spad{p},{} \\spadignore{i.e.} \\spad{monomials(sum(a_(i) X^(i))) = [a_(1) X^(1),...,a_(n) X^(n)]}.")) (|coefficient| (($ $ (|List| |#3|) (|List| (|NonNegativeInteger|))) "\\spad{coefficient(p, lv, ln)} views the polynomial \\spad{p} as a polynomial in the variables of \\spad{lv} and returns the coefficient of the term \\spad{lv**ln},{} \\spadignore{i.e.} \\spad{prod(lv_i ** ln_i)}.") (($ $ |#3| (|NonNegativeInteger|)) "\\spad{coefficient(p,v,n)} views the polynomial \\spad{p} as a univariate polynomial in \\spad{v} and returns the coefficient of the \\spad{v**n} term.")) (|degree| (((|List| (|NonNegativeInteger|)) $ (|List| |#3|)) "\\spad{degree(p,lv)} gives the list of degrees of polynomial \\spad{p} with respect to each of the variables in the list \\spad{lv}.") (((|NonNegativeInteger|) $ |#3|) "\\spad{degree(p,v)} gives the degree of polynomial \\spad{p} with respect to the variable \\spad{v}."))) 
 (((-4509 "*") |has| |#1| (-175)) (-4500 |has| |#1| (-570)) (-4505 |has| |#1| (-6 -4505)) (-4502 . T) (-4501 . T) (-4504 . T)) 
 NIL 
-(-979 E V R P -2174) 
+(-979 E V R P -2173) 
 ((|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 
@@ -3856,7 +3856,7 @@ NIL
 ((|constructor| (NIL "\\indented{2}{This type is the basic representation of sparse recursive multivariate} polynomials whose variables are arbitrary symbols. The ordering is alphabetic determined by the Symbol type. The coefficient ring may be non commutative,{} but the variables are assumed to commute.")) (|integrate| (($ $ (|Symbol|)) "\\spad{integrate(p,x)} computes the integral of \\spad{p*dx},{} \\spadignore{i.e.} integrates the polynomial \\spad{p} with respect to the variable \\spad{x}."))) 
 (((-4509 "*") |has| |#1| (-175)) (-4500 |has| |#1| (-570)) (-4505 |has| |#1| (-6 -4505)) (-4502 . T) (-4501 . T) (-4504 . T)) 
 ((|HasCategory| |#1| (QUOTE (-938))) (-2225 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-570))) (|HasCategory| |#1| (QUOTE (-938)))) (-2225 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-570))) (|HasCategory| |#1| (QUOTE (-938)))) (-2225 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-938)))) (|HasCategory| |#1| (QUOTE (-570))) (|HasCategory| |#1| (QUOTE (-175))) (-2225 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-570)))) (-12 (|HasCategory| (-1207) (LIST (QUOTE -911) (QUOTE (-392)))) (|HasCategory| |#1| (LIST (QUOTE -911) (QUOTE (-392))))) (-12 (|HasCategory| (-1207) (LIST (QUOTE -911) (QUOTE (-578)))) (|HasCategory| |#1| (LIST (QUOTE -911) (QUOTE (-578))))) (-12 (|HasCategory| (-1207) (LIST (QUOTE -633) (LIST (QUOTE -917) (QUOTE (-392))))) (|HasCategory| |#1| (LIST (QUOTE -633) (LIST (QUOTE -917) (QUOTE (-392)))))) (-12 (|HasCategory| (-1207) (LIST (QUOTE -633) (LIST (QUOTE -917) (QUOTE (-578))))) (|HasCategory| |#1| (LIST (QUOTE -633) (LIST (QUOTE -917) (QUOTE (-578)))))) (-12 (|HasCategory| (-1207) (LIST (QUOTE -633) (QUOTE (-550)))) (|HasCategory| |#1| (LIST (QUOTE -633) (QUOTE (-550))))) (|HasCategory| |#1| (LIST (QUOTE -660) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasCategory| |#1| (LIST (QUOTE -1069) (QUOTE (-578)))) (-2225 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasCategory| |#1| (LIST (QUOTE -1069) (LIST (QUOTE -421) (QUOTE (-578)))))) (|HasCategory| |#1| (LIST (QUOTE -1069) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasCategory| |#1| (QUOTE (-376))) (|HasAttribute| |#1| (QUOTE -4505)) (|HasCategory| |#1| (QUOTE (-466))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-938)))) (-2225 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-938)))) (|HasCategory| |#1| (QUOTE (-147))))) 
-(-982 E V R P -2174) 
+(-982 E V R P -2173) 
 ((|constructor| (NIL "computes \\spad{n}-th roots of quotients of multivariate polynomials")) (|nthr| (((|Record| (|:| |exponent| (|NonNegativeInteger|)) (|:| |coef| |#4|) (|:| |radicand| (|List| |#4|))) |#4| (|NonNegativeInteger|)) "\\spad{nthr(p,n)} should be local but conditional")) (|froot| (((|Record| (|:| |exponent| (|NonNegativeInteger|)) (|:| |coef| |#5|) (|:| |radicand| |#5|)) |#5| (|NonNegativeInteger|)) "\\spad{froot(f, n)} returns \\spad{[m,c,r]} such that \\spad{f**(1/n) = c * r**(1/m)}.")) (|qroot| (((|Record| (|:| |exponent| (|NonNegativeInteger|)) (|:| |coef| |#5|) (|:| |radicand| |#5|)) (|Fraction| (|Integer|)) (|NonNegativeInteger|)) "\\spad{qroot(f, n)} returns \\spad{[m,c,r]} such that \\spad{f**(1/n) = c * r**(1/m)}.")) (|rroot| (((|Record| (|:| |exponent| (|NonNegativeInteger|)) (|:| |coef| |#5|) (|:| |radicand| |#5|)) |#3| (|NonNegativeInteger|)) "\\spad{rroot(f, n)} returns \\spad{[m,c,r]} such that \\spad{f**(1/n) = c * r**(1/m)}.")) (|denom| ((|#4| $) "\\spad{denom(x)} \\undocumented")) (|numer| ((|#4| $) "\\spad{numer(x)} \\undocumented"))) 
 NIL 
 ((|HasCategory| |#3| (QUOTE (-466)))) 
@@ -3884,7 +3884,7 @@ NIL
 ((|constructor| (NIL "Category for the functions defined by integrals.")) (|integral| (($ $ (|SegmentBinding| $)) "\\spad{integral(f, x = a..b)} returns the formal definite integral of \\spad{f} \\spad{dx} for \\spad{x} between \\spad{a} and \\spad{b}.") (($ $ (|Symbol|)) "\\spad{integral(f, x)} returns the formal integral of \\spad{f} \\spad{dx}."))) 
 NIL 
 NIL 
-(-989 -2174) 
+(-989 -2173) 
 ((|constructor| (NIL "PrimitiveElement provides functions to compute primitive elements in algebraic extensions.")) (|primitiveElement| (((|Record| (|:| |coef| (|List| (|Integer|))) (|:| |poly| (|List| (|SparseUnivariatePolynomial| |#1|))) (|:| |prim| (|SparseUnivariatePolynomial| |#1|))) (|List| (|Polynomial| |#1|)) (|List| (|Symbol|)) (|Symbol|)) "\\spad{primitiveElement([p1,...,pn], [a1,...,an], a)} returns \\spad{[[c1,...,cn], [q1,...,qn], q]} such that then \\spad{k(a1,...,an) = k(a)},{} where \\spad{a = a1 c1 + ... + an cn},{} \\spad{ai = qi(a)},{} and \\spad{q(a) = 0}. The \\spad{pi}\\spad{'s} are the defining polynomials for the \\spad{ai}\\spad{'s}. This operation uses the technique of \\spadglossSee{groebner bases}{Groebner basis}.") (((|Record| (|:| |coef| (|List| (|Integer|))) (|:| |poly| (|List| (|SparseUnivariatePolynomial| |#1|))) (|:| |prim| (|SparseUnivariatePolynomial| |#1|))) (|List| (|Polynomial| |#1|)) (|List| (|Symbol|))) "\\spad{primitiveElement([p1,...,pn], [a1,...,an])} returns \\spad{[[c1,...,cn], [q1,...,qn], q]} such that then \\spad{k(a1,...,an) = k(a)},{} where \\spad{a = a1 c1 + ... + an cn},{} \\spad{ai = qi(a)},{} and \\spad{q(a) = 0}. The \\spad{pi}\\spad{'s} are the defining polynomials for the \\spad{ai}\\spad{'s}. This operation uses the technique of \\spadglossSee{groebner bases}{Groebner basis}.") (((|Record| (|:| |coef1| (|Integer|)) (|:| |coef2| (|Integer|)) (|:| |prim| (|SparseUnivariatePolynomial| |#1|))) (|Polynomial| |#1|) (|Symbol|) (|Polynomial| |#1|) (|Symbol|)) "\\spad{primitiveElement(p1, a1, p2, a2)} returns \\spad{[c1, c2, q]} such that \\spad{k(a1, a2) = k(a)} where \\spad{a = c1 a1 + c2 a2, and q(a) = 0}. The \\spad{pi}\\spad{'s} are the defining polynomials for the \\spad{ai}\\spad{'s}. The \\spad{p2} may involve \\spad{a1},{} but \\spad{p1} must not involve a2. This operation uses \\spadfun{resultant}."))) 
 NIL 
 NIL 
@@ -3992,7 +3992,7 @@ NIL
 ((|constructor| (NIL "This package \\undocumented{}")) (|map| ((|#4| (|Mapping| |#4| (|Polynomial| |#1|)) |#4|) "\\spad{map(f,p)} \\undocumented{}")) (|pushup| ((|#4| |#4| (|List| |#3|)) "\\spad{pushup(p,lv)} \\undocumented{}") ((|#4| |#4| |#3|) "\\spad{pushup(p,v)} \\undocumented{}")) (|pushdown| ((|#4| |#4| (|List| |#3|)) "\\spad{pushdown(p,lv)} \\undocumented{}") ((|#4| |#4| |#3|) "\\spad{pushdown(p,v)} \\undocumented{}")) (|variable| (((|Union| $ "failed") (|Symbol|)) "\\spad{variable(s)} makes an element from symbol \\spad{s} or fails")) (|convert| (((|Symbol|) $) "\\spad{convert(x)} converts \\spad{x} to a symbol"))) 
 NIL 
 NIL 
-(-1016 K R UP -2174) 
+(-1016 K R UP -2173) 
 ((|constructor| (NIL "In this package \\spad{K} is a finite field,{} \\spad{R} is a ring of univariate polynomials over \\spad{K},{} and \\spad{F} is a monogenic algebra over \\spad{R}. We require that \\spad{F} is monogenic,{} \\spadignore{i.e.} that \\spad{F = K[x,y]/(f(x,y))},{} because the integral basis algorithm used will factor the polynomial \\spad{f(x,y)}. The package provides a function to compute the integral closure of \\spad{R} in the quotient field of \\spad{F} as well as a function to compute a \"local integral basis\" at a specific prime.")) (|reducedDiscriminant| ((|#2| |#3|) "\\spad{reducedDiscriminant(up)} \\undocumented")) (|localIntegralBasis| (((|Record| (|:| |basis| (|Matrix| |#2|)) (|:| |basisDen| |#2|) (|:| |basisInv| (|Matrix| |#2|))) |#2|) "\\spad{integralBasis(p)} returns a record \\spad{[basis,basisDen,basisInv] } containing information regarding the local integral closure of \\spad{R} at the prime \\spad{p} in the quotient field of the framed algebra \\spad{F}. \\spad{F} is a framed algebra with \\spad{R}-module basis \\spad{w1,w2,...,wn}. If 'basis' is the matrix \\spad{(aij, i = 1..n, j = 1..n)},{} then the \\spad{i}th element of the local integral basis is \\spad{vi = (1/basisDen) * sum(aij * wj, j = 1..n)},{} \\spadignore{i.e.} the \\spad{i}th row of 'basis' contains the coordinates of the \\spad{i}th basis vector. Similarly,{} the \\spad{i}th row of the matrix 'basisInv' contains the coordinates of \\spad{wi} with respect to the basis \\spad{v1,...,vn}: if 'basisInv' is the matrix \\spad{(bij, i = 1..n, j = 1..n)},{} then \\spad{wi = sum(bij * vj, j = 1..n)}.")) (|integralBasis| (((|Record| (|:| |basis| (|Matrix| |#2|)) (|:| |basisDen| |#2|) (|:| |basisInv| (|Matrix| |#2|)))) "\\spad{integralBasis()} returns a record \\spad{[basis,basisDen,basisInv] } containing information regarding the integral closure of \\spad{R} in the quotient field of the framed algebra \\spad{F}. \\spad{F} is a framed algebra with \\spad{R}-module basis \\spad{w1,w2,...,wn}. If 'basis' is the matrix \\spad{(aij, i = 1..n, j = 1..n)},{} then the \\spad{i}th element of the integral basis is \\spad{vi = (1/basisDen) * sum(aij * wj, j = 1..n)},{} \\spadignore{i.e.} the \\spad{i}th row of 'basis' contains the coordinates of the \\spad{i}th basis vector. Similarly,{} the \\spad{i}th row of the matrix 'basisInv' contains the coordinates of \\spad{wi} with respect to the basis \\spad{v1,...,vn}: if 'basisInv' is the matrix \\spad{(bij, i = 1..n, j = 1..n)},{} then \\spad{wi = sum(bij * vj, j = 1..n)}."))) 
 NIL 
 NIL 
@@ -4064,7 +4064,7 @@ NIL
 ((|constructor| (NIL "The \\spad{RadicalCategory} is a model for the rational numbers.")) (** (($ $ (|Fraction| (|Integer|))) "\\spad{x ** y} is the rational exponentiation of \\spad{x} by the power \\spad{y}.")) (|nthRoot| (($ $ (|Integer|)) "\\spad{nthRoot(x,n)} returns the \\spad{n}th root of \\spad{x}.")) (|sqrt| (($ $) "\\spad{sqrt(x)} returns the square root of \\spad{x}."))) 
 NIL 
 NIL 
-(-1034 -2174 UP UPUP |radicnd| |n|) 
+(-1034 -2173 UP UPUP |radicnd| |n|) 
 ((|constructor| (NIL "Function field defined by y**n = \\spad{f}(\\spad{x})."))) 
 ((-4500 |has| (-421 |#2|) (-376)) (-4505 |has| (-421 |#2|) (-376)) (-4499 |has| (-421 |#2|) (-376)) ((-4509 "*") . T) (-4501 . T) (-4502 . T) (-4504 . T)) 
 ((|HasCategory| (-421 |#2|) (QUOTE (-147))) (|HasCategory| (-421 |#2|) (QUOTE (-149))) (|HasCategory| (-421 |#2|) (QUOTE (-362))) (-2225 (|HasCategory| (-421 |#2|) (QUOTE (-376))) (|HasCategory| (-421 |#2|) (QUOTE (-362)))) (|HasCategory| (-421 |#2|) (QUOTE (-376))) (|HasCategory| (-421 |#2|) (QUOTE (-381))) (-2225 (-12 (|HasCategory| (-421 |#2|) (QUOTE (-240))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (|HasCategory| (-421 |#2|) (QUOTE (-362)))) (-2225 (-12 (|HasCategory| (-421 |#2|) (QUOTE (-240))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (-12 (|HasCategory| (-421 |#2|) (QUOTE (-239))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (|HasCategory| (-421 |#2|) (QUOTE (-362)))) (-2225 (-12 (|HasCategory| (-421 |#2|) (LIST (QUOTE -927) (QUOTE (-1207)))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (-12 (|HasCategory| (-421 |#2|) (LIST (QUOTE -927) (QUOTE (-1207)))) (|HasCategory| (-421 |#2|) (QUOTE (-362))))) (-2225 (-12 (|HasCategory| (-421 |#2|) (LIST (QUOTE -927) (QUOTE (-1207)))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (-12 (|HasCategory| (-421 |#2|) (LIST (QUOTE -929) (QUOTE (-1207)))) (|HasCategory| (-421 |#2|) (QUOTE (-376))))) (|HasCategory| (-421 |#2|) (LIST (QUOTE -660) (QUOTE (-578)))) (-2225 (|HasCategory| (-421 |#2|) (LIST (QUOTE -1069) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (|HasCategory| (-421 |#2|) (LIST (QUOTE -1069) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasCategory| (-421 |#2|) (LIST (QUOTE -1069) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-381))) (-12 (|HasCategory| (-421 |#2|) (QUOTE (-239))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (-12 (|HasCategory| (-421 |#2|) (LIST (QUOTE -929) (QUOTE (-1207)))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (-12 (|HasCategory| (-421 |#2|) (QUOTE (-240))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (-12 (|HasCategory| (-421 |#2|) (LIST (QUOTE -927) (QUOTE (-1207)))) (|HasCategory| (-421 |#2|) (QUOTE (-376))))) 
@@ -4104,19 +4104,19 @@ NIL
 ((|constructor| (NIL "\\axiomType{RealClosedField} provides common acces functions for all real closed fields.")) (|approximate| (((|Fraction| (|Integer|)) $ $) "\\axiom{approximate(\\spad{n},{}\\spad{p})} gives an approximation of \\axiom{\\spad{n}} that has precision \\axiom{\\spad{p}}")) (|rename| (($ $ (|OutputForm|)) "\\axiom{rename(\\spad{x},{}name)} gives a new number that prints as name")) (|rename!| (($ $ (|OutputForm|)) "\\axiom{rename!(\\spad{x},{}name)} changes the way \\axiom{\\spad{x}} is printed")) (|sqrt| (($ (|Integer|)) "\\axiom{sqrt(\\spad{x})} is \\axiom{\\spad{x} \\spad{**} (1/2)}") (($ (|Fraction| (|Integer|))) "\\axiom{sqrt(\\spad{x})} is \\axiom{\\spad{x} \\spad{**} (1/2)}") (($ $) "\\axiom{sqrt(\\spad{x})} is \\axiom{\\spad{x} \\spad{**} (1/2)}") (($ $ (|PositiveInteger|)) "\\axiom{sqrt(\\spad{x},{}\\spad{n})} is \\axiom{\\spad{x} \\spad{**} (1/n)}")) (|allRootsOf| (((|List| $) (|Polynomial| (|Integer|))) "\\axiom{allRootsOf(pol)} creates all the roots of \\axiom{pol} naming each uniquely") (((|List| $) (|Polynomial| (|Fraction| (|Integer|)))) "\\axiom{allRootsOf(pol)} creates all the roots of \\axiom{pol} naming each uniquely") (((|List| $) (|Polynomial| $)) "\\axiom{allRootsOf(pol)} creates all the roots of \\axiom{pol} naming each uniquely") (((|List| $) (|SparseUnivariatePolynomial| (|Integer|))) "\\axiom{allRootsOf(pol)} creates all the roots of \\axiom{pol} naming each uniquely") (((|List| $) (|SparseUnivariatePolynomial| (|Fraction| (|Integer|)))) "\\axiom{allRootsOf(pol)} creates all the roots of \\axiom{pol} naming each uniquely") (((|List| $) (|SparseUnivariatePolynomial| $)) "\\axiom{allRootsOf(pol)} creates all the roots of \\axiom{pol} naming each uniquely")) (|rootOf| (((|Union| $ "failed") (|SparseUnivariatePolynomial| $) (|PositiveInteger|)) "\\axiom{rootOf(pol,{}\\spad{n})} creates the \\spad{n}th root for the order of \\axiom{pol} and gives it unique name") (((|Union| $ "failed") (|SparseUnivariatePolynomial| $) (|PositiveInteger|) (|OutputForm|)) "\\axiom{rootOf(pol,{}\\spad{n},{}name)} creates the \\spad{n}th root for the order of \\axiom{pol} and names it \\axiom{name}")) (|mainValue| (((|Union| (|SparseUnivariatePolynomial| $) "failed") $) "\\axiom{mainValue(\\spad{x})} is the expression of \\axiom{\\spad{x}} in terms of \\axiom{SparseUnivariatePolynomial(\\$)}")) (|mainDefiningPolynomial| (((|Union| (|SparseUnivariatePolynomial| $) "failed") $) "\\axiom{mainDefiningPolynomial(\\spad{x})} is the defining polynomial for the main algebraic quantity of \\axiom{\\spad{x}}")) (|mainForm| (((|Union| (|OutputForm|) "failed") $) "\\axiom{mainForm(\\spad{x})} is the main algebraic quantity name of \\axiom{\\spad{x}}"))) 
 ((-4500 . T) (-4505 . T) (-4499 . T) (-4502 . T) (-4501 . T) ((-4509 "*") . T) (-4504 . T)) 
 NIL 
-(-1044 R -2174) 
+(-1044 R -2173) 
 ((|constructor| (NIL "\\indented{1}{Risch differential equation,{} elementary case.} Author: Manuel Bronstein Date Created: 1 February 1988 Date Last Updated: 2 November 1995 Keywords: elementary,{} function,{} integration.")) (|rischDE| (((|Record| (|:| |ans| |#2|) (|:| |right| |#2|) (|:| |sol?| (|Boolean|))) (|Integer|) |#2| |#2| (|Symbol|) (|Mapping| (|Union| (|Record| (|:| |mainpart| |#2|) (|:| |limitedlogs| (|List| (|Record| (|:| |coeff| |#2|) (|:| |logand| |#2|))))) "failed") |#2| (|List| |#2|)) (|Mapping| (|Union| (|Record| (|:| |ratpart| |#2|) (|:| |coeff| |#2|)) "failed") |#2| |#2|)) "\\spad{rischDE(n, f, g, x, lim, ext)} returns \\spad{[y, h, b]} such that \\spad{dy/dx + n df/dx y = h} and \\spad{b := h = g}. The equation \\spad{dy/dx + n df/dx y = g} has no solution if \\spad{h \\~~= g} (\\spad{y} is a partial solution in that case). Notes: \\spad{lim} is a limited integration function,{} and ext is an extended integration function."))) 
 NIL 
 NIL 
-(-1045 R -2174) 
+(-1045 R -2173) 
 ((|constructor| (NIL "\\indented{1}{Risch differential equation,{} elementary case.} Author: Manuel Bronstein Date Created: 12 August 1992 Date Last Updated: 17 August 1992 Keywords: elementary,{} function,{} integration.")) (|rischDEsys| (((|Union| (|List| |#2|) "failed") (|Integer|) |#2| |#2| |#2| (|Symbol|) (|Mapping| (|Union| (|Record| (|:| |mainpart| |#2|) (|:| |limitedlogs| (|List| (|Record| (|:| |coeff| |#2|) (|:| |logand| |#2|))))) "failed") |#2| (|List| |#2|)) (|Mapping| (|Union| (|Record| (|:| |ratpart| |#2|) (|:| |coeff| |#2|)) "failed") |#2| |#2|)) "\\spad{rischDEsys(n, f, g_1, g_2, x,lim,ext)} returns \\spad{y_1.y_2} such that \\spad{(dy1/dx,dy2/dx) + ((0, - n df/dx),(n df/dx,0)) (y1,y2) = (g1,g2)} if \\spad{y_1,y_2} exist,{} \"failed\" otherwise. \\spad{lim} is a limited integration function,{} \\spad{ext} is an extended integration function."))) 
 NIL 
 NIL 
-(-1046 -2174 UP) 
+(-1046 -2173 UP) 
 ((|constructor| (NIL "\\indented{1}{Risch differential equation,{} transcendental case.} Author: Manuel Bronstein Date Created: Jan 1988 Date Last Updated: 2 November 1995")) (|polyRDE| (((|Union| (|:| |ans| (|Record| (|:| |ans| |#2|) (|:| |nosol| (|Boolean|)))) (|:| |eq| (|Record| (|:| |b| |#2|) (|:| |c| |#2|) (|:| |m| (|Integer|)) (|:| |alpha| |#2|) (|:| |beta| |#2|)))) |#2| |#2| |#2| (|Integer|) (|Mapping| |#2| |#2|)) "\\spad{polyRDE(a, B, C, n, D)} returns either: 1. \\spad{[Q, b]} such that \\spad{degree(Q) <= n} and \\indented{3}{\\spad{a Q'+ B Q = C} if \\spad{b = true},{} \\spad{Q} is a partial solution} \\indented{3}{otherwise.} 2. \\spad{[B1, C1, m, \\alpha, \\beta]} such that any polynomial solution \\indented{3}{of degree at most \\spad{n} of \\spad{A Q' + BQ = C} must be of the form} \\indented{3}{\\spad{Q = \\alpha H + \\beta} where \\spad{degree(H) <= m} and} \\indented{3}{\\spad{H} satisfies \\spad{H' + B1 H = C1}.} \\spad{D} is the derivation to use.")) (|baseRDE| (((|Record| (|:| |ans| (|Fraction| |#2|)) (|:| |nosol| (|Boolean|))) (|Fraction| |#2|) (|Fraction| |#2|)) "\\spad{baseRDE(f, g)} returns a \\spad{[y, b]} such that \\spad{y' + fy = g} if \\spad{b = true},{} \\spad{y} is a partial solution otherwise (no solution in that case). \\spad{D} is the derivation to use.")) (|monomRDE| (((|Union| (|Record| (|:| |a| |#2|) (|:| |b| (|Fraction| |#2|)) (|:| |c| (|Fraction| |#2|)) (|:| |t| |#2|)) "failed") (|Fraction| |#2|) (|Fraction| |#2|) (|Mapping| |#2| |#2|)) "\\spad{monomRDE(f,g,D)} returns \\spad{[A, B, C, T]} such that \\spad{y' + f y = g} has a solution if and only if \\spad{y = Q / T},{} where \\spad{Q} satisfies \\spad{A Q' + B Q = C} and has no normal pole. A and \\spad{T} are polynomials and \\spad{B} and \\spad{C} have no normal poles. \\spad{D} is the derivation to use."))) 
 NIL 
 NIL 
-(-1047 -2174 UP) 
+(-1047 -2173 UP) 
 ((|constructor| (NIL "\\indented{1}{Risch differential equation system,{} transcendental case.} Author: Manuel Bronstein Date Created: 17 August 1992 Date Last Updated: 3 February 1994")) (|baseRDEsys| (((|Union| (|List| (|Fraction| |#2|)) "failed") (|Fraction| |#2|) (|Fraction| |#2|) (|Fraction| |#2|)) "\\spad{baseRDEsys(f, g1, g2)} returns fractions \\spad{y_1.y_2} such that \\spad{(y1', y2') + ((0, -f), (f, 0)) (y1,y2) = (g1,g2)} if \\spad{y_1,y_2} exist,{} \"failed\" otherwise.")) (|monomRDEsys| (((|Union| (|Record| (|:| |a| |#2|) (|:| |b| (|Fraction| |#2|)) (|:| |h| |#2|) (|:| |c1| (|Fraction| |#2|)) (|:| |c2| (|Fraction| |#2|)) (|:| |t| |#2|)) "failed") (|Fraction| |#2|) (|Fraction| |#2|) (|Fraction| |#2|) (|Mapping| |#2| |#2|)) "\\spad{monomRDEsys(f,g1,g2,D)} returns \\spad{[A, B, H, C1, C2, T]} such that \\spad{(y1', y2') + ((0, -f), (f, 0)) (y1,y2) = (g1,g2)} has a solution if and only if \\spad{y1 = Q1 / T, y2 = Q2 / T},{} where \\spad{B,C1,C2,Q1,Q2} have no normal poles and satisfy A \\spad{(Q1', Q2') + ((H, -B), (B, H)) (Q1,Q2) = (C1,C2)} \\spad{D} is the derivation to use."))) 
 NIL 
 NIL 
@@ -4152,7 +4152,7 @@ NIL
 ((|constructor| (NIL "This domain implements the real closure of an ordered field.")) (|relativeApprox| (((|Fraction| (|Integer|)) $ $) "\\axiom{relativeApprox(\\spad{n},{}\\spad{p})} gives a relative approximation of \\axiom{\\spad{n}} that has precision \\axiom{\\spad{p}}")) (|mainCharacterization| (((|Union| (|RightOpenIntervalRootCharacterization| $ (|SparseUnivariatePolynomial| $)) "failed") $) "\\axiom{mainCharacterization(\\spad{x})} is the main algebraic quantity of \\axiom{\\spad{x}} (\\axiom{SEG})")) (|algebraicOf| (($ (|RightOpenIntervalRootCharacterization| $ (|SparseUnivariatePolynomial| $)) (|OutputForm|)) "\\axiom{algebraicOf(char)} is the external number"))) 
 ((-4500 . T) (-4505 . T) (-4499 . T) (-4502 . T) (-4501 . T) ((-4509 "*") . T) (-4504 . T)) 
 ((-2225 (|HasCategory| (-421 (-578)) (LIST (QUOTE -1069) (QUOTE (-578)))) (|HasCategory| |#1| (LIST (QUOTE -1069) (QUOTE (-578))))) (|HasCategory| |#1| (LIST (QUOTE -1069) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasCategory| |#1| (LIST (QUOTE -1069) (QUOTE (-578)))) (|HasCategory| (-421 (-578)) (LIST (QUOTE -1069) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasCategory| (-421 (-578)) (LIST (QUOTE -1069) (QUOTE (-578))))) 
-(-1056 -2174 L) 
+(-1056 -2173 L) 
 ((|constructor| (NIL "\\spadtype{ReductionOfOrder} provides functions for reducing the order of linear ordinary differential equations once some solutions are known.")) (|ReduceOrder| (((|Record| (|:| |eq| |#2|) (|:| |op| (|List| |#1|))) |#2| (|List| |#1|)) "\\spad{ReduceOrder(op, [f1,...,fk])} returns \\spad{[op1,[g1,...,gk]]} such that for any solution \\spad{z} of \\spad{op1 z = 0},{} \\spad{y = gk \\int(g_{k-1} \\int(... \\int(g1 \\int z)...)} is a solution of \\spad{op y = 0}. Each \\spad{fi} must satisfy \\spad{op fi = 0}.") ((|#2| |#2| |#1|) "\\spad{ReduceOrder(op, s)} returns \\spad{op1} such that for any solution \\spad{z} of \\spad{op1 z = 0},{} \\spad{y = s \\int z} is a solution of \\spad{op y = 0}. \\spad{s} must satisfy \\spad{op s = 0}."))) 
 NIL 
 NIL 
@@ -4188,14 +4188,14 @@ NIL
 ((|constructor| (NIL "This package provides coercions for the special types \\spadtype{Exit} and \\spadtype{Void}.")) (|coerce| ((|#1| (|Exit|)) "\\spad{coerce(e)} is never really evaluated. This coercion is used for formal type correctness when a function will not return directly to its caller.") (((|Void|) |#1|) "\\spad{coerce(s)} throws all information about \\spad{s} away. This coercion allows values of any type to appear in contexts where they will not be used. For example,{} it allows the resolution of different types in the \\spad{then} and \\spad{else} branches when an \\spad{if} is in a context where the resulting value is not used."))) 
 NIL 
 NIL 
-(-1065 -2174 |Expon| |VarSet| |FPol| |LFPol|) 
+(-1065 -2173 |Expon| |VarSet| |FPol| |LFPol|) 
 ((|constructor| (NIL "ResidueRing is the quotient of a polynomial ring by an ideal. The ideal is given as a list of generators. The elements of the domain are equivalence classes expressed in terms of reduced elements")) (|lift| ((|#4| $) "\\spad{lift(x)} return the canonical representative of the equivalence class \\spad{x}")) (|coerce| (($ |#4|) "\\spad{coerce(f)} produces the equivalence class of \\spad{f} in the residue ring")) (|reduce| (($ |#4|) "\\spad{reduce(f)} produces the equivalence class of \\spad{f} in the residue ring"))) 
 (((-4509 "*") . T) (-4501 . T) (-4502 . T) (-4504 . T)) 
 NIL 
 (-1066) 
 ((|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.}"))) 
 ((-4507 . T) (-4508 . T)) 
-((-12 (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2078 (-52))) (QUOTE (-1131))) (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2078 (-52))) (LIST (QUOTE -321) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2338) (QUOTE (-1207))) (LIST (QUOTE |:|) (QUOTE -2078) (QUOTE (-52))))))) (-2225 (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2078 (-52))) (QUOTE (-1131))) (|HasCategory| (-52) (QUOTE (-1131)))) (-2225 (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2078 (-52))) (QUOTE (-102))) (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2078 (-52))) (QUOTE (-1131))) (|HasCategory| (-52) (QUOTE (-102))) (|HasCategory| (-52) (QUOTE (-1131)))) (-2225 (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2078 (-52))) (QUOTE (-1131))) (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2078 (-52))) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-52) (QUOTE (-1131))) (|HasCategory| (-52) (LIST (QUOTE -632) (QUOTE (-886))))) (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2078 (-52))) (LIST (QUOTE -633) (QUOTE (-550)))) (-12 (|HasCategory| (-52) (QUOTE (-1131))) (|HasCategory| (-52) (LIST (QUOTE -321) (QUOTE (-52))))) (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2078 (-52))) (QUOTE (-1131))) (|HasCategory| (-1207) (QUOTE (-871))) (|HasCategory| (-52) (QUOTE (-1131))) (-2225 (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2078 (-52))) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-52) (LIST (QUOTE -632) (QUOTE (-886))))) (-2225 (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2078 (-52))) (QUOTE (-102))) (|HasCategory| (-52) (QUOTE (-102)))) (|HasCategory| (-52) (QUOTE (-102))) (|HasCategory| (-52) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2078 (-52))) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2078 (-52))) (QUOTE (-102)))) 
+((-12 (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2079 (-52))) (QUOTE (-1131))) (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2079 (-52))) (LIST (QUOTE -321) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2338) (QUOTE (-1207))) (LIST (QUOTE |:|) (QUOTE -2079) (QUOTE (-52))))))) (-2225 (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2079 (-52))) (QUOTE (-1131))) (|HasCategory| (-52) (QUOTE (-1131)))) (-2225 (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2079 (-52))) (QUOTE (-102))) (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2079 (-52))) (QUOTE (-1131))) (|HasCategory| (-52) (QUOTE (-102))) (|HasCategory| (-52) (QUOTE (-1131)))) (-2225 (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2079 (-52))) (QUOTE (-1131))) (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2079 (-52))) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-52) (QUOTE (-1131))) (|HasCategory| (-52) (LIST (QUOTE -632) (QUOTE (-886))))) (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2079 (-52))) (LIST (QUOTE -633) (QUOTE (-550)))) (-12 (|HasCategory| (-52) (QUOTE (-1131))) (|HasCategory| (-52) (LIST (QUOTE -321) (QUOTE (-52))))) (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2079 (-52))) (QUOTE (-1131))) (|HasCategory| (-1207) (QUOTE (-871))) (|HasCategory| (-52) (QUOTE (-1131))) (-2225 (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2079 (-52))) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-52) (LIST (QUOTE -632) (QUOTE (-886))))) (-2225 (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2079 (-52))) (QUOTE (-102))) (|HasCategory| (-52) (QUOTE (-102)))) (|HasCategory| (-52) (QUOTE (-102))) (|HasCategory| (-52) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2079 (-52))) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2079 (-52))) (QUOTE (-102)))) 
 (-1067) 
 ((|constructor| (NIL "This domain represents `return' expressions.")) (|expression| (((|SpadAst|) $) "\\spad{expression(e)} returns the expression returned by `e'."))) 
 NIL 
@@ -4252,7 +4252,7 @@ NIL
 ((|constructor| (NIL "The category of rings with unity,{} always associative,{} but not necessarily commutative.")) (|unitsKnown| ((|attribute|) "recip truly yields reciprocal or \"failed\" if not a unit. Note: \\spad{recip(0) = \"failed\"}.")) (|characteristic| (((|NonNegativeInteger|)) "\\spad{characteristic()} returns the characteristic of the ring this is the smallest positive integer \\spad{n} such that \\spad{n*x=0} for all \\spad{x} in the ring,{} or zero if no such \\spad{n} exists."))) 
 ((-4504 . T)) 
 NIL 
-(-1081 |xx| -2174) 
+(-1081 |xx| -2173) 
 ((|constructor| (NIL "This package exports rational interpolation algorithms"))) 
 NIL 
 NIL 
@@ -4307,7 +4307,7 @@ NIL
 (-1094) 
 ((|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}"))) 
 ((-4507 . T) (-4508 . T)) 
-((-12 (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2078 (-52))) (QUOTE (-1131))) (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2078 (-52))) (LIST (QUOTE -321) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2338) (QUOTE (-1207))) (LIST (QUOTE |:|) (QUOTE -2078) (QUOTE (-52))))))) (-2225 (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2078 (-52))) (QUOTE (-1131))) (|HasCategory| (-52) (QUOTE (-1131)))) (-2225 (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2078 (-52))) (QUOTE (-102))) (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2078 (-52))) (QUOTE (-1131))) (|HasCategory| (-52) (QUOTE (-102))) (|HasCategory| (-52) (QUOTE (-1131)))) (-2225 (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2078 (-52))) (QUOTE (-1131))) (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2078 (-52))) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-52) (QUOTE (-1131))) (|HasCategory| (-52) (LIST (QUOTE -632) (QUOTE (-886))))) (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2078 (-52))) (LIST (QUOTE -633) (QUOTE (-550)))) (-12 (|HasCategory| (-52) (QUOTE (-1131))) (|HasCategory| (-52) (LIST (QUOTE -321) (QUOTE (-52))))) (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2078 (-52))) (QUOTE (-1131))) (|HasCategory| (-1207) (QUOTE (-871))) (|HasCategory| (-52) (QUOTE (-1131))) (-2225 (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2078 (-52))) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-52) (LIST (QUOTE -632) (QUOTE (-886))))) (-2225 (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2078 (-52))) (QUOTE (-102))) (|HasCategory| (-52) (QUOTE (-102)))) (|HasCategory| (-52) (QUOTE (-102))) (|HasCategory| (-52) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2078 (-52))) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2078 (-52))) (QUOTE (-102)))) 
+((-12 (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2079 (-52))) (QUOTE (-1131))) (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2079 (-52))) (LIST (QUOTE -321) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2338) (QUOTE (-1207))) (LIST (QUOTE |:|) (QUOTE -2079) (QUOTE (-52))))))) (-2225 (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2079 (-52))) (QUOTE (-1131))) (|HasCategory| (-52) (QUOTE (-1131)))) (-2225 (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2079 (-52))) (QUOTE (-102))) (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2079 (-52))) (QUOTE (-1131))) (|HasCategory| (-52) (QUOTE (-102))) (|HasCategory| (-52) (QUOTE (-1131)))) (-2225 (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2079 (-52))) (QUOTE (-1131))) (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2079 (-52))) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-52) (QUOTE (-1131))) (|HasCategory| (-52) (LIST (QUOTE -632) (QUOTE (-886))))) (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2079 (-52))) (LIST (QUOTE -633) (QUOTE (-550)))) (-12 (|HasCategory| (-52) (QUOTE (-1131))) (|HasCategory| (-52) (LIST (QUOTE -321) (QUOTE (-52))))) (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2079 (-52))) (QUOTE (-1131))) (|HasCategory| (-1207) (QUOTE (-871))) (|HasCategory| (-52) (QUOTE (-1131))) (-2225 (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2079 (-52))) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-52) (LIST (QUOTE -632) (QUOTE (-886))))) (-2225 (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2079 (-52))) (QUOTE (-102))) (|HasCategory| (-52) (QUOTE (-102)))) (|HasCategory| (-52) (QUOTE (-102))) (|HasCategory| (-52) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2079 (-52))) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-2 (|:| -2338 (-1207)) (|:| -2079 (-52))) (QUOTE (-102)))) 
 (-1095 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 
@@ -4356,11 +4356,11 @@ NIL
 ((|constructor| (NIL "This domain implements named rules")) (|name| (((|Symbol|) $) "\\spad{name(x)} returns the symbol"))) 
 NIL 
 NIL 
-(-1107 |Base| R -2174) 
+(-1107 |Base| R -2173) 
 ((|constructor| (NIL "\\indented{1}{Rules for the pattern matcher} Author: Manuel Bronstein Date Created: 24 Oct 1988 Date Last Updated: 26 October 1993 Keywords: pattern,{} matching,{} rule.")) (|quotedOperators| (((|List| (|Symbol|)) $) "\\spad{quotedOperators(r)} returns the list of operators on the right hand side of \\spad{r} that are considered quoted,{} that is they are not evaluated during any rewrite,{} but just applied formally to their arguments.")) (|elt| ((|#3| $ |#3| (|PositiveInteger|)) "\\spad{elt(r,f,n)} or \\spad{r}(\\spad{f},{} \\spad{n}) applies the rule \\spad{r} to \\spad{f} at most \\spad{n} times.")) (|rhs| ((|#3| $) "\\spad{rhs(r)} returns the right hand side of the rule \\spad{r}.")) (|lhs| ((|#3| $) "\\spad{lhs(r)} returns the left hand side of the rule \\spad{r}.")) (|pattern| (((|Pattern| |#1|) $) "\\spad{pattern(r)} returns the pattern corresponding to the left hand side of the rule \\spad{r}.")) (|suchThat| (($ $ (|List| (|Symbol|)) (|Mapping| (|Boolean|) (|List| |#3|))) "\\spad{suchThat(r, [a1,...,an], f)} returns the rewrite rule \\spad{r} with the predicate \\spad{f(a1,...,an)} attached to it.")) (|rule| (($ |#3| |#3| (|List| (|Symbol|))) "\\spad{rule(f, g, [f1,...,fn])} creates the rewrite rule \\spad{f == eval(eval(g, g is f), [f1,...,fn])},{} that is a rule with left-hand side \\spad{f} and right-hand side \\spad{g}; The symbols \\spad{f1},{}...,{}\\spad{fn} are the operators that are considered quoted,{} that is they are not evaluated during any rewrite,{} but just applied formally to their arguments.") (($ |#3| |#3|) "\\spad{rule(f, g)} creates the rewrite rule: \\spad{f == eval(g, g is f)},{} with left-hand side \\spad{f} and right-hand side \\spad{g}."))) 
 NIL 
 NIL 
-(-1108 |Base| R -2174) 
+(-1108 |Base| R -2173) 
 ((|constructor| (NIL "A ruleset is a set of pattern matching rules grouped together.")) (|elt| ((|#3| $ |#3| (|PositiveInteger|)) "\\spad{elt(r,f,n)} or \\spad{r}(\\spad{f},{} \\spad{n}) applies all the rules of \\spad{r} to \\spad{f} at most \\spad{n} times.")) (|rules| (((|List| (|RewriteRule| |#1| |#2| |#3|)) $) "\\spad{rules(r)} returns the rules contained in \\spad{r}.")) (|ruleset| (($ (|List| (|RewriteRule| |#1| |#2| |#3|))) "\\spad{ruleset([r1,...,rn])} creates the rule set \\spad{{r1,...,rn}}."))) 
 NIL 
 NIL 
@@ -4516,7 +4516,7 @@ NIL
 ((|constructor| (NIL "This domain represents a signature AST. A signature AST \\indented{2}{is a description of an exported operation,{} \\spadignore{e.g.} its name,{} result} \\indented{2}{type,{} and the list of its argument types.}")) (|signature| (((|Signature|) $) "\\spad{signature(s)} returns AST of the declared signature for \\spad{`s'}.")) (|name| (((|Identifier|) $) "\\spad{name(s)} returns the name of the signature \\spad{`s'}.")) (|signatureAst| (($ (|Identifier|) (|Signature|)) "\\spad{signatureAst(n,s,t)} builds the signature AST \\spad{n:} \\spad{s} \\spad{->} \\spad{t}"))) 
 NIL 
 NIL 
-(-1147 R -2174) 
+(-1147 R -2173) 
 ((|constructor| (NIL "This package provides functions to determine the sign of an elementary function around a point or infinity.")) (|sign| (((|Union| (|Integer|) "failed") |#2| (|Symbol|) |#2| (|String|)) "\\spad{sign(f, x, a, s)} returns the sign of \\spad{f} as \\spad{x} nears \\spad{a} from below if \\spad{s} is \"left\",{} or above if \\spad{s} is \"right\".") (((|Union| (|Integer|) "failed") |#2| (|Symbol|) (|OrderedCompletion| |#2|)) "\\spad{sign(f, x, a)} returns the sign of \\spad{f} as \\spad{x} nears \\spad{a},{} from both sides if \\spad{a} is finite.") (((|Union| (|Integer|) "failed") |#2|) "\\spad{sign(f)} returns the sign of \\spad{f} if it is constant everywhere."))) 
 NIL 
 NIL 
@@ -4564,7 +4564,7 @@ NIL
 ((|constructor| (NIL "The category of square-free and normalized triangular sets. Thus,{} up to the primitivity axiom of [1],{} these sets are Lazard triangular sets.\\newline References : \\indented{1}{[1] \\spad{D}. LAZARD \"A new method for solving algebraic systems of} \\indented{5}{positive dimension\" Discr. App. Math. 33:147-160,{}1991}"))) 
 ((-4508 . T) (-4507 . T)) 
 NIL 
-(-1159 UP -2174) 
+(-1159 UP -2173) 
 ((|constructor| (NIL "This package factors the formulas out of the general solve code,{} allowing their recursive use over different domains. Care is taken to introduce few radicals so that radical extension domains can more easily simplify the results.")) (|aQuartic| ((|#2| |#2| |#2| |#2| |#2| |#2|) "\\spad{aQuartic(f,g,h,i,k)} \\undocumented")) (|aCubic| ((|#2| |#2| |#2| |#2| |#2|) "\\spad{aCubic(f,g,h,j)} \\undocumented")) (|aQuadratic| ((|#2| |#2| |#2| |#2|) "\\spad{aQuadratic(f,g,h)} \\undocumented")) (|aLinear| ((|#2| |#2| |#2|) "\\spad{aLinear(f,g)} \\undocumented")) (|quartic| (((|List| |#2|) |#2| |#2| |#2| |#2| |#2|) "\\spad{quartic(f,g,h,i,j)} \\undocumented") (((|List| |#2|) |#1|) "\\spad{quartic(u)} \\undocumented")) (|cubic| (((|List| |#2|) |#2| |#2| |#2| |#2|) "\\spad{cubic(f,g,h,i)} \\undocumented") (((|List| |#2|) |#1|) "\\spad{cubic(u)} \\undocumented")) (|quadratic| (((|List| |#2|) |#2| |#2| |#2|) "\\spad{quadratic(f,g,h)} \\undocumented") (((|List| |#2|) |#1|) "\\spad{quadratic(u)} \\undocumented")) (|linear| (((|List| |#2|) |#2| |#2|) "\\spad{linear(f,g)} \\undocumented") (((|List| |#2|) |#1|) "\\spad{linear(u)} \\undocumented")) (|mapSolve| (((|Record| (|:| |solns| (|List| |#2|)) (|:| |maps| (|List| (|Record| (|:| |arg| |#2|) (|:| |res| |#2|))))) |#1| (|Mapping| |#2| |#2|)) "\\spad{mapSolve(u,f)} \\undocumented")) (|particularSolution| ((|#2| |#1|) "\\spad{particularSolution(u)} \\undocumented")) (|solve| (((|List| |#2|) |#1|) "\\spad{solve(u)} \\undocumented"))) 
 NIL 
 NIL 
@@ -4655,7 +4655,7 @@ NIL
 (-1181 |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."))) 
 ((-4508 . T)) 
-((-12 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-1131))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (LIST (QUOTE -321) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2338) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -2078) (|devaluate| |#2|)))))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-1131))) (|HasCategory| |#2| (QUOTE (-1131)))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-1131))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-1131)))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-1131))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| |#2| (QUOTE (-1131))) (|HasCategory| |#2| (LIST (QUOTE -632) (QUOTE (-886))))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (LIST (QUOTE -633) (QUOTE (-550)))) (-12 (|HasCategory| |#2| (QUOTE (-1131))) (|HasCategory| |#2| (LIST (QUOTE -321) (|devaluate| |#2|)))) (|HasCategory| |#1| (QUOTE (-871))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-102)))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| |#2| (LIST (QUOTE -632) (QUOTE (-886))))) (|HasCategory| |#2| (QUOTE (-1131))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-1131)))) 
+((-12 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-1131))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (LIST (QUOTE -321) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2338) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -2079) (|devaluate| |#2|)))))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-1131))) (|HasCategory| |#2| (QUOTE (-1131)))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-1131))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-1131)))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-1131))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| |#2| (QUOTE (-1131))) (|HasCategory| |#2| (LIST (QUOTE -632) (QUOTE (-886))))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (LIST (QUOTE -633) (QUOTE (-550)))) (-12 (|HasCategory| |#2| (QUOTE (-1131))) (|HasCategory| |#2| (LIST (QUOTE -321) (|devaluate| |#2|)))) (|HasCategory| |#1| (QUOTE (-871))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-102)))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| |#2| (LIST (QUOTE -632) (QUOTE (-886))))) (|HasCategory| |#2| (QUOTE (-1131))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-1131)))) 
 (-1182) 
 ((|constructor| (NIL "This domain represents an arithmetic progression iterator syntax.")) (|step| (((|SpadAst|) $) "\\spad{step(i)} returns the Spad AST denoting the step of the arithmetic progression represented by the iterator \\spad{i}.")) (|upperBound| (((|Maybe| (|SpadAst|)) $) "If the set of values assumed by the iteration variable is bounded from above,{} \\spad{upperBound(i)} returns the upper bound. Otherwise,{} its returns \\spad{nothing}.")) (|lowerBound| (((|SpadAst|) $) "\\spad{lowerBound(i)} returns the lower bound on the values assumed by the iteration variable.")) (|iterationVar| (((|Identifier|) $) "\\spad{iterationVar(i)} returns the name of the iterating variable of the arithmetic progression iterator \\spad{i}."))) 
 NIL 
@@ -4691,7 +4691,7 @@ NIL
 (-1190 |Entry|) 
 ((|constructor| (NIL "This domain provides tables where the keys are strings. A specialized hash function for strings is used."))) 
 ((-4507 . T) (-4508 . T)) 
-((-12 (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2078 |#1|)) (QUOTE (-1131))) (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2078 |#1|)) (LIST (QUOTE -321) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2338) (QUOTE (-1189))) (LIST (QUOTE |:|) (QUOTE -2078) (|devaluate| |#1|)))))) (-2225 (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2078 |#1|)) (QUOTE (-1131))) (|HasCategory| |#1| (QUOTE (-1131)))) (-2225 (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2078 |#1|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2078 |#1|)) (QUOTE (-1131))) (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1131)))) (-2225 (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2078 |#1|)) (QUOTE (-1131))) (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2078 |#1|)) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| |#1| (QUOTE (-1131))) (|HasCategory| |#1| (LIST (QUOTE -632) (QUOTE (-886))))) (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2078 |#1|)) (LIST (QUOTE -633) (QUOTE (-550)))) (-12 (|HasCategory| |#1| (QUOTE (-1131))) (|HasCategory| |#1| (LIST (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2078 |#1|)) (QUOTE (-1131))) (|HasCategory| (-1189) (QUOTE (-871))) (|HasCategory| |#1| (QUOTE (-1131))) (-2225 (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2078 |#1|)) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| |#1| (LIST (QUOTE -632) (QUOTE (-886))))) (-2225 (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2078 |#1|)) (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-102)))) (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2078 |#1|)) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2078 |#1|)) (QUOTE (-102)))) 
+((-12 (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2079 |#1|)) (QUOTE (-1131))) (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2079 |#1|)) (LIST (QUOTE -321) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2338) (QUOTE (-1189))) (LIST (QUOTE |:|) (QUOTE -2079) (|devaluate| |#1|)))))) (-2225 (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2079 |#1|)) (QUOTE (-1131))) (|HasCategory| |#1| (QUOTE (-1131)))) (-2225 (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2079 |#1|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2079 |#1|)) (QUOTE (-1131))) (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1131)))) (-2225 (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2079 |#1|)) (QUOTE (-1131))) (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2079 |#1|)) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| |#1| (QUOTE (-1131))) (|HasCategory| |#1| (LIST (QUOTE -632) (QUOTE (-886))))) (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2079 |#1|)) (LIST (QUOTE -633) (QUOTE (-550)))) (-12 (|HasCategory| |#1| (QUOTE (-1131))) (|HasCategory| |#1| (LIST (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2079 |#1|)) (QUOTE (-1131))) (|HasCategory| (-1189) (QUOTE (-871))) (|HasCategory| |#1| (QUOTE (-1131))) (-2225 (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2079 |#1|)) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| |#1| (LIST (QUOTE -632) (QUOTE (-886))))) (-2225 (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2079 |#1|)) (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-102)))) (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2079 |#1|)) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-2 (|:| -2338 (-1189)) (|:| -2079 |#1|)) (QUOTE (-102)))) 
 (-1191 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 should be invertible.")) (|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,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 
@@ -4723,8 +4723,8 @@ NIL
 (-1198 |Coef| |var| |cen|) 
 ((|constructor| (NIL "Sparse Laurent series in one variable \\indented{2}{\\spadtype{SparseUnivariateLaurentSeries} is a domain representing Laurent} \\indented{2}{series in one variable with coefficients in an arbitrary ring.\\space{2}The} \\indented{2}{parameters of the type specify the coefficient ring,{} the power series} \\indented{2}{variable,{} and the center of the power series expansion.\\space{2}For example,{}} \\indented{2}{\\spad{SparseUnivariateLaurentSeries(Integer,x,3)} represents Laurent} \\indented{2}{series in \\spad{(x - 3)} with integer coefficients.}")) (|integrate| (($ $ (|Variable| |#2|)) "\\spad{integrate(f(x))} returns an anti-derivative of the power series \\spad{f(x)} with constant coefficient 0. We may integrate a series when we can divide coefficients by integers.")) (|coerce| (($ (|Variable| |#2|)) "\\spad{coerce(var)} converts the series variable \\spad{var} into a Laurent series."))) 
 (((-4509 "*") -2225 (-3534 (|has| |#1| (-376)) (|has| (-1205 |#1| |#2| |#3|) (-842))) (|has| |#1| (-175)) (-3534 (|has| |#1| (-376)) (|has| (-1205 |#1| |#2| |#3|) (-938)))) (-4500 -2225 (-3534 (|has| |#1| (-376)) (|has| (-1205 |#1| |#2| |#3|) (-842))) (|has| |#1| (-570)) (-3534 (|has| |#1| (-376)) (|has| (-1205 |#1| |#2| |#3|) (-938)))) (-4505 |has| |#1| (-376)) (-4499 |has| |#1| (-376)) (-4501 . T) (-4502 . T) (-4504 . T)) 
-((-2225 (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-842))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-871))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-938))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-1053))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-1183))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -633) (QUOTE (-550)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -633) (LIST (QUOTE -917) (QUOTE (-392))))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -633) (LIST (QUOTE -917) (QUOTE (-578))))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -298) (LIST (QUOTE -1205) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1205) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -321) (LIST (QUOTE -1205) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -528) (QUOTE (-1207)) (LIST (QUOTE -1205) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -660) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -911) (QUOTE (-392)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -911) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -1069) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -1069) (QUOTE (-1207)))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578)))))) (|HasCategory| |#1| (QUOTE (-570))) (|HasCategory| |#1| (QUOTE (-175))) (-2225 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-570)))) (-2225 (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-147)))) (-2225 (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-149)))) (-2225 (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -927) (QUOTE (-1207)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -927) (QUOTE (-1207)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-578)) (|devaluate| |#1|)))))) (-2225 (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -927) (QUOTE (-1207)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -929) (QUOTE (-1207)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -927) (QUOTE (-1207)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-578)) (|devaluate| |#1|)))))) (-2225 (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-578)) (|devaluate| |#1|))))) (-2225 (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-239))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-578)) (|devaluate| |#1|))))) (|HasCategory| (-578) (QUOTE (-1143))) (-2225 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-570)))) (|HasCategory| |#1| (QUOTE (-376))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-938))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -1069) (QUOTE (-1207)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -633) (QUOTE (-550)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-1053))) (|HasCategory| |#1| (QUOTE (-376)))) (-2225 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-570)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-842))) (|HasCategory| |#1| (QUOTE (-376)))) (-2225 (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-842))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-871))) (|HasCategory| |#1| (QUOTE (-376))))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -1069) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-1183))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -298) (LIST (QUOTE -1205) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1205) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -321) (LIST (QUOTE -1205) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -528) (QUOTE (-1207)) (LIST (QUOTE -1205) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -660) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -633) (LIST (QUOTE -917) (QUOTE (-578))))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -633) (LIST (QUOTE -917) (QUOTE (-392))))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -911) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -911) (QUOTE (-392)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-578))))) (|HasSignature| |#1| (LIST (QUOTE -2863) (LIST (|devaluate| |#1|) (QUOTE (-1207)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-578))))) (-2225 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-988))) (|HasCategory| |#1| (QUOTE (-1233))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasSignature| |#1| (LIST (QUOTE -1369) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1207))))) (|HasSignature| |#1| (LIST (QUOTE -1880) (LIST (LIST (QUOTE -666) (QUOTE (-1207))) (|devaluate| |#1|)))))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-938))) (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-147))) (-2225 (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-842))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-938))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-570)))) (-2225 (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -1069) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578)))))) (-2225 (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-842))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-938))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-175)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -929) (QUOTE (-1207)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-239))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-871))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578))))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-938))) (|HasCategory| |#1| (QUOTE (-376)))) (-2225 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-938))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-147))))) 
-(-1199 R -2174) 
+((-2225 (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-842))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-871))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-938))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-1053))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-1183))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -633) (QUOTE (-550)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -633) (LIST (QUOTE -917) (QUOTE (-392))))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -633) (LIST (QUOTE -917) (QUOTE (-578))))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -298) (LIST (QUOTE -1205) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1205) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -321) (LIST (QUOTE -1205) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -528) (QUOTE (-1207)) (LIST (QUOTE -1205) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -660) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -911) (QUOTE (-392)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -911) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -1069) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -1069) (QUOTE (-1207)))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578)))))) (|HasCategory| |#1| (QUOTE (-570))) (|HasCategory| |#1| (QUOTE (-175))) (-2225 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-570)))) (-2225 (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-147)))) (-2225 (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-149)))) (-2225 (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -927) (QUOTE (-1207)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -927) (QUOTE (-1207)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-578)) (|devaluate| |#1|)))))) (-2225 (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -927) (QUOTE (-1207)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -929) (QUOTE (-1207)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -927) (QUOTE (-1207)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-578)) (|devaluate| |#1|)))))) (-2225 (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-578)) (|devaluate| |#1|))))) (-2225 (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-239))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-578)) (|devaluate| |#1|))))) (|HasCategory| (-578) (QUOTE (-1143))) (-2225 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-570)))) (|HasCategory| |#1| (QUOTE (-376))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-938))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -1069) (QUOTE (-1207)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -633) (QUOTE (-550)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-1053))) (|HasCategory| |#1| (QUOTE (-376)))) (-2225 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-570)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-842))) (|HasCategory| |#1| (QUOTE (-376)))) (-2225 (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-842))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-871))) (|HasCategory| |#1| (QUOTE (-376))))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -1069) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-1183))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -298) (LIST (QUOTE -1205) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1205) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -321) (LIST (QUOTE -1205) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -528) (QUOTE (-1207)) (LIST (QUOTE -1205) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -660) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -633) (LIST (QUOTE -917) (QUOTE (-578))))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -633) (LIST (QUOTE -917) (QUOTE (-392))))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -911) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -911) (QUOTE (-392)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-578))))) (|HasSignature| |#1| (LIST (QUOTE -2864) (LIST (|devaluate| |#1|) (QUOTE (-1207)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-578))))) (-2225 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-988))) (|HasCategory| |#1| (QUOTE (-1233))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasSignature| |#1| (LIST (QUOTE -2924) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1207))))) (|HasSignature| |#1| (LIST (QUOTE -1880) (LIST (LIST (QUOTE -666) (QUOTE (-1207))) (|devaluate| |#1|)))))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-938))) (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-147))) (-2225 (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-842))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-938))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-570)))) (-2225 (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -1069) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578)))))) (-2225 (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-842))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-938))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-175)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (LIST (QUOTE -929) (QUOTE (-1207)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-239))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-871))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578))))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-938))) (|HasCategory| |#1| (QUOTE (-376)))) (-2225 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-938))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1205 |#1| |#2| |#3|) (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-147))))) 
+(-1199 R -2173) 
 ((|constructor| (NIL "computes sums of top-level expressions.")) (|sum| ((|#2| |#2| (|SegmentBinding| |#2|)) "\\spad{sum(f(n), n = a..b)} returns \\spad{f}(a) + \\spad{f}(a+1) + ... + \\spad{f}(\\spad{b}).") ((|#2| |#2| (|Symbol|)) "\\spad{sum(a(n), n)} returns A(\\spad{n}) such that A(\\spad{n+1}) - A(\\spad{n}) = a(\\spad{n})."))) 
 NIL 
 NIL 
@@ -4747,11 +4747,11 @@ NIL
 (-1204 |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."))) 
 (((-4509 "*") |has| |#1| (-175)) (-4500 |has| |#1| (-570)) (-4505 |has| |#1| (-376)) (-4499 |has| |#1| (-376)) (-4501 . T) (-4502 . T) (-4504 . T)) 
-((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasCategory| |#1| (QUOTE (-570))) (|HasCategory| |#1| (QUOTE (-175))) (-2225 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-570)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (LIST (QUOTE -927) (QUOTE (-1207)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -421) (QUOTE (-578))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -421) (QUOTE (-578))) (|devaluate| |#1|)))) (|HasCategory| (-421 (-578)) (QUOTE (-1143))) (|HasCategory| |#1| (QUOTE (-376))) (-2225 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-570)))) (-2225 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-570)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -421) (QUOTE (-578)))))) (|HasSignature| |#1| (LIST (QUOTE -2863) (LIST (|devaluate| |#1|) (QUOTE (-1207)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -421) (QUOTE (-578)))))) (-2225 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-988))) (|HasCategory| |#1| (QUOTE (-1233))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasSignature| |#1| (LIST (QUOTE -1369) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1207))))) (|HasSignature| |#1| (LIST (QUOTE -1880) (LIST (LIST (QUOTE -666) (QUOTE (-1207))) (|devaluate| |#1|))))))) 
+((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasCategory| |#1| (QUOTE (-570))) (|HasCategory| |#1| (QUOTE (-175))) (-2225 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-570)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (LIST (QUOTE -927) (QUOTE (-1207)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -421) (QUOTE (-578))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -421) (QUOTE (-578))) (|devaluate| |#1|)))) (|HasCategory| (-421 (-578)) (QUOTE (-1143))) (|HasCategory| |#1| (QUOTE (-376))) (-2225 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-570)))) (-2225 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-570)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -421) (QUOTE (-578)))))) (|HasSignature| |#1| (LIST (QUOTE -2864) (LIST (|devaluate| |#1|) (QUOTE (-1207)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -421) (QUOTE (-578)))))) (-2225 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-988))) (|HasCategory| |#1| (QUOTE (-1233))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasSignature| |#1| (LIST (QUOTE -2924) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1207))))) (|HasSignature| |#1| (LIST (QUOTE -1880) (LIST (LIST (QUOTE -666) (QUOTE (-1207))) (|devaluate| |#1|))))))) 
 (-1205 |Coef| |var| |cen|) 
 ((|constructor| (NIL "Sparse Taylor series in one variable \\indented{2}{\\spadtype{SparseUnivariateTaylorSeries} is a domain representing Taylor} \\indented{2}{series in one variable with coefficients in an arbitrary ring.\\space{2}The} \\indented{2}{parameters of the type specify the coefficient ring,{} the power series} \\indented{2}{variable,{} and the center of the power series expansion.\\space{2}For example,{}} \\indented{2}{\\spadtype{SparseUnivariateTaylorSeries}(Integer,{}\\spad{x},{}3) represents Taylor} \\indented{2}{series in \\spad{(x - 3)} with \\spadtype{Integer} coefficients.}")) (|integrate| (($ $ (|Variable| |#2|)) "\\spad{integrate(f(x),x)} returns an anti-derivative of the power series \\spad{f(x)} with constant coefficient 0. We may integrate a series when we can divide coefficients by integers.")) (|univariatePolynomial| (((|UnivariatePolynomial| |#2| |#1|) $ (|NonNegativeInteger|)) "\\spad{univariatePolynomial(f,k)} returns a univariate polynomial \\indented{1}{consisting of the sum of all terms of \\spad{f} of degree \\spad{<= k}.}")) (|coerce| (($ (|Variable| |#2|)) "\\spad{coerce(var)} converts the series variable \\spad{var} into a \\indented{1}{Taylor series.}") (($ (|UnivariatePolynomial| |#2| |#1|)) "\\spad{coerce(p)} converts a univariate polynomial \\spad{p} in the variable \\spad{var} to a univariate Taylor series in \\spad{var}."))) 
 (((-4509 "*") |has| |#1| (-175)) (-4500 |has| |#1| (-570)) (-4501 . T) (-4502 . T) (-4504 . T)) 
-((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasCategory| |#1| (QUOTE (-570))) (-2225 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-570)))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (LIST (QUOTE -927) (QUOTE (-1207)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-793)) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-793)) (|devaluate| |#1|)))) (|HasCategory| (-793) (QUOTE (-1143))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-793))))) (|HasSignature| |#1| (LIST (QUOTE -2863) (LIST (|devaluate| |#1|) (QUOTE (-1207)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-793))))) (|HasCategory| |#1| (QUOTE (-376))) (-2225 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-988))) (|HasCategory| |#1| (QUOTE (-1233))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasSignature| |#1| (LIST (QUOTE -1369) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1207))))) (|HasSignature| |#1| (LIST (QUOTE -1880) (LIST (LIST (QUOTE -666) (QUOTE (-1207))) (|devaluate| |#1|))))))) 
+((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasCategory| |#1| (QUOTE (-570))) (-2225 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-570)))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (LIST (QUOTE -927) (QUOTE (-1207)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-793)) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-793)) (|devaluate| |#1|)))) (|HasCategory| (-793) (QUOTE (-1143))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-793))))) (|HasSignature| |#1| (LIST (QUOTE -2864) (LIST (|devaluate| |#1|) (QUOTE (-1207)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-793))))) (|HasCategory| |#1| (QUOTE (-376))) (-2225 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-988))) (|HasCategory| |#1| (QUOTE (-1233))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasSignature| |#1| (LIST (QUOTE -2924) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1207))))) (|HasSignature| |#1| (LIST (QUOTE -1880) (LIST (LIST (QUOTE -666) (QUOTE (-1207))) (|devaluate| |#1|))))))) 
 (-1206) 
 ((|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 
@@ -4811,7 +4811,7 @@ NIL
 (-1220 |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}"))) 
 ((-4507 . T) (-4508 . T)) 
-((-12 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-1131))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (LIST (QUOTE -321) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2338) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -2078) (|devaluate| |#2|)))))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-1131))) (|HasCategory| |#2| (QUOTE (-1131)))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-1131))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-1131)))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-1131))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| |#2| (QUOTE (-1131))) (|HasCategory| |#2| (LIST (QUOTE -632) (QUOTE (-886))))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (LIST (QUOTE -633) (QUOTE (-550)))) (-12 (|HasCategory| |#2| (QUOTE (-1131))) (|HasCategory| |#2| (LIST (QUOTE -321) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-1131))) (|HasCategory| |#1| (QUOTE (-871))) (|HasCategory| |#2| (QUOTE (-1131))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| |#2| (LIST (QUOTE -632) (QUOTE (-886))))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-102)))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2078 |#2|)) (QUOTE (-102)))) 
+((-12 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-1131))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (LIST (QUOTE -321) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -2338) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -2079) (|devaluate| |#2|)))))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-1131))) (|HasCategory| |#2| (QUOTE (-1131)))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-1131))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-1131)))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-1131))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| |#2| (QUOTE (-1131))) (|HasCategory| |#2| (LIST (QUOTE -632) (QUOTE (-886))))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (LIST (QUOTE -633) (QUOTE (-550)))) (-12 (|HasCategory| |#2| (QUOTE (-1131))) (|HasCategory| |#2| (LIST (QUOTE -321) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-1131))) (|HasCategory| |#1| (QUOTE (-871))) (|HasCategory| |#2| (QUOTE (-1131))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| |#2| (LIST (QUOTE -632) (QUOTE (-886))))) (-2225 (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-102)))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (LIST (QUOTE -632) (QUOTE (-886)))) (|HasCategory| (-2 (|:| -2338 |#1|) (|:| -2079 |#2|)) (QUOTE (-102)))) 
 (-1221 S) 
 ((|constructor| (NIL "\\indented{1}{Author: Gabriel Dos Reis} Date Created: April 17,{} 2010 Date Last Modified: April 17,{} 2010")) (|operator| (($ |#1| (|Arity|)) "\\spad{operator(n,a)} returns an operator named \\spad{n} and with arity \\spad{a}."))) 
 NIL 
@@ -4876,7 +4876,7 @@ NIL
 ((|constructor| (NIL "Category for the trigonometric functions.")) (|tan| (($ $) "\\spad{tan(x)} returns the tangent of \\spad{x}.")) (|sin| (($ $) "\\spad{sin(x)} returns the sine of \\spad{x}.")) (|sec| (($ $) "\\spad{sec(x)} returns the secant of \\spad{x}.")) (|csc| (($ $) "\\spad{csc(x)} returns the cosecant of \\spad{x}.")) (|cot| (($ $) "\\spad{cot(x)} returns the cotangent of \\spad{x}.")) (|cos| (($ $) "\\spad{cos(x)} returns the cosine of \\spad{x}."))) 
 NIL 
 NIL 
-(-1237 R -2174) 
+(-1237 R -2173) 
 ((|constructor| (NIL "\\spadtype{TrigonometricManipulations} provides transformations from trigonometric functions to complex exponentials and logarithms,{} and back.")) (|complexForm| (((|Complex| |#2|) |#2|) "\\spad{complexForm(f)} returns \\spad{[real f, imag f]}.")) (|real?| (((|Boolean|) |#2|) "\\spad{real?(f)} returns \\spad{true} if \\spad{f = real f}.")) (|imag| ((|#2| |#2|) "\\spad{imag(f)} returns the imaginary part of \\spad{f} where \\spad{f} is a complex function.")) (|real| ((|#2| |#2|) "\\spad{real(f)} returns the real part of \\spad{f} where \\spad{f} is a complex function.")) (|trigs| ((|#2| |#2|) "\\spad{trigs(f)} rewrites all the complex logs and exponentials appearing in \\spad{f} in terms of trigonometric functions.")) (|complexElementary| ((|#2| |#2| (|Symbol|)) "\\spad{complexElementary(f, x)} rewrites the kernels of \\spad{f} involving \\spad{x} in terms of the 2 fundamental complex transcendental elementary functions: \\spad{log, exp}.") ((|#2| |#2|) "\\spad{complexElementary(f)} rewrites \\spad{f} in terms of the 2 fundamental complex transcendental elementary functions: \\spad{log, exp}.")) (|complexNormalize| ((|#2| |#2| (|Symbol|)) "\\spad{complexNormalize(f, x)} rewrites \\spad{f} using the least possible number of complex independent kernels involving \\spad{x}.") ((|#2| |#2|) "\\spad{complexNormalize(f)} rewrites \\spad{f} using the least possible number of complex independent kernels."))) 
 NIL 
 NIL 
@@ -4884,7 +4884,7 @@ NIL
 ((|constructor| (NIL "This package provides functions that compute \"fraction-free\" inverses of upper and lower triangular matrices over a integral domain. By \"fraction-free inverses\" we mean the following: given a matrix \\spad{B} with entries in \\spad{R} and an element \\spad{d} of \\spad{R} such that \\spad{d} * inv(\\spad{B}) also has entries in \\spad{R},{} we return \\spad{d} * inv(\\spad{B}). Thus,{} it is not necessary to pass to the quotient field in any of our computations.")) (|LowTriBddDenomInv| ((|#4| |#4| |#1|) "\\spad{LowTriBddDenomInv(B,d)} returns \\spad{M},{} where \\spad{B} is a non-singular lower triangular matrix and \\spad{d} is an element of \\spad{R} such that \\spad{M = d * inv(B)} has entries in \\spad{R}.")) (|UpTriBddDenomInv| ((|#4| |#4| |#1|) "\\spad{UpTriBddDenomInv(B,d)} returns \\spad{M},{} where \\spad{B} is a non-singular upper triangular matrix and \\spad{d} is an element of \\spad{R} such that \\spad{M = d * inv(B)} has entries in \\spad{R}."))) 
 NIL 
 NIL 
-(-1239 R -2174) 
+(-1239 R -2173) 
 ((|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 -633) (LIST (QUOTE -917) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -911) (|devaluate| |#1|))) (|HasCategory| |#2| (LIST (QUOTE -633) (LIST (QUOTE -917) (|devaluate| |#1|)))) (|HasCategory| |#2| (LIST (QUOTE -911) (|devaluate| |#1|))))) 
@@ -4912,7 +4912,7 @@ NIL
 ((|constructor| (NIL "\\indented{1}{This domain is used to interface with the interpreter\\spad{'s} notion} of comma-delimited sequences of values.")) (|length| (((|NonNegativeInteger|) $) "\\spad{length(x)} returns the number of elements in tuple \\spad{x}")) (|select| ((|#1| $ (|NonNegativeInteger|)) "\\spad{select(x,n)} returns the \\spad{n}-th element of tuple \\spad{x}. tuples are 0-based"))) 
 NIL 
 ((|HasCategory| |#1| (QUOTE (-1131))) (|HasCategory| |#1| (LIST (QUOTE -632) (QUOTE (-886))))) 
-(-1246 -2174) 
+(-1246 -2173) 
 ((|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 
@@ -4975,11 +4975,11 @@ NIL
 (-1261 |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)}."))) 
 (((-4509 "*") |has| |#1| (-175)) (-4500 |has| |#1| (-570)) (-4505 |has| |#1| (-376)) (-4499 |has| |#1| (-376)) (-4501 . T) (-4502 . T) (-4504 . T)) 
-((-2225 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -298) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -528) (QUOTE (-1207)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-842)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-871)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-938)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1053)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1183)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -633) (QUOTE (-550))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -1069) (QUOTE (-578))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -1069) (QUOTE (-1207)))))) (|HasCategory| |#1| (QUOTE (-570))) (|HasCategory| |#1| (QUOTE (-175))) (-2225 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-570)))) (-2225 (|HasCategory| |#1| (QUOTE (-147))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-147))))) (-2225 (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-149))))) (-2225 (-12 (|HasCategory| |#1| (LIST (QUOTE -927) (QUOTE (-1207)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-578)) (|devaluate| |#1|))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -927) (QUOTE (-1207)))))) (-2225 (-12 (|HasCategory| |#1| (LIST (QUOTE -927) (QUOTE (-1207)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-578)) (|devaluate| |#1|))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -927) (QUOTE (-1207))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -929) (QUOTE (-1207)))))) (-2225 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-240)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-578)) (|devaluate| |#1|))))) (-2225 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-240)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-239)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-578)) (|devaluate| |#1|))))) (|HasCategory| (-578) (QUOTE (-1143))) (-2225 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-570)))) (|HasCategory| |#1| (QUOTE (-376))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-938)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -1069) (QUOTE (-1207))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -633) (QUOTE (-550))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1053)))) (-2225 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-570)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-842)))) (-2225 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-842)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-871))))) (-2225 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -633) (LIST (QUOTE -917) (QUOTE (-392)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -633) (LIST (QUOTE -917) (QUOTE (-578)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -298) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -528) (QUOTE (-1207)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -660) (QUOTE (-578))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-842)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-871)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-938)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1053)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1183)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -633) (QUOTE (-550))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -911) (QUOTE (-392))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -911) (QUOTE (-578))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -1069) (QUOTE (-578))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -1069) (QUOTE (-1207)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -1069) (QUOTE (-578))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1183)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -298) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -528) (QUOTE (-1207)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -660) (QUOTE (-578))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -633) (LIST (QUOTE -917) (QUOTE (-578)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -633) (LIST (QUOTE -917) (QUOTE (-392)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -911) (QUOTE (-578))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -911) (QUOTE (-392))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-578))))) (|HasSignature| |#1| (LIST (QUOTE -2863) (LIST (|devaluate| |#1|) (QUOTE (-1207)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-578))))) (-2225 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-988))) (|HasCategory| |#1| (QUOTE (-1233))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasSignature| |#1| (LIST (QUOTE -1369) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1207))))) (|HasSignature| |#1| (LIST (QUOTE -1880) (LIST (LIST (QUOTE -666) (QUOTE (-1207))) (|devaluate| |#1|)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-871)))) (|HasCategory| |#2| (QUOTE (-938))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-559)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-319)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-147))) (-2225 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-239)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-578)) (|devaluate| |#1|))))) (-2225 (-12 (|HasCategory| |#1| (LIST (QUOTE -927) (QUOTE (-1207)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-578)) (|devaluate| |#1|))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -929) (QUOTE (-1207)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -929) (QUOTE (-1207))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-239)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578))))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-938)))) (-2225 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-938)))) (|HasCategory| |#1| (QUOTE (-147))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-147)))))) 
+((-2225 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -298) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -528) (QUOTE (-1207)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-842)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-871)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-938)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1053)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1183)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -633) (QUOTE (-550))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -1069) (QUOTE (-578))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -1069) (QUOTE (-1207)))))) (|HasCategory| |#1| (QUOTE (-570))) (|HasCategory| |#1| (QUOTE (-175))) (-2225 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-570)))) (-2225 (|HasCategory| |#1| (QUOTE (-147))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-147))))) (-2225 (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-149))))) (-2225 (-12 (|HasCategory| |#1| (LIST (QUOTE -927) (QUOTE (-1207)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-578)) (|devaluate| |#1|))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -927) (QUOTE (-1207)))))) (-2225 (-12 (|HasCategory| |#1| (LIST (QUOTE -927) (QUOTE (-1207)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-578)) (|devaluate| |#1|))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -927) (QUOTE (-1207))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -929) (QUOTE (-1207)))))) (-2225 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-240)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-578)) (|devaluate| |#1|))))) (-2225 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-240)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-239)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-578)) (|devaluate| |#1|))))) (|HasCategory| (-578) (QUOTE (-1143))) (-2225 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-570)))) (|HasCategory| |#1| (QUOTE (-376))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-938)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -1069) (QUOTE (-1207))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -633) (QUOTE (-550))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1053)))) (-2225 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-570)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-842)))) (-2225 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-842)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-871))))) (-2225 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -633) (LIST (QUOTE -917) (QUOTE (-392)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -633) (LIST (QUOTE -917) (QUOTE (-578)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -298) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -528) (QUOTE (-1207)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -660) (QUOTE (-578))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-842)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-871)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-938)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1053)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1183)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -633) (QUOTE (-550))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -911) (QUOTE (-392))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -911) (QUOTE (-578))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -1069) (QUOTE (-578))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -1069) (QUOTE (-1207)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -1069) (QUOTE (-578))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1183)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -298) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -528) (QUOTE (-1207)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -660) (QUOTE (-578))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -633) (LIST (QUOTE -917) (QUOTE (-578)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -633) (LIST (QUOTE -917) (QUOTE (-392)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -911) (QUOTE (-578))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -911) (QUOTE (-392))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-578))))) (|HasSignature| |#1| (LIST (QUOTE -2864) (LIST (|devaluate| |#1|) (QUOTE (-1207)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-578))))) (-2225 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-988))) (|HasCategory| |#1| (QUOTE (-1233))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasSignature| |#1| (LIST (QUOTE -2924) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1207))))) (|HasSignature| |#1| (LIST (QUOTE -1880) (LIST (LIST (QUOTE -666) (QUOTE (-1207))) (|devaluate| |#1|)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-871)))) (|HasCategory| |#2| (QUOTE (-938))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-559)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-319)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-147))) (-2225 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-239)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-578)) (|devaluate| |#1|))))) (-2225 (-12 (|HasCategory| |#1| (LIST (QUOTE -927) (QUOTE (-1207)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-578)) (|devaluate| |#1|))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -929) (QUOTE (-1207)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (LIST (QUOTE -929) (QUOTE (-1207))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-239)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578))))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-938)))) (-2225 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-938)))) (|HasCategory| |#1| (QUOTE (-147))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-147)))))) 
 (-1262 |Coef| |var| |cen|) 
 ((|constructor| (NIL "Dense Laurent series in one variable \\indented{2}{\\spadtype{UnivariateLaurentSeries} is a domain representing Laurent} \\indented{2}{series in one variable with coefficients in an arbitrary ring.\\space{2}The} \\indented{2}{parameters of the type specify the coefficient ring,{} the power series} \\indented{2}{variable,{} and the center of the power series expansion.\\space{2}For example,{}} \\indented{2}{\\spad{UnivariateLaurentSeries(Integer,x,3)} represents Laurent series in} \\indented{2}{\\spad{(x - 3)} with integer coefficients.}")) (|integrate| (($ $ (|Variable| |#2|)) "\\spad{integrate(f(x))} returns an anti-derivative of the power series \\spad{f(x)} with constant coefficient 0. We may integrate a series when we can divide coefficients by integers.")) (|coerce| (($ (|Variable| |#2|)) "\\spad{coerce(var)} converts the series variable \\spad{var} into a Laurent series."))) 
 (((-4509 "*") -2225 (-3534 (|has| |#1| (-376)) (|has| (-1290 |#1| |#2| |#3|) (-842))) (|has| |#1| (-175)) (-3534 (|has| |#1| (-376)) (|has| (-1290 |#1| |#2| |#3|) (-938)))) (-4500 -2225 (-3534 (|has| |#1| (-376)) (|has| (-1290 |#1| |#2| |#3|) (-842))) (|has| |#1| (-570)) (-3534 (|has| |#1| (-376)) (|has| (-1290 |#1| |#2| |#3|) (-938)))) (-4505 |has| |#1| (-376)) (-4499 |has| |#1| (-376)) (-4501 . T) (-4502 . T) (-4504 . T)) 
-((-2225 (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-842))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-871))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-938))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-1053))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-1183))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -633) (QUOTE (-550)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -633) (LIST (QUOTE -917) (QUOTE (-392))))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -633) (LIST (QUOTE -917) (QUOTE (-578))))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -298) (LIST (QUOTE -1290) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1290) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -321) (LIST (QUOTE -1290) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -528) (QUOTE (-1207)) (LIST (QUOTE -1290) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -660) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -911) (QUOTE (-392)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -911) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -1069) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -1069) (QUOTE (-1207)))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578)))))) (|HasCategory| |#1| (QUOTE (-570))) (|HasCategory| |#1| (QUOTE (-175))) (-2225 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-570)))) (-2225 (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-147)))) (-2225 (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-149)))) (-2225 (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -927) (QUOTE (-1207)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -927) (QUOTE (-1207)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-578)) (|devaluate| |#1|)))))) (-2225 (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -927) (QUOTE (-1207)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -929) (QUOTE (-1207)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -927) (QUOTE (-1207)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-578)) (|devaluate| |#1|)))))) (-2225 (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-578)) (|devaluate| |#1|))))) (-2225 (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-239))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-578)) (|devaluate| |#1|))))) (|HasCategory| (-578) (QUOTE (-1143))) (-2225 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-570)))) (|HasCategory| |#1| (QUOTE (-376))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-938))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -1069) (QUOTE (-1207)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -633) (QUOTE (-550)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-1053))) (|HasCategory| |#1| (QUOTE (-376)))) (-2225 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-570)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-842))) (|HasCategory| |#1| (QUOTE (-376)))) (-2225 (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-842))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-871))) (|HasCategory| |#1| (QUOTE (-376))))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -1069) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-1183))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -298) (LIST (QUOTE -1290) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1290) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -321) (LIST (QUOTE -1290) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -528) (QUOTE (-1207)) (LIST (QUOTE -1290) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -660) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -633) (LIST (QUOTE -917) (QUOTE (-578))))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -633) (LIST (QUOTE -917) (QUOTE (-392))))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -911) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -911) (QUOTE (-392)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-578))))) (|HasSignature| |#1| (LIST (QUOTE -2863) (LIST (|devaluate| |#1|) (QUOTE (-1207)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-578))))) (-2225 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-988))) (|HasCategory| |#1| (QUOTE (-1233))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasSignature| |#1| (LIST (QUOTE -1369) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1207))))) (|HasSignature| |#1| (LIST (QUOTE -1880) (LIST (LIST (QUOTE -666) (QUOTE (-1207))) (|devaluate| |#1|)))))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-938))) (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-147))) (-2225 (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-842))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-938))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-570)))) (-2225 (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -1069) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578)))))) (-2225 (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-842))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-938))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-175)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -929) (QUOTE (-1207)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-239))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-871))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578))))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-938))) (|HasCategory| |#1| (QUOTE (-376)))) (-2225 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-938))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-147))))) 
+((-2225 (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-842))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-871))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-938))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-1053))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-1183))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -633) (QUOTE (-550)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -633) (LIST (QUOTE -917) (QUOTE (-392))))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -633) (LIST (QUOTE -917) (QUOTE (-578))))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -298) (LIST (QUOTE -1290) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1290) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -321) (LIST (QUOTE -1290) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -528) (QUOTE (-1207)) (LIST (QUOTE -1290) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -660) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -911) (QUOTE (-392)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -911) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -1069) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -1069) (QUOTE (-1207)))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578)))))) (|HasCategory| |#1| (QUOTE (-570))) (|HasCategory| |#1| (QUOTE (-175))) (-2225 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-570)))) (-2225 (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-147)))) (-2225 (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-149)))) (-2225 (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -927) (QUOTE (-1207)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -927) (QUOTE (-1207)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-578)) (|devaluate| |#1|)))))) (-2225 (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -927) (QUOTE (-1207)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -929) (QUOTE (-1207)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -927) (QUOTE (-1207)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-578)) (|devaluate| |#1|)))))) (-2225 (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-578)) (|devaluate| |#1|))))) (-2225 (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-239))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-578)) (|devaluate| |#1|))))) (|HasCategory| (-578) (QUOTE (-1143))) (-2225 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-570)))) (|HasCategory| |#1| (QUOTE (-376))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-938))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -1069) (QUOTE (-1207)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -633) (QUOTE (-550)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-1053))) (|HasCategory| |#1| (QUOTE (-376)))) (-2225 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-570)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-842))) (|HasCategory| |#1| (QUOTE (-376)))) (-2225 (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-842))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-871))) (|HasCategory| |#1| (QUOTE (-376))))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -1069) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-1183))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -298) (LIST (QUOTE -1290) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1290) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -321) (LIST (QUOTE -1290) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -528) (QUOTE (-1207)) (LIST (QUOTE -1290) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -660) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -633) (LIST (QUOTE -917) (QUOTE (-578))))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -633) (LIST (QUOTE -917) (QUOTE (-392))))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -911) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -911) (QUOTE (-392)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-578))))) (|HasSignature| |#1| (LIST (QUOTE -2864) (LIST (|devaluate| |#1|) (QUOTE (-1207)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-578))))) (-2225 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-988))) (|HasCategory| |#1| (QUOTE (-1233))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasSignature| |#1| (LIST (QUOTE -2924) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1207))))) (|HasSignature| |#1| (LIST (QUOTE -1880) (LIST (LIST (QUOTE -666) (QUOTE (-1207))) (|devaluate| |#1|)))))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-938))) (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-147))) (-2225 (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-842))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-938))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-570)))) (-2225 (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -1069) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578)))))) (-2225 (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-842))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-938))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-175)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (LIST (QUOTE -929) (QUOTE (-1207)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-239))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-871))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578))))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-938))) (|HasCategory| |#1| (QUOTE (-376)))) (-2225 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-938))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1290 |#1| |#2| |#3|) (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-147))))) 
 (-1263 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 
@@ -5031,7 +5031,7 @@ NIL
 (-1275 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}.")) (|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 -927) (QUOTE (-1207)))) (|HasSignature| |#2| (LIST (QUOTE *) (LIST (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#2|)))) (|HasCategory| |#3| (QUOTE (-1143))) (|HasSignature| |#2| (LIST (QUOTE **) (LIST (|devaluate| |#2|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasSignature| |#2| (LIST (QUOTE -2863) (LIST (|devaluate| |#2|) (QUOTE (-1207)))))) 
+((|HasCategory| |#2| (LIST (QUOTE -927) (QUOTE (-1207)))) (|HasSignature| |#2| (LIST (QUOTE *) (LIST (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#2|)))) (|HasCategory| |#3| (QUOTE (-1143))) (|HasSignature| |#2| (LIST (QUOTE **) (LIST (|devaluate| |#2|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasSignature| |#2| (LIST (QUOTE -2864) (LIST (|devaluate| |#2|) (QUOTE (-1207)))))) 
 (-1276 |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}.")) (|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."))) 
 (((-4509 "*") |has| |#1| (-175)) (-4500 |has| |#1| (-570)) (-4501 . T) (-4502 . T) (-4504 . T)) 
@@ -5059,11 +5059,11 @@ NIL
 (-1282 |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)}."))) 
 (((-4509 "*") |has| |#1| (-175)) (-4500 |has| |#1| (-570)) (-4505 |has| |#1| (-376)) (-4499 |has| |#1| (-376)) (-4501 . T) (-4502 . T) (-4504 . T)) 
-((|HasCategory| |#1| (QUOTE (-570))) (|HasCategory| |#1| (QUOTE (-175))) (-2225 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-570)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (LIST (QUOTE -927) (QUOTE (-1207)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -421) (QUOTE (-578))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -421) (QUOTE (-578))) (|devaluate| |#1|)))) (|HasCategory| (-421 (-578)) (QUOTE (-1143))) (|HasCategory| |#1| (QUOTE (-376))) (-2225 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-570)))) (-2225 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-570)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -421) (QUOTE (-578)))))) (|HasSignature| |#1| (LIST (QUOTE -2863) (LIST (|devaluate| |#1|) (QUOTE (-1207)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -421) (QUOTE (-578)))))) (-2225 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-988))) (|HasCategory| |#1| (QUOTE (-1233))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasSignature| |#1| (LIST (QUOTE -1369) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1207))))) (|HasSignature| |#1| (LIST (QUOTE -1880) (LIST (LIST (QUOTE -666) (QUOTE (-1207))) (|devaluate| |#1|)))))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578)))))) 
+((|HasCategory| |#1| (QUOTE (-570))) (|HasCategory| |#1| (QUOTE (-175))) (-2225 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-570)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (LIST (QUOTE -927) (QUOTE (-1207)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -421) (QUOTE (-578))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -421) (QUOTE (-578))) (|devaluate| |#1|)))) (|HasCategory| (-421 (-578)) (QUOTE (-1143))) (|HasCategory| |#1| (QUOTE (-376))) (-2225 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-570)))) (-2225 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-570)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -421) (QUOTE (-578)))))) (|HasSignature| |#1| (LIST (QUOTE -2864) (LIST (|devaluate| |#1|) (QUOTE (-1207)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -421) (QUOTE (-578)))))) (-2225 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-988))) (|HasCategory| |#1| (QUOTE (-1233))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasSignature| |#1| (LIST (QUOTE -2924) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1207))))) (|HasSignature| |#1| (LIST (QUOTE -1880) (LIST (LIST (QUOTE -666) (QUOTE (-1207))) (|devaluate| |#1|)))))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578)))))) 
 (-1283 |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."))) 
 (((-4509 "*") |has| |#1| (-175)) (-4500 |has| |#1| (-570)) (-4505 |has| |#1| (-376)) (-4499 |has| |#1| (-376)) (-4501 . T) (-4502 . T) (-4504 . T)) 
-((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasCategory| |#1| (QUOTE (-570))) (|HasCategory| |#1| (QUOTE (-175))) (-2225 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-570)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (LIST (QUOTE -927) (QUOTE (-1207)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -421) (QUOTE (-578))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -421) (QUOTE (-578))) (|devaluate| |#1|)))) (|HasCategory| (-421 (-578)) (QUOTE (-1143))) (|HasCategory| |#1| (QUOTE (-376))) (-2225 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-570)))) (-2225 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-570)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -421) (QUOTE (-578)))))) (|HasSignature| |#1| (LIST (QUOTE -2863) (LIST (|devaluate| |#1|) (QUOTE (-1207)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -421) (QUOTE (-578)))))) (-2225 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-988))) (|HasCategory| |#1| (QUOTE (-1233))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasSignature| |#1| (LIST (QUOTE -1369) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1207))))) (|HasSignature| |#1| (LIST (QUOTE -1880) (LIST (LIST (QUOTE -666) (QUOTE (-1207))) (|devaluate| |#1|))))))) 
+((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasCategory| |#1| (QUOTE (-570))) (|HasCategory| |#1| (QUOTE (-175))) (-2225 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-570)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (LIST (QUOTE -927) (QUOTE (-1207)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -421) (QUOTE (-578))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -421) (QUOTE (-578))) (|devaluate| |#1|)))) (|HasCategory| (-421 (-578)) (QUOTE (-1143))) (|HasCategory| |#1| (QUOTE (-376))) (-2225 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-570)))) (-2225 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-570)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -421) (QUOTE (-578)))))) (|HasSignature| |#1| (LIST (QUOTE -2864) (LIST (|devaluate| |#1|) (QUOTE (-1207)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -421) (QUOTE (-578)))))) (-2225 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-988))) (|HasCategory| |#1| (QUOTE (-1233))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasSignature| |#1| (LIST (QUOTE -2924) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1207))))) (|HasSignature| |#1| (LIST (QUOTE -1880) (LIST (LIST (QUOTE -666) (QUOTE (-1207))) (|devaluate| |#1|))))))) 
 (-1284 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))}."))) 
 (((-4509 "*") |has| (-1283 |#2| |#3| |#4|) (-175)) (-4500 |has| (-1283 |#2| |#3| |#4|) (-570)) (-4501 . T) (-4502 . T) (-4504 . T)) 
@@ -5083,7 +5083,7 @@ NIL
 (-1288 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 (-578)))) (|HasCategory| |#2| (QUOTE (-988))) (|HasCategory| |#2| (QUOTE (-1233))) (|HasSignature| |#2| (LIST (QUOTE -1880) (LIST (LIST (QUOTE -666) (QUOTE (-1207))) (|devaluate| |#2|)))) (|HasSignature| |#2| (LIST (QUOTE -1369) (LIST (|devaluate| |#2|) (|devaluate| |#2|) (QUOTE (-1207))))) (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasCategory| |#2| (QUOTE (-376)))) 
+((|HasCategory| |#2| (LIST (QUOTE -29) (QUOTE (-578)))) (|HasCategory| |#2| (QUOTE (-988))) (|HasCategory| |#2| (QUOTE (-1233))) (|HasSignature| |#2| (LIST (QUOTE -1880) (LIST (LIST (QUOTE -666) (QUOTE (-1207))) (|devaluate| |#2|)))) (|HasSignature| |#2| (LIST (QUOTE -2924) (LIST (|devaluate| |#2|) (|devaluate| |#2|) (QUOTE (-1207))))) (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasCategory| |#2| (QUOTE (-376)))) 
 (-1289 |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."))) 
 (((-4509 "*") |has| |#1| (-175)) (-4500 |has| |#1| (-570)) (-4501 . T) (-4502 . T) (-4504 . T)) 
@@ -5091,12 +5091,12 @@ NIL
 (-1290 |Coef| |var| |cen|) 
 ((|constructor| (NIL "Dense Taylor series in one variable \\spadtype{UnivariateTaylorSeries} is a domain representing Taylor series in one variable with coefficients in an arbitrary ring. The parameters of the type specify the coefficient ring,{} the power series variable,{} and the center of the power series expansion. For example,{} \\spadtype{UnivariateTaylorSeries}(Integer,{}\\spad{x},{}3) represents Taylor series in \\spad{(x - 3)} with \\spadtype{Integer} coefficients.")) (|integrate| (($ $ (|Variable| |#2|)) "\\spad{integrate(f(x),x)} returns an anti-derivative of the power series \\spad{f(x)} with constant coefficient 0. We may integrate a series when we can divide coefficients by integers.")) (|invmultisect| (($ (|Integer|) (|Integer|) $) "\\spad{invmultisect(a,b,f(x))} substitutes \\spad{x^((a+b)*n)} \\indented{1}{for \\spad{x^n} and multiples by \\spad{x^b}.}")) (|multisect| (($ (|Integer|) (|Integer|) $) "\\spad{multisect(a,b,f(x))} selects the coefficients of \\indented{1}{\\spad{x^((a+b)*n+a)},{} and changes this monomial to \\spad{x^n}.}")) (|revert| (($ $) "\\spad{revert(f(x))} returns a Taylor series \\spad{g(x)} such that \\spad{f(g(x)) = g(f(x)) = x}. Series \\spad{f(x)} should have constant coefficient 0 and invertible 1st order coefficient.")) (|generalLambert| (($ $ (|Integer|) (|Integer|)) "\\spad{generalLambert(f(x),a,d)} returns \\spad{f(x^a) + f(x^(a + d)) + \\indented{1}{f(x^(a + 2 d)) + ... }. \\spad{f(x)} should have zero constant} \\indented{1}{coefficient and \\spad{a} and \\spad{d} should be positive.}")) (|evenlambert| (($ $) "\\spad{evenlambert(f(x))} returns \\spad{f(x^2) + f(x^4) + f(x^6) + ...}. \\indented{1}{\\spad{f(x)} should have a zero constant coefficient.} \\indented{1}{This function is used for computing infinite products.} \\indented{1}{If \\spad{f(x)} is a Taylor series with constant term 1,{} then} \\indented{1}{\\spad{product(n=1..infinity,f(x^(2*n))) = exp(log(evenlambert(f(x))))}.}")) (|oddlambert| (($ $) "\\spad{oddlambert(f(x))} returns \\spad{f(x) + f(x^3) + f(x^5) + ...}. \\indented{1}{\\spad{f(x)} should have a zero constant coefficient.} \\indented{1}{This function is used for computing infinite products.} \\indented{1}{If \\spad{f(x)} is a Taylor series with constant term 1,{} then} \\indented{1}{\\spad{product(n=1..infinity,f(x^(2*n-1)))=exp(log(oddlambert(f(x))))}.}")) (|lambert| (($ $) "\\spad{lambert(f(x))} returns \\spad{f(x) + f(x^2) + f(x^3) + ...}. \\indented{1}{This function is used for computing infinite products.} \\indented{1}{\\spad{f(x)} should have zero constant coefficient.} \\indented{1}{If \\spad{f(x)} is a Taylor series with constant term 1,{} then} \\indented{1}{\\spad{product(n = 1..infinity,f(x^n)) = exp(log(lambert(f(x))))}.}")) (|lagrange| (($ $) "\\spad{lagrange(g(x))} produces the Taylor series for \\spad{f(x)} \\indented{1}{where \\spad{f(x)} is implicitly defined as \\spad{f(x) = x*g(f(x))}.}")) (|univariatePolynomial| (((|UnivariatePolynomial| |#2| |#1|) $ (|NonNegativeInteger|)) "\\spad{univariatePolynomial(f,k)} returns a univariate polynomial \\indented{1}{consisting of the sum of all terms of \\spad{f} of degree \\spad{<= k}.}")) (|coerce| (($ (|Variable| |#2|)) "\\spad{coerce(var)} converts the series variable \\spad{var} into a \\indented{1}{Taylor series.}") (($ (|UnivariatePolynomial| |#2| |#1|)) "\\spad{coerce(p)} converts a univariate polynomial \\spad{p} in the variable \\spad{var} to a univariate Taylor series in \\spad{var}."))) 
 (((-4509 "*") |has| |#1| (-175)) (-4500 |has| |#1| (-570)) (-4501 . T) (-4502 . T) (-4504 . T)) 
-((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasCategory| |#1| (QUOTE (-570))) (-2225 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-570)))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (LIST (QUOTE -927) (QUOTE (-1207)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-793)) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-793)) (|devaluate| |#1|)))) (|HasCategory| (-793) (QUOTE (-1143))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-793))))) (|HasSignature| |#1| (LIST (QUOTE -2863) (LIST (|devaluate| |#1|) (QUOTE (-1207)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-793))))) (|HasCategory| |#1| (QUOTE (-376))) (-2225 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-988))) (|HasCategory| |#1| (QUOTE (-1233))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasSignature| |#1| (LIST (QUOTE -1369) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1207))))) (|HasSignature| |#1| (LIST (QUOTE -1880) (LIST (LIST (QUOTE -666) (QUOTE (-1207))) (|devaluate| |#1|))))))) 
+((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasCategory| |#1| (QUOTE (-570))) (-2225 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-570)))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (LIST (QUOTE -927) (QUOTE (-1207)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-793)) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-793)) (|devaluate| |#1|)))) (|HasCategory| (-793) (QUOTE (-1143))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-793))))) (|HasSignature| |#1| (LIST (QUOTE -2864) (LIST (|devaluate| |#1|) (QUOTE (-1207)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-793))))) (|HasCategory| |#1| (QUOTE (-376))) (-2225 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-578)))) (|HasCategory| |#1| (QUOTE (-988))) (|HasCategory| |#1| (QUOTE (-1233))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -421) (QUOTE (-578))))) (|HasSignature| |#1| (LIST (QUOTE -2924) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1207))))) (|HasSignature| |#1| (LIST (QUOTE -1880) (LIST (LIST (QUOTE -666) (QUOTE (-1207))) (|devaluate| |#1|))))))) 
 (-1291 |Coef| UTS) 
 ((|constructor| (NIL "\\indented{1}{This package provides Taylor series solutions to regular} linear or non-linear ordinary differential equations of arbitrary order.")) (|mpsode| (((|List| |#2|) (|List| |#1|) (|List| (|Mapping| |#2| (|List| |#2|)))) "\\spad{mpsode(r,f)} solves the system of differential equations \\spad{dy[i]/dx =f[i] [x,y[1],y[2],...,y[n]]},{} \\spad{y[i](a) = r[i]} for \\spad{i} in 1..\\spad{n}.")) (|ode| ((|#2| (|Mapping| |#2| (|List| |#2|)) (|List| |#1|)) "\\spad{ode(f,cl)} is the solution to \\spad{y<n>=f(y,y',..,y<n-1>)} such that \\spad{y<i>(a) = cl.i} for \\spad{i} in 1..\\spad{n}.")) (|ode2| ((|#2| (|Mapping| |#2| |#2| |#2|) |#1| |#1|) "\\spad{ode2(f,c0,c1)} is the solution to \\spad{y'' = f(y,y')} such that \\spad{y(a) = c0} and \\spad{y'(a) = c1}.")) (|ode1| ((|#2| (|Mapping| |#2| |#2|) |#1|) "\\spad{ode1(f,c)} is the solution to \\spad{y' = f(y)} such that \\spad{y(a) = c}.")) (|fixedPointExquo| ((|#2| |#2| |#2|) "\\spad{fixedPointExquo(f,g)} computes the exact quotient of \\spad{f} and \\spad{g} using a fixed point computation.")) (|stFuncN| (((|Mapping| (|Stream| |#1|) (|List| (|Stream| |#1|))) (|Mapping| |#2| (|List| |#2|))) "\\spad{stFuncN(f)} is a local function xported due to compiler problem. This function is of no interest to the top-level user.")) (|stFunc2| (((|Mapping| (|Stream| |#1|) (|Stream| |#1|) (|Stream| |#1|)) (|Mapping| |#2| |#2| |#2|)) "\\spad{stFunc2(f)} is a local function exported due to compiler problem. This function is of no interest to the top-level user.")) (|stFunc1| (((|Mapping| (|Stream| |#1|) (|Stream| |#1|)) (|Mapping| |#2| |#2|)) "\\spad{stFunc1(f)} is a local function exported due to compiler problem. This function is of no interest to the top-level user."))) 
 NIL 
 NIL 
-(-1292 -2174 UP L UTS) 
+(-1292 -2173 UP L UTS) 
 ((|constructor| (NIL "\\spad{RUTSodetools} provides tools to interface with the series \\indented{1}{ODE solver when presented with linear ODEs.}")) (RF2UTS ((|#4| (|Fraction| |#2|)) "\\spad{RF2UTS(f)} converts \\spad{f} to a Taylor series.")) (LODO2FUN (((|Mapping| |#4| (|List| |#4|)) |#3|) "\\spad{LODO2FUN(op)} returns the function to pass to the series ODE solver in order to solve \\spad{op y = 0}.")) (UTS2UP ((|#2| |#4| (|NonNegativeInteger|)) "\\spad{UTS2UP(s, n)} converts the first \\spad{n} terms of \\spad{s} to a univariate polynomial.")) (UP2UTS ((|#4| |#2|) "\\spad{UP2UTS(p)} converts \\spad{p} to a Taylor series."))) 
 NIL 
 ((|HasCategory| |#1| (QUOTE (-570)))) 
@@ -5156,7 +5156,7 @@ NIL
 ((|constructor| (NIL "This package implements the Weierstrass preparation theorem \\spad{f} or multivariate power series. weierstrass(\\spad{v},{}\\spad{p}) where \\spad{v} is a variable,{} and \\spad{p} is a TaylorSeries(\\spad{R}) in which the terms of lowest degree \\spad{s} must include c*v**s where \\spad{c} is a constant,{}\\spad{s>0},{} is a list of TaylorSeries coefficients A[\\spad{i}] of the equivalent polynomial A = A[0] + A[1]\\spad{*v} + A[2]*v**2 + ... + A[\\spad{s}-1]*v**(\\spad{s}-1) + v**s such that p=A*B ,{} \\spad{B} being a TaylorSeries of minimum degree 0")) (|qqq| (((|Mapping| (|Stream| (|TaylorSeries| |#1|)) (|Stream| (|TaylorSeries| |#1|))) (|NonNegativeInteger|) (|TaylorSeries| |#1|) (|Stream| (|TaylorSeries| |#1|))) "\\spad{qqq(n,s,st)} is used internally.")) (|weierstrass| (((|List| (|TaylorSeries| |#1|)) (|Symbol|) (|TaylorSeries| |#1|)) "\\spad{weierstrass(v,ts)} where \\spad{v} is a variable and \\spad{ts} is \\indented{1}{a TaylorSeries,{} impements the Weierstrass Preparation} \\indented{1}{Theorem. The result is a list of TaylorSeries that} \\indented{1}{are the coefficients of the equivalent series.}")) (|clikeUniv| (((|Mapping| (|SparseUnivariatePolynomial| (|Polynomial| |#1|)) (|Polynomial| |#1|)) (|Symbol|)) "\\spad{clikeUniv(v)} is used internally.")) (|sts2stst| (((|Stream| (|Stream| (|Polynomial| |#1|))) (|Symbol|) (|Stream| (|Polynomial| |#1|))) "\\spad{sts2stst(v,s)} is used internally.")) (|cfirst| (((|Mapping| (|Stream| (|Polynomial| |#1|)) (|Stream| (|Polynomial| |#1|))) (|NonNegativeInteger|)) "\\spad{cfirst n} is used internally.")) (|crest| (((|Mapping| (|Stream| (|Polynomial| |#1|)) (|Stream| (|Polynomial| |#1|))) (|NonNegativeInteger|)) "\\spad{crest n} is used internally."))) 
 NIL 
 NIL 
-(-1307 K R UP -2174) 
+(-1307 K R UP -2173) 
 ((|constructor| (NIL "In this package \\spad{K} is a finite field,{} \\spad{R} is a ring of univariate polynomials over \\spad{K},{} and \\spad{F} is a framed algebra over \\spad{R}. The package provides a function to compute the integral closure of \\spad{R} in the quotient field of \\spad{F} as well as a function to compute a \"local integral basis\" at a specific prime.")) (|localIntegralBasis| (((|Record| (|:| |basis| (|Matrix| |#2|)) (|:| |basisDen| |#2|) (|:| |basisInv| (|Matrix| |#2|))) |#2|) "\\spad{integralBasis(p)} returns a record \\spad{[basis,basisDen,basisInv]} containing information regarding the local integral closure of \\spad{R} at the prime \\spad{p} in the quotient field of \\spad{F},{} where \\spad{F} is a framed algebra with \\spad{R}-module basis \\spad{w1,w2,...,wn}. If \\spad{basis} is the matrix \\spad{(aij, i = 1..n, j = 1..n)},{} then the \\spad{i}th element of the local integral basis is \\spad{vi = (1/basisDen) * sum(aij * wj, j = 1..n)},{} \\spadignore{i.e.} the \\spad{i}th row of \\spad{basis} contains the coordinates of the \\spad{i}th basis vector. Similarly,{} the \\spad{i}th row of the matrix \\spad{basisInv} contains the coordinates of \\spad{wi} with respect to the basis \\spad{v1,...,vn}: if \\spad{basisInv} is the matrix \\spad{(bij, i = 1..n, j = 1..n)},{} then \\spad{wi = sum(bij * vj, j = 1..n)}.")) (|integralBasis| (((|Record| (|:| |basis| (|Matrix| |#2|)) (|:| |basisDen| |#2|) (|:| |basisInv| (|Matrix| |#2|)))) "\\spad{integralBasis()} returns a record \\spad{[basis,basisDen,basisInv]} containing information regarding the integral closure of \\spad{R} in the quotient field of \\spad{F},{} where \\spad{F} is a framed algebra with \\spad{R}-module basis \\spad{w1,w2,...,wn}. If \\spad{basis} is the matrix \\spad{(aij, i = 1..n, j = 1..n)},{} then the \\spad{i}th element of the integral basis is \\spad{vi = (1/basisDen) * sum(aij * wj, j = 1..n)},{} \\spadignore{i.e.} the \\spad{i}th row of \\spad{basis} contains the coordinates of the \\spad{i}th basis vector. Similarly,{} the \\spad{i}th row of the matrix \\spad{basisInv} contains the coordinates of \\spad{wi} with respect to the basis \\spad{v1,...,vn}: if \\spad{basisInv} is the matrix \\spad{(bij, i = 1..n, j = 1..n)},{} then \\spad{wi = sum(bij * vj, j = 1..n)}."))) 
 NIL 
 NIL 
@@ -5192,11 +5192,11 @@ NIL
 ((|constructor| (NIL "This category specifies opeations for polynomials and formal series with non-commutative variables.")) (|varList| (((|List| |#1|) $) "\\spad{varList(x)} returns the list of variables which appear in \\spad{x}.")) (|map| (($ (|Mapping| |#2| |#2|) $) "\\spad{map(fn,x)} returns \\spad{Sum(fn(r_i) w_i)} if \\spad{x} writes \\spad{Sum(r_i w_i)}.")) (|sh| (($ $ (|NonNegativeInteger|)) "\\spad{sh(x,n)} returns the shuffle power of \\spad{x} to the \\spad{n}.") (($ $ $) "\\spad{sh(x,y)} returns the shuffle-product of \\spad{x} by \\spad{y}. This multiplication is associative and commutative.")) (|quasiRegular| (($ $) "\\spad{quasiRegular(x)} return \\spad{x} minus its constant term.")) (|quasiRegular?| (((|Boolean|) $) "\\spad{quasiRegular?(x)} return \\spad{true} if \\spad{constant(x)} is zero.")) (|constant| ((|#2| $) "\\spad{constant(x)} returns the constant term of \\spad{x}.")) (|constant?| (((|Boolean|) $) "\\spad{constant?(x)} returns \\spad{true} if \\spad{x} is constant.")) (|coerce| (($ |#1|) "\\spad{coerce(v)} returns \\spad{v}.")) (|mirror| (($ $) "\\spad{mirror(x)} returns \\spad{Sum(r_i mirror(w_i))} if \\spad{x} writes \\spad{Sum(r_i w_i)}.")) (|monomial?| (((|Boolean|) $) "\\spad{monomial?(x)} returns \\spad{true} if \\spad{x} is a monomial")) (|monom| (($ (|OrderedFreeMonoid| |#1|) |#2|) "\\spad{monom(w,r)} returns the product of the word \\spad{w} by the coefficient \\spad{r}.")) (|rquo| (($ $ $) "\\spad{rquo(x,y)} returns the right simplification of \\spad{x} by \\spad{y}.") (($ $ (|OrderedFreeMonoid| |#1|)) "\\spad{rquo(x,w)} returns the right simplification of \\spad{x} by \\spad{w}.") (($ $ |#1|) "\\spad{rquo(x,v)} returns the right simplification of \\spad{x} by the variable \\spad{v}.")) (|lquo| (($ $ $) "\\spad{lquo(x,y)} returns the left simplification of \\spad{x} by \\spad{y}.") (($ $ (|OrderedFreeMonoid| |#1|)) "\\spad{lquo(x,w)} returns the left simplification of \\spad{x} by the word \\spad{w}.") (($ $ |#1|) "\\spad{lquo(x,v)} returns the left simplification of \\spad{x} by the variable \\spad{v}.")) (|coef| ((|#2| $ $) "\\spad{coef(x,y)} returns scalar product of \\spad{x} by \\spad{y},{} the set of words being regarded as an orthogonal basis.") ((|#2| $ (|OrderedFreeMonoid| |#1|)) "\\spad{coef(x,w)} returns the coefficient of the word \\spad{w} in \\spad{x}.")) (|mindegTerm| (((|Record| (|:| |k| (|OrderedFreeMonoid| |#1|)) (|:| |c| |#2|)) $) "\\spad{mindegTerm(x)} returns the term whose word is \\spad{mindeg(x)}.")) (|mindeg| (((|OrderedFreeMonoid| |#1|) $) "\\spad{mindeg(x)} returns the little word which appears in \\spad{x}. Error if \\spad{x=0}.")) (* (($ $ |#2|) "\\spad{x * r} returns the product of \\spad{x} by \\spad{r}. Usefull if \\spad{R} is a non-commutative Ring.") (($ |#1| $) "\\spad{v * x} returns the product of a variable \\spad{x} by \\spad{x}."))) 
 ((-4500 |has| |#2| (-6 -4500)) (-4502 . T) (-4501 . T) (-4504 . T)) 
 NIL 
-(-1316 S -2174) 
+(-1316 S -2173) 
 ((|constructor| (NIL "ExtensionField {\\em F} is the category of fields which extend the field \\spad{F}")) (|Frobenius| (($ $ (|NonNegativeInteger|)) "\\spad{Frobenius(a,s)} returns \\spad{a**(q**s)} where \\spad{q} is the size()\\$\\spad{F}.") (($ $) "\\spad{Frobenius(a)} returns \\spad{a ** q} where \\spad{q} is the \\spad{size()\\$F}.")) (|transcendenceDegree| (((|NonNegativeInteger|)) "\\spad{transcendenceDegree()} returns the transcendence degree of the field extension,{} 0 if the extension is algebraic.")) (|extensionDegree| (((|OnePointCompletion| (|PositiveInteger|))) "\\spad{extensionDegree()} returns the degree of the field extension if the extension is algebraic,{} and \\spad{infinity} if it is not.")) (|degree| (((|OnePointCompletion| (|PositiveInteger|)) $) "\\spad{degree(a)} returns the degree of minimal polynomial of an element \\spad{a} if \\spad{a} is algebraic with respect to the ground field \\spad{F},{} and \\spad{infinity} otherwise.")) (|inGroundField?| (((|Boolean|) $) "\\spad{inGroundField?(a)} tests whether an element \\spad{a} is already in the ground field \\spad{F}.")) (|transcendent?| (((|Boolean|) $) "\\spad{transcendent?(a)} tests whether an element \\spad{a} is transcendent with respect to the ground field \\spad{F}.")) (|algebraic?| (((|Boolean|) $) "\\spad{algebraic?(a)} tests whether an element \\spad{a} is algebraic with respect to the ground field \\spad{F}."))) 
 NIL 
 ((|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-149)))) 
-(-1317 -2174) 
+(-1317 -2173) 
 ((|constructor| (NIL "ExtensionField {\\em F} is the category of fields which extend the field \\spad{F}")) (|Frobenius| (($ $ (|NonNegativeInteger|)) "\\spad{Frobenius(a,s)} returns \\spad{a**(q**s)} where \\spad{q} is the size()\\$\\spad{F}.") (($ $) "\\spad{Frobenius(a)} returns \\spad{a ** q} where \\spad{q} is the \\spad{size()\\$F}.")) (|transcendenceDegree| (((|NonNegativeInteger|)) "\\spad{transcendenceDegree()} returns the transcendence degree of the field extension,{} 0 if the extension is algebraic.")) (|extensionDegree| (((|OnePointCompletion| (|PositiveInteger|))) "\\spad{extensionDegree()} returns the degree of the field extension if the extension is algebraic,{} and \\spad{infinity} if it is not.")) (|degree| (((|OnePointCompletion| (|PositiveInteger|)) $) "\\spad{degree(a)} returns the degree of minimal polynomial of an element \\spad{a} if \\spad{a} is algebraic with respect to the ground field \\spad{F},{} and \\spad{infinity} otherwise.")) (|inGroundField?| (((|Boolean|) $) "\\spad{inGroundField?(a)} tests whether an element \\spad{a} is already in the ground field \\spad{F}.")) (|transcendent?| (((|Boolean|) $) "\\spad{transcendent?(a)} tests whether an element \\spad{a} is transcendent with respect to the ground field \\spad{F}.")) (|algebraic?| (((|Boolean|) $) "\\spad{algebraic?(a)} tests whether an element \\spad{a} is algebraic with respect to the ground field \\spad{F}."))) 
 ((-4499 . T) (-4505 . T) (-4500 . T) ((-4509 "*") . T) (-4501 . T) (-4502 . T) (-4504 . T)) 
 NIL 
@@ -5256,4 +5256,4 @@ NIL
 NIL 
 NIL 
 NIL 
-((-3 NIL 2300671 2300676 2300681 2300686) (-2 NIL 2300651 2300656 2300661 2300666) (-1 NIL 2300631 2300636 2300641 2300646) (0 NIL 2300611 2300616 2300621 2300626) (-1327 "ZMOD.spad" 2300420 2300433 2300549 2300606) (-1326 "ZLINDEP.spad" 2299486 2299497 2300410 2300415) (-1325 "ZDSOLVE.spad" 2289430 2289452 2299476 2299481) (-1324 "YSTREAM.spad" 2288925 2288936 2289420 2289425) (-1323 "YDIAGRAM.spad" 2288559 2288568 2288915 2288920) (-1322 "XRPOLY.spad" 2287779 2287799 2288415 2288484) (-1321 "XPR.spad" 2285574 2285587 2287497 2287596) (-1320 "XPOLY.spad" 2285129 2285140 2285430 2285499) (-1319 "XPOLYC.spad" 2284448 2284464 2285055 2285124) (-1318 "XPBWPOLY.spad" 2282885 2282905 2284228 2284297) (-1317 "XF.spad" 2281348 2281363 2282787 2282880) (-1316 "XF.spad" 2279791 2279808 2281232 2281237) (-1315 "XFALG.spad" 2276839 2276855 2279717 2279786) (-1314 "XEXPPKG.spad" 2276090 2276116 2276829 2276834) (-1313 "XDPOLY.spad" 2275704 2275720 2275946 2276015) (-1312 "XALG.spad" 2275364 2275375 2275660 2275699) (-1311 "WUTSET.spad" 2271167 2271184 2274974 2275001) (-1310 "WP.spad" 2270366 2270410 2271025 2271092) (-1309 "WHILEAST.spad" 2270164 2270173 2270356 2270361) (-1308 "WHEREAST.spad" 2269835 2269844 2270154 2270159) (-1307 "WFFINTBS.spad" 2267498 2267520 2269825 2269830) (-1306 "WEIER.spad" 2265720 2265731 2267488 2267493) (-1305 "VSPACE.spad" 2265393 2265404 2265688 2265715) (-1304 "VSPACE.spad" 2265086 2265099 2265383 2265388) (-1303 "VOID.spad" 2264763 2264772 2265076 2265081) (-1302 "VIEW.spad" 2262443 2262452 2264753 2264758) (-1301 "VIEWDEF.spad" 2257644 2257653 2262433 2262438) (-1300 "VIEW3D.spad" 2241605 2241614 2257634 2257639) (-1299 "VIEW2D.spad" 2229496 2229505 2241595 2241600) (-1298 "VECTOR.spad" 2228017 2228028 2228268 2228295) (-1297 "VECTOR2.spad" 2226656 2226669 2228007 2228012) (-1296 "VECTCAT.spad" 2224560 2224571 2226624 2226651) (-1295 "VECTCAT.spad" 2222271 2222284 2224337 2224342) (-1294 "VARIABLE.spad" 2222051 2222066 2222261 2222266) (-1293 "UTYPE.spad" 2221695 2221704 2222041 2222046) (-1292 "UTSODETL.spad" 2220990 2221014 2221651 2221656) (-1291 "UTSODE.spad" 2219206 2219226 2220980 2220985) (-1290 "UTS.spad" 2214153 2214181 2217673 2217770) (-1289 "UTSCAT.spad" 2211632 2211648 2214051 2214148) (-1288 "UTSCAT.spad" 2208755 2208773 2211176 2211181) (-1287 "UTS2.spad" 2208350 2208385 2208745 2208750) (-1286 "URAGG.spad" 2203023 2203034 2208340 2208345) (-1285 "URAGG.spad" 2197660 2197673 2202979 2202984) (-1284 "UPXSSING.spad" 2195305 2195331 2196741 2196874) (-1283 "UPXS.spad" 2192601 2192629 2193437 2193586) (-1282 "UPXSCONS.spad" 2190360 2190380 2190733 2190882) (-1281 "UPXSCCA.spad" 2188931 2188951 2190206 2190355) (-1280 "UPXSCCA.spad" 2187644 2187666 2188921 2188926) (-1279 "UPXSCAT.spad" 2186233 2186249 2187490 2187639) (-1278 "UPXS2.spad" 2185776 2185829 2186223 2186228) (-1277 "UPSQFREE.spad" 2184190 2184204 2185766 2185771) (-1276 "UPSCAT.spad" 2181977 2182001 2184088 2184185) (-1275 "UPSCAT.spad" 2179470 2179496 2181583 2181588) (-1274 "UPOLYC.spad" 2174510 2174521 2179312 2179465) (-1273 "UPOLYC.spad" 2169442 2169455 2174246 2174251) (-1272 "UPOLYC2.spad" 2168913 2168932 2169432 2169437) (-1271 "UP.spad" 2166019 2166034 2166406 2166559) (-1270 "UPMP.spad" 2164919 2164932 2166009 2166014) (-1269 "UPDIVP.spad" 2164484 2164498 2164909 2164914) (-1268 "UPDECOMP.spad" 2162729 2162743 2164474 2164479) (-1267 "UPCDEN.spad" 2161938 2161954 2162719 2162724) (-1266 "UP2.spad" 2161302 2161323 2161928 2161933) (-1265 "UNISEG.spad" 2160655 2160666 2161221 2161226) (-1264 "UNISEG2.spad" 2160152 2160165 2160611 2160616) (-1263 "UNIFACT.spad" 2159255 2159267 2160142 2160147) (-1262 "ULS.spad" 2149039 2149067 2149984 2150413) (-1261 "ULSCONS.spad" 2140173 2140193 2140543 2140692) (-1260 "ULSCCAT.spad" 2137910 2137930 2140019 2140168) (-1259 "ULSCCAT.spad" 2135755 2135777 2137866 2137871) (-1258 "ULSCAT.spad" 2133987 2134003 2135601 2135750) (-1257 "ULS2.spad" 2133501 2133554 2133977 2133982) (-1256 "UINT8.spad" 2133378 2133387 2133491 2133496) (-1255 "UINT64.spad" 2133254 2133263 2133368 2133373) (-1254 "UINT32.spad" 2133130 2133139 2133244 2133249) (-1253 "UINT16.spad" 2133006 2133015 2133120 2133125) (-1252 "UFD.spad" 2132071 2132080 2132932 2133001) (-1251 "UFD.spad" 2131198 2131209 2132061 2132066) (-1250 "UDVO.spad" 2130079 2130088 2131188 2131193) (-1249 "UDPO.spad" 2127572 2127583 2130035 2130040) (-1248 "TYPE.spad" 2127504 2127513 2127562 2127567) (-1247 "TYPEAST.spad" 2127423 2127432 2127494 2127499) (-1246 "TWOFACT.spad" 2126075 2126090 2127413 2127418) (-1245 "TUPLE.spad" 2125561 2125572 2125974 2125979) (-1244 "TUBETOOL.spad" 2122428 2122437 2125551 2125556) (-1243 "TUBE.spad" 2121075 2121092 2122418 2122423) (-1242 "TS.spad" 2119674 2119690 2120640 2120737) (-1241 "TSETCAT.spad" 2106801 2106818 2119642 2119669) (-1240 "TSETCAT.spad" 2093914 2093933 2106757 2106762) (-1239 "TRMANIP.spad" 2088280 2088297 2093620 2093625) (-1238 "TRIMAT.spad" 2087243 2087268 2088270 2088275) (-1237 "TRIGMNIP.spad" 2085770 2085787 2087233 2087238) (-1236 "TRIGCAT.spad" 2085282 2085291 2085760 2085765) (-1235 "TRIGCAT.spad" 2084792 2084803 2085272 2085277) (-1234 "TREE.spad" 2083250 2083261 2084282 2084309) (-1233 "TRANFUN.spad" 2083089 2083098 2083240 2083245) (-1232 "TRANFUN.spad" 2082926 2082937 2083079 2083084) (-1231 "TOPSP.spad" 2082600 2082609 2082916 2082921) (-1230 "TOOLSIGN.spad" 2082263 2082274 2082590 2082595) (-1229 "TEXTFILE.spad" 2080824 2080833 2082253 2082258) (-1228 "TEX.spad" 2077970 2077979 2080814 2080819) (-1227 "TEX1.spad" 2077526 2077537 2077960 2077965) (-1226 "TEMUTL.spad" 2077081 2077090 2077516 2077521) (-1225 "TBCMPPK.spad" 2075174 2075197 2077071 2077076) (-1224 "TBAGG.spad" 2074224 2074247 2075154 2075169) (-1223 "TBAGG.spad" 2073282 2073307 2074214 2074219) (-1222 "TANEXP.spad" 2072690 2072701 2073272 2073277) (-1221 "TALGOP.spad" 2072414 2072425 2072680 2072685) (-1220 "TABLE.spad" 2070383 2070406 2070653 2070680) (-1219 "TABLEAU.spad" 2069864 2069875 2070373 2070378) (-1218 "TABLBUMP.spad" 2066667 2066678 2069854 2069859) (-1217 "SYSTEM.spad" 2065895 2065904 2066657 2066662) (-1216 "SYSSOLP.spad" 2063378 2063389 2065885 2065890) (-1215 "SYSPTR.spad" 2063277 2063286 2063368 2063373) (-1214 "SYSNNI.spad" 2062468 2062479 2063267 2063272) (-1213 "SYSINT.spad" 2061872 2061883 2062458 2062463) (-1212 "SYNTAX.spad" 2058078 2058087 2061862 2061867) (-1211 "SYMTAB.spad" 2056146 2056155 2058068 2058073) (-1210 "SYMS.spad" 2052169 2052178 2056136 2056141) (-1209 "SYMPOLY.spad" 2051175 2051186 2051257 2051384) (-1208 "SYMFUNC.spad" 2050676 2050687 2051165 2051170) (-1207 "SYMBOL.spad" 2048179 2048188 2050666 2050671) (-1206 "SWITCH.spad" 2044950 2044959 2048169 2048174) (-1205 "SUTS.spad" 2041998 2042026 2043417 2043514) (-1204 "SUPXS.spad" 2039281 2039309 2040130 2040279) (-1203 "SUP.spad" 2036001 2036012 2036774 2036927) (-1202 "SUPFRACF.spad" 2035106 2035124 2035991 2035996) (-1201 "SUP2.spad" 2034498 2034511 2035096 2035101) (-1200 "SUMRF.spad" 2033472 2033483 2034488 2034493) (-1199 "SUMFS.spad" 2033109 2033126 2033462 2033467) (-1198 "SULS.spad" 2022880 2022908 2023838 2024267) (-1197 "SUCHTAST.spad" 2022649 2022658 2022870 2022875) (-1196 "SUCH.spad" 2022331 2022346 2022639 2022644) (-1195 "SUBSPACE.spad" 2014446 2014461 2022321 2022326) (-1194 "SUBRESP.spad" 2013616 2013630 2014402 2014407) (-1193 "STTF.spad" 2009715 2009731 2013606 2013611) (-1192 "STTFNC.spad" 2006183 2006199 2009705 2009710) (-1191 "STTAYLOR.spad" 1998818 1998829 2006064 2006069) (-1190 "STRTBL.spad" 1996869 1996886 1997018 1997045) (-1189 "STRING.spad" 1995656 1995665 1995877 1995904) (-1188 "STREAM.spad" 1992457 1992468 1995064 1995079) (-1187 "STREAM3.spad" 1992030 1992045 1992447 1992452) (-1186 "STREAM2.spad" 1991158 1991171 1992020 1992025) (-1185 "STREAM1.spad" 1990864 1990875 1991148 1991153) (-1184 "STINPROD.spad" 1989800 1989816 1990854 1990859) (-1183 "STEP.spad" 1989001 1989010 1989790 1989795) (-1182 "STEPAST.spad" 1988235 1988244 1988991 1988996) (-1181 "STBL.spad" 1986319 1986347 1986486 1986501) (-1180 "STAGG.spad" 1985394 1985405 1986309 1986314) (-1179 "STAGG.spad" 1984467 1984480 1985384 1985389) (-1178 "STACK.spad" 1983707 1983718 1983957 1983984) (-1177 "SREGSET.spad" 1981375 1981392 1983317 1983344) (-1176 "SRDCMPK.spad" 1979936 1979956 1981365 1981370) (-1175 "SRAGG.spad" 1975079 1975088 1979904 1979931) (-1174 "SRAGG.spad" 1970242 1970253 1975069 1975074) (-1173 "SQMATRIX.spad" 1967785 1967803 1968701 1968788) (-1172 "SPLTREE.spad" 1962181 1962194 1967065 1967092) (-1171 "SPLNODE.spad" 1958769 1958782 1962171 1962176) (-1170 "SPFCAT.spad" 1957578 1957587 1958759 1958764) (-1169 "SPECOUT.spad" 1956130 1956139 1957568 1957573) (-1168 "SPADXPT.spad" 1947725 1947734 1956120 1956125) (-1167 "spad-parser.spad" 1947190 1947199 1947715 1947720) (-1166 "SPADAST.spad" 1946891 1946900 1947180 1947185) (-1165 "SPACEC.spad" 1931090 1931101 1946881 1946886) (-1164 "SPACE3.spad" 1930866 1930877 1931080 1931085) (-1163 "SORTPAK.spad" 1930415 1930428 1930822 1930827) (-1162 "SOLVETRA.spad" 1928178 1928189 1930405 1930410) (-1161 "SOLVESER.spad" 1926706 1926717 1928168 1928173) (-1160 "SOLVERAD.spad" 1922732 1922743 1926696 1926701) (-1159 "SOLVEFOR.spad" 1921194 1921212 1922722 1922727) (-1158 "SNTSCAT.spad" 1920794 1920811 1921162 1921189) (-1157 "SMTS.spad" 1919066 1919092 1920359 1920456) (-1156 "SMP.spad" 1916541 1916561 1916931 1917058) (-1155 "SMITH.spad" 1915386 1915411 1916531 1916536) (-1154 "SMATCAT.spad" 1913496 1913526 1915330 1915381) (-1153 "SMATCAT.spad" 1911538 1911570 1913374 1913379) (-1152 "SKAGG.spad" 1910501 1910512 1911506 1911533) (-1151 "SINT.spad" 1909441 1909450 1910367 1910496) (-1150 "SIMPAN.spad" 1909169 1909178 1909431 1909436) (-1149 "SIG.spad" 1908499 1908508 1909159 1909164) (-1148 "SIGNRF.spad" 1907617 1907628 1908489 1908494) (-1147 "SIGNEF.spad" 1906896 1906913 1907607 1907612) (-1146 "SIGAST.spad" 1906281 1906290 1906886 1906891) (-1145 "SHP.spad" 1904209 1904224 1906237 1906242) (-1144 "SHDP.spad" 1891887 1891914 1892396 1892495) (-1143 "SGROUP.spad" 1891495 1891504 1891877 1891882) (-1142 "SGROUP.spad" 1891101 1891112 1891485 1891490) (-1141 "SGCF.spad" 1884240 1884249 1891091 1891096) (-1140 "SFRTCAT.spad" 1883170 1883187 1884208 1884235) (-1139 "SFRGCD.spad" 1882233 1882253 1883160 1883165) (-1138 "SFQCMPK.spad" 1876870 1876890 1882223 1882228) (-1137 "SFORT.spad" 1876309 1876323 1876860 1876865) (-1136 "SEXOF.spad" 1876152 1876192 1876299 1876304) (-1135 "SEX.spad" 1876044 1876053 1876142 1876147) (-1134 "SEXCAT.spad" 1873816 1873856 1876034 1876039) (-1133 "SET.spad" 1872104 1872115 1873201 1873240) (-1132 "SETMN.spad" 1870554 1870571 1872094 1872099) (-1131 "SETCAT.spad" 1870039 1870048 1870544 1870549) (-1130 "SETCAT.spad" 1869522 1869533 1870029 1870034) (-1129 "SETAGG.spad" 1866071 1866082 1869502 1869517) (-1128 "SETAGG.spad" 1862628 1862641 1866061 1866066) (-1127 "SEQAST.spad" 1862331 1862340 1862618 1862623) (-1126 "SEGXCAT.spad" 1861487 1861500 1862321 1862326) (-1125 "SEG.spad" 1861300 1861311 1861406 1861411) (-1124 "SEGCAT.spad" 1860225 1860236 1861290 1861295) (-1123 "SEGBIND.spad" 1859983 1859994 1860172 1860177) (-1122 "SEGBIND2.spad" 1859681 1859694 1859973 1859978) (-1121 "SEGAST.spad" 1859395 1859404 1859671 1859676) (-1120 "SEG2.spad" 1858830 1858843 1859351 1859356) (-1119 "SDVAR.spad" 1858106 1858117 1858820 1858825) (-1118 "SDPOL.spad" 1855439 1855450 1855730 1855857) (-1117 "SCPKG.spad" 1853528 1853539 1855429 1855434) (-1116 "SCOPE.spad" 1852681 1852690 1853518 1853523) (-1115 "SCACHE.spad" 1851377 1851388 1852671 1852676) (-1114 "SASTCAT.spad" 1851286 1851295 1851367 1851372) (-1113 "SAOS.spad" 1851158 1851167 1851276 1851281) (-1112 "SAERFFC.spad" 1850871 1850891 1851148 1851153) (-1111 "SAE.spad" 1848341 1848357 1848952 1849087) (-1110 "SAEFACT.spad" 1848042 1848062 1848331 1848336) (-1109 "RURPK.spad" 1845701 1845717 1848032 1848037) (-1108 "RULESET.spad" 1845154 1845178 1845691 1845696) (-1107 "RULE.spad" 1843394 1843418 1845144 1845149) (-1106 "RULECOLD.spad" 1843246 1843259 1843384 1843389) (-1105 "RTVALUE.spad" 1842981 1842990 1843236 1843241) (-1104 "RSTRCAST.spad" 1842698 1842707 1842971 1842976) (-1103 "RSETGCD.spad" 1839076 1839096 1842688 1842693) (-1102 "RSETCAT.spad" 1829012 1829029 1839044 1839071) (-1101 "RSETCAT.spad" 1818968 1818987 1829002 1829007) (-1100 "RSDCMPK.spad" 1817420 1817440 1818958 1818963) (-1099 "RRCC.spad" 1815804 1815834 1817410 1817415) (-1098 "RRCC.spad" 1814186 1814218 1815794 1815799) (-1097 "RPTAST.spad" 1813888 1813897 1814176 1814181) (-1096 "RPOLCAT.spad" 1793248 1793263 1813756 1813883) (-1095 "RPOLCAT.spad" 1772321 1772338 1792831 1792836) (-1094 "ROUTINE.spad" 1767742 1767751 1770506 1770533) (-1093 "ROMAN.spad" 1767070 1767079 1767608 1767737) (-1092 "ROIRC.spad" 1766150 1766182 1767060 1767065) (-1091 "RNS.spad" 1765053 1765062 1766052 1766145) (-1090 "RNS.spad" 1764042 1764053 1765043 1765048) (-1089 "RNG.spad" 1763777 1763786 1764032 1764037) (-1088 "RNGBIND.spad" 1762937 1762951 1763732 1763737) (-1087 "RMODULE.spad" 1762702 1762713 1762927 1762932) (-1086 "RMCAT2.spad" 1762122 1762179 1762692 1762697) (-1085 "RMATRIX.spad" 1760910 1760929 1761253 1761292) (-1084 "RMATCAT.spad" 1756489 1756520 1760866 1760905) (-1083 "RMATCAT.spad" 1751958 1751991 1756337 1756342) (-1082 "RLINSET.spad" 1751662 1751673 1751948 1751953) (-1081 "RINTERP.spad" 1751550 1751570 1751652 1751657) (-1080 "RING.spad" 1751020 1751029 1751530 1751545) (-1079 "RING.spad" 1750498 1750509 1751010 1751015) (-1078 "RIDIST.spad" 1749890 1749899 1750488 1750493) (-1077 "RGCHAIN.spad" 1748418 1748434 1749320 1749347) (-1076 "RGBCSPC.spad" 1748199 1748211 1748408 1748413) (-1075 "RGBCMDL.spad" 1747729 1747741 1748189 1748194) (-1074 "RF.spad" 1745371 1745382 1747719 1747724) (-1073 "RFFACTOR.spad" 1744833 1744844 1745361 1745366) (-1072 "RFFACT.spad" 1744568 1744580 1744823 1744828) (-1071 "RFDIST.spad" 1743564 1743573 1744558 1744563) (-1070 "RETSOL.spad" 1742983 1742996 1743554 1743559) (-1069 "RETRACT.spad" 1742411 1742422 1742973 1742978) (-1068 "RETRACT.spad" 1741837 1741850 1742401 1742406) (-1067 "RETAST.spad" 1741649 1741658 1741827 1741832) (-1066 "RESULT.spad" 1739247 1739256 1739834 1739861) (-1065 "RESRING.spad" 1738594 1738641 1739185 1739242) (-1064 "RESLATC.spad" 1737918 1737929 1738584 1738589) (-1063 "REPSQ.spad" 1737649 1737660 1737908 1737913) (-1062 "REP.spad" 1735203 1735212 1737639 1737644) (-1061 "REPDB.spad" 1734910 1734921 1735193 1735198) (-1060 "REP2.spad" 1724568 1724579 1734752 1734757) (-1059 "REP1.spad" 1718764 1718775 1724518 1724523) (-1058 "REGSET.spad" 1716525 1716542 1718374 1718401) (-1057 "REF.spad" 1715860 1715871 1716480 1716485) (-1056 "REDORDER.spad" 1715066 1715083 1715850 1715855) (-1055 "RECLOS.spad" 1713849 1713869 1714553 1714646) (-1054 "REALSOLV.spad" 1712989 1712998 1713839 1713844) (-1053 "REAL.spad" 1712861 1712870 1712979 1712984) (-1052 "REAL0Q.spad" 1710159 1710174 1712851 1712856) (-1051 "REAL0.spad" 1707003 1707018 1710149 1710154) (-1050 "RDUCEAST.spad" 1706724 1706733 1706993 1706998) (-1049 "RDIV.spad" 1706379 1706404 1706714 1706719) (-1048 "RDIST.spad" 1705946 1705957 1706369 1706374) (-1047 "RDETRS.spad" 1704810 1704828 1705936 1705941) (-1046 "RDETR.spad" 1702949 1702967 1704800 1704805) (-1045 "RDEEFS.spad" 1702048 1702065 1702939 1702944) (-1044 "RDEEF.spad" 1701058 1701075 1702038 1702043) (-1043 "RCFIELD.spad" 1698244 1698253 1700960 1701053) (-1042 "RCFIELD.spad" 1695516 1695527 1698234 1698239) (-1041 "RCAGG.spad" 1693444 1693455 1695506 1695511) (-1040 "RCAGG.spad" 1691299 1691312 1693363 1693368) (-1039 "RATRET.spad" 1690659 1690670 1691289 1691294) (-1038 "RATFACT.spad" 1690351 1690363 1690649 1690654) (-1037 "RANDSRC.spad" 1689670 1689679 1690341 1690346) (-1036 "RADUTIL.spad" 1689426 1689435 1689660 1689665) (-1035 "RADIX.spad" 1686250 1686264 1687796 1687889) (-1034 "RADFF.spad" 1683989 1684026 1684108 1684264) (-1033 "RADCAT.spad" 1683584 1683593 1683979 1683984) (-1032 "RADCAT.spad" 1683177 1683188 1683574 1683579) (-1031 "QUEUE.spad" 1682408 1682419 1682667 1682694) (-1030 "QUAT.spad" 1680896 1680907 1681239 1681304) (-1029 "QUATCT2.spad" 1680516 1680535 1680886 1680891) (-1028 "QUATCAT.spad" 1678686 1678697 1680446 1680511) (-1027 "QUATCAT.spad" 1676607 1676620 1678369 1678374) (-1026 "QUAGG.spad" 1675434 1675445 1676575 1676602) (-1025 "QQUTAST.spad" 1675202 1675211 1675424 1675429) (-1024 "QFORM.spad" 1674820 1674835 1675192 1675197) (-1023 "QFCAT.spad" 1673522 1673533 1674722 1674815) (-1022 "QFCAT.spad" 1671815 1671828 1673017 1673022) (-1021 "QFCAT2.spad" 1671507 1671524 1671805 1671810) (-1020 "QEQUAT.spad" 1671065 1671074 1671497 1671502) (-1019 "QCMPACK.spad" 1665811 1665831 1671055 1671060) (-1018 "QALGSET.spad" 1661889 1661922 1665725 1665730) (-1017 "QALGSET2.spad" 1659884 1659903 1661879 1661884) (-1016 "PWFFINTB.spad" 1657299 1657321 1659874 1659879) (-1015 "PUSHVAR.spad" 1656637 1656657 1657289 1657294) (-1014 "PTRANFN.spad" 1652764 1652775 1656627 1656632) (-1013 "PTPACK.spad" 1649851 1649862 1652754 1652759) (-1012 "PTFUNC2.spad" 1649673 1649688 1649841 1649846) (-1011 "PTCAT.spad" 1648927 1648938 1649641 1649668) (-1010 "PSQFR.spad" 1648233 1648258 1648917 1648922) (-1009 "PSEUDLIN.spad" 1647118 1647129 1648223 1648228) (-1008 "PSETPK.spad" 1632550 1632567 1646996 1647001) (-1007 "PSETCAT.spad" 1626469 1626493 1632530 1632545) (-1006 "PSETCAT.spad" 1620362 1620388 1626425 1626430) (-1005 "PSCURVE.spad" 1619344 1619353 1620352 1620357) (-1004 "PSCAT.spad" 1618126 1618156 1619242 1619339) (-1003 "PSCAT.spad" 1616998 1617030 1618116 1618121) (-1002 "PRTITION.spad" 1615695 1615704 1616988 1616993) (-1001 "PRTDAST.spad" 1615413 1615422 1615685 1615690) (-1000 "PRS.spad" 1604974 1604992 1615369 1615374) (-999 "PRQAGG.spad" 1604409 1604419 1604942 1604969) (-998 "PROPLOG.spad" 1603981 1603989 1604399 1604404) (-997 "PROPFUN2.spad" 1603604 1603617 1603971 1603976) (-996 "PROPFUN1.spad" 1603002 1603013 1603594 1603599) (-995 "PROPFRML.spad" 1601570 1601581 1602992 1602997) (-994 "PROPERTY.spad" 1601058 1601066 1601560 1601565) (-993 "PRODUCT.spad" 1598740 1598752 1599024 1599079) (-992 "PR.spad" 1597132 1597144 1597831 1597958) (-991 "PRINT.spad" 1596884 1596892 1597122 1597127) (-990 "PRIMES.spad" 1595137 1595147 1596874 1596879) (-989 "PRIMELT.spad" 1593218 1593232 1595127 1595132) (-988 "PRIMCAT.spad" 1592845 1592853 1593208 1593213) (-987 "PRIMARR.spad" 1591697 1591707 1591875 1591902) (-986 "PRIMARR2.spad" 1590464 1590476 1591687 1591692) (-985 "PREASSOC.spad" 1589846 1589858 1590454 1590459) (-984 "PPCURVE.spad" 1588983 1588991 1589836 1589841) (-983 "PORTNUM.spad" 1588758 1588766 1588973 1588978) (-982 "POLYROOT.spad" 1587607 1587629 1588714 1588719) (-981 "POLY.spad" 1584942 1584952 1585457 1585584) (-980 "POLYLIFT.spad" 1584207 1584230 1584932 1584937) (-979 "POLYCATQ.spad" 1582325 1582347 1584197 1584202) (-978 "POLYCAT.spad" 1575795 1575816 1582193 1582320) (-977 "POLYCAT.spad" 1568603 1568626 1575003 1575008) (-976 "POLY2UP.spad" 1568055 1568069 1568593 1568598) (-975 "POLY2.spad" 1567652 1567664 1568045 1568050) (-974 "POLUTIL.spad" 1566593 1566622 1567608 1567613) (-973 "POLTOPOL.spad" 1565341 1565356 1566583 1566588) (-972 "POINT.spad" 1564026 1564036 1564113 1564140) (-971 "PNTHEORY.spad" 1560728 1560736 1564016 1564021) (-970 "PMTOOLS.spad" 1559503 1559517 1560718 1560723) (-969 "PMSYM.spad" 1559052 1559062 1559493 1559498) (-968 "PMQFCAT.spad" 1558643 1558657 1559042 1559047) (-967 "PMPRED.spad" 1558122 1558136 1558633 1558638) (-966 "PMPREDFS.spad" 1557576 1557598 1558112 1558117) (-965 "PMPLCAT.spad" 1556656 1556674 1557508 1557513) (-964 "PMLSAGG.spad" 1556241 1556255 1556646 1556651) (-963 "PMKERNEL.spad" 1555820 1555832 1556231 1556236) (-962 "PMINS.spad" 1555400 1555410 1555810 1555815) (-961 "PMFS.spad" 1554977 1554995 1555390 1555395) (-960 "PMDOWN.spad" 1554267 1554281 1554967 1554972) (-959 "PMASS.spad" 1553277 1553285 1554257 1554262) (-958 "PMASSFS.spad" 1552244 1552260 1553267 1553272) (-957 "PLOTTOOL.spad" 1552024 1552032 1552234 1552239) (-956 "PLOT.spad" 1546947 1546955 1552014 1552019) (-955 "PLOT3D.spad" 1543411 1543419 1546937 1546942) (-954 "PLOT1.spad" 1542568 1542578 1543401 1543406) (-953 "PLEQN.spad" 1529858 1529885 1542558 1542563) (-952 "PINTERP.spad" 1529480 1529499 1529848 1529853) (-951 "PINTERPA.spad" 1529264 1529280 1529470 1529475) (-950 "PI.spad" 1528873 1528881 1529238 1529259) (-949 "PID.spad" 1527843 1527851 1528799 1528868) (-948 "PICOERCE.spad" 1527500 1527510 1527833 1527838) (-947 "PGROEB.spad" 1526101 1526115 1527490 1527495) (-946 "PGE.spad" 1517718 1517726 1526091 1526096) (-945 "PGCD.spad" 1516608 1516625 1517708 1517713) (-944 "PFRPAC.spad" 1515757 1515767 1516598 1516603) (-943 "PFR.spad" 1512420 1512430 1515659 1515752) (-942 "PFOTOOLS.spad" 1511678 1511694 1512410 1512415) (-941 "PFOQ.spad" 1511048 1511066 1511668 1511673) (-940 "PFO.spad" 1510467 1510494 1511038 1511043) (-939 "PF.spad" 1510041 1510053 1510272 1510365) (-938 "PFECAT.spad" 1507723 1507731 1509967 1510036) (-937 "PFECAT.spad" 1505433 1505443 1507679 1507684) (-936 "PFBRU.spad" 1503321 1503333 1505423 1505428) (-935 "PFBR.spad" 1500881 1500904 1503311 1503316) (-934 "PERM.spad" 1496688 1496698 1500711 1500726) (-933 "PERMGRP.spad" 1491458 1491468 1496678 1496683) (-932 "PERMCAT.spad" 1490119 1490129 1491438 1491453) (-931 "PERMAN.spad" 1488651 1488665 1490109 1490114) (-930 "PENDTREE.spad" 1487875 1487885 1488163 1488168) (-929 "PDSPC.spad" 1486688 1486698 1487865 1487870) (-928 "PDSPC.spad" 1485499 1485511 1486678 1486683) (-927 "PDRING.spad" 1485341 1485351 1485479 1485494) (-926 "PDMOD.spad" 1485157 1485169 1485309 1485336) (-925 "PDEPROB.spad" 1484172 1484180 1485147 1485152) (-924 "PDEPACK.spad" 1478212 1478220 1484162 1484167) (-923 "PDECOMP.spad" 1477682 1477699 1478202 1478207) (-922 "PDECAT.spad" 1476038 1476046 1477672 1477677) (-921 "PDDOM.spad" 1475476 1475489 1476028 1476033) (-920 "PDDOM.spad" 1474912 1474927 1475466 1475471) (-919 "PCOMP.spad" 1474765 1474778 1474902 1474907) (-918 "PBWLB.spad" 1473353 1473370 1474755 1474760) (-917 "PATTERN.spad" 1467892 1467902 1473343 1473348) (-916 "PATTERN2.spad" 1467630 1467642 1467882 1467887) (-915 "PATTERN1.spad" 1465966 1465982 1467620 1467625) (-914 "PATRES.spad" 1463541 1463553 1465956 1465961) (-913 "PATRES2.spad" 1463213 1463227 1463531 1463536) (-912 "PATMATCH.spad" 1461410 1461441 1462921 1462926) (-911 "PATMAB.spad" 1460839 1460849 1461400 1461405) (-910 "PATLRES.spad" 1459925 1459939 1460829 1460834) (-909 "PATAB.spad" 1459689 1459699 1459915 1459920) (-908 "PARTPERM.spad" 1457697 1457705 1459679 1459684) (-907 "PARSURF.spad" 1457131 1457159 1457687 1457692) (-906 "PARSU2.spad" 1456928 1456944 1457121 1457126) (-905 "script-parser.spad" 1456448 1456456 1456918 1456923) (-904 "PARSCURV.spad" 1455882 1455910 1456438 1456443) (-903 "PARSC2.spad" 1455673 1455689 1455872 1455877) (-902 "PARPCURV.spad" 1455135 1455163 1455663 1455668) (-901 "PARPC2.spad" 1454926 1454942 1455125 1455130) (-900 "PARAMAST.spad" 1454054 1454062 1454916 1454921) (-899 "PAN2EXPR.spad" 1453466 1453474 1454044 1454049) (-898 "PALETTE.spad" 1452436 1452444 1453456 1453461) (-897 "PAIR.spad" 1451423 1451436 1452024 1452029) (-896 "PADICRC.spad" 1448664 1448682 1449835 1449928) (-895 "PADICRAT.spad" 1446572 1446584 1446793 1446886) (-894 "PADIC.spad" 1446267 1446279 1446498 1446567) (-893 "PADICCT.spad" 1444816 1444828 1446193 1446262) (-892 "PADEPAC.spad" 1443505 1443524 1444806 1444811) (-891 "PADE.spad" 1442257 1442273 1443495 1443500) (-890 "OWP.spad" 1441497 1441527 1442115 1442182) (-889 "OVERSET.spad" 1441070 1441078 1441487 1441492) (-888 "OVAR.spad" 1440851 1440874 1441060 1441065) (-887 "OUT.spad" 1439937 1439945 1440841 1440846) (-886 "OUTFORM.spad" 1429329 1429337 1439927 1439932) (-885 "OUTBFILE.spad" 1428747 1428755 1429319 1429324) (-884 "OUTBCON.spad" 1427753 1427761 1428737 1428742) (-883 "OUTBCON.spad" 1426757 1426767 1427743 1427748) (-882 "OSI.spad" 1426232 1426240 1426747 1426752) (-881 "OSGROUP.spad" 1426150 1426158 1426222 1426227) (-880 "ORTHPOL.spad" 1424635 1424645 1426067 1426072) (-879 "OREUP.spad" 1424088 1424116 1424315 1424354) (-878 "ORESUP.spad" 1423389 1423413 1423768 1423807) (-877 "OREPCTO.spad" 1421246 1421258 1423309 1423314) (-876 "OREPCAT.spad" 1415393 1415403 1421202 1421241) (-875 "OREPCAT.spad" 1409430 1409442 1415241 1415246) (-874 "ORDTYPE.spad" 1408667 1408675 1409420 1409425) (-873 "ORDTYPE.spad" 1407902 1407912 1408657 1408662) (-872 "ORDSTRCT.spad" 1407675 1407690 1407838 1407843) (-871 "ORDSET.spad" 1407375 1407383 1407665 1407670) (-870 "ORDRING.spad" 1406765 1406773 1407355 1407370) (-869 "ORDRING.spad" 1406163 1406173 1406755 1406760) (-868 "ORDMON.spad" 1406018 1406026 1406153 1406158) (-867 "ORDFUNS.spad" 1405150 1405166 1406008 1406013) (-866 "ORDFIN.spad" 1404970 1404978 1405140 1405145) (-865 "ORDCOMP.spad" 1403435 1403445 1404517 1404546) (-864 "ORDCOMP2.spad" 1402728 1402740 1403425 1403430) (-863 "OPTPROB.spad" 1401366 1401374 1402718 1402723) (-862 "OPTPACK.spad" 1393775 1393783 1401356 1401361) (-861 "OPTCAT.spad" 1391454 1391462 1393765 1393770) (-860 "OPSIG.spad" 1391108 1391116 1391444 1391449) (-859 "OPQUERY.spad" 1390657 1390665 1391098 1391103) (-858 "OP.spad" 1390399 1390409 1390479 1390546) (-857 "OPERCAT.spad" 1389865 1389875 1390389 1390394) (-856 "OPERCAT.spad" 1389329 1389341 1389855 1389860) (-855 "ONECOMP.spad" 1388074 1388084 1388876 1388905) (-854 "ONECOMP2.spad" 1387498 1387510 1388064 1388069) (-853 "OMSERVER.spad" 1386504 1386512 1387488 1387493) (-852 "OMSAGG.spad" 1386292 1386302 1386460 1386499) (-851 "OMPKG.spad" 1384908 1384916 1386282 1386287) (-850 "OM.spad" 1383881 1383889 1384898 1384903) (-849 "OMLO.spad" 1383306 1383318 1383767 1383806) (-848 "OMEXPR.spad" 1383140 1383150 1383296 1383301) (-847 "OMERR.spad" 1382685 1382693 1383130 1383135) (-846 "OMERRK.spad" 1381719 1381727 1382675 1382680) (-845 "OMENC.spad" 1381063 1381071 1381709 1381714) (-844 "OMDEV.spad" 1375372 1375380 1381053 1381058) (-843 "OMCONN.spad" 1374781 1374789 1375362 1375367) (-842 "OINTDOM.spad" 1374544 1374552 1374707 1374776) (-841 "OFMONOID.spad" 1372667 1372677 1374500 1374505) (-840 "ODVAR.spad" 1371928 1371938 1372657 1372662) (-839 "ODR.spad" 1371572 1371598 1371740 1371889) (-838 "ODPOL.spad" 1368861 1368871 1369201 1369328) (-837 "ODP.spad" 1356675 1356695 1357048 1357147) (-836 "ODETOOLS.spad" 1355324 1355343 1356665 1356670) (-835 "ODESYS.spad" 1353018 1353035 1355314 1355319) (-834 "ODERTRIC.spad" 1349027 1349044 1352975 1352980) (-833 "ODERED.spad" 1348426 1348450 1349017 1349022) (-832 "ODERAT.spad" 1346041 1346058 1348416 1348421) (-831 "ODEPRRIC.spad" 1343078 1343100 1346031 1346036) (-830 "ODEPROB.spad" 1342335 1342343 1343068 1343073) (-829 "ODEPRIM.spad" 1339669 1339691 1342325 1342330) (-828 "ODEPAL.spad" 1339055 1339079 1339659 1339664) (-827 "ODEPACK.spad" 1325721 1325729 1339045 1339050) (-826 "ODEINT.spad" 1325156 1325172 1325711 1325716) (-825 "ODEIFTBL.spad" 1322551 1322559 1325146 1325151) (-824 "ODEEF.spad" 1318042 1318058 1322541 1322546) (-823 "ODECONST.spad" 1317579 1317597 1318032 1318037) (-822 "ODECAT.spad" 1316177 1316185 1317569 1317574) (-821 "OCT.spad" 1314313 1314323 1315027 1315066) (-820 "OCTCT2.spad" 1313959 1313980 1314303 1314308) (-819 "OC.spad" 1311755 1311765 1313915 1313954) (-818 "OC.spad" 1309276 1309288 1311438 1311443) (-817 "OCAMON.spad" 1309124 1309132 1309266 1309271) (-816 "OASGP.spad" 1308939 1308947 1309114 1309119) (-815 "OAMONS.spad" 1308461 1308469 1308929 1308934) (-814 "OAMON.spad" 1308322 1308330 1308451 1308456) (-813 "OAGROUP.spad" 1308184 1308192 1308312 1308317) (-812 "NUMTUBE.spad" 1307775 1307791 1308174 1308179) (-811 "NUMQUAD.spad" 1295751 1295759 1307765 1307770) (-810 "NUMODE.spad" 1287105 1287113 1295741 1295746) (-809 "NUMINT.spad" 1284671 1284679 1287095 1287100) (-808 "NUMFMT.spad" 1283511 1283519 1284661 1284666) (-807 "NUMERIC.spad" 1275625 1275635 1283316 1283321) (-806 "NTSCAT.spad" 1274133 1274149 1275593 1275620) (-805 "NTPOLFN.spad" 1273684 1273694 1274050 1274055) (-804 "NSUP.spad" 1266637 1266647 1271177 1271330) (-803 "NSUP2.spad" 1266029 1266041 1266627 1266632) (-802 "NSMP.spad" 1262259 1262278 1262567 1262694) (-801 "NREP.spad" 1260637 1260651 1262249 1262254) (-800 "NPCOEF.spad" 1259883 1259903 1260627 1260632) (-799 "NORMRETR.spad" 1259481 1259520 1259873 1259878) (-798 "NORMPK.spad" 1257383 1257402 1259471 1259476) (-797 "NORMMA.spad" 1257071 1257097 1257373 1257378) (-796 "NONE.spad" 1256812 1256820 1257061 1257066) (-795 "NONE1.spad" 1256488 1256498 1256802 1256807) (-794 "NODE1.spad" 1255975 1255991 1256478 1256483) (-793 "NNI.spad" 1254870 1254878 1255949 1255970) (-792 "NLINSOL.spad" 1253496 1253506 1254860 1254865) (-791 "NIPROB.spad" 1252037 1252045 1253486 1253491) (-790 "NFINTBAS.spad" 1249597 1249614 1252027 1252032) (-789 "NETCLT.spad" 1249571 1249582 1249587 1249592) (-788 "NCODIV.spad" 1247787 1247803 1249561 1249566) (-787 "NCNTFRAC.spad" 1247429 1247443 1247777 1247782) (-786 "NCEP.spad" 1245595 1245609 1247419 1247424) (-785 "NASRING.spad" 1245191 1245199 1245585 1245590) (-784 "NASRING.spad" 1244785 1244795 1245181 1245186) (-783 "NARNG.spad" 1244137 1244145 1244775 1244780) (-782 "NARNG.spad" 1243487 1243497 1244127 1244132) (-781 "NAGSP.spad" 1242564 1242572 1243477 1243482) (-780 "NAGS.spad" 1232225 1232233 1242554 1242559) (-779 "NAGF07.spad" 1230656 1230664 1232215 1232220) (-778 "NAGF04.spad" 1225058 1225066 1230646 1230651) (-777 "NAGF02.spad" 1219127 1219135 1225048 1225053) (-776 "NAGF01.spad" 1214888 1214896 1219117 1219122) (-775 "NAGE04.spad" 1208588 1208596 1214878 1214883) (-774 "NAGE02.spad" 1199248 1199256 1208578 1208583) (-773 "NAGE01.spad" 1195250 1195258 1199238 1199243) (-772 "NAGD03.spad" 1193254 1193262 1195240 1195245) (-771 "NAGD02.spad" 1186001 1186009 1193244 1193249) (-770 "NAGD01.spad" 1180294 1180302 1185991 1185996) (-769 "NAGC06.spad" 1176169 1176177 1180284 1180289) (-768 "NAGC05.spad" 1174670 1174678 1176159 1176164) (-767 "NAGC02.spad" 1173937 1173945 1174660 1174665) (-766 "NAALG.spad" 1173478 1173488 1173905 1173932) (-765 "NAALG.spad" 1173039 1173051 1173468 1173473) (-764 "MULTSQFR.spad" 1169997 1170014 1173029 1173034) (-763 "MULTFACT.spad" 1169380 1169397 1169987 1169992) (-762 "MTSCAT.spad" 1167474 1167495 1169278 1169375) (-761 "MTHING.spad" 1167133 1167143 1167464 1167469) (-760 "MSYSCMD.spad" 1166567 1166575 1167123 1167128) (-759 "MSET.spad" 1164489 1164499 1166237 1166276) (-758 "MSETAGG.spad" 1164334 1164344 1164457 1164484) (-757 "MRING.spad" 1161311 1161323 1164042 1164109) (-756 "MRF2.spad" 1160881 1160895 1161301 1161306) (-755 "MRATFAC.spad" 1160427 1160444 1160871 1160876) (-754 "MPRFF.spad" 1158467 1158486 1160417 1160422) (-753 "MPOLY.spad" 1155938 1155953 1156297 1156424) (-752 "MPCPF.spad" 1155202 1155221 1155928 1155933) (-751 "MPC3.spad" 1155019 1155059 1155192 1155197) (-750 "MPC2.spad" 1154664 1154697 1155009 1155014) (-749 "MONOTOOL.spad" 1153015 1153032 1154654 1154659) (-748 "MONOID.spad" 1152334 1152342 1153005 1153010) (-747 "MONOID.spad" 1151651 1151661 1152324 1152329) (-746 "MONOGEN.spad" 1150399 1150412 1151511 1151646) (-745 "MONOGEN.spad" 1149169 1149184 1150283 1150288) (-744 "MONADWU.spad" 1147199 1147207 1149159 1149164) (-743 "MONADWU.spad" 1145227 1145237 1147189 1147194) (-742 "MONAD.spad" 1144387 1144395 1145217 1145222) (-741 "MONAD.spad" 1143545 1143555 1144377 1144382) (-740 "MOEBIUS.spad" 1142281 1142295 1143525 1143540) (-739 "MODULE.spad" 1142151 1142161 1142249 1142276) (-738 "MODULE.spad" 1142041 1142053 1142141 1142146) (-737 "MODRING.spad" 1141376 1141415 1142021 1142036) (-736 "MODOP.spad" 1140041 1140053 1141198 1141265) (-735 "MODMONOM.spad" 1139772 1139790 1140031 1140036) (-734 "MODMON.spad" 1136474 1136490 1137193 1137346) (-733 "MODFIELD.spad" 1135836 1135875 1136376 1136469) (-732 "MMLFORM.spad" 1134696 1134704 1135826 1135831) (-731 "MMAP.spad" 1134438 1134472 1134686 1134691) (-730 "MLO.spad" 1132897 1132907 1134394 1134433) (-729 "MLIFT.spad" 1131509 1131526 1132887 1132892) (-728 "MKUCFUNC.spad" 1131044 1131062 1131499 1131504) (-727 "MKRECORD.spad" 1130648 1130661 1131034 1131039) (-726 "MKFUNC.spad" 1130055 1130065 1130638 1130643) (-725 "MKFLCFN.spad" 1129023 1129033 1130045 1130050) (-724 "MKBCFUNC.spad" 1128518 1128536 1129013 1129018) (-723 "MINT.spad" 1127957 1127965 1128420 1128513) (-722 "MHROWRED.spad" 1126468 1126478 1127947 1127952) (-721 "MFLOAT.spad" 1124988 1124996 1126358 1126463) (-720 "MFINFACT.spad" 1124388 1124410 1124978 1124983) (-719 "MESH.spad" 1122170 1122178 1124378 1124383) (-718 "MDDFACT.spad" 1120381 1120391 1122160 1122165) (-717 "MDAGG.spad" 1119672 1119682 1120361 1120376) (-716 "MCMPLX.spad" 1115103 1115111 1115717 1115918) (-715 "MCDEN.spad" 1114313 1114325 1115093 1115098) (-714 "MCALCFN.spad" 1111435 1111461 1114303 1114308) (-713 "MAYBE.spad" 1110719 1110730 1111425 1111430) (-712 "MATSTOR.spad" 1108027 1108037 1110709 1110714) (-711 "MATRIX.spad" 1106614 1106624 1107098 1107125) (-710 "MATLIN.spad" 1103958 1103982 1106498 1106503) (-709 "MATCAT.spad" 1095480 1095502 1103926 1103953) (-708 "MATCAT.spad" 1086874 1086898 1095322 1095327) (-707 "MATCAT2.spad" 1086156 1086204 1086864 1086869) (-706 "MAPPKG3.spad" 1085071 1085085 1086146 1086151) (-705 "MAPPKG2.spad" 1084409 1084421 1085061 1085066) (-704 "MAPPKG1.spad" 1083237 1083247 1084399 1084404) (-703 "MAPPAST.spad" 1082552 1082560 1083227 1083232) (-702 "MAPHACK3.spad" 1082364 1082378 1082542 1082547) (-701 "MAPHACK2.spad" 1082133 1082145 1082354 1082359) (-700 "MAPHACK1.spad" 1081777 1081787 1082123 1082128) (-699 "MAGMA.spad" 1079567 1079584 1081767 1081772) (-698 "MACROAST.spad" 1079146 1079154 1079557 1079562) (-697 "M3D.spad" 1076749 1076759 1078407 1078412) (-696 "LZSTAGG.spad" 1073987 1073997 1076739 1076744) (-695 "LZSTAGG.spad" 1071223 1071235 1073977 1073982) (-694 "LWORD.spad" 1067928 1067945 1071213 1071218) (-693 "LSTAST.spad" 1067712 1067720 1067918 1067923) (-692 "LSQM.spad" 1065869 1065883 1066263 1066314) (-691 "LSPP.spad" 1065404 1065421 1065859 1065864) (-690 "LSMP.spad" 1064254 1064282 1065394 1065399) (-689 "LSMP1.spad" 1062072 1062086 1064244 1064249) (-688 "LSAGG.spad" 1061741 1061751 1062040 1062067) (-687 "LSAGG.spad" 1061430 1061442 1061731 1061736) (-686 "LPOLY.spad" 1060384 1060403 1061286 1061355) (-685 "LPEFRAC.spad" 1059655 1059665 1060374 1060379) (-684 "LO.spad" 1059056 1059070 1059589 1059616) (-683 "LOGIC.spad" 1058658 1058666 1059046 1059051) (-682 "LOGIC.spad" 1058258 1058268 1058648 1058653) (-681 "LODOOPS.spad" 1057188 1057200 1058248 1058253) (-680 "LODO.spad" 1056572 1056588 1056868 1056907) (-679 "LODOF.spad" 1055618 1055635 1056529 1056534) (-678 "LODOCAT.spad" 1054284 1054294 1055574 1055613) (-677 "LODOCAT.spad" 1052948 1052960 1054240 1054245) (-676 "LODO2.spad" 1052221 1052233 1052628 1052667) (-675 "LODO1.spad" 1051621 1051631 1051901 1051940) (-674 "LODEEF.spad" 1050423 1050441 1051611 1051616) (-673 "LNAGG.spad" 1046570 1046580 1050413 1050418) (-672 "LNAGG.spad" 1042681 1042693 1046526 1046531) (-671 "LMOPS.spad" 1039449 1039466 1042671 1042676) (-670 "LMODULE.spad" 1039217 1039227 1039439 1039444) (-669 "LMDICT.spad" 1038387 1038397 1038651 1038678) (-668 "LLINSET.spad" 1038094 1038104 1038377 1038382) (-667 "LITERAL.spad" 1038000 1038011 1038084 1038089) (-666 "LIST.spad" 1035582 1035592 1036994 1037021) (-665 "LIST3.spad" 1034893 1034907 1035572 1035577) (-664 "LIST2.spad" 1033595 1033607 1034883 1034888) (-663 "LIST2MAP.spad" 1030498 1030510 1033585 1033590) (-662 "LINSET.spad" 1030277 1030287 1030488 1030493) (-661 "LINFORM.spad" 1029740 1029752 1030245 1030272) (-660 "LINEXP.spad" 1028483 1028493 1029730 1029735) (-659 "LINELT.spad" 1027854 1027866 1028366 1028393) (-658 "LINDEP.spad" 1026663 1026675 1027766 1027771) (-657 "LINBASIS.spad" 1026299 1026314 1026653 1026658) (-656 "LIMITRF.spad" 1024227 1024237 1026289 1026294) (-655 "LIMITPS.spad" 1023130 1023143 1024217 1024222) (-654 "LIE.spad" 1021146 1021158 1022420 1022565) (-653 "LIECAT.spad" 1020622 1020632 1021072 1021141) (-652 "LIECAT.spad" 1020126 1020138 1020578 1020583) (-651 "LIB.spad" 1017877 1017885 1018323 1018338) (-650 "LGROBP.spad" 1015230 1015249 1017867 1017872) (-649 "LF.spad" 1014185 1014201 1015220 1015225) (-648 "LFCAT.spad" 1013244 1013252 1014175 1014180) (-647 "LEXTRIPK.spad" 1008747 1008762 1013234 1013239) (-646 "LEXP.spad" 1006750 1006777 1008727 1008742) (-645 "LETAST.spad" 1006449 1006457 1006740 1006745) (-644 "LEADCDET.spad" 1004847 1004864 1006439 1006444) (-643 "LAZM3PK.spad" 1003551 1003573 1004837 1004842) (-642 "LAUPOL.spad" 1002151 1002164 1003051 1003120) (-641 "LAPLACE.spad" 1001734 1001750 1002141 1002146) (-640 "LA.spad" 1001174 1001188 1001656 1001695) (-639 "LALG.spad" 1000950 1000960 1001154 1001169) (-638 "LALG.spad" 1000734 1000746 1000940 1000945) (-637 "KVTFROM.spad" 1000469 1000479 1000724 1000729) (-636 "KTVLOGIC.spad" 999981 999989 1000459 1000464) (-635 "KRCFROM.spad" 999719 999729 999971 999976) (-634 "KOVACIC.spad" 998442 998459 999709 999714) (-633 "KONVERT.spad" 998164 998174 998432 998437) (-632 "KOERCE.spad" 997901 997911 998154 998159) (-631 "KERNEL.spad" 996556 996566 997685 997690) (-630 "KERNEL2.spad" 996259 996271 996546 996551) (-629 "KDAGG.spad" 995368 995390 996239 996254) (-628 "KDAGG.spad" 994485 994509 995358 995363) (-627 "KAFILE.spad" 993339 993355 993574 993601) (-626 "JVMOP.spad" 993244 993252 993329 993334) (-625 "JVMMDACC.spad" 992282 992290 993234 993239) (-624 "JVMFDACC.spad" 991590 991598 992272 992277) (-623 "JVMCSTTG.spad" 990319 990327 991580 991585) (-622 "JVMCFACC.spad" 989749 989757 990309 990314) (-621 "JVMBCODE.spad" 989652 989660 989739 989744) (-620 "JORDAN.spad" 987481 987493 988942 989087) (-619 "JOINAST.spad" 987175 987183 987471 987476) (-618 "IXAGG.spad" 985308 985332 987165 987170) (-617 "IXAGG.spad" 983296 983322 985155 985160) (-616 "IVECTOR.spad" 981913 981928 982068 982095) (-615 "ITUPLE.spad" 981074 981084 981903 981908) (-614 "ITRIGMNP.spad" 979913 979932 981064 981069) (-613 "ITFUN3.spad" 979419 979433 979903 979908) (-612 "ITFUN2.spad" 979163 979175 979409 979414) (-611 "ITFORM.spad" 978518 978526 979153 979158) (-610 "ITAYLOR.spad" 976512 976527 978382 978479) (-609 "ISUPS.spad" 968949 968964 975486 975583) (-608 "ISUMP.spad" 968450 968466 968939 968944) (-607 "ISTRING.spad" 967377 967390 967458 967485) (-606 "ISAST.spad" 967096 967104 967367 967372) (-605 "IRURPK.spad" 965813 965832 967086 967091) (-604 "IRSN.spad" 963785 963793 965803 965808) (-603 "IRRF2F.spad" 962270 962280 963741 963746) (-602 "IRREDFFX.spad" 961871 961882 962260 962265) (-601 "IROOT.spad" 960210 960220 961861 961866) (-600 "IR.spad" 958011 958025 960065 960092) (-599 "IRFORM.spad" 957335 957343 958001 958006) (-598 "IR2.spad" 956363 956379 957325 957330) (-597 "IR2F.spad" 955569 955585 956353 956358) (-596 "IPRNTPK.spad" 955329 955337 955559 955564) (-595 "IPF.spad" 954894 954906 955134 955227) (-594 "IPADIC.spad" 954655 954681 954820 954889) (-593 "IP4ADDR.spad" 954212 954220 954645 954650) (-592 "IOMODE.spad" 953734 953742 954202 954207) (-591 "IOBFILE.spad" 953095 953103 953724 953729) (-590 "IOBCON.spad" 952960 952968 953085 953090) (-589 "INVLAPLA.spad" 952609 952625 952950 952955) (-588 "INTTR.spad" 945991 946008 952599 952604) (-587 "INTTOOLS.spad" 943746 943762 945565 945570) (-586 "INTSLPE.spad" 943066 943074 943736 943741) (-585 "INTRVL.spad" 942632 942642 942980 943061) (-584 "INTRF.spad" 941056 941070 942622 942627) (-583 "INTRET.spad" 940488 940498 941046 941051) (-582 "INTRAT.spad" 939215 939232 940478 940483) (-581 "INTPM.spad" 937600 937616 938858 938863) (-580 "INTPAF.spad" 935464 935482 937532 937537) (-579 "INTPACK.spad" 925838 925846 935454 935459) (-578 "INT.spad" 925286 925294 925692 925833) (-577 "INTHERTR.spad" 924560 924577 925276 925281) (-576 "INTHERAL.spad" 924230 924254 924550 924555) (-575 "INTHEORY.spad" 920669 920677 924220 924225) (-574 "INTG0.spad" 914402 914420 920601 920606) (-573 "INTFTBL.spad" 908431 908439 914392 914397) (-572 "INTFACT.spad" 907490 907500 908421 908426) (-571 "INTEF.spad" 905875 905891 907480 907485) (-570 "INTDOM.spad" 904498 904506 905801 905870) (-569 "INTDOM.spad" 903183 903193 904488 904493) (-568 "INTCAT.spad" 901442 901452 903097 903178) (-567 "INTBIT.spad" 900949 900957 901432 901437) (-566 "INTALG.spad" 900137 900164 900939 900944) (-565 "INTAF.spad" 899637 899653 900127 900132) (-564 "INTABL.spad" 897713 897744 897876 897903) (-563 "INT8.spad" 897593 897601 897703 897708) (-562 "INT64.spad" 897472 897480 897583 897588) (-561 "INT32.spad" 897351 897359 897462 897467) (-560 "INT16.spad" 897230 897238 897341 897346) (-559 "INS.spad" 894733 894741 897132 897225) (-558 "INS.spad" 892322 892332 894723 894728) (-557 "INPSIGN.spad" 891770 891783 892312 892317) (-556 "INPRODPF.spad" 890866 890885 891760 891765) (-555 "INPRODFF.spad" 889954 889978 890856 890861) (-554 "INNMFACT.spad" 888929 888946 889944 889949) (-553 "INMODGCD.spad" 888417 888447 888919 888924) (-552 "INFSP.spad" 886714 886736 888407 888412) (-551 "INFPROD0.spad" 885794 885813 886704 886709) (-550 "INFORM.spad" 882993 883001 885784 885789) (-549 "INFORM1.spad" 882618 882628 882983 882988) (-548 "INFINITY.spad" 882170 882178 882608 882613) (-547 "INETCLTS.spad" 882147 882155 882160 882165) (-546 "INEP.spad" 880685 880707 882137 882142) (-545 "INDE.spad" 880334 880351 880595 880600) (-544 "INCRMAPS.spad" 879755 879765 880324 880329) (-543 "INBFILE.spad" 878827 878835 879745 879750) (-542 "INBFF.spad" 874621 874632 878817 878822) (-541 "INBCON.spad" 872911 872919 874611 874616) (-540 "INBCON.spad" 871199 871209 872901 872906) (-539 "INAST.spad" 870860 870868 871189 871194) (-538 "IMPTAST.spad" 870568 870576 870850 870855) (-537 "IMATRIX.spad" 869396 869422 869908 869935) (-536 "IMATQF.spad" 868490 868534 869352 869357) (-535 "IMATLIN.spad" 867095 867119 868446 868451) (-534 "ILIST.spad" 865600 865615 866125 866152) (-533 "IIARRAY2.spad" 864871 864909 865090 865117) (-532 "IFF.spad" 864281 864297 864552 864645) (-531 "IFAST.spad" 863895 863903 864271 864276) (-530 "IFARRAY.spad" 861235 861250 862925 862952) (-529 "IFAMON.spad" 861097 861114 861191 861196) (-528 "IEVALAB.spad" 860502 860514 861087 861092) (-527 "IEVALAB.spad" 859905 859919 860492 860497) (-526 "IDPO.spad" 859640 859652 859817 859822) (-525 "IDPOAMS.spad" 859318 859330 859552 859557) (-524 "IDPOAM.spad" 858960 858972 859230 859235) (-523 "IDPC.spad" 857689 857701 858950 858955) (-522 "IDPAM.spad" 857356 857368 857601 857606) (-521 "IDPAG.spad" 857025 857037 857268 857273) (-520 "IDENT.spad" 856675 856683 857015 857020) (-519 "IDECOMP.spad" 853914 853932 856665 856670) (-518 "IDEAL.spad" 848863 848902 853849 853854) (-517 "ICDEN.spad" 848052 848068 848853 848858) (-516 "ICARD.spad" 847243 847251 848042 848047) (-515 "IBPTOOLS.spad" 845850 845867 847233 847238) (-514 "IBITS.spad" 845015 845028 845448 845475) (-513 "IBATOOL.spad" 841992 842011 845005 845010) (-512 "IBACHIN.spad" 840499 840514 841982 841987) (-511 "IARRAY2.spad" 839370 839396 839989 840016) (-510 "IARRAY1.spad" 838262 838277 838400 838427) (-509 "IAN.spad" 836485 836493 838078 838171) (-508 "IALGFACT.spad" 836088 836121 836475 836480) (-507 "HYPCAT.spad" 835512 835520 836078 836083) (-506 "HYPCAT.spad" 834934 834944 835502 835507) (-505 "HOSTNAME.spad" 834742 834750 834924 834929) (-504 "HOMOTOP.spad" 834485 834495 834732 834737) (-503 "HOAGG.spad" 831767 831777 834475 834480) (-502 "HOAGG.spad" 828788 828800 831498 831503) (-501 "HEXADEC.spad" 826793 826801 827158 827251) (-500 "HEUGCD.spad" 825828 825839 826783 826788) (-499 "HELLFDIV.spad" 825418 825442 825818 825823) (-498 "HEAP.spad" 824693 824703 824908 824935) (-497 "HEADAST.spad" 824226 824234 824683 824688) (-496 "HDP.spad" 812036 812052 812413 812512) (-495 "HDMP.spad" 809250 809265 809866 809993) (-494 "HB.spad" 807501 807509 809240 809245) (-493 "HASHTBL.spad" 805529 805560 805740 805767) (-492 "HASAST.spad" 805245 805253 805519 805524) (-491 "HACKPI.spad" 804736 804744 805147 805240) (-490 "GTSET.spad" 803639 803655 804346 804373) (-489 "GSTBL.spad" 801716 801751 801890 801905) (-488 "GSERIES.spad" 799029 799056 799848 799997) (-487 "GROUP.spad" 798302 798310 799009 799024) (-486 "GROUP.spad" 797583 797593 798292 798297) (-485 "GROEBSOL.spad" 796077 796098 797573 797578) (-484 "GRMOD.spad" 794648 794660 796067 796072) (-483 "GRMOD.spad" 793217 793231 794638 794643) (-482 "GRIMAGE.spad" 786106 786114 793207 793212) (-481 "GRDEF.spad" 784485 784493 786096 786101) (-480 "GRAY.spad" 782948 782956 784475 784480) (-479 "GRALG.spad" 782025 782037 782938 782943) (-478 "GRALG.spad" 781100 781114 782015 782020) (-477 "GPOLSET.spad" 780518 780541 780746 780773) (-476 "GOSPER.spad" 779787 779805 780508 780513) (-475 "GMODPOL.spad" 778935 778962 779755 779782) (-474 "GHENSEL.spad" 778018 778032 778925 778930) (-473 "GENUPS.spad" 774311 774324 778008 778013) (-472 "GENUFACT.spad" 773888 773898 774301 774306) (-471 "GENPGCD.spad" 773474 773491 773878 773883) (-470 "GENMFACT.spad" 772926 772945 773464 773469) (-469 "GENEEZ.spad" 770877 770890 772916 772921) (-468 "GDMP.spad" 767933 767950 768707 768834) (-467 "GCNAALG.spad" 761856 761883 767727 767794) (-466 "GCDDOM.spad" 761032 761040 761782 761851) (-465 "GCDDOM.spad" 760270 760280 761022 761027) (-464 "GB.spad" 757796 757834 760226 760231) (-463 "GBINTERN.spad" 753816 753854 757786 757791) (-462 "GBF.spad" 749583 749621 753806 753811) (-461 "GBEUCLID.spad" 747465 747503 749573 749578) (-460 "GAUSSFAC.spad" 746778 746786 747455 747460) (-459 "GALUTIL.spad" 745104 745114 746734 746739) (-458 "GALPOLYU.spad" 743558 743571 745094 745099) (-457 "GALFACTU.spad" 741731 741750 743548 743553) (-456 "GALFACT.spad" 731920 731931 741721 741726) (-455 "FVFUN.spad" 728943 728951 731910 731915) (-454 "FVC.spad" 727995 728003 728933 728938) (-453 "FUNDESC.spad" 727673 727681 727985 727990) (-452 "FUNCTION.spad" 727522 727534 727663 727668) (-451 "FT.spad" 725819 725827 727512 727517) (-450 "FTEM.spad" 724984 724992 725809 725814) (-449 "FSUPFACT.spad" 723884 723903 724920 724925) (-448 "FST.spad" 721970 721978 723874 723879) (-447 "FSRED.spad" 721450 721466 721960 721965) (-446 "FSPRMELT.spad" 720332 720348 721407 721412) (-445 "FSPECF.spad" 718423 718439 720322 720327) (-444 "FS.spad" 712691 712701 718198 718418) (-443 "FS.spad" 706737 706749 712246 712251) (-442 "FSINT.spad" 706397 706413 706727 706732) (-441 "FSERIES.spad" 705588 705600 706217 706316) (-440 "FSCINT.spad" 704905 704921 705578 705583) (-439 "FSAGG.spad" 704022 704032 704861 704900) (-438 "FSAGG.spad" 703101 703113 703942 703947) (-437 "FSAGG2.spad" 701844 701860 703091 703096) (-436 "FS2UPS.spad" 696335 696369 701834 701839) (-435 "FS2.spad" 695982 695998 696325 696330) (-434 "FS2EXPXP.spad" 695107 695130 695972 695977) (-433 "FRUTIL.spad" 694061 694071 695097 695102) (-432 "FR.spad" 687684 687694 692992 693061) (-431 "FRNAALG.spad" 682953 682963 687626 687679) (-430 "FRNAALG.spad" 678234 678246 682909 682914) (-429 "FRNAAF2.spad" 677690 677708 678224 678229) (-428 "FRMOD.spad" 677100 677130 677621 677626) (-427 "FRIDEAL.spad" 676325 676346 677080 677095) (-426 "FRIDEAL2.spad" 675929 675961 676315 676320) (-425 "FRETRCT.spad" 675440 675450 675919 675924) (-424 "FRETRCT.spad" 674817 674829 675298 675303) (-423 "FRAMALG.spad" 673165 673178 674773 674812) (-422 "FRAMALG.spad" 671545 671560 673155 673160) (-421 "FRAC.spad" 668551 668561 668954 669127) (-420 "FRAC2.spad" 668156 668168 668541 668546) (-419 "FR2.spad" 667492 667504 668146 668151) (-418 "FPS.spad" 664307 664315 667382 667487) (-417 "FPS.spad" 661150 661160 664227 664232) (-416 "FPC.spad" 660196 660204 661052 661145) (-415 "FPC.spad" 659328 659338 660186 660191) (-414 "FPATMAB.spad" 659090 659100 659318 659323) (-413 "FPARFRAC.spad" 657940 657957 659080 659085) (-412 "FORTRAN.spad" 656446 656489 657930 657935) (-411 "FORT.spad" 655395 655403 656436 656441) (-410 "FORTFN.spad" 652565 652573 655385 655390) (-409 "FORTCAT.spad" 652249 652257 652555 652560) (-408 "FORMULA.spad" 649723 649731 652239 652244) (-407 "FORMULA1.spad" 649202 649212 649713 649718) (-406 "FORDER.spad" 648893 648917 649192 649197) (-405 "FOP.spad" 648094 648102 648883 648888) (-404 "FNLA.spad" 647518 647540 648062 648089) (-403 "FNCAT.spad" 646113 646121 647508 647513) (-402 "FNAME.spad" 646005 646013 646103 646108) (-401 "FMTC.spad" 645803 645811 645931 646000) (-400 "FMONOID.spad" 645468 645478 645759 645764) (-399 "FMONCAT.spad" 642621 642631 645458 645463) (-398 "FM.spad" 642236 642248 642475 642502) (-397 "FMFUN.spad" 639266 639274 642226 642231) (-396 "FMC.spad" 638318 638326 639256 639261) (-395 "FMCAT.spad" 635986 636004 638286 638313) (-394 "FM1.spad" 635343 635355 635920 635947) (-393 "FLOATRP.spad" 633078 633092 635333 635338) (-392 "FLOAT.spad" 626392 626400 632944 633073) (-391 "FLOATCP.spad" 623823 623837 626382 626387) (-390 "FLINEXP.spad" 623545 623555 623813 623818) (-389 "FLINEXP.spad" 623211 623223 623481 623486) (-388 "FLASORT.spad" 622537 622549 623201 623206) (-387 "FLALG.spad" 620183 620202 622463 622532) (-386 "FLAGG.spad" 617225 617235 620163 620178) (-385 "FLAGG.spad" 614168 614180 617108 617113) (-384 "FLAGG2.spad" 612893 612909 614158 614163) (-383 "FINRALG.spad" 610954 610967 612849 612888) (-382 "FINRALG.spad" 608941 608956 610838 610843) (-381 "FINITE.spad" 608093 608101 608931 608936) (-380 "FINAALG.spad" 597214 597224 608035 608088) (-379 "FINAALG.spad" 586347 586359 597170 597175) (-378 "FILE.spad" 585930 585940 586337 586342) (-377 "FILECAT.spad" 584456 584473 585920 585925) (-376 "FIELD.spad" 583862 583870 584358 584451) (-375 "FIELD.spad" 583354 583364 583852 583857) (-374 "FGROUP.spad" 582001 582011 583334 583349) (-373 "FGLMICPK.spad" 580788 580803 581991 581996) (-372 "FFX.spad" 580163 580178 580504 580597) (-371 "FFSLPE.spad" 579666 579687 580153 580158) (-370 "FFPOLY.spad" 570928 570939 579656 579661) (-369 "FFPOLY2.spad" 569988 570005 570918 570923) (-368 "FFP.spad" 569385 569405 569704 569797) (-367 "FF.spad" 568833 568849 569066 569159) (-366 "FFNBX.spad" 567345 567365 568549 568642) (-365 "FFNBP.spad" 565858 565875 567061 567154) (-364 "FFNB.spad" 564323 564344 565539 565632) (-363 "FFINTBAS.spad" 561837 561856 564313 564318) (-362 "FFIELDC.spad" 559414 559422 561739 561832) (-361 "FFIELDC.spad" 557077 557087 559404 559409) (-360 "FFHOM.spad" 555825 555842 557067 557072) (-359 "FFF.spad" 553260 553271 555815 555820) (-358 "FFCGX.spad" 552107 552127 552976 553069) (-357 "FFCGP.spad" 550996 551016 551823 551916) (-356 "FFCG.spad" 549788 549809 550677 550770) (-355 "FFCAT.spad" 542961 542983 549627 549783) (-354 "FFCAT.spad" 536213 536237 542881 542886) (-353 "FFCAT2.spad" 535960 536000 536203 536208) (-352 "FEXPR.spad" 527677 527723 535716 535755) (-351 "FEVALAB.spad" 527385 527395 527667 527672) (-350 "FEVALAB.spad" 526878 526890 527162 527167) (-349 "FDIV.spad" 526320 526344 526868 526873) (-348 "FDIVCAT.spad" 524384 524408 526310 526315) (-347 "FDIVCAT.spad" 522446 522472 524374 524379) (-346 "FDIV2.spad" 522102 522142 522436 522441) (-345 "FCTRDATA.spad" 521110 521118 522092 522097) (-344 "FCPAK1.spad" 519677 519685 521100 521105) (-343 "FCOMP.spad" 519056 519066 519667 519672) (-342 "FC.spad" 509063 509071 519046 519051) (-341 "FAXF.spad" 502034 502048 508965 509058) (-340 "FAXF.spad" 495057 495073 501990 501995) (-339 "FARRAY.spad" 493054 493064 494087 494114) (-338 "FAMR.spad" 491190 491202 492952 493049) (-337 "FAMR.spad" 489310 489324 491074 491079) (-336 "FAMONOID.spad" 488978 488988 489264 489269) (-335 "FAMONC.spad" 487274 487286 488968 488973) (-334 "FAGROUP.spad" 486898 486908 487170 487197) (-333 "FACUTIL.spad" 485102 485119 486888 486893) (-332 "FACTFUNC.spad" 484296 484306 485092 485097) (-331 "EXPUPXS.spad" 481129 481152 482428 482577) (-330 "EXPRTUBE.spad" 478417 478425 481119 481124) (-329 "EXPRODE.spad" 475577 475593 478407 478412) (-328 "EXPR.spad" 470752 470762 471466 471761) (-327 "EXPR2UPS.spad" 466874 466887 470742 470747) (-326 "EXPR2.spad" 466579 466591 466864 466869) (-325 "EXPEXPAN.spad" 463380 463405 464012 464105) (-324 "EXIT.spad" 463051 463059 463370 463375) (-323 "EXITAST.spad" 462787 462795 463041 463046) (-322 "EVALCYC.spad" 462247 462261 462777 462782) (-321 "EVALAB.spad" 461819 461829 462237 462242) (-320 "EVALAB.spad" 461389 461401 461809 461814) (-319 "EUCDOM.spad" 458963 458971 461315 461384) (-318 "EUCDOM.spad" 456599 456609 458953 458958) (-317 "ESTOOLS.spad" 448445 448453 456589 456594) (-316 "ESTOOLS2.spad" 448048 448062 448435 448440) (-315 "ESTOOLS1.spad" 447733 447744 448038 448043) (-314 "ES.spad" 440548 440556 447723 447728) (-313 "ES.spad" 433269 433279 440446 440451) (-312 "ESCONT.spad" 430062 430070 433259 433264) (-311 "ESCONT1.spad" 429811 429823 430052 430057) (-310 "ES2.spad" 429316 429332 429801 429806) (-309 "ES1.spad" 428886 428902 429306 429311) (-308 "ERROR.spad" 426213 426221 428876 428881) (-307 "EQTBL.spad" 424243 424265 424452 424479) (-306 "EQ.spad" 419048 419058 421835 421947) (-305 "EQ2.spad" 418766 418778 419038 419043) (-304 "EP.spad" 415092 415102 418756 418761) (-303 "ENV.spad" 413770 413778 415082 415087) (-302 "ENTIRER.spad" 413438 413446 413714 413765) (-301 "EMR.spad" 412726 412767 413364 413433) (-300 "ELTAGG.spad" 410980 410999 412716 412721) (-299 "ELTAGG.spad" 409198 409219 410936 410941) (-298 "ELTAB.spad" 408673 408686 409188 409193) (-297 "ELFUTS.spad" 408060 408079 408663 408668) (-296 "ELEMFUN.spad" 407749 407757 408050 408055) (-295 "ELEMFUN.spad" 407436 407446 407739 407744) (-294 "ELAGG.spad" 405407 405417 407416 407431) (-293 "ELAGG.spad" 403315 403327 405326 405331) (-292 "ELABOR.spad" 402661 402669 403305 403310) (-291 "ELABEXPR.spad" 401593 401601 402651 402656) (-290 "EFUPXS.spad" 398369 398399 401549 401554) (-289 "EFULS.spad" 395205 395228 398325 398330) (-288 "EFSTRUC.spad" 393220 393236 395195 395200) (-287 "EF.spad" 387996 388012 393210 393215) (-286 "EAB.spad" 386272 386280 387986 387991) (-285 "E04UCFA.spad" 385808 385816 386262 386267) (-284 "E04NAFA.spad" 385385 385393 385798 385803) (-283 "E04MBFA.spad" 384965 384973 385375 385380) (-282 "E04JAFA.spad" 384501 384509 384955 384960) (-281 "E04GCFA.spad" 384037 384045 384491 384496) (-280 "E04FDFA.spad" 383573 383581 384027 384032) (-279 "E04DGFA.spad" 383109 383117 383563 383568) (-278 "E04AGNT.spad" 378959 378967 383099 383104) (-277 "DVARCAT.spad" 375849 375859 378949 378954) (-276 "DVARCAT.spad" 372737 372749 375839 375844) (-275 "DSMP.spad" 370111 370125 370416 370543) (-274 "DSEXT.spad" 369413 369423 370101 370106) (-273 "DSEXT.spad" 368622 368634 369312 369317) (-272 "DROPT.spad" 362581 362589 368612 368617) (-271 "DROPT1.spad" 362246 362256 362571 362576) (-270 "DROPT0.spad" 357103 357111 362236 362241) (-269 "DRAWPT.spad" 355276 355284 357093 357098) (-268 "DRAW.spad" 348152 348165 355266 355271) (-267 "DRAWHACK.spad" 347460 347470 348142 348147) (-266 "DRAWCX.spad" 344930 344938 347450 347455) (-265 "DRAWCURV.spad" 344477 344492 344920 344925) (-264 "DRAWCFUN.spad" 334009 334017 344467 344472) (-263 "DQAGG.spad" 332187 332197 333977 334004) (-262 "DPOLCAT.spad" 327536 327552 332055 332182) (-261 "DPOLCAT.spad" 322971 322989 327492 327497) (-260 "DPMO.spad" 314731 314747 314869 315082) (-259 "DPMM.spad" 306504 306522 306629 306842) (-258 "DOMTMPLT.spad" 306275 306283 306494 306499) (-257 "DOMCTOR.spad" 306030 306038 306265 306270) (-256 "DOMAIN.spad" 305117 305125 306020 306025) (-255 "DMP.spad" 302377 302392 302947 303074) (-254 "DMEXT.spad" 302244 302254 302345 302372) (-253 "DLP.spad" 301596 301606 302234 302239) (-252 "DLIST.spad" 300022 300032 300626 300653) (-251 "DLAGG.spad" 298439 298449 300012 300017) (-250 "DIVRING.spad" 297981 297989 298383 298434) (-249 "DIVRING.spad" 297567 297577 297971 297976) (-248 "DISPLAY.spad" 295757 295765 297557 297562) (-247 "DIRPROD.spad" 283304 283320 283944 284043) (-246 "DIRPROD2.spad" 282122 282140 283294 283299) (-245 "DIRPCAT.spad" 281315 281331 282018 282117) (-244 "DIRPCAT.spad" 280135 280153 280840 280845) (-243 "DIOSP.spad" 278960 278968 280125 280130) (-242 "DIOPS.spad" 277956 277966 278940 278955) (-241 "DIOPS.spad" 276926 276938 277912 277917) (-240 "DIFRING.spad" 276764 276772 276906 276921) (-239 "DIFFSPC.spad" 276343 276351 276754 276759) (-238 "DIFFSPC.spad" 275920 275930 276333 276338) (-237 "DIFFMOD.spad" 275409 275419 275888 275915) (-236 "DIFFDOM.spad" 274574 274585 275399 275404) (-235 "DIFFDOM.spad" 273737 273750 274564 274569) (-234 "DIFEXT.spad" 273556 273566 273717 273732) (-233 "DIAGG.spad" 273186 273196 273536 273551) (-232 "DIAGG.spad" 272824 272836 273176 273181) (-231 "DHMATRIX.spad" 271019 271029 272164 272191) (-230 "DFSFUN.spad" 264659 264667 271009 271014) (-229 "DFLOAT.spad" 261390 261398 264549 264654) (-228 "DFINTTLS.spad" 259621 259637 261380 261385) (-227 "DERHAM.spad" 257535 257567 259601 259616) (-226 "DEQUEUE.spad" 256742 256752 257025 257052) (-225 "DEGRED.spad" 256359 256373 256732 256737) (-224 "DEFINTRF.spad" 253896 253906 256349 256354) (-223 "DEFINTEF.spad" 252406 252422 253886 253891) (-222 "DEFAST.spad" 251774 251782 252396 252401) (-221 "DECIMAL.spad" 249783 249791 250144 250237) (-220 "DDFACT.spad" 247596 247613 249773 249778) (-219 "DBLRESP.spad" 247196 247220 247586 247591) (-218 "DBASIS.spad" 246822 246837 247186 247191) (-217 "DBASE.spad" 245486 245496 246812 246817) (-216 "DATAARY.spad" 244948 244961 245476 245481) (-215 "D03FAFA.spad" 244776 244784 244938 244943) (-214 "D03EEFA.spad" 244596 244604 244766 244771) (-213 "D03AGNT.spad" 243682 243690 244586 244591) (-212 "D02EJFA.spad" 243144 243152 243672 243677) (-211 "D02CJFA.spad" 242622 242630 243134 243139) (-210 "D02BHFA.spad" 242112 242120 242612 242617) (-209 "D02BBFA.spad" 241602 241610 242102 242107) (-208 "D02AGNT.spad" 236416 236424 241592 241597) (-207 "D01WGTS.spad" 234735 234743 236406 236411) (-206 "D01TRNS.spad" 234712 234720 234725 234730) (-205 "D01GBFA.spad" 234234 234242 234702 234707) (-204 "D01FCFA.spad" 233756 233764 234224 234229) (-203 "D01ASFA.spad" 233224 233232 233746 233751) (-202 "D01AQFA.spad" 232670 232678 233214 233219) (-201 "D01APFA.spad" 232094 232102 232660 232665) (-200 "D01ANFA.spad" 231588 231596 232084 232089) (-199 "D01AMFA.spad" 231098 231106 231578 231583) (-198 "D01ALFA.spad" 230638 230646 231088 231093) (-197 "D01AKFA.spad" 230164 230172 230628 230633) (-196 "D01AJFA.spad" 229687 229695 230154 230159) (-195 "D01AGNT.spad" 225754 225762 229677 229682) (-194 "CYCLOTOM.spad" 225260 225268 225744 225749) (-193 "CYCLES.spad" 222052 222060 225250 225255) (-192 "CVMP.spad" 221469 221479 222042 222047) (-191 "CTRIGMNP.spad" 219969 219985 221459 221464) (-190 "CTOR.spad" 219660 219668 219959 219964) (-189 "CTORKIND.spad" 219263 219271 219650 219655) (-188 "CTORCAT.spad" 218512 218520 219253 219258) (-187 "CTORCAT.spad" 217759 217769 218502 218507) (-186 "CTORCALL.spad" 217348 217358 217749 217754) (-185 "CSTTOOLS.spad" 216593 216606 217338 217343) (-184 "CRFP.spad" 210317 210330 216583 216588) (-183 "CRCEAST.spad" 210037 210045 210307 210312) (-182 "CRAPACK.spad" 209088 209098 210027 210032) (-181 "CPMATCH.spad" 208592 208607 209013 209018) (-180 "CPIMA.spad" 208297 208316 208582 208587) (-179 "COORDSYS.spad" 203306 203316 208287 208292) (-178 "CONTOUR.spad" 202717 202725 203296 203301) (-177 "CONTFRAC.spad" 198467 198477 202619 202712) (-176 "CONDUIT.spad" 198225 198233 198457 198462) (-175 "COMRING.spad" 197899 197907 198163 198220) (-174 "COMPPROP.spad" 197417 197425 197889 197894) (-173 "COMPLPAT.spad" 197184 197199 197407 197412) (-172 "COMPLEX.spad" 192561 192571 192805 193066) (-171 "COMPLEX2.spad" 192276 192288 192551 192556) (-170 "COMPILER.spad" 191825 191833 192266 192271) (-169 "COMPFACT.spad" 191427 191441 191815 191820) (-168 "COMPCAT.spad" 189499 189509 191161 191422) (-167 "COMPCAT.spad" 187299 187311 188963 188968) (-166 "COMMUPC.spad" 187047 187065 187289 187294) (-165 "COMMONOP.spad" 186580 186588 187037 187042) (-164 "COMM.spad" 186391 186399 186570 186575) (-163 "COMMAAST.spad" 186154 186162 186381 186386) (-162 "COMBOPC.spad" 185069 185077 186144 186149) (-161 "COMBINAT.spad" 183836 183846 185059 185064) (-160 "COMBF.spad" 181218 181234 183826 183831) (-159 "COLOR.spad" 180055 180063 181208 181213) (-158 "COLONAST.spad" 179721 179729 180045 180050) (-157 "CMPLXRT.spad" 179432 179449 179711 179716) (-156 "CLLCTAST.spad" 179094 179102 179422 179427) (-155 "CLIP.spad" 175202 175210 179084 179089) (-154 "CLIF.spad" 173857 173873 175158 175197) (-153 "CLAGG.spad" 170362 170372 173847 173852) (-152 "CLAGG.spad" 166738 166750 170225 170230) (-151 "CINTSLPE.spad" 166069 166082 166728 166733) (-150 "CHVAR.spad" 164207 164229 166059 166064) (-149 "CHARZ.spad" 164122 164130 164187 164202) (-148 "CHARPOL.spad" 163632 163642 164112 164117) (-147 "CHARNZ.spad" 163385 163393 163612 163627) (-146 "CHAR.spad" 160742 160750 163375 163380) (-145 "CFCAT.spad" 160070 160078 160732 160737) (-144 "CDEN.spad" 159266 159280 160060 160065) (-143 "CCLASS.spad" 157377 157385 158639 158678) (-142 "CATEGORY.spad" 156419 156427 157367 157372) (-141 "CATCTOR.spad" 156310 156318 156409 156414) (-140 "CATAST.spad" 155928 155936 156300 156305) (-139 "CASEAST.spad" 155642 155650 155918 155923) (-138 "CARTEN.spad" 151009 151033 155632 155637) (-137 "CARTEN2.spad" 150399 150426 150999 151004) (-136 "CARD.spad" 147694 147702 150373 150394) (-135 "CAPSLAST.spad" 147468 147476 147684 147689) (-134 "CACHSET.spad" 147092 147100 147458 147463) (-133 "CABMON.spad" 146647 146655 147082 147087) (-132 "BYTEORD.spad" 146322 146330 146637 146642) (-131 "BYTE.spad" 145749 145757 146312 146317) (-130 "BYTEBUF.spad" 143447 143455 144757 144784) (-129 "BTREE.spad" 142403 142413 142937 142964) (-128 "BTOURN.spad" 141291 141301 141893 141920) (-127 "BTCAT.spad" 140683 140693 141259 141286) (-126 "BTCAT.spad" 140095 140107 140673 140678) (-125 "BTAGG.spad" 139561 139569 140063 140090) (-124 "BTAGG.spad" 139047 139057 139551 139556) (-123 "BSTREE.spad" 137671 137681 138537 138564) (-122 "BRILL.spad" 135868 135879 137661 137666) (-121 "BRAGG.spad" 134808 134818 135858 135863) (-120 "BRAGG.spad" 133712 133724 134764 134769) (-119 "BPADICRT.spad" 131586 131598 131841 131934) (-118 "BPADIC.spad" 131250 131262 131512 131581) (-117 "BOUNDZRO.spad" 130906 130923 131240 131245) (-116 "BOP.spad" 126088 126096 130896 130901) (-115 "BOP1.spad" 123554 123564 126078 126083) (-114 "BOOLE.spad" 123204 123212 123544 123549) (-113 "BOOLE.spad" 122852 122862 123194 123199) (-112 "BOOLEAN.spad" 122290 122298 122842 122847) (-111 "BMODULE.spad" 122002 122014 122258 122285) (-110 "BITS.spad" 121385 121393 121600 121627) (-109 "BINDING.spad" 120798 120806 121375 121380) (-108 "BINARY.spad" 118812 118820 119168 119261) (-107 "BGAGG.spad" 118017 118027 118792 118807) (-106 "BGAGG.spad" 117230 117242 118007 118012) (-105 "BFUNCT.spad" 116794 116802 117210 117225) (-104 "BEZOUT.spad" 115934 115961 116744 116749) (-103 "BBTREE.spad" 112662 112672 115424 115451) (-102 "BASTYPE.spad" 112158 112166 112652 112657) (-101 "BASTYPE.spad" 111652 111662 112148 112153) (-100 "BALFACT.spad" 111111 111124 111642 111647) (-99 "AUTOMOR.spad" 110562 110571 111091 111106) (-98 "ATTREG.spad" 107285 107292 110314 110557) (-97 "ATTRBUT.spad" 103308 103315 107265 107280) (-96 "ATTRAST.spad" 103025 103032 103298 103303) (-95 "ATRIG.spad" 102495 102502 103015 103020) (-94 "ATRIG.spad" 101963 101972 102485 102490) (-93 "ASTCAT.spad" 101867 101874 101953 101958) (-92 "ASTCAT.spad" 101769 101778 101857 101862) (-91 "ASTACK.spad" 100991 101000 101259 101286) (-90 "ASSOCEQ.spad" 99817 99828 100947 100952) (-89 "ASP9.spad" 98898 98911 99807 99812) (-88 "ASP8.spad" 97941 97954 98888 98893) (-87 "ASP80.spad" 97263 97276 97931 97936) (-86 "ASP7.spad" 96423 96436 97253 97258) (-85 "ASP78.spad" 95874 95887 96413 96418) (-84 "ASP77.spad" 95243 95256 95864 95869) (-83 "ASP74.spad" 94335 94348 95233 95238) (-82 "ASP73.spad" 93606 93619 94325 94330) (-81 "ASP6.spad" 92473 92486 93596 93601) (-80 "ASP55.spad" 90982 90995 92463 92468) (-79 "ASP50.spad" 88799 88812 90972 90977) (-78 "ASP4.spad" 88094 88107 88789 88794) (-77 "ASP49.spad" 87093 87106 88084 88089) (-76 "ASP42.spad" 85500 85539 87083 87088) (-75 "ASP41.spad" 84079 84118 85490 85495) (-74 "ASP35.spad" 83067 83080 84069 84074) (-73 "ASP34.spad" 82368 82381 83057 83062) (-72 "ASP33.spad" 81928 81941 82358 82363) (-71 "ASP31.spad" 81068 81081 81918 81923) (-70 "ASP30.spad" 79960 79973 81058 81063) (-69 "ASP29.spad" 79426 79439 79950 79955) (-68 "ASP28.spad" 70699 70712 79416 79421) (-67 "ASP27.spad" 69596 69609 70689 70694) (-66 "ASP24.spad" 68683 68696 69586 69591) (-65 "ASP20.spad" 68147 68160 68673 68678) (-64 "ASP1.spad" 67528 67541 68137 68142) (-63 "ASP19.spad" 62214 62227 67518 67523) (-62 "ASP12.spad" 61628 61641 62204 62209) (-61 "ASP10.spad" 60899 60912 61618 61623) (-60 "ARRAY2.spad" 60142 60151 60389 60416) (-59 "ARRAY1.spad" 58826 58835 59172 59199) (-58 "ARRAY12.spad" 57539 57550 58816 58821) (-57 "ARR2CAT.spad" 53313 53334 57507 57534) (-56 "ARR2CAT.spad" 49107 49130 53303 53308) (-55 "ARITY.spad" 48479 48486 49097 49102) (-54 "APPRULE.spad" 47739 47761 48469 48474) (-53 "APPLYORE.spad" 47358 47371 47729 47734) (-52 "ANY.spad" 46217 46224 47348 47353) (-51 "ANY1.spad" 45288 45297 46207 46212) (-50 "ANTISYM.spad" 43733 43749 45268 45283) (-49 "ANON.spad" 43426 43433 43723 43728) (-48 "AN.spad" 41735 41742 43242 43335) (-47 "AMR.spad" 39920 39931 41633 41730) (-46 "AMR.spad" 37942 37955 39657 39662) (-45 "ALIST.spad" 34842 34863 35192 35219) (-44 "ALGSC.spad" 33977 34003 34714 34767) (-43 "ALGPKG.spad" 29760 29771 33933 33938) (-42 "ALGMFACT.spad" 28953 28967 29750 29755) (-41 "ALGMANIP.spad" 26427 26442 28786 28791) (-40 "ALGFF.spad" 24068 24095 24285 24441) (-39 "ALGFACT.spad" 23195 23205 24058 24063) (-38 "ALGEBRA.spad" 23028 23037 23151 23190) (-37 "ALGEBRA.spad" 22893 22904 23018 23023) (-36 "ALAGG.spad" 22405 22426 22861 22888) (-35 "AHYP.spad" 21786 21793 22395 22400) (-34 "AGG.spad" 20103 20110 21776 21781) (-33 "AGG.spad" 18384 18393 20059 20064) (-32 "AF.spad" 16815 16830 18319 18324) (-31 "ADDAST.spad" 16493 16500 16805 16810) (-30 "ACPLOT.spad" 15084 15091 16483 16488) (-29 "ACFS.spad" 12893 12902 14986 15079) (-28 "ACFS.spad" 10788 10799 12883 12888) (-27 "ACF.spad" 7470 7477 10690 10783) (-26 "ACF.spad" 4238 4247 7460 7465) (-25 "ABELSG.spad" 3779 3786 4228 4233) (-24 "ABELSG.spad" 3318 3327 3769 3774) (-23 "ABELMON.spad" 2861 2868 3308 3313) (-22 "ABELMON.spad" 2402 2411 2851 2856) (-21 "ABELGRP.spad" 2067 2074 2392 2397) (-20 "ABELGRP.spad" 1730 1739 2057 2062) (-19 "A1AGG.spad" 870 879 1698 1725) (-18 "A1AGG.spad" 30 41 860 865)) 
-\ No newline at end of file
+((-3 NIL 2300594 2300599 2300604 2300609) (-2 NIL 2300574 2300579 2300584 2300589) (-1 NIL 2300554 2300559 2300564 2300569) (0 NIL 2300534 2300539 2300544 2300549) (-1327 "ZMOD.spad" 2300343 2300356 2300472 2300529) (-1326 "ZLINDEP.spad" 2299409 2299420 2300333 2300338) (-1325 "ZDSOLVE.spad" 2289353 2289375 2299399 2299404) (-1324 "YSTREAM.spad" 2288848 2288859 2289343 2289348) (-1323 "YDIAGRAM.spad" 2288482 2288491 2288838 2288843) (-1322 "XRPOLY.spad" 2287702 2287722 2288338 2288407) (-1321 "XPR.spad" 2285497 2285510 2287420 2287519) (-1320 "XPOLY.spad" 2285052 2285063 2285353 2285422) (-1319 "XPOLYC.spad" 2284371 2284387 2284978 2285047) (-1318 "XPBWPOLY.spad" 2282808 2282828 2284151 2284220) (-1317 "XF.spad" 2281271 2281286 2282710 2282803) (-1316 "XF.spad" 2279714 2279731 2281155 2281160) (-1315 "XFALG.spad" 2276762 2276778 2279640 2279709) (-1314 "XEXPPKG.spad" 2276013 2276039 2276752 2276757) (-1313 "XDPOLY.spad" 2275627 2275643 2275869 2275938) (-1312 "XALG.spad" 2275287 2275298 2275583 2275622) (-1311 "WUTSET.spad" 2271090 2271107 2274897 2274924) (-1310 "WP.spad" 2270289 2270333 2270948 2271015) (-1309 "WHILEAST.spad" 2270087 2270096 2270279 2270284) (-1308 "WHEREAST.spad" 2269758 2269767 2270077 2270082) (-1307 "WFFINTBS.spad" 2267421 2267443 2269748 2269753) (-1306 "WEIER.spad" 2265643 2265654 2267411 2267416) (-1305 "VSPACE.spad" 2265316 2265327 2265611 2265638) (-1304 "VSPACE.spad" 2265009 2265022 2265306 2265311) (-1303 "VOID.spad" 2264686 2264695 2264999 2265004) (-1302 "VIEW.spad" 2262366 2262375 2264676 2264681) (-1301 "VIEWDEF.spad" 2257567 2257576 2262356 2262361) (-1300 "VIEW3D.spad" 2241528 2241537 2257557 2257562) (-1299 "VIEW2D.spad" 2229419 2229428 2241518 2241523) (-1298 "VECTOR.spad" 2227940 2227951 2228191 2228218) (-1297 "VECTOR2.spad" 2226579 2226592 2227930 2227935) (-1296 "VECTCAT.spad" 2224483 2224494 2226547 2226574) (-1295 "VECTCAT.spad" 2222194 2222207 2224260 2224265) (-1294 "VARIABLE.spad" 2221974 2221989 2222184 2222189) (-1293 "UTYPE.spad" 2221618 2221627 2221964 2221969) (-1292 "UTSODETL.spad" 2220913 2220937 2221574 2221579) (-1291 "UTSODE.spad" 2219129 2219149 2220903 2220908) (-1290 "UTS.spad" 2214076 2214104 2217596 2217693) (-1289 "UTSCAT.spad" 2211555 2211571 2213974 2214071) (-1288 "UTSCAT.spad" 2208678 2208696 2211099 2211104) (-1287 "UTS2.spad" 2208273 2208308 2208668 2208673) (-1286 "URAGG.spad" 2202946 2202957 2208263 2208268) (-1285 "URAGG.spad" 2197583 2197596 2202902 2202907) (-1284 "UPXSSING.spad" 2195228 2195254 2196664 2196797) (-1283 "UPXS.spad" 2192524 2192552 2193360 2193509) (-1282 "UPXSCONS.spad" 2190283 2190303 2190656 2190805) (-1281 "UPXSCCA.spad" 2188854 2188874 2190129 2190278) (-1280 "UPXSCCA.spad" 2187567 2187589 2188844 2188849) (-1279 "UPXSCAT.spad" 2186156 2186172 2187413 2187562) (-1278 "UPXS2.spad" 2185699 2185752 2186146 2186151) (-1277 "UPSQFREE.spad" 2184113 2184127 2185689 2185694) (-1276 "UPSCAT.spad" 2181900 2181924 2184011 2184108) (-1275 "UPSCAT.spad" 2179393 2179419 2181506 2181511) (-1274 "UPOLYC.spad" 2174433 2174444 2179235 2179388) (-1273 "UPOLYC.spad" 2169365 2169378 2174169 2174174) (-1272 "UPOLYC2.spad" 2168836 2168855 2169355 2169360) (-1271 "UP.spad" 2165942 2165957 2166329 2166482) (-1270 "UPMP.spad" 2164842 2164855 2165932 2165937) (-1269 "UPDIVP.spad" 2164407 2164421 2164832 2164837) (-1268 "UPDECOMP.spad" 2162652 2162666 2164397 2164402) (-1267 "UPCDEN.spad" 2161861 2161877 2162642 2162647) (-1266 "UP2.spad" 2161225 2161246 2161851 2161856) (-1265 "UNISEG.spad" 2160578 2160589 2161144 2161149) (-1264 "UNISEG2.spad" 2160075 2160088 2160534 2160539) (-1263 "UNIFACT.spad" 2159178 2159190 2160065 2160070) (-1262 "ULS.spad" 2148962 2148990 2149907 2150336) (-1261 "ULSCONS.spad" 2140096 2140116 2140466 2140615) (-1260 "ULSCCAT.spad" 2137833 2137853 2139942 2140091) (-1259 "ULSCCAT.spad" 2135678 2135700 2137789 2137794) (-1258 "ULSCAT.spad" 2133910 2133926 2135524 2135673) (-1257 "ULS2.spad" 2133424 2133477 2133900 2133905) (-1256 "UINT8.spad" 2133301 2133310 2133414 2133419) (-1255 "UINT64.spad" 2133177 2133186 2133291 2133296) (-1254 "UINT32.spad" 2133053 2133062 2133167 2133172) (-1253 "UINT16.spad" 2132929 2132938 2133043 2133048) (-1252 "UFD.spad" 2131994 2132003 2132855 2132924) (-1251 "UFD.spad" 2131121 2131132 2131984 2131989) (-1250 "UDVO.spad" 2130002 2130011 2131111 2131116) (-1249 "UDPO.spad" 2127495 2127506 2129958 2129963) (-1248 "TYPE.spad" 2127427 2127436 2127485 2127490) (-1247 "TYPEAST.spad" 2127346 2127355 2127417 2127422) (-1246 "TWOFACT.spad" 2125998 2126013 2127336 2127341) (-1245 "TUPLE.spad" 2125484 2125495 2125897 2125902) (-1244 "TUBETOOL.spad" 2122351 2122360 2125474 2125479) (-1243 "TUBE.spad" 2120998 2121015 2122341 2122346) (-1242 "TS.spad" 2119597 2119613 2120563 2120660) (-1241 "TSETCAT.spad" 2106724 2106741 2119565 2119592) (-1240 "TSETCAT.spad" 2093837 2093856 2106680 2106685) (-1239 "TRMANIP.spad" 2088203 2088220 2093543 2093548) (-1238 "TRIMAT.spad" 2087166 2087191 2088193 2088198) (-1237 "TRIGMNIP.spad" 2085693 2085710 2087156 2087161) (-1236 "TRIGCAT.spad" 2085205 2085214 2085683 2085688) (-1235 "TRIGCAT.spad" 2084715 2084726 2085195 2085200) (-1234 "TREE.spad" 2083173 2083184 2084205 2084232) (-1233 "TRANFUN.spad" 2083012 2083021 2083163 2083168) (-1232 "TRANFUN.spad" 2082849 2082860 2083002 2083007) (-1231 "TOPSP.spad" 2082523 2082532 2082839 2082844) (-1230 "TOOLSIGN.spad" 2082186 2082197 2082513 2082518) (-1229 "TEXTFILE.spad" 2080747 2080756 2082176 2082181) (-1228 "TEX.spad" 2077893 2077902 2080737 2080742) (-1227 "TEX1.spad" 2077449 2077460 2077883 2077888) (-1226 "TEMUTL.spad" 2077004 2077013 2077439 2077444) (-1225 "TBCMPPK.spad" 2075097 2075120 2076994 2076999) (-1224 "TBAGG.spad" 2074147 2074170 2075077 2075092) (-1223 "TBAGG.spad" 2073205 2073230 2074137 2074142) (-1222 "TANEXP.spad" 2072613 2072624 2073195 2073200) (-1221 "TALGOP.spad" 2072337 2072348 2072603 2072608) (-1220 "TABLE.spad" 2070306 2070329 2070576 2070603) (-1219 "TABLEAU.spad" 2069787 2069798 2070296 2070301) (-1218 "TABLBUMP.spad" 2066590 2066601 2069777 2069782) (-1217 "SYSTEM.spad" 2065818 2065827 2066580 2066585) (-1216 "SYSSOLP.spad" 2063301 2063312 2065808 2065813) (-1215 "SYSPTR.spad" 2063200 2063209 2063291 2063296) (-1214 "SYSNNI.spad" 2062391 2062402 2063190 2063195) (-1213 "SYSINT.spad" 2061795 2061806 2062381 2062386) (-1212 "SYNTAX.spad" 2058001 2058010 2061785 2061790) (-1211 "SYMTAB.spad" 2056069 2056078 2057991 2057996) (-1210 "SYMS.spad" 2052092 2052101 2056059 2056064) (-1209 "SYMPOLY.spad" 2051098 2051109 2051180 2051307) (-1208 "SYMFUNC.spad" 2050599 2050610 2051088 2051093) (-1207 "SYMBOL.spad" 2048102 2048111 2050589 2050594) (-1206 "SWITCH.spad" 2044873 2044882 2048092 2048097) (-1205 "SUTS.spad" 2041921 2041949 2043340 2043437) (-1204 "SUPXS.spad" 2039204 2039232 2040053 2040202) (-1203 "SUP.spad" 2035924 2035935 2036697 2036850) (-1202 "SUPFRACF.spad" 2035029 2035047 2035914 2035919) (-1201 "SUP2.spad" 2034421 2034434 2035019 2035024) (-1200 "SUMRF.spad" 2033395 2033406 2034411 2034416) (-1199 "SUMFS.spad" 2033032 2033049 2033385 2033390) (-1198 "SULS.spad" 2022803 2022831 2023761 2024190) (-1197 "SUCHTAST.spad" 2022572 2022581 2022793 2022798) (-1196 "SUCH.spad" 2022254 2022269 2022562 2022567) (-1195 "SUBSPACE.spad" 2014369 2014384 2022244 2022249) (-1194 "SUBRESP.spad" 2013539 2013553 2014325 2014330) (-1193 "STTF.spad" 2009638 2009654 2013529 2013534) (-1192 "STTFNC.spad" 2006106 2006122 2009628 2009633) (-1191 "STTAYLOR.spad" 1998741 1998752 2005987 2005992) (-1190 "STRTBL.spad" 1996792 1996809 1996941 1996968) (-1189 "STRING.spad" 1995579 1995588 1995800 1995827) (-1188 "STREAM.spad" 1992380 1992391 1994987 1995002) (-1187 "STREAM3.spad" 1991953 1991968 1992370 1992375) (-1186 "STREAM2.spad" 1991081 1991094 1991943 1991948) (-1185 "STREAM1.spad" 1990787 1990798 1991071 1991076) (-1184 "STINPROD.spad" 1989723 1989739 1990777 1990782) (-1183 "STEP.spad" 1988924 1988933 1989713 1989718) (-1182 "STEPAST.spad" 1988158 1988167 1988914 1988919) (-1181 "STBL.spad" 1986242 1986270 1986409 1986424) (-1180 "STAGG.spad" 1985317 1985328 1986232 1986237) (-1179 "STAGG.spad" 1984390 1984403 1985307 1985312) (-1178 "STACK.spad" 1983630 1983641 1983880 1983907) (-1177 "SREGSET.spad" 1981298 1981315 1983240 1983267) (-1176 "SRDCMPK.spad" 1979859 1979879 1981288 1981293) (-1175 "SRAGG.spad" 1975002 1975011 1979827 1979854) (-1174 "SRAGG.spad" 1970165 1970176 1974992 1974997) (-1173 "SQMATRIX.spad" 1967708 1967726 1968624 1968711) (-1172 "SPLTREE.spad" 1962104 1962117 1966988 1967015) (-1171 "SPLNODE.spad" 1958692 1958705 1962094 1962099) (-1170 "SPFCAT.spad" 1957501 1957510 1958682 1958687) (-1169 "SPECOUT.spad" 1956053 1956062 1957491 1957496) (-1168 "SPADXPT.spad" 1947648 1947657 1956043 1956048) (-1167 "spad-parser.spad" 1947113 1947122 1947638 1947643) (-1166 "SPADAST.spad" 1946814 1946823 1947103 1947108) (-1165 "SPACEC.spad" 1931013 1931024 1946804 1946809) (-1164 "SPACE3.spad" 1930789 1930800 1931003 1931008) (-1163 "SORTPAK.spad" 1930338 1930351 1930745 1930750) (-1162 "SOLVETRA.spad" 1928101 1928112 1930328 1930333) (-1161 "SOLVESER.spad" 1926629 1926640 1928091 1928096) (-1160 "SOLVERAD.spad" 1922655 1922666 1926619 1926624) (-1159 "SOLVEFOR.spad" 1921117 1921135 1922645 1922650) (-1158 "SNTSCAT.spad" 1920717 1920734 1921085 1921112) (-1157 "SMTS.spad" 1918989 1919015 1920282 1920379) (-1156 "SMP.spad" 1916464 1916484 1916854 1916981) (-1155 "SMITH.spad" 1915309 1915334 1916454 1916459) (-1154 "SMATCAT.spad" 1913419 1913449 1915253 1915304) (-1153 "SMATCAT.spad" 1911461 1911493 1913297 1913302) (-1152 "SKAGG.spad" 1910424 1910435 1911429 1911456) (-1151 "SINT.spad" 1909364 1909373 1910290 1910419) (-1150 "SIMPAN.spad" 1909092 1909101 1909354 1909359) (-1149 "SIG.spad" 1908422 1908431 1909082 1909087) (-1148 "SIGNRF.spad" 1907540 1907551 1908412 1908417) (-1147 "SIGNEF.spad" 1906819 1906836 1907530 1907535) (-1146 "SIGAST.spad" 1906204 1906213 1906809 1906814) (-1145 "SHP.spad" 1904132 1904147 1906160 1906165) (-1144 "SHDP.spad" 1891810 1891837 1892319 1892418) (-1143 "SGROUP.spad" 1891418 1891427 1891800 1891805) (-1142 "SGROUP.spad" 1891024 1891035 1891408 1891413) (-1141 "SGCF.spad" 1884163 1884172 1891014 1891019) (-1140 "SFRTCAT.spad" 1883093 1883110 1884131 1884158) (-1139 "SFRGCD.spad" 1882156 1882176 1883083 1883088) (-1138 "SFQCMPK.spad" 1876793 1876813 1882146 1882151) (-1137 "SFORT.spad" 1876232 1876246 1876783 1876788) (-1136 "SEXOF.spad" 1876075 1876115 1876222 1876227) (-1135 "SEX.spad" 1875967 1875976 1876065 1876070) (-1134 "SEXCAT.spad" 1873739 1873779 1875957 1875962) (-1133 "SET.spad" 1872027 1872038 1873124 1873163) (-1132 "SETMN.spad" 1870477 1870494 1872017 1872022) (-1131 "SETCAT.spad" 1869962 1869971 1870467 1870472) (-1130 "SETCAT.spad" 1869445 1869456 1869952 1869957) (-1129 "SETAGG.spad" 1865994 1866005 1869425 1869440) (-1128 "SETAGG.spad" 1862551 1862564 1865984 1865989) (-1127 "SEQAST.spad" 1862254 1862263 1862541 1862546) (-1126 "SEGXCAT.spad" 1861410 1861423 1862244 1862249) (-1125 "SEG.spad" 1861223 1861234 1861329 1861334) (-1124 "SEGCAT.spad" 1860148 1860159 1861213 1861218) (-1123 "SEGBIND.spad" 1859906 1859917 1860095 1860100) (-1122 "SEGBIND2.spad" 1859604 1859617 1859896 1859901) (-1121 "SEGAST.spad" 1859318 1859327 1859594 1859599) (-1120 "SEG2.spad" 1858753 1858766 1859274 1859279) (-1119 "SDVAR.spad" 1858029 1858040 1858743 1858748) (-1118 "SDPOL.spad" 1855362 1855373 1855653 1855780) (-1117 "SCPKG.spad" 1853451 1853462 1855352 1855357) (-1116 "SCOPE.spad" 1852604 1852613 1853441 1853446) (-1115 "SCACHE.spad" 1851300 1851311 1852594 1852599) (-1114 "SASTCAT.spad" 1851209 1851218 1851290 1851295) (-1113 "SAOS.spad" 1851081 1851090 1851199 1851204) (-1112 "SAERFFC.spad" 1850794 1850814 1851071 1851076) (-1111 "SAE.spad" 1848264 1848280 1848875 1849010) (-1110 "SAEFACT.spad" 1847965 1847985 1848254 1848259) (-1109 "RURPK.spad" 1845624 1845640 1847955 1847960) (-1108 "RULESET.spad" 1845077 1845101 1845614 1845619) (-1107 "RULE.spad" 1843317 1843341 1845067 1845072) (-1106 "RULECOLD.spad" 1843169 1843182 1843307 1843312) (-1105 "RTVALUE.spad" 1842904 1842913 1843159 1843164) (-1104 "RSTRCAST.spad" 1842621 1842630 1842894 1842899) (-1103 "RSETGCD.spad" 1838999 1839019 1842611 1842616) (-1102 "RSETCAT.spad" 1828935 1828952 1838967 1838994) (-1101 "RSETCAT.spad" 1818891 1818910 1828925 1828930) (-1100 "RSDCMPK.spad" 1817343 1817363 1818881 1818886) (-1099 "RRCC.spad" 1815727 1815757 1817333 1817338) (-1098 "RRCC.spad" 1814109 1814141 1815717 1815722) (-1097 "RPTAST.spad" 1813811 1813820 1814099 1814104) (-1096 "RPOLCAT.spad" 1793171 1793186 1813679 1813806) (-1095 "RPOLCAT.spad" 1772244 1772261 1792754 1792759) (-1094 "ROUTINE.spad" 1767665 1767674 1770429 1770456) (-1093 "ROMAN.spad" 1766993 1767002 1767531 1767660) (-1092 "ROIRC.spad" 1766073 1766105 1766983 1766988) (-1091 "RNS.spad" 1764976 1764985 1765975 1766068) (-1090 "RNS.spad" 1763965 1763976 1764966 1764971) (-1089 "RNG.spad" 1763700 1763709 1763955 1763960) (-1088 "RNGBIND.spad" 1762860 1762874 1763655 1763660) (-1087 "RMODULE.spad" 1762625 1762636 1762850 1762855) (-1086 "RMCAT2.spad" 1762045 1762102 1762615 1762620) (-1085 "RMATRIX.spad" 1760833 1760852 1761176 1761215) (-1084 "RMATCAT.spad" 1756412 1756443 1760789 1760828) (-1083 "RMATCAT.spad" 1751881 1751914 1756260 1756265) (-1082 "RLINSET.spad" 1751585 1751596 1751871 1751876) (-1081 "RINTERP.spad" 1751473 1751493 1751575 1751580) (-1080 "RING.spad" 1750943 1750952 1751453 1751468) (-1079 "RING.spad" 1750421 1750432 1750933 1750938) (-1078 "RIDIST.spad" 1749813 1749822 1750411 1750416) (-1077 "RGCHAIN.spad" 1748341 1748357 1749243 1749270) (-1076 "RGBCSPC.spad" 1748122 1748134 1748331 1748336) (-1075 "RGBCMDL.spad" 1747652 1747664 1748112 1748117) (-1074 "RF.spad" 1745294 1745305 1747642 1747647) (-1073 "RFFACTOR.spad" 1744756 1744767 1745284 1745289) (-1072 "RFFACT.spad" 1744491 1744503 1744746 1744751) (-1071 "RFDIST.spad" 1743487 1743496 1744481 1744486) (-1070 "RETSOL.spad" 1742906 1742919 1743477 1743482) (-1069 "RETRACT.spad" 1742334 1742345 1742896 1742901) (-1068 "RETRACT.spad" 1741760 1741773 1742324 1742329) (-1067 "RETAST.spad" 1741572 1741581 1741750 1741755) (-1066 "RESULT.spad" 1739170 1739179 1739757 1739784) (-1065 "RESRING.spad" 1738517 1738564 1739108 1739165) (-1064 "RESLATC.spad" 1737841 1737852 1738507 1738512) (-1063 "REPSQ.spad" 1737572 1737583 1737831 1737836) (-1062 "REP.spad" 1735126 1735135 1737562 1737567) (-1061 "REPDB.spad" 1734833 1734844 1735116 1735121) (-1060 "REP2.spad" 1724491 1724502 1734675 1734680) (-1059 "REP1.spad" 1718687 1718698 1724441 1724446) (-1058 "REGSET.spad" 1716448 1716465 1718297 1718324) (-1057 "REF.spad" 1715783 1715794 1716403 1716408) (-1056 "REDORDER.spad" 1714989 1715006 1715773 1715778) (-1055 "RECLOS.spad" 1713772 1713792 1714476 1714569) (-1054 "REALSOLV.spad" 1712912 1712921 1713762 1713767) (-1053 "REAL.spad" 1712784 1712793 1712902 1712907) (-1052 "REAL0Q.spad" 1710082 1710097 1712774 1712779) (-1051 "REAL0.spad" 1706926 1706941 1710072 1710077) (-1050 "RDUCEAST.spad" 1706647 1706656 1706916 1706921) (-1049 "RDIV.spad" 1706302 1706327 1706637 1706642) (-1048 "RDIST.spad" 1705869 1705880 1706292 1706297) (-1047 "RDETRS.spad" 1704733 1704751 1705859 1705864) (-1046 "RDETR.spad" 1702872 1702890 1704723 1704728) (-1045 "RDEEFS.spad" 1701971 1701988 1702862 1702867) (-1044 "RDEEF.spad" 1700981 1700998 1701961 1701966) (-1043 "RCFIELD.spad" 1698167 1698176 1700883 1700976) (-1042 "RCFIELD.spad" 1695439 1695450 1698157 1698162) (-1041 "RCAGG.spad" 1693367 1693378 1695429 1695434) (-1040 "RCAGG.spad" 1691222 1691235 1693286 1693291) (-1039 "RATRET.spad" 1690582 1690593 1691212 1691217) (-1038 "RATFACT.spad" 1690274 1690286 1690572 1690577) (-1037 "RANDSRC.spad" 1689593 1689602 1690264 1690269) (-1036 "RADUTIL.spad" 1689349 1689358 1689583 1689588) (-1035 "RADIX.spad" 1686173 1686187 1687719 1687812) (-1034 "RADFF.spad" 1683912 1683949 1684031 1684187) (-1033 "RADCAT.spad" 1683507 1683516 1683902 1683907) (-1032 "RADCAT.spad" 1683100 1683111 1683497 1683502) (-1031 "QUEUE.spad" 1682331 1682342 1682590 1682617) (-1030 "QUAT.spad" 1680819 1680830 1681162 1681227) (-1029 "QUATCT2.spad" 1680439 1680458 1680809 1680814) (-1028 "QUATCAT.spad" 1678609 1678620 1680369 1680434) (-1027 "QUATCAT.spad" 1676530 1676543 1678292 1678297) (-1026 "QUAGG.spad" 1675357 1675368 1676498 1676525) (-1025 "QQUTAST.spad" 1675125 1675134 1675347 1675352) (-1024 "QFORM.spad" 1674743 1674758 1675115 1675120) (-1023 "QFCAT.spad" 1673445 1673456 1674645 1674738) (-1022 "QFCAT.spad" 1671738 1671751 1672940 1672945) (-1021 "QFCAT2.spad" 1671430 1671447 1671728 1671733) (-1020 "QEQUAT.spad" 1670988 1670997 1671420 1671425) (-1019 "QCMPACK.spad" 1665734 1665754 1670978 1670983) (-1018 "QALGSET.spad" 1661812 1661845 1665648 1665653) (-1017 "QALGSET2.spad" 1659807 1659826 1661802 1661807) (-1016 "PWFFINTB.spad" 1657222 1657244 1659797 1659802) (-1015 "PUSHVAR.spad" 1656560 1656580 1657212 1657217) (-1014 "PTRANFN.spad" 1652687 1652698 1656550 1656555) (-1013 "PTPACK.spad" 1649774 1649785 1652677 1652682) (-1012 "PTFUNC2.spad" 1649596 1649611 1649764 1649769) (-1011 "PTCAT.spad" 1648850 1648861 1649564 1649591) (-1010 "PSQFR.spad" 1648156 1648181 1648840 1648845) (-1009 "PSEUDLIN.spad" 1647041 1647052 1648146 1648151) (-1008 "PSETPK.spad" 1632473 1632490 1646919 1646924) (-1007 "PSETCAT.spad" 1626392 1626416 1632453 1632468) (-1006 "PSETCAT.spad" 1620285 1620311 1626348 1626353) (-1005 "PSCURVE.spad" 1619267 1619276 1620275 1620280) (-1004 "PSCAT.spad" 1618049 1618079 1619165 1619262) (-1003 "PSCAT.spad" 1616921 1616953 1618039 1618044) (-1002 "PRTITION.spad" 1615618 1615627 1616911 1616916) (-1001 "PRTDAST.spad" 1615336 1615345 1615608 1615613) (-1000 "PRS.spad" 1604897 1604915 1615292 1615297) (-999 "PRQAGG.spad" 1604332 1604342 1604865 1604892) (-998 "PROPLOG.spad" 1603904 1603912 1604322 1604327) (-997 "PROPFUN2.spad" 1603527 1603540 1603894 1603899) (-996 "PROPFUN1.spad" 1602925 1602936 1603517 1603522) (-995 "PROPFRML.spad" 1601493 1601504 1602915 1602920) (-994 "PROPERTY.spad" 1600981 1600989 1601483 1601488) (-993 "PRODUCT.spad" 1598663 1598675 1598947 1599002) (-992 "PR.spad" 1597055 1597067 1597754 1597881) (-991 "PRINT.spad" 1596807 1596815 1597045 1597050) (-990 "PRIMES.spad" 1595060 1595070 1596797 1596802) (-989 "PRIMELT.spad" 1593141 1593155 1595050 1595055) (-988 "PRIMCAT.spad" 1592768 1592776 1593131 1593136) (-987 "PRIMARR.spad" 1591620 1591630 1591798 1591825) (-986 "PRIMARR2.spad" 1590387 1590399 1591610 1591615) (-985 "PREASSOC.spad" 1589769 1589781 1590377 1590382) (-984 "PPCURVE.spad" 1588906 1588914 1589759 1589764) (-983 "PORTNUM.spad" 1588681 1588689 1588896 1588901) (-982 "POLYROOT.spad" 1587530 1587552 1588637 1588642) (-981 "POLY.spad" 1584865 1584875 1585380 1585507) (-980 "POLYLIFT.spad" 1584130 1584153 1584855 1584860) (-979 "POLYCATQ.spad" 1582248 1582270 1584120 1584125) (-978 "POLYCAT.spad" 1575718 1575739 1582116 1582243) (-977 "POLYCAT.spad" 1568526 1568549 1574926 1574931) (-976 "POLY2UP.spad" 1567978 1567992 1568516 1568521) (-975 "POLY2.spad" 1567575 1567587 1567968 1567973) (-974 "POLUTIL.spad" 1566516 1566545 1567531 1567536) (-973 "POLTOPOL.spad" 1565264 1565279 1566506 1566511) (-972 "POINT.spad" 1563949 1563959 1564036 1564063) (-971 "PNTHEORY.spad" 1560651 1560659 1563939 1563944) (-970 "PMTOOLS.spad" 1559426 1559440 1560641 1560646) (-969 "PMSYM.spad" 1558975 1558985 1559416 1559421) (-968 "PMQFCAT.spad" 1558566 1558580 1558965 1558970) (-967 "PMPRED.spad" 1558045 1558059 1558556 1558561) (-966 "PMPREDFS.spad" 1557499 1557521 1558035 1558040) (-965 "PMPLCAT.spad" 1556579 1556597 1557431 1557436) (-964 "PMLSAGG.spad" 1556164 1556178 1556569 1556574) (-963 "PMKERNEL.spad" 1555743 1555755 1556154 1556159) (-962 "PMINS.spad" 1555323 1555333 1555733 1555738) (-961 "PMFS.spad" 1554900 1554918 1555313 1555318) (-960 "PMDOWN.spad" 1554190 1554204 1554890 1554895) (-959 "PMASS.spad" 1553200 1553208 1554180 1554185) (-958 "PMASSFS.spad" 1552167 1552183 1553190 1553195) (-957 "PLOTTOOL.spad" 1551947 1551955 1552157 1552162) (-956 "PLOT.spad" 1546870 1546878 1551937 1551942) (-955 "PLOT3D.spad" 1543334 1543342 1546860 1546865) (-954 "PLOT1.spad" 1542491 1542501 1543324 1543329) (-953 "PLEQN.spad" 1529781 1529808 1542481 1542486) (-952 "PINTERP.spad" 1529403 1529422 1529771 1529776) (-951 "PINTERPA.spad" 1529187 1529203 1529393 1529398) (-950 "PI.spad" 1528796 1528804 1529161 1529182) (-949 "PID.spad" 1527766 1527774 1528722 1528791) (-948 "PICOERCE.spad" 1527423 1527433 1527756 1527761) (-947 "PGROEB.spad" 1526024 1526038 1527413 1527418) (-946 "PGE.spad" 1517641 1517649 1526014 1526019) (-945 "PGCD.spad" 1516531 1516548 1517631 1517636) (-944 "PFRPAC.spad" 1515680 1515690 1516521 1516526) (-943 "PFR.spad" 1512343 1512353 1515582 1515675) (-942 "PFOTOOLS.spad" 1511601 1511617 1512333 1512338) (-941 "PFOQ.spad" 1510971 1510989 1511591 1511596) (-940 "PFO.spad" 1510390 1510417 1510961 1510966) (-939 "PF.spad" 1509964 1509976 1510195 1510288) (-938 "PFECAT.spad" 1507646 1507654 1509890 1509959) (-937 "PFECAT.spad" 1505356 1505366 1507602 1507607) (-936 "PFBRU.spad" 1503244 1503256 1505346 1505351) (-935 "PFBR.spad" 1500804 1500827 1503234 1503239) (-934 "PERM.spad" 1496611 1496621 1500634 1500649) (-933 "PERMGRP.spad" 1491381 1491391 1496601 1496606) (-932 "PERMCAT.spad" 1490042 1490052 1491361 1491376) (-931 "PERMAN.spad" 1488574 1488588 1490032 1490037) (-930 "PENDTREE.spad" 1487798 1487808 1488086 1488091) (-929 "PDSPC.spad" 1486611 1486621 1487788 1487793) (-928 "PDSPC.spad" 1485422 1485434 1486601 1486606) (-927 "PDRING.spad" 1485264 1485274 1485402 1485417) (-926 "PDMOD.spad" 1485080 1485092 1485232 1485259) (-925 "PDEPROB.spad" 1484095 1484103 1485070 1485075) (-924 "PDEPACK.spad" 1478135 1478143 1484085 1484090) (-923 "PDECOMP.spad" 1477605 1477622 1478125 1478130) (-922 "PDECAT.spad" 1475961 1475969 1477595 1477600) (-921 "PDDOM.spad" 1475399 1475412 1475951 1475956) (-920 "PDDOM.spad" 1474835 1474850 1475389 1475394) (-919 "PCOMP.spad" 1474688 1474701 1474825 1474830) (-918 "PBWLB.spad" 1473276 1473293 1474678 1474683) (-917 "PATTERN.spad" 1467815 1467825 1473266 1473271) (-916 "PATTERN2.spad" 1467553 1467565 1467805 1467810) (-915 "PATTERN1.spad" 1465889 1465905 1467543 1467548) (-914 "PATRES.spad" 1463464 1463476 1465879 1465884) (-913 "PATRES2.spad" 1463136 1463150 1463454 1463459) (-912 "PATMATCH.spad" 1461333 1461364 1462844 1462849) (-911 "PATMAB.spad" 1460762 1460772 1461323 1461328) (-910 "PATLRES.spad" 1459848 1459862 1460752 1460757) (-909 "PATAB.spad" 1459612 1459622 1459838 1459843) (-908 "PARTPERM.spad" 1457620 1457628 1459602 1459607) (-907 "PARSURF.spad" 1457054 1457082 1457610 1457615) (-906 "PARSU2.spad" 1456851 1456867 1457044 1457049) (-905 "script-parser.spad" 1456371 1456379 1456841 1456846) (-904 "PARSCURV.spad" 1455805 1455833 1456361 1456366) (-903 "PARSC2.spad" 1455596 1455612 1455795 1455800) (-902 "PARPCURV.spad" 1455058 1455086 1455586 1455591) (-901 "PARPC2.spad" 1454849 1454865 1455048 1455053) (-900 "PARAMAST.spad" 1453977 1453985 1454839 1454844) (-899 "PAN2EXPR.spad" 1453389 1453397 1453967 1453972) (-898 "PALETTE.spad" 1452359 1452367 1453379 1453384) (-897 "PAIR.spad" 1451346 1451359 1451947 1451952) (-896 "PADICRC.spad" 1448587 1448605 1449758 1449851) (-895 "PADICRAT.spad" 1446495 1446507 1446716 1446809) (-894 "PADIC.spad" 1446190 1446202 1446421 1446490) (-893 "PADICCT.spad" 1444739 1444751 1446116 1446185) (-892 "PADEPAC.spad" 1443428 1443447 1444729 1444734) (-891 "PADE.spad" 1442180 1442196 1443418 1443423) (-890 "OWP.spad" 1441420 1441450 1442038 1442105) (-889 "OVERSET.spad" 1440993 1441001 1441410 1441415) (-888 "OVAR.spad" 1440774 1440797 1440983 1440988) (-887 "OUT.spad" 1439860 1439868 1440764 1440769) (-886 "OUTFORM.spad" 1429252 1429260 1439850 1439855) (-885 "OUTBFILE.spad" 1428670 1428678 1429242 1429247) (-884 "OUTBCON.spad" 1427676 1427684 1428660 1428665) (-883 "OUTBCON.spad" 1426680 1426690 1427666 1427671) (-882 "OSI.spad" 1426155 1426163 1426670 1426675) (-881 "OSGROUP.spad" 1426073 1426081 1426145 1426150) (-880 "ORTHPOL.spad" 1424558 1424568 1425990 1425995) (-879 "OREUP.spad" 1424011 1424039 1424238 1424277) (-878 "ORESUP.spad" 1423312 1423336 1423691 1423730) (-877 "OREPCTO.spad" 1421169 1421181 1423232 1423237) (-876 "OREPCAT.spad" 1415316 1415326 1421125 1421164) (-875 "OREPCAT.spad" 1409353 1409365 1415164 1415169) (-874 "ORDTYPE.spad" 1408590 1408598 1409343 1409348) (-873 "ORDTYPE.spad" 1407825 1407835 1408580 1408585) (-872 "ORDSTRCT.spad" 1407598 1407613 1407761 1407766) (-871 "ORDSET.spad" 1407298 1407306 1407588 1407593) (-870 "ORDRING.spad" 1406688 1406696 1407278 1407293) (-869 "ORDRING.spad" 1406086 1406096 1406678 1406683) (-868 "ORDMON.spad" 1405941 1405949 1406076 1406081) (-867 "ORDFUNS.spad" 1405073 1405089 1405931 1405936) (-866 "ORDFIN.spad" 1404893 1404901 1405063 1405068) (-865 "ORDCOMP.spad" 1403358 1403368 1404440 1404469) (-864 "ORDCOMP2.spad" 1402651 1402663 1403348 1403353) (-863 "OPTPROB.spad" 1401289 1401297 1402641 1402646) (-862 "OPTPACK.spad" 1393698 1393706 1401279 1401284) (-861 "OPTCAT.spad" 1391377 1391385 1393688 1393693) (-860 "OPSIG.spad" 1391031 1391039 1391367 1391372) (-859 "OPQUERY.spad" 1390580 1390588 1391021 1391026) (-858 "OP.spad" 1390322 1390332 1390402 1390469) (-857 "OPERCAT.spad" 1389788 1389798 1390312 1390317) (-856 "OPERCAT.spad" 1389252 1389264 1389778 1389783) (-855 "ONECOMP.spad" 1387997 1388007 1388799 1388828) (-854 "ONECOMP2.spad" 1387421 1387433 1387987 1387992) (-853 "OMSERVER.spad" 1386427 1386435 1387411 1387416) (-852 "OMSAGG.spad" 1386215 1386225 1386383 1386422) (-851 "OMPKG.spad" 1384831 1384839 1386205 1386210) (-850 "OM.spad" 1383804 1383812 1384821 1384826) (-849 "OMLO.spad" 1383229 1383241 1383690 1383729) (-848 "OMEXPR.spad" 1383063 1383073 1383219 1383224) (-847 "OMERR.spad" 1382608 1382616 1383053 1383058) (-846 "OMERRK.spad" 1381642 1381650 1382598 1382603) (-845 "OMENC.spad" 1380986 1380994 1381632 1381637) (-844 "OMDEV.spad" 1375295 1375303 1380976 1380981) (-843 "OMCONN.spad" 1374704 1374712 1375285 1375290) (-842 "OINTDOM.spad" 1374467 1374475 1374630 1374699) (-841 "OFMONOID.spad" 1372590 1372600 1374423 1374428) (-840 "ODVAR.spad" 1371851 1371861 1372580 1372585) (-839 "ODR.spad" 1371495 1371521 1371663 1371812) (-838 "ODPOL.spad" 1368784 1368794 1369124 1369251) (-837 "ODP.spad" 1356598 1356618 1356971 1357070) (-836 "ODETOOLS.spad" 1355247 1355266 1356588 1356593) (-835 "ODESYS.spad" 1352941 1352958 1355237 1355242) (-834 "ODERTRIC.spad" 1348950 1348967 1352898 1352903) (-833 "ODERED.spad" 1348349 1348373 1348940 1348945) (-832 "ODERAT.spad" 1345964 1345981 1348339 1348344) (-831 "ODEPRRIC.spad" 1343001 1343023 1345954 1345959) (-830 "ODEPROB.spad" 1342258 1342266 1342991 1342996) (-829 "ODEPRIM.spad" 1339592 1339614 1342248 1342253) (-828 "ODEPAL.spad" 1338978 1339002 1339582 1339587) (-827 "ODEPACK.spad" 1325644 1325652 1338968 1338973) (-826 "ODEINT.spad" 1325079 1325095 1325634 1325639) (-825 "ODEIFTBL.spad" 1322474 1322482 1325069 1325074) (-824 "ODEEF.spad" 1317965 1317981 1322464 1322469) (-823 "ODECONST.spad" 1317502 1317520 1317955 1317960) (-822 "ODECAT.spad" 1316100 1316108 1317492 1317497) (-821 "OCT.spad" 1314236 1314246 1314950 1314989) (-820 "OCTCT2.spad" 1313882 1313903 1314226 1314231) (-819 "OC.spad" 1311678 1311688 1313838 1313877) (-818 "OC.spad" 1309199 1309211 1311361 1311366) (-817 "OCAMON.spad" 1309047 1309055 1309189 1309194) (-816 "OASGP.spad" 1308862 1308870 1309037 1309042) (-815 "OAMONS.spad" 1308384 1308392 1308852 1308857) (-814 "OAMON.spad" 1308245 1308253 1308374 1308379) (-813 "OAGROUP.spad" 1308107 1308115 1308235 1308240) (-812 "NUMTUBE.spad" 1307698 1307714 1308097 1308102) (-811 "NUMQUAD.spad" 1295674 1295682 1307688 1307693) (-810 "NUMODE.spad" 1287028 1287036 1295664 1295669) (-809 "NUMINT.spad" 1284594 1284602 1287018 1287023) (-808 "NUMFMT.spad" 1283434 1283442 1284584 1284589) (-807 "NUMERIC.spad" 1275548 1275558 1283239 1283244) (-806 "NTSCAT.spad" 1274056 1274072 1275516 1275543) (-805 "NTPOLFN.spad" 1273607 1273617 1273973 1273978) (-804 "NSUP.spad" 1266560 1266570 1271100 1271253) (-803 "NSUP2.spad" 1265952 1265964 1266550 1266555) (-802 "NSMP.spad" 1262182 1262201 1262490 1262617) (-801 "NREP.spad" 1260560 1260574 1262172 1262177) (-800 "NPCOEF.spad" 1259806 1259826 1260550 1260555) (-799 "NORMRETR.spad" 1259404 1259443 1259796 1259801) (-798 "NORMPK.spad" 1257306 1257325 1259394 1259399) (-797 "NORMMA.spad" 1256994 1257020 1257296 1257301) (-796 "NONE.spad" 1256735 1256743 1256984 1256989) (-795 "NONE1.spad" 1256411 1256421 1256725 1256730) (-794 "NODE1.spad" 1255898 1255914 1256401 1256406) (-793 "NNI.spad" 1254793 1254801 1255872 1255893) (-792 "NLINSOL.spad" 1253419 1253429 1254783 1254788) (-791 "NIPROB.spad" 1251960 1251968 1253409 1253414) (-790 "NFINTBAS.spad" 1249520 1249537 1251950 1251955) (-789 "NETCLT.spad" 1249494 1249505 1249510 1249515) (-788 "NCODIV.spad" 1247710 1247726 1249484 1249489) (-787 "NCNTFRAC.spad" 1247352 1247366 1247700 1247705) (-786 "NCEP.spad" 1245518 1245532 1247342 1247347) (-785 "NASRING.spad" 1245114 1245122 1245508 1245513) (-784 "NASRING.spad" 1244708 1244718 1245104 1245109) (-783 "NARNG.spad" 1244060 1244068 1244698 1244703) (-782 "NARNG.spad" 1243410 1243420 1244050 1244055) (-781 "NAGSP.spad" 1242487 1242495 1243400 1243405) (-780 "NAGS.spad" 1232148 1232156 1242477 1242482) (-779 "NAGF07.spad" 1230579 1230587 1232138 1232143) (-778 "NAGF04.spad" 1224981 1224989 1230569 1230574) (-777 "NAGF02.spad" 1219050 1219058 1224971 1224976) (-776 "NAGF01.spad" 1214811 1214819 1219040 1219045) (-775 "NAGE04.spad" 1208511 1208519 1214801 1214806) (-774 "NAGE02.spad" 1199171 1199179 1208501 1208506) (-773 "NAGE01.spad" 1195173 1195181 1199161 1199166) (-772 "NAGD03.spad" 1193177 1193185 1195163 1195168) (-771 "NAGD02.spad" 1185924 1185932 1193167 1193172) (-770 "NAGD01.spad" 1180217 1180225 1185914 1185919) (-769 "NAGC06.spad" 1176092 1176100 1180207 1180212) (-768 "NAGC05.spad" 1174593 1174601 1176082 1176087) (-767 "NAGC02.spad" 1173860 1173868 1174583 1174588) (-766 "NAALG.spad" 1173401 1173411 1173828 1173855) (-765 "NAALG.spad" 1172962 1172974 1173391 1173396) (-764 "MULTSQFR.spad" 1169920 1169937 1172952 1172957) (-763 "MULTFACT.spad" 1169303 1169320 1169910 1169915) (-762 "MTSCAT.spad" 1167397 1167418 1169201 1169298) (-761 "MTHING.spad" 1167056 1167066 1167387 1167392) (-760 "MSYSCMD.spad" 1166490 1166498 1167046 1167051) (-759 "MSET.spad" 1164412 1164422 1166160 1166199) (-758 "MSETAGG.spad" 1164257 1164267 1164380 1164407) (-757 "MRING.spad" 1161234 1161246 1163965 1164032) (-756 "MRF2.spad" 1160804 1160818 1161224 1161229) (-755 "MRATFAC.spad" 1160350 1160367 1160794 1160799) (-754 "MPRFF.spad" 1158390 1158409 1160340 1160345) (-753 "MPOLY.spad" 1155861 1155876 1156220 1156347) (-752 "MPCPF.spad" 1155125 1155144 1155851 1155856) (-751 "MPC3.spad" 1154942 1154982 1155115 1155120) (-750 "MPC2.spad" 1154587 1154620 1154932 1154937) (-749 "MONOTOOL.spad" 1152938 1152955 1154577 1154582) (-748 "MONOID.spad" 1152257 1152265 1152928 1152933) (-747 "MONOID.spad" 1151574 1151584 1152247 1152252) (-746 "MONOGEN.spad" 1150322 1150335 1151434 1151569) (-745 "MONOGEN.spad" 1149092 1149107 1150206 1150211) (-744 "MONADWU.spad" 1147122 1147130 1149082 1149087) (-743 "MONADWU.spad" 1145150 1145160 1147112 1147117) (-742 "MONAD.spad" 1144310 1144318 1145140 1145145) (-741 "MONAD.spad" 1143468 1143478 1144300 1144305) (-740 "MOEBIUS.spad" 1142204 1142218 1143448 1143463) (-739 "MODULE.spad" 1142074 1142084 1142172 1142199) (-738 "MODULE.spad" 1141964 1141976 1142064 1142069) (-737 "MODRING.spad" 1141299 1141338 1141944 1141959) (-736 "MODOP.spad" 1139964 1139976 1141121 1141188) (-735 "MODMONOM.spad" 1139695 1139713 1139954 1139959) (-734 "MODMON.spad" 1136397 1136413 1137116 1137269) (-733 "MODFIELD.spad" 1135759 1135798 1136299 1136392) (-732 "MMLFORM.spad" 1134619 1134627 1135749 1135754) (-731 "MMAP.spad" 1134361 1134395 1134609 1134614) (-730 "MLO.spad" 1132820 1132830 1134317 1134356) (-729 "MLIFT.spad" 1131432 1131449 1132810 1132815) (-728 "MKUCFUNC.spad" 1130967 1130985 1131422 1131427) (-727 "MKRECORD.spad" 1130571 1130584 1130957 1130962) (-726 "MKFUNC.spad" 1129978 1129988 1130561 1130566) (-725 "MKFLCFN.spad" 1128946 1128956 1129968 1129973) (-724 "MKBCFUNC.spad" 1128441 1128459 1128936 1128941) (-723 "MINT.spad" 1127880 1127888 1128343 1128436) (-722 "MHROWRED.spad" 1126391 1126401 1127870 1127875) (-721 "MFLOAT.spad" 1124911 1124919 1126281 1126386) (-720 "MFINFACT.spad" 1124311 1124333 1124901 1124906) (-719 "MESH.spad" 1122093 1122101 1124301 1124306) (-718 "MDDFACT.spad" 1120304 1120314 1122083 1122088) (-717 "MDAGG.spad" 1119595 1119605 1120284 1120299) (-716 "MCMPLX.spad" 1115026 1115034 1115640 1115841) (-715 "MCDEN.spad" 1114236 1114248 1115016 1115021) (-714 "MCALCFN.spad" 1111358 1111384 1114226 1114231) (-713 "MAYBE.spad" 1110642 1110653 1111348 1111353) (-712 "MATSTOR.spad" 1107950 1107960 1110632 1110637) (-711 "MATRIX.spad" 1106537 1106547 1107021 1107048) (-710 "MATLIN.spad" 1103881 1103905 1106421 1106426) (-709 "MATCAT.spad" 1095403 1095425 1103849 1103876) (-708 "MATCAT.spad" 1086797 1086821 1095245 1095250) (-707 "MATCAT2.spad" 1086079 1086127 1086787 1086792) (-706 "MAPPKG3.spad" 1084994 1085008 1086069 1086074) (-705 "MAPPKG2.spad" 1084332 1084344 1084984 1084989) (-704 "MAPPKG1.spad" 1083160 1083170 1084322 1084327) (-703 "MAPPAST.spad" 1082475 1082483 1083150 1083155) (-702 "MAPHACK3.spad" 1082287 1082301 1082465 1082470) (-701 "MAPHACK2.spad" 1082056 1082068 1082277 1082282) (-700 "MAPHACK1.spad" 1081700 1081710 1082046 1082051) (-699 "MAGMA.spad" 1079490 1079507 1081690 1081695) (-698 "MACROAST.spad" 1079069 1079077 1079480 1079485) (-697 "M3D.spad" 1076672 1076682 1078330 1078335) (-696 "LZSTAGG.spad" 1073910 1073920 1076662 1076667) (-695 "LZSTAGG.spad" 1071146 1071158 1073900 1073905) (-694 "LWORD.spad" 1067851 1067868 1071136 1071141) (-693 "LSTAST.spad" 1067635 1067643 1067841 1067846) (-692 "LSQM.spad" 1065792 1065806 1066186 1066237) (-691 "LSPP.spad" 1065327 1065344 1065782 1065787) (-690 "LSMP.spad" 1064177 1064205 1065317 1065322) (-689 "LSMP1.spad" 1061995 1062009 1064167 1064172) (-688 "LSAGG.spad" 1061664 1061674 1061963 1061990) (-687 "LSAGG.spad" 1061353 1061365 1061654 1061659) (-686 "LPOLY.spad" 1060307 1060326 1061209 1061278) (-685 "LPEFRAC.spad" 1059578 1059588 1060297 1060302) (-684 "LO.spad" 1058979 1058993 1059512 1059539) (-683 "LOGIC.spad" 1058581 1058589 1058969 1058974) (-682 "LOGIC.spad" 1058181 1058191 1058571 1058576) (-681 "LODOOPS.spad" 1057111 1057123 1058171 1058176) (-680 "LODO.spad" 1056495 1056511 1056791 1056830) (-679 "LODOF.spad" 1055541 1055558 1056452 1056457) (-678 "LODOCAT.spad" 1054207 1054217 1055497 1055536) (-677 "LODOCAT.spad" 1052871 1052883 1054163 1054168) (-676 "LODO2.spad" 1052144 1052156 1052551 1052590) (-675 "LODO1.spad" 1051544 1051554 1051824 1051863) (-674 "LODEEF.spad" 1050346 1050364 1051534 1051539) (-673 "LNAGG.spad" 1046493 1046503 1050336 1050341) (-672 "LNAGG.spad" 1042604 1042616 1046449 1046454) (-671 "LMOPS.spad" 1039372 1039389 1042594 1042599) (-670 "LMODULE.spad" 1039140 1039150 1039362 1039367) (-669 "LMDICT.spad" 1038310 1038320 1038574 1038601) (-668 "LLINSET.spad" 1038017 1038027 1038300 1038305) (-667 "LITERAL.spad" 1037923 1037934 1038007 1038012) (-666 "LIST.spad" 1035505 1035515 1036917 1036944) (-665 "LIST3.spad" 1034816 1034830 1035495 1035500) (-664 "LIST2.spad" 1033518 1033530 1034806 1034811) (-663 "LIST2MAP.spad" 1030421 1030433 1033508 1033513) (-662 "LINSET.spad" 1030200 1030210 1030411 1030416) (-661 "LINFORM.spad" 1029663 1029675 1030168 1030195) (-660 "LINEXP.spad" 1028406 1028416 1029653 1029658) (-659 "LINELT.spad" 1027777 1027789 1028289 1028316) (-658 "LINDEP.spad" 1026586 1026598 1027689 1027694) (-657 "LINBASIS.spad" 1026222 1026237 1026576 1026581) (-656 "LIMITRF.spad" 1024150 1024160 1026212 1026217) (-655 "LIMITPS.spad" 1023053 1023066 1024140 1024145) (-654 "LIE.spad" 1021069 1021081 1022343 1022488) (-653 "LIECAT.spad" 1020545 1020555 1020995 1021064) (-652 "LIECAT.spad" 1020049 1020061 1020501 1020506) (-651 "LIB.spad" 1017800 1017808 1018246 1018261) (-650 "LGROBP.spad" 1015153 1015172 1017790 1017795) (-649 "LF.spad" 1014108 1014124 1015143 1015148) (-648 "LFCAT.spad" 1013167 1013175 1014098 1014103) (-647 "LEXTRIPK.spad" 1008670 1008685 1013157 1013162) (-646 "LEXP.spad" 1006673 1006700 1008650 1008665) (-645 "LETAST.spad" 1006372 1006380 1006663 1006668) (-644 "LEADCDET.spad" 1004770 1004787 1006362 1006367) (-643 "LAZM3PK.spad" 1003474 1003496 1004760 1004765) (-642 "LAUPOL.spad" 1002074 1002087 1002974 1003043) (-641 "LAPLACE.spad" 1001657 1001673 1002064 1002069) (-640 "LA.spad" 1001097 1001111 1001579 1001618) (-639 "LALG.spad" 1000873 1000883 1001077 1001092) (-638 "LALG.spad" 1000657 1000669 1000863 1000868) (-637 "KVTFROM.spad" 1000392 1000402 1000647 1000652) (-636 "KTVLOGIC.spad" 999904 999912 1000382 1000387) (-635 "KRCFROM.spad" 999642 999652 999894 999899) (-634 "KOVACIC.spad" 998365 998382 999632 999637) (-633 "KONVERT.spad" 998087 998097 998355 998360) (-632 "KOERCE.spad" 997824 997834 998077 998082) (-631 "KERNEL.spad" 996479 996489 997608 997613) (-630 "KERNEL2.spad" 996182 996194 996469 996474) (-629 "KDAGG.spad" 995291 995313 996162 996177) (-628 "KDAGG.spad" 994408 994432 995281 995286) (-627 "KAFILE.spad" 993262 993278 993497 993524) (-626 "JVMOP.spad" 993167 993175 993252 993257) (-625 "JVMMDACC.spad" 992205 992213 993157 993162) (-624 "JVMFDACC.spad" 991513 991521 992195 992200) (-623 "JVMCSTTG.spad" 990242 990250 991503 991508) (-622 "JVMCFACC.spad" 989672 989680 990232 990237) (-621 "JVMBCODE.spad" 989575 989583 989662 989667) (-620 "JORDAN.spad" 987404 987416 988865 989010) (-619 "JOINAST.spad" 987098 987106 987394 987399) (-618 "IXAGG.spad" 985231 985255 987088 987093) (-617 "IXAGG.spad" 983219 983245 985078 985083) (-616 "IVECTOR.spad" 981836 981851 981991 982018) (-615 "ITUPLE.spad" 980997 981007 981826 981831) (-614 "ITRIGMNP.spad" 979836 979855 980987 980992) (-613 "ITFUN3.spad" 979342 979356 979826 979831) (-612 "ITFUN2.spad" 979086 979098 979332 979337) (-611 "ITFORM.spad" 978441 978449 979076 979081) (-610 "ITAYLOR.spad" 976435 976450 978305 978402) (-609 "ISUPS.spad" 968872 968887 975409 975506) (-608 "ISUMP.spad" 968373 968389 968862 968867) (-607 "ISTRING.spad" 967300 967313 967381 967408) (-606 "ISAST.spad" 967019 967027 967290 967295) (-605 "IRURPK.spad" 965736 965755 967009 967014) (-604 "IRSN.spad" 963708 963716 965726 965731) (-603 "IRRF2F.spad" 962193 962203 963664 963669) (-602 "IRREDFFX.spad" 961794 961805 962183 962188) (-601 "IROOT.spad" 960133 960143 961784 961789) (-600 "IR.spad" 957934 957948 959988 960015) (-599 "IRFORM.spad" 957258 957266 957924 957929) (-598 "IR2.spad" 956286 956302 957248 957253) (-597 "IR2F.spad" 955492 955508 956276 956281) (-596 "IPRNTPK.spad" 955252 955260 955482 955487) (-595 "IPF.spad" 954817 954829 955057 955150) (-594 "IPADIC.spad" 954578 954604 954743 954812) (-593 "IP4ADDR.spad" 954135 954143 954568 954573) (-592 "IOMODE.spad" 953657 953665 954125 954130) (-591 "IOBFILE.spad" 953018 953026 953647 953652) (-590 "IOBCON.spad" 952883 952891 953008 953013) (-589 "INVLAPLA.spad" 952532 952548 952873 952878) (-588 "INTTR.spad" 945914 945931 952522 952527) (-587 "INTTOOLS.spad" 943669 943685 945488 945493) (-586 "INTSLPE.spad" 942989 942997 943659 943664) (-585 "INTRVL.spad" 942555 942565 942903 942984) (-584 "INTRF.spad" 940979 940993 942545 942550) (-583 "INTRET.spad" 940411 940421 940969 940974) (-582 "INTRAT.spad" 939138 939155 940401 940406) (-581 "INTPM.spad" 937523 937539 938781 938786) (-580 "INTPAF.spad" 935387 935405 937455 937460) (-579 "INTPACK.spad" 925761 925769 935377 935382) (-578 "INT.spad" 925209 925217 925615 925756) (-577 "INTHERTR.spad" 924483 924500 925199 925204) (-576 "INTHERAL.spad" 924153 924177 924473 924478) (-575 "INTHEORY.spad" 920592 920600 924143 924148) (-574 "INTG0.spad" 914325 914343 920524 920529) (-573 "INTFTBL.spad" 908354 908362 914315 914320) (-572 "INTFACT.spad" 907413 907423 908344 908349) (-571 "INTEF.spad" 905798 905814 907403 907408) (-570 "INTDOM.spad" 904421 904429 905724 905793) (-569 "INTDOM.spad" 903106 903116 904411 904416) (-568 "INTCAT.spad" 901365 901375 903020 903101) (-567 "INTBIT.spad" 900872 900880 901355 901360) (-566 "INTALG.spad" 900060 900087 900862 900867) (-565 "INTAF.spad" 899560 899576 900050 900055) (-564 "INTABL.spad" 897636 897667 897799 897826) (-563 "INT8.spad" 897516 897524 897626 897631) (-562 "INT64.spad" 897395 897403 897506 897511) (-561 "INT32.spad" 897274 897282 897385 897390) (-560 "INT16.spad" 897153 897161 897264 897269) (-559 "INS.spad" 894656 894664 897055 897148) (-558 "INS.spad" 892245 892255 894646 894651) (-557 "INPSIGN.spad" 891693 891706 892235 892240) (-556 "INPRODPF.spad" 890789 890808 891683 891688) (-555 "INPRODFF.spad" 889877 889901 890779 890784) (-554 "INNMFACT.spad" 888852 888869 889867 889872) (-553 "INMODGCD.spad" 888340 888370 888842 888847) (-552 "INFSP.spad" 886637 886659 888330 888335) (-551 "INFPROD0.spad" 885717 885736 886627 886632) (-550 "INFORM.spad" 882916 882924 885707 885712) (-549 "INFORM1.spad" 882541 882551 882906 882911) (-548 "INFINITY.spad" 882093 882101 882531 882536) (-547 "INETCLTS.spad" 882070 882078 882083 882088) (-546 "INEP.spad" 880608 880630 882060 882065) (-545 "INDE.spad" 880257 880274 880518 880523) (-544 "INCRMAPS.spad" 879678 879688 880247 880252) (-543 "INBFILE.spad" 878750 878758 879668 879673) (-542 "INBFF.spad" 874544 874555 878740 878745) (-541 "INBCON.spad" 872834 872842 874534 874539) (-540 "INBCON.spad" 871122 871132 872824 872829) (-539 "INAST.spad" 870783 870791 871112 871117) (-538 "IMPTAST.spad" 870491 870499 870773 870778) (-537 "IMATRIX.spad" 869319 869345 869831 869858) (-536 "IMATQF.spad" 868413 868457 869275 869280) (-535 "IMATLIN.spad" 867018 867042 868369 868374) (-534 "ILIST.spad" 865523 865538 866048 866075) (-533 "IIARRAY2.spad" 864794 864832 865013 865040) (-532 "IFF.spad" 864204 864220 864475 864568) (-531 "IFAST.spad" 863818 863826 864194 864199) (-530 "IFARRAY.spad" 861158 861173 862848 862875) (-529 "IFAMON.spad" 861020 861037 861114 861119) (-528 "IEVALAB.spad" 860425 860437 861010 861015) (-527 "IEVALAB.spad" 859828 859842 860415 860420) (-526 "IDPO.spad" 859563 859575 859740 859745) (-525 "IDPOAMS.spad" 859241 859253 859475 859480) (-524 "IDPOAM.spad" 858883 858895 859153 859158) (-523 "IDPC.spad" 857612 857624 858873 858878) (-522 "IDPAM.spad" 857279 857291 857524 857529) (-521 "IDPAG.spad" 856948 856960 857191 857196) (-520 "IDENT.spad" 856598 856606 856938 856943) (-519 "IDECOMP.spad" 853837 853855 856588 856593) (-518 "IDEAL.spad" 848786 848825 853772 853777) (-517 "ICDEN.spad" 847975 847991 848776 848781) (-516 "ICARD.spad" 847166 847174 847965 847970) (-515 "IBPTOOLS.spad" 845773 845790 847156 847161) (-514 "IBITS.spad" 844938 844951 845371 845398) (-513 "IBATOOL.spad" 841915 841934 844928 844933) (-512 "IBACHIN.spad" 840422 840437 841905 841910) (-511 "IARRAY2.spad" 839293 839319 839912 839939) (-510 "IARRAY1.spad" 838185 838200 838323 838350) (-509 "IAN.spad" 836408 836416 838001 838094) (-508 "IALGFACT.spad" 836011 836044 836398 836403) (-507 "HYPCAT.spad" 835435 835443 836001 836006) (-506 "HYPCAT.spad" 834857 834867 835425 835430) (-505 "HOSTNAME.spad" 834665 834673 834847 834852) (-504 "HOMOTOP.spad" 834408 834418 834655 834660) (-503 "HOAGG.spad" 831690 831700 834398 834403) (-502 "HOAGG.spad" 828711 828723 831421 831426) (-501 "HEXADEC.spad" 826716 826724 827081 827174) (-500 "HEUGCD.spad" 825751 825762 826706 826711) (-499 "HELLFDIV.spad" 825341 825365 825741 825746) (-498 "HEAP.spad" 824616 824626 824831 824858) (-497 "HEADAST.spad" 824149 824157 824606 824611) (-496 "HDP.spad" 811959 811975 812336 812435) (-495 "HDMP.spad" 809173 809188 809789 809916) (-494 "HB.spad" 807424 807432 809163 809168) (-493 "HASHTBL.spad" 805452 805483 805663 805690) (-492 "HASAST.spad" 805168 805176 805442 805447) (-491 "HACKPI.spad" 804659 804667 805070 805163) (-490 "GTSET.spad" 803562 803578 804269 804296) (-489 "GSTBL.spad" 801639 801674 801813 801828) (-488 "GSERIES.spad" 798952 798979 799771 799920) (-487 "GROUP.spad" 798225 798233 798932 798947) (-486 "GROUP.spad" 797506 797516 798215 798220) (-485 "GROEBSOL.spad" 796000 796021 797496 797501) (-484 "GRMOD.spad" 794571 794583 795990 795995) (-483 "GRMOD.spad" 793140 793154 794561 794566) (-482 "GRIMAGE.spad" 786029 786037 793130 793135) (-481 "GRDEF.spad" 784408 784416 786019 786024) (-480 "GRAY.spad" 782871 782879 784398 784403) (-479 "GRALG.spad" 781948 781960 782861 782866) (-478 "GRALG.spad" 781023 781037 781938 781943) (-477 "GPOLSET.spad" 780441 780464 780669 780696) (-476 "GOSPER.spad" 779710 779728 780431 780436) (-475 "GMODPOL.spad" 778858 778885 779678 779705) (-474 "GHENSEL.spad" 777941 777955 778848 778853) (-473 "GENUPS.spad" 774234 774247 777931 777936) (-472 "GENUFACT.spad" 773811 773821 774224 774229) (-471 "GENPGCD.spad" 773397 773414 773801 773806) (-470 "GENMFACT.spad" 772849 772868 773387 773392) (-469 "GENEEZ.spad" 770800 770813 772839 772844) (-468 "GDMP.spad" 767856 767873 768630 768757) (-467 "GCNAALG.spad" 761779 761806 767650 767717) (-466 "GCDDOM.spad" 760955 760963 761705 761774) (-465 "GCDDOM.spad" 760193 760203 760945 760950) (-464 "GB.spad" 757719 757757 760149 760154) (-463 "GBINTERN.spad" 753739 753777 757709 757714) (-462 "GBF.spad" 749506 749544 753729 753734) (-461 "GBEUCLID.spad" 747388 747426 749496 749501) (-460 "GAUSSFAC.spad" 746701 746709 747378 747383) (-459 "GALUTIL.spad" 745027 745037 746657 746662) (-458 "GALPOLYU.spad" 743481 743494 745017 745022) (-457 "GALFACTU.spad" 741654 741673 743471 743476) (-456 "GALFACT.spad" 731843 731854 741644 741649) (-455 "FVFUN.spad" 728866 728874 731833 731838) (-454 "FVC.spad" 727918 727926 728856 728861) (-453 "FUNDESC.spad" 727596 727604 727908 727913) (-452 "FUNCTION.spad" 727445 727457 727586 727591) (-451 "FT.spad" 725742 725750 727435 727440) (-450 "FTEM.spad" 724907 724915 725732 725737) (-449 "FSUPFACT.spad" 723807 723826 724843 724848) (-448 "FST.spad" 721893 721901 723797 723802) (-447 "FSRED.spad" 721373 721389 721883 721888) (-446 "FSPRMELT.spad" 720255 720271 721330 721335) (-445 "FSPECF.spad" 718346 718362 720245 720250) (-444 "FS.spad" 712614 712624 718121 718341) (-443 "FS.spad" 706660 706672 712169 712174) (-442 "FSINT.spad" 706320 706336 706650 706655) (-441 "FSERIES.spad" 705511 705523 706140 706239) (-440 "FSCINT.spad" 704828 704844 705501 705506) (-439 "FSAGG.spad" 703945 703955 704784 704823) (-438 "FSAGG.spad" 703024 703036 703865 703870) (-437 "FSAGG2.spad" 701767 701783 703014 703019) (-436 "FS2UPS.spad" 696258 696292 701757 701762) (-435 "FS2.spad" 695905 695921 696248 696253) (-434 "FS2EXPXP.spad" 695030 695053 695895 695900) (-433 "FRUTIL.spad" 693984 693994 695020 695025) (-432 "FR.spad" 687607 687617 692915 692984) (-431 "FRNAALG.spad" 682876 682886 687549 687602) (-430 "FRNAALG.spad" 678157 678169 682832 682837) (-429 "FRNAAF2.spad" 677613 677631 678147 678152) (-428 "FRMOD.spad" 677023 677053 677544 677549) (-427 "FRIDEAL.spad" 676248 676269 677003 677018) (-426 "FRIDEAL2.spad" 675852 675884 676238 676243) (-425 "FRETRCT.spad" 675363 675373 675842 675847) (-424 "FRETRCT.spad" 674740 674752 675221 675226) (-423 "FRAMALG.spad" 673088 673101 674696 674735) (-422 "FRAMALG.spad" 671468 671483 673078 673083) (-421 "FRAC.spad" 668474 668484 668877 669050) (-420 "FRAC2.spad" 668079 668091 668464 668469) (-419 "FR2.spad" 667415 667427 668069 668074) (-418 "FPS.spad" 664230 664238 667305 667410) (-417 "FPS.spad" 661073 661083 664150 664155) (-416 "FPC.spad" 660119 660127 660975 661068) (-415 "FPC.spad" 659251 659261 660109 660114) (-414 "FPATMAB.spad" 659013 659023 659241 659246) (-413 "FPARFRAC.spad" 657863 657880 659003 659008) (-412 "FORTRAN.spad" 656369 656412 657853 657858) (-411 "FORT.spad" 655318 655326 656359 656364) (-410 "FORTFN.spad" 652488 652496 655308 655313) (-409 "FORTCAT.spad" 652172 652180 652478 652483) (-408 "FORMULA.spad" 649646 649654 652162 652167) (-407 "FORMULA1.spad" 649125 649135 649636 649641) (-406 "FORDER.spad" 648816 648840 649115 649120) (-405 "FOP.spad" 648017 648025 648806 648811) (-404 "FNLA.spad" 647441 647463 647985 648012) (-403 "FNCAT.spad" 646036 646044 647431 647436) (-402 "FNAME.spad" 645928 645936 646026 646031) (-401 "FMTC.spad" 645726 645734 645854 645923) (-400 "FMONOID.spad" 645391 645401 645682 645687) (-399 "FMONCAT.spad" 642544 642554 645381 645386) (-398 "FM.spad" 642159 642171 642398 642425) (-397 "FMFUN.spad" 639189 639197 642149 642154) (-396 "FMC.spad" 638241 638249 639179 639184) (-395 "FMCAT.spad" 635909 635927 638209 638236) (-394 "FM1.spad" 635266 635278 635843 635870) (-393 "FLOATRP.spad" 633001 633015 635256 635261) (-392 "FLOAT.spad" 626315 626323 632867 632996) (-391 "FLOATCP.spad" 623746 623760 626305 626310) (-390 "FLINEXP.spad" 623468 623478 623736 623741) (-389 "FLINEXP.spad" 623134 623146 623404 623409) (-388 "FLASORT.spad" 622460 622472 623124 623129) (-387 "FLALG.spad" 620106 620125 622386 622455) (-386 "FLAGG.spad" 617148 617158 620086 620101) (-385 "FLAGG.spad" 614091 614103 617031 617036) (-384 "FLAGG2.spad" 612816 612832 614081 614086) (-383 "FINRALG.spad" 610877 610890 612772 612811) (-382 "FINRALG.spad" 608864 608879 610761 610766) (-381 "FINITE.spad" 608016 608024 608854 608859) (-380 "FINAALG.spad" 597137 597147 607958 608011) (-379 "FINAALG.spad" 586270 586282 597093 597098) (-378 "FILE.spad" 585853 585863 586260 586265) (-377 "FILECAT.spad" 584379 584396 585843 585848) (-376 "FIELD.spad" 583785 583793 584281 584374) (-375 "FIELD.spad" 583277 583287 583775 583780) (-374 "FGROUP.spad" 581924 581934 583257 583272) (-373 "FGLMICPK.spad" 580711 580726 581914 581919) (-372 "FFX.spad" 580086 580101 580427 580520) (-371 "FFSLPE.spad" 579589 579610 580076 580081) (-370 "FFPOLY.spad" 570851 570862 579579 579584) (-369 "FFPOLY2.spad" 569911 569928 570841 570846) (-368 "FFP.spad" 569308 569328 569627 569720) (-367 "FF.spad" 568756 568772 568989 569082) (-366 "FFNBX.spad" 567268 567288 568472 568565) (-365 "FFNBP.spad" 565781 565798 566984 567077) (-364 "FFNB.spad" 564246 564267 565462 565555) (-363 "FFINTBAS.spad" 561760 561779 564236 564241) (-362 "FFIELDC.spad" 559337 559345 561662 561755) (-361 "FFIELDC.spad" 557000 557010 559327 559332) (-360 "FFHOM.spad" 555748 555765 556990 556995) (-359 "FFF.spad" 553183 553194 555738 555743) (-358 "FFCGX.spad" 552030 552050 552899 552992) (-357 "FFCGP.spad" 550919 550939 551746 551839) (-356 "FFCG.spad" 549711 549732 550600 550693) (-355 "FFCAT.spad" 542884 542906 549550 549706) (-354 "FFCAT.spad" 536136 536160 542804 542809) (-353 "FFCAT2.spad" 535883 535923 536126 536131) (-352 "FEXPR.spad" 527600 527646 535639 535678) (-351 "FEVALAB.spad" 527308 527318 527590 527595) (-350 "FEVALAB.spad" 526801 526813 527085 527090) (-349 "FDIV.spad" 526243 526267 526791 526796) (-348 "FDIVCAT.spad" 524307 524331 526233 526238) (-347 "FDIVCAT.spad" 522369 522395 524297 524302) (-346 "FDIV2.spad" 522025 522065 522359 522364) (-345 "FCTRDATA.spad" 521033 521041 522015 522020) (-344 "FCPAK1.spad" 519600 519608 521023 521028) (-343 "FCOMP.spad" 518979 518989 519590 519595) (-342 "FC.spad" 508986 508994 518969 518974) (-341 "FAXF.spad" 501957 501971 508888 508981) (-340 "FAXF.spad" 494980 494996 501913 501918) (-339 "FARRAY.spad" 492977 492987 494010 494037) (-338 "FAMR.spad" 491113 491125 492875 492972) (-337 "FAMR.spad" 489233 489247 490997 491002) (-336 "FAMONOID.spad" 488901 488911 489187 489192) (-335 "FAMONC.spad" 487197 487209 488891 488896) (-334 "FAGROUP.spad" 486821 486831 487093 487120) (-333 "FACUTIL.spad" 485025 485042 486811 486816) (-332 "FACTFUNC.spad" 484219 484229 485015 485020) (-331 "EXPUPXS.spad" 481052 481075 482351 482500) (-330 "EXPRTUBE.spad" 478340 478348 481042 481047) (-329 "EXPRODE.spad" 475500 475516 478330 478335) (-328 "EXPR.spad" 470675 470685 471389 471684) (-327 "EXPR2UPS.spad" 466797 466810 470665 470670) (-326 "EXPR2.spad" 466502 466514 466787 466792) (-325 "EXPEXPAN.spad" 463303 463328 463935 464028) (-324 "EXIT.spad" 462974 462982 463293 463298) (-323 "EXITAST.spad" 462710 462718 462964 462969) (-322 "EVALCYC.spad" 462170 462184 462700 462705) (-321 "EVALAB.spad" 461742 461752 462160 462165) (-320 "EVALAB.spad" 461312 461324 461732 461737) (-319 "EUCDOM.spad" 458886 458894 461238 461307) (-318 "EUCDOM.spad" 456522 456532 458876 458881) (-317 "ESTOOLS.spad" 448368 448376 456512 456517) (-316 "ESTOOLS2.spad" 447971 447985 448358 448363) (-315 "ESTOOLS1.spad" 447656 447667 447961 447966) (-314 "ES.spad" 440471 440479 447646 447651) (-313 "ES.spad" 433192 433202 440369 440374) (-312 "ESCONT.spad" 429985 429993 433182 433187) (-311 "ESCONT1.spad" 429734 429746 429975 429980) (-310 "ES2.spad" 429239 429255 429724 429729) (-309 "ES1.spad" 428809 428825 429229 429234) (-308 "ERROR.spad" 426136 426144 428799 428804) (-307 "EQTBL.spad" 424166 424188 424375 424402) (-306 "EQ.spad" 418971 418981 421758 421870) (-305 "EQ2.spad" 418689 418701 418961 418966) (-304 "EP.spad" 415015 415025 418679 418684) (-303 "ENV.spad" 413693 413701 415005 415010) (-302 "ENTIRER.spad" 413361 413369 413637 413688) (-301 "EMR.spad" 412649 412690 413287 413356) (-300 "ELTAGG.spad" 410903 410922 412639 412644) (-299 "ELTAGG.spad" 409121 409142 410859 410864) (-298 "ELTAB.spad" 408596 408609 409111 409116) (-297 "ELFUTS.spad" 407983 408002 408586 408591) (-296 "ELEMFUN.spad" 407672 407680 407973 407978) (-295 "ELEMFUN.spad" 407359 407369 407662 407667) (-294 "ELAGG.spad" 405330 405340 407339 407354) (-293 "ELAGG.spad" 403238 403250 405249 405254) (-292 "ELABOR.spad" 402584 402592 403228 403233) (-291 "ELABEXPR.spad" 401516 401524 402574 402579) (-290 "EFUPXS.spad" 398292 398322 401472 401477) (-289 "EFULS.spad" 395128 395151 398248 398253) (-288 "EFSTRUC.spad" 393143 393159 395118 395123) (-287 "EF.spad" 387919 387935 393133 393138) (-286 "EAB.spad" 386195 386203 387909 387914) (-285 "E04UCFA.spad" 385731 385739 386185 386190) (-284 "E04NAFA.spad" 385308 385316 385721 385726) (-283 "E04MBFA.spad" 384888 384896 385298 385303) (-282 "E04JAFA.spad" 384424 384432 384878 384883) (-281 "E04GCFA.spad" 383960 383968 384414 384419) (-280 "E04FDFA.spad" 383496 383504 383950 383955) (-279 "E04DGFA.spad" 383032 383040 383486 383491) (-278 "E04AGNT.spad" 378882 378890 383022 383027) (-277 "DVARCAT.spad" 375772 375782 378872 378877) (-276 "DVARCAT.spad" 372660 372672 375762 375767) (-275 "DSMP.spad" 370034 370048 370339 370466) (-274 "DSEXT.spad" 369336 369346 370024 370029) (-273 "DSEXT.spad" 368545 368557 369235 369240) (-272 "DROPT.spad" 362504 362512 368535 368540) (-271 "DROPT1.spad" 362169 362179 362494 362499) (-270 "DROPT0.spad" 357026 357034 362159 362164) (-269 "DRAWPT.spad" 355199 355207 357016 357021) (-268 "DRAW.spad" 348075 348088 355189 355194) (-267 "DRAWHACK.spad" 347383 347393 348065 348070) (-266 "DRAWCX.spad" 344853 344861 347373 347378) (-265 "DRAWCURV.spad" 344400 344415 344843 344848) (-264 "DRAWCFUN.spad" 333932 333940 344390 344395) (-263 "DQAGG.spad" 332110 332120 333900 333927) (-262 "DPOLCAT.spad" 327459 327475 331978 332105) (-261 "DPOLCAT.spad" 322894 322912 327415 327420) (-260 "DPMO.spad" 314654 314670 314792 315005) (-259 "DPMM.spad" 306427 306445 306552 306765) (-258 "DOMTMPLT.spad" 306198 306206 306417 306422) (-257 "DOMCTOR.spad" 305953 305961 306188 306193) (-256 "DOMAIN.spad" 305040 305048 305943 305948) (-255 "DMP.spad" 302300 302315 302870 302997) (-254 "DMEXT.spad" 302167 302177 302268 302295) (-253 "DLP.spad" 301519 301529 302157 302162) (-252 "DLIST.spad" 299945 299955 300549 300576) (-251 "DLAGG.spad" 298362 298372 299935 299940) (-250 "DIVRING.spad" 297904 297912 298306 298357) (-249 "DIVRING.spad" 297490 297500 297894 297899) (-248 "DISPLAY.spad" 295680 295688 297480 297485) (-247 "DIRPROD.spad" 283227 283243 283867 283966) (-246 "DIRPROD2.spad" 282045 282063 283217 283222) (-245 "DIRPCAT.spad" 281238 281254 281941 282040) (-244 "DIRPCAT.spad" 280058 280076 280763 280768) (-243 "DIOSP.spad" 278883 278891 280048 280053) (-242 "DIOPS.spad" 277879 277889 278863 278878) (-241 "DIOPS.spad" 276849 276861 277835 277840) (-240 "DIFRING.spad" 276687 276695 276829 276844) (-239 "DIFFSPC.spad" 276266 276274 276677 276682) (-238 "DIFFSPC.spad" 275843 275853 276256 276261) (-237 "DIFFMOD.spad" 275332 275342 275811 275838) (-236 "DIFFDOM.spad" 274497 274508 275322 275327) (-235 "DIFFDOM.spad" 273660 273673 274487 274492) (-234 "DIFEXT.spad" 273479 273489 273640 273655) (-233 "DIAGG.spad" 273109 273119 273459 273474) (-232 "DIAGG.spad" 272747 272759 273099 273104) (-231 "DHMATRIX.spad" 270942 270952 272087 272114) (-230 "DFSFUN.spad" 264582 264590 270932 270937) (-229 "DFLOAT.spad" 261313 261321 264472 264577) (-228 "DFINTTLS.spad" 259544 259560 261303 261308) (-227 "DERHAM.spad" 257458 257490 259524 259539) (-226 "DEQUEUE.spad" 256665 256675 256948 256975) (-225 "DEGRED.spad" 256282 256296 256655 256660) (-224 "DEFINTRF.spad" 253819 253829 256272 256277) (-223 "DEFINTEF.spad" 252329 252345 253809 253814) (-222 "DEFAST.spad" 251697 251705 252319 252324) (-221 "DECIMAL.spad" 249706 249714 250067 250160) (-220 "DDFACT.spad" 247519 247536 249696 249701) (-219 "DBLRESP.spad" 247119 247143 247509 247514) (-218 "DBASIS.spad" 246745 246760 247109 247114) (-217 "DBASE.spad" 245409 245419 246735 246740) (-216 "DATAARY.spad" 244871 244884 245399 245404) (-215 "D03FAFA.spad" 244699 244707 244861 244866) (-214 "D03EEFA.spad" 244519 244527 244689 244694) (-213 "D03AGNT.spad" 243605 243613 244509 244514) (-212 "D02EJFA.spad" 243067 243075 243595 243600) (-211 "D02CJFA.spad" 242545 242553 243057 243062) (-210 "D02BHFA.spad" 242035 242043 242535 242540) (-209 "D02BBFA.spad" 241525 241533 242025 242030) (-208 "D02AGNT.spad" 236339 236347 241515 241520) (-207 "D01WGTS.spad" 234658 234666 236329 236334) (-206 "D01TRNS.spad" 234635 234643 234648 234653) (-205 "D01GBFA.spad" 234157 234165 234625 234630) (-204 "D01FCFA.spad" 233679 233687 234147 234152) (-203 "D01ASFA.spad" 233147 233155 233669 233674) (-202 "D01AQFA.spad" 232593 232601 233137 233142) (-201 "D01APFA.spad" 232017 232025 232583 232588) (-200 "D01ANFA.spad" 231511 231519 232007 232012) (-199 "D01AMFA.spad" 231021 231029 231501 231506) (-198 "D01ALFA.spad" 230561 230569 231011 231016) (-197 "D01AKFA.spad" 230087 230095 230551 230556) (-196 "D01AJFA.spad" 229610 229618 230077 230082) (-195 "D01AGNT.spad" 225677 225685 229600 229605) (-194 "CYCLOTOM.spad" 225183 225191 225667 225672) (-193 "CYCLES.spad" 221975 221983 225173 225178) (-192 "CVMP.spad" 221392 221402 221965 221970) (-191 "CTRIGMNP.spad" 219892 219908 221382 221387) (-190 "CTOR.spad" 219583 219591 219882 219887) (-189 "CTORKIND.spad" 219186 219194 219573 219578) (-188 "CTORCAT.spad" 218435 218443 219176 219181) (-187 "CTORCAT.spad" 217682 217692 218425 218430) (-186 "CTORCALL.spad" 217271 217281 217672 217677) (-185 "CSTTOOLS.spad" 216516 216529 217261 217266) (-184 "CRFP.spad" 210240 210253 216506 216511) (-183 "CRCEAST.spad" 209960 209968 210230 210235) (-182 "CRAPACK.spad" 209011 209021 209950 209955) (-181 "CPMATCH.spad" 208515 208530 208936 208941) (-180 "CPIMA.spad" 208220 208239 208505 208510) (-179 "COORDSYS.spad" 203229 203239 208210 208215) (-178 "CONTOUR.spad" 202640 202648 203219 203224) (-177 "CONTFRAC.spad" 198390 198400 202542 202635) (-176 "CONDUIT.spad" 198148 198156 198380 198385) (-175 "COMRING.spad" 197822 197830 198086 198143) (-174 "COMPPROP.spad" 197340 197348 197812 197817) (-173 "COMPLPAT.spad" 197107 197122 197330 197335) (-172 "COMPLEX.spad" 192484 192494 192728 192989) (-171 "COMPLEX2.spad" 192199 192211 192474 192479) (-170 "COMPILER.spad" 191748 191756 192189 192194) (-169 "COMPFACT.spad" 191350 191364 191738 191743) (-168 "COMPCAT.spad" 189422 189432 191084 191345) (-167 "COMPCAT.spad" 187222 187234 188886 188891) (-166 "COMMUPC.spad" 186970 186988 187212 187217) (-165 "COMMONOP.spad" 186503 186511 186960 186965) (-164 "COMM.spad" 186314 186322 186493 186498) (-163 "COMMAAST.spad" 186077 186085 186304 186309) (-162 "COMBOPC.spad" 184992 185000 186067 186072) (-161 "COMBINAT.spad" 183759 183769 184982 184987) (-160 "COMBF.spad" 181141 181157 183749 183754) (-159 "COLOR.spad" 179978 179986 181131 181136) (-158 "COLONAST.spad" 179644 179652 179968 179973) (-157 "CMPLXRT.spad" 179355 179372 179634 179639) (-156 "CLLCTAST.spad" 179017 179025 179345 179350) (-155 "CLIP.spad" 175125 175133 179007 179012) (-154 "CLIF.spad" 173780 173796 175081 175120) (-153 "CLAGG.spad" 170285 170295 173770 173775) (-152 "CLAGG.spad" 166661 166673 170148 170153) (-151 "CINTSLPE.spad" 165992 166005 166651 166656) (-150 "CHVAR.spad" 164130 164152 165982 165987) (-149 "CHARZ.spad" 164045 164053 164110 164125) (-148 "CHARPOL.spad" 163555 163565 164035 164040) (-147 "CHARNZ.spad" 163308 163316 163535 163550) (-146 "CHAR.spad" 160742 160750 163298 163303) (-145 "CFCAT.spad" 160070 160078 160732 160737) (-144 "CDEN.spad" 159266 159280 160060 160065) (-143 "CCLASS.spad" 157377 157385 158639 158678) (-142 "CATEGORY.spad" 156419 156427 157367 157372) (-141 "CATCTOR.spad" 156310 156318 156409 156414) (-140 "CATAST.spad" 155928 155936 156300 156305) (-139 "CASEAST.spad" 155642 155650 155918 155923) (-138 "CARTEN.spad" 151009 151033 155632 155637) (-137 "CARTEN2.spad" 150399 150426 150999 151004) (-136 "CARD.spad" 147694 147702 150373 150394) (-135 "CAPSLAST.spad" 147468 147476 147684 147689) (-134 "CACHSET.spad" 147092 147100 147458 147463) (-133 "CABMON.spad" 146647 146655 147082 147087) (-132 "BYTEORD.spad" 146322 146330 146637 146642) (-131 "BYTE.spad" 145749 145757 146312 146317) (-130 "BYTEBUF.spad" 143447 143455 144757 144784) (-129 "BTREE.spad" 142403 142413 142937 142964) (-128 "BTOURN.spad" 141291 141301 141893 141920) (-127 "BTCAT.spad" 140683 140693 141259 141286) (-126 "BTCAT.spad" 140095 140107 140673 140678) (-125 "BTAGG.spad" 139561 139569 140063 140090) (-124 "BTAGG.spad" 139047 139057 139551 139556) (-123 "BSTREE.spad" 137671 137681 138537 138564) (-122 "BRILL.spad" 135868 135879 137661 137666) (-121 "BRAGG.spad" 134808 134818 135858 135863) (-120 "BRAGG.spad" 133712 133724 134764 134769) (-119 "BPADICRT.spad" 131586 131598 131841 131934) (-118 "BPADIC.spad" 131250 131262 131512 131581) (-117 "BOUNDZRO.spad" 130906 130923 131240 131245) (-116 "BOP.spad" 126088 126096 130896 130901) (-115 "BOP1.spad" 123554 123564 126078 126083) (-114 "BOOLE.spad" 123204 123212 123544 123549) (-113 "BOOLE.spad" 122852 122862 123194 123199) (-112 "BOOLEAN.spad" 122290 122298 122842 122847) (-111 "BMODULE.spad" 122002 122014 122258 122285) (-110 "BITS.spad" 121385 121393 121600 121627) (-109 "BINDING.spad" 120798 120806 121375 121380) (-108 "BINARY.spad" 118812 118820 119168 119261) (-107 "BGAGG.spad" 118017 118027 118792 118807) (-106 "BGAGG.spad" 117230 117242 118007 118012) (-105 "BFUNCT.spad" 116794 116802 117210 117225) (-104 "BEZOUT.spad" 115934 115961 116744 116749) (-103 "BBTREE.spad" 112662 112672 115424 115451) (-102 "BASTYPE.spad" 112158 112166 112652 112657) (-101 "BASTYPE.spad" 111652 111662 112148 112153) (-100 "BALFACT.spad" 111111 111124 111642 111647) (-99 "AUTOMOR.spad" 110562 110571 111091 111106) (-98 "ATTREG.spad" 107285 107292 110314 110557) (-97 "ATTRBUT.spad" 103308 103315 107265 107280) (-96 "ATTRAST.spad" 103025 103032 103298 103303) (-95 "ATRIG.spad" 102495 102502 103015 103020) (-94 "ATRIG.spad" 101963 101972 102485 102490) (-93 "ASTCAT.spad" 101867 101874 101953 101958) (-92 "ASTCAT.spad" 101769 101778 101857 101862) (-91 "ASTACK.spad" 100991 101000 101259 101286) (-90 "ASSOCEQ.spad" 99817 99828 100947 100952) (-89 "ASP9.spad" 98898 98911 99807 99812) (-88 "ASP8.spad" 97941 97954 98888 98893) (-87 "ASP80.spad" 97263 97276 97931 97936) (-86 "ASP7.spad" 96423 96436 97253 97258) (-85 "ASP78.spad" 95874 95887 96413 96418) (-84 "ASP77.spad" 95243 95256 95864 95869) (-83 "ASP74.spad" 94335 94348 95233 95238) (-82 "ASP73.spad" 93606 93619 94325 94330) (-81 "ASP6.spad" 92473 92486 93596 93601) (-80 "ASP55.spad" 90982 90995 92463 92468) (-79 "ASP50.spad" 88799 88812 90972 90977) (-78 "ASP4.spad" 88094 88107 88789 88794) (-77 "ASP49.spad" 87093 87106 88084 88089) (-76 "ASP42.spad" 85500 85539 87083 87088) (-75 "ASP41.spad" 84079 84118 85490 85495) (-74 "ASP35.spad" 83067 83080 84069 84074) (-73 "ASP34.spad" 82368 82381 83057 83062) (-72 "ASP33.spad" 81928 81941 82358 82363) (-71 "ASP31.spad" 81068 81081 81918 81923) (-70 "ASP30.spad" 79960 79973 81058 81063) (-69 "ASP29.spad" 79426 79439 79950 79955) (-68 "ASP28.spad" 70699 70712 79416 79421) (-67 "ASP27.spad" 69596 69609 70689 70694) (-66 "ASP24.spad" 68683 68696 69586 69591) (-65 "ASP20.spad" 68147 68160 68673 68678) (-64 "ASP1.spad" 67528 67541 68137 68142) (-63 "ASP19.spad" 62214 62227 67518 67523) (-62 "ASP12.spad" 61628 61641 62204 62209) (-61 "ASP10.spad" 60899 60912 61618 61623) (-60 "ARRAY2.spad" 60142 60151 60389 60416) (-59 "ARRAY1.spad" 58826 58835 59172 59199) (-58 "ARRAY12.spad" 57539 57550 58816 58821) (-57 "ARR2CAT.spad" 53313 53334 57507 57534) (-56 "ARR2CAT.spad" 49107 49130 53303 53308) (-55 "ARITY.spad" 48479 48486 49097 49102) (-54 "APPRULE.spad" 47739 47761 48469 48474) (-53 "APPLYORE.spad" 47358 47371 47729 47734) (-52 "ANY.spad" 46217 46224 47348 47353) (-51 "ANY1.spad" 45288 45297 46207 46212) (-50 "ANTISYM.spad" 43733 43749 45268 45283) (-49 "ANON.spad" 43426 43433 43723 43728) (-48 "AN.spad" 41735 41742 43242 43335) (-47 "AMR.spad" 39920 39931 41633 41730) (-46 "AMR.spad" 37942 37955 39657 39662) (-45 "ALIST.spad" 34842 34863 35192 35219) (-44 "ALGSC.spad" 33977 34003 34714 34767) (-43 "ALGPKG.spad" 29760 29771 33933 33938) (-42 "ALGMFACT.spad" 28953 28967 29750 29755) (-41 "ALGMANIP.spad" 26427 26442 28786 28791) (-40 "ALGFF.spad" 24068 24095 24285 24441) (-39 "ALGFACT.spad" 23195 23205 24058 24063) (-38 "ALGEBRA.spad" 23028 23037 23151 23190) (-37 "ALGEBRA.spad" 22893 22904 23018 23023) (-36 "ALAGG.spad" 22405 22426 22861 22888) (-35 "AHYP.spad" 21786 21793 22395 22400) (-34 "AGG.spad" 20103 20110 21776 21781) (-33 "AGG.spad" 18384 18393 20059 20064) (-32 "AF.spad" 16815 16830 18319 18324) (-31 "ADDAST.spad" 16493 16500 16805 16810) (-30 "ACPLOT.spad" 15084 15091 16483 16488) (-29 "ACFS.spad" 12893 12902 14986 15079) (-28 "ACFS.spad" 10788 10799 12883 12888) (-27 "ACF.spad" 7470 7477 10690 10783) (-26 "ACF.spad" 4238 4247 7460 7465) (-25 "ABELSG.spad" 3779 3786 4228 4233) (-24 "ABELSG.spad" 3318 3327 3769 3774) (-23 "ABELMON.spad" 2861 2868 3308 3313) (-22 "ABELMON.spad" 2402 2411 2851 2856) (-21 "ABELGRP.spad" 2067 2074 2392 2397) (-20 "ABELGRP.spad" 1730 1739 2057 2062) (-19 "A1AGG.spad" 870 879 1698 1725) (-18 "A1AGG.spad" 30 41 860 865)) 
+\ No newline at end of file
author	dos-reis <gdr@axiomatics.org>	2010-11-19 00:57:55 +0000
committer	dos-reis <gdr@axiomatics.org>	2010-11-19 00:57:55 +0000
commit	32a0482710c76733805bca604c2089c231cd733f (patch)
tree	d1fbac95b8b029d2d789b41fcb3770e1b16fb72a /src/share/algebra/browse.daase
parent	1b31c2ee8c940986d448dfc226b00fc6f6af6639 (diff)
download	open-axiom-32a0482710c76733805bca604c2089c231cd733f.tar.gz