diff options
| author | dos-reis <gdr@axiomatics.org> | 2010-06-14 04:25:41 +0000 |
|---|---|---|
| committer | dos-reis <gdr@axiomatics.org> | 2010-06-14 04:25:41 +0000 |
| commit | 5f7a5c1a81c50807bf1315260f94108dd9a5ac2e (patch) | |
| tree | 6b485c54e2fa2b6c71ec68d89ad143087625d342 /src/share/algebra/browse.daase | |
| parent | 335db800c7cbaff88eda34d83e23ad808ea42fb8 (diff) | |
| download | open-axiom-5f7a5c1a81c50807bf1315260f94108dd9a5ac2e.tar.gz | |
* Partially revert previous change.
Diffstat (limited to 'src/share/algebra/browse.daase')
| -rw-r--r-- | src/share/algebra/browse.daase | 644 |
1 files changed, 322 insertions, 322 deletions
diff --git a/src/share/algebra/browse.daase b/src/share/algebra/browse.daase index c93c135a..80bc4a2e 100644 --- a/src/share/algebra/browse.daase +++ b/src/share/algebra/browse.daase @@ -1,5 +1,5 @@ -(2267469 . 3485464570) +(2267397 . 3485478046) (-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 -3636) +(-32 R -1384) ((|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 -1049) (QUOTE (-572))))) @@ -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 -3636 UP UPUP -3163) +(-40 -1384 UP UPUP -2189) ((|constructor| (NIL "Function field defined by \\spad{f}(\\spad{x},{} \\spad{y}) = 0.")) (|knownInfBasis| (((|Void|) (|NonNegativeInteger|)) "\\spad{knownInfBasis(n)} \\undocumented{}"))) ((-4447 |has| (-415 |#2|) (-370)) (-4452 |has| (-415 |#2|) (-370)) (-4446 |has| (-415 |#2|) (-370)) ((-4456 "*") . T) (-4448 . T) (-4449 . T) (-4451 . T)) -((|HasCategory| (-415 |#2|) (QUOTE (-146))) (|HasCategory| (-415 |#2|) (QUOTE (-148))) (|HasCategory| (-415 |#2|) (QUOTE (-356))) (-3783 (|HasCategory| (-415 |#2|) (QUOTE (-370))) (|HasCategory| (-415 |#2|) (QUOTE (-356)))) (|HasCategory| (-415 |#2|) (QUOTE (-370))) (|HasCategory| (-415 |#2|) (QUOTE (-375))) (-3783 (-12 (|HasCategory| (-415 |#2|) (QUOTE (-237))) (|HasCategory| (-415 |#2|) (QUOTE (-370)))) (|HasCategory| (-415 |#2|) (QUOTE (-356)))) (-3783 (-12 (|HasCategory| (-415 |#2|) (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| (-415 |#2|) (QUOTE (-370)))) (-12 (|HasCategory| (-415 |#2|) (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| (-415 |#2|) (QUOTE (-356))))) (|HasCategory| (-415 |#2|) (LIST (QUOTE -647) (QUOTE (-572)))) (-3783 (|HasCategory| (-415 |#2|) (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| (-415 |#2|) (QUOTE (-370)))) (|HasCategory| (-415 |#2|) (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| (-415 |#2|) (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-375))) (-12 (|HasCategory| (-415 |#2|) (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| (-415 |#2|) (QUOTE (-370)))) (-12 (|HasCategory| (-415 |#2|) (QUOTE (-237))) (|HasCategory| (-415 |#2|) (QUOTE (-370))))) -(-41 R -3636) +((|HasCategory| (-415 |#2|) (QUOTE (-146))) (|HasCategory| (-415 |#2|) (QUOTE (-148))) (|HasCategory| (-415 |#2|) (QUOTE (-356))) (-2813 (|HasCategory| (-415 |#2|) (QUOTE (-370))) (|HasCategory| (-415 |#2|) (QUOTE (-356)))) (|HasCategory| (-415 |#2|) (QUOTE (-370))) (|HasCategory| (-415 |#2|) (QUOTE (-375))) (-2813 (-12 (|HasCategory| (-415 |#2|) (QUOTE (-237))) (|HasCategory| (-415 |#2|) (QUOTE (-370)))) (|HasCategory| (-415 |#2|) (QUOTE (-356)))) (-2813 (-12 (|HasCategory| (-415 |#2|) (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| (-415 |#2|) (QUOTE (-370)))) (-12 (|HasCategory| (-415 |#2|) (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| (-415 |#2|) (QUOTE (-356))))) (|HasCategory| (-415 |#2|) (LIST (QUOTE -647) (QUOTE (-572)))) (-2813 (|HasCategory| (-415 |#2|) (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| (-415 |#2|) (QUOTE (-370)))) (|HasCategory| (-415 |#2|) (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| (-415 |#2|) (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-375))) (-12 (|HasCategory| (-415 |#2|) (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| (-415 |#2|) (QUOTE (-370)))) (-12 (|HasCategory| (-415 |#2|) (QUOTE (-237))) (|HasCategory| (-415 |#2|) (QUOTE (-370))))) +(-41 R -1384) ((|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 (-460))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -438) (|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."))) ((-4454 . T) (-4455 . T)) -((-3783 (-12 (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (QUOTE (-858))) (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (LIST (QUOTE -315) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -1640) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3763) (|devaluate| |#2|)))))) (-12 (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (QUOTE (-1111))) (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (LIST (QUOTE -315) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -1640) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3763) (|devaluate| |#2|))))))) (-3783 (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (QUOTE (-858))) (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (QUOTE (-1111))) (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (LIST (QUOTE -622) (QUOTE (-544)))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-3783 (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (QUOTE (-858))) (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (QUOTE (-1111))) (|HasCategory| |#2| (QUOTE (-1111)))) (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| (-572) (QUOTE (-858))) (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (QUOTE (-1111))) (-3783 (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870))))) (-3783 (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (QUOTE (-1111))) (|HasCategory| |#2| (QUOTE (-1111)))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (QUOTE (-1111))) (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (LIST (QUOTE -315) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -1640) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3763) (|devaluate| |#2|))))))) +((-2813 (-12 (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (QUOTE (-858))) (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (LIST (QUOTE -315) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -3690) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -1907) (|devaluate| |#2|)))))) (-12 (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (QUOTE (-1111))) (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (LIST (QUOTE -315) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -3690) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -1907) (|devaluate| |#2|))))))) (-2813 (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (QUOTE (-858))) (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (QUOTE (-1111))) (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (LIST (QUOTE -622) (QUOTE (-544)))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-2813 (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (QUOTE (-858))) (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (QUOTE (-1111))) (|HasCategory| |#2| (QUOTE (-1111)))) (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| (-572) (QUOTE (-858))) (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (QUOTE (-1111))) (-2813 (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870))))) (-2813 (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (QUOTE (-1111))) (|HasCategory| |#2| (QUOTE (-1111)))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (QUOTE (-1111))) (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (LIST (QUOTE -315) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -3690) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -1907) (|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 -3636) +(-54 |Base| R -1384) ((|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 @@ -167,64 +167,64 @@ NIL (-59 S) ((|constructor| (NIL "This is the domain of 1-based one dimensional arrays")) (|oneDimensionalArray| (($ (|NonNegativeInteger|) |#1|) "\\spad{oneDimensionalArray(n,s)} creates an array from \\spad{n} copies of element \\spad{s}") (($ (|List| |#1|)) "\\spad{oneDimensionalArray(l)} creates an array from a list of elements \\spad{l}"))) ((-4455 . T) (-4454 . T)) -((-3783 (-12 (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) (-3783 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544)))) (-3783 (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-1111)))) (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| (-572) (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) +((-2813 (-12 (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) (-2813 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544)))) (-2813 (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-1111)))) (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| (-572) (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) (-60 R) ((|constructor| (NIL "\\indented{1}{A TwoDimensionalArray is a two dimensional array with} 1-based indexing for both rows and columns.")) (|shallowlyMutable| ((|attribute|) "One may destructively alter TwoDimensionalArray\\spad{'s}."))) ((-4454 . T) (-4455 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1111))) (-3783 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) -(-61 -2402) +((-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1111))) (-2813 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) +(-61 -2029) ((|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 -2402) +(-62 -2029) ((|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 -2402) +(-63 -2029) ((|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 -2402) +(-64 -2029) ((|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 -2402) +(-65 -2029) ((|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 -2402) +(-66 -2029) ((|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 -2402) +(-67 -2029) ((|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 -2402) +(-68 -2029) ((|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 -2402) +(-69 -2029) ((|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 -2402) +(-70 -2029) ((|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 -2402) +(-71 -2029) ((|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 -2402) +(-72 -2029) ((|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 -2402) +(-73 -2029) ((|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 -2402) +(-74 -2029) ((|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 -2402) +(-77 -2029) ((|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 -2402) +(-78 -2029) ((|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 -2402) +(-79 -2029) ((|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 -2402) +(-80 -2029) ((|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 -2402) +(-81 -2029) ((|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 -2402) +(-82 -2029) ((|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 -2402) +(-83 -2029) ((|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 -2402) +(-84 -2029) ((|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 -2402) +(-85 -2029) ((|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 -2402) +(-86 -2029) ((|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 -2402) +(-87 -2029) ((|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 -2402) +(-88 -2029) ((|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 -2402) +(-89 -2029) ((|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 @@ -295,7 +295,7 @@ NIL (-91 S) ((|constructor| (NIL "A stack represented as a flexible array.")) (|arrayStack| (($ (|List| |#1|)) "\\spad{arrayStack([x,y,...,z])} creates an array stack with first (top) element \\spad{x},{} second element \\spad{y},{}...,{}and last element \\spad{z}."))) ((-4454 . T) (-4455 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1111))) (-3783 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) +((-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1111))) (-2813 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (-92 S) ((|constructor| (NIL "This is the category of Spad abstract syntax trees."))) NIL @@ -343,7 +343,7 @@ NIL (-103 S) ((|constructor| (NIL "\\spadtype{BalancedBinaryTree(S)} is the domain of balanced binary trees (bbtree). A balanced binary tree of \\spad{2**k} leaves,{} for some \\spad{k > 0},{} is symmetric,{} that is,{} the left and right subtree of each interior node have identical shape. In general,{} the left and right subtree of a given node can differ by at most leaf node.")) (|mapDown!| (($ $ |#1| (|Mapping| (|List| |#1|) |#1| |#1| |#1|)) "\\spad{mapDown!(t,p,f)} returns \\spad{t} after traversing \\spad{t} in \"preorder\" (node then left then right) fashion replacing the successive interior nodes as follows. Let \\spad{l} and \\spad{r} denote the left and right subtrees of \\spad{t}. The root value \\spad{x} of \\spad{t} is replaced by \\spad{p}. Then \\spad{f}(value \\spad{l},{} value \\spad{r},{} \\spad{p}),{} where \\spad{l} and \\spad{r} denote the left and right subtrees of \\spad{t},{} is evaluated producing two values \\spad{pl} and \\spad{pr}. Then \\spad{mapDown!(l,pl,f)} and \\spad{mapDown!(l,pr,f)} are evaluated.") (($ $ |#1| (|Mapping| |#1| |#1| |#1|)) "\\spad{mapDown!(t,p,f)} returns \\spad{t} after traversing \\spad{t} in \"preorder\" (node then left then right) fashion replacing the successive interior nodes as follows. The root value \\spad{x} is replaced by \\spad{q} \\spad{:=} \\spad{f}(\\spad{p},{}\\spad{x}). The mapDown!(\\spad{l},{}\\spad{q},{}\\spad{f}) and mapDown!(\\spad{r},{}\\spad{q},{}\\spad{f}) are evaluated for the left and right subtrees \\spad{l} and \\spad{r} of \\spad{t}.")) (|mapUp!| (($ $ $ (|Mapping| |#1| |#1| |#1| |#1| |#1|)) "\\spad{mapUp!(t,t1,f)} traverses \\spad{t} in an \"endorder\" (left then right then node) fashion returning \\spad{t} with the value at each successive interior node of \\spad{t} replaced by \\spad{f}(\\spad{l},{}\\spad{r},{}\\spad{l1},{}\\spad{r1}) where \\spad{l} and \\spad{r} are the values at the immediate left and right nodes. Values \\spad{l1} and \\spad{r1} are values at the corresponding nodes of a balanced binary tree \\spad{t1},{} of identical shape at \\spad{t}.") ((|#1| $ (|Mapping| |#1| |#1| |#1|)) "\\spad{mapUp!(t,f)} traverses balanced binary tree \\spad{t} in an \"endorder\" (left then right then node) fashion returning \\spad{t} with the value at each successive interior node of \\spad{t} replaced by \\spad{f}(\\spad{l},{}\\spad{r}) where \\spad{l} and \\spad{r} are the values at the immediate left and right nodes.")) (|setleaves!| (($ $ (|List| |#1|)) "\\spad{setleaves!(t, ls)} sets the leaves of \\spad{t} in left-to-right order to the elements of \\spad{ls}.")) (|balancedBinaryTree| (($ (|NonNegativeInteger|) |#1|) "\\spad{balancedBinaryTree(n, s)} creates a balanced binary tree with \\spad{n} nodes each with value \\spad{s}."))) ((-4454 . T) (-4455 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1111))) (-3783 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) +((-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1111))) (-2813 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (-104 R UP M |Row| |Col|) ((|constructor| (NIL "\\spadtype{BezoutMatrix} contains functions for computing resultants and discriminants using Bezout matrices.")) (|bezoutDiscriminant| ((|#1| |#2|) "\\spad{bezoutDiscriminant(p)} computes the discriminant of a polynomial \\spad{p} by computing the determinant of a Bezout matrix.")) (|bezoutResultant| ((|#1| |#2| |#2|) "\\spad{bezoutResultant(p,q)} computes the resultant of the two polynomials \\spad{p} and \\spad{q} by computing the determinant of a Bezout matrix.")) (|bezoutMatrix| ((|#3| |#2| |#2|) "\\spad{bezoutMatrix(p,q)} returns the Bezout matrix for the two polynomials \\spad{p} and \\spad{q}.")) (|sylvesterMatrix| ((|#3| |#2| |#2|) "\\spad{sylvesterMatrix(p,q)} returns the Sylvester matrix for the two polynomials \\spad{p} and \\spad{q}."))) NIL @@ -363,7 +363,7 @@ NIL (-108) ((|constructor| (NIL "This domain allows rational numbers to be presented as repeating binary expansions.")) (|binary| (($ (|Fraction| (|Integer|))) "\\spad{binary(r)} converts a rational number to a binary expansion.")) (|fractionPart| (((|Fraction| (|Integer|)) $) "\\spad{fractionPart(b)} returns the fractional part of a binary expansion."))) ((-4446 . T) (-4452 . T) (-4447 . T) ((-4456 "*") . T) (-4448 . T) (-4449 . T) (-4451 . T)) -((|HasCategory| (-572) (QUOTE (-918))) (|HasCategory| (-572) (LIST (QUOTE -1049) (QUOTE (-1188)))) (|HasCategory| (-572) (QUOTE (-146))) (|HasCategory| (-572) (QUOTE (-148))) (|HasCategory| (-572) (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| (-572) (QUOTE (-1033))) (|HasCategory| (-572) (QUOTE (-828))) (-3783 (|HasCategory| (-572) (QUOTE (-828))) (|HasCategory| (-572) (QUOTE (-858)))) (|HasCategory| (-572) (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| (-572) (QUOTE (-1163))) (|HasCategory| (-572) (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| (-572) (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| (-572) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| (-572) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| (-572) (QUOTE (-237))) (|HasCategory| (-572) (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| (-572) (LIST (QUOTE -522) (QUOTE (-1188)) (QUOTE (-572)))) (|HasCategory| (-572) (LIST (QUOTE -315) (QUOTE (-572)))) (|HasCategory| (-572) (LIST (QUOTE -292) (QUOTE (-572)) (QUOTE (-572)))) (|HasCategory| (-572) (QUOTE (-313))) (|HasCategory| (-572) (QUOTE (-553))) (|HasCategory| (-572) (QUOTE (-858))) (|HasCategory| (-572) (LIST (QUOTE -647) (QUOTE (-572)))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| (-572) (QUOTE (-918)))) (-3783 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| (-572) (QUOTE (-918)))) (|HasCategory| (-572) (QUOTE (-146))))) +((|HasCategory| (-572) (QUOTE (-918))) (|HasCategory| (-572) (LIST (QUOTE -1049) (QUOTE (-1188)))) (|HasCategory| (-572) (QUOTE (-146))) (|HasCategory| (-572) (QUOTE (-148))) (|HasCategory| (-572) (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| (-572) (QUOTE (-1033))) (|HasCategory| (-572) (QUOTE (-828))) (-2813 (|HasCategory| (-572) (QUOTE (-828))) (|HasCategory| (-572) (QUOTE (-858)))) (|HasCategory| (-572) (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| (-572) (QUOTE (-1163))) (|HasCategory| (-572) (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| (-572) (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| (-572) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| (-572) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| (-572) (QUOTE (-237))) (|HasCategory| (-572) (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| (-572) (LIST (QUOTE -522) (QUOTE (-1188)) (QUOTE (-572)))) (|HasCategory| (-572) (LIST (QUOTE -315) (QUOTE (-572)))) (|HasCategory| (-572) (LIST (QUOTE -292) (QUOTE (-572)) (QUOTE (-572)))) (|HasCategory| (-572) (QUOTE (-313))) (|HasCategory| (-572) (QUOTE (-553))) (|HasCategory| (-572) (QUOTE (-858))) (|HasCategory| (-572) (LIST (QUOTE -647) (QUOTE (-572)))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| (-572) (QUOTE (-918)))) (-2813 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| (-572) (QUOTE (-918)))) (|HasCategory| (-572) (QUOTE (-146))))) (-109) ((|constructor| (NIL "\\indented{1}{Author: Gabriel Dos Reis} Date Created: October 24,{} 2007 Date Last Modified: January 18,{} 2008. A `Binding' is a name asosciated with a collection of properties.")) (|binding| (($ (|Identifier|) (|List| (|Property|))) "\\spad{binding(n,props)} constructs a binding with name \\spad{`n'} and property list `props'.")) (|properties| (((|List| (|Property|)) $) "\\spad{properties(b)} returns the properties associated with binding \\spad{b}.")) (|name| (((|Identifier|) $) "\\spad{name(b)} returns the name of binding \\spad{b}"))) NIL @@ -392,7 +392,7 @@ NIL ((|constructor| (NIL "A basic operator is an object that can be applied to a list of arguments from a set,{} the result being a kernel over that set.")) (|setProperties| (($ $ (|AssociationList| (|String|) (|None|))) "\\spad{setProperties(op, l)} sets the property list of \\spad{op} to \\spad{l}. Argument \\spad{op} is modified \"in place\",{} \\spadignore{i.e.} no copy is made.")) (|setProperty| (($ $ (|Identifier|) (|None|)) "\\spad{setProperty(op, p, v)} attaches property \\spad{p} to \\spad{op},{} and sets its value to \\spad{v}. Argument \\spad{op} is modified \"in place\",{} \\spadignore{i.e.} no copy is made.") (($ $ (|String|) (|None|)) "\\spad{setProperty(op, s, v)} attaches property \\spad{s} to \\spad{op},{} and sets its value to \\spad{v}. Argument \\spad{op} is modified \"in place\",{} \\spadignore{i.e.} no copy is made.")) (|property| (((|Maybe| (|None|)) $ (|Identifier|)) "\\spad{property(op, p)} returns the value of property \\spad{p} if it is attached to \\spad{op},{} otherwise \\spad{nothing}.") (((|Union| (|None|) "failed") $ (|String|)) "\\spad{property(op, s)} returns the value of property \\spad{s} if it is attached to \\spad{op},{} and \"failed\" otherwise.")) (|deleteProperty!| (($ $ (|Identifier|)) "\\spad{deleteProperty!(op, p)} unattaches property \\spad{p} from \\spad{op}. Argument \\spad{op} is modified \"in place\",{} \\spadignore{i.e.} no copy is made.") (($ $ (|String|)) "\\spad{deleteProperty!(op, s)} unattaches property \\spad{s} from \\spad{op}. Argument \\spad{op} is modified \"in place\",{} \\spadignore{i.e.} no copy is made.")) (|assert| (($ $ (|Identifier|)) "\\spad{assert(op, p)} attaches property \\spad{p} to \\spad{op}. Argument \\spad{op} is modified \"in place\",{} \\spadignore{i.e.} no copy is made.")) (|has?| (((|Boolean|) $ (|Identifier|)) "\\spad{has?(op,p)} tests if property \\spad{s} is attached to \\spad{op}.")) (|input| (((|Union| (|Mapping| (|InputForm|) (|List| (|InputForm|))) "failed") $) "\\spad{input(op)} returns the \"\\%input\" property of \\spad{op} if it has one attached,{} \"failed\" otherwise.") (($ $ (|Mapping| (|InputForm|) (|List| (|InputForm|)))) "\\spad{input(op, foo)} attaches foo as the \"\\%input\" property of \\spad{op}. If \\spad{op} has a \"\\%input\" property \\spad{f},{} then \\spad{op(a1,...,an)} gets converted to InputForm as \\spad{f(a1,...,an)}.")) (|display| (($ $ (|Mapping| (|OutputForm|) (|OutputForm|))) "\\spad{display(op, foo)} attaches foo as the \"\\%display\" property of \\spad{op}. If \\spad{op} has a \"\\%display\" property \\spad{f},{} then \\spad{op(a)} gets converted to OutputForm as \\spad{f(a)}. Argument \\spad{op} must be unary.") (($ $ (|Mapping| (|OutputForm|) (|List| (|OutputForm|)))) "\\spad{display(op, foo)} attaches foo as the \"\\%display\" property of \\spad{op}. If \\spad{op} has a \"\\%display\" property \\spad{f},{} then \\spad{op(a1,...,an)} gets converted to OutputForm as \\spad{f(a1,...,an)}.") (((|Union| (|Mapping| (|OutputForm|) (|List| (|OutputForm|))) "failed") $) "\\spad{display(op)} returns the \"\\%display\" property of \\spad{op} if it has one attached,{} and \"failed\" otherwise.")) (|comparison| (($ $ (|Mapping| (|Boolean|) $ $)) "\\spad{comparison(op, foo?)} attaches foo? as the \"\\%less?\" property to \\spad{op}. If op1 and op2 have the same name,{} and one of them has a \"\\%less?\" property \\spad{f},{} then \\spad{f(op1, op2)} is called to decide whether \\spad{op1 < op2}.")) (|equality| (($ $ (|Mapping| (|Boolean|) $ $)) "\\spad{equality(op, foo?)} attaches foo? as the \"\\%equal?\" property to \\spad{op}. If op1 and op2 have the same name,{} and one of them has an \"\\%equal?\" property \\spad{f},{} then \\spad{f(op1, op2)} is called to decide whether op1 and op2 should be considered equal.")) (|weight| (($ $ (|NonNegativeInteger|)) "\\spad{weight(op, n)} attaches the weight \\spad{n} to \\spad{op}.") (((|NonNegativeInteger|) $) "\\spad{weight(op)} returns the weight attached to \\spad{op}.")) (|nary?| (((|Boolean|) $) "\\spad{nary?(op)} tests if \\spad{op} has arbitrary arity.")) (|unary?| (((|Boolean|) $) "\\spad{unary?(op)} tests if \\spad{op} is unary.")) (|nullary?| (((|Boolean|) $) "\\spad{nullary?(op)} tests if \\spad{op} is nullary.")) (|operator| (($ (|Symbol|) (|Arity|)) "\\spad{operator(f, a)} makes \\spad{f} into an operator of arity \\spad{a}.") (($ (|Symbol|) (|NonNegativeInteger|)) "\\spad{operator(f, n)} makes \\spad{f} into an \\spad{n}-ary operator.") (($ (|Symbol|)) "\\spad{operator(f)} makes \\spad{f} into an operator with arbitrary arity.")) (|copy| (($ $) "\\spad{copy(op)} returns a copy of \\spad{op}.")) (|properties| (((|AssociationList| (|String|) (|None|)) $) "\\spad{properties(op)} returns the list of all the properties currently attached to \\spad{op}."))) NIL NIL -(-116 -3636 UP) +(-116 -1384 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 @@ -403,7 +403,7 @@ NIL (-118 |p|) ((|constructor| (NIL "Stream-based implementation of \\spad{Qp:} numbers are represented as sum(\\spad{i} = \\spad{k}..,{} a[\\spad{i}] * p^i),{} where the a[\\spad{i}] lie in -(\\spad{p} - 1)\\spad{/2},{}...,{}(\\spad{p} - 1)\\spad{/2}."))) ((-4446 . T) (-4452 . T) (-4447 . T) ((-4456 "*") . T) (-4448 . T) (-4449 . T) (-4451 . T)) -((|HasCategory| (-117 |#1|) (QUOTE (-918))) (|HasCategory| (-117 |#1|) (LIST (QUOTE -1049) (QUOTE (-1188)))) (|HasCategory| (-117 |#1|) (QUOTE (-146))) (|HasCategory| (-117 |#1|) (QUOTE (-148))) (|HasCategory| (-117 |#1|) (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| (-117 |#1|) (QUOTE (-1033))) (|HasCategory| (-117 |#1|) (QUOTE (-828))) (-3783 (|HasCategory| (-117 |#1|) (QUOTE (-828))) (|HasCategory| (-117 |#1|) (QUOTE (-858)))) (|HasCategory| (-117 |#1|) (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| (-117 |#1|) (QUOTE (-1163))) (|HasCategory| (-117 |#1|) (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| (-117 |#1|) (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| (-117 |#1|) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| (-117 |#1|) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| (-117 |#1|) (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| (-117 |#1|) (QUOTE (-237))) (|HasCategory| (-117 |#1|) (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| (-117 |#1|) (LIST (QUOTE -522) (QUOTE (-1188)) (LIST (QUOTE -117) (|devaluate| |#1|)))) (|HasCategory| (-117 |#1|) (LIST (QUOTE -315) (LIST (QUOTE -117) (|devaluate| |#1|)))) (|HasCategory| (-117 |#1|) (LIST (QUOTE -292) (LIST (QUOTE -117) (|devaluate| |#1|)) (LIST (QUOTE -117) (|devaluate| |#1|)))) (|HasCategory| (-117 |#1|) (QUOTE (-313))) (|HasCategory| (-117 |#1|) (QUOTE (-553))) (|HasCategory| (-117 |#1|) (QUOTE (-858))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| (-117 |#1|) (QUOTE (-918)))) (-3783 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| (-117 |#1|) (QUOTE (-918)))) (|HasCategory| (-117 |#1|) (QUOTE (-146))))) +((|HasCategory| (-117 |#1|) (QUOTE (-918))) (|HasCategory| (-117 |#1|) (LIST (QUOTE -1049) (QUOTE (-1188)))) (|HasCategory| (-117 |#1|) (QUOTE (-146))) (|HasCategory| (-117 |#1|) (QUOTE (-148))) (|HasCategory| (-117 |#1|) (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| (-117 |#1|) (QUOTE (-1033))) (|HasCategory| (-117 |#1|) (QUOTE (-828))) (-2813 (|HasCategory| (-117 |#1|) (QUOTE (-828))) (|HasCategory| (-117 |#1|) (QUOTE (-858)))) (|HasCategory| (-117 |#1|) (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| (-117 |#1|) (QUOTE (-1163))) (|HasCategory| (-117 |#1|) (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| (-117 |#1|) (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| (-117 |#1|) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| (-117 |#1|) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| (-117 |#1|) (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| (-117 |#1|) (QUOTE (-237))) (|HasCategory| (-117 |#1|) (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| (-117 |#1|) (LIST (QUOTE -522) (QUOTE (-1188)) (LIST (QUOTE -117) (|devaluate| |#1|)))) (|HasCategory| (-117 |#1|) (LIST (QUOTE -315) (LIST (QUOTE -117) (|devaluate| |#1|)))) (|HasCategory| (-117 |#1|) (LIST (QUOTE -292) (LIST (QUOTE -117) (|devaluate| |#1|)) (LIST (QUOTE -117) (|devaluate| |#1|)))) (|HasCategory| (-117 |#1|) (QUOTE (-313))) (|HasCategory| (-117 |#1|) (QUOTE (-553))) (|HasCategory| (-117 |#1|) (QUOTE (-858))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| (-117 |#1|) (QUOTE (-918)))) (-2813 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| (-117 |#1|) (QUOTE (-918)))) (|HasCategory| (-117 |#1|) (QUOTE (-146))))) (-119 A S) ((|constructor| (NIL "A binary-recursive aggregate has 0,{} 1 or 2 children and serves as a model for a binary tree or a doubly-linked aggregate structure")) (|setright!| (($ $ $) "\\spad{setright!(a,x)} sets the right child of \\spad{t} to be \\spad{x}.")) (|setleft!| (($ $ $) "\\spad{setleft!(a,b)} sets the left child of \\axiom{a} to be \\spad{b}.")) (|setelt| (($ $ "right" $) "\\spad{setelt(a,\"right\",b)} (also written \\axiom{\\spad{b} . right \\spad{:=} \\spad{b}}) is equivalent to \\axiom{setright!(a,{}\\spad{b})}.") (($ $ "left" $) "\\spad{setelt(a,\"left\",b)} (also written \\axiom{a . left \\spad{:=} \\spad{b}}) is equivalent to \\axiom{setleft!(a,{}\\spad{b})}.")) (|right| (($ $) "\\spad{right(a)} returns the right child.")) (|elt| (($ $ "right") "\\spad{elt(a,\"right\")} (also written: \\axiom{a . right}) is equivalent to \\axiom{right(a)}.") (($ $ "left") "\\spad{elt(u,\"left\")} (also written: \\axiom{a . left}) is equivalent to \\axiom{left(a)}.")) (|left| (($ $) "\\spad{left(u)} returns the left child."))) NIL @@ -419,7 +419,7 @@ NIL (-122 S) ((|constructor| (NIL "BinarySearchTree(\\spad{S}) is the domain of a binary trees where elements are ordered across the tree. A binary search tree is either empty or has a value which is an \\spad{S},{} and a right and left which are both BinaryTree(\\spad{S}) Elements are ordered across the tree.")) (|split| (((|Record| (|:| |less| $) (|:| |greater| $)) |#1| $) "\\spad{split(x,b)} splits binary tree \\spad{b} into two trees,{} one with elements greater than \\spad{x},{} the other with elements less than \\spad{x}.")) (|insertRoot!| (($ |#1| $) "\\spad{insertRoot!(x,b)} inserts element \\spad{x} as a root of binary search tree \\spad{b}.")) (|insert!| (($ |#1| $) "\\spad{insert!(x,b)} inserts element \\spad{x} as leaves into binary search tree \\spad{b}.")) (|binarySearchTree| (($ (|List| |#1|)) "\\spad{binarySearchTree(l)} \\undocumented"))) ((-4454 . T) (-4455 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1111))) (-3783 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) +((-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1111))) (-2813 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (-123 S) ((|constructor| (NIL "The bit aggregate category models aggregates representing large quantities of Boolean data.")) (|xor| (($ $ $) "\\spad{xor(a,b)} returns the logical {\\em exclusive-or} of bit aggregates \\axiom{a} and \\axiom{\\spad{b}}.")) (|nor| (($ $ $) "\\spad{nor(a,b)} returns the logical {\\em nor} of bit aggregates \\axiom{a} and \\axiom{\\spad{b}}.")) (|nand| (($ $ $) "\\spad{nand(a,b)} returns the logical {\\em nand} of bit aggregates \\axiom{a} and \\axiom{\\spad{b}}."))) NIL @@ -439,15 +439,15 @@ NIL (-127 S) ((|constructor| (NIL "\\spadtype{BinaryTournament(S)} is the domain of binary trees where elements are ordered down the tree. A binary search tree is either empty or is a node containing a \\spadfun{value} of type \\spad{S},{} and a \\spadfun{right} and a \\spadfun{left} which are both \\spadtype{BinaryTree(S)}")) (|insert!| (($ |#1| $) "\\spad{insert!(x,b)} inserts element \\spad{x} as leaves into binary tournament \\spad{b}.")) (|binaryTournament| (($ (|List| |#1|)) "\\spad{binaryTournament(ls)} creates a binary tournament with the elements of \\spad{ls} as values at the nodes."))) ((-4454 . T) (-4455 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1111))) (-3783 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) +((-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1111))) (-2813 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (-128 S) ((|constructor| (NIL "\\spadtype{BinaryTree(S)} is the domain of all binary trees. A binary tree over \\spad{S} is either empty or has a \\spadfun{value} which is an \\spad{S} and a \\spadfun{right} and \\spadfun{left} which are both binary trees.")) (|binaryTree| (($ $ |#1| $) "\\spad{binaryTree(l,v,r)} creates a binary tree with value \\spad{v} with left subtree \\spad{l} and right subtree \\spad{r}.") (($ |#1|) "\\spad{binaryTree(v)} is an non-empty binary tree with value \\spad{v},{} and left and right empty."))) ((-4454 . T) (-4455 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1111))) (-3783 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) +((-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1111))) (-2813 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (-129) ((|constructor| (NIL "ByteBuffer provides datatype for buffers of bytes. This domain differs from PrimitiveArray Byte in that it is not as rigid as PrimitiveArray Byte. That is,{} the typical use of ByteBuffer is to pre-allocate a vector of Byte of some capacity \\spad{`n'}. The array can then store up to \\spad{`n'} bytes. The actual interesting bytes count (the length of the buffer) is therefore different from the capacity. The length is no more than the capacity,{} but it can be set dynamically as needed. This functionality is used for example when reading bytes from input/output devices where we use buffers to transfer data in and out of the system. Note: a value of type ByteBuffer is 0-based indexed,{} as opposed \\indented{6}{Vector,{} but not unlike PrimitiveArray Byte.}")) (|finiteAggregate| ((|attribute|) "A ByteBuffer object is a finite aggregate")) (|setLength!| (((|NonNegativeInteger|) $ (|NonNegativeInteger|)) "\\spad{setLength!(buf,n)} sets the number of active bytes in the `buf'. Error if \\spad{`n'} is more than the capacity.")) (|capacity| (((|NonNegativeInteger|) $) "\\spad{capacity(buf)} returns the pre-allocated maximum size of `buf'.")) (|byteBuffer| (($ (|NonNegativeInteger|)) "\\spad{byteBuffer(n)} creates a buffer of capacity \\spad{n},{} and length 0."))) ((-4455 . T) (-4454 . T)) -((-3783 (-12 (|HasCategory| (-130) (QUOTE (-858))) (|HasCategory| (-130) (LIST (QUOTE -315) (QUOTE (-130))))) (-12 (|HasCategory| (-130) (QUOTE (-1111))) (|HasCategory| (-130) (LIST (QUOTE -315) (QUOTE (-130)))))) (-3783 (-12 (|HasCategory| (-130) (QUOTE (-1111))) (|HasCategory| (-130) (LIST (QUOTE -315) (QUOTE (-130))))) (|HasCategory| (-130) (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| (-130) (LIST (QUOTE -622) (QUOTE (-544)))) (-3783 (|HasCategory| (-130) (QUOTE (-858))) (|HasCategory| (-130) (QUOTE (-1111)))) (|HasCategory| (-130) (QUOTE (-858))) (|HasCategory| (-572) (QUOTE (-858))) (|HasCategory| (-130) (QUOTE (-1111))) (|HasCategory| (-130) (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| (-130) (QUOTE (-1111))) (|HasCategory| (-130) (LIST (QUOTE -315) (QUOTE (-130)))))) +((-2813 (-12 (|HasCategory| (-130) (QUOTE (-858))) (|HasCategory| (-130) (LIST (QUOTE -315) (QUOTE (-130))))) (-12 (|HasCategory| (-130) (QUOTE (-1111))) (|HasCategory| (-130) (LIST (QUOTE -315) (QUOTE (-130)))))) (-2813 (-12 (|HasCategory| (-130) (QUOTE (-1111))) (|HasCategory| (-130) (LIST (QUOTE -315) (QUOTE (-130))))) (|HasCategory| (-130) (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| (-130) (LIST (QUOTE -622) (QUOTE (-544)))) (-2813 (|HasCategory| (-130) (QUOTE (-858))) (|HasCategory| (-130) (QUOTE (-1111)))) (|HasCategory| (-130) (QUOTE (-858))) (|HasCategory| (-572) (QUOTE (-858))) (|HasCategory| (-130) (QUOTE (-1111))) (|HasCategory| (-130) (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| (-130) (QUOTE (-1111))) (|HasCategory| (-130) (LIST (QUOTE -315) (QUOTE (-130)))))) (-130) ((|constructor| (NIL "Byte is the datatype of 8-bit sized unsigned integer values.")) (|sample| (($) "\\spad{sample} gives a sample datum of type Byte.")) (|bitior| (($ $ $) "bitor(\\spad{x},{}\\spad{y}) returns the bitwise `inclusive or' of \\spad{`x'} and \\spad{`y'}.")) (|bitand| (($ $ $) "\\spad{bitand(x,y)} returns the bitwise `and' of \\spad{`x'} and \\spad{`y'}.")) (|byte| (($ (|NonNegativeInteger|)) "\\spad{byte(x)} injects the unsigned integer value \\spad{`v'} into the Byte algebra. \\spad{`v'} must be non-negative and less than 256."))) NIL @@ -472,11 +472,11 @@ NIL ((|constructor| (NIL "Members of the domain CardinalNumber are values indicating the cardinality of sets,{} both finite and infinite. Arithmetic operations are defined on cardinal numbers as follows. \\blankline If \\spad{x = \\#X} and \\spad{y = \\#Y} then \\indented{2}{\\spad{x+y\\space{2}= \\#(X+Y)}\\space{3}\\tab{30}disjoint union} \\indented{2}{\\spad{x-y\\space{2}= \\#(X-Y)}\\space{3}\\tab{30}relative complement} \\indented{2}{\\spad{x*y\\space{2}= \\#(X*Y)}\\space{3}\\tab{30}cartesian product} \\indented{2}{\\spad{x**y = \\#(X**Y)}\\space{2}\\tab{30}\\spad{X**Y = \\{g| g:Y->X\\}}} \\blankline The non-negative integers have a natural construction as cardinals \\indented{2}{\\spad{0 = \\#\\{\\}},{} \\spad{1 = \\{0\\}},{} \\spad{2 = \\{0, 1\\}},{} ...,{} \\spad{n = \\{i| 0 <= i < n\\}}.} \\blankline That \\spad{0} acts as a zero for the multiplication of cardinals is equivalent to the axiom of choice. \\blankline The generalized continuum hypothesis asserts \\center{\\spad{2**Aleph i = Aleph(i+1)}} and is independent of the axioms of set theory [Goedel 1940]. \\blankline Three commonly encountered cardinal numbers are \\indented{3}{\\spad{a = \\#Z}\\space{7}\\tab{30}countable infinity} \\indented{3}{\\spad{c = \\#R}\\space{7}\\tab{30}the continuum} \\indented{3}{\\spad{f = \\#\\{g| g:[0,1]->R\\}}} \\blankline In this domain,{} these values are obtained using \\indented{3}{\\spad{a := Aleph 0},{} \\spad{c := 2**a},{} \\spad{f := 2**c}.} \\blankline")) (|generalizedContinuumHypothesisAssumed| (((|Boolean|) (|Boolean|)) "\\spad{generalizedContinuumHypothesisAssumed(bool)} is used to dictate whether the hypothesis is to be assumed.")) (|generalizedContinuumHypothesisAssumed?| (((|Boolean|)) "\\spad{generalizedContinuumHypothesisAssumed?()} tests if the hypothesis is currently assumed.")) (|countable?| (((|Boolean|) $) "\\spad{countable?(\\spad{a})} determines whether \\spad{a} is a countable cardinal,{} \\spadignore{i.e.} an integer or \\spad{Aleph 0}.")) (|finite?| (((|Boolean|) $) "\\spad{finite?(\\spad{a})} determines whether \\spad{a} is a finite cardinal,{} \\spadignore{i.e.} an integer.")) (|Aleph| (($ (|NonNegativeInteger|)) "\\spad{Aleph(n)} provides the named (infinite) cardinal number.")) (** (($ $ $) "\\spad{x**y} returns \\spad{\\#(X**Y)} where \\spad{X**Y} is defined \\indented{1}{as \\spad{\\{g| g:Y->X\\}}.}")) (- (((|Union| $ "failed") $ $) "\\spad{x - y} returns an element \\spad{z} such that \\spad{z+y=x} or \"failed\" if no such element exists.")) (|commutative| ((|attribute| "*") "a domain \\spad{D} has \\spad{commutative(\"*\")} if it has an operation \\spad{\"*\": (D,D) -> D} which is commutative."))) (((-4456 "*") . T)) NIL -(-136 |minix| -3436 S T$) +(-136 |minix| -4131 S T$) ((|constructor| (NIL "This package provides functions to enable conversion of tensors given conversion of the components.")) (|map| (((|CartesianTensor| |#1| |#2| |#4|) (|Mapping| |#4| |#3|) (|CartesianTensor| |#1| |#2| |#3|)) "\\spad{map(f,ts)} does a componentwise conversion of the tensor \\spad{ts} to a tensor with components of type \\spad{T}.")) (|reshape| (((|CartesianTensor| |#1| |#2| |#4|) (|List| |#4|) (|CartesianTensor| |#1| |#2| |#3|)) "\\spad{reshape(lt,ts)} organizes the list of components \\spad{lt} into a tensor with the same shape as \\spad{ts}."))) NIL NIL -(-137 |minix| -3436 R) +(-137 |minix| -4131 R) ((|constructor| (NIL "CartesianTensor(minix,{}dim,{}\\spad{R}) provides Cartesian tensors with components belonging to a commutative ring \\spad{R}. These tensors can have any number of indices. Each index takes values from \\spad{minix} to \\spad{minix + dim - 1}.")) (|sample| (($) "\\spad{sample()} returns an object of type \\%.")) (|unravel| (($ (|List| |#3|)) "\\spad{unravel(t)} produces a tensor from a list of components such that \\indented{2}{\\spad{unravel(ravel(t)) = t}.}")) (|ravel| (((|List| |#3|) $) "\\spad{ravel(t)} produces a list of components from a tensor such that \\indented{2}{\\spad{unravel(ravel(t)) = t}.}")) (|leviCivitaSymbol| (($) "\\spad{leviCivitaSymbol()} is the rank \\spad{dim} tensor defined by \\spad{leviCivitaSymbol()(i1,...idim) = +1/0/-1} if \\spad{i1,...,idim} is an even/is nota /is an odd permutation of \\spad{minix,...,minix+dim-1}.")) (|kroneckerDelta| (($) "\\spad{kroneckerDelta()} is the rank 2 tensor defined by \\indented{3}{\\spad{kroneckerDelta()(i,j)}} \\indented{6}{\\spad{= 1\\space{2}if i = j}} \\indented{6}{\\spad{= 0 if\\space{2}i \\~= j}}")) (|reindex| (($ $ (|List| (|Integer|))) "\\spad{reindex(t,[i1,...,idim])} permutes the indices of \\spad{t}. For example,{} if \\spad{r = reindex(t, [4,1,2,3])} for a rank 4 tensor \\spad{t},{} then \\spad{r} is the rank for tensor given by \\indented{4}{\\spad{r(i,j,k,l) = t(l,i,j,k)}.}")) (|transpose| (($ $ (|Integer|) (|Integer|)) "\\spad{transpose(t,i,j)} exchanges the \\spad{i}\\spad{-}th and \\spad{j}\\spad{-}th indices of \\spad{t}. For example,{} if \\spad{r = transpose(t,2,3)} for a rank 4 tensor \\spad{t},{} then \\spad{r} is the rank 4 tensor given by \\indented{4}{\\spad{r(i,j,k,l) = t(i,k,j,l)}.}") (($ $) "\\spad{transpose(t)} exchanges the first and last indices of \\spad{t}. For example,{} if \\spad{r = transpose(t)} for a rank 4 tensor \\spad{t},{} then \\spad{r} is the rank 4 tensor given by \\indented{4}{\\spad{r(i,j,k,l) = t(l,j,k,i)}.}")) (|contract| (($ $ (|Integer|) (|Integer|)) "\\spad{contract(t,i,j)} is the contraction of tensor \\spad{t} which sums along the \\spad{i}\\spad{-}th and \\spad{j}\\spad{-}th indices. For example,{} if \\spad{r = contract(t,1,3)} for a rank 4 tensor \\spad{t},{} then \\spad{r} is the rank 2 \\spad{(= 4 - 2)} tensor given by \\indented{4}{\\spad{r(i,j) = sum(h=1..dim,t(h,i,h,j))}.}") (($ $ (|Integer|) $ (|Integer|)) "\\spad{contract(t,i,s,j)} is the inner product of tenors \\spad{s} and \\spad{t} which sums along the \\spad{k1}\\spad{-}th index of \\spad{t} and the \\spad{k2}\\spad{-}th index of \\spad{s}. For example,{} if \\spad{r = contract(s,2,t,1)} for rank 3 tensors rank 3 tensors \\spad{s} and \\spad{t},{} then \\spad{r} is the rank 4 \\spad{(= 3 + 3 - 2)} tensor given by \\indented{4}{\\spad{r(i,j,k,l) = sum(h=1..dim,s(i,h,j)*t(h,k,l))}.}")) (* (($ $ $) "\\spad{s*t} is the inner product of the tensors \\spad{s} and \\spad{t} which contracts the last index of \\spad{s} with the first index of \\spad{t},{} \\spadignore{i.e.} \\indented{4}{\\spad{t*s = contract(t,rank t, s, 1)}} \\indented{4}{\\spad{t*s = sum(k=1..N, t[i1,..,iN,k]*s[k,j1,..,jM])}} This is compatible with the use of \\spad{M*v} to denote the matrix-vector inner product.")) (|product| (($ $ $) "\\spad{product(s,t)} is the outer product of the tensors \\spad{s} and \\spad{t}. For example,{} if \\spad{r = product(s,t)} for rank 2 tensors \\spad{s} and \\spad{t},{} then \\spad{r} is a rank 4 tensor given by \\indented{4}{\\spad{r(i,j,k,l) = s(i,j)*t(k,l)}.}")) (|elt| ((|#3| $ (|List| (|Integer|))) "\\spad{elt(t,[i1,...,iN])} gives a component of a rank \\spad{N} tensor.") ((|#3| $ (|Integer|) (|Integer|) (|Integer|) (|Integer|)) "\\spad{elt(t,i,j,k,l)} gives a component of a rank 4 tensor.") ((|#3| $ (|Integer|) (|Integer|) (|Integer|)) "\\spad{elt(t,i,j,k)} gives a component of a rank 3 tensor.") ((|#3| $ (|Integer|) (|Integer|)) "\\spad{elt(t,i,j)} gives a component of a rank 2 tensor.") ((|#3| $) "\\spad{elt(t)} gives the component of a rank 0 tensor.")) (|rank| (((|NonNegativeInteger|) $) "\\spad{rank(t)} returns the tensorial rank of \\spad{t} (that is,{} the number of indices). This is the same as the graded module degree.")) (|coerce| (($ (|List| $)) "\\spad{coerce([t_1,...,t_dim])} allows tensors to be constructed using lists.") (($ (|List| |#3|)) "\\spad{coerce([r_1,...,r_dim])} allows tensors to be constructed using lists.") (($ (|SquareMatrix| |#2| |#3|)) "\\spad{coerce(m)} views a matrix as a rank 2 tensor.") (($ (|DirectProduct| |#2| |#3|)) "\\spad{coerce(v)} views a vector as a rank 1 tensor."))) NIL NIL @@ -499,7 +499,7 @@ NIL (-142) ((|constructor| (NIL "This domain allows classes of characters to be defined and manipulated efficiently.")) (|alphanumeric| (($) "\\spad{alphanumeric()} returns the class of all characters for which \\spadfunFrom{alphanumeric?}{Character} is \\spad{true}.")) (|alphabetic| (($) "\\spad{alphabetic()} returns the class of all characters for which \\spadfunFrom{alphabetic?}{Character} is \\spad{true}.")) (|lowerCase| (($) "\\spad{lowerCase()} returns the class of all characters for which \\spadfunFrom{lowerCase?}{Character} is \\spad{true}.")) (|upperCase| (($) "\\spad{upperCase()} returns the class of all characters for which \\spadfunFrom{upperCase?}{Character} is \\spad{true}.")) (|hexDigit| (($) "\\spad{hexDigit()} returns the class of all characters for which \\spadfunFrom{hexDigit?}{Character} is \\spad{true}.")) (|digit| (($) "\\spad{digit()} returns the class of all characters for which \\spadfunFrom{digit?}{Character} is \\spad{true}.")) (|charClass| (($ (|List| (|Character|))) "\\spad{charClass(l)} creates a character class which contains exactly the characters given in the list \\spad{l}.") (($ (|String|)) "\\spad{charClass(s)} creates a character class which contains exactly the characters given in the string \\spad{s}."))) ((-4454 . T) (-4444 . T) (-4455 . T)) -((-3783 (-12 (|HasCategory| (-145) (QUOTE (-375))) (|HasCategory| (-145) (LIST (QUOTE -315) (QUOTE (-145))))) (-12 (|HasCategory| (-145) (QUOTE (-1111))) (|HasCategory| (-145) (LIST (QUOTE -315) (QUOTE (-145)))))) (|HasCategory| (-145) (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| (-145) (QUOTE (-375))) (|HasCategory| (-145) (QUOTE (-858))) (|HasCategory| (-145) (QUOTE (-1111))) (|HasCategory| (-145) (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| (-145) (QUOTE (-1111))) (|HasCategory| (-145) (LIST (QUOTE -315) (QUOTE (-145)))))) +((-2813 (-12 (|HasCategory| (-145) (QUOTE (-375))) (|HasCategory| (-145) (LIST (QUOTE -315) (QUOTE (-145))))) (-12 (|HasCategory| (-145) (QUOTE (-1111))) (|HasCategory| (-145) (LIST (QUOTE -315) (QUOTE (-145)))))) (|HasCategory| (-145) (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| (-145) (QUOTE (-375))) (|HasCategory| (-145) (QUOTE (-858))) (|HasCategory| (-145) (QUOTE (-1111))) (|HasCategory| (-145) (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| (-145) (QUOTE (-1111))) (|HasCategory| (-145) (LIST (QUOTE -315) (QUOTE (-145)))))) (-143 R Q A) ((|constructor| (NIL "CommonDenominator provides functions to compute the common denominator of a finite linear aggregate of elements of the quotient field of an integral domain.")) (|splitDenominator| (((|Record| (|:| |num| |#3|) (|:| |den| |#1|)) |#3|) "\\spad{splitDenominator([q1,...,qn])} returns \\spad{[[p1,...,pn], d]} such that \\spad{qi = pi/d} and \\spad{d} is a common denominator for the \\spad{qi}\\spad{'s}.")) (|clearDenominator| ((|#3| |#3|) "\\spad{clearDenominator([q1,...,qn])} returns \\spad{[p1,...,pn]} such that \\spad{qi = pi/d} where \\spad{d} is a common denominator for the \\spad{qi}\\spad{'s}.")) (|commonDenominator| ((|#1| |#3|) "\\spad{commonDenominator([q1,...,qn])} returns a common denominator \\spad{d} for \\spad{q1},{}...,{}\\spad{qn}."))) NIL @@ -524,7 +524,7 @@ NIL ((|constructor| (NIL "Rings of Characteristic Zero."))) ((-4451 . T)) NIL -(-149 -3636 UP UPUP) +(-149 -1384 UP UPUP) ((|constructor| (NIL "Tools to send a point to infinity on an algebraic curve.")) (|chvar| (((|Record| (|:| |func| |#3|) (|:| |poly| |#3|) (|:| |c1| (|Fraction| |#2|)) (|:| |c2| (|Fraction| |#2|)) (|:| |deg| (|NonNegativeInteger|))) |#3| |#3|) "\\spad{chvar(f(x,y), p(x,y))} returns \\spad{[g(z,t), q(z,t), c1(z), c2(z), n]} such that under the change of variable \\spad{x = c1(z)},{} \\spad{y = t * c2(z)},{} one gets \\spad{f(x,y) = g(z,t)}. The algebraic relation between \\spad{x} and \\spad{y} is \\spad{p(x, y) = 0}. The algebraic relation between \\spad{z} and \\spad{t} is \\spad{q(z, t) = 0}.")) (|eval| ((|#3| |#3| (|Fraction| |#2|) (|Fraction| |#2|)) "\\spad{eval(p(x,y), f(x), g(x))} returns \\spad{p(f(x), y * g(x))}.")) (|goodPoint| ((|#1| |#3| |#3|) "\\spad{goodPoint(p, q)} returns an integer a such that a is neither a pole of \\spad{p(x,y)} nor a branch point of \\spad{q(x,y) = 0}.")) (|rootPoly| (((|Record| (|:| |exponent| (|NonNegativeInteger|)) (|:| |coef| (|Fraction| |#2|)) (|:| |radicand| |#2|)) (|Fraction| |#2|) (|NonNegativeInteger|)) "\\spad{rootPoly(g, n)} returns \\spad{[m, c, P]} such that \\spad{c * g ** (1/n) = P ** (1/m)} thus if \\spad{y**n = g},{} then \\spad{z**m = P} where \\spad{z = c * y}.")) (|radPoly| (((|Union| (|Record| (|:| |radicand| (|Fraction| |#2|)) (|:| |deg| (|NonNegativeInteger|))) "failed") |#3|) "\\spad{radPoly(p(x, y))} returns \\spad{[c(x), n]} if \\spad{p} is of the form \\spad{y**n - c(x)},{} \"failed\" otherwise.")) (|mkIntegral| (((|Record| (|:| |coef| (|Fraction| |#2|)) (|:| |poly| |#3|)) |#3|) "\\spad{mkIntegral(p(x,y))} returns \\spad{[c(x), q(x,z)]} such that \\spad{z = c * y} is integral. The algebraic relation between \\spad{x} and \\spad{y} is \\spad{p(x, y) = 0}. The algebraic relation between \\spad{x} and \\spad{z} is \\spad{q(x, z) = 0}."))) NIL NIL @@ -564,7 +564,7 @@ NIL ((|constructor| (NIL "Color() specifies a domain of 27 colors provided in the \\Language{} system (the colors mix additively).")) (|color| (($ (|Integer|)) "\\spad{color(i)} returns a color of the indicated hue \\spad{i}.")) (|numberOfHues| (((|PositiveInteger|)) "\\spad{numberOfHues()} returns the number of total hues,{} set in totalHues.")) (|hue| (((|Integer|) $) "\\spad{hue(c)} returns the hue index of the indicated color \\spad{c}.")) (|blue| (($) "\\spad{blue()} returns the position of the blue hue from total hues.")) (|green| (($) "\\spad{green()} returns the position of the green hue from total hues.")) (|yellow| (($) "\\spad{yellow()} returns the position of the yellow hue from total hues.")) (|red| (($) "\\spad{red()} returns the position of the red hue from total hues.")) (+ (($ $ $) "\\spad{c1 + c2} additively mixes the two colors \\spad{c1} and \\spad{c2}.")) (* (($ (|DoubleFloat|) $) "\\spad{s * c},{} returns the color \\spad{c},{} whose weighted shade has been scaled by \\spad{s}.") (($ (|PositiveInteger|) $) "\\spad{s * c},{} returns the color \\spad{c},{} whose weighted shade has been scaled by \\spad{s}."))) NIL NIL -(-159 R -3636) +(-159 R -1384) ((|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 @@ -598,7 +598,7 @@ NIL ((|HasCategory| |#2| (QUOTE (-918))) (|HasCategory| |#2| (QUOTE (-553))) (|HasCategory| |#2| (QUOTE (-1013))) (|HasCategory| |#2| (QUOTE (-1214))) (|HasCategory| |#2| (QUOTE (-1071))) (|HasCategory| |#2| (QUOTE (-1033))) (|HasCategory| |#2| (QUOTE (-146))) (|HasCategory| |#2| (QUOTE (-148))) (|HasCategory| |#2| (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#2| (QUOTE (-370))) (|HasAttribute| |#2| (QUOTE -4450)) (|HasAttribute| |#2| (QUOTE -4453)) (|HasCategory| |#2| (QUOTE (-313))) (|HasCategory| |#2| (QUOTE (-564)))) (-167 R) ((|constructor| (NIL "This category represents the extension of a ring by a square root of \\spad{-1}.")) (|rationalIfCan| (((|Union| (|Fraction| (|Integer|)) "failed") $) "\\spad{rationalIfCan(x)} returns \\spad{x} as a rational number,{} or \"failed\" if \\spad{x} is not a rational number.")) (|rational| (((|Fraction| (|Integer|)) $) "\\spad{rational(x)} returns \\spad{x} as a rational number. Error: if \\spad{x} is not a rational number.")) (|rational?| (((|Boolean|) $) "\\spad{rational?(x)} tests if \\spad{x} is a rational number.")) (|polarCoordinates| (((|Record| (|:| |r| |#1|) (|:| |phi| |#1|)) $) "\\spad{polarCoordinates(x)} returns (\\spad{r},{} phi) such that \\spad{x} = \\spad{r} * exp(\\%\\spad{i} * phi).")) (|argument| ((|#1| $) "\\spad{argument(x)} returns the angle made by (0,{}1) and (0,{}\\spad{x}).")) (|abs| (($ $) "\\spad{abs(x)} returns the absolute value of \\spad{x} = sqrt(norm(\\spad{x})).")) (|exquo| (((|Union| $ "failed") $ |#1|) "\\spad{exquo(x, r)} returns the exact quotient of \\spad{x} by \\spad{r},{} or \"failed\" if \\spad{r} does not divide \\spad{x} exactly.")) (|norm| ((|#1| $) "\\spad{norm(x)} returns \\spad{x} * conjugate(\\spad{x})")) (|real| ((|#1| $) "\\spad{real(x)} returns real part of \\spad{x}.")) (|imag| ((|#1| $) "\\spad{imag(x)} returns imaginary part of \\spad{x}.")) (|conjugate| (($ $) "\\spad{conjugate(x + \\%i y)} returns \\spad{x} - \\%\\spad{i} \\spad{y}.")) (|imaginary| (($) "\\spad{imaginary()} = sqrt(\\spad{-1}) = \\%\\spad{i}.")) (|complex| (($ |#1| |#1|) "\\spad{complex(x,y)} constructs \\spad{x} + \\%i*y.") ((|attribute|) "indicates that \\% has sqrt(\\spad{-1})"))) -((-4447 -3783 (|has| |#1| (-564)) (-12 (|has| |#1| (-313)) (|has| |#1| (-918)))) (-4452 |has| |#1| (-370)) (-4446 |has| |#1| (-370)) (-4450 |has| |#1| (-6 -4450)) (-4453 |has| |#1| (-6 -4453)) (-4101 . T) ((-4456 "*") . T) (-4448 . T) (-4449 . T) (-4451 . T)) +((-4447 -2813 (|has| |#1| (-564)) (-12 (|has| |#1| (-313)) (|has| |#1| (-918)))) (-4452 |has| |#1| (-370)) (-4446 |has| |#1| (-370)) (-4450 |has| |#1| (-6 -4450)) (-4453 |has| |#1| (-6 -4453)) (-3559 . T) ((-4456 "*") . T) (-4448 . T) (-4449 . T) (-4451 . T)) NIL (-168 RR PR) ((|constructor| (NIL "\\indented{1}{Author:} Date Created: Date Last Updated: Basic Functions: Related Constructors: Complex,{} UnivariatePolynomial Also See: AMS Classifications: Keywords: complex,{} polynomial factorization,{} factor References:")) (|factor| (((|Factored| |#2|) |#2|) "\\spad{factor(p)} factorizes the polynomial \\spad{p} with complex coefficients."))) @@ -614,8 +614,8 @@ NIL NIL (-171 R) ((|constructor| (NIL "\\spadtype {Complex(R)} creates the domain of elements of the form \\spad{a + b * i} where \\spad{a} and \\spad{b} come from the ring \\spad{R},{} and \\spad{i} is a new element such that \\spad{i**2 = -1}."))) -((-4447 -3783 (|has| |#1| (-564)) (-12 (|has| |#1| (-313)) (|has| |#1| (-918)))) (-4452 |has| |#1| (-370)) (-4446 |has| |#1| (-370)) (-4450 |has| |#1| (-6 -4450)) (-4453 |has| |#1| (-6 -4453)) (-4101 . T) ((-4456 "*") . T) (-4448 . T) (-4449 . T) (-4451 . T)) -((|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-356))) (-3783 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-356)))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-375))) (-3783 (-12 (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| |#1| (QUOTE (-356)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-356)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -522) (QUOTE (-1188)) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-356)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-356)))) (-12 (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-356)))) (-12 (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-356)))) (|HasCategory| |#1| (QUOTE (-237))) (-12 (|HasCategory| |#1| (QUOTE (-313))) (|HasCategory| |#1| (QUOTE (-356)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-356)))) (-12 (|HasCategory| |#1| (QUOTE (-356))) (|HasCategory| |#1| (LIST (QUOTE -292) (|devaluate| |#1|) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-356))) (|HasCategory| |#1| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#1| (QUOTE (-356))) (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188))))) (-12 (|HasCategory| |#1| (QUOTE (-356))) (|HasCategory| |#1| (QUOTE (-375)))) (-12 (|HasCategory| |#1| (QUOTE (-356))) (|HasCategory| |#1| (QUOTE (-564)))) (-12 (|HasCategory| |#1| (QUOTE (-356))) (|HasCategory| |#1| (QUOTE (-836)))) (-12 (|HasCategory| |#1| (QUOTE (-356))) (|HasCategory| |#1| (QUOTE (-1033)))) (-12 (|HasCategory| |#1| (QUOTE (-356))) (|HasCategory| |#1| (QUOTE (-1214)))) (-12 (|HasCategory| |#1| (QUOTE (-356))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544))))) (-12 (|HasCategory| |#1| (QUOTE (-356))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-356))) (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-386))))) (-12 (|HasCategory| |#1| (QUOTE (-356))) (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-572))))) (-12 (|HasCategory| |#1| (QUOTE (-356))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))))) (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#1| (LIST (QUOTE -647) (QUOTE (-572)))) (-3783 (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))) (-3783 (-12 (|HasCategory| |#1| (QUOTE (-313))) (|HasCategory| |#1| (QUOTE (-918)))) (|HasCategory| |#1| (QUOTE (-370))) (-12 (|HasCategory| |#1| (QUOTE (-356))) (|HasCategory| |#1| (QUOTE (-918))))) (-3783 (-12 (|HasCategory| |#1| (QUOTE (-313))) (|HasCategory| |#1| (QUOTE (-918)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-918)))) (-12 (|HasCategory| |#1| (QUOTE (-356))) (|HasCategory| |#1| (QUOTE (-918))))) (-3783 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-564)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (QUOTE (-1214)))) (|HasCategory| |#1| (QUOTE (-1214))) (|HasCategory| |#1| (QUOTE (-1033))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544)))) (-3783 (|HasCategory| |#1| (QUOTE (-313))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-356))) (|HasCategory| |#1| (QUOTE (-564)))) (-3783 (|HasCategory| |#1| (QUOTE (-313))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-356)))) (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| |#1| (LIST (QUOTE -522) (QUOTE (-1188)) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -292) (|devaluate| |#1|) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-836))) (|HasCategory| |#1| (QUOTE (-1071))) (-12 (|HasCategory| |#1| (QUOTE (-1071))) (|HasCategory| |#1| (QUOTE (-1214)))) (|HasCategory| |#1| (QUOTE (-553))) (|HasCategory| |#1| (QUOTE (-313))) (|HasCategory| |#1| (QUOTE (-918))) (-3783 (-12 (|HasCategory| |#1| (QUOTE (-313))) (|HasCategory| |#1| (QUOTE (-918)))) (|HasCategory| |#1| (QUOTE (-370)))) (-3783 (-12 (|HasCategory| |#1| (QUOTE (-313))) (|HasCategory| |#1| (QUOTE (-918)))) (|HasCategory| |#1| (QUOTE (-564)))) (|HasCategory| |#1| (QUOTE (-237))) (-12 (|HasCategory| |#1| (QUOTE (-313))) (|HasCategory| |#1| (QUOTE (-918)))) (|HasAttribute| |#1| (QUOTE -4450)) (|HasAttribute| |#1| (QUOTE -4453)) (-12 (|HasCategory| |#1| (QUOTE (-237))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188))))) (-3783 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-313))) (|HasCategory| |#1| (QUOTE (-918)))) (|HasCategory| |#1| (QUOTE (-146)))) (-3783 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-313))) (|HasCategory| |#1| (QUOTE (-918)))) (|HasCategory| |#1| (QUOTE (-356))))) +((-4447 -2813 (|has| |#1| (-564)) (-12 (|has| |#1| (-313)) (|has| |#1| (-918)))) (-4452 |has| |#1| (-370)) (-4446 |has| |#1| (-370)) (-4450 |has| |#1| (-6 -4450)) (-4453 |has| |#1| (-6 -4453)) (-3559 . T) ((-4456 "*") . T) (-4448 . T) (-4449 . T) (-4451 . T)) +((|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-356))) (-2813 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-356)))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-375))) (-2813 (-12 (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| |#1| (QUOTE (-356)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-356)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -522) (QUOTE (-1188)) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-356)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-356)))) (-12 (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-356)))) (-12 (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-356)))) (|HasCategory| |#1| (QUOTE (-237))) (-12 (|HasCategory| |#1| (QUOTE (-313))) (|HasCategory| |#1| (QUOTE (-356)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-356)))) (-12 (|HasCategory| |#1| (QUOTE (-356))) (|HasCategory| |#1| (LIST (QUOTE -292) (|devaluate| |#1|) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-356))) (|HasCategory| |#1| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#1| (QUOTE (-356))) (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188))))) (-12 (|HasCategory| |#1| (QUOTE (-356))) (|HasCategory| |#1| (QUOTE (-375)))) (-12 (|HasCategory| |#1| (QUOTE (-356))) (|HasCategory| |#1| (QUOTE (-564)))) (-12 (|HasCategory| |#1| (QUOTE (-356))) (|HasCategory| |#1| (QUOTE (-836)))) (-12 (|HasCategory| |#1| (QUOTE (-356))) (|HasCategory| |#1| (QUOTE (-1033)))) (-12 (|HasCategory| |#1| (QUOTE (-356))) (|HasCategory| |#1| (QUOTE (-1214)))) (-12 (|HasCategory| |#1| (QUOTE (-356))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544))))) (-12 (|HasCategory| |#1| (QUOTE (-356))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-356))) (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-386))))) (-12 (|HasCategory| |#1| (QUOTE (-356))) (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-572))))) (-12 (|HasCategory| |#1| (QUOTE (-356))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))))) (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#1| (LIST (QUOTE -647) (QUOTE (-572)))) (-2813 (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))) (-2813 (-12 (|HasCategory| |#1| (QUOTE (-313))) (|HasCategory| |#1| (QUOTE (-918)))) (|HasCategory| |#1| (QUOTE (-370))) (-12 (|HasCategory| |#1| (QUOTE (-356))) (|HasCategory| |#1| (QUOTE (-918))))) (-2813 (-12 (|HasCategory| |#1| (QUOTE (-313))) (|HasCategory| |#1| (QUOTE (-918)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-918)))) (-12 (|HasCategory| |#1| (QUOTE (-356))) (|HasCategory| |#1| (QUOTE (-918))))) (-2813 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-564)))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (QUOTE (-1214)))) (|HasCategory| |#1| (QUOTE (-1214))) (|HasCategory| |#1| (QUOTE (-1033))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544)))) (-2813 (|HasCategory| |#1| (QUOTE (-313))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-356))) (|HasCategory| |#1| (QUOTE (-564)))) (-2813 (|HasCategory| |#1| (QUOTE (-313))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-356)))) (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| |#1| (LIST (QUOTE -522) (QUOTE (-1188)) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -292) (|devaluate| |#1|) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-836))) (|HasCategory| |#1| (QUOTE (-1071))) (-12 (|HasCategory| |#1| (QUOTE (-1071))) (|HasCategory| |#1| (QUOTE (-1214)))) (|HasCategory| |#1| (QUOTE (-553))) (|HasCategory| |#1| (QUOTE (-313))) (|HasCategory| |#1| (QUOTE (-918))) (-2813 (-12 (|HasCategory| |#1| (QUOTE (-313))) (|HasCategory| |#1| (QUOTE (-918)))) (|HasCategory| |#1| (QUOTE (-370)))) (-2813 (-12 (|HasCategory| |#1| (QUOTE (-313))) (|HasCategory| |#1| (QUOTE (-918)))) (|HasCategory| |#1| (QUOTE (-564)))) (|HasCategory| |#1| (QUOTE (-237))) (-12 (|HasCategory| |#1| (QUOTE (-313))) (|HasCategory| |#1| (QUOTE (-918)))) (|HasAttribute| |#1| (QUOTE -4450)) (|HasAttribute| |#1| (QUOTE -4453)) (-12 (|HasCategory| |#1| (QUOTE (-237))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188))))) (-2813 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-313))) (|HasCategory| |#1| (QUOTE (-918)))) (|HasCategory| |#1| (QUOTE (-146)))) (-2813 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-313))) (|HasCategory| |#1| (QUOTE (-918)))) (|HasCategory| |#1| (QUOTE (-356))))) (-172 R S CS) ((|constructor| (NIL "This package supports converting complex expressions to patterns")) (|convert| (((|Pattern| |#1|) |#3|) "\\spad{convert(cs)} converts the complex expression \\spad{cs} to a pattern"))) NIL @@ -688,7 +688,7 @@ NIL ((|constructor| (NIL "This domain provides implementations for constructors.")) (|findConstructor| (((|Maybe| $) (|Identifier|)) "\\spad{findConstructor(s)} attempts to find a constructor named \\spad{s}. If successful,{} returns that constructor; otherwise,{} returns \\spad{nothing}."))) NIL NIL -(-190 R -3636) +(-190 R -1384) ((|constructor| (NIL "\\spadtype{ComplexTrigonometricManipulations} provides function that compute the real and imaginary parts of complex functions.")) (|complexForm| (((|Complex| (|Expression| |#1|)) |#2|) "\\spad{complexForm(f)} returns \\spad{[real f, imag f]}.")) (|trigs| ((|#2| |#2|) "\\spad{trigs(f)} rewrites all the complex logs and exponentials appearing in \\spad{f} in terms of trigonometric functions.")) (|real?| (((|Boolean|) |#2|) "\\spad{real?(f)} returns \\spad{true} if \\spad{f = real f}.")) (|imag| (((|Expression| |#1|) |#2|) "\\spad{imag(f)} returns the imaginary part of \\spad{f} where \\spad{f} is a complex function.")) (|real| (((|Expression| |#1|) |#2|) "\\spad{real(f)} returns the real part of \\spad{f} where \\spad{f} is a complex function.")) (|complexElementary| ((|#2| |#2| (|Symbol|)) "\\spad{complexElementary(f, x)} rewrites the kernels of \\spad{f} involving \\spad{x} in terms of the 2 fundamental complex transcendental elementary functions: \\spad{log, exp}.") ((|#2| |#2|) "\\spad{complexElementary(f)} rewrites \\spad{f} in terms of the 2 fundamental complex transcendental elementary functions: \\spad{log, exp}.")) (|complexNormalize| ((|#2| |#2| (|Symbol|)) "\\spad{complexNormalize(f, x)} rewrites \\spad{f} using the least possible number of complex independent kernels involving \\spad{x}.") ((|#2| |#2|) "\\spad{complexNormalize(f)} rewrites \\spad{f} using the least possible number of complex independent kernels."))) NIL NIL @@ -796,23 +796,23 @@ NIL ((|constructor| (NIL "\\indented{1}{This domain implements a simple view of a database whose fields are} indexed by symbols")) (- (($ $ $) "\\spad{db1-db2} returns the difference of databases \\spad{db1} and \\spad{db2} \\spadignore{i.e.} consisting of elements in \\spad{db1} but not in \\spad{db2}")) (+ (($ $ $) "\\spad{db1+db2} returns the merge of databases \\spad{db1} and \\spad{db2}")) (|fullDisplay| (((|Void|) $ (|PositiveInteger|) (|PositiveInteger|)) "\\spad{fullDisplay(db,start,end )} prints full details of entries in the range \\axiom{\\spad{start}..end} in \\axiom{\\spad{db}}.") (((|Void|) $) "\\spad{fullDisplay(db)} prints full details of each entry in \\axiom{\\spad{db}}.") (((|Void|) $) "\\spad{fullDisplay(x)} displays \\spad{x} in detail")) (|display| (((|Void|) $) "\\spad{display(db)} prints a summary line for each entry in \\axiom{\\spad{db}}.") (((|Void|) $) "\\spad{display(x)} displays \\spad{x} in some form")) (|elt| (((|DataList| (|String|)) $ (|Symbol|)) "\\spad{elt(db,s)} returns the \\axiom{\\spad{s}} field of each element of \\axiom{\\spad{db}}.") (($ $ (|QueryEquation|)) "\\spad{elt(db,q)} returns all elements of \\axiom{\\spad{db}} which satisfy \\axiom{\\spad{q}}.") (((|String|) $ (|Symbol|)) "\\spad{elt(x,s)} returns an element of \\spad{x} indexed by \\spad{s}"))) NIL NIL -(-217 -3636 UP UPUP R) +(-217 -1384 UP UPUP R) ((|constructor| (NIL "This package provides functions for computing the residues of a function on an algebraic curve.")) (|doubleResultant| ((|#2| |#4| (|Mapping| |#2| |#2|)) "\\spad{doubleResultant(f, ')} returns \\spad{p}(\\spad{x}) whose roots are rational multiples of the residues of \\spad{f} at all its finite poles. Argument ' is the derivation to use."))) NIL NIL -(-218 -3636 FP) +(-218 -1384 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 (-219) ((|constructor| (NIL "This domain allows rational numbers to be presented as repeating decimal expansions.")) (|decimal| (($ (|Fraction| (|Integer|))) "\\spad{decimal(r)} converts a rational number to a decimal expansion.")) (|fractionPart| (((|Fraction| (|Integer|)) $) "\\spad{fractionPart(d)} returns the fractional part of a decimal expansion."))) ((-4446 . T) (-4452 . T) (-4447 . T) ((-4456 "*") . T) (-4448 . T) (-4449 . T) (-4451 . T)) -((|HasCategory| (-572) (QUOTE (-918))) (|HasCategory| (-572) (LIST (QUOTE -1049) (QUOTE (-1188)))) (|HasCategory| (-572) (QUOTE (-146))) (|HasCategory| (-572) (QUOTE (-148))) (|HasCategory| (-572) (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| (-572) (QUOTE (-1033))) (|HasCategory| (-572) (QUOTE (-828))) (-3783 (|HasCategory| (-572) (QUOTE (-828))) (|HasCategory| (-572) (QUOTE (-858)))) (|HasCategory| (-572) (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| (-572) (QUOTE (-1163))) (|HasCategory| (-572) (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| (-572) (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| (-572) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| (-572) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| (-572) (QUOTE (-237))) (|HasCategory| (-572) (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| (-572) (LIST (QUOTE -522) (QUOTE (-1188)) (QUOTE (-572)))) (|HasCategory| (-572) (LIST (QUOTE -315) (QUOTE (-572)))) (|HasCategory| (-572) (LIST (QUOTE -292) (QUOTE (-572)) (QUOTE (-572)))) (|HasCategory| (-572) (QUOTE (-313))) (|HasCategory| (-572) (QUOTE (-553))) (|HasCategory| (-572) (QUOTE (-858))) (|HasCategory| (-572) (LIST (QUOTE -647) (QUOTE (-572)))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| (-572) (QUOTE (-918)))) (-3783 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| (-572) (QUOTE (-918)))) (|HasCategory| (-572) (QUOTE (-146))))) +((|HasCategory| (-572) (QUOTE (-918))) (|HasCategory| (-572) (LIST (QUOTE -1049) (QUOTE (-1188)))) (|HasCategory| (-572) (QUOTE (-146))) (|HasCategory| (-572) (QUOTE (-148))) (|HasCategory| (-572) (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| (-572) (QUOTE (-1033))) (|HasCategory| (-572) (QUOTE (-828))) (-2813 (|HasCategory| (-572) (QUOTE (-828))) (|HasCategory| (-572) (QUOTE (-858)))) (|HasCategory| (-572) (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| (-572) (QUOTE (-1163))) (|HasCategory| (-572) (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| (-572) (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| (-572) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| (-572) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| (-572) (QUOTE (-237))) (|HasCategory| (-572) (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| (-572) (LIST (QUOTE -522) (QUOTE (-1188)) (QUOTE (-572)))) (|HasCategory| (-572) (LIST (QUOTE -315) (QUOTE (-572)))) (|HasCategory| (-572) (LIST (QUOTE -292) (QUOTE (-572)) (QUOTE (-572)))) (|HasCategory| (-572) (QUOTE (-313))) (|HasCategory| (-572) (QUOTE (-553))) (|HasCategory| (-572) (QUOTE (-858))) (|HasCategory| (-572) (LIST (QUOTE -647) (QUOTE (-572)))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| (-572) (QUOTE (-918)))) (-2813 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| (-572) (QUOTE (-918)))) (|HasCategory| (-572) (QUOTE (-146))))) (-220) ((|constructor| (NIL "This domain represents the syntax of a definition.")) (|body| (((|SpadAst|) $) "\\spad{body(d)} returns the right hand side of the definition \\spad{`d'}.")) (|signature| (((|Signature|) $) "\\spad{signature(d)} returns the signature of the operation being defined. Note that this list may be partial in that it contains only the types actually specified in the definition.")) (|head| (((|HeadAst|) $) "\\spad{head(d)} returns the head of the definition \\spad{`d'}. This is a list of identifiers starting with the name of the operation followed by the name of the parameters,{} if any."))) NIL NIL -(-221 R -3636) +(-221 R -1384) ((|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 @@ -827,18 +827,18 @@ NIL (-224 S) ((|constructor| (NIL "Linked list implementation of a Dequeue")) (|dequeue| (($ (|List| |#1|)) "\\spad{dequeue([x,y,...,z])} creates a dequeue with first (top or front) element \\spad{x},{} second element \\spad{y},{}...,{}and last (bottom or back) element \\spad{z}."))) ((-4454 . T) (-4455 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1111))) (-3783 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) +((-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1111))) (-2813 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (-225 |CoefRing| |listIndVar|) ((|constructor| (NIL "The deRham complex of Euclidean space,{} that is,{} the class of differential forms of arbitary degree over a coefficient ring. See Flanders,{} Harley,{} Differential Forms,{} With Applications to the Physical Sciences,{} New York,{} Academic Press,{} 1963.")) (|exteriorDifferential| (($ $) "\\spad{exteriorDifferential(df)} returns the exterior derivative (gradient,{} curl,{} divergence,{} ...) of the differential form \\spad{df}.")) (|totalDifferential| (($ (|Expression| |#1|)) "\\spad{totalDifferential(x)} returns the total differential (gradient) form for element \\spad{x}.")) (|map| (($ (|Mapping| (|Expression| |#1|) (|Expression| |#1|)) $) "\\spad{map(f,df)} replaces each coefficient \\spad{x} of differential form \\spad{df} by \\spad{f(x)}.")) (|degree| (((|Integer|) $) "\\spad{degree(df)} returns the homogeneous degree of differential form \\spad{df}.")) (|retractable?| (((|Boolean|) $) "\\spad{retractable?(df)} tests if differential form \\spad{df} is a 0-form,{} \\spadignore{i.e.} if degree(\\spad{df}) = 0.")) (|homogeneous?| (((|Boolean|) $) "\\spad{homogeneous?(df)} tests if all of the terms of differential form \\spad{df} have the same degree.")) (|generator| (($ (|NonNegativeInteger|)) "\\spad{generator(n)} returns the \\spad{n}th basis term for a differential form.")) (|coefficient| (((|Expression| |#1|) $ $) "\\spad{coefficient(df,u)},{} where \\spad{df} is a differential form,{} returns the coefficient of \\spad{df} containing the basis term \\spad{u} if such a term exists,{} and 0 otherwise.")) (|reductum| (($ $) "\\spad{reductum(df)},{} where \\spad{df} is a differential form,{} returns \\spad{df} minus the leading term of \\spad{df} if \\spad{df} has two or more terms,{} and 0 otherwise.")) (|leadingBasisTerm| (($ $) "\\spad{leadingBasisTerm(df)} returns the leading basis term of differential form \\spad{df}.")) (|leadingCoefficient| (((|Expression| |#1|) $) "\\spad{leadingCoefficient(df)} returns the leading coefficient of differential form \\spad{df}."))) ((-4451 . T)) NIL -(-226 R -3636) +(-226 R -1384) ((|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 (-227) ((|constructor| (NIL "\\indented{1}{\\spadtype{DoubleFloat} is intended to make accessible} hardware floating point arithmetic in \\Language{},{} either native double precision,{} or IEEE. On most machines,{} there will be hardware support for the arithmetic operations: \\spadfunFrom{+}{DoubleFloat},{} \\spadfunFrom{*}{DoubleFloat},{} \\spadfunFrom{/}{DoubleFloat} and possibly also the \\spadfunFrom{sqrt}{DoubleFloat} operation. The operations \\spadfunFrom{exp}{DoubleFloat},{} \\spadfunFrom{log}{DoubleFloat},{} \\spadfunFrom{sin}{DoubleFloat},{} \\spadfunFrom{cos}{DoubleFloat},{} \\spadfunFrom{atan}{DoubleFloat} are normally coded in software based on minimax polynomial/rational approximations. Note that under Lisp/VM,{} \\spadfunFrom{atan}{DoubleFloat} is not available at this time. Some general comments about the accuracy of the operations: the operations \\spadfunFrom{+}{DoubleFloat},{} \\spadfunFrom{*}{DoubleFloat},{} \\spadfunFrom{/}{DoubleFloat} and \\spadfunFrom{sqrt}{DoubleFloat} are expected to be fully accurate. The operations \\spadfunFrom{exp}{DoubleFloat},{} \\spadfunFrom{log}{DoubleFloat},{} \\spadfunFrom{sin}{DoubleFloat},{} \\spadfunFrom{cos}{DoubleFloat} and \\spadfunFrom{atan}{DoubleFloat} are not expected to be fully accurate. In particular,{} \\spadfunFrom{sin}{DoubleFloat} and \\spadfunFrom{cos}{DoubleFloat} will lose all precision for large arguments. \\blankline The \\spadtype{Float} domain provides an alternative to the \\spad{DoubleFloat} domain. It provides an arbitrary precision model of floating point arithmetic. This means that accuracy problems like those above are eliminated by increasing the working precision where necessary. \\spadtype{Float} provides some special functions such as \\spadfunFrom{erf}{DoubleFloat},{} the error function in addition to the elementary functions. The disadvantage of \\spadtype{Float} is that it is much more expensive than small floats when the latter can be used.")) (|rationalApproximation| (((|Fraction| (|Integer|)) $ (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{rationalApproximation(f, n, b)} computes a rational approximation \\spad{r} to \\spad{f} with relative error \\spad{< b**(-n)} (that is,{} \\spad{|(r-f)/f| < b**(-n)}).") (((|Fraction| (|Integer|)) $ (|NonNegativeInteger|)) "\\spad{rationalApproximation(f, n)} computes a rational approximation \\spad{r} to \\spad{f} with relative error \\spad{< 10**(-n)}.")) (|Beta| (($ $ $) "\\spad{Beta(x,y)} is \\spad{Gamma(x) * Gamma(y)/Gamma(x+y)}.")) (|Gamma| (($ $) "\\spad{Gamma(x)} is the Euler Gamma function.")) (|atan| (($ $ $) "\\spad{atan(x,y)} computes the arc tangent from \\spad{x} with phase \\spad{y}.")) (|log10| (($ $) "\\spad{log10(x)} computes the logarithm with base 10 for \\spad{x}.")) (|log2| (($ $) "\\spad{log2(x)} computes the logarithm with base 2 for \\spad{x}.")) (|exp1| (($) "\\spad{exp1()} returns the natural log base \\spad{2.718281828...}.")) (** (($ $ $) "\\spad{x ** y} returns the \\spad{y}th power of \\spad{x} (equal to \\spad{exp(y log x)}).")) (/ (($ $ (|Integer|)) "\\spad{x / i} computes the division from \\spad{x} by an integer \\spad{i}."))) -((-4091 . T) (-4446 . T) (-4452 . T) (-4447 . T) ((-4456 "*") . T) (-4448 . T) (-4449 . T) (-4451 . T)) +((-3548 . T) (-4446 . T) (-4452 . T) (-4447 . T) ((-4456 "*") . T) (-4448 . T) (-4449 . T) (-4451 . T)) NIL (-228) ((|constructor| (NIL "This package provides special functions for double precision real and complex floating point.")) (|hypergeometric0F1| (((|Complex| (|DoubleFloat|)) (|Complex| (|DoubleFloat|)) (|Complex| (|DoubleFloat|))) "\\spad{hypergeometric0F1(c,z)} is the hypergeometric function \\spad{0F1(; c; z)}.") (((|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) "\\spad{hypergeometric0F1(c,z)} is the hypergeometric function \\spad{0F1(; c; z)}.")) (|airyBi| (((|Complex| (|DoubleFloat|)) (|Complex| (|DoubleFloat|))) "\\spad{airyBi(x)} is the Airy function \\spad{Bi(x)}. This function satisfies the differential equation: \\indented{2}{\\spad{Bi''(x) - x * Bi(x) = 0}.}") (((|DoubleFloat|) (|DoubleFloat|)) "\\spad{airyBi(x)} is the Airy function \\spad{Bi(x)}. This function satisfies the differential equation: \\indented{2}{\\spad{Bi''(x) - x * Bi(x) = 0}.}")) (|airyAi| (((|DoubleFloat|) (|DoubleFloat|)) "\\spad{airyAi(x)} is the Airy function \\spad{Ai(x)}. This function satisfies the differential equation: \\indented{2}{\\spad{Ai''(x) - x * Ai(x) = 0}.}") (((|Complex| (|DoubleFloat|)) (|Complex| (|DoubleFloat|))) "\\spad{airyAi(x)} is the Airy function \\spad{Ai(x)}. This function satisfies the differential equation: \\indented{2}{\\spad{Ai''(x) - x * Ai(x) = 0}.}")) (|besselK| (((|Complex| (|DoubleFloat|)) (|Complex| (|DoubleFloat|)) (|Complex| (|DoubleFloat|))) "\\spad{besselK(v,x)} is the modified Bessel function of the first kind,{} \\spad{K(v,x)}. This function satisfies the differential equation: \\indented{2}{\\spad{x^2 w''(x) + x w'(x) - (x^2+v^2)w(x) = 0}.} Note: The default implmentation uses the relation \\indented{2}{\\spad{K(v,x) = \\%pi/2*(I(-v,x) - I(v,x))/sin(v*\\%pi)}} so is not valid for integer values of \\spad{v}.") (((|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) "\\spad{besselK(v,x)} is the modified Bessel function of the first kind,{} \\spad{K(v,x)}. This function satisfies the differential equation: \\indented{2}{\\spad{x^2 w''(x) + x w'(x) - (x^2+v^2)w(x) = 0}.} Note: The default implmentation uses the relation \\indented{2}{\\spad{K(v,x) = \\%pi/2*(I(-v,x) - I(v,x))/sin(v*\\%pi)}.} so is not valid for integer values of \\spad{v}.")) (|besselI| (((|Complex| (|DoubleFloat|)) (|Complex| (|DoubleFloat|)) (|Complex| (|DoubleFloat|))) "\\spad{besselI(v,x)} is the modified Bessel function of the first kind,{} \\spad{I(v,x)}. This function satisfies the differential equation: \\indented{2}{\\spad{x^2 w''(x) + x w'(x) - (x^2+v^2)w(x) = 0}.}") (((|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) "\\spad{besselI(v,x)} is the modified Bessel function of the first kind,{} \\spad{I(v,x)}. This function satisfies the differential equation: \\indented{2}{\\spad{x^2 w''(x) + x w'(x) - (x^2+v^2)w(x) = 0}.}")) (|besselY| (((|Complex| (|DoubleFloat|)) (|Complex| (|DoubleFloat|)) (|Complex| (|DoubleFloat|))) "\\spad{besselY(v,x)} is the Bessel function of the second kind,{} \\spad{Y(v,x)}. This function satisfies the differential equation: \\indented{2}{\\spad{x^2 w''(x) + x w'(x) + (x^2-v^2)w(x) = 0}.} Note: The default implmentation uses the relation \\indented{2}{\\spad{Y(v,x) = (J(v,x) cos(v*\\%pi) - J(-v,x))/sin(v*\\%pi)}} so is not valid for integer values of \\spad{v}.") (((|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) "\\spad{besselY(v,x)} is the Bessel function of the second kind,{} \\spad{Y(v,x)}. This function satisfies the differential equation: \\indented{2}{\\spad{x^2 w''(x) + x w'(x) + (x^2-v^2)w(x) = 0}.} Note: The default implmentation uses the relation \\indented{2}{\\spad{Y(v,x) = (J(v,x) cos(v*\\%pi) - J(-v,x))/sin(v*\\%pi)}} so is not valid for integer values of \\spad{v}.")) (|besselJ| (((|Complex| (|DoubleFloat|)) (|Complex| (|DoubleFloat|)) (|Complex| (|DoubleFloat|))) "\\spad{besselJ(v,x)} is the Bessel function of the first kind,{} \\spad{J(v,x)}. This function satisfies the differential equation: \\indented{2}{\\spad{x^2 w''(x) + x w'(x) + (x^2-v^2)w(x) = 0}.}") (((|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) "\\spad{besselJ(v,x)} is the Bessel function of the first kind,{} \\spad{J(v,x)}. This function satisfies the differential equation: \\indented{2}{\\spad{x^2 w''(x) + x w'(x) + (x^2-v^2)w(x) = 0}.}")) (|polygamma| (((|Complex| (|DoubleFloat|)) (|NonNegativeInteger|) (|Complex| (|DoubleFloat|))) "\\spad{polygamma(n, x)} is the \\spad{n}-th derivative of \\spad{digamma(x)}.") (((|DoubleFloat|) (|NonNegativeInteger|) (|DoubleFloat|)) "\\spad{polygamma(n, x)} is the \\spad{n}-th derivative of \\spad{digamma(x)}.")) (|digamma| (((|Complex| (|DoubleFloat|)) (|Complex| (|DoubleFloat|))) "\\spad{digamma(x)} is the function,{} \\spad{psi(x)},{} defined by \\indented{2}{\\spad{psi(x) = Gamma'(x)/Gamma(x)}.}") (((|DoubleFloat|) (|DoubleFloat|)) "\\spad{digamma(x)} is the function,{} \\spad{psi(x)},{} defined by \\indented{2}{\\spad{psi(x) = Gamma'(x)/Gamma(x)}.}")) (|logGamma| (((|Complex| (|DoubleFloat|)) (|Complex| (|DoubleFloat|))) "\\spad{logGamma(x)} is the natural log of \\spad{Gamma(x)}. This can often be computed even if \\spad{Gamma(x)} cannot.") (((|DoubleFloat|) (|DoubleFloat|)) "\\spad{logGamma(x)} is the natural log of \\spad{Gamma(x)}. This can often be computed even if \\spad{Gamma(x)} cannot.")) (|Beta| (((|Complex| (|DoubleFloat|)) (|Complex| (|DoubleFloat|)) (|Complex| (|DoubleFloat|))) "\\spad{Beta(x, y)} is the Euler beta function,{} \\spad{B(x,y)},{} defined by \\indented{2}{\\spad{Beta(x,y) = integrate(t^(x-1)*(1-t)^(y-1), t=0..1)}.} This is related to \\spad{Gamma(x)} by \\indented{2}{\\spad{Beta(x,y) = Gamma(x)*Gamma(y) / Gamma(x + y)}.}") (((|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) "\\spad{Beta(x, y)} is the Euler beta function,{} \\spad{B(x,y)},{} defined by \\indented{2}{\\spad{Beta(x,y) = integrate(t^(x-1)*(1-t)^(y-1), t=0..1)}.} This is related to \\spad{Gamma(x)} by \\indented{2}{\\spad{Beta(x,y) = Gamma(x)*Gamma(y) / Gamma(x + y)}.}")) (|Gamma| (((|Complex| (|DoubleFloat|)) (|Complex| (|DoubleFloat|))) "\\spad{Gamma(x)} is the Euler gamma function,{} \\spad{Gamma(x)},{} defined by \\indented{2}{\\spad{Gamma(x) = integrate(t^(x-1)*exp(-t), t=0..\\%infinity)}.}") (((|DoubleFloat|) (|DoubleFloat|)) "\\spad{Gamma(x)} is the Euler gamma function,{} \\spad{Gamma(x)},{} defined by \\indented{2}{\\spad{Gamma(x) = integrate(t^(x-1)*exp(-t), t=0..\\%infinity)}.}"))) @@ -847,7 +847,7 @@ NIL (-229 R) ((|constructor| (NIL "\\indented{1}{A Denavit-Hartenberg Matrix is a 4x4 Matrix of the form:} \\indented{1}{\\spad{nx ox ax px}} \\indented{1}{\\spad{ny oy ay py}} \\indented{1}{\\spad{nz oz az pz}} \\indented{2}{\\spad{0\\space{2}0\\space{2}0\\space{2}1}} (\\spad{n},{} \\spad{o},{} and a are the direction cosines)")) (|translate| (($ |#1| |#1| |#1|) "\\spad{translate(X,Y,Z)} returns a dhmatrix for translation by \\spad{X},{} \\spad{Y},{} and \\spad{Z}")) (|scale| (($ |#1| |#1| |#1|) "\\spad{scale(sx,sy,sz)} returns a dhmatrix for scaling in the \\spad{X},{} \\spad{Y} and \\spad{Z} directions")) (|rotatez| (($ |#1|) "\\spad{rotatez(r)} returns a dhmatrix for rotation about axis \\spad{Z} for \\spad{r} degrees")) (|rotatey| (($ |#1|) "\\spad{rotatey(r)} returns a dhmatrix for rotation about axis \\spad{Y} for \\spad{r} degrees")) (|rotatex| (($ |#1|) "\\spad{rotatex(r)} returns a dhmatrix for rotation about axis \\spad{X} for \\spad{r} degrees")) (|identity| (($) "\\spad{identity()} create the identity dhmatrix")) (* (((|Point| |#1|) $ (|Point| |#1|)) "\\spad{t*p} applies the dhmatrix \\spad{t} to point \\spad{p}"))) ((-4454 . T) (-4455 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1111))) (-3783 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (QUOTE (-313))) (|HasCategory| |#1| (QUOTE (-564))) (|HasAttribute| |#1| (QUOTE (-4456 "*"))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) +((-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1111))) (-2813 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (QUOTE (-313))) (|HasCategory| |#1| (QUOTE (-564))) (|HasAttribute| |#1| (QUOTE (-4456 "*"))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (-230 A S) ((|constructor| (NIL "A dictionary is an aggregate in which entries can be inserted,{} searched for and removed. Duplicates are thrown away on insertion. This category models the usual notion of dictionary which involves large amounts of data where copying is impractical. Principal operations are thus destructive (non-copying) ones."))) NIL @@ -859,7 +859,7 @@ NIL (-232 S R) ((|constructor| (NIL "Differential extensions of a ring \\spad{R}. Given a differentiation on \\spad{R},{} extend it to a differentiation on \\%.")) (D (($ $ (|Mapping| |#2| |#2|) (|NonNegativeInteger|)) "\\spad{D(x, deriv, n)} differentiate \\spad{x} \\spad{n} times using a derivation which extends \\spad{deriv} on \\spad{R}.") (($ $ (|Mapping| |#2| |#2|)) "\\spad{D(x, deriv)} differentiates \\spad{x} extending the derivation deriv on \\spad{R}.")) (|differentiate| (($ $ (|Mapping| |#2| |#2|) (|NonNegativeInteger|)) "\\spad{differentiate(x, deriv, n)} differentiate \\spad{x} \\spad{n} times using a derivation which extends \\spad{deriv} on \\spad{R}.") (($ $ (|Mapping| |#2| |#2|)) "\\spad{differentiate(x, deriv)} differentiates \\spad{x} extending the derivation deriv on \\spad{R}."))) NIL -((|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (LIST (QUOTE -235) (|devaluate| |#2|)))) +((|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (QUOTE (-237)))) (-233 R) ((|constructor| (NIL "Differential extensions of a ring \\spad{R}. Given a differentiation on \\spad{R},{} extend it to a differentiation on \\%.")) (D (($ $ (|Mapping| |#1| |#1|) (|NonNegativeInteger|)) "\\spad{D(x, deriv, n)} differentiate \\spad{x} \\spad{n} times using a derivation which extends \\spad{deriv} on \\spad{R}.") (($ $ (|Mapping| |#1| |#1|)) "\\spad{D(x, deriv)} differentiates \\spad{x} extending the derivation deriv on \\spad{R}.")) (|differentiate| (($ $ (|Mapping| |#1| |#1|) (|NonNegativeInteger|)) "\\spad{differentiate(x, deriv, n)} differentiate \\spad{x} \\spad{n} times using a derivation which extends \\spad{deriv} on \\spad{R}.") (($ $ (|Mapping| |#1| |#1|)) "\\spad{differentiate(x, deriv)} differentiates \\spad{x} extending the derivation deriv on \\spad{R}."))) ((-4451 . T)) @@ -892,22 +892,22 @@ NIL ((|constructor| (NIL "any solution of a homogeneous linear Diophantine equation can be represented as a sum of minimal solutions,{} which form a \"basis\" (a minimal solution cannot be represented as a nontrivial sum of solutions) in the case of an inhomogeneous linear Diophantine equation,{} each solution is the sum of a inhomogeneous solution and any number of homogeneous solutions therefore,{} it suffices to compute two sets: \\indented{3}{1. all minimal inhomogeneous solutions} \\indented{3}{2. all minimal homogeneous solutions} the algorithm implemented is a completion procedure,{} which enumerates all solutions in a recursive depth-first-search it can be seen as finding monotone paths in a graph for more details see Reference")) (|dioSolve| (((|Record| (|:| |varOrder| (|List| (|Symbol|))) (|:| |inhom| (|Union| (|List| (|Vector| (|NonNegativeInteger|))) "failed")) (|:| |hom| (|List| (|Vector| (|NonNegativeInteger|))))) (|Equation| (|Polynomial| (|Integer|)))) "\\spad{dioSolve(u)} computes a basis of all minimal solutions for linear homogeneous Diophantine equation \\spad{u},{} then all minimal solutions of inhomogeneous equation"))) NIL NIL -(-241 S -3436 R) +(-241 S -4131 R) ((|constructor| (NIL "\\indented{2}{This category represents a finite cartesian product of a given type.} Many categorical properties are preserved under this construction.")) (* (($ $ |#3|) "\\spad{y * r} multiplies each component of the vector \\spad{y} by the element \\spad{r}.") (($ |#3| $) "\\spad{r * y} multiplies the element \\spad{r} times each component of the vector \\spad{y}.")) (|dot| ((|#3| $ $) "\\spad{dot(x,y)} computes the inner product of the vectors \\spad{x} and \\spad{y}.")) (|unitVector| (($ (|PositiveInteger|)) "\\spad{unitVector(n)} produces a vector with 1 in position \\spad{n} and zero elsewhere.")) (|directProduct| (($ (|Vector| |#3|)) "\\spad{directProduct(v)} converts the vector \\spad{v} to become a direct product. Error: if the length of \\spad{v} is different from dim.")) (|finiteAggregate| ((|attribute|) "attribute to indicate an aggregate of finite size"))) NIL ((|HasCategory| |#3| (QUOTE (-370))) (|HasCategory| |#3| (QUOTE (-801))) (|HasCategory| |#3| (QUOTE (-856))) (|HasAttribute| |#3| (QUOTE -4451)) (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (QUOTE (-375))) (|HasCategory| |#3| (QUOTE (-734))) (|HasCategory| |#3| (QUOTE (-132))) (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (QUOTE (-1060))) (|HasCategory| |#3| (QUOTE (-1111)))) -(-242 -3436 R) +(-242 -4131 R) ((|constructor| (NIL "\\indented{2}{This category represents a finite cartesian product of a given type.} Many categorical properties are preserved under this construction.")) (* (($ $ |#2|) "\\spad{y * r} multiplies each component of the vector \\spad{y} by the element \\spad{r}.") (($ |#2| $) "\\spad{r * y} multiplies the element \\spad{r} times each component of the vector \\spad{y}.")) (|dot| ((|#2| $ $) "\\spad{dot(x,y)} computes the inner product of the vectors \\spad{x} and \\spad{y}.")) (|unitVector| (($ (|PositiveInteger|)) "\\spad{unitVector(n)} produces a vector with 1 in position \\spad{n} and zero elsewhere.")) (|directProduct| (($ (|Vector| |#2|)) "\\spad{directProduct(v)} converts the vector \\spad{v} to become a direct product. Error: if the length of \\spad{v} is different from dim.")) (|finiteAggregate| ((|attribute|) "attribute to indicate an aggregate of finite size"))) ((-4448 |has| |#2| (-1060)) (-4449 |has| |#2| (-1060)) (-4451 |has| |#2| (-6 -4451)) ((-4456 "*") |has| |#2| (-174)) (-4454 . T)) NIL -(-243 -3436 A B) +(-243 -4131 A B) ((|constructor| (NIL "\\indented{2}{This package provides operations which all take as arguments} direct products of elements of some type \\spad{A} and functions from \\spad{A} to another type \\spad{B}. The operations all iterate over their vector argument and either return a value of type \\spad{B} or a direct product over \\spad{B}.")) (|map| (((|DirectProduct| |#1| |#3|) (|Mapping| |#3| |#2|) (|DirectProduct| |#1| |#2|)) "\\spad{map(f, v)} applies the function \\spad{f} to every element of the vector \\spad{v} producing a new vector containing the values.")) (|reduce| ((|#3| (|Mapping| |#3| |#2| |#3|) (|DirectProduct| |#1| |#2|) |#3|) "\\spad{reduce(func,vec,ident)} combines the elements in \\spad{vec} using the binary function \\spad{func}. Argument \\spad{ident} is returned if the vector is empty.")) (|scan| (((|DirectProduct| |#1| |#3|) (|Mapping| |#3| |#2| |#3|) (|DirectProduct| |#1| |#2|) |#3|) "\\spad{scan(func,vec,ident)} creates a new vector whose elements are the result of applying reduce to the binary function \\spad{func},{} increasing initial subsequences of the vector \\spad{vec},{} and the element \\spad{ident}."))) NIL NIL -(-244 -3436 R) +(-244 -4131 R) ((|constructor| (NIL "\\indented{2}{This type represents the finite direct or cartesian product of an} underlying component type. This contrasts with simple vectors in that the members can be viewed as having constant length. Thus many categorical properties can by lifted from the underlying component type. Component extraction operations are provided but no updating operations. Thus new direct product elements can either be created by converting vector elements using the \\spadfun{directProduct} function or by taking appropriate linear combinations of basis vectors provided by the \\spad{unitVector} operation."))) ((-4448 |has| |#2| (-1060)) (-4449 |has| |#2| (-1060)) (-4451 |has| |#2| (-6 -4451)) ((-4456 "*") |has| |#2| (-174)) (-4454 . T)) -((-3783 (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-132))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-375))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-734))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-801))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-856))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))))) (-3783 (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-1111)))) (-12 (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (QUOTE (-1060)))) (-12 (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188))))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#2| (QUOTE (-370))) (-3783 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-1060)))) (-3783 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-370)))) (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-801))) (-3783 (|HasCategory| |#2| (QUOTE (-801))) (|HasCategory| |#2| (QUOTE (-856)))) (|HasCategory| |#2| (QUOTE (-856))) (|HasCategory| |#2| (QUOTE (-734))) (-3783 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-1060)))) (|HasCategory| |#2| (QUOTE (-375))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (-3783 (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-132))) (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-1060)))) (-3783 (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (QUOTE (-132))) (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-1060)))) (-3783 (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-1060)))) (-3783 (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (QUOTE (-1060)))) (|HasCategory| |#2| (QUOTE (-237))) (-3783 (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-132))) (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-375))) (|HasCategory| |#2| (QUOTE (-734))) (|HasCategory| |#2| (QUOTE (-801))) (|HasCategory| |#2| (QUOTE (-856))) (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (QUOTE (-1111)))) (|HasCategory| |#2| (QUOTE (-1111))) (-3783 (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-25)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-132)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-174)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-237)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-370)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-375)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-734)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-801)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-856)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-1060)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-1111))))) (-3783 (-12 (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-132))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-375))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-734))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-801))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-856))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-1060))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572)))))) (-3783 (-12 (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-132))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-375))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-734))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-801))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-856))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572)))))) (|HasCategory| (-572) (QUOTE (-858))) (-12 (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (QUOTE (-1060)))) (-12 (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188))))) (-3783 (|HasCategory| |#2| (QUOTE (-1060))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572)))))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-1111)))) (|HasAttribute| |#2| (QUOTE -4451)) (|HasCategory| |#2| (QUOTE (-132))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|))))) +((-2813 (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-132))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-375))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-734))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-801))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-856))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))))) (-2813 (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-1111)))) (-12 (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (QUOTE (-1060)))) (-12 (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188))))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#2| (QUOTE (-370))) (-2813 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-1060)))) (-2813 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-370)))) (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-801))) (-2813 (|HasCategory| |#2| (QUOTE (-801))) (|HasCategory| |#2| (QUOTE (-856)))) (|HasCategory| |#2| (QUOTE (-856))) (|HasCategory| |#2| (QUOTE (-734))) (-2813 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-1060)))) (|HasCategory| |#2| (QUOTE (-375))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (-2813 (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-132))) (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-1060)))) (-2813 (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (QUOTE (-132))) (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-1060)))) (-2813 (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-1060)))) (-2813 (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (QUOTE (-1060)))) (|HasCategory| |#2| (QUOTE (-237))) (-2813 (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-132))) (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-375))) (|HasCategory| |#2| (QUOTE (-734))) (|HasCategory| |#2| (QUOTE (-801))) (|HasCategory| |#2| (QUOTE (-856))) (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (QUOTE (-1111)))) (|HasCategory| |#2| (QUOTE (-1111))) (-2813 (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-25)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-132)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-174)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-237)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-370)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-375)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-734)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-801)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-856)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-1060)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-1111))))) (-2813 (-12 (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-132))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-375))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-734))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-801))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-856))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-1060))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572)))))) (-2813 (-12 (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-132))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-375))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-734))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-801))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-856))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572)))))) (|HasCategory| (-572) (QUOTE (-858))) (-12 (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (QUOTE (-1060)))) (-12 (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188))))) (-2813 (|HasCategory| |#2| (QUOTE (-1060))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572)))))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-1111)))) (|HasAttribute| |#2| (QUOTE -4451)) (|HasCategory| |#2| (QUOTE (-132))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|))))) (-245) ((|constructor| (NIL "DisplayPackage allows one to print strings in a nice manner,{} including highlighting substrings.")) (|sayLength| (((|Integer|) (|List| (|String|))) "\\spad{sayLength(l)} returns the length of a list of strings \\spad{l} as an integer.") (((|Integer|) (|String|)) "\\spad{sayLength(s)} returns the length of a string \\spad{s} as an integer.")) (|say| (((|Void|) (|List| (|String|))) "\\spad{say(l)} sends a list of strings \\spad{l} to output.") (((|Void|) (|String|)) "\\spad{say(s)} sends a string \\spad{s} to output.")) (|center| (((|List| (|String|)) (|List| (|String|)) (|Integer|) (|String|)) "\\spad{center(l,i,s)} takes a list of strings \\spad{l},{} and centers them within a list of strings which is \\spad{i} characters long,{} in which the remaining spaces are filled with strings composed of as many repetitions as possible of the last string parameter \\spad{s}.") (((|String|) (|String|) (|Integer|) (|String|)) "\\spad{center(s,i,s)} takes the first string \\spad{s},{} and centers it within a string of length \\spad{i},{} in which the other elements of the string are composed of as many replications as possible of the second indicated string,{} \\spad{s} which must have a length greater than that of an empty string.")) (|copies| (((|String|) (|Integer|) (|String|)) "\\spad{copies(i,s)} will take a string \\spad{s} and create a new string composed of \\spad{i} copies of \\spad{s}.")) (|newLine| (((|String|)) "\\spad{newLine()} sends a new line command to output.")) (|bright| (((|List| (|String|)) (|List| (|String|))) "\\spad{bright(l)} sets the font property of a list of strings,{} \\spad{l},{} to bold-face type.") (((|List| (|String|)) (|String|)) "\\spad{bright(s)} sets the font property of the string \\spad{s} to bold-face type."))) NIL @@ -927,7 +927,7 @@ NIL (-249 S) ((|constructor| (NIL "This domain provides some nice functions on lists")) (|elt| (((|NonNegativeInteger|) $ "count") "\\axiom{\\spad{l}.\"count\"} returns the number of elements in \\axiom{\\spad{l}}.") (($ $ "sort") "\\axiom{\\spad{l}.sort} returns \\axiom{\\spad{l}} with elements sorted. Note: \\axiom{\\spad{l}.sort = sort(\\spad{l})}") (($ $ "unique") "\\axiom{\\spad{l}.unique} returns \\axiom{\\spad{l}} with duplicates removed. Note: \\axiom{\\spad{l}.unique = removeDuplicates(\\spad{l})}.")) (|datalist| (($ (|List| |#1|)) "\\spad{datalist(l)} creates a datalist from \\spad{l}"))) ((-4455 . T) (-4454 . T)) -((-3783 (-12 (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) (-3783 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544)))) (-3783 (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-1111)))) (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| (-572) (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) +((-2813 (-12 (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) (-2813 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544)))) (-2813 (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-1111)))) (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| (-572) (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) (-250 M) ((|constructor| (NIL "DiscreteLogarithmPackage implements help functions for discrete logarithms in monoids using small cyclic groups.")) (|shanksDiscLogAlgorithm| (((|Union| (|NonNegativeInteger|) "failed") |#1| |#1| (|NonNegativeInteger|)) "\\spad{shanksDiscLogAlgorithm(b,a,p)} computes \\spad{s} with \\spad{b**s = a} for assuming that \\spad{a} and \\spad{b} are elements in a 'small' cyclic group of order \\spad{p} by Shank\\spad{'s} algorithm. Note: this is a subroutine of the function \\spadfun{discreteLog}.")) (** ((|#1| |#1| (|Integer|)) "\\spad{x ** n} returns \\spad{x} raised to the integer power \\spad{n}"))) NIL @@ -935,7 +935,7 @@ NIL (-251 |vl| R) ((|constructor| (NIL "\\indented{2}{This type supports distributed multivariate polynomials} whose variables are from a user specified list of symbols. The coefficient ring may be non commutative,{} but the variables are assumed to commute. The term ordering is lexicographic specified by the variable list parameter with the most significant variable first in the list.")) (|reorder| (($ $ (|List| (|Integer|))) "\\spad{reorder(p, perm)} applies the permutation perm to the variables in a polynomial and returns the new correctly ordered polynomial"))) (((-4456 "*") |has| |#2| (-174)) (-4447 |has| |#2| (-564)) (-4452 |has| |#2| (-6 -4452)) (-4449 . T) (-4448 . T) (-4451 . T)) -((|HasCategory| |#2| (QUOTE (-918))) (-3783 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-460))) (|HasCategory| |#2| (QUOTE (-564))) (|HasCategory| |#2| (QUOTE (-918)))) (-3783 (|HasCategory| |#2| (QUOTE (-460))) (|HasCategory| |#2| (QUOTE (-564))) (|HasCategory| |#2| (QUOTE (-918)))) (-3783 (|HasCategory| |#2| (QUOTE (-460))) (|HasCategory| |#2| (QUOTE (-918)))) (|HasCategory| |#2| (QUOTE (-564))) (|HasCategory| |#2| (QUOTE (-174))) (-3783 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-564)))) (-12 (|HasCategory| (-872 |#1|) (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| |#2| (LIST (QUOTE -895) (QUOTE (-386))))) (-12 (|HasCategory| (-872 |#1|) (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -895) (QUOTE (-572))))) (-12 (|HasCategory| (-872 |#1|) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| |#2| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386)))))) (-12 (|HasCategory| (-872 |#1|) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572)))))) (-12 (|HasCategory| (-872 |#1|) (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#2| (LIST (QUOTE -622) (QUOTE (-544))))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (QUOTE (-148))) (|HasCategory| |#2| (QUOTE (-146))) (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572)))) (-3783 (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572)))))) (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-370))) (|HasAttribute| |#2| (QUOTE -4452)) (|HasCategory| |#2| (QUOTE (-460))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#2| (QUOTE (-918)))) (-3783 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#2| (QUOTE (-918)))) (|HasCategory| |#2| (QUOTE (-146))))) +((|HasCategory| |#2| (QUOTE (-918))) (-2813 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-460))) (|HasCategory| |#2| (QUOTE (-564))) (|HasCategory| |#2| (QUOTE (-918)))) (-2813 (|HasCategory| |#2| (QUOTE (-460))) (|HasCategory| |#2| (QUOTE (-564))) (|HasCategory| |#2| (QUOTE (-918)))) (-2813 (|HasCategory| |#2| (QUOTE (-460))) (|HasCategory| |#2| (QUOTE (-918)))) (|HasCategory| |#2| (QUOTE (-564))) (|HasCategory| |#2| (QUOTE (-174))) (-2813 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-564)))) (-12 (|HasCategory| (-872 |#1|) (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| |#2| (LIST (QUOTE -895) (QUOTE (-386))))) (-12 (|HasCategory| (-872 |#1|) (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -895) (QUOTE (-572))))) (-12 (|HasCategory| (-872 |#1|) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| |#2| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386)))))) (-12 (|HasCategory| (-872 |#1|) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572)))))) (-12 (|HasCategory| (-872 |#1|) (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#2| (LIST (QUOTE -622) (QUOTE (-544))))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (QUOTE (-148))) (|HasCategory| |#2| (QUOTE (-146))) (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572)))) (-2813 (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572)))))) (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-370))) (|HasAttribute| |#2| (QUOTE -4452)) (|HasCategory| |#2| (QUOTE (-460))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#2| (QUOTE (-918)))) (-2813 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#2| (QUOTE (-918)))) (|HasCategory| |#2| (QUOTE (-146))))) (-252) ((|showSummary| (((|Void|) $) "\\spad{showSummary(d)} prints out implementation detail information of domain \\spad{`d'}.")) (|reflect| (($ (|ConstructorCall| (|DomainConstructor|))) "\\spad{reflect cc} returns the domain object designated by the ConstructorCall syntax `cc'. The constructor implied by `cc' must be known to the system since it is instantiated.")) (|reify| (((|ConstructorCall| (|DomainConstructor|)) $) "\\spad{reify(d)} returns the abstract syntax for the domain \\spad{`x'}.")) (|constructor| (NIL "\\indented{1}{Author: Gabriel Dos Reis} Date Create: October 18,{} 2007. Date Last Updated: December 20,{} 2008. Basic Operations: coerce,{} reify Related Constructors: Type,{} Syntax,{} OutputForm Also See: Type,{} ConstructorCall") (((|DomainConstructor|) $) "\\spad{constructor(d)} returns the domain constructor that is instantiated to the domain object \\spad{`d'}."))) NIL @@ -950,16 +950,16 @@ NIL NIL (-255 |n| R M S) ((|constructor| (NIL "This constructor provides a direct product type with a left matrix-module view."))) -((-4451 -3783 (-3804 (|has| |#4| (-1060)) (|has| |#4| (-237))) (-3804 (|has| |#4| (-1060)) (|has| |#4| (-909 (-1188)))) (|has| |#4| (-6 -4451)) (-3804 (|has| |#4| (-1060)) (|has| |#4| (-647 (-572))))) (-4448 |has| |#4| (-1060)) (-4449 |has| |#4| (-1060)) ((-4456 "*") |has| |#4| (-174)) (-4454 . T)) -((-3783 (-12 (|HasCategory| |#4| (QUOTE (-174))) (|HasCategory| |#4| (LIST (QUOTE -315) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-237))) (|HasCategory| |#4| (LIST (QUOTE -315) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-370))) (|HasCategory| |#4| (LIST (QUOTE -315) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-375))) (|HasCategory| |#4| (LIST (QUOTE -315) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-734))) (|HasCategory| |#4| (LIST (QUOTE -315) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-801))) (|HasCategory| |#4| (LIST (QUOTE -315) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-856))) (|HasCategory| |#4| (LIST (QUOTE -315) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-1060))) (|HasCategory| |#4| (LIST (QUOTE -315) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-1111))) (|HasCategory| |#4| (LIST (QUOTE -315) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -315) (|devaluate| |#4|))) (|HasCategory| |#4| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -315) (|devaluate| |#4|))) (|HasCategory| |#4| (LIST (QUOTE -909) (QUOTE (-1188)))))) (|HasCategory| |#4| (QUOTE (-370))) (-3783 (|HasCategory| |#4| (QUOTE (-174))) (|HasCategory| |#4| (QUOTE (-370))) (|HasCategory| |#4| (QUOTE (-1060)))) (-3783 (|HasCategory| |#4| (QUOTE (-174))) (|HasCategory| |#4| (QUOTE (-370)))) (|HasCategory| |#4| (QUOTE (-1060))) (|HasCategory| |#4| (QUOTE (-174))) (|HasCategory| |#4| (QUOTE (-801))) (-3783 (|HasCategory| |#4| (QUOTE (-801))) (|HasCategory| |#4| (QUOTE (-856)))) (|HasCategory| |#4| (QUOTE (-856))) (|HasCategory| |#4| (QUOTE (-734))) (-3783 (|HasCategory| |#4| (QUOTE (-174))) (|HasCategory| |#4| (QUOTE (-1060)))) (|HasCategory| |#4| (QUOTE (-375))) (|HasCategory| |#4| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#4| (LIST (QUOTE -909) (QUOTE (-1188)))) (-3783 (|HasCategory| |#4| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#4| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#4| (QUOTE (-174))) (|HasCategory| |#4| (QUOTE (-237))) (|HasCategory| |#4| (QUOTE (-1060)))) (|HasCategory| |#4| (QUOTE (-237))) (|HasCategory| |#4| (QUOTE (-1111))) (-3783 (-12 (|HasCategory| |#4| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#4| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#4| (LIST (QUOTE -909) (QUOTE (-1188))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#4| (QUOTE (-174)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#4| (QUOTE (-237)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#4| (QUOTE (-370)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#4| (QUOTE (-375)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#4| (QUOTE (-734)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#4| (QUOTE (-801)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#4| (QUOTE (-856)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#4| (QUOTE (-1060)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#4| (QUOTE (-1111))))) (-3783 (-12 (|HasCategory| |#4| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#4| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#4| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#4| (QUOTE (-174))) (|HasCategory| |#4| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#4| (QUOTE (-237))) (|HasCategory| |#4| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#4| (QUOTE (-370))) (|HasCategory| |#4| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#4| (QUOTE (-375))) (|HasCategory| |#4| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#4| (QUOTE (-734))) (|HasCategory| |#4| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#4| (QUOTE (-801))) (|HasCategory| |#4| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#4| (QUOTE (-856))) (|HasCategory| |#4| (LIST (QUOTE -1049) (QUOTE (-572))))) (|HasCategory| |#4| (QUOTE (-1060))) (-12 (|HasCategory| |#4| (QUOTE (-1111))) (|HasCategory| |#4| (LIST (QUOTE -1049) (QUOTE (-572)))))) (-3783 (-12 (|HasCategory| |#4| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#4| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#4| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#4| (QUOTE (-174))) (|HasCategory| |#4| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#4| (QUOTE (-237))) (|HasCategory| |#4| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#4| (QUOTE (-370))) (|HasCategory| |#4| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#4| (QUOTE (-375))) (|HasCategory| |#4| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#4| (QUOTE (-734))) (|HasCategory| |#4| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#4| (QUOTE (-801))) (|HasCategory| |#4| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#4| (QUOTE (-856))) (|HasCategory| |#4| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#4| (QUOTE (-1060))) (|HasCategory| |#4| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#4| (QUOTE (-1111))) (|HasCategory| |#4| (LIST (QUOTE -1049) (QUOTE (-572)))))) (|HasCategory| (-572) (QUOTE (-858))) (-12 (|HasCategory| |#4| (QUOTE (-1060))) (|HasCategory| |#4| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#4| (QUOTE (-1060))) (|HasCategory| |#4| (LIST (QUOTE -909) (QUOTE (-1188))))) (-12 (|HasCategory| |#4| (QUOTE (-237))) (|HasCategory| |#4| (QUOTE (-1060)))) (-3783 (-12 (|HasCategory| |#4| (QUOTE (-237))) (|HasCategory| |#4| (QUOTE (-1060)))) (|HasCategory| |#4| (QUOTE (-734))) (-12 (|HasCategory| |#4| (QUOTE (-1060))) (|HasCategory| |#4| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#4| (QUOTE (-1060))) (|HasCategory| |#4| (LIST (QUOTE -909) (QUOTE (-1188)))))) (-12 (|HasCategory| |#4| (QUOTE (-1111))) (|HasCategory| |#4| (LIST (QUOTE -1049) (QUOTE (-572))))) (-3783 (|HasCategory| |#4| (QUOTE (-1060))) (-12 (|HasCategory| |#4| (QUOTE (-1111))) (|HasCategory| |#4| (LIST (QUOTE -1049) (QUOTE (-572)))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#4| (QUOTE (-1111)))) (-3783 (|HasAttribute| |#4| (QUOTE -4451)) (-12 (|HasCategory| |#4| (QUOTE (-237))) (|HasCategory| |#4| (QUOTE (-1060)))) (-12 (|HasCategory| |#4| (QUOTE (-1060))) (|HasCategory| |#4| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#4| (QUOTE (-1060))) (|HasCategory| |#4| (LIST (QUOTE -909) (QUOTE (-1188)))))) (|HasCategory| |#4| (QUOTE (-132))) (|HasCategory| |#4| (QUOTE (-25))) (|HasCategory| |#4| (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| |#4| (QUOTE (-1111))) (|HasCategory| |#4| (LIST (QUOTE -315) (|devaluate| |#4|))))) +((-4451 -2813 (-2085 (|has| |#4| (-1060)) (|has| |#4| (-237))) (-2085 (|has| |#4| (-1060)) (|has| |#4| (-909 (-1188)))) (|has| |#4| (-6 -4451)) (-2085 (|has| |#4| (-1060)) (|has| |#4| (-647 (-572))))) (-4448 |has| |#4| (-1060)) (-4449 |has| |#4| (-1060)) ((-4456 "*") |has| |#4| (-174)) (-4454 . T)) +((-2813 (-12 (|HasCategory| |#4| (QUOTE (-174))) (|HasCategory| |#4| (LIST (QUOTE -315) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-237))) (|HasCategory| |#4| (LIST (QUOTE -315) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-370))) (|HasCategory| |#4| (LIST (QUOTE -315) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-375))) (|HasCategory| |#4| (LIST (QUOTE -315) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-734))) (|HasCategory| |#4| (LIST (QUOTE -315) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-801))) (|HasCategory| |#4| (LIST (QUOTE -315) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-856))) (|HasCategory| |#4| (LIST (QUOTE -315) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-1060))) (|HasCategory| |#4| (LIST (QUOTE -315) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-1111))) (|HasCategory| |#4| (LIST (QUOTE -315) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -315) (|devaluate| |#4|))) (|HasCategory| |#4| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -315) (|devaluate| |#4|))) (|HasCategory| |#4| (LIST (QUOTE -909) (QUOTE (-1188)))))) (|HasCategory| |#4| (QUOTE (-370))) (-2813 (|HasCategory| |#4| (QUOTE (-174))) (|HasCategory| |#4| (QUOTE (-370))) (|HasCategory| |#4| (QUOTE (-1060)))) (-2813 (|HasCategory| |#4| (QUOTE (-174))) (|HasCategory| |#4| (QUOTE (-370)))) (|HasCategory| |#4| (QUOTE (-1060))) (|HasCategory| |#4| (QUOTE (-174))) (|HasCategory| |#4| (QUOTE (-801))) (-2813 (|HasCategory| |#4| (QUOTE (-801))) (|HasCategory| |#4| (QUOTE (-856)))) (|HasCategory| |#4| (QUOTE (-856))) (|HasCategory| |#4| (QUOTE (-734))) (-2813 (|HasCategory| |#4| (QUOTE (-174))) (|HasCategory| |#4| (QUOTE (-1060)))) (|HasCategory| |#4| (QUOTE (-375))) (|HasCategory| |#4| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#4| (LIST (QUOTE -909) (QUOTE (-1188)))) (-2813 (|HasCategory| |#4| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#4| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#4| (QUOTE (-174))) (|HasCategory| |#4| (QUOTE (-237))) (|HasCategory| |#4| (QUOTE (-1060)))) (|HasCategory| |#4| (QUOTE (-237))) (|HasCategory| |#4| (QUOTE (-1111))) (-2813 (-12 (|HasCategory| |#4| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#4| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#4| (LIST (QUOTE -909) (QUOTE (-1188))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#4| (QUOTE (-174)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#4| (QUOTE (-237)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#4| (QUOTE (-370)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#4| (QUOTE (-375)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#4| (QUOTE (-734)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#4| (QUOTE (-801)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#4| (QUOTE (-856)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#4| (QUOTE (-1060)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#4| (QUOTE (-1111))))) (-2813 (-12 (|HasCategory| |#4| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#4| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#4| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#4| (QUOTE (-174))) (|HasCategory| |#4| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#4| (QUOTE (-237))) (|HasCategory| |#4| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#4| (QUOTE (-370))) (|HasCategory| |#4| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#4| (QUOTE (-375))) (|HasCategory| |#4| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#4| (QUOTE (-734))) (|HasCategory| |#4| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#4| (QUOTE (-801))) (|HasCategory| |#4| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#4| (QUOTE (-856))) (|HasCategory| |#4| (LIST (QUOTE -1049) (QUOTE (-572))))) (|HasCategory| |#4| (QUOTE (-1060))) (-12 (|HasCategory| |#4| (QUOTE (-1111))) (|HasCategory| |#4| (LIST (QUOTE -1049) (QUOTE (-572)))))) (-2813 (-12 (|HasCategory| |#4| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#4| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#4| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#4| (QUOTE (-174))) (|HasCategory| |#4| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#4| (QUOTE (-237))) (|HasCategory| |#4| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#4| (QUOTE (-370))) (|HasCategory| |#4| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#4| (QUOTE (-375))) (|HasCategory| |#4| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#4| (QUOTE (-734))) (|HasCategory| |#4| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#4| (QUOTE (-801))) (|HasCategory| |#4| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#4| (QUOTE (-856))) (|HasCategory| |#4| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#4| (QUOTE (-1060))) (|HasCategory| |#4| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#4| (QUOTE (-1111))) (|HasCategory| |#4| (LIST (QUOTE -1049) (QUOTE (-572)))))) (|HasCategory| (-572) (QUOTE (-858))) (-12 (|HasCategory| |#4| (QUOTE (-1060))) (|HasCategory| |#4| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#4| (QUOTE (-1060))) (|HasCategory| |#4| (LIST (QUOTE -909) (QUOTE (-1188))))) (-12 (|HasCategory| |#4| (QUOTE (-237))) (|HasCategory| |#4| (QUOTE (-1060)))) (-2813 (-12 (|HasCategory| |#4| (QUOTE (-237))) (|HasCategory| |#4| (QUOTE (-1060)))) (|HasCategory| |#4| (QUOTE (-734))) (-12 (|HasCategory| |#4| (QUOTE (-1060))) (|HasCategory| |#4| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#4| (QUOTE (-1060))) (|HasCategory| |#4| (LIST (QUOTE -909) (QUOTE (-1188)))))) (-12 (|HasCategory| |#4| (QUOTE (-1111))) (|HasCategory| |#4| (LIST (QUOTE -1049) (QUOTE (-572))))) (-2813 (|HasCategory| |#4| (QUOTE (-1060))) (-12 (|HasCategory| |#4| (QUOTE (-1111))) (|HasCategory| |#4| (LIST (QUOTE -1049) (QUOTE (-572)))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#4| (QUOTE (-1111)))) (-2813 (|HasAttribute| |#4| (QUOTE -4451)) (-12 (|HasCategory| |#4| (QUOTE (-237))) (|HasCategory| |#4| (QUOTE (-1060)))) (-12 (|HasCategory| |#4| (QUOTE (-1060))) (|HasCategory| |#4| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#4| (QUOTE (-1060))) (|HasCategory| |#4| (LIST (QUOTE -909) (QUOTE (-1188)))))) (|HasCategory| |#4| (QUOTE (-132))) (|HasCategory| |#4| (QUOTE (-25))) (|HasCategory| |#4| (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| |#4| (QUOTE (-1111))) (|HasCategory| |#4| (LIST (QUOTE -315) (|devaluate| |#4|))))) (-256 |n| R S) ((|constructor| (NIL "This constructor provides a direct product of \\spad{R}-modules with an \\spad{R}-module view."))) -((-4451 -3783 (-3804 (|has| |#3| (-1060)) (|has| |#3| (-237))) (-3804 (|has| |#3| (-1060)) (|has| |#3| (-909 (-1188)))) (|has| |#3| (-6 -4451)) (-3804 (|has| |#3| (-1060)) (|has| |#3| (-647 (-572))))) (-4448 |has| |#3| (-1060)) (-4449 |has| |#3| (-1060)) ((-4456 "*") |has| |#3| (-174)) (-4454 . T)) -((-3783 (-12 (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-237))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-370))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-375))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-734))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-801))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-856))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1060))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1111))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|))) (|HasCategory| |#3| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|))) (|HasCategory| |#3| (LIST (QUOTE -909) (QUOTE (-1188)))))) (|HasCategory| |#3| (QUOTE (-370))) (-3783 (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (QUOTE (-370))) (|HasCategory| |#3| (QUOTE (-1060)))) (-3783 (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (QUOTE (-370)))) (|HasCategory| |#3| (QUOTE (-1060))) (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (QUOTE (-801))) (-3783 (|HasCategory| |#3| (QUOTE (-801))) (|HasCategory| |#3| (QUOTE (-856)))) (|HasCategory| |#3| (QUOTE (-856))) (|HasCategory| |#3| (QUOTE (-734))) (-3783 (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (QUOTE (-1060)))) (|HasCategory| |#3| (QUOTE (-375))) (|HasCategory| |#3| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#3| (LIST (QUOTE -909) (QUOTE (-1188)))) (-3783 (|HasCategory| |#3| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#3| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (QUOTE (-237))) (|HasCategory| |#3| (QUOTE (-1060)))) (|HasCategory| |#3| (QUOTE (-237))) (|HasCategory| |#3| (QUOTE (-1111))) (-3783 (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (LIST (QUOTE -909) (QUOTE (-1188))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (QUOTE (-174)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (QUOTE (-237)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (QUOTE (-370)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (QUOTE (-375)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (QUOTE (-734)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (QUOTE (-801)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (QUOTE (-856)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (QUOTE (-1060)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (QUOTE (-1111))))) (-3783 (-12 (|HasCategory| |#3| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-237))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-370))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-375))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-734))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-801))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-856))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (|HasCategory| |#3| (QUOTE (-1060))) (-12 (|HasCategory| |#3| (QUOTE (-1111))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572)))))) (-3783 (-12 (|HasCategory| |#3| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-237))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-370))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-375))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-734))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-801))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-856))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-1060))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-1111))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572)))))) (|HasCategory| (-572) (QUOTE (-858))) (-12 (|HasCategory| |#3| (QUOTE (-1060))) (|HasCategory| |#3| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-1060))) (|HasCategory| |#3| (LIST (QUOTE -909) (QUOTE (-1188))))) (-12 (|HasCategory| |#3| (QUOTE (-237))) (|HasCategory| |#3| (QUOTE (-1060)))) (-3783 (-12 (|HasCategory| |#3| (QUOTE (-237))) (|HasCategory| |#3| (QUOTE (-1060)))) (|HasCategory| |#3| (QUOTE (-734))) (-12 (|HasCategory| |#3| (QUOTE (-1060))) (|HasCategory| |#3| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-1060))) (|HasCategory| |#3| (LIST (QUOTE -909) (QUOTE (-1188)))))) (-12 (|HasCategory| |#3| (QUOTE (-1111))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-3783 (|HasCategory| |#3| (QUOTE (-1060))) (-12 (|HasCategory| |#3| (QUOTE (-1111))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572)))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (QUOTE (-1111)))) (-3783 (|HasAttribute| |#3| (QUOTE -4451)) (-12 (|HasCategory| |#3| (QUOTE (-237))) (|HasCategory| |#3| (QUOTE (-1060)))) (-12 (|HasCategory| |#3| (QUOTE (-1060))) (|HasCategory| |#3| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-1060))) (|HasCategory| |#3| (LIST (QUOTE -909) (QUOTE (-1188)))))) (|HasCategory| |#3| (QUOTE (-132))) (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| |#3| (QUOTE (-1111))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|))))) +((-4451 -2813 (-2085 (|has| |#3| (-1060)) (|has| |#3| (-237))) (-2085 (|has| |#3| (-1060)) (|has| |#3| (-909 (-1188)))) (|has| |#3| (-6 -4451)) (-2085 (|has| |#3| (-1060)) (|has| |#3| (-647 (-572))))) (-4448 |has| |#3| (-1060)) (-4449 |has| |#3| (-1060)) ((-4456 "*") |has| |#3| (-174)) (-4454 . T)) +((-2813 (-12 (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-237))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-370))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-375))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-734))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-801))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-856))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1060))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1111))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|))) (|HasCategory| |#3| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|))) (|HasCategory| |#3| (LIST (QUOTE -909) (QUOTE (-1188)))))) (|HasCategory| |#3| (QUOTE (-370))) (-2813 (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (QUOTE (-370))) (|HasCategory| |#3| (QUOTE (-1060)))) (-2813 (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (QUOTE (-370)))) (|HasCategory| |#3| (QUOTE (-1060))) (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (QUOTE (-801))) (-2813 (|HasCategory| |#3| (QUOTE (-801))) (|HasCategory| |#3| (QUOTE (-856)))) (|HasCategory| |#3| (QUOTE (-856))) (|HasCategory| |#3| (QUOTE (-734))) (-2813 (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (QUOTE (-1060)))) (|HasCategory| |#3| (QUOTE (-375))) (|HasCategory| |#3| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#3| (LIST (QUOTE -909) (QUOTE (-1188)))) (-2813 (|HasCategory| |#3| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#3| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (QUOTE (-237))) (|HasCategory| |#3| (QUOTE (-1060)))) (|HasCategory| |#3| (QUOTE (-237))) (|HasCategory| |#3| (QUOTE (-1111))) (-2813 (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (LIST (QUOTE -909) (QUOTE (-1188))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (QUOTE (-174)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (QUOTE (-237)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (QUOTE (-370)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (QUOTE (-375)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (QUOTE (-734)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (QUOTE (-801)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (QUOTE (-856)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (QUOTE (-1060)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (QUOTE (-1111))))) (-2813 (-12 (|HasCategory| |#3| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-237))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-370))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-375))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-734))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-801))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-856))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (|HasCategory| |#3| (QUOTE (-1060))) (-12 (|HasCategory| |#3| (QUOTE (-1111))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572)))))) (-2813 (-12 (|HasCategory| |#3| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-237))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-370))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-375))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-734))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-801))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-856))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-1060))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-1111))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572)))))) (|HasCategory| (-572) (QUOTE (-858))) (-12 (|HasCategory| |#3| (QUOTE (-1060))) (|HasCategory| |#3| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-1060))) (|HasCategory| |#3| (LIST (QUOTE -909) (QUOTE (-1188))))) (-12 (|HasCategory| |#3| (QUOTE (-237))) (|HasCategory| |#3| (QUOTE (-1060)))) (-2813 (-12 (|HasCategory| |#3| (QUOTE (-237))) (|HasCategory| |#3| (QUOTE (-1060)))) (|HasCategory| |#3| (QUOTE (-734))) (-12 (|HasCategory| |#3| (QUOTE (-1060))) (|HasCategory| |#3| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-1060))) (|HasCategory| |#3| (LIST (QUOTE -909) (QUOTE (-1188)))))) (-12 (|HasCategory| |#3| (QUOTE (-1111))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-2813 (|HasCategory| |#3| (QUOTE (-1060))) (-12 (|HasCategory| |#3| (QUOTE (-1111))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572)))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (QUOTE (-1111)))) (-2813 (|HasAttribute| |#3| (QUOTE -4451)) (-12 (|HasCategory| |#3| (QUOTE (-237))) (|HasCategory| |#3| (QUOTE (-1060)))) (-12 (|HasCategory| |#3| (QUOTE (-1060))) (|HasCategory| |#3| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-1060))) (|HasCategory| |#3| (LIST (QUOTE -909) (QUOTE (-1188)))))) (|HasCategory| |#3| (QUOTE (-132))) (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| |#3| (QUOTE (-1111))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|))))) (-257 A R S V E) ((|constructor| (NIL "\\spadtype{DifferentialPolynomialCategory} is a category constructor specifying basic functions in an ordinary differential polynomial ring with a given ordered set of differential indeterminates. In addition,{} it implements defaults for the basic functions. The functions \\spadfun{order} and \\spadfun{weight} are extended from the set of derivatives of differential indeterminates to the set of differential polynomials. Other operations provided on differential polynomials are \\spadfun{leader},{} \\spadfun{initial},{} \\spadfun{separant},{} \\spadfun{differentialVariables},{} and \\spadfun{isobaric?}. Furthermore,{} if the ground ring is a differential ring,{} then evaluation (substitution of differential indeterminates by elements of the ground ring or by differential polynomials) is provided by \\spadfun{eval}. A convenient way of referencing derivatives is provided by the functions \\spadfun{makeVariable}. \\blankline To construct a domain using this constructor,{} one needs to provide a ground ring \\spad{R},{} an ordered set \\spad{S} of differential indeterminates,{} a ranking \\spad{V} on the set of derivatives of the differential indeterminates,{} and a set \\spad{E} of exponents in bijection with the set of differential monomials in the given differential indeterminates. \\blankline")) (|separant| (($ $) "\\spad{separant(p)} returns the partial derivative of the differential polynomial \\spad{p} with respect to its leader.")) (|initial| (($ $) "\\spad{initial(p)} returns the leading coefficient when the differential polynomial \\spad{p} is written as a univariate polynomial in its leader.")) (|leader| ((|#4| $) "\\spad{leader(p)} returns the derivative of the highest rank appearing in the differential polynomial \\spad{p} Note: an error occurs if \\spad{p} is in the ground ring.")) (|isobaric?| (((|Boolean|) $) "\\spad{isobaric?(p)} returns \\spad{true} if every differential monomial appearing in the differential polynomial \\spad{p} has same weight,{} and returns \\spad{false} otherwise.")) (|weight| (((|NonNegativeInteger|) $ |#3|) "\\spad{weight(p, s)} returns the maximum weight of all differential monomials appearing in the differential polynomial \\spad{p} when \\spad{p} is viewed as a differential polynomial in the differential indeterminate \\spad{s} alone.") (((|NonNegativeInteger|) $) "\\spad{weight(p)} returns the maximum weight of all differential monomials appearing in the differential polynomial \\spad{p}.")) (|weights| (((|List| (|NonNegativeInteger|)) $ |#3|) "\\spad{weights(p, s)} returns a list of weights of differential monomials appearing in the differential polynomial \\spad{p} when \\spad{p} is viewed as a differential polynomial in the differential indeterminate \\spad{s} alone.") (((|List| (|NonNegativeInteger|)) $) "\\spad{weights(p)} returns a list of weights of differential monomials appearing in differential polynomial \\spad{p}.")) (|degree| (((|NonNegativeInteger|) $ |#3|) "\\spad{degree(p, s)} returns the maximum degree of the differential polynomial \\spad{p} viewed as a differential polynomial in the differential indeterminate \\spad{s} alone.")) (|order| (((|NonNegativeInteger|) $) "\\spad{order(p)} returns the order of the differential polynomial \\spad{p},{} which is the maximum number of differentiations of a differential indeterminate,{} among all those appearing in \\spad{p}.") (((|NonNegativeInteger|) $ |#3|) "\\spad{order(p,s)} returns the order of the differential polynomial \\spad{p} in differential indeterminate \\spad{s}.")) (|differentialVariables| (((|List| |#3|) $) "\\spad{differentialVariables(p)} returns a list of differential indeterminates occurring in a differential polynomial \\spad{p}.")) (|makeVariable| (((|Mapping| $ (|NonNegativeInteger|)) $) "\\spad{makeVariable(p)} views \\spad{p} as an element of a differential ring,{} in such a way that the \\spad{n}-th derivative of \\spad{p} may be simply referenced as \\spad{z}.\\spad{n} where \\spad{z} \\spad{:=} makeVariable(\\spad{p}). Note: In the interpreter,{} \\spad{z} is given as an internal map,{} which may be ignored.") (((|Mapping| $ (|NonNegativeInteger|)) |#3|) "\\spad{makeVariable(s)} views \\spad{s} as a differential indeterminate,{} in such a way that the \\spad{n}-th derivative of \\spad{s} may be simply referenced as \\spad{z}.\\spad{n} where \\spad{z} :=makeVariable(\\spad{s}). Note: In the interpreter,{} \\spad{z} is given as an internal map,{} which may be ignored."))) NIL -((|HasCategory| |#2| (LIST (QUOTE -235) (|devaluate| |#2|)))) +((|HasCategory| |#2| (QUOTE (-237)))) (-258 R S V E) ((|constructor| (NIL "\\spadtype{DifferentialPolynomialCategory} is a category constructor specifying basic functions in an ordinary differential polynomial ring with a given ordered set of differential indeterminates. In addition,{} it implements defaults for the basic functions. The functions \\spadfun{order} and \\spadfun{weight} are extended from the set of derivatives of differential indeterminates to the set of differential polynomials. Other operations provided on differential polynomials are \\spadfun{leader},{} \\spadfun{initial},{} \\spadfun{separant},{} \\spadfun{differentialVariables},{} and \\spadfun{isobaric?}. Furthermore,{} if the ground ring is a differential ring,{} then evaluation (substitution of differential indeterminates by elements of the ground ring or by differential polynomials) is provided by \\spadfun{eval}. A convenient way of referencing derivatives is provided by the functions \\spadfun{makeVariable}. \\blankline To construct a domain using this constructor,{} one needs to provide a ground ring \\spad{R},{} an ordered set \\spad{S} of differential indeterminates,{} a ranking \\spad{V} on the set of derivatives of the differential indeterminates,{} and a set \\spad{E} of exponents in bijection with the set of differential monomials in the given differential indeterminates. \\blankline")) (|separant| (($ $) "\\spad{separant(p)} returns the partial derivative of the differential polynomial \\spad{p} with respect to its leader.")) (|initial| (($ $) "\\spad{initial(p)} returns the leading coefficient when the differential polynomial \\spad{p} is written as a univariate polynomial in its leader.")) (|leader| ((|#3| $) "\\spad{leader(p)} returns the derivative of the highest rank appearing in the differential polynomial \\spad{p} Note: an error occurs if \\spad{p} is in the ground ring.")) (|isobaric?| (((|Boolean|) $) "\\spad{isobaric?(p)} returns \\spad{true} if every differential monomial appearing in the differential polynomial \\spad{p} has same weight,{} and returns \\spad{false} otherwise.")) (|weight| (((|NonNegativeInteger|) $ |#2|) "\\spad{weight(p, s)} returns the maximum weight of all differential monomials appearing in the differential polynomial \\spad{p} when \\spad{p} is viewed as a differential polynomial in the differential indeterminate \\spad{s} alone.") (((|NonNegativeInteger|) $) "\\spad{weight(p)} returns the maximum weight of all differential monomials appearing in the differential polynomial \\spad{p}.")) (|weights| (((|List| (|NonNegativeInteger|)) $ |#2|) "\\spad{weights(p, s)} returns a list of weights of differential monomials appearing in the differential polynomial \\spad{p} when \\spad{p} is viewed as a differential polynomial in the differential indeterminate \\spad{s} alone.") (((|List| (|NonNegativeInteger|)) $) "\\spad{weights(p)} returns a list of weights of differential monomials appearing in differential polynomial \\spad{p}.")) (|degree| (((|NonNegativeInteger|) $ |#2|) "\\spad{degree(p, s)} returns the maximum degree of the differential polynomial \\spad{p} viewed as a differential polynomial in the differential indeterminate \\spad{s} alone.")) (|order| (((|NonNegativeInteger|) $) "\\spad{order(p)} returns the order of the differential polynomial \\spad{p},{} which is the maximum number of differentiations of a differential indeterminate,{} among all those appearing in \\spad{p}.") (((|NonNegativeInteger|) $ |#2|) "\\spad{order(p,s)} returns the order of the differential polynomial \\spad{p} in differential indeterminate \\spad{s}.")) (|differentialVariables| (((|List| |#2|) $) "\\spad{differentialVariables(p)} returns a list of differential indeterminates occurring in a differential polynomial \\spad{p}.")) (|makeVariable| (((|Mapping| $ (|NonNegativeInteger|)) $) "\\spad{makeVariable(p)} views \\spad{p} as an element of a differential ring,{} in such a way that the \\spad{n}-th derivative of \\spad{p} may be simply referenced as \\spad{z}.\\spad{n} where \\spad{z} \\spad{:=} makeVariable(\\spad{p}). Note: In the interpreter,{} \\spad{z} is given as an internal map,{} which may be ignored.") (((|Mapping| $ (|NonNegativeInteger|)) |#2|) "\\spad{makeVariable(s)} views \\spad{s} as a differential indeterminate,{} in such a way that the \\spad{n}-th derivative of \\spad{s} may be simply referenced as \\spad{z}.\\spad{n} where \\spad{z} :=makeVariable(\\spad{s}). Note: In the interpreter,{} \\spad{z} is given as an internal map,{} which may be ignored."))) (((-4456 "*") |has| |#1| (-174)) (-4447 |has| |#1| (-564)) (-4452 |has| |#1| (-6 -4452)) (-4449 . T) (-4448 . T) (-4451 . T)) @@ -1007,7 +1007,7 @@ NIL (-269 R S V) ((|constructor| (NIL "\\spadtype{DifferentialSparseMultivariatePolynomial} implements an ordinary differential polynomial ring by combining a domain belonging to the category \\spadtype{DifferentialVariableCategory} with the domain \\spadtype{SparseMultivariatePolynomial}. \\blankline"))) (((-4456 "*") |has| |#1| (-174)) (-4447 |has| |#1| (-564)) (-4452 |has| |#1| (-6 -4452)) (-4449 . T) (-4448 . T) (-4451 . T)) -((|HasCategory| |#1| (QUOTE (-918))) (-3783 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-918)))) (-3783 (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-918)))) (-3783 (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-918)))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-174))) (-3783 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| |#3| (LIST (QUOTE -895) (QUOTE (-386))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| |#3| (LIST (QUOTE -895) (QUOTE (-572))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| |#3| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| |#3| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#3| (LIST (QUOTE -622) (QUOTE (-544))))) (|HasCategory| |#1| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))) (-3783 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572)))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-237))) (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#1| (QUOTE (-370))) (|HasAttribute| |#1| (QUOTE -4452)) (|HasCategory| |#1| (QUOTE (-460))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-918)))) (-3783 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-918)))) (|HasCategory| |#1| (QUOTE (-146))))) +((|HasCategory| |#1| (QUOTE (-918))) (-2813 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-918)))) (-2813 (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-918)))) (-2813 (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-918)))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-174))) (-2813 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| |#3| (LIST (QUOTE -895) (QUOTE (-386))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| |#3| (LIST (QUOTE -895) (QUOTE (-572))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| |#3| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| |#3| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#3| (LIST (QUOTE -622) (QUOTE (-544))))) (|HasCategory| |#1| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))) (-2813 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572)))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-237))) (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#1| (QUOTE (-370))) (|HasAttribute| |#1| (QUOTE -4452)) (|HasCategory| |#1| (QUOTE (-460))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-918)))) (-2813 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-918)))) (|HasCategory| |#1| (QUOTE (-146))))) (-270 A S) ((|constructor| (NIL "\\spadtype{DifferentialVariableCategory} constructs the set of derivatives of a given set of (ordinary) differential indeterminates. If \\spad{x},{}...,{}\\spad{y} is an ordered set of differential indeterminates,{} and the prime notation is used for differentiation,{} then the set of derivatives (including zero-th order) of the differential indeterminates is \\spad{x},{}\\spad{x'},{}\\spad{x''},{}...,{} \\spad{y},{}\\spad{y'},{}\\spad{y''},{}... (Note: in the interpreter,{} the \\spad{n}-th derivative of \\spad{y} is displayed as \\spad{y} with a subscript \\spad{n}.) This set is viewed as a set of algebraic indeterminates,{} totally ordered in a way compatible with differentiation and the given order on the differential indeterminates. Such a total order is called a ranking of the differential indeterminates. \\blankline A domain in this category is needed to construct a differential polynomial domain. Differential polynomials are ordered by a ranking on the derivatives,{} and by an order (extending the ranking) on on the set of differential monomials. One may thus associate a domain in this category with a ranking of the differential indeterminates,{} just as one associates a domain in the category \\spadtype{OrderedAbelianMonoidSup} with an ordering of the set of monomials in a set of algebraic indeterminates. The ranking is specified through the binary relation \\spadfun{<}. For example,{} one may define one derivative to be less than another by lexicographically comparing first the \\spadfun{order},{} then the given order of the differential indeterminates appearing in the derivatives. This is the default implementation. \\blankline The notion of weight generalizes that of degree. A polynomial domain may be made into a graded ring if a weight function is given on the set of indeterminates,{} Very often,{} a grading is the first step in ordering the set of monomials. For differential polynomial domains,{} this constructor provides a function \\spadfun{weight},{} which allows the assignment of a non-negative number to each derivative of a differential indeterminate. For example,{} one may define the weight of a derivative to be simply its \\spadfun{order} (this is the default assignment). This weight function can then be extended to the set of all differential polynomials,{} providing a graded ring structure.")) (|coerce| (($ |#2|) "\\spad{coerce(s)} returns \\spad{s},{} viewed as the zero-th order derivative of \\spad{s}.")) (|differentiate| (($ $ (|NonNegativeInteger|)) "\\spad{differentiate(v, n)} returns the \\spad{n}-th derivative of \\spad{v}.") (($ $) "\\spad{differentiate(v)} returns the derivative of \\spad{v}.")) (|weight| (((|NonNegativeInteger|) $) "\\spad{weight(v)} returns the weight of the derivative \\spad{v}.")) (|variable| ((|#2| $) "\\spad{variable(v)} returns \\spad{s} if \\spad{v} is any derivative of the differential indeterminate \\spad{s}.")) (|order| (((|NonNegativeInteger|) $) "\\spad{order(v)} returns \\spad{n} if \\spad{v} is the \\spad{n}-th derivative of any differential indeterminate.")) (|makeVariable| (($ |#2| (|NonNegativeInteger|)) "\\spad{makeVariable(s, n)} returns the \\spad{n}-th derivative of a differential indeterminate \\spad{s} as an algebraic indeterminate."))) NIL @@ -1052,11 +1052,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 -(-281 R -3636) +(-281 R -1384) ((|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 -(-282 R -3636) +(-282 R -1384) ((|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 @@ -1108,7 +1108,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 -(-295 S R |Mod| -4322 -4086 |exactQuo|) +(-295 S R |Mod| -3635 -1867 |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"))) ((-4447 . T) ((-4456 "*") . T) (-4448 . T) (-4449 . T) (-4451 . T)) NIL @@ -1130,21 +1130,21 @@ NIL NIL (-300 S) ((|constructor| (NIL "Equations as mathematical objects. All properties of the basis domain,{} \\spadignore{e.g.} being an abelian group are carried over the equation domain,{} by performing the structural operations on the left and on the right hand side.")) (|subst| (($ $ $) "\\spad{subst(eq1,eq2)} substitutes \\spad{eq2} into both sides of \\spad{eq1} the \\spad{lhs} of \\spad{eq2} should be a kernel")) (|inv| (($ $) "\\spad{inv(x)} returns the multiplicative inverse of \\spad{x}.")) (/ (($ $ $) "\\spad{e1/e2} produces a new equation by dividing the left and right hand sides of equations e1 and e2.")) (|factorAndSplit| (((|List| $) $) "\\spad{factorAndSplit(eq)} make the right hand side 0 and factors the new left hand side. Each factor is equated to 0 and put into the resulting list without repetitions.")) (|rightOne| (((|Union| $ "failed") $) "\\spad{rightOne(eq)} divides by the right hand side.") (((|Union| $ "failed") $) "\\spad{rightOne(eq)} divides by the right hand side,{} if possible.")) (|leftOne| (((|Union| $ "failed") $) "\\spad{leftOne(eq)} divides by the left hand side.") (((|Union| $ "failed") $) "\\spad{leftOne(eq)} divides by the left hand side,{} if possible.")) (* (($ $ |#1|) "\\spad{eqn*x} produces a new equation by multiplying both sides of equation eqn by \\spad{x}.") (($ |#1| $) "\\spad{x*eqn} produces a new equation by multiplying both sides of equation eqn by \\spad{x}.")) (- (($ $ |#1|) "\\spad{eqn-x} produces a new equation by subtracting \\spad{x} from both sides of equation eqn.") (($ |#1| $) "\\spad{x-eqn} produces a new equation by subtracting both sides of equation eqn from \\spad{x}.")) (|rightZero| (($ $) "\\spad{rightZero(eq)} subtracts the right hand side.")) (|leftZero| (($ $) "\\spad{leftZero(eq)} subtracts the left hand side.")) (+ (($ $ |#1|) "\\spad{eqn+x} produces a new equation by adding \\spad{x} to both sides of equation eqn.") (($ |#1| $) "\\spad{x+eqn} produces a new equation by adding \\spad{x} to both sides of equation eqn.")) (|eval| (($ $ (|List| $)) "\\spad{eval(eqn, [x1=v1, ... xn=vn])} replaces \\spad{xi} by \\spad{vi} in equation \\spad{eqn}.") (($ $ $) "\\spad{eval(eqn, x=f)} replaces \\spad{x} by \\spad{f} in equation \\spad{eqn}.")) (|map| (($ (|Mapping| |#1| |#1|) $) "\\spad{map(f,eqn)} constructs a new equation by applying \\spad{f} to both sides of \\spad{eqn}.")) (|rhs| ((|#1| $) "\\spad{rhs(eqn)} returns the right hand side of equation \\spad{eqn}.")) (|lhs| ((|#1| $) "\\spad{lhs(eqn)} returns the left hand side of equation \\spad{eqn}.")) (|swap| (($ $) "\\spad{swap(eq)} interchanges left and right hand side of equation \\spad{eq}.")) (|equation| (($ |#1| |#1|) "\\spad{equation(a,b)} creates an equation.")) (= (($ |#1| |#1|) "\\spad{a=b} creates an equation."))) -((-4451 -3783 (|has| |#1| (-1060)) (|has| |#1| (-481))) (-4448 |has| |#1| (-1060)) (-4449 |has| |#1| (-1060))) -((|HasCategory| |#1| (QUOTE (-370))) (-3783 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-1060)))) (-3783 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-1060))) (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (-3783 (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#1| (QUOTE (-1060)))) (-3783 (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-1060)))) (-3783 (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-1060)))) (-3783 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-1060)))) (-3783 (|HasCategory| |#1| (QUOTE (-481))) (|HasCategory| |#1| (QUOTE (-734)))) (|HasCategory| |#1| (QUOTE (-481))) (-3783 (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-481))) (|HasCategory| |#1| (QUOTE (-734))) (|HasCategory| |#1| (QUOTE (-1060))) (|HasCategory| |#1| (QUOTE (-1123))) (|HasCategory| |#1| (QUOTE (-1111)))) (-3783 (|HasCategory| |#1| (QUOTE (-481))) (|HasCategory| |#1| (QUOTE (-734))) (|HasCategory| |#1| (QUOTE (-1123)))) (|HasCategory| |#1| (LIST (QUOTE -522) (QUOTE (-1188)) (|devaluate| |#1|))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-308))) (-3783 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-481)))) (-3783 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-734)))) (-3783 (|HasCategory| |#1| (QUOTE (-481))) (|HasCategory| |#1| (QUOTE (-1060)))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-1123))) (|HasCategory| |#1| (QUOTE (-734)))) +((-4451 -2813 (|has| |#1| (-1060)) (|has| |#1| (-481))) (-4448 |has| |#1| (-1060)) (-4449 |has| |#1| (-1060))) +((|HasCategory| |#1| (QUOTE (-370))) (-2813 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-1060)))) (-2813 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-1060))) (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (-2813 (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#1| (QUOTE (-1060)))) (-2813 (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-1060)))) (-2813 (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-1060)))) (-2813 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-1060)))) (-2813 (|HasCategory| |#1| (QUOTE (-481))) (|HasCategory| |#1| (QUOTE (-734)))) (|HasCategory| |#1| (QUOTE (-481))) (-2813 (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-481))) (|HasCategory| |#1| (QUOTE (-734))) (|HasCategory| |#1| (QUOTE (-1060))) (|HasCategory| |#1| (QUOTE (-1123))) (|HasCategory| |#1| (QUOTE (-1111)))) (-2813 (|HasCategory| |#1| (QUOTE (-481))) (|HasCategory| |#1| (QUOTE (-734))) (|HasCategory| |#1| (QUOTE (-1123)))) (|HasCategory| |#1| (LIST (QUOTE -522) (QUOTE (-1188)) (|devaluate| |#1|))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-308))) (-2813 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-481)))) (-2813 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-734)))) (-2813 (|HasCategory| |#1| (QUOTE (-481))) (|HasCategory| |#1| (QUOTE (-1060)))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-1123))) (|HasCategory| |#1| (QUOTE (-734)))) (-301 |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."))) ((-4454 . T) (-4455 . T)) -((-12 (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (QUOTE (-1111))) (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (LIST (QUOTE -315) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -1640) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3763) (|devaluate| |#2|)))))) (-3783 (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (QUOTE (-1111))) (|HasCategory| |#2| (QUOTE (-1111)))) (-3783 (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (QUOTE (-1111))) (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (LIST (QUOTE -622) (QUOTE (-544)))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (QUOTE (-1111))) (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#2| (QUOTE (-1111))) (-3783 (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (LIST (QUOTE -621) (QUOTE (-870))))) +((-12 (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (QUOTE (-1111))) (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (LIST (QUOTE -315) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -3690) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -1907) (|devaluate| |#2|)))))) (-2813 (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (QUOTE (-1111))) (|HasCategory| |#2| (QUOTE (-1111)))) (-2813 (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (QUOTE (-1111))) (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (LIST (QUOTE -622) (QUOTE (-544)))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (QUOTE (-1111))) (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#2| (QUOTE (-1111))) (-2813 (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (LIST (QUOTE -621) (QUOTE (-870))))) (-302) ((|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 -(-303 -3636 S) +(-303 -1384 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 -(-304 E -3636) +(-304 E -1384) ((|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 @@ -1192,7 +1192,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 -(-316 -3636) +(-316 -1384) ((|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 @@ -1207,7 +1207,7 @@ NIL (-319 R FE |var| |cen|) ((|constructor| (NIL "UnivariatePuiseuxSeriesWithExponentialSingularity is a domain used to represent essential singularities of functions. Objects in this domain are quotients of sums,{} where each term in the sum is a univariate Puiseux series times the exponential of a univariate Puiseux series.")) (|coerce| (($ (|UnivariatePuiseuxSeries| |#2| |#3| |#4|)) "\\spad{coerce(f)} converts a \\spadtype{UnivariatePuiseuxSeries} to an \\spadtype{ExponentialExpansion}.")) (|limitPlus| (((|Union| (|OrderedCompletion| |#2|) "failed") $) "\\spad{limitPlus(f(var))} returns \\spad{limit(var -> a+,f(var))}."))) ((-4446 . T) (-4452 . T) (-4447 . T) ((-4456 "*") . T) (-4448 . T) (-4449 . T) (-4451 . T)) -((|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (QUOTE (-918))) (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (LIST (QUOTE -1049) (QUOTE (-1188)))) (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (QUOTE (-146))) (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (QUOTE (-148))) (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (QUOTE (-1033))) (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (QUOTE (-828))) (-3783 (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (QUOTE (-828))) (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (QUOTE (-858)))) (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (QUOTE (-1163))) (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (QUOTE (-237))) (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (LIST (QUOTE -522) (QUOTE (-1188)) (LIST (QUOTE -1265) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#4|)))) (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (LIST (QUOTE -315) (LIST (QUOTE -1265) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#4|)))) (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (LIST (QUOTE -292) (LIST (QUOTE -1265) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#4|)) (LIST (QUOTE -1265) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#4|)))) (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (QUOTE (-313))) (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (QUOTE (-553))) (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (QUOTE (-858))) (-12 (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (QUOTE (-918))) (|HasCategory| $ (QUOTE (-146)))) (-3783 (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (QUOTE (-146))) (-12 (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (QUOTE (-918))) (|HasCategory| $ (QUOTE (-146)))))) +((|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (QUOTE (-918))) (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (LIST (QUOTE -1049) (QUOTE (-1188)))) (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (QUOTE (-146))) (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (QUOTE (-148))) (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (QUOTE (-1033))) (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (QUOTE (-828))) (-2813 (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (QUOTE (-828))) (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (QUOTE (-858)))) (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (QUOTE (-1163))) (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (QUOTE (-237))) (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (LIST (QUOTE -522) (QUOTE (-1188)) (LIST (QUOTE -1265) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#4|)))) (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (LIST (QUOTE -315) (LIST (QUOTE -1265) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#4|)))) (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (LIST (QUOTE -292) (LIST (QUOTE -1265) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#4|)) (LIST (QUOTE -1265) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#4|)))) (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (QUOTE (-313))) (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (QUOTE (-553))) (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (QUOTE (-858))) (-12 (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (QUOTE (-918))) (|HasCategory| $ (QUOTE (-146)))) (-2813 (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (QUOTE (-146))) (-12 (|HasCategory| (-1265 |#1| |#2| |#3| |#4|) (QUOTE (-918))) (|HasCategory| $ (QUOTE (-146)))))) (-320 R S) ((|constructor| (NIL "Lifting of maps to Expressions. Date Created: 16 Jan 1989 Date Last Updated: 22 Jan 1990")) (|map| (((|Expression| |#2|) (|Mapping| |#2| |#1|) (|Expression| |#1|)) "\\spad{map(f, e)} applies \\spad{f} to all the constants appearing in \\spad{e}."))) NIL @@ -1218,9 +1218,9 @@ NIL NIL (-322 R) ((|constructor| (NIL "Expressions involving symbolic functions.")) (|squareFreePolynomial| (((|Factored| (|SparseUnivariatePolynomial| $)) (|SparseUnivariatePolynomial| $)) "\\spad{squareFreePolynomial(p)} \\undocumented{}")) (|factorPolynomial| (((|Factored| (|SparseUnivariatePolynomial| $)) (|SparseUnivariatePolynomial| $)) "\\spad{factorPolynomial(p)} \\undocumented{}")) (|simplifyPower| (($ $ (|Integer|)) "simplifyPower?(\\spad{f},{}\\spad{n}) \\undocumented{}")) (|number?| (((|Boolean|) $) "\\spad{number?(f)} tests if \\spad{f} is rational")) (|reduce| (($ $) "\\spad{reduce(f)} simplifies all the unreduced algebraic quantities present in \\spad{f} by applying their defining relations."))) -((-4451 -3783 (-3804 (|has| |#1| (-1060)) (|has| |#1| (-647 (-572)))) (-12 (|has| |#1| (-564)) (-3783 (-3804 (|has| |#1| (-1060)) (|has| |#1| (-647 (-572)))) (|has| |#1| (-1060)) (|has| |#1| (-481)))) (|has| |#1| (-1060)) (|has| |#1| (-481))) (-4449 |has| |#1| (-174)) (-4448 |has| |#1| (-174)) ((-4456 "*") |has| |#1| (-564)) (-4447 |has| |#1| (-564)) (-4452 |has| |#1| (-564)) (-4446 |has| |#1| (-564))) -((-3783 (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (-12 (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))))) (|HasCategory| |#1| (QUOTE (-564))) (-3783 (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-1060)))) (|HasCategory| |#1| (QUOTE (-21))) (-3783 (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-564)))) (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-1060))) (|HasCategory| |#1| (LIST (QUOTE -647) (QUOTE (-572)))) (-3783 (|HasCategory| |#1| (QUOTE (-481))) (|HasCategory| |#1| (QUOTE (-1123)))) (|HasCategory| |#1| (QUOTE (-481))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544)))) (-3783 (|HasCategory| |#1| (QUOTE (-1060))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (-12 (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572))))) (-3783 (|HasCategory| |#1| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-1060)))) (-3783 (|HasCategory| |#1| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-1060)))) (-3783 (|HasCategory| |#1| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-1060)))) (-12 (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-564)))) (-3783 (|HasCategory| |#1| (QUOTE (-481))) (|HasCategory| |#1| (QUOTE (-564)))) (-12 (|HasCategory| |#1| (QUOTE (-1060))) (|HasCategory| |#1| (LIST (QUOTE -647) (QUOTE (-572))))) (-3783 (-12 (|HasCategory| |#1| (QUOTE (-1060))) (|HasCategory| |#1| (LIST (QUOTE -647) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-1123)))) (-3783 (|HasCategory| |#1| (QUOTE (-21))) (-12 (|HasCategory| |#1| (QUOTE (-1060))) (|HasCategory| |#1| (LIST (QUOTE -647) (QUOTE (-572)))))) (-3783 (|HasCategory| |#1| (QUOTE (-25))) (-12 (|HasCategory| |#1| (QUOTE (-1060))) (|HasCategory| |#1| (LIST (QUOTE -647) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-1123)))) (-3783 (|HasCategory| |#1| (QUOTE (-25))) (-12 (|HasCategory| |#1| (QUOTE (-1060))) (|HasCategory| |#1| (LIST (QUOTE -647) (QUOTE (-572)))))) (-3783 (|HasCategory| |#1| (QUOTE (-481))) (|HasCategory| |#1| (QUOTE (-1060)))) (-3783 (-12 (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-564)))) (-12 (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-1123))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| $ (QUOTE (-1060))) (|HasCategory| $ (LIST (QUOTE -1049) (QUOTE (-572))))) -(-323 R -3636) +((-4451 -2813 (-2085 (|has| |#1| (-1060)) (|has| |#1| (-647 (-572)))) (-12 (|has| |#1| (-564)) (-2813 (-2085 (|has| |#1| (-1060)) (|has| |#1| (-647 (-572)))) (|has| |#1| (-1060)) (|has| |#1| (-481)))) (|has| |#1| (-1060)) (|has| |#1| (-481))) (-4449 |has| |#1| (-174)) (-4448 |has| |#1| (-174)) ((-4456 "*") |has| |#1| (-564)) (-4447 |has| |#1| (-564)) (-4452 |has| |#1| (-564)) (-4446 |has| |#1| (-564))) +((-2813 (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (-12 (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))))) (|HasCategory| |#1| (QUOTE (-564))) (-2813 (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-1060)))) (|HasCategory| |#1| (QUOTE (-21))) (-2813 (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-564)))) (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-1060))) (|HasCategory| |#1| (LIST (QUOTE -647) (QUOTE (-572)))) (-2813 (|HasCategory| |#1| (QUOTE (-481))) (|HasCategory| |#1| (QUOTE (-1123)))) (|HasCategory| |#1| (QUOTE (-481))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544)))) (-2813 (|HasCategory| |#1| (QUOTE (-1060))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (-12 (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572))))) (-2813 (|HasCategory| |#1| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-1060)))) (-2813 (|HasCategory| |#1| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-1060)))) (-2813 (|HasCategory| |#1| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-1060)))) (-12 (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-564)))) (-2813 (|HasCategory| |#1| (QUOTE (-481))) (|HasCategory| |#1| (QUOTE (-564)))) (-12 (|HasCategory| |#1| (QUOTE (-1060))) (|HasCategory| |#1| (LIST (QUOTE -647) (QUOTE (-572))))) (-2813 (-12 (|HasCategory| |#1| (QUOTE (-1060))) (|HasCategory| |#1| (LIST (QUOTE -647) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-1123)))) (-2813 (|HasCategory| |#1| (QUOTE (-21))) (-12 (|HasCategory| |#1| (QUOTE (-1060))) (|HasCategory| |#1| (LIST (QUOTE -647) (QUOTE (-572)))))) (-2813 (|HasCategory| |#1| (QUOTE (-25))) (-12 (|HasCategory| |#1| (QUOTE (-1060))) (|HasCategory| |#1| (LIST (QUOTE -647) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-1123)))) (-2813 (|HasCategory| |#1| (QUOTE (-25))) (-12 (|HasCategory| |#1| (QUOTE (-1060))) (|HasCategory| |#1| (LIST (QUOTE -647) (QUOTE (-572)))))) (-2813 (|HasCategory| |#1| (QUOTE (-481))) (|HasCategory| |#1| (QUOTE (-1060)))) (-2813 (-12 (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-564)))) (-12 (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-1123))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| $ (QUOTE (-1060))) (|HasCategory| $ (LIST (QUOTE -1049) (QUOTE (-572))))) +(-323 R -1384) ((|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 @@ -1231,7 +1231,7 @@ NIL (-325 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."))) (((-4456 "*") |has| |#1| (-174)) (-4447 |has| |#1| (-564)) (-4452 |has| |#1| (-370)) (-4446 |has| |#1| (-370)) (-4448 . T) (-4449 . T) (-4451 . T)) -((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-174))) (-3783 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564)))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (-12 (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -415) (QUOTE (-572))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -415) (QUOTE (-572))) (|devaluate| |#1|)))) (|HasCategory| (-415 (-572)) (QUOTE (-1123))) (|HasCategory| |#1| (QUOTE (-370))) (-3783 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-564)))) (-3783 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-564)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -415) (QUOTE (-572)))))) (|HasSignature| |#1| (LIST (QUOTE -3491) (LIST (|devaluate| |#1|) (QUOTE (-1188)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -415) (QUOTE (-572)))))) (-3783 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-968))) (|HasCategory| |#1| (QUOTE (-1214))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasSignature| |#1| (LIST (QUOTE -3270) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1188))))) (|HasSignature| |#1| (LIST (QUOTE -2221) (LIST (LIST (QUOTE -652) (QUOTE (-1188))) (|devaluate| |#1|))))))) +((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-174))) (-2813 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564)))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (-12 (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -415) (QUOTE (-572))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -415) (QUOTE (-572))) (|devaluate| |#1|)))) (|HasCategory| (-415 (-572)) (QUOTE (-1123))) (|HasCategory| |#1| (QUOTE (-370))) (-2813 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-564)))) (-2813 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-564)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -415) (QUOTE (-572)))))) (|HasSignature| |#1| (LIST (QUOTE -2940) (LIST (|devaluate| |#1|) (QUOTE (-1188)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -415) (QUOTE (-572)))))) (-2813 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-968))) (|HasCategory| |#1| (QUOTE (-1214))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasSignature| |#1| (LIST (QUOTE -3921) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1188))))) (|HasSignature| |#1| (LIST (QUOTE -4353) (LIST (LIST (QUOTE -652) (QUOTE (-1188))) (|devaluate| |#1|))))))) (-326 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 @@ -1263,12 +1263,12 @@ NIL (-333 S) ((|constructor| (NIL "\\indented{1}{A FlexibleArray is the notion of an array intended to allow for growth} at the end only. Hence the following efficient operations \\indented{2}{\\spad{append(x,a)} meaning append item \\spad{x} at the end of the array \\spad{a}} \\indented{2}{\\spad{delete(a,n)} meaning delete the last item from the array \\spad{a}} Flexible arrays support the other operations inherited from \\spadtype{ExtensibleLinearAggregate}. However,{} these are not efficient. Flexible arrays combine the \\spad{O(1)} access time property of arrays with growing and shrinking at the end in \\spad{O(1)} (average) time. This is done by using an ordinary array which may have zero or more empty slots at the end. When the array becomes full it is copied into a new larger (50\\% larger) array. Conversely,{} when the array becomes less than 1/2 full,{} it is copied into a smaller array. Flexible arrays provide for an efficient implementation of many data structures in particular heaps,{} stacks and sets."))) ((-4455 . T) (-4454 . T)) -((-3783 (-12 (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) (-3783 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544)))) (-3783 (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-1111)))) (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| (-572) (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) -(-334 S -3636) +((-2813 (-12 (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) (-2813 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544)))) (-2813 (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-1111)))) (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| (-572) (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) +(-334 S -1384) ((|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 (-375)))) -(-335 -3636) +(-335 -1384) ((|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."))) ((-4446 . T) (-4452 . T) (-4447 . T) ((-4456 "*") . T) (-4448 . T) (-4449 . T) (-4451 . T)) NIL @@ -1292,15 +1292,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 -(-341 S -3636 UP UPUP R) +(-341 S -1384 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 -(-342 -3636 UP UPUP R) +(-342 -1384 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 -(-343 -3636 UP UPUP R) +(-343 -1384 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 @@ -1320,26 +1320,26 @@ 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 -(-348 S -3636 UP UPUP) +(-348 S -1384 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 (-375))) (|HasCategory| |#2| (QUOTE (-370)))) -(-349 -3636 UP UPUP) +(-349 -1384 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."))) ((-4447 |has| (-415 |#2|) (-370)) (-4452 |has| (-415 |#2|) (-370)) (-4446 |has| (-415 |#2|) (-370)) ((-4456 "*") . T) (-4448 . T) (-4449 . T) (-4451 . T)) NIL (-350 |p| |extdeg|) ((|constructor| (NIL "FiniteFieldCyclicGroup(\\spad{p},{}\\spad{n}) implements a finite field extension of degee \\spad{n} over the prime field with \\spad{p} elements. Its elements are represented by powers of a primitive element,{} \\spadignore{i.e.} a generator of the multiplicative (cyclic) group. As primitive element we choose the root of the extension polynomial,{} which is created by {\\em createPrimitivePoly} from \\spadtype{FiniteFieldPolynomialPackage}. The Zech logarithms are stored in a table of size half of the field size,{} and use \\spadtype{SingleInteger} for representing field elements,{} hence,{} there are restrictions on the size of the field.")) (|getZechTable| (((|PrimitiveArray| (|SingleInteger|))) "\\spad{getZechTable()} returns the zech logarithm table of the field. This table is used to perform additions in the field quickly."))) ((-4446 . T) (-4452 . T) (-4447 . T) ((-4456 "*") . T) (-4448 . T) (-4449 . T) (-4451 . T)) -((-3783 (|HasCategory| (-919 |#1|) (QUOTE (-146))) (|HasCategory| (-919 |#1|) (QUOTE (-375)))) (|HasCategory| (-919 |#1|) (QUOTE (-148))) (|HasCategory| (-919 |#1|) (QUOTE (-375))) (|HasCategory| (-919 |#1|) (QUOTE (-146)))) +((-2813 (|HasCategory| (-919 |#1|) (QUOTE (-146))) (|HasCategory| (-919 |#1|) (QUOTE (-375)))) (|HasCategory| (-919 |#1|) (QUOTE (-148))) (|HasCategory| (-919 |#1|) (QUOTE (-375))) (|HasCategory| (-919 |#1|) (QUOTE (-146)))) (-351 GF |defpol|) ((|constructor| (NIL "FiniteFieldCyclicGroupExtensionByPolynomial(\\spad{GF},{}defpol) implements a finite extension field of the ground field {\\em GF}. Its elements are represented by powers of a primitive element,{} \\spadignore{i.e.} a generator of the multiplicative (cyclic) group. As primitive element we choose the root of the extension polynomial {\\em defpol},{} which MUST be primitive (user responsibility). Zech logarithms are stored in a table of size half of the field size,{} and use \\spadtype{SingleInteger} for representing field elements,{} hence,{} there are restrictions on the size of the field.")) (|getZechTable| (((|PrimitiveArray| (|SingleInteger|))) "\\spad{getZechTable()} returns the zech logarithm table of the field it is used to perform additions in the field quickly."))) ((-4446 . T) (-4452 . T) (-4447 . T) ((-4456 "*") . T) (-4448 . T) (-4449 . T) (-4451 . T)) -((-3783 (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-375)))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-375))) (|HasCategory| |#1| (QUOTE (-146)))) +((-2813 (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-375)))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-375))) (|HasCategory| |#1| (QUOTE (-146)))) (-352 GF |extdeg|) ((|constructor| (NIL "FiniteFieldCyclicGroupExtension(\\spad{GF},{}\\spad{n}) implements a extension of degree \\spad{n} over the ground field {\\em GF}. Its elements are represented by powers of a primitive element,{} \\spadignore{i.e.} a generator of the multiplicative (cyclic) group. As primitive element we choose the root of the extension polynomial,{} which is created by {\\em createPrimitivePoly} from \\spadtype{FiniteFieldPolynomialPackage}. Zech logarithms are stored in a table of size half of the field size,{} and use \\spadtype{SingleInteger} for representing field elements,{} hence,{} there are restrictions on the size of the field.")) (|getZechTable| (((|PrimitiveArray| (|SingleInteger|))) "\\spad{getZechTable()} returns the zech logarithm table of the field. This table is used to perform additions in the field quickly."))) ((-4446 . T) (-4452 . T) (-4447 . T) ((-4456 "*") . T) (-4448 . T) (-4449 . T) (-4451 . T)) -((-3783 (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-375)))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-375))) (|HasCategory| |#1| (QUOTE (-146)))) +((-2813 (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-375)))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-375))) (|HasCategory| |#1| (QUOTE (-146)))) (-353 GF) ((|constructor| (NIL "FiniteFieldFunctions(\\spad{GF}) is a package with functions concerning finite extension fields of the finite ground field {\\em GF},{} \\spadignore{e.g.} Zech logarithms.")) (|createLowComplexityNormalBasis| (((|Union| (|SparseUnivariatePolynomial| |#1|) (|Vector| (|List| (|Record| (|:| |value| |#1|) (|:| |index| (|SingleInteger|)))))) (|PositiveInteger|)) "\\spad{createLowComplexityNormalBasis(n)} tries to find a a low complexity normal basis of degree {\\em n} over {\\em GF} and returns its multiplication matrix If no low complexity basis is found it calls \\axiomFunFrom{createNormalPoly}{FiniteFieldPolynomialPackage}(\\spad{n}) to produce a normal polynomial of degree {\\em n} over {\\em GF}")) (|createLowComplexityTable| (((|Union| (|Vector| (|List| (|Record| (|:| |value| |#1|) (|:| |index| (|SingleInteger|))))) "failed") (|PositiveInteger|)) "\\spad{createLowComplexityTable(n)} tries to find a low complexity normal basis of degree {\\em n} over {\\em GF} and returns its multiplication matrix Fails,{} if it does not find a low complexity basis")) (|sizeMultiplication| (((|NonNegativeInteger|) (|Vector| (|List| (|Record| (|:| |value| |#1|) (|:| |index| (|SingleInteger|)))))) "\\spad{sizeMultiplication(m)} returns the number of entries of the multiplication table {\\em m}.")) (|createMultiplicationMatrix| (((|Matrix| |#1|) (|Vector| (|List| (|Record| (|:| |value| |#1|) (|:| |index| (|SingleInteger|)))))) "\\spad{createMultiplicationMatrix(m)} forms the multiplication table {\\em m} into a matrix over the ground field.")) (|createMultiplicationTable| (((|Vector| (|List| (|Record| (|:| |value| |#1|) (|:| |index| (|SingleInteger|))))) (|SparseUnivariatePolynomial| |#1|)) "\\spad{createMultiplicationTable(f)} generates a multiplication table for the normal basis of the field extension determined by {\\em f}. This is needed to perform multiplications between elements represented as coordinate vectors to this basis. See \\spadtype{FFNBP},{} \\spadtype{FFNBX}.")) (|createZechTable| (((|PrimitiveArray| (|SingleInteger|)) (|SparseUnivariatePolynomial| |#1|)) "\\spad{createZechTable(f)} generates a Zech logarithm table for the cyclic group representation of a extension of the ground field by the primitive polynomial {\\em f(x)},{} \\spadignore{i.e.} \\spad{Z(i)},{} defined by {\\em x**Z(i) = 1+x**i} is stored at index \\spad{i}. This is needed in particular to perform addition of field elements in finite fields represented in this way. See \\spadtype{FFCGP},{} \\spadtype{FFCGX}."))) NIL @@ -1356,31 +1356,31 @@ 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."))) ((-4446 . T) (-4452 . T) (-4447 . T) ((-4456 "*") . T) (-4448 . T) (-4449 . T) (-4451 . T)) NIL -(-357 R UP -3636) +(-357 R UP -1384) ((|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 (-358 |p| |extdeg|) ((|constructor| (NIL "FiniteFieldNormalBasis(\\spad{p},{}\\spad{n}) implements a finite extension field of degree \\spad{n} over the prime field with \\spad{p} elements. The elements are represented by coordinate vectors with respect to a normal basis,{} \\spadignore{i.e.} a basis consisting of the conjugates (\\spad{q}-powers) of an element,{} in this case called normal element. This is chosen as a root of the extension polynomial created by \\spadfunFrom{createNormalPoly}{FiniteFieldPolynomialPackage}.")) (|sizeMultiplication| (((|NonNegativeInteger|)) "\\spad{sizeMultiplication()} returns the number of entries in the multiplication table of the field. Note: The time of multiplication of field elements depends on this size.")) (|getMultiplicationMatrix| (((|Matrix| (|PrimeField| |#1|))) "\\spad{getMultiplicationMatrix()} returns the multiplication table in form of a matrix.")) (|getMultiplicationTable| (((|Vector| (|List| (|Record| (|:| |value| (|PrimeField| |#1|)) (|:| |index| (|SingleInteger|)))))) "\\spad{getMultiplicationTable()} returns the multiplication table for the normal basis of the field. This table is used to perform multiplications between field elements."))) ((-4446 . T) (-4452 . T) (-4447 . T) ((-4456 "*") . T) (-4448 . T) (-4449 . T) (-4451 . T)) -((-3783 (|HasCategory| (-919 |#1|) (QUOTE (-146))) (|HasCategory| (-919 |#1|) (QUOTE (-375)))) (|HasCategory| (-919 |#1|) (QUOTE (-148))) (|HasCategory| (-919 |#1|) (QUOTE (-375))) (|HasCategory| (-919 |#1|) (QUOTE (-146)))) +((-2813 (|HasCategory| (-919 |#1|) (QUOTE (-146))) (|HasCategory| (-919 |#1|) (QUOTE (-375)))) (|HasCategory| (-919 |#1|) (QUOTE (-148))) (|HasCategory| (-919 |#1|) (QUOTE (-375))) (|HasCategory| (-919 |#1|) (QUOTE (-146)))) (-359 GF |uni|) ((|constructor| (NIL "FiniteFieldNormalBasisExtensionByPolynomial(\\spad{GF},{}uni) implements a finite extension of the ground field {\\em GF}. The elements are represented by coordinate vectors with respect to. a normal basis,{} \\spadignore{i.e.} a basis consisting of the conjugates (\\spad{q}-powers) of an element,{} in this case called normal element,{} where \\spad{q} is the size of {\\em GF}. The normal element is chosen as a root of the extension polynomial,{} which MUST be normal over {\\em GF} (user responsibility)")) (|sizeMultiplication| (((|NonNegativeInteger|)) "\\spad{sizeMultiplication()} returns the number of entries in the multiplication table of the field. Note: the time of multiplication of field elements depends on this size.")) (|getMultiplicationMatrix| (((|Matrix| |#1|)) "\\spad{getMultiplicationMatrix()} returns the multiplication table in form of a matrix.")) (|getMultiplicationTable| (((|Vector| (|List| (|Record| (|:| |value| |#1|) (|:| |index| (|SingleInteger|)))))) "\\spad{getMultiplicationTable()} returns the multiplication table for the normal basis of the field. This table is used to perform multiplications between field elements."))) ((-4446 . T) (-4452 . T) (-4447 . T) ((-4456 "*") . T) (-4448 . T) (-4449 . T) (-4451 . T)) -((-3783 (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-375)))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-375))) (|HasCategory| |#1| (QUOTE (-146)))) +((-2813 (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-375)))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-375))) (|HasCategory| |#1| (QUOTE (-146)))) (-360 GF |extdeg|) ((|constructor| (NIL "FiniteFieldNormalBasisExtensionByPolynomial(\\spad{GF},{}\\spad{n}) implements a finite extension field of degree \\spad{n} over the ground field {\\em GF}. The elements are represented by coordinate vectors with respect to a normal basis,{} \\spadignore{i.e.} a basis consisting of the conjugates (\\spad{q}-powers) of an element,{} in this case called normal element. This is chosen as a root of the extension polynomial,{} created by {\\em createNormalPoly} from \\spadtype{FiniteFieldPolynomialPackage}")) (|sizeMultiplication| (((|NonNegativeInteger|)) "\\spad{sizeMultiplication()} returns the number of entries in the multiplication table of the field. Note: the time of multiplication of field elements depends on this size.")) (|getMultiplicationMatrix| (((|Matrix| |#1|)) "\\spad{getMultiplicationMatrix()} returns the multiplication table in form of a matrix.")) (|getMultiplicationTable| (((|Vector| (|List| (|Record| (|:| |value| |#1|) (|:| |index| (|SingleInteger|)))))) "\\spad{getMultiplicationTable()} returns the multiplication table for the normal basis of the field. This table is used to perform multiplications between field elements."))) ((-4446 . T) (-4452 . T) (-4447 . T) ((-4456 "*") . T) (-4448 . T) (-4449 . T) (-4451 . T)) -((-3783 (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-375)))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-375))) (|HasCategory| |#1| (QUOTE (-146)))) +((-2813 (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-375)))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-375))) (|HasCategory| |#1| (QUOTE (-146)))) (-361 |p| |n|) ((|constructor| (NIL "FiniteField(\\spad{p},{}\\spad{n}) implements finite fields with p**n elements. This packages checks that \\spad{p} is prime. For a non-checking version,{} see \\spadtype{InnerFiniteField}."))) ((-4446 . T) (-4452 . T) (-4447 . T) ((-4456 "*") . T) (-4448 . T) (-4449 . T) (-4451 . T)) -((-3783 (|HasCategory| (-919 |#1|) (QUOTE (-146))) (|HasCategory| (-919 |#1|) (QUOTE (-375)))) (|HasCategory| (-919 |#1|) (QUOTE (-148))) (|HasCategory| (-919 |#1|) (QUOTE (-375))) (|HasCategory| (-919 |#1|) (QUOTE (-146)))) +((-2813 (|HasCategory| (-919 |#1|) (QUOTE (-146))) (|HasCategory| (-919 |#1|) (QUOTE (-375)))) (|HasCategory| (-919 |#1|) (QUOTE (-148))) (|HasCategory| (-919 |#1|) (QUOTE (-375))) (|HasCategory| (-919 |#1|) (QUOTE (-146)))) (-362 GF |defpol|) ((|constructor| (NIL "FiniteFieldExtensionByPolynomial(\\spad{GF},{} defpol) implements the extension of the finite field {\\em GF} generated by the extension polynomial {\\em defpol} which MUST be irreducible. Note: the user has the responsibility to ensure that {\\em defpol} is irreducible."))) ((-4446 . T) (-4452 . T) (-4447 . T) ((-4456 "*") . T) (-4448 . T) (-4449 . T) (-4451 . T)) -((-3783 (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-375)))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-375))) (|HasCategory| |#1| (QUOTE (-146)))) -(-363 -3636 GF) +((-2813 (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-375)))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-375))) (|HasCategory| |#1| (QUOTE (-146)))) +(-363 -1384 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 @@ -1388,14 +1388,14 @@ 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 -(-365 -3636 FP FPP) +(-365 -1384 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 (-366 GF |n|) ((|constructor| (NIL "FiniteFieldExtensionByPolynomial(\\spad{GF},{} \\spad{n}) implements an extension of the finite field {\\em GF} of degree \\spad{n} generated by the extension polynomial constructed by \\spadfunFrom{createIrreduciblePoly}{FiniteFieldPolynomialPackage} from \\spadtype{FiniteFieldPolynomialPackage}."))) ((-4446 . T) (-4452 . T) (-4447 . T) ((-4456 "*") . T) (-4448 . T) (-4449 . T) (-4451 . T)) -((-3783 (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-375)))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-375))) (|HasCategory| |#1| (QUOTE (-146)))) +((-2813 (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-375)))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-375))) (|HasCategory| |#1| (QUOTE (-146)))) (-367 R |ls|) ((|constructor| (NIL "This is just an interface between several packages and domains. The goal is to compute lexicographical Groebner bases of sets of polynomial with type \\spadtype{Polynomial R} by the {\\em FGLM} algorithm if this is possible (\\spadignore{i.e.} if the input system generates a zero-dimensional ideal).")) (|groebner| (((|List| (|Polynomial| |#1|)) (|List| (|Polynomial| |#1|))) "\\axiom{groebner(\\spad{lq1})} returns the lexicographical Groebner basis of \\axiom{\\spad{lq1}}. If \\axiom{\\spad{lq1}} generates a zero-dimensional ideal then the {\\em FGLM} strategy is used,{} otherwise the {\\em Sugar} strategy is used.")) (|fglmIfCan| (((|Union| (|List| (|Polynomial| |#1|)) "failed") (|List| (|Polynomial| |#1|))) "\\axiom{fglmIfCan(\\spad{lq1})} returns the lexicographical Groebner basis of \\axiom{\\spad{lq1}} by using the {\\em FGLM} strategy,{} if \\axiom{zeroDimensional?(\\spad{lq1})} holds.")) (|zeroDimensional?| (((|Boolean|) (|List| (|Polynomial| |#1|))) "\\axiom{zeroDimensional?(\\spad{lq1})} returns \\spad{true} iff \\axiom{\\spad{lq1}} generates a zero-dimensional ideal \\spad{w}.\\spad{r}.\\spad{t}. the variables of \\axiom{\\spad{ls}}."))) NIL @@ -1474,7 +1474,7 @@ NIL NIL (-386) ((|constructor| (NIL "\\spadtype{Float} implements arbitrary precision floating point arithmetic. The number of significant digits of each operation can be set to an arbitrary value (the default is 20 decimal digits). The operation \\spad{float(mantissa,exponent,\\spadfunFrom{base}{FloatingPointSystem})} for integer \\spad{mantissa},{} \\spad{exponent} specifies the number \\spad{mantissa * \\spadfunFrom{base}{FloatingPointSystem} ** exponent} The underlying representation for floats is binary not decimal. The implications of this are described below. \\blankline The model adopted is that arithmetic operations are rounded to to nearest unit in the last place,{} that is,{} accurate to within \\spad{2**(-\\spadfunFrom{bits}{FloatingPointSystem})}. Also,{} the elementary functions and constants are accurate to one unit in the last place. A float is represented as a record of two integers,{} the mantissa and the exponent. The \\spadfunFrom{base}{FloatingPointSystem} of the representation is binary,{} hence a \\spad{Record(m:mantissa,e:exponent)} represents the number \\spad{m * 2 ** e}. Though it is not assumed that the underlying integers are represented with a binary \\spadfunFrom{base}{FloatingPointSystem},{} the code will be most efficient when this is the the case (this is \\spad{true} in most implementations of Lisp). The decision to choose the \\spadfunFrom{base}{FloatingPointSystem} to be binary has some unfortunate consequences. First,{} decimal numbers like 0.3 cannot be represented exactly. Second,{} there is a further loss of accuracy during conversion to decimal for output. To compensate for this,{} if \\spad{d} digits of precision are specified,{} \\spad{1 + ceiling(log2 d)} bits are used. Two numbers that are displayed identically may therefore be not equal. On the other hand,{} a significant efficiency loss would be incurred if we chose to use a decimal \\spadfunFrom{base}{FloatingPointSystem} when the underlying integer base is binary. \\blankline Algorithms used: For the elementary functions,{} the general approach is to apply identities so that the taylor series can be used,{} and,{} so that it will converge within \\spad{O( sqrt n )} steps. For example,{} using the identity \\spad{exp(x) = exp(x/2)**2},{} we can compute \\spad{exp(1/3)} to \\spad{n} digits of precision as follows. We have \\spad{exp(1/3) = exp(2 ** (-sqrt s) / 3) ** (2 ** sqrt s)}. The taylor series will converge in less than sqrt \\spad{n} steps and the exponentiation requires sqrt \\spad{n} multiplications for a total of \\spad{2 sqrt n} multiplications. Assuming integer multiplication costs \\spad{O( n**2 )} the overall running time is \\spad{O( sqrt(n) n**2 )}. This approach is the best known approach for precisions up to about 10,{}000 digits at which point the methods of Brent which are \\spad{O( log(n) n**2 )} become competitive. Note also that summing the terms of the taylor series for the elementary functions is done using integer operations. This avoids the overhead of floating point operations and results in efficient code at low precisions. This implementation makes no attempt to reuse storage,{} relying on the underlying system to do \\spadgloss{garbage collection}. \\spad{I} estimate that the efficiency of this package at low precisions could be improved by a factor of 2 if in-place operations were available. \\blankline Running times: in the following,{} \\spad{n} is the number of bits of precision \\indented{5}{\\spad{*},{} \\spad{/},{} \\spad{sqrt},{} \\spad{pi},{} \\spad{exp1},{} \\spad{log2},{} \\spad{log10}: \\spad{ O( n**2 )}} \\indented{5}{\\spad{exp},{} \\spad{log},{} \\spad{sin},{} \\spad{atan}:\\space{2}\\spad{ O( sqrt(n) n**2 )}} The other elementary functions are coded in terms of the ones above.")) (|outputSpacing| (((|Void|) (|NonNegativeInteger|)) "\\spad{outputSpacing(n)} inserts a space after \\spad{n} (default 10) digits on output; outputSpacing(0) means no spaces are inserted.")) (|outputGeneral| (((|Void|) (|NonNegativeInteger|)) "\\spad{outputGeneral(n)} sets the output mode to general notation with \\spad{n} significant digits displayed.") (((|Void|)) "\\spad{outputGeneral()} sets the output mode (default mode) to general notation; numbers will be displayed in either fixed or floating (scientific) notation depending on the magnitude.")) (|outputFixed| (((|Void|) (|NonNegativeInteger|)) "\\spad{outputFixed(n)} sets the output mode to fixed point notation,{} with \\spad{n} digits displayed after the decimal point.") (((|Void|)) "\\spad{outputFixed()} sets the output mode to fixed point notation; the output will contain a decimal point.")) (|outputFloating| (((|Void|) (|NonNegativeInteger|)) "\\spad{outputFloating(n)} sets the output mode to floating (scientific) notation with \\spad{n} significant digits displayed after the decimal point.") (((|Void|)) "\\spad{outputFloating()} sets the output mode to floating (scientific) notation,{} \\spadignore{i.e.} \\spad{mantissa * 10 exponent} is displayed as \\spad{0.mantissa E exponent}.")) (|atan| (($ $ $) "\\spad{atan(x,y)} computes the arc tangent from \\spad{x} with phase \\spad{y}.")) (|exp1| (($) "\\spad{exp1()} returns exp 1: \\spad{2.7182818284...}.")) (|log10| (($ $) "\\spad{log10(x)} computes the logarithm for \\spad{x} to base 10.") (($) "\\spad{log10()} returns \\spad{ln 10}: \\spad{2.3025809299...}.")) (|log2| (($ $) "\\spad{log2(x)} computes the logarithm for \\spad{x} to base 2.") (($) "\\spad{log2()} returns \\spad{ln 2},{} \\spadignore{i.e.} \\spad{0.6931471805...}.")) (|rationalApproximation| (((|Fraction| (|Integer|)) $ (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{rationalApproximation(f, n, b)} computes a rational approximation \\spad{r} to \\spad{f} with relative error \\spad{< b**(-n)},{} that is \\spad{|(r-f)/f| < b**(-n)}.") (((|Fraction| (|Integer|)) $ (|NonNegativeInteger|)) "\\spad{rationalApproximation(f, n)} computes a rational approximation \\spad{r} to \\spad{f} with relative error \\spad{< 10**(-n)}.")) (|shift| (($ $ (|Integer|)) "\\spad{shift(x,n)} adds \\spad{n} to the exponent of float \\spad{x}.")) (|relerror| (((|Integer|) $ $) "\\spad{relerror(x,y)} computes the absolute value of \\spad{x - y} divided by \\spad{y},{} when \\spad{y \\~= 0}.")) (|normalize| (($ $) "\\spad{normalize(x)} normalizes \\spad{x} at current precision.")) (** (($ $ $) "\\spad{x ** y} computes \\spad{exp(y log x)} where \\spad{x >= 0}.")) (/ (($ $ (|Integer|)) "\\spad{x / i} computes the division from \\spad{x} by an integer \\spad{i}."))) -((-4437 . T) (-4445 . T) (-4091 . T) (-4446 . T) (-4452 . T) (-4447 . T) ((-4456 "*") . T) (-4448 . T) (-4449 . T) (-4451 . T)) +((-4437 . T) (-4445 . T) (-3548 . T) (-4446 . T) (-4452 . T) (-4447 . T) ((-4456 "*") . T) (-4448 . T) (-4449 . T) (-4451 . T)) NIL (-387 |Par|) ((|constructor| (NIL "\\indented{3}{This is a package for the approximation of real solutions for} systems of polynomial equations over the rational numbers. The results are expressed as either rational numbers or floats depending on the type of the precision parameter which can be either a rational number or a floating point number.")) (|realRoots| (((|List| |#1|) (|Fraction| (|Polynomial| (|Integer|))) |#1|) "\\spad{realRoots(rf, eps)} finds the real zeros of a univariate rational function with precision given by eps.") (((|List| (|List| |#1|)) (|List| (|Fraction| (|Polynomial| (|Integer|)))) (|List| (|Symbol|)) |#1|) "\\spad{realRoots(lp,lv,eps)} computes the list of the real solutions of the list \\spad{lp} of rational functions with rational coefficients with respect to the variables in \\spad{lv},{} with precision \\spad{eps}. Each solution is expressed as a list of numbers in order corresponding to the variables in \\spad{lv}.")) (|solve| (((|List| (|Equation| (|Polynomial| |#1|))) (|Equation| (|Fraction| (|Polynomial| (|Integer|)))) |#1|) "\\spad{solve(eq,eps)} finds all of the real solutions of the univariate equation \\spad{eq} of rational functions with respect to the unique variables appearing in \\spad{eq},{} with precision \\spad{eps}.") (((|List| (|Equation| (|Polynomial| |#1|))) (|Fraction| (|Polynomial| (|Integer|))) |#1|) "\\spad{solve(p,eps)} finds all of the real solutions of the univariate rational function \\spad{p} with rational coefficients with respect to the unique variable appearing in \\spad{p},{} with precision \\spad{eps}.") (((|List| (|List| (|Equation| (|Polynomial| |#1|)))) (|List| (|Equation| (|Fraction| (|Polynomial| (|Integer|))))) |#1|) "\\spad{solve(leq,eps)} finds all of the real solutions of the system \\spad{leq} of equationas of rational functions with respect to all the variables appearing in \\spad{lp},{} with precision \\spad{eps}.") (((|List| (|List| (|Equation| (|Polynomial| |#1|)))) (|List| (|Fraction| (|Polynomial| (|Integer|)))) |#1|) "\\spad{solve(lp,eps)} finds all of the real solutions of the system \\spad{lp} of rational functions over the rational numbers with respect to all the variables appearing in \\spad{lp},{} with precision \\spad{eps}."))) @@ -1528,7 +1528,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 -(-400 -3636 UP UPUP R) +(-400 -1384 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 @@ -1552,11 +1552,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 -(-406 -2402 |returnType| -1701 |symbols|) +(-406 -2029 |returnType| -1563 |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 -(-407 -3636 UP) +(-407 -1384 UP) ((|constructor| (NIL "\\indented{1}{Full partial fraction expansion of rational functions} Author: Manuel Bronstein Date Created: 9 December 1992 Date Last Updated: 6 October 1993 References: \\spad{M}.Bronstein & \\spad{B}.Salvy,{} \\indented{12}{Full Partial Fraction Decomposition of Rational Functions,{}} \\indented{12}{in Proceedings of ISSAC'93,{} Kiev,{} ACM Press.}")) (D (($ $ (|NonNegativeInteger|)) "\\spad{D(f, n)} returns the \\spad{n}-th derivative of \\spad{f}.") (($ $) "\\spad{D(f)} returns the derivative of \\spad{f}.")) (|differentiate| (($ $ (|NonNegativeInteger|)) "\\spad{differentiate(f, n)} returns the \\spad{n}-th derivative of \\spad{f}.") (($ $) "\\spad{differentiate(f)} returns the derivative of \\spad{f}.")) (|construct| (($ (|List| (|Record| (|:| |exponent| (|NonNegativeInteger|)) (|:| |center| |#2|) (|:| |num| |#2|)))) "\\spad{construct(l)} is the inverse of fracPart.")) (|fracPart| (((|List| (|Record| (|:| |exponent| (|NonNegativeInteger|)) (|:| |center| |#2|) (|:| |num| |#2|))) $) "\\spad{fracPart(f)} returns the list of summands of the fractional part of \\spad{f}.")) (|polyPart| ((|#2| $) "\\spad{polyPart(f)} returns the polynomial part of \\spad{f}.")) (|fullPartialFraction| (($ (|Fraction| |#2|)) "\\spad{fullPartialFraction(f)} returns \\spad{[p, [[j, Dj, Hj]...]]} such that \\spad{f = p(x) + \\sum_{[j,Dj,Hj] in l} \\sum_{Dj(a)=0} Hj(a)/(x - a)\\^j}.")) (+ (($ |#2| $) "\\spad{p + x} returns the sum of \\spad{p} and \\spad{x}"))) NIL NIL @@ -1578,7 +1578,7 @@ NIL ((|HasAttribute| |#1| (QUOTE -4437)) (|HasAttribute| |#1| (QUOTE -4445))) (-412) ((|constructor| (NIL "This category is intended as a model for floating point systems. A floating point system is a model for the real numbers. In fact,{} it is an approximation in the sense that not all real numbers are exactly representable by floating point numbers. A floating point system is characterized by the following: \\blankline \\indented{2}{1: \\spadfunFrom{base}{FloatingPointSystem} of the \\spadfunFrom{exponent}{FloatingPointSystem}.} \\indented{9}{(actual implemenations are usually binary or decimal)} \\indented{2}{2: \\spadfunFrom{precision}{FloatingPointSystem} of the \\spadfunFrom{mantissa}{FloatingPointSystem} (arbitrary or fixed)} \\indented{2}{3: rounding error for operations} \\blankline Because a Float is an approximation to the real numbers,{} even though it is defined to be a join of a Field and OrderedRing,{} some of the attributes do not hold. In particular associative(\\spad{\"+\"}) does not hold. Algorithms defined over a field need special considerations when the field is a floating point system.")) (|max| (($) "\\spad{max()} returns the maximum floating point number.")) (|min| (($) "\\spad{min()} returns the minimum floating point number.")) (|decreasePrecision| (((|PositiveInteger|) (|Integer|)) "\\spad{decreasePrecision(n)} decreases the current \\spadfunFrom{precision}{FloatingPointSystem} precision by \\spad{n} decimal digits.")) (|increasePrecision| (((|PositiveInteger|) (|Integer|)) "\\spad{increasePrecision(n)} increases the current \\spadfunFrom{precision}{FloatingPointSystem} by \\spad{n} decimal digits.")) (|precision| (((|PositiveInteger|) (|PositiveInteger|)) "\\spad{precision(n)} set the precision in the base to \\spad{n} decimal digits.") (((|PositiveInteger|)) "\\spad{precision()} returns the precision in digits base.")) (|digits| (((|PositiveInteger|) (|PositiveInteger|)) "\\spad{digits(d)} set the \\spadfunFrom{precision}{FloatingPointSystem} to \\spad{d} digits.") (((|PositiveInteger|)) "\\spad{digits()} returns ceiling\\spad{'s} precision in decimal digits.")) (|bits| (((|PositiveInteger|) (|PositiveInteger|)) "\\spad{bits(n)} set the \\spadfunFrom{precision}{FloatingPointSystem} to \\spad{n} bits.") (((|PositiveInteger|)) "\\spad{bits()} returns ceiling\\spad{'s} precision in bits.")) (|mantissa| (((|Integer|) $) "\\spad{mantissa(x)} returns the mantissa part of \\spad{x}.")) (|exponent| (((|Integer|) $) "\\spad{exponent(x)} returns the \\spadfunFrom{exponent}{FloatingPointSystem} part of \\spad{x}.")) (|base| (((|PositiveInteger|)) "\\spad{base()} returns the base of the \\spadfunFrom{exponent}{FloatingPointSystem}.")) (|order| (((|Integer|) $) "\\spad{order x} is the order of magnitude of \\spad{x}. Note: \\spad{base ** order x <= |x| < base ** (1 + order x)}.")) (|float| (($ (|Integer|) (|Integer|) (|PositiveInteger|)) "\\spad{float(a,e,b)} returns \\spad{a * b ** e}.") (($ (|Integer|) (|Integer|)) "\\spad{float(a,e)} returns \\spad{a * base() ** e}.")) (|approximate| ((|attribute|) "\\spad{approximate} means \"is an approximation to the real numbers\"."))) -((-4091 . T) (-4446 . T) (-4452 . T) (-4447 . T) ((-4456 "*") . T) (-4448 . T) (-4449 . T) (-4451 . T)) +((-3548 . T) (-4446 . T) (-4452 . T) (-4447 . T) ((-4456 "*") . T) (-4448 . T) (-4449 . T) (-4451 . T)) NIL (-413 R S) ((|constructor| (NIL "\\spadtype{FactoredFunctions2} contains functions that involve factored objects whose underlying domains may not be the same. For example,{} \\spadfun{map} might be used to coerce an object of type \\spadtype{Factored(Integer)} to \\spadtype{Factored(Complex(Integer))}.")) (|map| (((|Factored| |#2|) (|Mapping| |#2| |#1|) (|Factored| |#1|)) "\\spad{map(fn,u)} is used to apply the function \\userfun{\\spad{fn}} to every factor of \\spadvar{\\spad{u}}. The new factored object will have all its information flags set to \"nil\". This function is used,{} for example,{} to coerce every factor base to another type."))) @@ -1591,7 +1591,7 @@ NIL (-415 S) ((|constructor| (NIL "Fraction takes an IntegralDomain \\spad{S} and produces the domain of Fractions with numerators and denominators from \\spad{S}. If \\spad{S} is also a GcdDomain,{} then \\spad{gcd}\\spad{'s} between numerator and denominator will be cancelled during all operations.")) (|canonical| ((|attribute|) "\\spad{canonical} means that equal elements are in fact identical."))) ((-4441 -12 (|has| |#1| (-6 -4452)) (|has| |#1| (-460)) (|has| |#1| (-6 -4441))) (-4446 . T) (-4452 . T) (-4447 . T) ((-4456 "*") . T) (-4448 . T) (-4449 . T) (-4451 . T)) -((|HasCategory| |#1| (QUOTE (-918))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-1188)))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (-3783 (-12 (|HasCategory| |#1| (QUOTE (-553))) (|HasCategory| |#1| (QUOTE (-836)))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544))))) (|HasCategory| |#1| (QUOTE (-1033))) (|HasCategory| |#1| (QUOTE (-828))) (-3783 (|HasCategory| |#1| (QUOTE (-828))) (|HasCategory| |#1| (QUOTE (-858)))) (-3783 (-12 (|HasCategory| |#1| (QUOTE (-553))) (|HasCategory| |#1| (QUOTE (-836)))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-1163))) (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-386)))) (-3783 (-12 (|HasCategory| |#1| (QUOTE (-553))) (|HasCategory| |#1| (QUOTE (-836)))) (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (-3783 (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (-12 (|HasCategory| |#1| (QUOTE (-553))) (|HasCategory| |#1| (QUOTE (-836))))) (-3783 (|HasCategory| |#1| (LIST (QUOTE -647) (QUOTE (-572)))) (-12 (|HasCategory| |#1| (QUOTE (-553))) (|HasCategory| |#1| (QUOTE (-836))))) (|HasCategory| |#1| (QUOTE (-237))) (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#1| (LIST (QUOTE -522) (QUOTE (-1188)) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -292) (|devaluate| |#1|) (|devaluate| |#1|))) (-12 (|HasCategory| |#1| (QUOTE (-553))) (|HasCategory| |#1| (QUOTE (-836)))) (|HasCategory| |#1| (QUOTE (-313))) (|HasCategory| |#1| (QUOTE (-553))) (-12 (|HasAttribute| |#1| (QUOTE -4452)) (|HasAttribute| |#1| (QUOTE -4441)) (|HasCategory| |#1| (QUOTE (-460)))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -647) (QUOTE (-572)))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-918)))) (-3783 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-918)))) (|HasCategory| |#1| (QUOTE (-146))))) +((|HasCategory| |#1| (QUOTE (-918))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-1188)))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (-2813 (-12 (|HasCategory| |#1| (QUOTE (-553))) (|HasCategory| |#1| (QUOTE (-836)))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544))))) (|HasCategory| |#1| (QUOTE (-1033))) (|HasCategory| |#1| (QUOTE (-828))) (-2813 (|HasCategory| |#1| (QUOTE (-828))) (|HasCategory| |#1| (QUOTE (-858)))) (-2813 (-12 (|HasCategory| |#1| (QUOTE (-553))) (|HasCategory| |#1| (QUOTE (-836)))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-1163))) (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-386)))) (-2813 (-12 (|HasCategory| |#1| (QUOTE (-553))) (|HasCategory| |#1| (QUOTE (-836)))) (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (-2813 (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (-12 (|HasCategory| |#1| (QUOTE (-553))) (|HasCategory| |#1| (QUOTE (-836))))) (-2813 (|HasCategory| |#1| (LIST (QUOTE -647) (QUOTE (-572)))) (-12 (|HasCategory| |#1| (QUOTE (-553))) (|HasCategory| |#1| (QUOTE (-836))))) (|HasCategory| |#1| (QUOTE (-237))) (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#1| (LIST (QUOTE -522) (QUOTE (-1188)) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -292) (|devaluate| |#1|) (|devaluate| |#1|))) (-12 (|HasCategory| |#1| (QUOTE (-553))) (|HasCategory| |#1| (QUOTE (-836)))) (|HasCategory| |#1| (QUOTE (-313))) (|HasCategory| |#1| (QUOTE (-553))) (-12 (|HasAttribute| |#1| (QUOTE -4452)) (|HasAttribute| |#1| (QUOTE -4441)) (|HasCategory| |#1| (QUOTE (-460)))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -647) (QUOTE (-572)))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-918)))) (-2813 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-918)))) (|HasCategory| |#1| (QUOTE (-146))))) (-416 S R UP) ((|constructor| (NIL "A \\spadtype{FramedAlgebra} is a \\spadtype{FiniteRankAlgebra} together with a fixed \\spad{R}-module basis.")) (|regularRepresentation| (((|Matrix| |#2|) $) "\\spad{regularRepresentation(a)} returns the matrix of the linear map defined by left multiplication by \\spad{a} with respect to the fixed basis.")) (|discriminant| ((|#2|) "\\spad{discriminant()} = determinant(traceMatrix()).")) (|traceMatrix| (((|Matrix| |#2|)) "\\spad{traceMatrix()} is the \\spad{n}-by-\\spad{n} matrix ( \\spad{Tr(vi * vj)} ),{} where \\spad{v1},{} ...,{} \\spad{vn} are the elements of the fixed basis.")) (|convert| (($ (|Vector| |#2|)) "\\spad{convert([a1,..,an])} returns \\spad{a1*v1 + ... + an*vn},{} where \\spad{v1},{} ...,{} \\spad{vn} are the elements of the fixed basis.") (((|Vector| |#2|) $) "\\spad{convert(a)} returns the coordinates of \\spad{a} with respect to the fixed \\spad{R}-module basis.")) (|represents| (($ (|Vector| |#2|)) "\\spad{represents([a1,..,an])} returns \\spad{a1*v1 + ... + an*vn},{} where \\spad{v1},{} ...,{} \\spad{vn} are the elements of the fixed basis.")) (|coordinates| (((|Matrix| |#2|) (|Vector| $)) "\\spad{coordinates([v1,...,vm])} returns the coordinates of the \\spad{vi}\\spad{'s} with to the fixed basis. The coordinates of \\spad{vi} are contained in the \\spad{i}th row of the matrix returned by this function.") (((|Vector| |#2|) $) "\\spad{coordinates(a)} returns the coordinates of \\spad{a} with respect to the fixed \\spad{R}-module basis.")) (|basis| (((|Vector| $)) "\\spad{basis()} returns the fixed \\spad{R}-module basis."))) NIL @@ -1612,11 +1612,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 -(-421 R -3636 UP A) +(-421 R -1384 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)}."))) ((-4451 . T)) NIL -(-422 R -3636 UP A |ibasis|) +(-422 R -1384 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 -1049) (|devaluate| |#2|)))) @@ -1635,7 +1635,7 @@ NIL (-426 R) ((|constructor| (NIL "\\spadtype{Factored} creates a domain whose objects are kept in factored form as long as possible. Thus certain operations like multiplication and \\spad{gcd} are relatively easy to do. Others,{} like addition require somewhat more work,{} and unless the argument domain provides a factor function,{} the result may not be completely factored. Each object consists of a unit and a list of factors,{} where a factor has a member of \\spad{R} (the \"base\"),{} and exponent and a flag indicating what is known about the base. A flag may be one of \"nil\",{} \"sqfr\",{} \"irred\" or \"prime\",{} which respectively mean that nothing is known about the base,{} it is square-free,{} it is irreducible,{} or it is prime. The current restriction to integral domains allows simplification to be performed without worrying about multiplication order.")) (|rationalIfCan| (((|Union| (|Fraction| (|Integer|)) "failed") $) "\\spad{rationalIfCan(u)} returns a rational number if \\spad{u} really is one,{} and \"failed\" otherwise.")) (|rational| (((|Fraction| (|Integer|)) $) "\\spad{rational(u)} assumes spadvar{\\spad{u}} is actually a rational number and does the conversion to rational number (see \\spadtype{Fraction Integer}).")) (|rational?| (((|Boolean|) $) "\\spad{rational?(u)} tests if \\spadvar{\\spad{u}} is actually a rational number (see \\spadtype{Fraction Integer}).")) (|map| (($ (|Mapping| |#1| |#1|) $) "\\spad{map(fn,u)} maps the function \\userfun{\\spad{fn}} across the factors of \\spadvar{\\spad{u}} and creates a new factored object. Note: this clears the information flags (sets them to \"nil\") because the effect of \\userfun{\\spad{fn}} is clearly not known in general.")) (|unitNormalize| (($ $) "\\spad{unitNormalize(u)} normalizes the unit part of the factorization. For example,{} when working with factored integers,{} this operation will ensure that the bases are all positive integers.")) (|unit| ((|#1| $) "\\spad{unit(u)} extracts the unit part of the factorization.")) (|flagFactor| (($ |#1| (|Integer|) (|Union| "nil" "sqfr" "irred" "prime")) "\\spad{flagFactor(base,exponent,flag)} creates a factored object with a single factor whose \\spad{base} is asserted to be properly described by the information \\spad{flag}.")) (|sqfrFactor| (($ |#1| (|Integer|)) "\\spad{sqfrFactor(base,exponent)} creates a factored object with a single factor whose \\spad{base} is asserted to be square-free (flag = \"sqfr\").")) (|primeFactor| (($ |#1| (|Integer|)) "\\spad{primeFactor(base,exponent)} creates a factored object with a single factor whose \\spad{base} is asserted to be prime (flag = \"prime\").")) (|numberOfFactors| (((|NonNegativeInteger|) $) "\\spad{numberOfFactors(u)} returns the number of factors in \\spadvar{\\spad{u}}.")) (|nthFlag| (((|Union| "nil" "sqfr" "irred" "prime") $ (|Integer|)) "\\spad{nthFlag(u,n)} returns the information flag of the \\spad{n}th factor of \\spadvar{\\spad{u}}. If \\spadvar{\\spad{n}} is not a valid index for a factor (for example,{} less than 1 or too big),{} \"nil\" is returned.")) (|nthFactor| ((|#1| $ (|Integer|)) "\\spad{nthFactor(u,n)} returns the base of the \\spad{n}th factor of \\spadvar{\\spad{u}}. If \\spadvar{\\spad{n}} is not a valid index for a factor (for example,{} less than 1 or too big),{} 1 is returned. If \\spadvar{\\spad{u}} consists only of a unit,{} the unit is returned.")) (|nthExponent| (((|Integer|) $ (|Integer|)) "\\spad{nthExponent(u,n)} returns the exponent of the \\spad{n}th factor of \\spadvar{\\spad{u}}. If \\spadvar{\\spad{n}} is not a valid index for a factor (for example,{} less than 1 or too big),{} 0 is returned.")) (|irreducibleFactor| (($ |#1| (|Integer|)) "\\spad{irreducibleFactor(base,exponent)} creates a factored object with a single factor whose \\spad{base} is asserted to be irreducible (flag = \"irred\").")) (|factors| (((|List| (|Record| (|:| |factor| |#1|) (|:| |exponent| (|Integer|)))) $) "\\spad{factors(u)} returns a list of the factors in a form suitable for iteration. That is,{} it returns a list where each element is a record containing a base and exponent. The original object is the product of all the factors and the unit (which can be extracted by \\axiom{unit(\\spad{u})}).")) (|nilFactor| (($ |#1| (|Integer|)) "\\spad{nilFactor(base,exponent)} creates a factored object with a single factor with no information about the kind of \\spad{base} (flag = \"nil\").")) (|factorList| (((|List| (|Record| (|:| |flg| (|Union| "nil" "sqfr" "irred" "prime")) (|:| |fctr| |#1|) (|:| |xpnt| (|Integer|)))) $) "\\spad{factorList(u)} returns the list of factors with flags (for use by factoring code).")) (|makeFR| (($ |#1| (|List| (|Record| (|:| |flg| (|Union| "nil" "sqfr" "irred" "prime")) (|:| |fctr| |#1|) (|:| |xpnt| (|Integer|))))) "\\spad{makeFR(unit,listOfFactors)} creates a factored object (for use by factoring code).")) (|exponent| (((|Integer|) $) "\\spad{exponent(u)} returns the exponent of the first factor of \\spadvar{\\spad{u}},{} or 0 if the factored form consists solely of a unit.")) (|expand| ((|#1| $) "\\spad{expand(f)} multiplies the unit and factors together,{} yielding an \"unfactored\" object. Note: this is purposely not called \\spadfun{coerce} which would cause the interpreter to do this automatically."))) ((-4447 . T) ((-4456 "*") . T) (-4448 . T) (-4449 . T) (-4451 . T)) -((|HasCategory| |#1| (LIST (QUOTE -522) (QUOTE (-1188)) (QUOTE $))) (|HasCategory| |#1| (LIST (QUOTE -315) (QUOTE $))) (|HasCategory| |#1| (LIST (QUOTE -292) (QUOTE $) (QUOTE $))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#1| (QUOTE (-1233))) (-3783 (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-1233)))) (|HasCategory| |#1| (QUOTE (-1033))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| |#1| (LIST (QUOTE -522) (QUOTE (-1188)) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -292) (|devaluate| |#1|) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-237))) (-3783 (|HasCategory| |#1| (LIST (QUOTE -292) (|devaluate| |#1|) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-237))) (|HasCategory| |#1| (LIST (QUOTE -292) (QUOTE $) (QUOTE $)))) (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#1| (QUOTE (-553))) (|HasCategory| |#1| (QUOTE (-460)))) +((|HasCategory| |#1| (LIST (QUOTE -522) (QUOTE (-1188)) (QUOTE $))) (|HasCategory| |#1| (LIST (QUOTE -315) (QUOTE $))) (|HasCategory| |#1| (LIST (QUOTE -292) (QUOTE $) (QUOTE $))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#1| (QUOTE (-1233))) (-2813 (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-1233)))) (|HasCategory| |#1| (QUOTE (-1033))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| |#1| (LIST (QUOTE -522) (QUOTE (-1188)) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -292) (|devaluate| |#1|) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-237))) (-2813 (|HasCategory| |#1| (LIST (QUOTE -292) (|devaluate| |#1|) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-237))) (|HasCategory| |#1| (LIST (QUOTE -292) (QUOTE $) (QUOTE $)))) (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#1| (QUOTE (-553))) (|HasCategory| |#1| (QUOTE (-460)))) (-427 R) ((|constructor| (NIL "\\spadtype{FactoredFunctionUtilities} implements some utility functions for manipulating factored objects.")) (|mergeFactors| (((|Factored| |#1|) (|Factored| |#1|) (|Factored| |#1|)) "\\spad{mergeFactors(u,v)} is used when the factorizations of \\spadvar{\\spad{u}} and \\spadvar{\\spad{v}} are known to be disjoint,{} \\spadignore{e.g.} resulting from a content/primitive part split. Essentially,{} it creates a new factored object by multiplying the units together and appending the lists of factors.")) (|refine| (((|Factored| |#1|) (|Factored| |#1|) (|Mapping| (|Factored| |#1|) |#1|)) "\\spad{refine(u,fn)} is used to apply the function \\userfun{\\spad{fn}} to each factor of \\spadvar{\\spad{u}} and then build a new factored object from the results. For example,{} if \\spadvar{\\spad{u}} were created by calling \\spad{nilFactor(10,2)} then \\spad{refine(u,factor)} would create a factored object equal to that created by \\spad{factor(100)} or \\spad{primeFactor(2,2) * primeFactor(5,2)}."))) NIL @@ -1664,7 +1664,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}."))) ((-4454 . T) (-4444 . T) (-4455 . T)) NIL -(-434 R -3636) +(-434 R -1384) ((|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 @@ -1672,7 +1672,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"))) ((-4441 -12 (|has| |#1| (-6 -4441)) (|has| |#2| (-6 -4441))) (-4448 . T) (-4449 . T) (-4451 . T)) ((-12 (|HasAttribute| |#1| (QUOTE -4441)) (|HasAttribute| |#2| (QUOTE -4441)))) -(-436 R -3636) +(-436 R -1384) ((|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 @@ -1682,17 +1682,17 @@ NIL ((|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| |#2| (QUOTE (-564))) (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-146))) (|HasCategory| |#2| (QUOTE (-148))) (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-481))) (|HasCategory| |#2| (QUOTE (-1123))) (|HasCategory| |#2| (LIST (QUOTE -622) (QUOTE (-544))))) (-438 R) ((|constructor| (NIL "A space of formal functions with arguments in an arbitrary ordered set.")) (|univariate| (((|Fraction| (|SparseUnivariatePolynomial| $)) $ (|Kernel| $)) "\\spad{univariate(f, k)} returns \\spad{f} viewed as a univariate fraction in \\spad{k}.")) (/ (($ (|SparseMultivariatePolynomial| |#1| (|Kernel| $)) (|SparseMultivariatePolynomial| |#1| (|Kernel| $))) "\\spad{p1/p2} returns the quotient of \\spad{p1} and \\spad{p2} as an element of \\%.")) (|denominator| (($ $) "\\spad{denominator(f)} returns the denominator of \\spad{f} converted to \\%.")) (|denom| (((|SparseMultivariatePolynomial| |#1| (|Kernel| $)) $) "\\spad{denom(f)} returns the denominator of \\spad{f} viewed as a polynomial in the kernels over \\spad{R}.")) (|convert| (($ (|Factored| $)) "\\spad{convert(f1\\^e1 ... fm\\^em)} returns \\spad{(f1)\\^e1 ... (fm)\\^em} as an element of \\%,{} using formal kernels created using a \\spadfunFrom{paren}{ExpressionSpace}.")) (|isPower| (((|Union| (|Record| (|:| |val| $) (|:| |exponent| (|Integer|))) "failed") $) "\\spad{isPower(p)} returns \\spad{[x, n]} if \\spad{p = x**n} and \\spad{n <> 0}.")) (|numerator| (($ $) "\\spad{numerator(f)} returns the numerator of \\spad{f} converted to \\%.")) (|numer| (((|SparseMultivariatePolynomial| |#1| (|Kernel| $)) $) "\\spad{numer(f)} returns the numerator of \\spad{f} viewed as a polynomial in the kernels over \\spad{R} if \\spad{R} is an integral domain. If not,{} then numer(\\spad{f}) = \\spad{f} viewed as a polynomial in the kernels over \\spad{R}.")) (|coerce| (($ (|Fraction| (|Polynomial| (|Fraction| |#1|)))) "\\spad{coerce(f)} returns \\spad{f} as an element of \\%.") (($ (|Polynomial| (|Fraction| |#1|))) "\\spad{coerce(p)} returns \\spad{p} as an element of \\%.") (($ (|Fraction| |#1|)) "\\spad{coerce(q)} returns \\spad{q} as an element of \\%.") (($ (|SparseMultivariatePolynomial| |#1| (|Kernel| $))) "\\spad{coerce(p)} returns \\spad{p} as an element of \\%.")) (|isMult| (((|Union| (|Record| (|:| |coef| (|Integer|)) (|:| |var| (|Kernel| $))) "failed") $) "\\spad{isMult(p)} returns \\spad{[n, x]} if \\spad{p = n * x} and \\spad{n <> 0}.")) (|isPlus| (((|Union| (|List| $) "failed") $) "\\spad{isPlus(p)} returns \\spad{[m1,...,mn]} if \\spad{p = m1 +...+ mn} and \\spad{n > 1}.")) (|isExpt| (((|Union| (|Record| (|:| |var| (|Kernel| $)) (|:| |exponent| (|Integer|))) "failed") $ (|Symbol|)) "\\spad{isExpt(p,f)} returns \\spad{[x, n]} if \\spad{p = x**n} and \\spad{n <> 0} and \\spad{x = f(a)}.") (((|Union| (|Record| (|:| |var| (|Kernel| $)) (|:| |exponent| (|Integer|))) "failed") $ (|BasicOperator|)) "\\spad{isExpt(p,op)} returns \\spad{[x, n]} if \\spad{p = x**n} and \\spad{n <> 0} and \\spad{x = op(a)}.") (((|Union| (|Record| (|:| |var| (|Kernel| $)) (|:| |exponent| (|Integer|))) "failed") $) "\\spad{isExpt(p)} returns \\spad{[x, n]} if \\spad{p = x**n} and \\spad{n <> 0}.")) (|isTimes| (((|Union| (|List| $) "failed") $) "\\spad{isTimes(p)} returns \\spad{[a1,...,an]} if \\spad{p = a1*...*an} and \\spad{n > 1}.")) (** (($ $ (|NonNegativeInteger|)) "\\spad{x**n} returns \\spad{x} * \\spad{x} * \\spad{x} * ... * \\spad{x} (\\spad{n} times).")) (|eval| (($ $ (|Symbol|) (|NonNegativeInteger|) (|Mapping| $ $)) "\\spad{eval(x, s, n, f)} replaces every \\spad{s(a)**n} in \\spad{x} by \\spad{f(a)} for any \\spad{a}.") (($ $ (|Symbol|) (|NonNegativeInteger|) (|Mapping| $ (|List| $))) "\\spad{eval(x, s, n, f)} replaces every \\spad{s(a1,...,am)**n} in \\spad{x} by \\spad{f(a1,...,am)} for any a1,{}...,{}am.") (($ $ (|List| (|Symbol|)) (|List| (|NonNegativeInteger|)) (|List| (|Mapping| $ (|List| $)))) "\\spad{eval(x, [s1,...,sm], [n1,...,nm], [f1,...,fm])} replaces every \\spad{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}."))) -((-4451 -3783 (|has| |#1| (-1060)) (|has| |#1| (-481))) (-4449 |has| |#1| (-174)) (-4448 |has| |#1| (-174)) ((-4456 "*") |has| |#1| (-564)) (-4447 |has| |#1| (-564)) (-4452 |has| |#1| (-564)) (-4446 |has| |#1| (-564))) +((-4451 -2813 (|has| |#1| (-1060)) (|has| |#1| (-481))) (-4449 |has| |#1| (-174)) (-4448 |has| |#1| (-174)) ((-4456 "*") |has| |#1| (-564)) (-4447 |has| |#1| (-564)) (-4452 |has| |#1| (-564)) (-4446 |has| |#1| (-564))) NIL -(-439 R -3636) +(-439 R -1384) ((|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 -(-440 R -3636) +(-440 R -1384) ((|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)))) -(-441 R -3636) +(-441 R -1384) ((|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 @@ -1700,7 +1700,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 -(-443 R -3636 UP) +(-443 R -1384 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 -1049) (QUOTE (-48))))) @@ -1732,7 +1732,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 -(-451 R UP -3636) +(-451 R UP -1384) ((|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 @@ -1779,7 +1779,7 @@ NIL (-462 |vl| R E) ((|constructor| (NIL "\\indented{2}{This type supports distributed multivariate polynomials} whose variables are from a user specified list of symbols. The coefficient ring may be non commutative,{} but the variables are assumed to commute. The term ordering is specified by its third parameter. Suggested types which define term orderings include: \\spadtype{DirectProduct},{} \\spadtype{HomogeneousDirectProduct},{} \\spadtype{SplitHomogeneousDirectProduct} and finally \\spadtype{OrderedDirectProduct} which accepts an arbitrary user function to define a term ordering.")) (|reorder| (($ $ (|List| (|Integer|))) "\\spad{reorder(p, perm)} applies the permutation perm to the variables in a polynomial and returns the new correctly ordered polynomial"))) (((-4456 "*") |has| |#2| (-174)) (-4447 |has| |#2| (-564)) (-4452 |has| |#2| (-6 -4452)) (-4449 . T) (-4448 . T) (-4451 . T)) -((|HasCategory| |#2| (QUOTE (-918))) (-3783 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-460))) (|HasCategory| |#2| (QUOTE (-564))) (|HasCategory| |#2| (QUOTE (-918)))) (-3783 (|HasCategory| |#2| (QUOTE (-460))) (|HasCategory| |#2| (QUOTE (-564))) (|HasCategory| |#2| (QUOTE (-918)))) (-3783 (|HasCategory| |#2| (QUOTE (-460))) (|HasCategory| |#2| (QUOTE (-918)))) (|HasCategory| |#2| (QUOTE (-564))) (|HasCategory| |#2| (QUOTE (-174))) (-3783 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-564)))) (-12 (|HasCategory| (-872 |#1|) (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| |#2| (LIST (QUOTE -895) (QUOTE (-386))))) (-12 (|HasCategory| (-872 |#1|) (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -895) (QUOTE (-572))))) (-12 (|HasCategory| (-872 |#1|) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| |#2| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386)))))) (-12 (|HasCategory| (-872 |#1|) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572)))))) (-12 (|HasCategory| (-872 |#1|) (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#2| (LIST (QUOTE -622) (QUOTE (-544))))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (QUOTE (-148))) (|HasCategory| |#2| (QUOTE (-146))) (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572)))) (-3783 (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572)))))) (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-370))) (|HasAttribute| |#2| (QUOTE -4452)) (|HasCategory| |#2| (QUOTE (-460))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#2| (QUOTE (-918)))) (-3783 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#2| (QUOTE (-918)))) (|HasCategory| |#2| (QUOTE (-146))))) +((|HasCategory| |#2| (QUOTE (-918))) (-2813 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-460))) (|HasCategory| |#2| (QUOTE (-564))) (|HasCategory| |#2| (QUOTE (-918)))) (-2813 (|HasCategory| |#2| (QUOTE (-460))) (|HasCategory| |#2| (QUOTE (-564))) (|HasCategory| |#2| (QUOTE (-918)))) (-2813 (|HasCategory| |#2| (QUOTE (-460))) (|HasCategory| |#2| (QUOTE (-918)))) (|HasCategory| |#2| (QUOTE (-564))) (|HasCategory| |#2| (QUOTE (-174))) (-2813 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-564)))) (-12 (|HasCategory| (-872 |#1|) (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| |#2| (LIST (QUOTE -895) (QUOTE (-386))))) (-12 (|HasCategory| (-872 |#1|) (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -895) (QUOTE (-572))))) (-12 (|HasCategory| (-872 |#1|) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| |#2| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386)))))) (-12 (|HasCategory| (-872 |#1|) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572)))))) (-12 (|HasCategory| (-872 |#1|) (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#2| (LIST (QUOTE -622) (QUOTE (-544))))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (QUOTE (-148))) (|HasCategory| |#2| (QUOTE (-146))) (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572)))) (-2813 (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572)))))) (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-370))) (|HasAttribute| |#2| (QUOTE -4452)) (|HasCategory| |#2| (QUOTE (-460))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#2| (QUOTE (-918)))) (-2813 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#2| (QUOTE (-918)))) (|HasCategory| |#2| (QUOTE (-146))))) (-463 R BP) ((|constructor| (NIL "\\indented{1}{Author : \\spad{P}.Gianni.} January 1990 The equation \\spad{Af+Bg=h} and its generalization to \\spad{n} polynomials is solved for solutions over the \\spad{R},{} euclidean domain. A table containing the solutions of \\spad{Af+Bg=x**k} is used. The operations are performed modulus a prime which are in principle big enough,{} but the solutions are tested and,{} in case of failure,{} a hensel lifting process is used to get to the right solutions. It will be used in the factorization of multivariate polynomials over finite field,{} with \\spad{R=F[x]}.")) (|testModulus| (((|Boolean|) |#1| (|List| |#2|)) "\\spad{testModulus(p,lp)} returns \\spad{true} if the the prime \\spad{p} is valid for the list of polynomials \\spad{lp},{} \\spadignore{i.e.} preserves the degree and they remain relatively prime.")) (|solveid| (((|Union| (|List| |#2|) "failed") |#2| |#1| (|Vector| (|List| |#2|))) "\\spad{solveid(h,table)} computes the coefficients of the extended euclidean algorithm for a list of polynomials whose tablePow is \\spad{table} and with right side \\spad{h}.")) (|tablePow| (((|Union| (|Vector| (|List| |#2|)) "failed") (|NonNegativeInteger|) |#1| (|List| |#2|)) "\\spad{tablePow(maxdeg,prime,lpol)} constructs the table with the coefficients of the Extended Euclidean Algorithm for \\spad{lpol}. Here the right side is \\spad{x**k},{} for \\spad{k} less or equal to \\spad{maxdeg}. The operation returns \"failed\" when the elements are not coprime modulo \\spad{prime}.")) (|compBound| (((|NonNegativeInteger|) |#2| (|List| |#2|)) "\\spad{compBound(p,lp)} computes a bound for the coefficients of the solution polynomials. Given a polynomial right hand side \\spad{p},{} and a list \\spad{lp} of left hand side polynomials. Exported because it depends on the valuation.")) (|reduction| ((|#2| |#2| |#1|) "\\spad{reduction(p,prime)} reduces the polynomial \\spad{p} modulo \\spad{prime} of \\spad{R}. Note: this function is exported only because it\\spad{'s} conditional."))) NIL @@ -1844,7 +1844,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 -(-479 |lv| -3636 R) +(-479 |lv| -1384 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 @@ -1859,11 +1859,11 @@ NIL (-482 |Coef| |var| |cen|) ((|constructor| (NIL "This is a category of univariate Puiseux series constructed from univariate Laurent series. A Puiseux series is represented by a pair \\spad{[r,f(x)]},{} where \\spad{r} is a positive rational number and \\spad{f(x)} is a Laurent series. This pair represents the Puiseux series \\spad{f(x\\^r)}.")) (|integrate| (($ $ (|Variable| |#2|)) "\\spad{integrate(f(x))} returns an anti-derivative of the power series \\spad{f(x)} with constant coefficient 0. We may integrate a series when we can divide coefficients by integers.")) (|differentiate| (($ $ (|Variable| |#2|)) "\\spad{differentiate(f(x),x)} returns the derivative of \\spad{f(x)} with respect to \\spad{x}.")) (|coerce| (($ (|UnivariatePuiseuxSeries| |#1| |#2| |#3|)) "\\spad{coerce(f)} converts a Puiseux series to a general power series.") (($ (|Variable| |#2|)) "\\spad{coerce(var)} converts the series variable \\spad{var} into a Puiseux series."))) (((-4456 "*") |has| |#1| (-174)) (-4447 |has| |#1| (-564)) (-4452 |has| |#1| (-370)) (-4446 |has| |#1| (-370)) (-4448 . T) (-4449 . T) (-4451 . T)) -((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-174))) (-3783 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564)))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (-12 (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -415) (QUOTE (-572))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -415) (QUOTE (-572))) (|devaluate| |#1|)))) (|HasCategory| (-415 (-572)) (QUOTE (-1123))) (|HasCategory| |#1| (QUOTE (-370))) (-3783 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-564)))) (-3783 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-564)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -415) (QUOTE (-572)))))) (|HasSignature| |#1| (LIST (QUOTE -3491) (LIST (|devaluate| |#1|) (QUOTE (-1188)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -415) (QUOTE (-572)))))) (-3783 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-968))) (|HasCategory| |#1| (QUOTE (-1214))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasSignature| |#1| (LIST (QUOTE -3270) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1188))))) (|HasSignature| |#1| (LIST (QUOTE -2221) (LIST (LIST (QUOTE -652) (QUOTE (-1188))) (|devaluate| |#1|))))))) +((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-174))) (-2813 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564)))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (-12 (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -415) (QUOTE (-572))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -415) (QUOTE (-572))) (|devaluate| |#1|)))) (|HasCategory| (-415 (-572)) (QUOTE (-1123))) (|HasCategory| |#1| (QUOTE (-370))) (-2813 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-564)))) (-2813 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-564)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -415) (QUOTE (-572)))))) (|HasSignature| |#1| (LIST (QUOTE -2940) (LIST (|devaluate| |#1|) (QUOTE (-1188)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -415) (QUOTE (-572)))))) (-2813 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-968))) (|HasCategory| |#1| (QUOTE (-1214))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasSignature| |#1| (LIST (QUOTE -3921) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1188))))) (|HasSignature| |#1| (LIST (QUOTE -4353) (LIST (LIST (QUOTE -652) (QUOTE (-1188))) (|devaluate| |#1|))))))) (-483 |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."))) ((-4455 . T)) -((-12 (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (QUOTE (-1111))) (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (LIST (QUOTE -315) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -1640) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3763) (|devaluate| |#2|)))))) (-3783 (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (QUOTE (-1111))) (|HasCategory| |#2| (QUOTE (-1111)))) (-3783 (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (QUOTE (-1111))) (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (LIST (QUOTE -622) (QUOTE (-544)))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (|HasCategory| |#1| (QUOTE (-858))) (-3783 (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (QUOTE (-1111)))) +((-12 (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (QUOTE (-1111))) (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (LIST (QUOTE -315) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -3690) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -1907) (|devaluate| |#2|)))))) (-2813 (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (QUOTE (-1111))) (|HasCategory| |#2| (QUOTE (-1111)))) (-2813 (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (QUOTE (-1111))) (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (LIST (QUOTE -622) (QUOTE (-544)))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (|HasCategory| |#1| (QUOTE (-858))) (-2813 (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (QUOTE (-1111)))) (-484 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)}"))) ((-4455 . T) (-4454 . T)) @@ -1879,7 +1879,7 @@ NIL (-487 |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."))) ((-4454 . T) (-4455 . T)) -((-12 (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (QUOTE (-1111))) (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (LIST (QUOTE -315) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -1640) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3763) (|devaluate| |#2|)))))) (-3783 (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (QUOTE (-1111))) (|HasCategory| |#2| (QUOTE (-1111)))) (-3783 (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (QUOTE (-1111))) (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (LIST (QUOTE -622) (QUOTE (-544)))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (QUOTE (-1111))) (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#2| (QUOTE (-1111))) (-3783 (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (LIST (QUOTE -621) (QUOTE (-870))))) +((-12 (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (QUOTE (-1111))) (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (LIST (QUOTE -315) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -3690) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -1907) (|devaluate| |#2|)))))) (-2813 (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (QUOTE (-1111))) (|HasCategory| |#2| (QUOTE (-1111)))) (-2813 (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (QUOTE (-1111))) (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (LIST (QUOTE -622) (QUOTE (-544)))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (QUOTE (-1111))) (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#2| (QUOTE (-1111))) (-2813 (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (LIST (QUOTE -621) (QUOTE (-870))))) (-488) ((|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 @@ -1887,11 +1887,11 @@ NIL (-489 |vl| R) ((|constructor| (NIL "\\indented{2}{This type supports distributed multivariate polynomials} whose variables are from a user specified list of symbols. The coefficient ring may be non commutative,{} but the variables are assumed to commute. The term ordering is total degree ordering refined by reverse lexicographic ordering with respect to the position that the variables appear in the list of variables parameter.")) (|reorder| (($ $ (|List| (|Integer|))) "\\spad{reorder(p, perm)} applies the permutation perm to the variables in a polynomial and returns the new correctly ordered polynomial"))) (((-4456 "*") |has| |#2| (-174)) (-4447 |has| |#2| (-564)) (-4452 |has| |#2| (-6 -4452)) (-4449 . T) (-4448 . T) (-4451 . T)) -((|HasCategory| |#2| (QUOTE (-918))) (-3783 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-460))) (|HasCategory| |#2| (QUOTE (-564))) (|HasCategory| |#2| (QUOTE (-918)))) (-3783 (|HasCategory| |#2| (QUOTE (-460))) (|HasCategory| |#2| (QUOTE (-564))) (|HasCategory| |#2| (QUOTE (-918)))) (-3783 (|HasCategory| |#2| (QUOTE (-460))) (|HasCategory| |#2| (QUOTE (-918)))) (|HasCategory| |#2| (QUOTE (-564))) (|HasCategory| |#2| (QUOTE (-174))) (-3783 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-564)))) (-12 (|HasCategory| (-872 |#1|) (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| |#2| (LIST (QUOTE -895) (QUOTE (-386))))) (-12 (|HasCategory| (-872 |#1|) (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -895) (QUOTE (-572))))) (-12 (|HasCategory| (-872 |#1|) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| |#2| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386)))))) (-12 (|HasCategory| (-872 |#1|) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572)))))) (-12 (|HasCategory| (-872 |#1|) (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#2| (LIST (QUOTE -622) (QUOTE (-544))))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (QUOTE (-148))) (|HasCategory| |#2| (QUOTE (-146))) (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572)))) (-3783 (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572)))))) (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-370))) (|HasAttribute| |#2| (QUOTE -4452)) (|HasCategory| |#2| (QUOTE (-460))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#2| (QUOTE (-918)))) (-3783 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#2| (QUOTE (-918)))) (|HasCategory| |#2| (QUOTE (-146))))) -(-490 -3436 S) +((|HasCategory| |#2| (QUOTE (-918))) (-2813 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-460))) (|HasCategory| |#2| (QUOTE (-564))) (|HasCategory| |#2| (QUOTE (-918)))) (-2813 (|HasCategory| |#2| (QUOTE (-460))) (|HasCategory| |#2| (QUOTE (-564))) (|HasCategory| |#2| (QUOTE (-918)))) (-2813 (|HasCategory| |#2| (QUOTE (-460))) (|HasCategory| |#2| (QUOTE (-918)))) (|HasCategory| |#2| (QUOTE (-564))) (|HasCategory| |#2| (QUOTE (-174))) (-2813 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-564)))) (-12 (|HasCategory| (-872 |#1|) (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| |#2| (LIST (QUOTE -895) (QUOTE (-386))))) (-12 (|HasCategory| (-872 |#1|) (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -895) (QUOTE (-572))))) (-12 (|HasCategory| (-872 |#1|) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| |#2| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386)))))) (-12 (|HasCategory| (-872 |#1|) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572)))))) (-12 (|HasCategory| (-872 |#1|) (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#2| (LIST (QUOTE -622) (QUOTE (-544))))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (QUOTE (-148))) (|HasCategory| |#2| (QUOTE (-146))) (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572)))) (-2813 (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572)))))) (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-370))) (|HasAttribute| |#2| (QUOTE -4452)) (|HasCategory| |#2| (QUOTE (-460))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#2| (QUOTE (-918)))) (-2813 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#2| (QUOTE (-918)))) (|HasCategory| |#2| (QUOTE (-146))))) +(-490 -4131 S) ((|constructor| (NIL "\\indented{2}{This type represents the finite direct or cartesian product of an} underlying ordered component type. The vectors are ordered first by the sum of their components,{} and then refined using a reverse lexicographic ordering. This type is a suitable third argument for \\spadtype{GeneralDistributedMultivariatePolynomial}."))) ((-4448 |has| |#2| (-1060)) (-4449 |has| |#2| (-1060)) (-4451 |has| |#2| (-6 -4451)) ((-4456 "*") |has| |#2| (-174)) (-4454 . T)) -((-3783 (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-132))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-375))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-734))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-801))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-856))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))))) (-3783 (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-1111)))) (-12 (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (QUOTE (-1060)))) (-12 (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188))))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#2| (QUOTE (-370))) (-3783 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-1060)))) (-3783 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-370)))) (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-801))) (-3783 (|HasCategory| |#2| (QUOTE (-801))) (|HasCategory| |#2| (QUOTE (-856)))) (|HasCategory| |#2| (QUOTE (-856))) (|HasCategory| |#2| (QUOTE (-734))) (-3783 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-1060)))) (|HasCategory| |#2| (QUOTE (-375))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (-3783 (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-132))) (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-1060)))) (-3783 (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (QUOTE (-132))) (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-1060)))) (-3783 (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-1060)))) (-3783 (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (QUOTE (-1060)))) (|HasCategory| |#2| (QUOTE (-237))) (-3783 (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-132))) (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-375))) (|HasCategory| |#2| (QUOTE (-734))) (|HasCategory| |#2| (QUOTE (-801))) (|HasCategory| |#2| (QUOTE (-856))) (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (QUOTE (-1111)))) (|HasCategory| |#2| (QUOTE (-1111))) (-3783 (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-25)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-132)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-174)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-237)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-370)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-375)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-734)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-801)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-856)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-1060)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-1111))))) (-3783 (-12 (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-132))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-375))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-734))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-801))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-856))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-1060))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572)))))) (-3783 (-12 (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-132))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-375))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-734))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-801))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-856))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572)))))) (|HasCategory| (-572) (QUOTE (-858))) (-12 (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (QUOTE (-1060)))) (-12 (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188))))) (-3783 (|HasCategory| |#2| (QUOTE (-1060))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572)))))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-1111)))) (|HasAttribute| |#2| (QUOTE -4451)) (|HasCategory| |#2| (QUOTE (-132))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|))))) +((-2813 (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-132))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-375))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-734))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-801))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-856))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))))) (-2813 (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-1111)))) (-12 (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (QUOTE (-1060)))) (-12 (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188))))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#2| (QUOTE (-370))) (-2813 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-1060)))) (-2813 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-370)))) (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-801))) (-2813 (|HasCategory| |#2| (QUOTE (-801))) (|HasCategory| |#2| (QUOTE (-856)))) (|HasCategory| |#2| (QUOTE (-856))) (|HasCategory| |#2| (QUOTE (-734))) (-2813 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-1060)))) (|HasCategory| |#2| (QUOTE (-375))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (-2813 (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-132))) (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-1060)))) (-2813 (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (QUOTE (-132))) (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-1060)))) (-2813 (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-1060)))) (-2813 (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (QUOTE (-1060)))) (|HasCategory| |#2| (QUOTE (-237))) (-2813 (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-132))) (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-375))) (|HasCategory| |#2| (QUOTE (-734))) (|HasCategory| |#2| (QUOTE (-801))) (|HasCategory| |#2| (QUOTE (-856))) (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (QUOTE (-1111)))) (|HasCategory| |#2| (QUOTE (-1111))) (-2813 (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-25)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-132)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-174)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-237)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-370)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-375)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-734)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-801)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-856)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-1060)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-1111))))) (-2813 (-12 (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-132))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-375))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-734))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-801))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-856))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-1060))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572)))))) (-2813 (-12 (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-132))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-375))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-734))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-801))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-856))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572)))))) (|HasCategory| (-572) (QUOTE (-858))) (-12 (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (QUOTE (-1060)))) (-12 (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188))))) (-2813 (|HasCategory| |#2| (QUOTE (-1060))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572)))))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-1111)))) (|HasAttribute| |#2| (QUOTE -4451)) (|HasCategory| |#2| (QUOTE (-132))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|))))) (-491) ((|constructor| (NIL "This domain represents the header of a definition.")) (|parameters| (((|List| (|ParameterAst|)) $) "\\spad{parameters(h)} gives the parameters specified in the definition header \\spad{`h'}.")) (|name| (((|Identifier|) $) "\\spad{name(h)} returns the name of the operation defined defined.")) (|headAst| (($ (|Identifier|) (|List| (|ParameterAst|))) "\\spad{headAst(f,[x1,..,xn])} constructs a function definition header."))) NIL @@ -1899,8 +1899,8 @@ NIL (-492 S) ((|constructor| (NIL "Heap implemented in a flexible array to allow for insertions")) (|heap| (($ (|List| |#1|)) "\\spad{heap(ls)} creates a heap of elements consisting of the elements of \\spad{ls}."))) ((-4454 . T) (-4455 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1111))) (-3783 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) -(-493 -3636 UP UPUP R) +((-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1111))) (-2813 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) +(-493 -1384 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 @@ -1911,7 +1911,7 @@ NIL (-495) ((|constructor| (NIL "This domain allows rational numbers to be presented as repeating hexadecimal expansions.")) (|hex| (($ (|Fraction| (|Integer|))) "\\spad{hex(r)} converts a rational number to a hexadecimal expansion.")) (|fractionPart| (((|Fraction| (|Integer|)) $) "\\spad{fractionPart(h)} returns the fractional part of a hexadecimal expansion."))) ((-4446 . T) (-4452 . T) (-4447 . T) ((-4456 "*") . T) (-4448 . T) (-4449 . T) (-4451 . T)) -((|HasCategory| (-572) (QUOTE (-918))) (|HasCategory| (-572) (LIST (QUOTE -1049) (QUOTE (-1188)))) (|HasCategory| (-572) (QUOTE (-146))) (|HasCategory| (-572) (QUOTE (-148))) (|HasCategory| (-572) (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| (-572) (QUOTE (-1033))) (|HasCategory| (-572) (QUOTE (-828))) (-3783 (|HasCategory| (-572) (QUOTE (-828))) (|HasCategory| (-572) (QUOTE (-858)))) (|HasCategory| (-572) (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| (-572) (QUOTE (-1163))) (|HasCategory| (-572) (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| (-572) (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| (-572) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| (-572) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| (-572) (QUOTE (-237))) (|HasCategory| (-572) (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| (-572) (LIST (QUOTE -522) (QUOTE (-1188)) (QUOTE (-572)))) (|HasCategory| (-572) (LIST (QUOTE -315) (QUOTE (-572)))) (|HasCategory| (-572) (LIST (QUOTE -292) (QUOTE (-572)) (QUOTE (-572)))) (|HasCategory| (-572) (QUOTE (-313))) (|HasCategory| (-572) (QUOTE (-553))) (|HasCategory| (-572) (QUOTE (-858))) (|HasCategory| (-572) (LIST (QUOTE -647) (QUOTE (-572)))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| (-572) (QUOTE (-918)))) (-3783 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| (-572) (QUOTE (-918)))) (|HasCategory| (-572) (QUOTE (-146))))) +((|HasCategory| (-572) (QUOTE (-918))) (|HasCategory| (-572) (LIST (QUOTE -1049) (QUOTE (-1188)))) (|HasCategory| (-572) (QUOTE (-146))) (|HasCategory| (-572) (QUOTE (-148))) (|HasCategory| (-572) (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| (-572) (QUOTE (-1033))) (|HasCategory| (-572) (QUOTE (-828))) (-2813 (|HasCategory| (-572) (QUOTE (-828))) (|HasCategory| (-572) (QUOTE (-858)))) (|HasCategory| (-572) (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| (-572) (QUOTE (-1163))) (|HasCategory| (-572) (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| (-572) (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| (-572) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| (-572) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| (-572) (QUOTE (-237))) (|HasCategory| (-572) (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| (-572) (LIST (QUOTE -522) (QUOTE (-1188)) (QUOTE (-572)))) (|HasCategory| (-572) (LIST (QUOTE -315) (QUOTE (-572)))) (|HasCategory| (-572) (LIST (QUOTE -292) (QUOTE (-572)) (QUOTE (-572)))) (|HasCategory| (-572) (QUOTE (-313))) (|HasCategory| (-572) (QUOTE (-553))) (|HasCategory| (-572) (QUOTE (-858))) (|HasCategory| (-572) (LIST (QUOTE -647) (QUOTE (-572)))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| (-572) (QUOTE (-918)))) (-2813 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| (-572) (QUOTE (-918)))) (|HasCategory| (-572) (QUOTE (-146))))) (-496 A S) ((|constructor| (NIL "A homogeneous aggregate is an aggregate of elements all of the same type. In the current system,{} all aggregates are homogeneous. Two attributes characterize classes of aggregates. Aggregates from domains with attribute \\spadatt{finiteAggregate} have a finite number of members. Those with attribute \\spadatt{shallowlyMutable} allow an element to be modified or updated without changing its overall value.")) (|member?| (((|Boolean|) |#2| $) "\\spad{member?(x,u)} tests if \\spad{x} is a member of \\spad{u}. For collections,{} \\axiom{member?(\\spad{x},{}\\spad{u}) = reduce(or,{}[x=y for \\spad{y} in \\spad{u}],{}\\spad{false})}.")) (|members| (((|List| |#2|) $) "\\spad{members(u)} returns a list of the consecutive elements of \\spad{u}. For collections,{} \\axiom{parts([\\spad{x},{}\\spad{y},{}...,{}\\spad{z}]) = (\\spad{x},{}\\spad{y},{}...,{}\\spad{z})}.")) (|parts| (((|List| |#2|) $) "\\spad{parts(u)} returns a list of the consecutive elements of \\spad{u}. For collections,{} \\axiom{parts([\\spad{x},{}\\spad{y},{}...,{}\\spad{z}]) = (\\spad{x},{}\\spad{y},{}...,{}\\spad{z})}.")) (|count| (((|NonNegativeInteger|) |#2| $) "\\spad{count(x,u)} returns the number of occurrences of \\spad{x} in \\spad{u}. For collections,{} \\axiom{count(\\spad{x},{}\\spad{u}) = reduce(+,{}[x=y for \\spad{y} in \\spad{u}],{}0)}.") (((|NonNegativeInteger|) (|Mapping| (|Boolean|) |#2|) $) "\\spad{count(p,u)} returns the number of elements \\spad{x} in \\spad{u} such that \\axiom{\\spad{p}(\\spad{x})} is \\spad{true}. For collections,{} \\axiom{count(\\spad{p},{}\\spad{u}) = reduce(+,{}[1 for \\spad{x} in \\spad{u} | \\spad{p}(\\spad{x})],{}0)}.")) (|every?| (((|Boolean|) (|Mapping| (|Boolean|) |#2|) $) "\\spad{every?(f,u)} tests if \\spad{p}(\\spad{x}) is \\spad{true} for all elements \\spad{x} of \\spad{u}. Note: for collections,{} \\axiom{every?(\\spad{p},{}\\spad{u}) = reduce(and,{}map(\\spad{f},{}\\spad{u}),{}\\spad{true},{}\\spad{false})}.")) (|any?| (((|Boolean|) (|Mapping| (|Boolean|) |#2|) $) "\\spad{any?(p,u)} tests if \\axiom{\\spad{p}(\\spad{x})} is \\spad{true} for any element \\spad{x} of \\spad{u}. Note: for collections,{} \\axiom{any?(\\spad{p},{}\\spad{u}) = reduce(or,{}map(\\spad{f},{}\\spad{u}),{}\\spad{false},{}\\spad{true})}.")) (|map!| (($ (|Mapping| |#2| |#2|) $) "\\spad{map!(f,u)} destructively replaces each element \\spad{x} of \\spad{u} by \\axiom{\\spad{f}(\\spad{x})}.")) (|map| (($ (|Mapping| |#2| |#2|) $) "\\spad{map(f,u)} returns a copy of \\spad{u} with each element \\spad{x} replaced by \\spad{f}(\\spad{x}). For collections,{} \\axiom{map(\\spad{f},{}\\spad{u}) = [\\spad{f}(\\spad{x}) for \\spad{x} in \\spad{u}]}."))) NIL @@ -1936,7 +1936,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 -(-502 -3636 UP |AlExt| |AlPol|) +(-502 -1384 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 @@ -1947,16 +1947,16 @@ NIL (-504 S |mn|) ((|constructor| (NIL "\\indented{1}{Author Micheal Monagan Aug/87} This is the basic one dimensional array data type."))) ((-4455 . T) (-4454 . T)) -((-3783 (-12 (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) (-3783 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544)))) (-3783 (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-1111)))) (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| (-572) (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) +((-2813 (-12 (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) (-2813 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544)))) (-2813 (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-1111)))) (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| (-572) (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) (-505 R |mnRow| |mnCol|) ((|constructor| (NIL "\\indented{1}{An IndexedTwoDimensionalArray is a 2-dimensional array where} the minimal row and column indices are parameters of the type. Rows and columns are returned as IndexedOneDimensionalArray\\spad{'s} with minimal indices matching those of the IndexedTwoDimensionalArray. The index of the 'first' row may be obtained by calling the function 'minRowIndex'. The index of the 'first' column may be obtained by calling the function 'minColIndex'. The index of the first element of a 'Row' is the same as the index of the first column in an array and vice versa."))) ((-4454 . T) (-4455 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1111))) (-3783 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) +((-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1111))) (-2813 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (-506 K R UP) ((|constructor| (NIL "\\indented{1}{Author: Clifton Williamson} Date Created: 9 August 1993 Date Last Updated: 3 December 1993 Basic Operations: chineseRemainder,{} factorList Related Domains: PAdicWildFunctionFieldIntegralBasis(\\spad{K},{}\\spad{R},{}UP,{}\\spad{F}) Also See: WildFunctionFieldIntegralBasis,{} FunctionFieldIntegralBasis AMS Classifications: Keywords: function field,{} finite field,{} integral basis Examples: References: Description:")) (|chineseRemainder| (((|Record| (|:| |basis| (|Matrix| |#2|)) (|:| |basisDen| |#2|) (|:| |basisInv| (|Matrix| |#2|))) (|List| |#3|) (|List| (|Record| (|:| |basis| (|Matrix| |#2|)) (|:| |basisDen| |#2|) (|:| |basisInv| (|Matrix| |#2|)))) (|NonNegativeInteger|)) "\\spad{chineseRemainder(lu,lr,n)} \\undocumented")) (|listConjugateBases| (((|List| (|Record| (|:| |basis| (|Matrix| |#2|)) (|:| |basisDen| |#2|) (|:| |basisInv| (|Matrix| |#2|)))) (|Record| (|:| |basis| (|Matrix| |#2|)) (|:| |basisDen| |#2|) (|:| |basisInv| (|Matrix| |#2|))) (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{listConjugateBases(bas,q,n)} returns the list \\spad{[bas,bas^Frob,bas^(Frob^2),...bas^(Frob^(n-1))]},{} where \\spad{Frob} raises the coefficients of all polynomials appearing in the basis \\spad{bas} to the \\spad{q}th power.")) (|factorList| (((|List| (|SparseUnivariatePolynomial| |#1|)) |#1| (|NonNegativeInteger|) (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{factorList(k,n,m,j)} \\undocumented"))) NIL NIL -(-507 R UP -3636) +(-507 R UP -1384) ((|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 @@ -1976,7 +1976,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 -(-512 -3636 |Expon| |VarSet| |DPoly|) +(-512 -1384 |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 -622) (QUOTE (-1188))))) @@ -2027,7 +2027,7 @@ NIL (-524 S |mn|) ((|constructor| (NIL "\\indented{1}{Author: Michael Monagan July/87,{} modified \\spad{SMW} June/91} A FlexibleArray is the notion of an array intended to allow for growth at the end only. Hence the following efficient operations \\indented{2}{\\spad{append(x,a)} meaning append item \\spad{x} at the end of the array \\spad{a}} \\indented{2}{\\spad{delete(a,n)} meaning delete the last item from the array \\spad{a}} Flexible arrays support the other operations inherited from \\spadtype{ExtensibleLinearAggregate}. However,{} these are not efficient. Flexible arrays combine the \\spad{O(1)} access time property of arrays with growing and shrinking at the end in \\spad{O(1)} (average) time. This is done by using an ordinary array which may have zero or more empty slots at the end. When the array becomes full it is copied into a new larger (50\\% larger) array. Conversely,{} when the array becomes less than 1/2 full,{} it is copied into a smaller array. Flexible arrays provide for an efficient implementation of many data structures in particular heaps,{} stacks and sets.")) (|shrinkable| (((|Boolean|) (|Boolean|)) "\\spad{shrinkable(b)} sets the shrinkable attribute of flexible arrays to \\spad{b} and returns the previous value")) (|physicalLength!| (($ $ (|Integer|)) "\\spad{physicalLength!(x,n)} changes the physical length of \\spad{x} to be \\spad{n} and returns the new array.")) (|physicalLength| (((|NonNegativeInteger|) $) "\\spad{physicalLength(x)} returns the number of elements \\spad{x} can accomodate before growing")) (|flexibleArray| (($ (|List| |#1|)) "\\spad{flexibleArray(l)} creates a flexible array from the list of elements \\spad{l}"))) ((-4455 . T) (-4454 . T)) -((-3783 (-12 (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) (-3783 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544)))) (-3783 (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-1111)))) (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| (-572) (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) +((-2813 (-12 (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) (-2813 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544)))) (-2813 (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-1111)))) (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| (-572) (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) (-525) ((|constructor| (NIL "This domain represents AST for conditional expressions.")) (|elseBranch| (((|SpadAst|) $) "thenBranch(\\spad{e}) returns the `else-branch' of `e'.")) (|thenBranch| (((|SpadAst|) $) "\\spad{thenBranch(e)} returns the `then-branch' of `e'.")) (|condition| (((|SpadAst|) $) "\\spad{condition(e)} returns the condition of the if-expression `e'."))) NIL @@ -2035,15 +2035,15 @@ NIL (-526 |p| |n|) ((|constructor| (NIL "InnerFiniteField(\\spad{p},{}\\spad{n}) implements finite fields with \\spad{p**n} elements where \\spad{p} is assumed prime but does not check. For a version which checks that \\spad{p} is prime,{} see \\spadtype{FiniteField}."))) ((-4446 . T) (-4452 . T) (-4447 . T) ((-4456 "*") . T) (-4448 . T) (-4449 . T) (-4451 . T)) -((-3783 (|HasCategory| (-589 |#1|) (QUOTE (-146))) (|HasCategory| (-589 |#1|) (QUOTE (-375)))) (|HasCategory| (-589 |#1|) (QUOTE (-148))) (|HasCategory| (-589 |#1|) (QUOTE (-375))) (|HasCategory| (-589 |#1|) (QUOTE (-146)))) +((-2813 (|HasCategory| (-589 |#1|) (QUOTE (-146))) (|HasCategory| (-589 |#1|) (QUOTE (-375)))) (|HasCategory| (-589 |#1|) (QUOTE (-148))) (|HasCategory| (-589 |#1|) (QUOTE (-375))) (|HasCategory| (-589 |#1|) (QUOTE (-146)))) (-527 R |mnRow| |mnCol| |Row| |Col|) ((|constructor| (NIL "\\indented{1}{This is an internal type which provides an implementation of} 2-dimensional arrays as PrimitiveArray\\spad{'s} of PrimitiveArray\\spad{'s}."))) ((-4454 . T) (-4455 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1111))) (-3783 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) +((-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1111))) (-2813 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (-528 S |mn|) ((|constructor| (NIL "\\spadtype{IndexedList} is a basic implementation of the functions in \\spadtype{ListAggregate},{} often using functions in the underlying LISP system. The second parameter to the constructor (\\spad{mn}) is the beginning index of the list. That is,{} if \\spad{l} is a list,{} then \\spad{elt(l,mn)} is the first value. This constructor is probably best viewed as the implementation of singly-linked lists that are addressable by index rather than as a mere wrapper for LISP lists."))) ((-4455 . T) (-4454 . T)) -((-3783 (-12 (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) (-3783 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544)))) (-3783 (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-1111)))) (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| (-572) (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) +((-2813 (-12 (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) (-2813 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544)))) (-2813 (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-1111)))) (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| (-572) (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) (-529 R |Row| |Col| M) ((|constructor| (NIL "\\spadtype{InnerMatrixLinearAlgebraFunctions} is an internal package which provides standard linear algebra functions on domains in \\spad{MatrixCategory}")) (|inverse| (((|Union| |#4| "failed") |#4|) "\\spad{inverse(m)} returns the inverse of the matrix \\spad{m}. If the matrix is not invertible,{} \"failed\" is returned. Error: if the matrix is not square.")) (|generalizedInverse| ((|#4| |#4|) "\\spad{generalizedInverse(m)} returns the generalized (Moore--Penrose) inverse of the matrix \\spad{m},{} \\spadignore{i.e.} the matrix \\spad{h} such that m*h*m=h,{} h*m*h=m,{} \\spad{m*h} and \\spad{h*m} are both symmetric matrices.")) (|determinant| ((|#1| |#4|) "\\spad{determinant(m)} returns the determinant of the matrix \\spad{m}. an error message is returned if the matrix is not square.")) (|nullSpace| (((|List| |#3|) |#4|) "\\spad{nullSpace(m)} returns a basis for the null space of the matrix \\spad{m}.")) (|nullity| (((|NonNegativeInteger|) |#4|) "\\spad{nullity(m)} returns the mullity of the matrix \\spad{m}. This is the dimension of the null space of the matrix \\spad{m}.")) (|rank| (((|NonNegativeInteger|) |#4|) "\\spad{rank(m)} returns the rank of the matrix \\spad{m}.")) (|rowEchelon| ((|#4| |#4|) "\\spad{rowEchelon(m)} returns the row echelon form of the matrix \\spad{m}."))) NIL @@ -2055,7 +2055,7 @@ NIL (-531 R |mnRow| |mnCol|) ((|constructor| (NIL "An \\spad{IndexedMatrix} is a matrix where the minimal row and column indices are parameters of the type. The domains Row and Col are both IndexedVectors. The index of the 'first' row may be obtained by calling the function \\spadfun{minRowIndex}. The index of the 'first' column may be obtained by calling the function \\spadfun{minColIndex}. The index of the first element of a 'Row' is the same as the index of the first column in a matrix and vice versa."))) ((-4454 . T) (-4455 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1111))) (-3783 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (QUOTE (-313))) (|HasCategory| |#1| (QUOTE (-564))) (|HasAttribute| |#1| (QUOTE (-4456 "*"))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) +((-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1111))) (-2813 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (QUOTE (-313))) (|HasCategory| |#1| (QUOTE (-564))) (|HasAttribute| |#1| (QUOTE (-4456 "*"))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (-532) ((|constructor| (NIL "This domain represents an `import' of types.")) (|imports| (((|List| (|TypeAst|)) $) "\\spad{imports(x)} returns the list of imported types.")) (|coerce| (($ (|List| (|TypeAst|))) "ts::ImportAst constructs an ImportAst for the list if types `ts'."))) NIL @@ -2088,7 +2088,7 @@ NIL ((|constructor| (NIL "\\indented{2}{IndexedExponents of an ordered set of variables gives a representation} for the degree of polynomials in commuting variables. It gives an ordered pairing of non negative integer exponents with variables"))) NIL NIL -(-540 K -3636 |Par|) +(-540 K -1384 |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 @@ -2112,7 +2112,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 -(-546 K -3636 |Par|) +(-546 K -1384 |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 @@ -2163,12 +2163,12 @@ NIL (-558 |Key| |Entry| |addDom|) ((|constructor| (NIL "This domain is used to provide a conditional \"add\" domain for the implementation of \\spadtype{Table}."))) ((-4454 . T) (-4455 . T)) -((-12 (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (QUOTE (-1111))) (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (LIST (QUOTE -315) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -1640) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3763) (|devaluate| |#2|)))))) (-3783 (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (QUOTE (-1111))) (|HasCategory| |#2| (QUOTE (-1111)))) (-3783 (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (QUOTE (-1111))) (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (LIST (QUOTE -622) (QUOTE (-544)))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (QUOTE (-1111))) (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#2| (QUOTE (-1111))) (-3783 (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (LIST (QUOTE -621) (QUOTE (-870))))) -(-559 R -3636) +((-12 (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (QUOTE (-1111))) (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (LIST (QUOTE -315) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -3690) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -1907) (|devaluate| |#2|)))))) (-2813 (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (QUOTE (-1111))) (|HasCategory| |#2| (QUOTE (-1111)))) (-2813 (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (QUOTE (-1111))) (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (LIST (QUOTE -622) (QUOTE (-544)))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (QUOTE (-1111))) (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#2| (QUOTE (-1111))) (-2813 (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (LIST (QUOTE -621) (QUOTE (-870))))) +(-559 R -1384) ((|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 -(-560 R0 -3636 UP UPUP R) +(-560 R0 -1384 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 @@ -2178,7 +2178,7 @@ NIL NIL (-562 R) ((|constructor| (NIL "\\indented{1}{+ Author: Mike Dewar} + Date Created: November 1996 + Date Last Updated: + Basic Functions: + Related Constructors: + Also See: + AMS Classifications: + Keywords: + References: + Description: + This category implements of interval arithmetic and transcendental + functions over intervals.")) (|contains?| (((|Boolean|) $ |#1|) "\\spad{contains?(i,f)} returns \\spad{true} if \\axiom{\\spad{f}} is contained within the interval \\axiom{\\spad{i}},{} \\spad{false} otherwise.")) (|negative?| (((|Boolean|) $) "\\spad{negative?(u)} returns \\axiom{\\spad{true}} if every element of \\spad{u} is negative,{} \\axiom{\\spad{false}} otherwise.")) (|positive?| (((|Boolean|) $) "\\spad{positive?(u)} returns \\axiom{\\spad{true}} if every element of \\spad{u} is positive,{} \\axiom{\\spad{false}} otherwise.")) (|width| ((|#1| $) "\\spad{width(u)} returns \\axiom{sup(\\spad{u}) - inf(\\spad{u})}.")) (|sup| ((|#1| $) "\\spad{sup(u)} returns the supremum of \\axiom{\\spad{u}}.")) (|inf| ((|#1| $) "\\spad{inf(u)} returns the infinum of \\axiom{\\spad{u}}.")) (|qinterval| (($ |#1| |#1|) "\\spad{qinterval(inf,sup)} creates a new interval \\axiom{[\\spad{inf},{}\\spad{sup}]},{} without checking the ordering on the elements.")) (|interval| (($ (|Fraction| (|Integer|))) "\\spad{interval(f)} creates a new interval around \\spad{f}.") (($ |#1|) "\\spad{interval(f)} creates a new interval around \\spad{f}.") (($ |#1| |#1|) "\\spad{interval(inf,sup)} creates a new interval,{} either \\axiom{[\\spad{inf},{}\\spad{sup}]} if \\axiom{\\spad{inf} \\spad{<=} \\spad{sup}} or \\axiom{[\\spad{sup},{}in]} otherwise."))) -((-4091 . T) (-4447 . T) ((-4456 "*") . T) (-4448 . T) (-4449 . T) (-4451 . T)) +((-3548 . T) (-4447 . T) ((-4456 "*") . T) (-4448 . T) (-4449 . T) (-4451 . T)) NIL (-563 S) ((|constructor| (NIL "The category of commutative integral domains,{} \\spadignore{i.e.} commutative rings with no zero divisors. \\blankline Conditional attributes: \\indented{2}{canonicalUnitNormal\\tab{20}the canonical field is the same for all associates} \\indented{2}{canonicalsClosed\\tab{20}the product of two canonicals is itself canonical}")) (|unit?| (((|Boolean|) $) "\\spad{unit?(x)} tests whether \\spad{x} is a unit,{} \\spadignore{i.e.} is invertible.")) (|associates?| (((|Boolean|) $ $) "\\spad{associates?(x,y)} tests whether \\spad{x} and \\spad{y} are associates,{} \\spadignore{i.e.} differ by a unit factor.")) (|unitCanonical| (($ $) "\\spad{unitCanonical(x)} returns \\spad{unitNormal(x).canonical}.")) (|unitNormal| (((|Record| (|:| |unit| $) (|:| |canonical| $) (|:| |associate| $)) $) "\\spad{unitNormal(x)} tries to choose a canonical element from the associate class of \\spad{x}. The attribute canonicalUnitNormal,{} if asserted,{} means that the \"canonical\" element is the same across all associates of \\spad{x} if \\spad{unitNormal(x) = [u,c,a]} then \\spad{u*c = x},{} \\spad{a*u = 1}.")) (|exquo| (((|Union| $ "failed") $ $) "\\spad{exquo(a,b)} either returns an element \\spad{c} such that \\spad{c*b=a} or \"failed\" if no such element can be found."))) @@ -2188,7 +2188,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."))) ((-4447 . T) ((-4456 "*") . T) (-4448 . T) (-4449 . T) (-4451 . T)) NIL -(-565 R -3636) +(-565 R -1384) ((|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 @@ -2200,7 +2200,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 -(-568 R -3636 L) +(-568 R -1384 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 -664) (|devaluate| |#2|)))) @@ -2208,11 +2208,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 -(-570 -3636 UP UPUP R) +(-570 -1384 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 -(-571 -3636 UP) +(-571 -1384 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 @@ -2224,15 +2224,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 -(-574 R -3636 L) +(-574 R -1384 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 -664) (|devaluate| |#2|)))) -(-575 R -3636) +(-575 R -1384) ((|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 -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| |#2| (QUOTE (-1150)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| |#2| (QUOTE (-637))))) -(-576 -3636 UP) +(-576 -1384 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 @@ -2240,27 +2240,27 @@ NIL ((|constructor| (NIL "Provides integer testing and retraction functions. Date Created: March 1990 Date Last Updated: 9 April 1991")) (|integerIfCan| (((|Union| (|Integer|) "failed") |#1|) "\\spad{integerIfCan(x)} returns \\spad{x} as an integer,{} \"failed\" if \\spad{x} is not an integer.")) (|integer?| (((|Boolean|) |#1|) "\\spad{integer?(x)} is \\spad{true} if \\spad{x} is an integer,{} \\spad{false} otherwise.")) (|integer| (((|Integer|) |#1|) "\\spad{integer(x)} returns \\spad{x} as an integer; error if \\spad{x} is not an integer."))) NIL NIL -(-578 -3636) +(-578 -1384) ((|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 (-579 R) ((|constructor| (NIL "\\indented{1}{+ Author: Mike Dewar} + Date Created: November 1996 + Date Last Updated: + Basic Functions: + Related Constructors: + Also See: + AMS Classifications: + Keywords: + References: + Description: + This domain is an implementation of interval arithmetic and transcendental + functions over intervals."))) -((-4091 . T) (-4447 . T) ((-4456 "*") . T) (-4448 . T) (-4449 . T) (-4451 . T)) +((-3548 . T) (-4447 . T) ((-4456 "*") . T) (-4448 . T) (-4449 . T) (-4451 . T)) NIL (-580) ((|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 -(-581 R -3636) +(-581 R -1384) ((|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 -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| |#2| (QUOTE (-290))) (|HasCategory| |#2| (QUOTE (-637))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-1188))))) (-12 (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#2| (QUOTE (-290)))) (|HasCategory| |#1| (QUOTE (-564)))) -(-582 -3636 UP) +(-582 -1384 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 -(-583 R -3636) +(-583 R -1384) ((|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 @@ -2292,11 +2292,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 -(-591 R -3636) +(-591 R -1384) ((|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 -(-592 E -3636) +(-592 E -1384) ((|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 @@ -2304,7 +2304,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 -(-594 -3636) +(-594 -1384) ((|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}."))) ((-4449 . T) (-4448 . T)) ((|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-1188))))) @@ -2335,7 +2335,7 @@ NIL (-601 |mn|) ((|constructor| (NIL "This domain implements low-level strings"))) ((-4455 . T) (-4454 . T)) -((-3783 (-12 (|HasCategory| (-145) (QUOTE (-858))) (|HasCategory| (-145) (LIST (QUOTE -315) (QUOTE (-145))))) (-12 (|HasCategory| (-145) (QUOTE (-1111))) (|HasCategory| (-145) (LIST (QUOTE -315) (QUOTE (-145)))))) (-3783 (|HasCategory| (-145) (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| (-145) (QUOTE (-1111))) (|HasCategory| (-145) (LIST (QUOTE -315) (QUOTE (-145)))))) (|HasCategory| (-145) (LIST (QUOTE -622) (QUOTE (-544)))) (-3783 (|HasCategory| (-145) (QUOTE (-858))) (|HasCategory| (-145) (QUOTE (-1111)))) (|HasCategory| (-145) (QUOTE (-858))) (|HasCategory| (-572) (QUOTE (-858))) (|HasCategory| (-145) (QUOTE (-1111))) (|HasCategory| (-145) (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| (-145) (QUOTE (-1111))) (|HasCategory| (-145) (LIST (QUOTE -315) (QUOTE (-145)))))) +((-2813 (-12 (|HasCategory| (-145) (QUOTE (-858))) (|HasCategory| (-145) (LIST (QUOTE -315) (QUOTE (-145))))) (-12 (|HasCategory| (-145) (QUOTE (-1111))) (|HasCategory| (-145) (LIST (QUOTE -315) (QUOTE (-145)))))) (-2813 (|HasCategory| (-145) (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| (-145) (QUOTE (-1111))) (|HasCategory| (-145) (LIST (QUOTE -315) (QUOTE (-145)))))) (|HasCategory| (-145) (LIST (QUOTE -622) (QUOTE (-544)))) (-2813 (|HasCategory| (-145) (QUOTE (-858))) (|HasCategory| (-145) (QUOTE (-1111)))) (|HasCategory| (-145) (QUOTE (-858))) (|HasCategory| (-572) (QUOTE (-858))) (|HasCategory| (-145) (QUOTE (-1111))) (|HasCategory| (-145) (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| (-145) (QUOTE (-1111))) (|HasCategory| (-145) (LIST (QUOTE -315) (QUOTE (-145)))))) (-602 E V R P) ((|constructor| (NIL "tools for the summation packages.")) (|sum| (((|Record| (|:| |num| |#4|) (|:| |den| (|Integer|))) |#4| |#2|) "\\spad{sum(p(n), n)} returns \\spad{P(n)},{} the indefinite sum of \\spad{p(n)} with respect to upward difference on \\spad{n},{} \\spadignore{i.e.} \\spad{P(n+1) - P(n) = a(n)}.") (((|Record| (|:| |num| |#4|) (|:| |den| (|Integer|))) |#4| |#2| (|Segment| |#4|)) "\\spad{sum(p(n), n = a..b)} returns \\spad{p(a) + p(a+1) + ... + p(b)}."))) NIL @@ -2343,7 +2343,7 @@ NIL (-603 |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}."))) (((-4456 "*") |has| |#1| (-174)) (-4447 |has| |#1| (-564)) (-4448 . T) (-4449 . T) (-4451 . T)) -((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-564))) (-3783 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564)))) (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (-12 (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-572)) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-572)) (|devaluate| |#1|)))) (|HasCategory| (-572) (QUOTE (-1123))) (|HasCategory| |#1| (QUOTE (-370))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-572))))) (|HasSignature| |#1| (LIST (QUOTE -3491) (LIST (|devaluate| |#1|) (QUOTE (-1188)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-572)))))) +((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-564))) (-2813 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564)))) (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (-12 (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-572)) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-572)) (|devaluate| |#1|)))) (|HasCategory| (-572) (QUOTE (-1123))) (|HasCategory| |#1| (QUOTE (-370))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-572))))) (|HasSignature| |#1| (LIST (QUOTE -2940) (LIST (|devaluate| |#1|) (QUOTE (-1188)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-572)))))) (-604 |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.}"))) (((-4456 "*") |has| |#1| (-564)) (-4447 |has| |#1| (-564)) (-4448 . T) (-4449 . T) (-4451 . T)) @@ -2360,7 +2360,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 -(-608 R -3636 FG) +(-608 R -1384 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 @@ -2371,7 +2371,7 @@ NIL (-610 R |mn|) ((|constructor| (NIL "\\indented{2}{This type represents vector like objects with varying lengths} and a user-specified initial index."))) ((-4455 . T) (-4454 . T)) -((-3783 (-12 (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) (-3783 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544)))) (-3783 (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-1111)))) (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| (-572) (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-734))) (|HasCategory| |#1| (QUOTE (-1060))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (QUOTE (-1060)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) +((-2813 (-12 (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) (-2813 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544)))) (-2813 (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-1111)))) (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| (-572) (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-734))) (|HasCategory| |#1| (QUOTE (-1060))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (QUOTE (-1060)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) (-611 S |Index| |Entry|) ((|constructor| (NIL "An indexed aggregate is a many-to-one mapping of indices to entries. For example,{} a one-dimensional-array is an indexed aggregate where the index is an integer. Also,{} a table is an indexed aggregate where the indices and entries may have any type.")) (|swap!| (((|Void|) $ |#2| |#2|) "\\spad{swap!(u,i,j)} interchanges elements \\spad{i} and \\spad{j} of aggregate \\spad{u}. No meaningful value is returned.")) (|fill!| (($ $ |#3|) "\\spad{fill!(u,x)} replaces each entry in aggregate \\spad{u} by \\spad{x}. The modified \\spad{u} is returned as value.")) (|first| ((|#3| $) "\\spad{first(u)} returns the first element \\spad{x} of \\spad{u}. Note: for collections,{} \\axiom{first([\\spad{x},{}\\spad{y},{}...,{}\\spad{z}]) = \\spad{x}}. Error: if \\spad{u} is empty.")) (|minIndex| ((|#2| $) "\\spad{minIndex(u)} returns the minimum index \\spad{i} of aggregate \\spad{u}. Note: in general,{} \\axiom{minIndex(a) = reduce(min,{}[\\spad{i} for \\spad{i} in indices a])}; for lists,{} \\axiom{minIndex(a) = 1}.")) (|maxIndex| ((|#2| $) "\\spad{maxIndex(u)} returns the maximum index \\spad{i} of aggregate \\spad{u}. Note: in general,{} \\axiom{maxIndex(\\spad{u}) = reduce(max,{}[\\spad{i} for \\spad{i} in indices \\spad{u}])}; if \\spad{u} is a list,{} \\axiom{maxIndex(\\spad{u}) = \\#u}.")) (|entry?| (((|Boolean|) |#3| $) "\\spad{entry?(x,u)} tests if \\spad{x} equals \\axiom{\\spad{u} . \\spad{i}} for some index \\spad{i}.")) (|indices| (((|List| |#2|) $) "\\spad{indices(u)} returns a list of indices of aggregate \\spad{u} in no particular order.")) (|index?| (((|Boolean|) |#2| $) "\\spad{index?(i,u)} tests if \\spad{i} is an index of aggregate \\spad{u}.")) (|entries| (((|List| |#3|) $) "\\spad{entries(u)} returns a list of all the entries of aggregate \\spad{u} in no assumed order."))) NIL @@ -2390,12 +2390,12 @@ NIL NIL (-615 R A) ((|constructor| (NIL "\\indented{1}{AssociatedJordanAlgebra takes an algebra \\spad{A} and uses \\spadfun{*\\$A}} \\indented{1}{to define the new multiplications \\spad{a*b := (a *\\$A b + b *\\$A a)/2}} \\indented{1}{(anticommutator).} \\indented{1}{The usual notation \\spad{{a,b}_+} cannot be used due to} \\indented{1}{restrictions in the current language.} \\indented{1}{This domain only gives a Jordan algebra if the} \\indented{1}{Jordan-identity \\spad{(a*b)*c + (b*c)*a + (c*a)*b = 0} holds} \\indented{1}{for all \\spad{a},{}\\spad{b},{}\\spad{c} in \\spad{A}.} \\indented{1}{This relation can be checked by} \\indented{1}{\\spadfun{jordanAdmissible?()\\$A}.} \\blankline If the underlying algebra is of type \\spadtype{FramedNonAssociativeAlgebra(R)} (\\spadignore{i.e.} a non associative algebra over \\spad{R} which is a free \\spad{R}-module of finite rank,{} together with a fixed \\spad{R}-module basis),{} then the same is \\spad{true} for the associated Jordan algebra. Moreover,{} if the underlying algebra is of type \\spadtype{FiniteRankNonAssociativeAlgebra(R)} (\\spadignore{i.e.} a non associative algebra over \\spad{R} which is a free \\spad{R}-module of finite rank),{} then the same \\spad{true} for the associated Jordan algebra.")) (|coerce| (($ |#2|) "\\spad{coerce(a)} coerces the element \\spad{a} of the algebra \\spad{A} to an element of the Jordan algebra \\spadtype{AssociatedJordanAlgebra}(\\spad{R},{}A)."))) -((-4451 -3783 (-3804 (|has| |#2| (-374 |#1|)) (|has| |#1| (-564))) (-12 (|has| |#2| (-425 |#1|)) (|has| |#1| (-564)))) (-4449 . T) (-4448 . T)) -((-3783 (|HasCategory| |#2| (LIST (QUOTE -374) (|devaluate| |#1|))) (|HasCategory| |#2| (LIST (QUOTE -425) (|devaluate| |#1|)))) (|HasCategory| |#2| (LIST (QUOTE -425) (|devaluate| |#1|))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -425) (|devaluate| |#1|)))) (-3783 (-12 (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#2| (LIST (QUOTE -374) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#2| (LIST (QUOTE -425) (|devaluate| |#1|))))) (|HasCategory| |#2| (LIST (QUOTE -374) (|devaluate| |#1|)))) +((-4451 -2813 (-2085 (|has| |#2| (-374 |#1|)) (|has| |#1| (-564))) (-12 (|has| |#2| (-425 |#1|)) (|has| |#1| (-564)))) (-4449 . T) (-4448 . T)) +((-2813 (|HasCategory| |#2| (LIST (QUOTE -374) (|devaluate| |#1|))) (|HasCategory| |#2| (LIST (QUOTE -425) (|devaluate| |#1|)))) (|HasCategory| |#2| (LIST (QUOTE -425) (|devaluate| |#1|))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -425) (|devaluate| |#1|)))) (-2813 (-12 (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#2| (LIST (QUOTE -374) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#2| (LIST (QUOTE -425) (|devaluate| |#1|))))) (|HasCategory| |#2| (LIST (QUOTE -374) (|devaluate| |#1|)))) (-616 |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."))) ((-4454 . T) (-4455 . T)) -((-12 (|HasCategory| (-2 (|:| -1640 (-1170)) (|:| -3763 |#1|)) (QUOTE (-1111))) (|HasCategory| (-2 (|:| -1640 (-1170)) (|:| -3763 |#1|)) (LIST (QUOTE -315) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -1640) (QUOTE (-1170))) (LIST (QUOTE |:|) (QUOTE -3763) (|devaluate| |#1|)))))) (|HasCategory| (-2 (|:| -1640 (-1170)) (|:| -3763 |#1|)) (LIST (QUOTE -622) (QUOTE (-544)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| (-1170) (QUOTE (-858))) (|HasCategory| (-2 (|:| -1640 (-1170)) (|:| -3763 |#1|)) (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| (-2 (|:| -1640 (-1170)) (|:| -3763 |#1|)) (LIST (QUOTE -621) (QUOTE (-870))))) +((-12 (|HasCategory| (-2 (|:| -3690 (-1170)) (|:| -1907 |#1|)) (QUOTE (-1111))) (|HasCategory| (-2 (|:| -3690 (-1170)) (|:| -1907 |#1|)) (LIST (QUOTE -315) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -3690) (QUOTE (-1170))) (LIST (QUOTE |:|) (QUOTE -1907) (|devaluate| |#1|)))))) (|HasCategory| (-2 (|:| -3690 (-1170)) (|:| -1907 |#1|)) (LIST (QUOTE -622) (QUOTE (-544)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| (-1170) (QUOTE (-858))) (|HasCategory| (-2 (|:| -3690 (-1170)) (|:| -1907 |#1|)) (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| (-2 (|:| -3690 (-1170)) (|:| -1907 |#1|)) (LIST (QUOTE -621) (QUOTE (-870))))) (-617 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 @@ -2420,7 +2420,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 -(-623 -3636 UP) +(-623 -1384 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 @@ -2448,7 +2448,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}."))) ((-4448 . T) (-4449 . T) (-4451 . T)) ((|HasCategory| |#1| (QUOTE (-856)))) -(-630 R -3636) +(-630 R -1384) ((|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 @@ -2480,18 +2480,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 -(-638 R -3636) +(-638 R -1384) ((|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 -(-639 |lv| -3636) +(-639 |lv| -1384) ((|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 (-640) ((|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."))) ((-4455 . T)) -((-12 (|HasCategory| (-2 (|:| -1640 (-1170)) (|:| -3763 (-52))) (QUOTE (-1111))) (|HasCategory| (-2 (|:| -1640 (-1170)) (|:| -3763 (-52))) (LIST (QUOTE -315) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -1640) (QUOTE (-1170))) (LIST (QUOTE |:|) (QUOTE -3763) (QUOTE (-52))))))) (-3783 (|HasCategory| (-2 (|:| -1640 (-1170)) (|:| -3763 (-52))) (QUOTE (-1111))) (|HasCategory| (-52) (QUOTE (-1111)))) (-3783 (|HasCategory| (-2 (|:| -1640 (-1170)) (|:| -3763 (-52))) (QUOTE (-1111))) (|HasCategory| (-2 (|:| -1640 (-1170)) (|:| -3763 (-52))) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| (-52) (QUOTE (-1111))) (|HasCategory| (-52) (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| (-2 (|:| -1640 (-1170)) (|:| -3763 (-52))) (LIST (QUOTE -622) (QUOTE (-544)))) (-12 (|HasCategory| (-52) (QUOTE (-1111))) (|HasCategory| (-52) (LIST (QUOTE -315) (QUOTE (-52))))) (|HasCategory| (-1170) (QUOTE (-858))) (-3783 (|HasCategory| (-2 (|:| -1640 (-1170)) (|:| -3763 (-52))) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| (-52) (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| (-52) (QUOTE (-1111))) (|HasCategory| (-52) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| (-2 (|:| -1640 (-1170)) (|:| -3763 (-52))) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| (-2 (|:| -1640 (-1170)) (|:| -3763 (-52))) (QUOTE (-1111)))) +((-12 (|HasCategory| (-2 (|:| -3690 (-1170)) (|:| -1907 (-52))) (QUOTE (-1111))) (|HasCategory| (-2 (|:| -3690 (-1170)) (|:| -1907 (-52))) (LIST (QUOTE -315) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -3690) (QUOTE (-1170))) (LIST (QUOTE |:|) (QUOTE -1907) (QUOTE (-52))))))) (-2813 (|HasCategory| (-2 (|:| -3690 (-1170)) (|:| -1907 (-52))) (QUOTE (-1111))) (|HasCategory| (-52) (QUOTE (-1111)))) (-2813 (|HasCategory| (-2 (|:| -3690 (-1170)) (|:| -1907 (-52))) (QUOTE (-1111))) (|HasCategory| (-2 (|:| -3690 (-1170)) (|:| -1907 (-52))) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| (-52) (QUOTE (-1111))) (|HasCategory| (-52) (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| (-2 (|:| -3690 (-1170)) (|:| -1907 (-52))) (LIST (QUOTE -622) (QUOTE (-544)))) (-12 (|HasCategory| (-52) (QUOTE (-1111))) (|HasCategory| (-52) (LIST (QUOTE -315) (QUOTE (-52))))) (|HasCategory| (-1170) (QUOTE (-858))) (-2813 (|HasCategory| (-2 (|:| -3690 (-1170)) (|:| -1907 (-52))) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| (-52) (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| (-52) (QUOTE (-1111))) (|HasCategory| (-52) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| (-2 (|:| -3690 (-1170)) (|:| -1907 (-52))) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| (-2 (|:| -3690 (-1170)) (|:| -1907 (-52))) (QUOTE (-1111)))) (-641 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 @@ -2502,8 +2502,8 @@ NIL NIL (-643 R A) ((|constructor| (NIL "AssociatedLieAlgebra takes an algebra \\spad{A} and uses \\spadfun{*\\$A} to define the Lie bracket \\spad{a*b := (a *\\$A b - b *\\$A a)} (commutator). Note that the notation \\spad{[a,b]} cannot be used due to restrictions of the current compiler. This domain only gives a Lie algebra if the Jacobi-identity \\spad{(a*b)*c + (b*c)*a + (c*a)*b = 0} holds for all \\spad{a},{}\\spad{b},{}\\spad{c} in \\spad{A}. This relation can be checked by \\spad{lieAdmissible?()\\$A}. \\blankline If the underlying algebra is of type \\spadtype{FramedNonAssociativeAlgebra(R)} (\\spadignore{i.e.} a non associative algebra over \\spad{R} which is a free \\spad{R}-module of finite rank,{} together with a fixed \\spad{R}-module basis),{} then the same is \\spad{true} for the associated Lie algebra. Also,{} if the underlying algebra is of type \\spadtype{FiniteRankNonAssociativeAlgebra(R)} (\\spadignore{i.e.} a non associative algebra over \\spad{R} which is a free \\spad{R}-module of finite rank),{} then the same is \\spad{true} for the associated Lie algebra.")) (|coerce| (($ |#2|) "\\spad{coerce(a)} coerces the element \\spad{a} of the algebra \\spad{A} to an element of the Lie algebra \\spadtype{AssociatedLieAlgebra}(\\spad{R},{}A)."))) -((-4451 -3783 (-3804 (|has| |#2| (-374 |#1|)) (|has| |#1| (-564))) (-12 (|has| |#2| (-425 |#1|)) (|has| |#1| (-564)))) (-4449 . T) (-4448 . T)) -((-3783 (|HasCategory| |#2| (LIST (QUOTE -374) (|devaluate| |#1|))) (|HasCategory| |#2| (LIST (QUOTE -425) (|devaluate| |#1|)))) (|HasCategory| |#2| (LIST (QUOTE -425) (|devaluate| |#1|))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -425) (|devaluate| |#1|)))) (-3783 (-12 (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#2| (LIST (QUOTE -374) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#2| (LIST (QUOTE -425) (|devaluate| |#1|))))) (|HasCategory| |#2| (LIST (QUOTE -374) (|devaluate| |#1|)))) +((-4451 -2813 (-2085 (|has| |#2| (-374 |#1|)) (|has| |#1| (-564))) (-12 (|has| |#2| (-425 |#1|)) (|has| |#1| (-564)))) (-4449 . T) (-4448 . T)) +((-2813 (|HasCategory| |#2| (LIST (QUOTE -374) (|devaluate| |#1|))) (|HasCategory| |#2| (LIST (QUOTE -425) (|devaluate| |#1|)))) (|HasCategory| |#2| (LIST (QUOTE -425) (|devaluate| |#1|))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -425) (|devaluate| |#1|)))) (-2813 (-12 (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#2| (LIST (QUOTE -374) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#2| (LIST (QUOTE -425) (|devaluate| |#1|))))) (|HasCategory| |#2| (LIST (QUOTE -374) (|devaluate| |#1|)))) (-644 R FE) ((|constructor| (NIL "PowerSeriesLimitPackage implements limits of expressions in one or more variables as one of the variables approaches a limiting value. Included are two-sided limits,{} left- and right- hand limits,{} and limits at plus or minus infinity.")) (|complexLimit| (((|Union| (|OnePointCompletion| |#2|) "failed") |#2| (|Equation| (|OnePointCompletion| |#2|))) "\\spad{complexLimit(f(x),x = a)} computes the complex limit \\spad{lim(x -> a,f(x))}.")) (|limit| (((|Union| (|OrderedCompletion| |#2|) "failed") |#2| (|Equation| |#2|) (|String|)) "\\spad{limit(f(x),x=a,\"left\")} computes the left hand real limit \\spad{lim(x -> a-,f(x))}; \\spad{limit(f(x),x=a,\"right\")} computes the right hand real limit \\spad{lim(x -> a+,f(x))}.") (((|Union| (|OrderedCompletion| |#2|) (|Record| (|:| |leftHandLimit| (|Union| (|OrderedCompletion| |#2|) "failed")) (|:| |rightHandLimit| (|Union| (|OrderedCompletion| |#2|) "failed"))) "failed") |#2| (|Equation| (|OrderedCompletion| |#2|))) "\\spad{limit(f(x),x = a)} computes the real limit \\spad{lim(x -> a,f(x))}."))) NIL @@ -2515,7 +2515,7 @@ NIL (-646 S R) ((|constructor| (NIL "Test for linear dependence.")) (|solveLinear| (((|Union| (|Vector| (|Fraction| |#1|)) "failed") (|Vector| |#2|) |#2|) "\\spad{solveLinear([v1,...,vn], u)} returns \\spad{[c1,...,cn]} such that \\spad{c1*v1 + ... + cn*vn = u},{} \"failed\" if no such \\spad{ci}\\spad{'s} exist in the quotient field of \\spad{S}.") (((|Union| (|Vector| |#1|) "failed") (|Vector| |#2|) |#2|) "\\spad{solveLinear([v1,...,vn], u)} returns \\spad{[c1,...,cn]} such that \\spad{c1*v1 + ... + cn*vn = u},{} \"failed\" if no such \\spad{ci}\\spad{'s} exist in \\spad{S}.")) (|linearDependence| (((|Union| (|Vector| |#1|) "failed") (|Vector| |#2|)) "\\spad{linearDependence([v1,...,vn])} returns \\spad{[c1,...,cn]} if \\spad{c1*v1 + ... + cn*vn = 0} and not all the \\spad{ci}\\spad{'s} are 0,{} \"failed\" if the \\spad{vi}\\spad{'s} are linearly independent over \\spad{S}.")) (|linearlyDependent?| (((|Boolean|) (|Vector| |#2|)) "\\spad{linearlyDependent?([v1,...,vn])} returns \\spad{true} if the \\spad{vi}\\spad{'s} are linearly dependent over \\spad{S},{} \\spad{false} otherwise."))) NIL -((-3796 (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (QUOTE (-370)))) +((-2074 (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (QUOTE (-370)))) (-647 R) ((|constructor| (NIL "An extension ring with an explicit linear dependence test.")) (|reducedSystem| (((|Record| (|:| |mat| (|Matrix| |#1|)) (|:| |vec| (|Vector| |#1|))) (|Matrix| $) (|Vector| $)) "\\spad{reducedSystem(A, v)} returns a matrix \\spad{B} and a vector \\spad{w} such that \\spad{A x = v} and \\spad{B x = w} have the same solutions in \\spad{R}.") (((|Matrix| |#1|) (|Matrix| $)) "\\spad{reducedSystem(A)} returns a matrix \\spad{B} such that \\spad{A x = 0} and \\spad{B x = 0} have the same solutions in \\spad{R}."))) ((-4451 . T)) @@ -2539,7 +2539,7 @@ NIL (-652 S) ((|constructor| (NIL "\\spadtype{List} implements singly-linked lists that are addressable by indices; the index of the first element is 1. In addition to the operations provided by \\spadtype{IndexedList},{} this constructor provides some LISP-like functions such as \\spadfun{null} and \\spadfun{cons}.")) (|setDifference| (($ $ $) "\\spad{setDifference(u1,u2)} returns a list of the elements of \\spad{u1} that are not also in \\spad{u2}. The order of elements in the resulting list is unspecified.")) (|setIntersection| (($ $ $) "\\spad{setIntersection(u1,u2)} returns a list of the elements that lists \\spad{u1} and \\spad{u2} have in common. The order of elements in the resulting list is unspecified.")) (|setUnion| (($ $ $) "\\spad{setUnion(u1,u2)} appends the two lists \\spad{u1} and \\spad{u2},{} then removes all duplicates. The order of elements in the resulting list is unspecified.")) (|append| (($ $ $) "\\spad{append(u1,u2)} appends the elements of list \\spad{u1} onto the front of list \\spad{u2}. This new list and \\spad{u2} will share some structure.")) (|cons| (($ |#1| $) "\\spad{cons(element,u)} appends \\spad{element} onto the front of list \\spad{u} and returns the new list. This new list and the old one will share some structure.")) (|null| (((|Boolean|) $) "\\spad{null(u)} tests if list \\spad{u} is the empty list.")) (|nil| (($) "\\spad{nil} is the empty list."))) ((-4455 . T) (-4454 . T)) -((-3783 (-12 (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) (-3783 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544)))) (-3783 (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-1111)))) (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-836))) (|HasCategory| (-572) (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) +((-2813 (-12 (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) (-2813 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544)))) (-2813 (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-1111)))) (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-836))) (|HasCategory| (-572) (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) (-653 T$) ((|constructor| (NIL "This domain represents AST for Spad literals."))) NIL @@ -2551,7 +2551,7 @@ NIL (-655 S) ((|substitute| (($ |#1| |#1| $) "\\spad{substitute(x,y,d)} replace \\spad{x}\\spad{'s} with \\spad{y}\\spad{'s} in dictionary \\spad{d}.")) (|duplicates?| (((|Boolean|) $) "\\spad{duplicates?(d)} tests if dictionary \\spad{d} has duplicate entries."))) ((-4454 . T) (-4455 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1111))) (-3783 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) +((-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1111))) (-2813 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (-656 R) ((|constructor| (NIL "The category of left modules over an \\spad{rng} (ring not necessarily with unit). This is an abelian group which supports left multiplation by elements of the \\spad{rng}. \\blankline"))) NIL @@ -2568,7 +2568,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 -(-660 R -3636 L) +(-660 R -1384 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 @@ -2588,11 +2588,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}."))) ((-4448 . T) (-4449 . T) (-4451 . T)) NIL -(-665 -3636 UP) +(-665 -1384 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)))) -(-666 A -3693) +(-666 A -2514) ((|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}}"))) ((-4448 . T) (-4449 . T) (-4451 . T)) ((|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-370)))) @@ -2628,11 +2628,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}."))) ((-4455 . T) (-4454 . T)) NIL -(-675 -3636) +(-675 -1384) ((|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 -(-676 -3636 |Row| |Col| M) +(-676 -1384 |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 @@ -2643,7 +2643,7 @@ NIL (-678 |n| R) ((|constructor| (NIL "LieSquareMatrix(\\spad{n},{}\\spad{R}) implements the Lie algebra of the \\spad{n} by \\spad{n} matrices over the commutative ring \\spad{R}. The Lie bracket (commutator) of the algebra is given by \\spad{a*b := (a *\\$SQMATRIX(n,R) b - b *\\$SQMATRIX(n,R) a)},{} where \\spadfun{*\\$SQMATRIX(\\spad{n},{}\\spad{R})} is the usual matrix multiplication."))) ((-4451 . T) (-4454 . T) (-4448 . T) (-4449 . T)) -((|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (QUOTE (-237))) (|HasAttribute| |#2| (QUOTE (-4456 "*"))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572)))) (-3783 (-12 (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))))) (|HasCategory| |#2| (QUOTE (-313))) (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-564))) (-3783 (|HasAttribute| |#2| (QUOTE (-4456 "*"))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (QUOTE (-237)))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (|HasCategory| |#2| (QUOTE (-174)))) +((|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (QUOTE (-237))) (|HasAttribute| |#2| (QUOTE (-4456 "*"))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572)))) (-2813 (-12 (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))))) (|HasCategory| |#2| (QUOTE (-313))) (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-564))) (-2813 (|HasAttribute| |#2| (QUOTE (-4456 "*"))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (QUOTE (-237)))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (|HasCategory| |#2| (QUOTE (-174)))) (-679) ((|constructor| (NIL "This domain represents `literal sequence' syntax.")) (|elements| (((|List| (|SpadAst|)) $) "\\spad{elements(e)} returns the list of expressions in the `literal' list `e'."))) NIL @@ -2663,7 +2663,7 @@ NIL (-683 R) ((|constructor| (NIL "This domain represents three dimensional matrices over a general object type")) (|matrixDimensions| (((|Vector| (|NonNegativeInteger|)) $) "\\spad{matrixDimensions(x)} returns the dimensions of a matrix")) (|matrixConcat3D| (($ (|Symbol|) $ $) "\\spad{matrixConcat3D(s,x,y)} concatenates two 3-\\spad{D} matrices along a specified axis")) (|coerce| (((|PrimitiveArray| (|PrimitiveArray| (|PrimitiveArray| |#1|))) $) "\\spad{coerce(x)} moves from the domain to the representation type") (($ (|PrimitiveArray| (|PrimitiveArray| (|PrimitiveArray| |#1|)))) "\\spad{coerce(p)} moves from the representation type (PrimitiveArray PrimitiveArray PrimitiveArray \\spad{R}) to the domain")) (|setelt!| ((|#1| $ (|NonNegativeInteger|) (|NonNegativeInteger|) (|NonNegativeInteger|) |#1|) "\\spad{setelt!(x,i,j,k,s)} (or \\spad{x}.\\spad{i}.\\spad{j}.k:=s) sets a specific element of the array to some value of type \\spad{R}")) (|elt| ((|#1| $ (|NonNegativeInteger|) (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{elt(x,i,j,k)} extract an element from the matrix \\spad{x}")) (|construct| (($ (|List| (|List| (|List| |#1|)))) "\\spad{construct(lll)} creates a 3-\\spad{D} matrix from a List List List \\spad{R} \\spad{lll}")) (|plus| (($ $ $) "\\spad{plus(x,y)} adds two matrices,{} term by term we note that they must be the same size")) (|identityMatrix| (($ (|NonNegativeInteger|)) "\\spad{identityMatrix(n)} create an identity matrix we note that this must be square")) (|zeroMatrix| (($ (|NonNegativeInteger|) (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{zeroMatrix(i,j,k)} create a matrix with all zero terms"))) NIL -((-3783 (-12 (|HasCategory| |#1| (QUOTE (-1060))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) (|HasCategory| |#1| (QUOTE (-1111))) (-3783 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (QUOTE (-1060))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) +((-2813 (-12 (|HasCategory| |#1| (QUOTE (-1060))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) (|HasCategory| |#1| (QUOTE (-1111))) (-2813 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (QUOTE (-1060))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) (-684) ((|constructor| (NIL "This domain represents the syntax of a macro definition.")) (|body| (((|SpadAst|) $) "\\spad{body(m)} returns the right hand side of the definition \\spad{`m'}.")) (|head| (((|HeadAst|) $) "\\spad{head(m)} returns the head of the macro definition \\spad{`m'}. This is a list of identifiers starting with the name of the macro followed by the name of the parameters,{} if any."))) NIL @@ -2719,7 +2719,7 @@ NIL (-697 R) ((|constructor| (NIL "\\spadtype{Matrix} is a matrix domain where 1-based indexing is used for both rows and columns.")) (|inverse| (((|Union| $ "failed") $) "\\spad{inverse(m)} returns the inverse of the matrix \\spad{m}. If the matrix is not invertible,{} \"failed\" is returned. Error: if the matrix is not square.")) (|diagonalMatrix| (($ (|Vector| |#1|)) "\\spad{diagonalMatrix(v)} returns a diagonal matrix where the elements of \\spad{v} appear on the diagonal."))) ((-4454 . T) (-4455 . T)) -((-3783 (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) (|HasCategory| |#1| (QUOTE (-1111))) (-3783 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#1| (QUOTE (-313))) (|HasCategory| |#1| (QUOTE (-564))) (|HasAttribute| |#1| (QUOTE (-4456 "*"))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) +((-2813 (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) (|HasCategory| |#1| (QUOTE (-1111))) (-2813 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#1| (QUOTE (-313))) (|HasCategory| |#1| (QUOTE (-564))) (|HasAttribute| |#1| (QUOTE (-4456 "*"))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) (-698 R) ((|constructor| (NIL "This package provides standard arithmetic operations on matrices. The functions in this package store the results of computations in existing matrices,{} rather than creating new matrices. This package works only for matrices of type Matrix and uses the internal representation of this type.")) (** (((|Matrix| |#1|) (|Matrix| |#1|) (|NonNegativeInteger|)) "\\spad{x ** n} computes the \\spad{n}-th power of a square matrix. The power \\spad{n} is assumed greater than 1.")) (|power!| (((|Matrix| |#1|) (|Matrix| |#1|) (|Matrix| |#1|) (|Matrix| |#1|) (|Matrix| |#1|) (|NonNegativeInteger|)) "\\spad{power!(a,b,c,m,n)} computes \\spad{m} \\spad{**} \\spad{n} and stores the result in \\spad{a}. The matrices \\spad{b} and \\spad{c} are used to store intermediate results. Error: if \\spad{a},{} \\spad{b},{} \\spad{c},{} and \\spad{m} are not square and of the same dimensions.")) (|times!| (((|Matrix| |#1|) (|Matrix| |#1|) (|Matrix| |#1|) (|Matrix| |#1|)) "\\spad{times!(c,a,b)} computes the matrix product \\spad{a * b} and stores the result in the matrix \\spad{c}. Error: if \\spad{a},{} \\spad{b},{} and \\spad{c} do not have compatible dimensions.")) (|rightScalarTimes!| (((|Matrix| |#1|) (|Matrix| |#1|) (|Matrix| |#1|) |#1|) "\\spad{rightScalarTimes!(c,a,r)} computes the scalar product \\spad{a * r} and stores the result in the matrix \\spad{c}. Error: if \\spad{a} and \\spad{c} do not have the same dimensions.")) (|leftScalarTimes!| (((|Matrix| |#1|) (|Matrix| |#1|) |#1| (|Matrix| |#1|)) "\\spad{leftScalarTimes!(c,r,a)} computes the scalar product \\spad{r * a} and stores the result in the matrix \\spad{c}. Error: if \\spad{a} and \\spad{c} do not have the same dimensions.")) (|minus!| (((|Matrix| |#1|) (|Matrix| |#1|) (|Matrix| |#1|) (|Matrix| |#1|)) "\\spad{!minus!(c,a,b)} computes the matrix difference \\spad{a - b} and stores the result in the matrix \\spad{c}. Error: if \\spad{a},{} \\spad{b},{} and \\spad{c} do not have the same dimensions.") (((|Matrix| |#1|) (|Matrix| |#1|) (|Matrix| |#1|)) "\\spad{minus!(c,a)} computes \\spad{-a} and stores the result in the matrix \\spad{c}. Error: if a and \\spad{c} do not have the same dimensions.")) (|plus!| (((|Matrix| |#1|) (|Matrix| |#1|) (|Matrix| |#1|) (|Matrix| |#1|)) "\\spad{plus!(c,a,b)} computes the matrix sum \\spad{a + b} and stores the result in the matrix \\spad{c}. Error: if \\spad{a},{} \\spad{b},{} and \\spad{c} do not have the same dimensions.")) (|copy!| (((|Matrix| |#1|) (|Matrix| |#1|) (|Matrix| |#1|)) "\\spad{copy!(c,a)} copies the matrix \\spad{a} into the matrix \\spad{c}. Error: if \\spad{a} and \\spad{c} do not have the same dimensions."))) NIL @@ -2728,7 +2728,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 -(-700 S -3636 FLAF FLAS) +(-700 S -1384 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 @@ -2738,8 +2738,8 @@ NIL NIL (-702) ((|constructor| (NIL "A domain which models the complex number representation used by machines in the AXIOM-NAG link.")) (|coerce| (((|Complex| (|Float|)) $) "\\spad{coerce(u)} transforms \\spad{u} into a COmplex Float") (($ (|Complex| (|MachineInteger|))) "\\spad{coerce(u)} transforms \\spad{u} into a MachineComplex") (($ (|Complex| (|MachineFloat|))) "\\spad{coerce(u)} transforms \\spad{u} into a MachineComplex") (($ (|Complex| (|Integer|))) "\\spad{coerce(u)} transforms \\spad{u} into a MachineComplex") (($ (|Complex| (|Float|))) "\\spad{coerce(u)} transforms \\spad{u} into a MachineComplex"))) -((-4447 . T) (-4452 |has| (-707) (-370)) (-4446 |has| (-707) (-370)) (-4101 . T) (-4453 |has| (-707) (-6 -4453)) (-4450 |has| (-707) (-6 -4450)) ((-4456 "*") . T) (-4448 . T) (-4449 . T) (-4451 . T)) -((|HasCategory| (-707) (QUOTE (-148))) (|HasCategory| (-707) (QUOTE (-146))) (|HasCategory| (-707) (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| (-707) (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| (-707) (QUOTE (-375))) (|HasCategory| (-707) (QUOTE (-370))) (-3783 (|HasCategory| (-707) (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| (-707) (QUOTE (-370)))) (|HasCategory| (-707) (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| (-707) (QUOTE (-237))) (-3783 (|HasCategory| (-707) (QUOTE (-370))) (|HasCategory| (-707) (QUOTE (-356)))) (|HasCategory| (-707) (QUOTE (-356))) (|HasCategory| (-707) (LIST (QUOTE -292) (QUOTE (-707)) (QUOTE (-707)))) (|HasCategory| (-707) (LIST (QUOTE -315) (QUOTE (-707)))) (|HasCategory| (-707) (LIST (QUOTE -522) (QUOTE (-1188)) (QUOTE (-707)))) (|HasCategory| (-707) (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| (-707) (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| (-707) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| (-707) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (-3783 (|HasCategory| (-707) (QUOTE (-313))) (|HasCategory| (-707) (QUOTE (-370))) (|HasCategory| (-707) (QUOTE (-356)))) (|HasCategory| (-707) (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| (-707) (QUOTE (-1033))) (|HasCategory| (-707) (QUOTE (-1214))) (-12 (|HasCategory| (-707) (QUOTE (-1013))) (|HasCategory| (-707) (QUOTE (-1214)))) (-3783 (-12 (|HasCategory| (-707) (QUOTE (-313))) (|HasCategory| (-707) (QUOTE (-918)))) (|HasCategory| (-707) (QUOTE (-370))) (-12 (|HasCategory| (-707) (QUOTE (-356))) (|HasCategory| (-707) (QUOTE (-918))))) (-3783 (-12 (|HasCategory| (-707) (QUOTE (-313))) (|HasCategory| (-707) (QUOTE (-918)))) (-12 (|HasCategory| (-707) (QUOTE (-370))) (|HasCategory| (-707) (QUOTE (-918)))) (-12 (|HasCategory| (-707) (QUOTE (-356))) (|HasCategory| (-707) (QUOTE (-918))))) (|HasCategory| (-707) (QUOTE (-553))) (-12 (|HasCategory| (-707) (QUOTE (-1071))) (|HasCategory| (-707) (QUOTE (-1214)))) (|HasCategory| (-707) (QUOTE (-1071))) (|HasCategory| (-707) (QUOTE (-313))) (|HasCategory| (-707) (QUOTE (-918))) (-3783 (-12 (|HasCategory| (-707) (QUOTE (-313))) (|HasCategory| (-707) (QUOTE (-918)))) (|HasCategory| (-707) (QUOTE (-370)))) (-3783 (-12 (|HasCategory| (-707) (QUOTE (-313))) (|HasCategory| (-707) (QUOTE (-918)))) (|HasCategory| (-707) (QUOTE (-564)))) (-12 (|HasCategory| (-707) (QUOTE (-237))) (|HasCategory| (-707) (QUOTE (-370)))) (-12 (|HasCategory| (-707) (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| (-707) (QUOTE (-370)))) (|HasCategory| (-707) (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| (-707) (QUOTE (-564))) (|HasAttribute| (-707) (QUOTE -4453)) (|HasAttribute| (-707) (QUOTE -4450)) (-12 (|HasCategory| (-707) (QUOTE (-313))) (|HasCategory| (-707) (QUOTE (-918)))) (-3783 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| (-707) (QUOTE (-313))) (|HasCategory| (-707) (QUOTE (-918)))) (|HasCategory| (-707) (QUOTE (-146)))) (-3783 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| (-707) (QUOTE (-313))) (|HasCategory| (-707) (QUOTE (-918)))) (|HasCategory| (-707) (QUOTE (-356))))) +((-4447 . T) (-4452 |has| (-707) (-370)) (-4446 |has| (-707) (-370)) (-3559 . T) (-4453 |has| (-707) (-6 -4453)) (-4450 |has| (-707) (-6 -4450)) ((-4456 "*") . T) (-4448 . T) (-4449 . T) (-4451 . T)) +((|HasCategory| (-707) (QUOTE (-148))) (|HasCategory| (-707) (QUOTE (-146))) (|HasCategory| (-707) (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| (-707) (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| (-707) (QUOTE (-375))) (|HasCategory| (-707) (QUOTE (-370))) (-2813 (|HasCategory| (-707) (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| (-707) (QUOTE (-370)))) (|HasCategory| (-707) (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| (-707) (QUOTE (-237))) (-2813 (|HasCategory| (-707) (QUOTE (-370))) (|HasCategory| (-707) (QUOTE (-356)))) (|HasCategory| (-707) (QUOTE (-356))) (|HasCategory| (-707) (LIST (QUOTE -292) (QUOTE (-707)) (QUOTE (-707)))) (|HasCategory| (-707) (LIST (QUOTE -315) (QUOTE (-707)))) (|HasCategory| (-707) (LIST (QUOTE -522) (QUOTE (-1188)) (QUOTE (-707)))) (|HasCategory| (-707) (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| (-707) (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| (-707) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| (-707) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (-2813 (|HasCategory| (-707) (QUOTE (-313))) (|HasCategory| (-707) (QUOTE (-370))) (|HasCategory| (-707) (QUOTE (-356)))) (|HasCategory| (-707) (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| (-707) (QUOTE (-1033))) (|HasCategory| (-707) (QUOTE (-1214))) (-12 (|HasCategory| (-707) (QUOTE (-1013))) (|HasCategory| (-707) (QUOTE (-1214)))) (-2813 (-12 (|HasCategory| (-707) (QUOTE (-313))) (|HasCategory| (-707) (QUOTE (-918)))) (|HasCategory| (-707) (QUOTE (-370))) (-12 (|HasCategory| (-707) (QUOTE (-356))) (|HasCategory| (-707) (QUOTE (-918))))) (-2813 (-12 (|HasCategory| (-707) (QUOTE (-313))) (|HasCategory| (-707) (QUOTE (-918)))) (-12 (|HasCategory| (-707) (QUOTE (-370))) (|HasCategory| (-707) (QUOTE (-918)))) (-12 (|HasCategory| (-707) (QUOTE (-356))) (|HasCategory| (-707) (QUOTE (-918))))) (|HasCategory| (-707) (QUOTE (-553))) (-12 (|HasCategory| (-707) (QUOTE (-1071))) (|HasCategory| (-707) (QUOTE (-1214)))) (|HasCategory| (-707) (QUOTE (-1071))) (|HasCategory| (-707) (QUOTE (-313))) (|HasCategory| (-707) (QUOTE (-918))) (-2813 (-12 (|HasCategory| (-707) (QUOTE (-313))) (|HasCategory| (-707) (QUOTE (-918)))) (|HasCategory| (-707) (QUOTE (-370)))) (-2813 (-12 (|HasCategory| (-707) (QUOTE (-313))) (|HasCategory| (-707) (QUOTE (-918)))) (|HasCategory| (-707) (QUOTE (-564)))) (-12 (|HasCategory| (-707) (QUOTE (-237))) (|HasCategory| (-707) (QUOTE (-370)))) (-12 (|HasCategory| (-707) (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| (-707) (QUOTE (-370)))) (|HasCategory| (-707) (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| (-707) (QUOTE (-564))) (|HasAttribute| (-707) (QUOTE -4453)) (|HasAttribute| (-707) (QUOTE -4450)) (-12 (|HasCategory| (-707) (QUOTE (-313))) (|HasCategory| (-707) (QUOTE (-918)))) (-2813 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| (-707) (QUOTE (-313))) (|HasCategory| (-707) (QUOTE (-918)))) (|HasCategory| (-707) (QUOTE (-146)))) (-2813 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| (-707) (QUOTE (-313))) (|HasCategory| (-707) (QUOTE (-918)))) (|HasCategory| (-707) (QUOTE (-356))))) (-703 S) ((|constructor| (NIL "A multi-dictionary is a dictionary which may contain duplicates. As for any dictionary,{} its size is assumed large so that copying (non-destructive) operations are generally to be avoided.")) (|duplicates| (((|List| (|Record| (|:| |entry| |#1|) (|:| |count| (|NonNegativeInteger|)))) $) "\\spad{duplicates(d)} returns a list of values which have duplicates in \\spad{d}")) (|removeDuplicates!| (($ $) "\\spad{removeDuplicates!(d)} destructively removes any duplicate values in dictionary \\spad{d}.")) (|insert!| (($ |#1| $ (|NonNegativeInteger|)) "\\spad{insert!(x,d,n)} destructively inserts \\spad{n} copies of \\spad{x} into dictionary \\spad{d}."))) ((-4455 . T)) @@ -2752,13 +2752,13 @@ NIL ((|constructor| (NIL "\\indented{1}{<description of package>} Author: Jim Wen Date Created: \\spad{??} Date Last Updated: October 1991 by Jon Steinbach Keywords: Examples: References:")) (|ptFunc| (((|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|))) "\\spad{ptFunc(a,b,c,d)} is an internal function exported in order to compile packages.")) (|meshPar1Var| (((|ThreeSpace| (|DoubleFloat|)) (|Expression| (|Integer|)) (|Expression| (|Integer|)) (|Expression| (|Integer|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|List| (|DrawOption|))) "\\spad{meshPar1Var(s,t,u,f,s1,l)} \\undocumented")) (|meshFun2Var| (((|ThreeSpace| (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) (|Union| (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) "undefined") (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|List| (|DrawOption|))) "\\spad{meshFun2Var(f,g,s1,s2,l)} \\undocumented")) (|meshPar2Var| (((|ThreeSpace| (|DoubleFloat|)) (|ThreeSpace| (|DoubleFloat|)) (|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|List| (|DrawOption|))) "\\spad{meshPar2Var(sp,f,s1,s2,l)} \\undocumented") (((|ThreeSpace| (|DoubleFloat|)) (|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|List| (|DrawOption|))) "\\spad{meshPar2Var(f,s1,s2,l)} \\undocumented") (((|ThreeSpace| (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) (|Union| (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) "undefined") (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|List| (|DrawOption|))) "\\spad{meshPar2Var(f,g,h,j,s1,s2,l)} \\undocumented"))) NIL NIL -(-706 OV E -3636 PG) +(-706 OV E -1384 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 (-707) ((|constructor| (NIL "A domain which models the floating point representation used by machines in the AXIOM-NAG link.")) (|changeBase| (($ (|Integer|) (|Integer|) (|PositiveInteger|)) "\\spad{changeBase(exp,man,base)} \\undocumented{}")) (|exponent| (((|Integer|) $) "\\spad{exponent(u)} returns the exponent of \\spad{u}")) (|mantissa| (((|Integer|) $) "\\spad{mantissa(u)} returns the mantissa of \\spad{u}")) (|coerce| (($ (|MachineInteger|)) "\\spad{coerce(u)} transforms a MachineInteger into a MachineFloat") (((|Float|) $) "\\spad{coerce(u)} transforms a MachineFloat to a standard Float")) (|minimumExponent| (((|Integer|)) "\\spad{minimumExponent()} returns the minimum exponent in the model") (((|Integer|) (|Integer|)) "\\spad{minimumExponent(e)} sets the minimum exponent in the model to \\spad{e}")) (|maximumExponent| (((|Integer|)) "\\spad{maximumExponent()} returns the maximum exponent in the model") (((|Integer|) (|Integer|)) "\\spad{maximumExponent(e)} sets the maximum exponent in the model to \\spad{e}")) (|base| (((|PositiveInteger|) (|PositiveInteger|)) "\\spad{base(b)} sets the base of the model to \\spad{b}")) (|precision| (((|PositiveInteger|)) "\\spad{precision()} returns the number of digits in the model") (((|PositiveInteger|) (|PositiveInteger|)) "\\spad{precision(p)} sets the number of digits in the model to \\spad{p}"))) -((-4091 . T) (-4446 . T) (-4452 . T) (-4447 . T) ((-4456 "*") . T) (-4448 . T) (-4449 . T) (-4451 . T)) +((-3548 . T) (-4446 . T) (-4452 . T) (-4447 . T) ((-4456 "*") . T) (-4448 . T) (-4449 . T) (-4451 . T)) NIL (-708 R) ((|constructor| (NIL "\\indented{1}{Modular hermitian row reduction.} Author: Manuel Bronstein Date Created: 22 February 1989 Date Last Updated: 24 November 1993 Keywords: matrix,{} reduction.")) (|normalizedDivide| (((|Record| (|:| |quotient| |#1|) (|:| |remainder| |#1|)) |#1| |#1|) "\\spad{normalizedDivide(n,d)} returns a normalized quotient and remainder such that consistently unique representatives for the residue class are chosen,{} \\spadignore{e.g.} positive remainders")) (|rowEchelonLocal| (((|Matrix| |#1|) (|Matrix| |#1|) |#1| |#1|) "\\spad{rowEchelonLocal(m, d, p)} computes the row-echelon form of \\spad{m} concatenated with \\spad{d} times the identity matrix over a local ring where \\spad{p} is the only prime.")) (|rowEchLocal| (((|Matrix| |#1|) (|Matrix| |#1|) |#1|) "\\spad{rowEchLocal(m,p)} computes a modular row-echelon form of \\spad{m},{} finding an appropriate modulus over a local ring where \\spad{p} is the only prime.")) (|rowEchelon| (((|Matrix| |#1|) (|Matrix| |#1|) |#1|) "\\spad{rowEchelon(m, d)} computes a modular row-echelon form mod \\spad{d} of \\indented{3}{[\\spad{d}\\space{5}]} \\indented{3}{[\\space{2}\\spad{d}\\space{3}]} \\indented{3}{[\\space{4}. ]} \\indented{3}{[\\space{5}\\spad{d}]} \\indented{3}{[\\space{3}\\spad{M}\\space{2}]} where \\spad{M = m mod d}.")) (|rowEch| (((|Matrix| |#1|) (|Matrix| |#1|)) "\\spad{rowEch(m)} computes a modular row-echelon form of \\spad{m},{} finding an appropriate modulus."))) @@ -2784,7 +2784,7 @@ NIL ((|constructor| (NIL "MakeRecord is used internally by the interpreter to create record types which are used for doing parallel iterations on streams.")) (|makeRecord| (((|Record| (|:| |part1| |#1|) (|:| |part2| |#2|)) |#1| |#2|) "\\spad{makeRecord(a,b)} creates a record object with type Record(part1:S,{} part2:R),{} where part1 is \\spad{a} and part2 is \\spad{b}."))) NIL NIL -(-714 S -4020 I) +(-714 S -3608 I) ((|constructor| (NIL "transforms top-level objects into compiled functions.")) (|compiledFunction| (((|Mapping| |#3| |#2|) |#1| (|Symbol|)) "\\spad{compiledFunction(expr, x)} returns a function \\spad{f: D -> I} defined by \\spad{f(x) == expr}. Function \\spad{f} is compiled and directly applicable to objects of type \\spad{D}.")) (|unaryFunction| (((|Mapping| |#3| |#2|) (|Symbol|)) "\\spad{unaryFunction(a)} is a local function"))) NIL NIL @@ -2804,14 +2804,14 @@ 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 -(-719 R |Mod| -4322 -4086 |exactQuo|) +(-719 R |Mod| -3635 -1867 |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"))) ((-4446 . T) (-4452 . T) (-4447 . T) ((-4456 "*") . T) (-4448 . T) (-4449 . T) (-4451 . T)) NIL (-720 R |Rep|) ((|constructor| (NIL "This package \\undocumented")) (|frobenius| (($ $) "\\spad{frobenius(x)} \\undocumented")) (|computePowers| (((|PrimitiveArray| $)) "\\spad{computePowers()} \\undocumented")) (|pow| (((|PrimitiveArray| $)) "\\spad{pow()} \\undocumented")) (|An| (((|Vector| |#1|) $) "\\spad{An(x)} \\undocumented")) (|UnVectorise| (($ (|Vector| |#1|)) "\\spad{UnVectorise(v)} \\undocumented")) (|Vectorise| (((|Vector| |#1|) $) "\\spad{Vectorise(x)} \\undocumented")) (|lift| ((|#2| $) "\\spad{lift(x)} \\undocumented")) (|reduce| (($ |#2|) "\\spad{reduce(x)} \\undocumented")) (|modulus| ((|#2|) "\\spad{modulus()} \\undocumented")) (|setPoly| ((|#2| |#2|) "\\spad{setPoly(x)} \\undocumented"))) (((-4456 "*") |has| |#1| (-174)) (-4447 |has| |#1| (-564)) (-4450 |has| |#1| (-370)) (-4452 |has| |#1| (-6 -4452)) (-4449 . T) (-4448 . T) (-4451 . T)) -((|HasCategory| |#1| (QUOTE (-918))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-174))) (-3783 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564)))) (-12 (|HasCategory| (-1093) (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-386))))) (-12 (|HasCategory| (-1093) (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-572))))) (-12 (|HasCategory| (-1093) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386)))))) (-12 (|HasCategory| (-1093) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572)))))) (-12 (|HasCategory| (-1093) (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544))))) (|HasCategory| |#1| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))) (-3783 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572)))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (-3783 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-918)))) (-3783 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-918)))) (-3783 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-918)))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-1163))) (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#1| (QUOTE (-375))) (|HasCategory| |#1| (QUOTE (-356))) (|HasCategory| |#1| (QUOTE (-237))) (|HasAttribute| |#1| (QUOTE -4452)) (|HasCategory| |#1| (QUOTE (-460))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-918)))) (-3783 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-918)))) (|HasCategory| |#1| (QUOTE (-146))))) +((|HasCategory| |#1| (QUOTE (-918))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-174))) (-2813 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564)))) (-12 (|HasCategory| (-1093) (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-386))))) (-12 (|HasCategory| (-1093) (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-572))))) (-12 (|HasCategory| (-1093) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386)))))) (-12 (|HasCategory| (-1093) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572)))))) (-12 (|HasCategory| (-1093) (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544))))) (|HasCategory| |#1| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))) (-2813 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572)))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (-2813 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-918)))) (-2813 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-918)))) (-2813 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-918)))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-1163))) (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#1| (QUOTE (-375))) (|HasCategory| |#1| (QUOTE (-356))) (|HasCategory| |#1| (QUOTE (-237))) (|HasAttribute| |#1| (QUOTE -4452)) (|HasCategory| |#1| (QUOTE (-460))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-918)))) (-2813 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-918)))) (|HasCategory| |#1| (QUOTE (-146))))) (-721 IS E |ff|) ((|constructor| (NIL "This package \\undocumented")) (|construct| (($ |#1| |#2|) "\\spad{construct(i,e)} \\undocumented")) (|index| ((|#1| $) "\\spad{index(x)} \\undocumented")) (|exponent| ((|#2| $) "\\spad{exponent(x)} \\undocumented"))) NIL @@ -2820,7 +2820,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}."))) ((-4449 |has| |#1| (-174)) (-4448 |has| |#1| (-174)) (-4451 . T)) ((|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148)))) -(-723 R |Mod| -4322 -4086 |exactQuo|) +(-723 R |Mod| -3635 -1867 |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"))) ((-4451 . T)) NIL @@ -2832,7 +2832,7 @@ NIL ((|constructor| (NIL "The category of modules over a commutative ring. \\blankline"))) ((-4449 . T) (-4448 . T)) NIL -(-726 -3636) +(-726 -1384) ((|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]]}."))) ((-4451 . T)) NIL @@ -2868,7 +2868,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 -(-735 -3636 UP) +(-735 -1384 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 @@ -2887,7 +2887,7 @@ NIL (-739 |vl| R) ((|constructor| (NIL "\\indented{2}{This type is the basic representation of sparse recursive multivariate} polynomials whose variables are from a user specified list of symbols. The ordering is specified by the position of the variable in the list. The coefficient ring may be non commutative,{} but the variables are assumed to commute."))) (((-4456 "*") |has| |#2| (-174)) (-4447 |has| |#2| (-564)) (-4452 |has| |#2| (-6 -4452)) (-4449 . T) (-4448 . T) (-4451 . T)) -((|HasCategory| |#2| (QUOTE (-918))) (-3783 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-460))) (|HasCategory| |#2| (QUOTE (-564))) (|HasCategory| |#2| (QUOTE (-918)))) (-3783 (|HasCategory| |#2| (QUOTE (-460))) (|HasCategory| |#2| (QUOTE (-564))) (|HasCategory| |#2| (QUOTE (-918)))) (-3783 (|HasCategory| |#2| (QUOTE (-460))) (|HasCategory| |#2| (QUOTE (-918)))) (|HasCategory| |#2| (QUOTE (-564))) (|HasCategory| |#2| (QUOTE (-174))) (-3783 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-564)))) (-12 (|HasCategory| (-872 |#1|) (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| |#2| (LIST (QUOTE -895) (QUOTE (-386))))) (-12 (|HasCategory| (-872 |#1|) (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -895) (QUOTE (-572))))) (-12 (|HasCategory| (-872 |#1|) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| |#2| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386)))))) (-12 (|HasCategory| (-872 |#1|) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572)))))) (-12 (|HasCategory| (-872 |#1|) (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#2| (LIST (QUOTE -622) (QUOTE (-544))))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (QUOTE (-148))) (|HasCategory| |#2| (QUOTE (-146))) (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572)))) (-3783 (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572)))))) (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-370))) (|HasAttribute| |#2| (QUOTE -4452)) (|HasCategory| |#2| (QUOTE (-460))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#2| (QUOTE (-918)))) (-3783 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#2| (QUOTE (-918)))) (|HasCategory| |#2| (QUOTE (-146))))) +((|HasCategory| |#2| (QUOTE (-918))) (-2813 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-460))) (|HasCategory| |#2| (QUOTE (-564))) (|HasCategory| |#2| (QUOTE (-918)))) (-2813 (|HasCategory| |#2| (QUOTE (-460))) (|HasCategory| |#2| (QUOTE (-564))) (|HasCategory| |#2| (QUOTE (-918)))) (-2813 (|HasCategory| |#2| (QUOTE (-460))) (|HasCategory| |#2| (QUOTE (-918)))) (|HasCategory| |#2| (QUOTE (-564))) (|HasCategory| |#2| (QUOTE (-174))) (-2813 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-564)))) (-12 (|HasCategory| (-872 |#1|) (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| |#2| (LIST (QUOTE -895) (QUOTE (-386))))) (-12 (|HasCategory| (-872 |#1|) (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -895) (QUOTE (-572))))) (-12 (|HasCategory| (-872 |#1|) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| |#2| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386)))))) (-12 (|HasCategory| (-872 |#1|) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572)))))) (-12 (|HasCategory| (-872 |#1|) (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#2| (LIST (QUOTE -622) (QUOTE (-544))))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (QUOTE (-148))) (|HasCategory| |#2| (QUOTE (-146))) (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572)))) (-2813 (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572)))))) (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-370))) (|HasAttribute| |#2| (QUOTE -4452)) (|HasCategory| |#2| (QUOTE (-460))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#2| (QUOTE (-918)))) (-2813 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#2| (QUOTE (-918)))) (|HasCategory| |#2| (QUOTE (-146))))) (-740 E OV R PRF) ((|constructor| (NIL "\\indented{3}{This package exports a factor operation for multivariate polynomials} with coefficients which are rational functions over some ring \\spad{R} over which we can factor. It is used internally by packages such as primary decomposition which need to work with polynomials with rational function coefficients,{} \\spadignore{i.e.} themselves fractions of polynomials.")) (|factor| (((|Factored| |#4|) |#4|) "\\spad{factor(prf)} factors a polynomial with rational function coefficients.")) (|pushuconst| ((|#4| (|Fraction| (|Polynomial| |#3|)) |#2|) "\\spad{pushuconst(r,var)} takes a rational function and raises all occurances of the variable \\spad{var} to the polynomial level.")) (|pushucoef| ((|#4| (|SparseUnivariatePolynomial| (|Polynomial| |#3|)) |#2|) "\\spad{pushucoef(upoly,var)} converts the anonymous univariate polynomial \\spad{upoly} to a polynomial in \\spad{var} over rational functions.")) (|pushup| ((|#4| |#4| |#2|) "\\spad{pushup(prf,var)} raises all occurences of the variable \\spad{var} in the coefficients of the polynomial \\spad{prf} back to the polynomial level.")) (|pushdterm| ((|#4| (|SparseUnivariatePolynomial| |#4|) |#2|) "\\spad{pushdterm(monom,var)} pushes all top level occurences of the variable \\spad{var} into the coefficient domain for the monomial \\spad{monom}.")) (|pushdown| ((|#4| |#4| |#2|) "\\spad{pushdown(prf,var)} pushes all top level occurences of the variable \\spad{var} into the coefficient domain for the polynomial \\spad{prf}.")) (|totalfract| (((|Record| (|:| |sup| (|Polynomial| |#3|)) (|:| |inf| (|Polynomial| |#3|))) |#4|) "\\spad{totalfract(prf)} takes a polynomial whose coefficients are themselves fractions of polynomials and returns a record containing the numerator and denominator resulting from putting \\spad{prf} over a common denominator.")) (|convert| (((|Symbol|) $) "\\spad{convert(x)} converts \\spad{x} to a symbol"))) NIL @@ -3020,11 +3020,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 -(-773 -3636) +(-773 -1384) ((|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 -(-774 P -3636) +(-774 P -1384) ((|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 @@ -3032,7 +3032,7 @@ NIL NIL NIL NIL -(-776 UP -3636) +(-776 UP -1384) ((|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 @@ -3048,7 +3048,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."))) (((-4456 "*") . T)) NIL -(-780 R -3636) +(-780 R -1384) ((|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 @@ -3068,7 +3068,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 -(-785 -3636 |ExtF| |SUEx| |ExtP| |n|) +(-785 -1384 |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 @@ -3083,7 +3083,7 @@ NIL (-788 R |VarSet|) ((|constructor| (NIL "A post-facto extension for \\axiomType{\\spad{SMP}} in order to speed up operations related to pseudo-division and \\spad{gcd}. This domain is based on the \\axiomType{NSUP} constructor which is itself a post-facto extension of the \\axiomType{SUP} constructor."))) (((-4456 "*") |has| |#1| (-174)) (-4447 |has| |#1| (-564)) (-4452 |has| |#1| (-6 -4452)) (-4449 . T) (-4448 . T) (-4451 . T)) -((|HasCategory| |#1| (QUOTE (-918))) (-3783 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-918)))) (-3783 (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-918)))) (-3783 (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-918)))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-174))) (-3783 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| |#2| (LIST (QUOTE -895) (QUOTE (-386))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -895) (QUOTE (-572))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| |#2| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#2| (LIST (QUOTE -622) (QUOTE (-544))))) (|HasCategory| |#1| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))) (-3783 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572)))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -622) (QUOTE (-1188))))) (|HasCategory| |#2| (LIST (QUOTE -622) (QUOTE (-1188)))) (|HasCategory| |#1| (QUOTE (-370))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -622) (QUOTE (-1188))))) (-3783 (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -622) (QUOTE (-1188)))) (-3796 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -622) (QUOTE (-1188)))))) (-3783 (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -622) (QUOTE (-1188)))) (-3796 (|HasCategory| |#1| (QUOTE (-553)))) (-3796 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -622) (QUOTE (-1188)))) (-3796 (|HasCategory| |#1| (LIST (QUOTE -38) (QUOTE (-572))))) (-3796 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -622) (QUOTE (-1188)))) (-3796 (|HasCategory| |#1| (LIST (QUOTE -1003) (QUOTE (-572))))))) (|HasAttribute| |#1| (QUOTE -4452)) (|HasCategory| |#1| (QUOTE (-460))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-918)))) (-3783 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-918)))) (|HasCategory| |#1| (QUOTE (-146))))) +((|HasCategory| |#1| (QUOTE (-918))) (-2813 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-918)))) (-2813 (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-918)))) (-2813 (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-918)))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-174))) (-2813 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| |#2| (LIST (QUOTE -895) (QUOTE (-386))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -895) (QUOTE (-572))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| |#2| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#2| (LIST (QUOTE -622) (QUOTE (-544))))) (|HasCategory| |#1| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))) (-2813 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572)))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -622) (QUOTE (-1188))))) (|HasCategory| |#2| (LIST (QUOTE -622) (QUOTE (-1188)))) (|HasCategory| |#1| (QUOTE (-370))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -622) (QUOTE (-1188))))) (-2813 (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -622) (QUOTE (-1188)))) (-2074 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -622) (QUOTE (-1188)))))) (-2813 (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -622) (QUOTE (-1188)))) (-2074 (|HasCategory| |#1| (QUOTE (-553)))) (-2074 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -622) (QUOTE (-1188)))) (-2074 (|HasCategory| |#1| (LIST (QUOTE -38) (QUOTE (-572))))) (-2074 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -622) (QUOTE (-1188)))) (-2074 (|HasCategory| |#1| (LIST (QUOTE -1003) (QUOTE (-572))))))) (|HasAttribute| |#1| (QUOTE -4452)) (|HasCategory| |#1| (QUOTE (-460))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-918)))) (-2813 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-918)))) (|HasCategory| |#1| (QUOTE (-146))))) (-789 R S) ((|constructor| (NIL "This package lifts a mapping from coefficient rings \\spad{R} to \\spad{S} to a mapping from sparse univariate polynomial over \\spad{R} to a sparse univariate polynomial over \\spad{S}. Note that the mapping is assumed to send zero to zero,{} since it will only be applied to the non-zero coefficients of the polynomial.")) (|map| (((|NewSparseUnivariatePolynomial| |#2|) (|Mapping| |#2| |#1|) (|NewSparseUnivariatePolynomial| |#1|)) "\\axiom{map(func,{} poly)} creates a new polynomial by applying func to every non-zero coefficient of the polynomial poly."))) NIL @@ -3091,7 +3091,7 @@ NIL (-790 R) ((|constructor| (NIL "A post-facto extension for \\axiomType{SUP} in order to speed up operations related to pseudo-division and \\spad{gcd} for both \\axiomType{SUP} and,{} consequently,{} \\axiomType{NSMP}.")) (|halfExtendedResultant2| (((|Record| (|:| |resultant| |#1|) (|:| |coef2| $)) $ $) "\\axiom{halfExtendedResultant2(a,{}\\spad{b})} returns \\axiom{[\\spad{r},{}ca]} such that \\axiom{extendedResultant(a,{}\\spad{b})} returns \\axiom{[\\spad{r},{}ca,{} \\spad{cb}]}")) (|halfExtendedResultant1| (((|Record| (|:| |resultant| |#1|) (|:| |coef1| $)) $ $) "\\axiom{halfExtendedResultant1(a,{}\\spad{b})} returns \\axiom{[\\spad{r},{}ca]} such that \\axiom{extendedResultant(a,{}\\spad{b})} returns \\axiom{[\\spad{r},{}ca,{} \\spad{cb}]}")) (|extendedResultant| (((|Record| (|:| |resultant| |#1|) (|:| |coef1| $) (|:| |coef2| $)) $ $) "\\axiom{extendedResultant(a,{}\\spad{b})} returns \\axiom{[\\spad{r},{}ca,{}\\spad{cb}]} such that \\axiom{\\spad{r}} is the resultant of \\axiom{a} and \\axiom{\\spad{b}} and \\axiom{\\spad{r} = ca * a + \\spad{cb} * \\spad{b}}")) (|halfExtendedSubResultantGcd2| (((|Record| (|:| |gcd| $) (|:| |coef2| $)) $ $) "\\axiom{halfExtendedSubResultantGcd2(a,{}\\spad{b})} returns \\axiom{[\\spad{g},{}\\spad{cb}]} such that \\axiom{extendedSubResultantGcd(a,{}\\spad{b})} returns \\axiom{[\\spad{g},{}ca,{} \\spad{cb}]}")) (|halfExtendedSubResultantGcd1| (((|Record| (|:| |gcd| $) (|:| |coef1| $)) $ $) "\\axiom{halfExtendedSubResultantGcd1(a,{}\\spad{b})} returns \\axiom{[\\spad{g},{}ca]} such that \\axiom{extendedSubResultantGcd(a,{}\\spad{b})} returns \\axiom{[\\spad{g},{}ca,{} \\spad{cb}]}")) (|extendedSubResultantGcd| (((|Record| (|:| |gcd| $) (|:| |coef1| $) (|:| |coef2| $)) $ $) "\\axiom{extendedSubResultantGcd(a,{}\\spad{b})} returns \\axiom{[\\spad{g},{}ca,{} \\spad{cb}]} such that \\axiom{\\spad{g}} is a \\spad{gcd} of \\axiom{a} and \\axiom{\\spad{b}} in \\axiom{\\spad{R^}(\\spad{-1}) \\spad{P}} and \\axiom{\\spad{g} = ca * a + \\spad{cb} * \\spad{b}}")) (|lastSubResultant| (($ $ $) "\\axiom{lastSubResultant(a,{}\\spad{b})} returns \\axiom{resultant(a,{}\\spad{b})} if \\axiom{a} and \\axiom{\\spad{b}} has no non-trivial \\spad{gcd} in \\axiom{\\spad{R^}(\\spad{-1}) \\spad{P}} otherwise the non-zero sub-resultant with smallest index.")) (|subResultantsChain| (((|List| $) $ $) "\\axiom{subResultantsChain(a,{}\\spad{b})} returns the list of the non-zero sub-resultants of \\axiom{a} and \\axiom{\\spad{b}} sorted by increasing degree.")) (|lazyPseudoQuotient| (($ $ $) "\\axiom{lazyPseudoQuotient(a,{}\\spad{b})} returns \\axiom{\\spad{q}} if \\axiom{lazyPseudoDivide(a,{}\\spad{b})} returns \\axiom{[\\spad{c},{}\\spad{g},{}\\spad{q},{}\\spad{r}]}")) (|lazyPseudoDivide| (((|Record| (|:| |coef| |#1|) (|:| |gap| (|NonNegativeInteger|)) (|:| |quotient| $) (|:| |remainder| $)) $ $) "\\axiom{lazyPseudoDivide(a,{}\\spad{b})} returns \\axiom{[\\spad{c},{}\\spad{g},{}\\spad{q},{}\\spad{r}]} such that \\axiom{\\spad{c^n} * a = \\spad{q*b} \\spad{+r}} and \\axiom{lazyResidueClass(a,{}\\spad{b})} returns \\axiom{[\\spad{r},{}\\spad{c},{}\\spad{n}]} where \\axiom{\\spad{n} + \\spad{g} = max(0,{} degree(\\spad{b}) - degree(a) + 1)}.")) (|lazyPseudoRemainder| (($ $ $) "\\axiom{lazyPseudoRemainder(a,{}\\spad{b})} returns \\axiom{\\spad{r}} if \\axiom{lazyResidueClass(a,{}\\spad{b})} returns \\axiom{[\\spad{r},{}\\spad{c},{}\\spad{n}]}. This lazy pseudo-remainder is computed by means of the \\axiomOpFrom{fmecg}{NewSparseUnivariatePolynomial} operation.")) (|lazyResidueClass| (((|Record| (|:| |polnum| $) (|:| |polden| |#1|) (|:| |power| (|NonNegativeInteger|))) $ $) "\\axiom{lazyResidueClass(a,{}\\spad{b})} returns \\axiom{[\\spad{r},{}\\spad{c},{}\\spad{n}]} such that \\axiom{\\spad{r}} is reduced \\spad{w}.\\spad{r}.\\spad{t}. \\axiom{\\spad{b}} and \\axiom{\\spad{b}} divides \\axiom{\\spad{c^n} * a - \\spad{r}} where \\axiom{\\spad{c}} is \\axiom{leadingCoefficient(\\spad{b})} and \\axiom{\\spad{n}} is as small as possible with the previous properties.")) (|monicModulo| (($ $ $) "\\axiom{monicModulo(a,{}\\spad{b})} returns \\axiom{\\spad{r}} such that \\axiom{\\spad{r}} is reduced \\spad{w}.\\spad{r}.\\spad{t}. \\axiom{\\spad{b}} and \\axiom{\\spad{b}} divides \\axiom{a \\spad{-r}} where \\axiom{\\spad{b}} is monic.")) (|fmecg| (($ $ (|NonNegativeInteger|) |#1| $) "\\axiom{fmecg(\\spad{p1},{}\\spad{e},{}\\spad{r},{}\\spad{p2})} returns \\axiom{\\spad{p1} - \\spad{r} * X**e * \\spad{p2}} where \\axiom{\\spad{X}} is \\axiom{monomial(1,{}1)}"))) (((-4456 "*") |has| |#1| (-174)) (-4447 |has| |#1| (-564)) (-4450 |has| |#1| (-370)) (-4452 |has| |#1| (-6 -4452)) (-4449 . T) (-4448 . T) (-4451 . T)) -((|HasCategory| |#1| (QUOTE (-918))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-174))) (-3783 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564)))) (-12 (|HasCategory| (-1093) (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-386))))) (-12 (|HasCategory| (-1093) (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-572))))) (-12 (|HasCategory| (-1093) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386)))))) (-12 (|HasCategory| (-1093) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572)))))) (-12 (|HasCategory| (-1093) (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544))))) (|HasCategory| |#1| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))) (-3783 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572)))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (-3783 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-918)))) (-3783 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-918)))) (-3783 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-918)))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-1163))) (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#1| (QUOTE (-237))) (|HasAttribute| |#1| (QUOTE -4452)) (|HasCategory| |#1| (QUOTE (-460))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-918)))) (-3783 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-918)))) (|HasCategory| |#1| (QUOTE (-146))))) +((|HasCategory| |#1| (QUOTE (-918))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-174))) (-2813 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564)))) (-12 (|HasCategory| (-1093) (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-386))))) (-12 (|HasCategory| (-1093) (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-572))))) (-12 (|HasCategory| (-1093) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386)))))) (-12 (|HasCategory| (-1093) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572)))))) (-12 (|HasCategory| (-1093) (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544))))) (|HasCategory| |#1| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))) (-2813 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572)))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (-2813 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-918)))) (-2813 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-918)))) (-2813 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-918)))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-1163))) (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#1| (QUOTE (-237))) (|HasAttribute| |#1| (QUOTE -4452)) (|HasCategory| |#1| (QUOTE (-460))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-918)))) (-2813 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-918)))) (|HasCategory| |#1| (QUOTE (-146))))) (-791 R) ((|constructor| (NIL "This package provides polynomials as functions on a ring.")) (|eulerE| ((|#1| (|NonNegativeInteger|) |#1|) "\\spad{eulerE(n,r)} \\undocumented")) (|bernoulliB| ((|#1| (|NonNegativeInteger|) |#1|) "\\spad{bernoulliB(n,r)} \\undocumented")) (|cyclotomic| ((|#1| (|NonNegativeInteger|) |#1|) "\\spad{cyclotomic(n,r)} \\undocumented"))) NIL @@ -3152,23 +3152,23 @@ NIL ((|constructor| (NIL "OctonionCategory gives the categorial frame for the octonions,{} and eight-dimensional non-associative algebra,{} doubling the the quaternions in the same way as doubling the Complex numbers to get the quaternions.")) (|inv| (($ $) "\\spad{inv(o)} returns the inverse of \\spad{o} if it exists.")) (|rationalIfCan| (((|Union| (|Fraction| (|Integer|)) "failed") $) "\\spad{rationalIfCan(o)} returns the real part if all seven imaginary parts are 0,{} and \"failed\" otherwise.")) (|rational| (((|Fraction| (|Integer|)) $) "\\spad{rational(o)} returns the real part if all seven imaginary parts are 0. Error: if \\spad{o} is not rational.")) (|rational?| (((|Boolean|) $) "\\spad{rational?(o)} tests if \\spad{o} is rational,{} \\spadignore{i.e.} that all seven imaginary parts are 0.")) (|abs| ((|#1| $) "\\spad{abs(o)} computes the absolute value of an octonion,{} equal to the square root of the \\spadfunFrom{norm}{Octonion}.")) (|octon| (($ |#1| |#1| |#1| |#1| |#1| |#1| |#1| |#1|) "\\spad{octon(re,ri,rj,rk,rE,rI,rJ,rK)} constructs an octonion from scalars.")) (|norm| ((|#1| $) "\\spad{norm(o)} returns the norm of an octonion,{} equal to the sum of the squares of its coefficients.")) (|imagK| ((|#1| $) "\\spad{imagK(o)} extracts the imaginary \\spad{K} part of octonion \\spad{o}.")) (|imagJ| ((|#1| $) "\\spad{imagJ(o)} extracts the imaginary \\spad{J} part of octonion \\spad{o}.")) (|imagI| ((|#1| $) "\\spad{imagI(o)} extracts the imaginary \\spad{I} part of octonion \\spad{o}.")) (|imagE| ((|#1| $) "\\spad{imagE(o)} extracts the imaginary \\spad{E} part of octonion \\spad{o}.")) (|imagk| ((|#1| $) "\\spad{imagk(o)} extracts the \\spad{k} part of octonion \\spad{o}.")) (|imagj| ((|#1| $) "\\spad{imagj(o)} extracts the \\spad{j} part of octonion \\spad{o}.")) (|imagi| ((|#1| $) "\\spad{imagi(o)} extracts the \\spad{i} part of octonion \\spad{o}.")) (|real| ((|#1| $) "\\spad{real(o)} extracts real part of octonion \\spad{o}.")) (|conjugate| (($ $) "\\spad{conjugate(o)} negates the imaginary parts \\spad{i},{}\\spad{j},{}\\spad{k},{}\\spad{E},{}\\spad{I},{}\\spad{J},{}\\spad{K} of octonian \\spad{o}."))) ((-4448 . T) (-4449 . T) (-4451 . T)) NIL -(-806 -3783 R OS S) +(-806 -2813 R OS S) ((|constructor| (NIL "OctonionCategoryFunctions2 implements functions between two octonion domains defined over different rings. The function map is used to coerce between octonion types.")) (|map| ((|#3| (|Mapping| |#4| |#2|) |#1|) "\\spad{map(f,u)} maps \\spad{f} onto the component parts of the octonion \\spad{u}."))) NIL NIL (-807 R) ((|constructor| (NIL "Octonion implements octonions (Cayley-Dixon algebra) over a commutative ring,{} an eight-dimensional non-associative algebra,{} doubling the quaternions in the same way as doubling the complex numbers to get the quaternions the main constructor function is {\\em octon} which takes 8 arguments: the real part,{} the \\spad{i} imaginary part,{} the \\spad{j} imaginary part,{} the \\spad{k} imaginary part,{} (as with quaternions) and in addition the imaginary parts \\spad{E},{} \\spad{I},{} \\spad{J},{} \\spad{K}.")) (|octon| (($ (|Quaternion| |#1|) (|Quaternion| |#1|)) "\\spad{octon(qe,qE)} constructs an octonion from two quaternions using the relation {\\em O = Q + QE}."))) ((-4448 . T) (-4449 . T) (-4451 . T)) -((|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-375))) (|HasCategory| |#1| (LIST (QUOTE -522) (QUOTE (-1188)) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -292) (|devaluate| |#1|) (|devaluate| |#1|))) (-3783 (|HasCategory| (-1010 |#1|) (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572)))))) (-3783 (|HasCategory| (-1010 |#1|) (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-1071))) (|HasCategory| |#1| (QUOTE (-553))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| (-1010 |#1|) (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| (-1010 |#1|) (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572))))) +((|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-375))) (|HasCategory| |#1| (LIST (QUOTE -522) (QUOTE (-1188)) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -292) (|devaluate| |#1|) (|devaluate| |#1|))) (-2813 (|HasCategory| (-1010 |#1|) (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572)))))) (-2813 (|HasCategory| (-1010 |#1|) (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-1071))) (|HasCategory| |#1| (QUOTE (-553))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| (-1010 |#1|) (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| (-1010 |#1|) (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572))))) (-808) ((|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 -(-809 R -3636 L) +(-809 R -1384 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 -(-810 R -3636) +(-810 R -1384) ((|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 @@ -3176,7 +3176,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 -(-812 R -3636) +(-812 R -1384) ((|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 @@ -3184,11 +3184,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 -(-814 -3636 UP UPUP R) +(-814 -1384 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 -(-815 -3636 UP L LQ) +(-815 -1384 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 @@ -3196,38 +3196,38 @@ 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 -(-817 -3636 UP L LQ) +(-817 -1384 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 -(-818 -3636 UP) +(-818 -1384 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 -(-819 -3636 L UP A LO) +(-819 -1384 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 -(-820 -3636 UP) +(-820 -1384 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)))) -(-821 -3636 LO) +(-821 -1384 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 -(-822 -3636 LODO) +(-822 -1384 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 -(-823 -3436 S |f|) +(-823 -4131 S |f|) ((|constructor| (NIL "\\indented{2}{This type represents the finite direct or cartesian product of an} underlying ordered component type. The ordering on the type is determined by its third argument which represents the less than function on vectors. This type is a suitable third argument for \\spadtype{GeneralDistributedMultivariatePolynomial}."))) ((-4448 |has| |#2| (-1060)) (-4449 |has| |#2| (-1060)) (-4451 |has| |#2| (-6 -4451)) ((-4456 "*") |has| |#2| (-174)) (-4454 . T)) -((-3783 (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-132))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-375))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-734))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-801))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-856))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))))) (-3783 (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-1111)))) (-12 (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (QUOTE (-1060)))) (-12 (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188))))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#2| (QUOTE (-370))) (-3783 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-1060)))) (-3783 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-370)))) (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-801))) (-3783 (|HasCategory| |#2| (QUOTE (-801))) (|HasCategory| |#2| (QUOTE (-856)))) (|HasCategory| |#2| (QUOTE (-856))) (|HasCategory| |#2| (QUOTE (-734))) (-3783 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-1060)))) (|HasCategory| |#2| (QUOTE (-375))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (-3783 (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-132))) (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-1060)))) (-3783 (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (QUOTE (-132))) (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-1060)))) (-3783 (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-1060)))) (-3783 (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (QUOTE (-1060)))) (|HasCategory| |#2| (QUOTE (-237))) (-3783 (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-132))) (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-375))) (|HasCategory| |#2| (QUOTE (-734))) (|HasCategory| |#2| (QUOTE (-801))) (|HasCategory| |#2| (QUOTE (-856))) (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (QUOTE (-1111)))) (|HasCategory| |#2| (QUOTE (-1111))) (-3783 (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-25)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-132)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-174)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-237)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-370)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-375)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-734)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-801)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-856)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-1060)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-1111))))) (-3783 (-12 (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-132))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-375))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-734))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-801))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-856))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-1060))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572)))))) (-3783 (-12 (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-132))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-375))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-734))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-801))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-856))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572)))))) (|HasCategory| (-572) (QUOTE (-858))) (-12 (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (QUOTE (-1060)))) (-12 (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188))))) (-3783 (|HasCategory| |#2| (QUOTE (-1060))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572)))))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-1111)))) (|HasAttribute| |#2| (QUOTE -4451)) (|HasCategory| |#2| (QUOTE (-132))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|))))) +((-2813 (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-132))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-375))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-734))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-801))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-856))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))))) (-2813 (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-1111)))) (-12 (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (QUOTE (-1060)))) (-12 (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188))))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#2| (QUOTE (-370))) (-2813 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-1060)))) (-2813 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-370)))) (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-801))) (-2813 (|HasCategory| |#2| (QUOTE (-801))) (|HasCategory| |#2| (QUOTE (-856)))) (|HasCategory| |#2| (QUOTE (-856))) (|HasCategory| |#2| (QUOTE (-734))) (-2813 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-1060)))) (|HasCategory| |#2| (QUOTE (-375))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (-2813 (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-132))) (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-1060)))) (-2813 (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (QUOTE (-132))) (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-1060)))) (-2813 (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-1060)))) (-2813 (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (QUOTE (-1060)))) (|HasCategory| |#2| (QUOTE (-237))) (-2813 (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-132))) (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-375))) (|HasCategory| |#2| (QUOTE (-734))) (|HasCategory| |#2| (QUOTE (-801))) (|HasCategory| |#2| (QUOTE (-856))) (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (QUOTE (-1111)))) (|HasCategory| |#2| (QUOTE (-1111))) (-2813 (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-25)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-132)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-174)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-237)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-370)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-375)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-734)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-801)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-856)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-1060)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-1111))))) (-2813 (-12 (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-132))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-375))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-734))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-801))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-856))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-1060))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572)))))) (-2813 (-12 (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-132))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-375))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-734))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-801))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-856))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572)))))) (|HasCategory| (-572) (QUOTE (-858))) (-12 (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (QUOTE (-1060)))) (-12 (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188))))) (-2813 (|HasCategory| |#2| (QUOTE (-1060))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572)))))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-1111)))) (|HasAttribute| |#2| (QUOTE -4451)) (|HasCategory| |#2| (QUOTE (-132))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|))))) (-824 R) ((|constructor| (NIL "\\spadtype{OrderlyDifferentialPolynomial} implements an ordinary differential polynomial ring in arbitrary number of differential indeterminates,{} with coefficients in a ring. The ranking on the differential indeterminate is orderly. This is analogous to the domain \\spadtype{Polynomial}. \\blankline"))) (((-4456 "*") |has| |#1| (-174)) (-4447 |has| |#1| (-564)) (-4452 |has| |#1| (-6 -4452)) (-4449 . T) (-4448 . T) (-4451 . T)) -((|HasCategory| |#1| (QUOTE (-918))) (-3783 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-918)))) (-3783 (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-918)))) (-3783 (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-918)))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-174))) (-3783 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564)))) (-12 (|HasCategory| (-826 (-1188)) (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-386))))) (-12 (|HasCategory| (-826 (-1188)) (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-572))))) (-12 (|HasCategory| (-826 (-1188)) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386)))))) (-12 (|HasCategory| (-826 (-1188)) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572)))))) (-12 (|HasCategory| (-826 (-1188)) (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544))))) (|HasCategory| |#1| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))) (-3783 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572)))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-237))) (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#1| (QUOTE (-370))) (|HasAttribute| |#1| (QUOTE -4452)) (|HasCategory| |#1| (QUOTE (-460))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-918)))) (-3783 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-918)))) (|HasCategory| |#1| (QUOTE (-146))))) +((|HasCategory| |#1| (QUOTE (-918))) (-2813 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-918)))) (-2813 (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-918)))) (-2813 (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-918)))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-174))) (-2813 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564)))) (-12 (|HasCategory| (-826 (-1188)) (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-386))))) (-12 (|HasCategory| (-826 (-1188)) (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-572))))) (-12 (|HasCategory| (-826 (-1188)) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386)))))) (-12 (|HasCategory| (-826 (-1188)) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572)))))) (-12 (|HasCategory| (-826 (-1188)) (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544))))) (|HasCategory| |#1| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))) (-2813 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572)))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-237))) (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#1| (QUOTE (-370))) (|HasAttribute| |#1| (QUOTE -4452)) (|HasCategory| |#1| (QUOTE (-460))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-918)))) (-2813 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-918)))) (|HasCategory| |#1| (QUOTE (-146))))) (-825 |Kernels| R |var|) ((|constructor| (NIL "This constructor produces an ordinary differential ring from a partial differential ring by specifying a variable."))) (((-4456 "*") |has| |#2| (-370)) (-4447 |has| |#2| (-370)) (-4452 |has| |#2| (-370)) (-4446 |has| |#2| (-370)) (-4451 . T) (-4449 . T) (-4448 . T)) @@ -3271,7 +3271,7 @@ NIL (-835 P R) ((|constructor| (NIL "This constructor creates the \\spadtype{MonogenicLinearOperator} domain which is ``opposite\\spad{''} in the ring sense to \\spad{P}. That is,{} as sets \\spad{P = \\$} but \\spad{a * b} in \\spad{\\$} is equal to \\spad{b * a} in \\spad{P}.")) (|po| ((|#1| $) "\\spad{po(q)} creates a value in \\spad{P} equal to \\spad{q} in \\$.")) (|op| (($ |#1|) "\\spad{op(p)} creates a value in \\$ equal to \\spad{p} in \\spad{P}."))) ((-4448 . T) (-4449 . T) (-4451 . T)) -((|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#1| (LIST (QUOTE -235) (|devaluate| |#1|)))) +((|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-237)))) (-836) ((|constructor| (NIL "\\spadtype{OpenMath} provides operations for exporting an object in OpenMath format.")) (|OMwrite| (((|Void|) (|OpenMathDevice|) $ (|Boolean|)) "\\spad{OMwrite(dev, u, true)} writes the OpenMath form of \\axiom{\\spad{u}} to the OpenMath device \\axiom{\\spad{dev}} as a complete OpenMath object; OMwrite(\\spad{dev},{} \\spad{u},{} \\spad{false}) writes the object as an OpenMath fragment.") (((|Void|) (|OpenMathDevice|) $) "\\spad{OMwrite(dev, u)} writes the OpenMath form of \\axiom{\\spad{u}} to the OpenMath device \\axiom{\\spad{dev}} as a complete OpenMath object.") (((|String|) $ (|Boolean|)) "\\spad{OMwrite(u, true)} returns the OpenMath \\spad{XML} encoding of \\axiom{\\spad{u}} as a complete OpenMath object; OMwrite(\\spad{u},{} \\spad{false}) returns the OpenMath \\spad{XML} encoding of \\axiom{\\spad{u}} as an OpenMath fragment.") (((|String|) $) "\\spad{OMwrite(u)} returns the OpenMath \\spad{XML} encoding of \\axiom{\\spad{u}} as a complete OpenMath object."))) NIL @@ -3295,7 +3295,7 @@ NIL (-841 R) ((|constructor| (NIL "Adjunction of a complex infinity to a set. Date Created: 4 Oct 1989 Date Last Updated: 1 Nov 1989")) (|rationalIfCan| (((|Union| (|Fraction| (|Integer|)) "failed") $) "\\spad{rationalIfCan(x)} returns \\spad{x} as a finite rational number if it is one,{} \"failed\" otherwise.")) (|rational| (((|Fraction| (|Integer|)) $) "\\spad{rational(x)} returns \\spad{x} as a finite rational number. Error: if \\spad{x} is not a rational number.")) (|rational?| (((|Boolean|) $) "\\spad{rational?(x)} tests if \\spad{x} is a finite rational number.")) (|infinite?| (((|Boolean|) $) "\\spad{infinite?(x)} tests if \\spad{x} is infinite.")) (|finite?| (((|Boolean|) $) "\\spad{finite?(x)} tests if \\spad{x} is finite.")) (|infinity| (($) "\\spad{infinity()} returns infinity."))) ((-4451 |has| |#1| (-856))) -((|HasCategory| |#1| (QUOTE (-856))) (|HasCategory| |#1| (QUOTE (-21))) (-3783 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-856)))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (-3783 (|HasCategory| |#1| (QUOTE (-856))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-553)))) +((|HasCategory| |#1| (QUOTE (-856))) (|HasCategory| |#1| (QUOTE (-21))) (-2813 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-856)))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (-2813 (|HasCategory| |#1| (QUOTE (-856))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-553)))) (-842 A S) ((|constructor| (NIL "This category specifies the interface for operators used to build terms,{} in the sense of Universal Algebra. The domain parameter \\spad{S} provides representation for the `external name' of an operator.")) (|is?| (((|Boolean|) $ |#2|) "\\spad{is?(op,n)} holds if the name of the operator \\spad{op} is \\spad{n}.")) (|arity| (((|Arity|) $) "\\spad{arity(op)} returns the arity of the operator \\spad{op}.")) (|name| ((|#2| $) "\\spad{name(op)} returns the externam name of \\spad{op}."))) NIL @@ -3335,12 +3335,12 @@ NIL (-851 R) ((|constructor| (NIL "Adjunction of two real infinites quantities to a set. Date Created: 4 Oct 1989 Date Last Updated: 1 Nov 1989")) (|rationalIfCan| (((|Union| (|Fraction| (|Integer|)) "failed") $) "\\spad{rationalIfCan(x)} returns \\spad{x} as a finite rational number if it is one and \"failed\" otherwise.")) (|rational| (((|Fraction| (|Integer|)) $) "\\spad{rational(x)} returns \\spad{x} as a finite rational number. Error: if \\spad{x} cannot be so converted.")) (|rational?| (((|Boolean|) $) "\\spad{rational?(x)} tests if \\spad{x} is a finite rational number.")) (|whatInfinity| (((|SingleInteger|) $) "\\spad{whatInfinity(x)} returns 0 if \\spad{x} is finite,{} 1 if \\spad{x} is +infinity,{} and \\spad{-1} if \\spad{x} is -infinity.")) (|infinite?| (((|Boolean|) $) "\\spad{infinite?(x)} tests if \\spad{x} is +infinity or -infinity,{}")) (|finite?| (((|Boolean|) $) "\\spad{finite?(x)} tests if \\spad{x} is finite.")) (|minusInfinity| (($) "\\spad{minusInfinity()} returns -infinity.")) (|plusInfinity| (($) "\\spad{plusInfinity()} returns +infinity."))) ((-4451 |has| |#1| (-856))) -((|HasCategory| |#1| (QUOTE (-856))) (|HasCategory| |#1| (QUOTE (-21))) (-3783 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-856)))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (-3783 (|HasCategory| |#1| (QUOTE (-856))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-553)))) +((|HasCategory| |#1| (QUOTE (-856))) (|HasCategory| |#1| (QUOTE (-21))) (-2813 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-856)))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (-2813 (|HasCategory| |#1| (QUOTE (-856))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-553)))) (-852) ((|constructor| (NIL "Ordered finite sets.")) (|max| (($) "\\spad{max} is the maximum value of \\%.")) (|min| (($) "\\spad{min} is the minimum value of \\%."))) NIL NIL -(-853 -3436 S) +(-853 -4131 S) ((|constructor| (NIL "\\indented{3}{This package provides ordering functions on vectors which} are suitable parameters for OrderedDirectProduct.")) (|reverseLex| (((|Boolean|) (|Vector| |#2|) (|Vector| |#2|)) "\\spad{reverseLex(v1,v2)} return \\spad{true} if the vector \\spad{v1} is less than the vector \\spad{v2} in the ordering which is total degree refined by the reverse lexicographic ordering.")) (|totalLex| (((|Boolean|) (|Vector| |#2|) (|Vector| |#2|)) "\\spad{totalLex(v1,v2)} return \\spad{true} if the vector \\spad{v1} is less than the vector \\spad{v2} in the ordering which is total degree refined by lexicographic ordering.")) (|pureLex| (((|Boolean|) (|Vector| |#2|) (|Vector| |#2|)) "\\spad{pureLex(v1,v2)} return \\spad{true} if the vector \\spad{v1} is less than the vector \\spad{v2} in the lexicographic ordering."))) NIL NIL @@ -3376,11 +3376,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 (-370))) (|HasCategory| |#1| (QUOTE (-564)))) -(-862 R |sigma| -4198) +(-862 R |sigma| -2073) ((|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."))) ((-4448 . T) (-4449 . T) (-4451 . T)) ((|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-370)))) -(-863 |x| R |sigma| -4198) +(-863 |x| R |sigma| -2073) ((|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}."))) ((-4448 . T) (-4449 . T) (-4451 . T)) ((|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| |#2| (QUOTE (-564))) (|HasCategory| |#2| (QUOTE (-460))) (|HasCategory| |#2| (QUOTE (-370)))) @@ -3447,15 +3447,15 @@ NIL (-879 |p|) ((|constructor| (NIL "Stream-based implementation of \\spad{Qp:} numbers are represented as sum(\\spad{i} = \\spad{k}..,{} a[\\spad{i}] * p^i) where the a[\\spad{i}] lie in 0,{}1,{}...,{}(\\spad{p} - 1)."))) ((-4446 . T) (-4452 . T) (-4447 . T) ((-4456 "*") . T) (-4448 . T) (-4449 . T) (-4451 . T)) -((|HasCategory| (-878 |#1|) (QUOTE (-918))) (|HasCategory| (-878 |#1|) (LIST (QUOTE -1049) (QUOTE (-1188)))) (|HasCategory| (-878 |#1|) (QUOTE (-146))) (|HasCategory| (-878 |#1|) (QUOTE (-148))) (|HasCategory| (-878 |#1|) (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| (-878 |#1|) (QUOTE (-1033))) (|HasCategory| (-878 |#1|) (QUOTE (-828))) (-3783 (|HasCategory| (-878 |#1|) (QUOTE (-828))) (|HasCategory| (-878 |#1|) (QUOTE (-858)))) (|HasCategory| (-878 |#1|) (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| (-878 |#1|) (QUOTE (-1163))) (|HasCategory| (-878 |#1|) (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| (-878 |#1|) (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| (-878 |#1|) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| (-878 |#1|) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| (-878 |#1|) (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| (-878 |#1|) (QUOTE (-237))) (|HasCategory| (-878 |#1|) (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| (-878 |#1|) (LIST (QUOTE -522) (QUOTE (-1188)) (LIST (QUOTE -878) (|devaluate| |#1|)))) (|HasCategory| (-878 |#1|) (LIST (QUOTE -315) (LIST (QUOTE -878) (|devaluate| |#1|)))) (|HasCategory| (-878 |#1|) (LIST (QUOTE -292) (LIST (QUOTE -878) (|devaluate| |#1|)) (LIST (QUOTE -878) (|devaluate| |#1|)))) (|HasCategory| (-878 |#1|) (QUOTE (-313))) (|HasCategory| (-878 |#1|) (QUOTE (-553))) (|HasCategory| (-878 |#1|) (QUOTE (-858))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| (-878 |#1|) (QUOTE (-918)))) (-3783 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| (-878 |#1|) (QUOTE (-918)))) (|HasCategory| (-878 |#1|) (QUOTE (-146))))) +((|HasCategory| (-878 |#1|) (QUOTE (-918))) (|HasCategory| (-878 |#1|) (LIST (QUOTE -1049) (QUOTE (-1188)))) (|HasCategory| (-878 |#1|) (QUOTE (-146))) (|HasCategory| (-878 |#1|) (QUOTE (-148))) (|HasCategory| (-878 |#1|) (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| (-878 |#1|) (QUOTE (-1033))) (|HasCategory| (-878 |#1|) (QUOTE (-828))) (-2813 (|HasCategory| (-878 |#1|) (QUOTE (-828))) (|HasCategory| (-878 |#1|) (QUOTE (-858)))) (|HasCategory| (-878 |#1|) (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| (-878 |#1|) (QUOTE (-1163))) (|HasCategory| (-878 |#1|) (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| (-878 |#1|) (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| (-878 |#1|) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| (-878 |#1|) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| (-878 |#1|) (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| (-878 |#1|) (QUOTE (-237))) (|HasCategory| (-878 |#1|) (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| (-878 |#1|) (LIST (QUOTE -522) (QUOTE (-1188)) (LIST (QUOTE -878) (|devaluate| |#1|)))) (|HasCategory| (-878 |#1|) (LIST (QUOTE -315) (LIST (QUOTE -878) (|devaluate| |#1|)))) (|HasCategory| (-878 |#1|) (LIST (QUOTE -292) (LIST (QUOTE -878) (|devaluate| |#1|)) (LIST (QUOTE -878) (|devaluate| |#1|)))) (|HasCategory| (-878 |#1|) (QUOTE (-313))) (|HasCategory| (-878 |#1|) (QUOTE (-553))) (|HasCategory| (-878 |#1|) (QUOTE (-858))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| (-878 |#1|) (QUOTE (-918)))) (-2813 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| (-878 |#1|) (QUOTE (-918)))) (|HasCategory| (-878 |#1|) (QUOTE (-146))))) (-880 |p| PADIC) ((|constructor| (NIL "This is the category of stream-based representations of \\spad{Qp}.")) (|removeZeroes| (($ (|Integer|) $) "\\spad{removeZeroes(n,x)} removes up to \\spad{n} leading zeroes from the \\spad{p}-adic rational \\spad{x}.") (($ $) "\\spad{removeZeroes(x)} removes leading zeroes from the representation of the \\spad{p}-adic rational \\spad{x}. A \\spad{p}-adic rational is represented by (1) an exponent and (2) a \\spad{p}-adic integer which may have leading zero digits. When the \\spad{p}-adic integer has a leading zero digit,{} a 'leading zero' is removed from the \\spad{p}-adic rational as follows: the number is rewritten by increasing the exponent by 1 and dividing the \\spad{p}-adic integer by \\spad{p}. Note: \\spad{removeZeroes(f)} removes all leading zeroes from \\spad{f}.")) (|continuedFraction| (((|ContinuedFraction| (|Fraction| (|Integer|))) $) "\\spad{continuedFraction(x)} converts the \\spad{p}-adic rational number \\spad{x} to a continued fraction.")) (|approximate| (((|Fraction| (|Integer|)) $ (|Integer|)) "\\spad{approximate(x,n)} returns a rational number \\spad{y} such that \\spad{y = x (mod p^n)}."))) ((-4446 . T) (-4452 . T) (-4447 . T) ((-4456 "*") . T) (-4448 . T) (-4449 . T) (-4451 . T)) -((|HasCategory| |#2| (QUOTE (-918))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-1188)))) (|HasCategory| |#2| (QUOTE (-146))) (|HasCategory| |#2| (QUOTE (-148))) (|HasCategory| |#2| (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#2| (QUOTE (-1033))) (|HasCategory| |#2| (QUOTE (-828))) (-3783 (|HasCategory| |#2| (QUOTE (-828))) (|HasCategory| |#2| (QUOTE (-858)))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| |#2| (QUOTE (-1163))) (|HasCategory| |#2| (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| |#2| (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| |#2| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (LIST (QUOTE -522) (QUOTE (-1188)) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -292) (|devaluate| |#2|) (|devaluate| |#2|))) (|HasCategory| |#2| (QUOTE (-313))) (|HasCategory| |#2| (QUOTE (-553))) (|HasCategory| |#2| (QUOTE (-858))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#2| (QUOTE (-918)))) (-3783 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#2| (QUOTE (-918)))) (|HasCategory| |#2| (QUOTE (-146))))) +((|HasCategory| |#2| (QUOTE (-918))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-1188)))) (|HasCategory| |#2| (QUOTE (-146))) (|HasCategory| |#2| (QUOTE (-148))) (|HasCategory| |#2| (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#2| (QUOTE (-1033))) (|HasCategory| |#2| (QUOTE (-828))) (-2813 (|HasCategory| |#2| (QUOTE (-828))) (|HasCategory| |#2| (QUOTE (-858)))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| |#2| (QUOTE (-1163))) (|HasCategory| |#2| (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| |#2| (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| |#2| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (LIST (QUOTE -522) (QUOTE (-1188)) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -292) (|devaluate| |#2|) (|devaluate| |#2|))) (|HasCategory| |#2| (QUOTE (-313))) (|HasCategory| |#2| (QUOTE (-553))) (|HasCategory| |#2| (QUOTE (-858))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#2| (QUOTE (-918)))) (-2813 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#2| (QUOTE (-918)))) (|HasCategory| |#2| (QUOTE (-146))))) (-881 S T$) ((|constructor| (NIL "\\indented{1}{This domain provides a very simple representation} of the notion of `pair of objects'. It does not try to achieve all possible imaginable things.")) (|second| ((|#2| $) "\\spad{second(p)} extracts the second components of \\spad{`p'}.")) (|first| ((|#1| $) "\\spad{first(p)} extracts the first component of \\spad{`p'}.")) (|construct| (($ |#1| |#2|) "\\spad{construct(s,t)} is same as pair(\\spad{s},{}\\spad{t}),{} with syntactic sugar.")) (|pair| (($ |#1| |#2|) "\\spad{pair(s,t)} returns a pair object composed of \\spad{`s'} and \\spad{`t'}."))) NIL -((-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#2| (QUOTE (-1111)))) (-3783 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#2| (QUOTE (-1111)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870)))))) +((-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#2| (QUOTE (-1111)))) (-2813 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#2| (QUOTE (-1111)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870)))))) (-882) ((|constructor| (NIL "This domain describes four groups of color shades (palettes).")) (|coerce| (($ (|Color|)) "\\spad{coerce(c)} sets the average shade for the palette to that of the indicated color \\spad{c}.")) (|shade| (((|Integer|) $) "\\spad{shade(p)} returns the shade index of the indicated palette \\spad{p}.")) (|hue| (((|Color|) $) "\\spad{hue(p)} returns the hue field of the indicated palette \\spad{p}.")) (|light| (($ (|Color|)) "\\spad{light(c)} sets the shade of a hue,{} \\spad{c},{} to it\\spad{'s} highest value.")) (|pastel| (($ (|Color|)) "\\spad{pastel(c)} sets the shade of a hue,{} \\spad{c},{} above bright,{} but below light.")) (|bright| (($ (|Color|)) "\\spad{bright(c)} sets the shade of a hue,{} \\spad{c},{} above dim,{} but below pastel.")) (|dim| (($ (|Color|)) "\\spad{dim(c)} sets the shade of a hue,{} \\spad{c},{} above dark,{} but below bright.")) (|dark| (($ (|Color|)) "\\spad{dark(c)} sets the shade of the indicated hue of \\spad{c} to it\\spad{'s} lowest value."))) NIL @@ -3515,7 +3515,7 @@ NIL (-896 |Base| |Subject| |Pat|) ((|constructor| (NIL "This package provides the top-level pattern macthing functions.")) (|Is| (((|PatternMatchResult| |#1| |#2|) |#2| |#3|) "\\spad{Is(expr, pat)} matches the pattern pat on the expression \\spad{expr} and returns a match of the form \\spad{[v1 = e1,...,vn = en]}; returns an empty match if \\spad{expr} is exactly equal to pat. returns a \\spadfun{failed} match if pat does not match \\spad{expr}.") (((|List| (|Equation| (|Polynomial| |#2|))) |#2| |#3|) "\\spad{Is(expr, pat)} matches the pattern pat on the expression \\spad{expr} and returns a list of matches \\spad{[v1 = e1,...,vn = en]}; returns an empty list if either \\spad{expr} is exactly equal to pat or if pat does not match \\spad{expr}.") (((|List| (|Equation| |#2|)) |#2| |#3|) "\\spad{Is(expr, pat)} matches the pattern pat on the expression \\spad{expr} and returns a list of matches \\spad{[v1 = e1,...,vn = en]}; returns an empty list if either \\spad{expr} is exactly equal to pat or if pat does not match \\spad{expr}.") (((|PatternMatchListResult| |#1| |#2| (|List| |#2|)) (|List| |#2|) |#3|) "\\spad{Is([e1,...,en], pat)} matches the pattern pat on the list of expressions \\spad{[e1,...,en]} and returns the result.")) (|is?| (((|Boolean|) (|List| |#2|) |#3|) "\\spad{is?([e1,...,en], pat)} tests if the list of expressions \\spad{[e1,...,en]} matches the pattern pat.") (((|Boolean|) |#2| |#3|) "\\spad{is?(expr, pat)} tests if the expression \\spad{expr} matches the pattern pat."))) NIL -((-12 (-3796 (|HasCategory| |#2| (QUOTE (-1060)))) (-3796 (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-1188)))))) (-12 (|HasCategory| |#2| (QUOTE (-1060))) (-3796 (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-1188)))))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-1188))))) +((-12 (-2074 (|HasCategory| |#2| (QUOTE (-1060)))) (-2074 (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-1188)))))) (-12 (|HasCategory| |#2| (QUOTE (-1060))) (-2074 (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-1188)))))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-1188))))) (-897 R A B) ((|constructor| (NIL "Lifts maps to pattern matching results.")) (|map| (((|PatternMatchResult| |#1| |#3|) (|Mapping| |#3| |#2|) (|PatternMatchResult| |#1| |#2|)) "\\spad{map(f, [(v1,a1),...,(vn,an)])} returns the matching result [(\\spad{v1},{}\\spad{f}(a1)),{}...,{}(\\spad{vn},{}\\spad{f}(an))]."))) NIL @@ -3524,7 +3524,7 @@ NIL ((|constructor| (NIL "A PatternMatchResult is an object internally returned by the pattern matcher; It is either a failed match,{} or a list of matches of the form (var,{} expr) meaning that the variable var matches the expression expr.")) (|satisfy?| (((|Union| (|Boolean|) "failed") $ (|Pattern| |#1|)) "\\spad{satisfy?(r, p)} returns \\spad{true} if the matches satisfy the top-level predicate of \\spad{p},{} \\spad{false} if they don\\spad{'t},{} and \"failed\" if not enough variables of \\spad{p} are matched in \\spad{r} to decide.")) (|construct| (($ (|List| (|Record| (|:| |key| (|Symbol|)) (|:| |entry| |#2|)))) "\\spad{construct([v1,e1],...,[vn,en])} returns the match result containing the matches (\\spad{v1},{}e1),{}...,{}(\\spad{vn},{}en).")) (|destruct| (((|List| (|Record| (|:| |key| (|Symbol|)) (|:| |entry| |#2|))) $) "\\spad{destruct(r)} returns the list of matches (var,{} expr) in \\spad{r}. Error: if \\spad{r} is a failed match.")) (|addMatchRestricted| (($ (|Pattern| |#1|) |#2| $ |#2|) "\\spad{addMatchRestricted(var, expr, r, val)} adds the match (\\spad{var},{} \\spad{expr}) in \\spad{r},{} provided that \\spad{expr} satisfies the predicates attached to \\spad{var},{} that \\spad{var} is not matched to another expression already,{} and that either \\spad{var} is an optional pattern variable or that \\spad{expr} is not equal to val (usually an identity).")) (|insertMatch| (($ (|Pattern| |#1|) |#2| $) "\\spad{insertMatch(var, expr, r)} adds the match (\\spad{var},{} \\spad{expr}) in \\spad{r},{} without checking predicates or previous matches for \\spad{var}.")) (|addMatch| (($ (|Pattern| |#1|) |#2| $) "\\spad{addMatch(var, expr, r)} adds the match (\\spad{var},{} \\spad{expr}) in \\spad{r},{} provided that \\spad{expr} satisfies the predicates attached to \\spad{var},{} and that \\spad{var} is not matched to another expression already.")) (|getMatch| (((|Union| |#2| "failed") (|Pattern| |#1|) $) "\\spad{getMatch(var, r)} returns the expression that \\spad{var} matches in the result \\spad{r},{} and \"failed\" if \\spad{var} is not matched in \\spad{r}.")) (|union| (($ $ $) "\\spad{union(a, b)} makes the set-union of two match results.")) (|new| (($) "\\spad{new()} returns a new empty match result.")) (|failed| (($) "\\spad{failed()} returns a failed match.")) (|failed?| (((|Boolean|) $) "\\spad{failed?(r)} tests if \\spad{r} is a failed match."))) NIL NIL -(-899 R -4020) +(-899 R -3608) ((|constructor| (NIL "Tools for patterns.")) (|badValues| (((|List| |#2|) (|Pattern| |#1|)) "\\spad{badValues(p)} returns the list of \"bad values\" for \\spad{p}; \\spad{p} is not allowed to match any of its \"bad values\".")) (|addBadValue| (((|Pattern| |#1|) (|Pattern| |#1|) |#2|) "\\spad{addBadValue(p, v)} adds \\spad{v} to the list of \"bad values\" for \\spad{p}; \\spad{p} is not allowed to match any of its \"bad values\".")) (|satisfy?| (((|Boolean|) (|List| |#2|) (|Pattern| |#1|)) "\\spad{satisfy?([v1,...,vn], p)} returns \\spad{f(v1,...,vn)} where \\spad{f} is the top-level predicate attached to \\spad{p}.") (((|Boolean|) |#2| (|Pattern| |#1|)) "\\spad{satisfy?(v, p)} returns \\spad{f}(\\spad{v}) where \\spad{f} is the predicate attached to \\spad{p}.")) (|predicate| (((|Mapping| (|Boolean|) |#2|) (|Pattern| |#1|)) "\\spad{predicate(p)} returns the predicate attached to \\spad{p},{} the constant function \\spad{true} if \\spad{p} has no predicates attached to it.")) (|suchThat| (((|Pattern| |#1|) (|Pattern| |#1|) (|List| (|Symbol|)) (|Mapping| (|Boolean|) (|List| |#2|))) "\\spad{suchThat(p, [a1,...,an], f)} returns a copy of \\spad{p} with the top-level predicate set to \\spad{f(a1,...,an)}.") (((|Pattern| |#1|) (|Pattern| |#1|) (|List| (|Mapping| (|Boolean|) |#2|))) "\\spad{suchThat(p, [f1,...,fn])} makes a copy of \\spad{p} and adds the predicate \\spad{f1} and ... and \\spad{fn} to the copy,{} which is returned.") (((|Pattern| |#1|) (|Pattern| |#1|) (|Mapping| (|Boolean|) |#2|)) "\\spad{suchThat(p, f)} makes a copy of \\spad{p} and adds the predicate \\spad{f} to the copy,{} which is returned."))) NIL NIL @@ -3548,7 +3548,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 -(-905 UP -3636) +(-905 UP -1384) ((|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 @@ -3571,7 +3571,7 @@ NIL (-910 S) ((|constructor| (NIL "\\indented{1}{A PendantTree(\\spad{S})is either a leaf? and is an \\spad{S} or has} a left and a right both PendantTree(\\spad{S})\\spad{'s}")) (|ptree| (($ $ $) "\\spad{ptree(x,y)} \\undocumented") (($ |#1|) "\\spad{ptree(s)} is a leaf? pendant tree"))) NIL -((-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1111))) (-3783 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) +((-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1111))) (-2813 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (-911 |n| R) ((|constructor| (NIL "Permanent implements the functions {\\em permanent},{} the permanent for square matrices.")) (|permanent| ((|#2| (|SquareMatrix| |#1| |#2|)) "\\spad{permanent(x)} computes the permanent of a square matrix \\spad{x}. The {\\em permanent} is equivalent to the \\spadfun{determinant} except that coefficients have no change of sign. This function is much more difficult to compute than the {\\em determinant}. The formula used is by \\spad{H}.\\spad{J}. Ryser,{} improved by [Nijenhuis and Wilf,{} \\spad{Ch}. 19]. Note: permanent(\\spad{x}) choose one of three algorithms,{} depending on the underlying ring \\spad{R} and on \\spad{n},{} the number of rows (and columns) of \\spad{x:}\\begin{items} \\item 1. if 2 has an inverse in \\spad{R} we can use the algorithm of \\indented{3}{[Nijenhuis and Wilf,{} \\spad{ch}.19,{}\\spad{p}.158]; if 2 has no inverse,{}} \\indented{3}{some modifications are necessary:} \\item 2. if {\\em n > 6} and \\spad{R} is an integral domain with characteristic \\indented{3}{different from 2 (the algorithm works if and only 2 is not a} \\indented{3}{zero-divisor of \\spad{R} and {\\em characteristic()\\$R ~= 2},{}} \\indented{3}{but how to check that for any given \\spad{R} ?),{}} \\indented{3}{the local function {\\em permanent2} is called;} \\item 3. else,{} the local function {\\em permanent3} is called \\indented{3}{(works for all commutative rings \\spad{R}).} \\end{items}"))) NIL @@ -3587,7 +3587,7 @@ NIL (-914 S) ((|constructor| (NIL "Permutation(\\spad{S}) implements the group of all bijections \\indented{2}{on a set \\spad{S},{} which move only a finite number of points.} \\indented{2}{A permutation is considered as a map from \\spad{S} into \\spad{S}. In particular} \\indented{2}{multiplication is defined as composition of maps:} \\indented{2}{{\\em pi1 * pi2 = pi1 o pi2}.} \\indented{2}{The internal representation of permuatations are two lists} \\indented{2}{of equal length representing preimages and images.}")) (|coerceImages| (($ (|List| |#1|)) "\\spad{coerceImages(ls)} coerces the list {\\em ls} to a permutation whose image is given by {\\em ls} and the preimage is fixed to be {\\em [1,...,n]}. Note: {coerceImages(\\spad{ls})=coercePreimagesImages([1,{}...,{}\\spad{n}],{}\\spad{ls})}. We assume that both preimage and image do not contain repetitions.")) (|fixedPoints| (((|Set| |#1|) $) "\\spad{fixedPoints(p)} returns the points fixed by the permutation \\spad{p}.")) (|sort| (((|List| $) (|List| $)) "\\spad{sort(lp)} sorts a list of permutations {\\em lp} according to cycle structure first according to length of cycles,{} second,{} if \\spad{S} has \\spadtype{Finite} or \\spad{S} has \\spadtype{OrderedSet} according to lexicographical order of entries in cycles of equal length.")) (|odd?| (((|Boolean|) $) "\\spad{odd?(p)} returns \\spad{true} if and only if \\spad{p} is an odd permutation \\spadignore{i.e.} {\\em sign(p)} is {\\em -1}.")) (|even?| (((|Boolean|) $) "\\spad{even?(p)} returns \\spad{true} if and only if \\spad{p} is an even permutation,{} \\spadignore{i.e.} {\\em sign(p)} is 1.")) (|sign| (((|Integer|) $) "\\spad{sign(p)} returns the signum of the permutation \\spad{p},{} \\spad{+1} or \\spad{-1}.")) (|numberOfCycles| (((|NonNegativeInteger|) $) "\\spad{numberOfCycles(p)} returns the number of non-trivial cycles of the permutation \\spad{p}.")) (|order| (((|NonNegativeInteger|) $) "\\spad{order(p)} returns the order of a permutation \\spad{p} as a group element.")) (|cyclePartition| (((|Partition|) $) "\\spad{cyclePartition(p)} returns the cycle structure of a permutation \\spad{p} including cycles of length 1 only if \\spad{S} is finite.")) (|degree| (((|NonNegativeInteger|) $) "\\spad{degree(p)} retuns the number of points moved by the permutation \\spad{p}.")) (|coerceListOfPairs| (($ (|List| (|List| |#1|))) "\\spad{coerceListOfPairs(lls)} coerces a list of pairs {\\em lls} to a permutation. Error: if not consistent,{} \\spadignore{i.e.} the set of the first elements coincides with the set of second elements. coerce(\\spad{p}) generates output of the permutation \\spad{p} with domain OutputForm.")) (|coerce| (($ (|List| |#1|)) "\\spad{coerce(ls)} coerces a cycle {\\em ls},{} \\spadignore{i.e.} a list with not repetitions to a permutation,{} which maps {\\em ls.i} to {\\em ls.i+1},{} indices modulo the length of the list. Error: if repetitions occur.") (($ (|List| (|List| |#1|))) "\\spad{coerce(lls)} coerces a list of cycles {\\em lls} to a permutation,{} each cycle being a list with no repetitions,{} is coerced to the permutation,{} which maps {\\em ls.i} to {\\em ls.i+1},{} indices modulo the length of the list,{} then these permutations are mutiplied. Error: if repetitions occur in one cycle.")) (|coercePreimagesImages| (($ (|List| (|List| |#1|))) "\\spad{coercePreimagesImages(lls)} coerces the representation {\\em lls} of a permutation as a list of preimages and images to a permutation. We assume that both preimage and image do not contain repetitions.")) (|listRepresentation| (((|Record| (|:| |preimage| (|List| |#1|)) (|:| |image| (|List| |#1|))) $) "\\spad{listRepresentation(p)} produces a representation {\\em rep} of the permutation \\spad{p} as a list of preimages and images,{} \\spad{i}.\\spad{e} \\spad{p} maps {\\em (rep.preimage).k} to {\\em (rep.image).k} for all indices \\spad{k}. Elements of \\spad{S} not in {\\em (rep.preimage).k} are fixed points,{} and these are the only fixed points of the permutation."))) ((-4451 . T)) -((-3783 (|HasCategory| |#1| (QUOTE (-375))) (|HasCategory| |#1| (QUOTE (-858)))) (|HasCategory| |#1| (QUOTE (-375))) (|HasCategory| |#1| (QUOTE (-858)))) +((-2813 (|HasCategory| |#1| (QUOTE (-375))) (|HasCategory| |#1| (QUOTE (-858)))) (|HasCategory| |#1| (QUOTE (-375))) (|HasCategory| |#1| (QUOTE (-858)))) (-915 R E |VarSet| S) ((|constructor| (NIL "PolynomialFactorizationByRecursion(\\spad{R},{}\\spad{E},{}\\spad{VarSet},{}\\spad{S}) is used for factorization of sparse univariate polynomials over a domain \\spad{S} of multivariate polynomials over \\spad{R}.")) (|factorSFBRlcUnit| (((|Factored| (|SparseUnivariatePolynomial| |#4|)) (|List| |#3|) (|SparseUnivariatePolynomial| |#4|)) "\\spad{factorSFBRlcUnit(p)} returns the square free factorization of polynomial \\spad{p} (see \\spadfun{factorSquareFreeByRecursion}{PolynomialFactorizationByRecursionUnivariate}) in the case where the leading coefficient of \\spad{p} is a unit.")) (|bivariateSLPEBR| (((|Union| (|List| (|SparseUnivariatePolynomial| |#4|)) "failed") (|List| (|SparseUnivariatePolynomial| |#4|)) (|SparseUnivariatePolynomial| |#4|) |#3|) "\\spad{bivariateSLPEBR(lp,p,v)} implements the bivariate case of \\spadfunFrom{solveLinearPolynomialEquationByRecursion}{PolynomialFactorizationByRecursionUnivariate}; its implementation depends on \\spad{R}")) (|randomR| ((|#1|) "\\spad{randomR produces} a random element of \\spad{R}")) (|factorSquareFreeByRecursion| (((|Factored| (|SparseUnivariatePolynomial| |#4|)) (|SparseUnivariatePolynomial| |#4|)) "\\spad{factorSquareFreeByRecursion(p)} returns the square free factorization of \\spad{p}. This functions performs the recursion step for factorSquareFreePolynomial,{} as defined in \\spadfun{PolynomialFactorizationExplicit} category (see \\spadfun{factorSquareFreePolynomial}).")) (|factorByRecursion| (((|Factored| (|SparseUnivariatePolynomial| |#4|)) (|SparseUnivariatePolynomial| |#4|)) "\\spad{factorByRecursion(p)} factors polynomial \\spad{p}. This function performs the recursion step for factorPolynomial,{} as defined in \\spadfun{PolynomialFactorizationExplicit} category (see \\spadfun{factorPolynomial})")) (|solveLinearPolynomialEquationByRecursion| (((|Union| (|List| (|SparseUnivariatePolynomial| |#4|)) "failed") (|List| (|SparseUnivariatePolynomial| |#4|)) (|SparseUnivariatePolynomial| |#4|)) "\\spad{solveLinearPolynomialEquationByRecursion([p1,...,pn],p)} returns the list of polynomials \\spad{[q1,...,qn]} such that \\spad{sum qi/pi = p / prod pi},{} a recursion step for solveLinearPolynomialEquation as defined in \\spadfun{PolynomialFactorizationExplicit} category (see \\spadfun{solveLinearPolynomialEquation}). If no such list of \\spad{qi} exists,{} then \"failed\" is returned."))) NIL @@ -3608,7 +3608,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."))) ((-4446 . T) (-4452 . T) (-4447 . T) ((-4456 "*") . T) (-4448 . T) (-4449 . T) (-4451 . T)) ((|HasCategory| $ (QUOTE (-148))) (|HasCategory| $ (QUOTE (-146))) (|HasCategory| $ (QUOTE (-375)))) -(-920 R0 -3636 UP UPUP R) +(-920 R0 -1384 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 @@ -3636,7 +3636,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 -(-927 -3636) +(-927 -1384) ((|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 @@ -3652,11 +3652,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}."))) (((-4456 "*") . T)) NIL -(-931 -3636 P) +(-931 -1384 P) ((|constructor| (NIL "This package exports interpolation algorithms")) (|LagrangeInterpolation| ((|#2| (|List| |#1|) (|List| |#1|)) "\\spad{LagrangeInterpolation(l1,l2)} \\undocumented"))) NIL NIL -(-932 |xx| -3636) +(-932 |xx| -1384) ((|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 @@ -3680,7 +3680,7 @@ NIL ((|constructor| (NIL "This package exports plotting tools")) (|calcRanges| (((|List| (|Segment| (|DoubleFloat|))) (|List| (|List| (|Point| (|DoubleFloat|))))) "\\spad{calcRanges(l)} \\undocumented"))) NIL NIL -(-938 R -3636) +(-938 R -1384) ((|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 @@ -3692,7 +3692,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 -(-941 S R -3636) +(-941 S R -1384) ((|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 @@ -3712,11 +3712,11 @@ NIL ((|constructor| (NIL "This package provides pattern matching functions on polynomials.")) (|patternMatch| (((|PatternMatchResult| |#1| |#5|) |#5| (|Pattern| |#1|) (|PatternMatchResult| |#1| |#5|)) "\\spad{patternMatch(p, pat, res)} matches the pattern \\spad{pat} to the polynomial \\spad{p}; res contains the variables of \\spad{pat} which are already matched and their matches.") (((|PatternMatchResult| |#1| |#5|) |#5| (|Pattern| |#1|) (|PatternMatchResult| |#1| |#5|) (|Mapping| (|PatternMatchResult| |#1| |#5|) |#3| (|Pattern| |#1|) (|PatternMatchResult| |#1| |#5|))) "\\spad{patternMatch(p, pat, res, vmatch)} matches the pattern \\spad{pat} to the polynomial \\spad{p}. \\spad{res} contains the variables of \\spad{pat} which are already matched and their matches; vmatch is the matching function to use on the variables."))) NIL ((|HasCategory| |#3| (LIST (QUOTE -895) (|devaluate| |#1|)))) -(-946 R -3636 -4020) +(-946 R -1384 -3608) ((|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 -(-947 -4020) +(-947 -3608) ((|constructor| (NIL "Attaching predicates to symbols for pattern matching. Date Created: 21 Mar 1989 Date Last Updated: 23 May 1990")) (|suchThat| (((|Expression| (|Integer|)) (|Symbol|) (|List| (|Mapping| (|Boolean|) |#1|))) "\\spad{suchThat(x, [f1, f2, ..., fn])} attaches the predicate \\spad{f1} and \\spad{f2} and ... and \\spad{fn} to \\spad{x}.") (((|Expression| (|Integer|)) (|Symbol|) (|Mapping| (|Boolean|) |#1|)) "\\spad{suchThat(x, foo)} attaches the predicate foo to \\spad{x}."))) NIL NIL @@ -3739,7 +3739,7 @@ NIL (-952 R) ((|constructor| (NIL "This domain implements points in coordinate space"))) ((-4455 . T) (-4454 . T)) -((-3783 (-12 (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) (-3783 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544)))) (-3783 (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-1111)))) (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| (-572) (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-734))) (|HasCategory| |#1| (QUOTE (-1060))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (QUOTE (-1060)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) +((-2813 (-12 (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) (-2813 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544)))) (-2813 (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-1111)))) (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| (-572) (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-734))) (|HasCategory| |#1| (QUOTE (-1060))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (QUOTE (-1060)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) (-953 |lv| R) ((|constructor| (NIL "Package with the conversion functions among different kind of polynomials")) (|pToDmp| (((|DistributedMultivariatePolynomial| |#1| |#2|) (|Polynomial| |#2|)) "\\spad{pToDmp(p)} converts \\spad{p} from a \\spadtype{POLY} to a \\spadtype{DMP}.")) (|dmpToP| (((|Polynomial| |#2|) (|DistributedMultivariatePolynomial| |#1| |#2|)) "\\spad{dmpToP(p)} converts \\spad{p} from a \\spadtype{DMP} to a \\spadtype{POLY}.")) (|hdmpToP| (((|Polynomial| |#2|) (|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|)) "\\spad{hdmpToP(p)} converts \\spad{p} from a \\spadtype{HDMP} to a \\spadtype{POLY}.")) (|pToHdmp| (((|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|) (|Polynomial| |#2|)) "\\spad{pToHdmp(p)} converts \\spad{p} from a \\spadtype{POLY} to a \\spadtype{HDMP}.")) (|hdmpToDmp| (((|DistributedMultivariatePolynomial| |#1| |#2|) (|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|)) "\\spad{hdmpToDmp(p)} converts \\spad{p} from a \\spadtype{HDMP} to a \\spadtype{DMP}.")) (|dmpToHdmp| (((|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|) (|DistributedMultivariatePolynomial| |#1| |#2|)) "\\spad{dmpToHdmp(p)} converts \\spad{p} from a \\spadtype{DMP} to a \\spadtype{HDMP}."))) NIL @@ -3764,7 +3764,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}."))) (((-4456 "*") |has| |#1| (-174)) (-4447 |has| |#1| (-564)) (-4452 |has| |#1| (-6 -4452)) (-4449 . T) (-4448 . T) (-4451 . T)) NIL -(-959 E V R P -3636) +(-959 E V R P -1384) ((|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 @@ -3775,8 +3775,8 @@ NIL (-961 R) ((|constructor| (NIL "\\indented{2}{This type is the basic representation of sparse recursive multivariate} polynomials whose variables are arbitrary symbols. The ordering is alphabetic determined by the Symbol type. The coefficient ring may be non commutative,{} but the variables are assumed to commute.")) (|integrate| (($ $ (|Symbol|)) "\\spad{integrate(p,x)} computes the integral of \\spad{p*dx},{} \\spadignore{i.e.} integrates the polynomial \\spad{p} with respect to the variable \\spad{x}."))) (((-4456 "*") |has| |#1| (-174)) (-4447 |has| |#1| (-564)) (-4452 |has| |#1| (-6 -4452)) (-4449 . T) (-4448 . T) (-4451 . T)) -((|HasCategory| |#1| (QUOTE (-918))) (-3783 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-918)))) (-3783 (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-918)))) (-3783 (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-918)))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-174))) (-3783 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564)))) (-12 (|HasCategory| (-1188) (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-386))))) (-12 (|HasCategory| (-1188) (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-572))))) (-12 (|HasCategory| (-1188) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386)))))) (-12 (|HasCategory| (-1188) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572)))))) (-12 (|HasCategory| (-1188) (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544))))) (|HasCategory| |#1| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))) (-3783 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572)))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-370))) (|HasAttribute| |#1| (QUOTE -4452)) (|HasCategory| |#1| (QUOTE (-460))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-918)))) (-3783 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-918)))) (|HasCategory| |#1| (QUOTE (-146))))) -(-962 E V R P -3636) +((|HasCategory| |#1| (QUOTE (-918))) (-2813 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-918)))) (-2813 (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-918)))) (-2813 (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-918)))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-174))) (-2813 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564)))) (-12 (|HasCategory| (-1188) (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-386))))) (-12 (|HasCategory| (-1188) (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-572))))) (-12 (|HasCategory| (-1188) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386)))))) (-12 (|HasCategory| (-1188) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572)))))) (-12 (|HasCategory| (-1188) (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544))))) (|HasCategory| |#1| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))) (-2813 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572)))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-370))) (|HasAttribute| |#1| (QUOTE -4452)) (|HasCategory| |#1| (QUOTE (-460))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-918)))) (-2813 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-918)))) (|HasCategory| |#1| (QUOTE (-146))))) +(-962 E V R P -1384) ((|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 (-460)))) @@ -3799,12 +3799,12 @@ NIL (-967 S) ((|constructor| (NIL "\\indented{1}{This provides a fast array type with no bound checking on elt\\spad{'s}.} Minimum index is 0 in this type,{} cannot be changed"))) ((-4455 . T) (-4454 . T)) -((-3783 (-12 (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) (-3783 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544)))) (-3783 (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-1111)))) (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| (-572) (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) +((-2813 (-12 (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) (-2813 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544)))) (-2813 (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-1111)))) (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| (-572) (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) (-968) ((|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 -(-969 -3636) +(-969 -1384) ((|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 @@ -3819,11 +3819,11 @@ NIL (-972 R E) ((|constructor| (NIL "This domain represents generalized polynomials with coefficients (from a not necessarily commutative ring),{} and terms indexed by their exponents (from an arbitrary ordered abelian monoid). This type is used,{} for example,{} by the \\spadtype{DistributedMultivariatePolynomial} domain where the exponent domain is a direct product of non negative integers.")) (|canonicalUnitNormal| ((|attribute|) "canonicalUnitNormal guarantees that the function unitCanonical returns the same representative for all associates of any particular element.")) (|fmecg| (($ $ |#2| |#1| $) "\\spad{fmecg(p1,e,r,p2)} finds \\spad{X} : \\spad{p1} - \\spad{r} * X**e * \\spad{p2}"))) (((-4456 "*") |has| |#1| (-174)) (-4447 |has| |#1| (-564)) (-4452 |has| |#1| (-6 -4452)) (-4448 . T) (-4449 . T) (-4451 . T)) -((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-564))) (-3783 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564)))) (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (-3783 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572)))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-460))) (-12 (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#2| (QUOTE (-132)))) (|HasAttribute| |#1| (QUOTE -4452))) +((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-564))) (-2813 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564)))) (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (-2813 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572)))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-460))) (-12 (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#2| (QUOTE (-132)))) (|HasAttribute| |#1| (QUOTE -4452))) (-973 A B) ((|constructor| (NIL "This domain implements cartesian product")) (|selectsecond| ((|#2| $) "\\spad{selectsecond(x)} \\undocumented")) (|selectfirst| ((|#1| $) "\\spad{selectfirst(x)} \\undocumented")) (|makeprod| (($ |#1| |#2|) "\\spad{makeprod(a,b)} \\undocumented"))) ((-4451 -12 (|has| |#2| (-481)) (|has| |#1| (-481)))) -((-3783 (-12 (|HasCategory| |#1| (QUOTE (-801))) (|HasCategory| |#2| (QUOTE (-801)))) (-12 (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#2| (QUOTE (-858))))) (-12 (|HasCategory| |#1| (QUOTE (-801))) (|HasCategory| |#2| (QUOTE (-801)))) (-3783 (-12 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-21)))) (-12 (|HasCategory| |#1| (QUOTE (-132))) (|HasCategory| |#2| (QUOTE (-132)))) (-12 (|HasCategory| |#1| (QUOTE (-801))) (|HasCategory| |#2| (QUOTE (-801))))) (-12 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-21)))) (-3783 (-12 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-21)))) (-12 (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-23)))) (-12 (|HasCategory| |#1| (QUOTE (-132))) (|HasCategory| |#2| (QUOTE (-132)))) (-12 (|HasCategory| |#1| (QUOTE (-801))) (|HasCategory| |#2| (QUOTE (-801))))) (-12 (|HasCategory| |#1| (QUOTE (-481))) (|HasCategory| |#2| (QUOTE (-481)))) (-3783 (-12 (|HasCategory| |#1| (QUOTE (-481))) (|HasCategory| |#2| (QUOTE (-481)))) (-12 (|HasCategory| |#1| (QUOTE (-734))) (|HasCategory| |#2| (QUOTE (-734))))) (-12 (|HasCategory| |#1| (QUOTE (-375))) (|HasCategory| |#2| (QUOTE (-375)))) (-3783 (-12 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-21)))) (-12 (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-23)))) (-12 (|HasCategory| |#1| (QUOTE (-132))) (|HasCategory| |#2| (QUOTE (-132)))) (-12 (|HasCategory| |#1| (QUOTE (-481))) (|HasCategory| |#2| (QUOTE (-481)))) (-12 (|HasCategory| |#1| (QUOTE (-734))) (|HasCategory| |#2| (QUOTE (-734)))) (-12 (|HasCategory| |#1| (QUOTE (-801))) (|HasCategory| |#2| (QUOTE (-801))))) (-12 (|HasCategory| |#1| (QUOTE (-734))) (|HasCategory| |#2| (QUOTE (-734)))) (-12 (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-23)))) (-12 (|HasCategory| |#1| (QUOTE (-132))) (|HasCategory| |#2| (QUOTE (-132)))) (-12 (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#2| (QUOTE (-858))))) +((-2813 (-12 (|HasCategory| |#1| (QUOTE (-801))) (|HasCategory| |#2| (QUOTE (-801)))) (-12 (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#2| (QUOTE (-858))))) (-12 (|HasCategory| |#1| (QUOTE (-801))) (|HasCategory| |#2| (QUOTE (-801)))) (-2813 (-12 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-21)))) (-12 (|HasCategory| |#1| (QUOTE (-132))) (|HasCategory| |#2| (QUOTE (-132)))) (-12 (|HasCategory| |#1| (QUOTE (-801))) (|HasCategory| |#2| (QUOTE (-801))))) (-12 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-21)))) (-2813 (-12 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-21)))) (-12 (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-23)))) (-12 (|HasCategory| |#1| (QUOTE (-132))) (|HasCategory| |#2| (QUOTE (-132)))) (-12 (|HasCategory| |#1| (QUOTE (-801))) (|HasCategory| |#2| (QUOTE (-801))))) (-12 (|HasCategory| |#1| (QUOTE (-481))) (|HasCategory| |#2| (QUOTE (-481)))) (-2813 (-12 (|HasCategory| |#1| (QUOTE (-481))) (|HasCategory| |#2| (QUOTE (-481)))) (-12 (|HasCategory| |#1| (QUOTE (-734))) (|HasCategory| |#2| (QUOTE (-734))))) (-12 (|HasCategory| |#1| (QUOTE (-375))) (|HasCategory| |#2| (QUOTE (-375)))) (-2813 (-12 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-21)))) (-12 (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-23)))) (-12 (|HasCategory| |#1| (QUOTE (-132))) (|HasCategory| |#2| (QUOTE (-132)))) (-12 (|HasCategory| |#1| (QUOTE (-481))) (|HasCategory| |#2| (QUOTE (-481)))) (-12 (|HasCategory| |#1| (QUOTE (-734))) (|HasCategory| |#2| (QUOTE (-734)))) (-12 (|HasCategory| |#1| (QUOTE (-801))) (|HasCategory| |#2| (QUOTE (-801))))) (-12 (|HasCategory| |#1| (QUOTE (-734))) (|HasCategory| |#2| (QUOTE (-734)))) (-12 (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-23)))) (-12 (|HasCategory| |#1| (QUOTE (-132))) (|HasCategory| |#2| (QUOTE (-132)))) (-12 (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#2| (QUOTE (-858))))) (-974) ((|constructor| (NIL "\\indented{1}{Author: Gabriel Dos Reis} Date Created: October 24,{} 2007 Date Last Modified: January 18,{} 2008. An `Property' is a pair of name and value.")) (|property| (($ (|Identifier|) (|SExpression|)) "\\spad{property(n,val)} constructs a property with name \\spad{`n'} and value `val'.")) (|value| (((|SExpression|) $) "\\spad{value(p)} returns value of property \\spad{p}")) (|name| (((|Identifier|) $) "\\spad{name(p)} returns the name of property \\spad{p}"))) NIL @@ -3912,7 +3912,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 -(-996 K R UP -3636) +(-996 K R UP -1384) ((|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 @@ -3971,11 +3971,11 @@ NIL (-1010 R) ((|constructor| (NIL "\\spadtype{Quaternion} implements quaternions over a \\indented{2}{commutative ring. The main constructor function is \\spadfun{quatern}} \\indented{2}{which takes 4 arguments: the real part,{} the \\spad{i} imaginary part,{} the \\spad{j}} \\indented{2}{imaginary part and the \\spad{k} imaginary part.}"))) ((-4447 |has| |#1| (-296)) (-4448 . T) (-4449 . T) (-4451 . T)) -((|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#1| (QUOTE (-370))) (-3783 (|HasCategory| |#1| (QUOTE (-296))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (QUOTE (-296))) (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#1| (LIST (QUOTE -522) (QUOTE (-1188)) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -292) (|devaluate| |#1|) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-237))) (-3783 (|HasCategory| |#1| (LIST (QUOTE -292) (|devaluate| |#1|) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-237)))) (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (-3783 (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-1071))) (|HasCategory| |#1| (QUOTE (-553)))) +((|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#1| (QUOTE (-370))) (-2813 (|HasCategory| |#1| (QUOTE (-296))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (QUOTE (-296))) (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#1| (LIST (QUOTE -522) (QUOTE (-1188)) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -292) (|devaluate| |#1|) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-237))) (-2813 (|HasCategory| |#1| (LIST (QUOTE -292) (|devaluate| |#1|) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-237)))) (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (-2813 (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-1071))) (|HasCategory| |#1| (QUOTE (-553)))) (-1011 S) ((|constructor| (NIL "Linked List implementation of a Queue")) (|queue| (($ (|List| |#1|)) "\\spad{queue([x,y,...,z])} creates a queue with first (top) element \\spad{x},{} second element \\spad{y},{}...,{}and last (bottom) element \\spad{z}."))) ((-4454 . T) (-4455 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1111))) (-3783 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) +((-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1111))) (-2813 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (-1012 S) ((|constructor| (NIL "The \\spad{RadicalCategory} is a model for the rational numbers.")) (** (($ $ (|Fraction| (|Integer|))) "\\spad{x ** y} is the rational exponentiation of \\spad{x} by the power \\spad{y}.")) (|nthRoot| (($ $ (|Integer|)) "\\spad{nthRoot(x,n)} returns the \\spad{n}th root of \\spad{x}.")) (|sqrt| (($ $) "\\spad{sqrt(x)} returns the square root of \\spad{x}."))) NIL @@ -3984,14 +3984,14 @@ 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 -(-1014 -3636 UP UPUP |radicnd| |n|) +(-1014 -1384 UP UPUP |radicnd| |n|) ((|constructor| (NIL "Function field defined by y**n = \\spad{f}(\\spad{x})."))) ((-4447 |has| (-415 |#2|) (-370)) (-4452 |has| (-415 |#2|) (-370)) (-4446 |has| (-415 |#2|) (-370)) ((-4456 "*") . T) (-4448 . T) (-4449 . T) (-4451 . T)) -((|HasCategory| (-415 |#2|) (QUOTE (-146))) (|HasCategory| (-415 |#2|) (QUOTE (-148))) (|HasCategory| (-415 |#2|) (QUOTE (-356))) (-3783 (|HasCategory| (-415 |#2|) (QUOTE (-370))) (|HasCategory| (-415 |#2|) (QUOTE (-356)))) (|HasCategory| (-415 |#2|) (QUOTE (-370))) (|HasCategory| (-415 |#2|) (QUOTE (-375))) (-3783 (-12 (|HasCategory| (-415 |#2|) (QUOTE (-237))) (|HasCategory| (-415 |#2|) (QUOTE (-370)))) (|HasCategory| (-415 |#2|) (QUOTE (-356)))) (-3783 (-12 (|HasCategory| (-415 |#2|) (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| (-415 |#2|) (QUOTE (-370)))) (-12 (|HasCategory| (-415 |#2|) (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| (-415 |#2|) (QUOTE (-356))))) (|HasCategory| (-415 |#2|) (LIST (QUOTE -647) (QUOTE (-572)))) (-3783 (|HasCategory| (-415 |#2|) (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| (-415 |#2|) (QUOTE (-370)))) (|HasCategory| (-415 |#2|) (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| (-415 |#2|) (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-375))) (-12 (|HasCategory| (-415 |#2|) (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| (-415 |#2|) (QUOTE (-370)))) (-12 (|HasCategory| (-415 |#2|) (QUOTE (-237))) (|HasCategory| (-415 |#2|) (QUOTE (-370))))) +((|HasCategory| (-415 |#2|) (QUOTE (-146))) (|HasCategory| (-415 |#2|) (QUOTE (-148))) (|HasCategory| (-415 |#2|) (QUOTE (-356))) (-2813 (|HasCategory| (-415 |#2|) (QUOTE (-370))) (|HasCategory| (-415 |#2|) (QUOTE (-356)))) (|HasCategory| (-415 |#2|) (QUOTE (-370))) (|HasCategory| (-415 |#2|) (QUOTE (-375))) (-2813 (-12 (|HasCategory| (-415 |#2|) (QUOTE (-237))) (|HasCategory| (-415 |#2|) (QUOTE (-370)))) (|HasCategory| (-415 |#2|) (QUOTE (-356)))) (-2813 (-12 (|HasCategory| (-415 |#2|) (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| (-415 |#2|) (QUOTE (-370)))) (-12 (|HasCategory| (-415 |#2|) (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| (-415 |#2|) (QUOTE (-356))))) (|HasCategory| (-415 |#2|) (LIST (QUOTE -647) (QUOTE (-572)))) (-2813 (|HasCategory| (-415 |#2|) (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| (-415 |#2|) (QUOTE (-370)))) (|HasCategory| (-415 |#2|) (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| (-415 |#2|) (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-375))) (-12 (|HasCategory| (-415 |#2|) (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| (-415 |#2|) (QUOTE (-370)))) (-12 (|HasCategory| (-415 |#2|) (QUOTE (-237))) (|HasCategory| (-415 |#2|) (QUOTE (-370))))) (-1015 |bb|) ((|constructor| (NIL "This domain allows rational numbers to be presented as repeating decimal expansions or more generally as repeating expansions in any base.")) (|fractRadix| (($ (|List| (|Integer|)) (|List| (|Integer|))) "\\spad{fractRadix(pre,cyc)} creates a fractional radix expansion from a list of prefix ragits and a list of cyclic ragits. For example,{} \\spad{fractRadix([1],[6])} will return \\spad{0.16666666...}.")) (|wholeRadix| (($ (|List| (|Integer|))) "\\spad{wholeRadix(l)} creates an integral radix expansion from a list of ragits. For example,{} \\spad{wholeRadix([1,3,4])} will return \\spad{134}.")) (|cycleRagits| (((|List| (|Integer|)) $) "\\spad{cycleRagits(rx)} returns the cyclic part of the ragits of the fractional part of a radix expansion. For example,{} if \\spad{x = 3/28 = 0.10 714285 714285 ...},{} then \\spad{cycleRagits(x) = [7,1,4,2,8,5]}.")) (|prefixRagits| (((|List| (|Integer|)) $) "\\spad{prefixRagits(rx)} returns the non-cyclic part of the ragits of the fractional part of a radix expansion. For example,{} if \\spad{x = 3/28 = 0.10 714285 714285 ...},{} then \\spad{prefixRagits(x)=[1,0]}.")) (|fractRagits| (((|Stream| (|Integer|)) $) "\\spad{fractRagits(rx)} returns the ragits of the fractional part of a radix expansion.")) (|wholeRagits| (((|List| (|Integer|)) $) "\\spad{wholeRagits(rx)} returns the ragits of the integer part of a radix expansion.")) (|fractionPart| (((|Fraction| (|Integer|)) $) "\\spad{fractionPart(rx)} returns the fractional part of a radix expansion."))) ((-4446 . T) (-4452 . T) (-4447 . T) ((-4456 "*") . T) (-4448 . T) (-4449 . T) (-4451 . T)) -((|HasCategory| (-572) (QUOTE (-918))) (|HasCategory| (-572) (LIST (QUOTE -1049) (QUOTE (-1188)))) (|HasCategory| (-572) (QUOTE (-146))) (|HasCategory| (-572) (QUOTE (-148))) (|HasCategory| (-572) (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| (-572) (QUOTE (-1033))) (|HasCategory| (-572) (QUOTE (-828))) (-3783 (|HasCategory| (-572) (QUOTE (-828))) (|HasCategory| (-572) (QUOTE (-858)))) (|HasCategory| (-572) (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| (-572) (QUOTE (-1163))) (|HasCategory| (-572) (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| (-572) (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| (-572) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| (-572) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| (-572) (QUOTE (-237))) (|HasCategory| (-572) (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| (-572) (LIST (QUOTE -522) (QUOTE (-1188)) (QUOTE (-572)))) (|HasCategory| (-572) (LIST (QUOTE -315) (QUOTE (-572)))) (|HasCategory| (-572) (LIST (QUOTE -292) (QUOTE (-572)) (QUOTE (-572)))) (|HasCategory| (-572) (QUOTE (-313))) (|HasCategory| (-572) (QUOTE (-553))) (|HasCategory| (-572) (QUOTE (-858))) (|HasCategory| (-572) (LIST (QUOTE -647) (QUOTE (-572)))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| (-572) (QUOTE (-918)))) (-3783 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| (-572) (QUOTE (-918)))) (|HasCategory| (-572) (QUOTE (-146))))) +((|HasCategory| (-572) (QUOTE (-918))) (|HasCategory| (-572) (LIST (QUOTE -1049) (QUOTE (-1188)))) (|HasCategory| (-572) (QUOTE (-146))) (|HasCategory| (-572) (QUOTE (-148))) (|HasCategory| (-572) (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| (-572) (QUOTE (-1033))) (|HasCategory| (-572) (QUOTE (-828))) (-2813 (|HasCategory| (-572) (QUOTE (-828))) (|HasCategory| (-572) (QUOTE (-858)))) (|HasCategory| (-572) (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| (-572) (QUOTE (-1163))) (|HasCategory| (-572) (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| (-572) (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| (-572) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| (-572) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| (-572) (QUOTE (-237))) (|HasCategory| (-572) (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| (-572) (LIST (QUOTE -522) (QUOTE (-1188)) (QUOTE (-572)))) (|HasCategory| (-572) (LIST (QUOTE -315) (QUOTE (-572)))) (|HasCategory| (-572) (LIST (QUOTE -292) (QUOTE (-572)) (QUOTE (-572)))) (|HasCategory| (-572) (QUOTE (-313))) (|HasCategory| (-572) (QUOTE (-553))) (|HasCategory| (-572) (QUOTE (-858))) (|HasCategory| (-572) (LIST (QUOTE -647) (QUOTE (-572)))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| (-572) (QUOTE (-918)))) (-2813 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| (-572) (QUOTE (-918)))) (|HasCategory| (-572) (QUOTE (-146))))) (-1016) ((|constructor| (NIL "This package provides tools for creating radix expansions.")) (|radix| (((|Any|) (|Fraction| (|Integer|)) (|Integer|)) "\\spad{radix(x,b)} converts \\spad{x} to a radix expansion in base \\spad{b}."))) NIL @@ -4024,19 +4024,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}}"))) ((-4447 . T) (-4452 . T) (-4446 . T) (-4449 . T) (-4448 . T) ((-4456 "*") . T) (-4451 . T)) NIL -(-1024 R -3636) +(-1024 R -1384) ((|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 -(-1025 R -3636) +(-1025 R -1384) ((|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 -(-1026 -3636 UP) +(-1026 -1384 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 -(-1027 -3636 UP) +(-1027 -1384 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 @@ -4071,8 +4071,8 @@ NIL (-1035 |TheField|) ((|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"))) ((-4447 . T) (-4452 . T) (-4446 . T) (-4449 . T) (-4448 . T) ((-4456 "*") . T) (-4451 . T)) -((-3783 (|HasCategory| (-415 (-572)) (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| (-415 (-572)) (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| (-415 (-572)) (LIST (QUOTE -1049) (QUOTE (-572))))) -(-1036 -3636 L) +((-2813 (|HasCategory| (-415 (-572)) (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| (-415 (-572)) (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| (-415 (-572)) (LIST (QUOTE -1049) (QUOTE (-572))))) +(-1036 -1384 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 @@ -4108,14 +4108,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 -(-1045 -3636 |Expon| |VarSet| |FPol| |LFPol|) +(-1045 -1384 |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"))) (((-4456 "*") . T) (-4448 . T) (-4449 . T) (-4451 . T)) NIL (-1046) ((|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.}"))) ((-4454 . T) (-4455 . T)) -((-12 (|HasCategory| (-2 (|:| -1640 (-1188)) (|:| -3763 (-52))) (QUOTE (-1111))) (|HasCategory| (-2 (|:| -1640 (-1188)) (|:| -3763 (-52))) (LIST (QUOTE -315) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -1640) (QUOTE (-1188))) (LIST (QUOTE |:|) (QUOTE -3763) (QUOTE (-52))))))) (-3783 (|HasCategory| (-2 (|:| -1640 (-1188)) (|:| -3763 (-52))) (QUOTE (-1111))) (|HasCategory| (-52) (QUOTE (-1111)))) (-3783 (|HasCategory| (-2 (|:| -1640 (-1188)) (|:| -3763 (-52))) (QUOTE (-1111))) (|HasCategory| (-2 (|:| -1640 (-1188)) (|:| -3763 (-52))) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| (-52) (QUOTE (-1111))) (|HasCategory| (-52) (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| (-2 (|:| -1640 (-1188)) (|:| -3763 (-52))) (LIST (QUOTE -622) (QUOTE (-544)))) (-12 (|HasCategory| (-52) (QUOTE (-1111))) (|HasCategory| (-52) (LIST (QUOTE -315) (QUOTE (-52))))) (|HasCategory| (-2 (|:| -1640 (-1188)) (|:| -3763 (-52))) (QUOTE (-1111))) (|HasCategory| (-1188) (QUOTE (-858))) (|HasCategory| (-52) (QUOTE (-1111))) (-3783 (|HasCategory| (-2 (|:| -1640 (-1188)) (|:| -3763 (-52))) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| (-52) (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| (-52) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| (-2 (|:| -1640 (-1188)) (|:| -3763 (-52))) (LIST (QUOTE -621) (QUOTE (-870))))) +((-12 (|HasCategory| (-2 (|:| -3690 (-1188)) (|:| -1907 (-52))) (QUOTE (-1111))) (|HasCategory| (-2 (|:| -3690 (-1188)) (|:| -1907 (-52))) (LIST (QUOTE -315) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -3690) (QUOTE (-1188))) (LIST (QUOTE |:|) (QUOTE -1907) (QUOTE (-52))))))) (-2813 (|HasCategory| (-2 (|:| -3690 (-1188)) (|:| -1907 (-52))) (QUOTE (-1111))) (|HasCategory| (-52) (QUOTE (-1111)))) (-2813 (|HasCategory| (-2 (|:| -3690 (-1188)) (|:| -1907 (-52))) (QUOTE (-1111))) (|HasCategory| (-2 (|:| -3690 (-1188)) (|:| -1907 (-52))) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| (-52) (QUOTE (-1111))) (|HasCategory| (-52) (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| (-2 (|:| -3690 (-1188)) (|:| -1907 (-52))) (LIST (QUOTE -622) (QUOTE (-544)))) (-12 (|HasCategory| (-52) (QUOTE (-1111))) (|HasCategory| (-52) (LIST (QUOTE -315) (QUOTE (-52))))) (|HasCategory| (-2 (|:| -3690 (-1188)) (|:| -1907 (-52))) (QUOTE (-1111))) (|HasCategory| (-1188) (QUOTE (-858))) (|HasCategory| (-52) (QUOTE (-1111))) (-2813 (|HasCategory| (-2 (|:| -3690 (-1188)) (|:| -1907 (-52))) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| (-52) (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| (-52) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| (-2 (|:| -3690 (-1188)) (|:| -1907 (-52))) (LIST (QUOTE -621) (QUOTE (-870))))) (-1047) ((|constructor| (NIL "This domain represents `return' expressions.")) (|expression| (((|SpadAst|) $) "\\spad{expression(e)} returns the expression returned by `e'."))) NIL @@ -4172,7 +4172,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."))) ((-4451 . T)) NIL -(-1061 |xx| -3636) +(-1061 |xx| -1384) ((|constructor| (NIL "This package exports rational interpolation algorithms"))) NIL NIL @@ -4191,7 +4191,7 @@ NIL (-1065 |m| |n| R) ((|constructor| (NIL "\\spadtype{RectangularMatrix} is a matrix domain where the number of rows and the number of columns are parameters of the domain.")) (|rectangularMatrix| (($ (|Matrix| |#3|)) "\\spad{rectangularMatrix(m)} converts a matrix of type \\spadtype{Matrix} to a matrix of type \\spad{RectangularMatrix}."))) ((-4454 . T) (-4449 . T) (-4448 . T)) -((|HasCategory| |#3| (QUOTE (-174))) (-3783 (-12 (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-370))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1111))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|))))) (|HasCategory| |#3| (LIST (QUOTE -622) (QUOTE (-544)))) (-3783 (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (QUOTE (-370)))) (|HasCategory| |#3| (QUOTE (-370))) (|HasCategory| |#3| (QUOTE (-1111))) (|HasCategory| |#3| (QUOTE (-313))) (|HasCategory| |#3| (QUOTE (-564))) (-12 (|HasCategory| |#3| (QUOTE (-1111))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|)))) (|HasCategory| |#3| (LIST (QUOTE -621) (QUOTE (-870))))) +((|HasCategory| |#3| (QUOTE (-174))) (-2813 (-12 (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-370))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1111))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|))))) (|HasCategory| |#3| (LIST (QUOTE -622) (QUOTE (-544)))) (-2813 (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (QUOTE (-370)))) (|HasCategory| |#3| (QUOTE (-370))) (|HasCategory| |#3| (QUOTE (-1111))) (|HasCategory| |#3| (QUOTE (-313))) (|HasCategory| |#3| (QUOTE (-564))) (-12 (|HasCategory| |#3| (QUOTE (-1111))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|)))) (|HasCategory| |#3| (LIST (QUOTE -621) (QUOTE (-870))))) (-1066 |m| |n| R1 |Row1| |Col1| M1 R2 |Row2| |Col2| M2) ((|constructor| (NIL "\\spadtype{RectangularMatrixCategoryFunctions2} provides functions between two matrix domains. The functions provided are \\spadfun{map} and \\spadfun{reduce}.")) (|reduce| ((|#7| (|Mapping| |#7| |#3| |#7|) |#6| |#7|) "\\spad{reduce(f,m,r)} returns a matrix \\spad{n} where \\spad{n[i,j] = f(m[i,j],r)} for all indices spad{\\spad{i}} and \\spad{j}.")) (|map| ((|#10| (|Mapping| |#7| |#3|) |#6|) "\\spad{map(f,m)} applies the function \\spad{f} to the elements of the matrix \\spad{m}."))) NIL @@ -4227,7 +4227,7 @@ NIL (-1074) ((|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}"))) ((-4454 . T) (-4455 . T)) -((-12 (|HasCategory| (-2 (|:| -1640 (-1188)) (|:| -3763 (-52))) (QUOTE (-1111))) (|HasCategory| (-2 (|:| -1640 (-1188)) (|:| -3763 (-52))) (LIST (QUOTE -315) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -1640) (QUOTE (-1188))) (LIST (QUOTE |:|) (QUOTE -3763) (QUOTE (-52))))))) (-3783 (|HasCategory| (-2 (|:| -1640 (-1188)) (|:| -3763 (-52))) (QUOTE (-1111))) (|HasCategory| (-52) (QUOTE (-1111)))) (-3783 (|HasCategory| (-2 (|:| -1640 (-1188)) (|:| -3763 (-52))) (QUOTE (-1111))) (|HasCategory| (-2 (|:| -1640 (-1188)) (|:| -3763 (-52))) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| (-52) (QUOTE (-1111))) (|HasCategory| (-52) (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| (-2 (|:| -1640 (-1188)) (|:| -3763 (-52))) (LIST (QUOTE -622) (QUOTE (-544)))) (-12 (|HasCategory| (-52) (QUOTE (-1111))) (|HasCategory| (-52) (LIST (QUOTE -315) (QUOTE (-52))))) (|HasCategory| (-2 (|:| -1640 (-1188)) (|:| -3763 (-52))) (QUOTE (-1111))) (|HasCategory| (-1188) (QUOTE (-858))) (|HasCategory| (-52) (QUOTE (-1111))) (-3783 (|HasCategory| (-2 (|:| -1640 (-1188)) (|:| -3763 (-52))) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| (-52) (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| (-52) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| (-2 (|:| -1640 (-1188)) (|:| -3763 (-52))) (LIST (QUOTE -621) (QUOTE (-870))))) +((-12 (|HasCategory| (-2 (|:| -3690 (-1188)) (|:| -1907 (-52))) (QUOTE (-1111))) (|HasCategory| (-2 (|:| -3690 (-1188)) (|:| -1907 (-52))) (LIST (QUOTE -315) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -3690) (QUOTE (-1188))) (LIST (QUOTE |:|) (QUOTE -1907) (QUOTE (-52))))))) (-2813 (|HasCategory| (-2 (|:| -3690 (-1188)) (|:| -1907 (-52))) (QUOTE (-1111))) (|HasCategory| (-52) (QUOTE (-1111)))) (-2813 (|HasCategory| (-2 (|:| -3690 (-1188)) (|:| -1907 (-52))) (QUOTE (-1111))) (|HasCategory| (-2 (|:| -3690 (-1188)) (|:| -1907 (-52))) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| (-52) (QUOTE (-1111))) (|HasCategory| (-52) (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| (-2 (|:| -3690 (-1188)) (|:| -1907 (-52))) (LIST (QUOTE -622) (QUOTE (-544)))) (-12 (|HasCategory| (-52) (QUOTE (-1111))) (|HasCategory| (-52) (LIST (QUOTE -315) (QUOTE (-52))))) (|HasCategory| (-2 (|:| -3690 (-1188)) (|:| -1907 (-52))) (QUOTE (-1111))) (|HasCategory| (-1188) (QUOTE (-858))) (|HasCategory| (-52) (QUOTE (-1111))) (-2813 (|HasCategory| (-2 (|:| -3690 (-1188)) (|:| -1907 (-52))) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| (-52) (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| (-52) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| (-2 (|:| -3690 (-1188)) (|:| -1907 (-52))) (LIST (QUOTE -621) (QUOTE (-870))))) (-1075 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 @@ -4276,11 +4276,11 @@ NIL ((|constructor| (NIL "This domain implements named rules")) (|name| (((|Symbol|) $) "\\spad{name(x)} returns the symbol"))) NIL NIL -(-1087 |Base| R -3636) +(-1087 |Base| R -1384) ((|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 -(-1088 |Base| R -3636) +(-1088 |Base| R -1384) ((|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 @@ -4295,7 +4295,7 @@ NIL (-1091 R UP M) ((|constructor| (NIL "Domain which represents simple algebraic extensions of arbitrary rings. The first argument to the domain,{} \\spad{R},{} is the underlying ring,{} the second argument is a domain of univariate polynomials over \\spad{K},{} while the last argument specifies the defining minimal polynomial. The elements of the domain are canonically represented as polynomials of degree less than that of the minimal polynomial with coefficients in \\spad{R}. The second argument is both the type of the third argument and the underlying representation used by \\spadtype{SAE} itself."))) ((-4447 |has| |#1| (-370)) (-4452 |has| |#1| (-370)) (-4446 |has| |#1| (-370)) ((-4456 "*") . T) (-4448 . T) (-4449 . T) (-4451 . T)) -((|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-356))) (-3783 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-356)))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-375))) (-3783 (-12 (|HasCategory| |#1| (QUOTE (-237))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (QUOTE (-356)))) (-3783 (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188))))) (-12 (|HasCategory| |#1| (QUOTE (-356))) (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))))) (|HasCategory| |#1| (LIST (QUOTE -647) (QUOTE (-572)))) (-3783 (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188))))) (-12 (|HasCategory| |#1| (QUOTE (-237))) (|HasCategory| |#1| (QUOTE (-370))))) +((|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-356))) (-2813 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-356)))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-375))) (-2813 (-12 (|HasCategory| |#1| (QUOTE (-237))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (QUOTE (-356)))) (-2813 (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188))))) (-12 (|HasCategory| |#1| (QUOTE (-356))) (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))))) (|HasCategory| |#1| (LIST (QUOTE -647) (QUOTE (-572)))) (-2813 (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188))))) (-12 (|HasCategory| |#1| (QUOTE (-237))) (|HasCategory| |#1| (QUOTE (-370))))) (-1092 UP SAE UPA) ((|constructor| (NIL "Factorization of univariate polynomials with coefficients in an algebraic extension of \\spadtype{Fraction Polynomial Integer}.")) (|factor| (((|Factored| |#3|) |#3|) "\\spad{factor(p)} returns a prime factorisation of \\spad{p}."))) NIL @@ -4323,7 +4323,7 @@ NIL (-1098 R) ((|constructor| (NIL "\\spadtype{SequentialDifferentialPolynomial} implements an ordinary differential polynomial ring in arbitrary number of differential indeterminates,{} with coefficients in a ring. The ranking on the differential indeterminate is sequential. \\blankline"))) (((-4456 "*") |has| |#1| (-174)) (-4447 |has| |#1| (-564)) (-4452 |has| |#1| (-6 -4452)) (-4449 . T) (-4448 . T) (-4451 . T)) -((|HasCategory| |#1| (QUOTE (-918))) (-3783 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-918)))) (-3783 (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-918)))) (-3783 (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-918)))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-174))) (-3783 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564)))) (-12 (|HasCategory| (-1099 (-1188)) (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-386))))) (-12 (|HasCategory| (-1099 (-1188)) (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-572))))) (-12 (|HasCategory| (-1099 (-1188)) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386)))))) (-12 (|HasCategory| (-1099 (-1188)) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572)))))) (-12 (|HasCategory| (-1099 (-1188)) (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544))))) (|HasCategory| |#1| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))) (-3783 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572)))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-237))) (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#1| (QUOTE (-370))) (|HasAttribute| |#1| (QUOTE -4452)) (|HasCategory| |#1| (QUOTE (-460))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-918)))) (-3783 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-918)))) (|HasCategory| |#1| (QUOTE (-146))))) +((|HasCategory| |#1| (QUOTE (-918))) (-2813 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-918)))) (-2813 (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-918)))) (-2813 (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-918)))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-174))) (-2813 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564)))) (-12 (|HasCategory| (-1099 (-1188)) (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-386))))) (-12 (|HasCategory| (-1099 (-1188)) (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-572))))) (-12 (|HasCategory| (-1099 (-1188)) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386)))))) (-12 (|HasCategory| (-1099 (-1188)) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572)))))) (-12 (|HasCategory| (-1099 (-1188)) (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544))))) (|HasCategory| |#1| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))) (-2813 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572)))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-237))) (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#1| (QUOTE (-370))) (|HasAttribute| |#1| (QUOTE -4452)) (|HasCategory| |#1| (QUOTE (-460))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-918)))) (-2813 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-918)))) (|HasCategory| |#1| (QUOTE (-146))))) (-1099 S) ((|constructor| (NIL "\\spadtype{OrderlyDifferentialVariable} adds a commonly used sequential ranking to the set of derivatives of an ordered list of differential indeterminates. A sequential ranking is a ranking \\spadfun{<} of the derivatives with the property that for any derivative \\spad{v},{} there are only a finite number of derivatives \\spad{u} with \\spad{u} \\spadfun{<} \\spad{v}. This domain belongs to \\spadtype{DifferentialVariableCategory}. It defines \\spadfun{weight} to be just \\spadfun{order},{} and it defines a sequential ranking \\spadfun{<} on derivatives \\spad{u} by the lexicographic order on the pair (\\spadfun{variable}(\\spad{u}),{} \\spadfun{order}(\\spad{u}))."))) NIL @@ -4383,7 +4383,7 @@ NIL (-1113 S) ((|constructor| (NIL "A set over a domain \\spad{D} models the usual mathematical notion of a finite set of elements from \\spad{D}. Sets are unordered collections of distinct elements (that is,{} order and duplication does not matter). The notation \\spad{set [a,b,c]} can be used to create a set and the usual operations such as union and intersection are available to form new sets. In our implementation,{} \\Language{} maintains the entries in sorted order. Specifically,{} the parts function returns the entries as a list in ascending order and the extract operation returns the maximum entry. Given two sets \\spad{s} and \\spad{t} where \\spad{\\#s = m} and \\spad{\\#t = n},{} the complexity of \\indented{2}{\\spad{s = t} is \\spad{O(min(n,m))}} \\indented{2}{\\spad{s < t} is \\spad{O(max(n,m))}} \\indented{2}{\\spad{union(s,t)},{} \\spad{intersect(s,t)},{} \\spad{minus(s,t)},{} \\spad{symmetricDifference(s,t)} is \\spad{O(max(n,m))}} \\indented{2}{\\spad{member(x,t)} is \\spad{O(n log n)}} \\indented{2}{\\spad{insert(x,t)} and \\spad{remove(x,t)} is \\spad{O(n)}}"))) ((-4454 . T) (-4444 . T) (-4455 . T)) -((-3783 (-12 (|HasCategory| |#1| (QUOTE (-375))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#1| (QUOTE (-375))) (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) +((-2813 (-12 (|HasCategory| |#1| (QUOTE (-375))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#1| (QUOTE (-375))) (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) (-1114 |Str| |Sym| |Int| |Flt| |Expr|) ((|constructor| (NIL "This category allows the manipulation of Lisp values while keeping the grunge fairly localized.")) (|#| (((|Integer|) $) "\\spad{\\#((a1,...,an))} returns \\spad{n}.")) (|cdr| (($ $) "\\spad{cdr((a1,...,an))} returns \\spad{(a2,...,an)}.")) (|car| (($ $) "\\spad{car((a1,...,an))} returns a1.")) (|expr| ((|#5| $) "\\spad{expr(s)} returns \\spad{s} as an element of Expr; Error: if \\spad{s} is not an atom that also belongs to Expr.")) (|float| ((|#4| $) "\\spad{float(s)} returns \\spad{s} as an element of \\spad{Flt}; Error: if \\spad{s} is not an atom that also belongs to \\spad{Flt}.")) (|integer| ((|#3| $) "\\spad{integer(s)} returns \\spad{s} as an element of Int. Error: if \\spad{s} is not an atom that also belongs to Int.")) (|symbol| ((|#2| $) "\\spad{symbol(s)} returns \\spad{s} as an element of \\spad{Sym}. Error: if \\spad{s} is not an atom that also belongs to \\spad{Sym}.")) (|string| ((|#1| $) "\\spad{string(s)} returns \\spad{s} as an element of \\spad{Str}. Error: if \\spad{s} is not an atom that also belongs to \\spad{Str}.")) (|destruct| (((|List| $) $) "\\spad{destruct((a1,...,an))} returns the list [a1,{}...,{}an].")) (|float?| (((|Boolean|) $) "\\spad{float?(s)} is \\spad{true} if \\spad{s} is an atom and belong to \\spad{Flt}.")) (|integer?| (((|Boolean|) $) "\\spad{integer?(s)} is \\spad{true} if \\spad{s} is an atom and belong to Int.")) (|symbol?| (((|Boolean|) $) "\\spad{symbol?(s)} is \\spad{true} if \\spad{s} is an atom and belong to \\spad{Sym}.")) (|string?| (((|Boolean|) $) "\\spad{string?(s)} is \\spad{true} if \\spad{s} is an atom and belong to \\spad{Str}.")) (|list?| (((|Boolean|) $) "\\spad{list?(s)} is \\spad{true} if \\spad{s} is a Lisp list,{} possibly ().")) (|pair?| (((|Boolean|) $) "\\spad{pair?(s)} is \\spad{true} if \\spad{s} has is a non-null Lisp list.")) (|atom?| (((|Boolean|) $) "\\spad{atom?(s)} is \\spad{true} if \\spad{s} is a Lisp atom.")) (|null?| (((|Boolean|) $) "\\spad{null?(s)} is \\spad{true} if \\spad{s} is the \\spad{S}-expression ().")) (|eq| (((|Boolean|) $ $) "\\spad{eq(s, t)} is \\spad{true} if EQ(\\spad{s},{}\\spad{t}) is \\spad{true} in Lisp."))) NIL @@ -4427,7 +4427,7 @@ NIL (-1124 |dimtot| |dim1| S) ((|constructor| (NIL "\\indented{2}{This type represents the finite direct or cartesian product of an} underlying ordered component type. The vectors are ordered as if they were split into two blocks. The dim1 parameter specifies the length of the first block. The ordering is lexicographic between the blocks but acts like \\spadtype{HomogeneousDirectProduct} within each block. This type is a suitable third argument for \\spadtype{GeneralDistributedMultivariatePolynomial}."))) ((-4448 |has| |#3| (-1060)) (-4449 |has| |#3| (-1060)) (-4451 |has| |#3| (-6 -4451)) ((-4456 "*") |has| |#3| (-174)) (-4454 . T)) -((-3783 (-12 (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-132))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-237))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-370))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-375))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-734))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-801))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-856))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1060))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1111))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|))) (|HasCategory| |#3| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|))) (|HasCategory| |#3| (LIST (QUOTE -909) (QUOTE (-1188)))))) (-3783 (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (QUOTE (-1111)))) (-12 (|HasCategory| |#3| (QUOTE (-237))) (|HasCategory| |#3| (QUOTE (-1060)))) (-12 (|HasCategory| |#3| (QUOTE (-1060))) (|HasCategory| |#3| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-1060))) (|HasCategory| |#3| (LIST (QUOTE -909) (QUOTE (-1188))))) (-12 (|HasCategory| |#3| (QUOTE (-1111))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1111))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (|HasCategory| |#3| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#3| (QUOTE (-370))) (-3783 (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (QUOTE (-370))) (|HasCategory| |#3| (QUOTE (-1060)))) (-3783 (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (QUOTE (-370)))) (|HasCategory| |#3| (QUOTE (-1060))) (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (QUOTE (-801))) (-3783 (|HasCategory| |#3| (QUOTE (-801))) (|HasCategory| |#3| (QUOTE (-856)))) (|HasCategory| |#3| (QUOTE (-856))) (|HasCategory| |#3| (QUOTE (-734))) (-3783 (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (QUOTE (-1060)))) (|HasCategory| |#3| (QUOTE (-375))) (|HasCategory| |#3| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#3| (LIST (QUOTE -909) (QUOTE (-1188)))) (-3783 (|HasCategory| |#3| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#3| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (QUOTE (-132))) (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (QUOTE (-237))) (|HasCategory| |#3| (QUOTE (-370))) (|HasCategory| |#3| (QUOTE (-1060)))) (-3783 (|HasCategory| |#3| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#3| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#3| (QUOTE (-132))) (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (QUOTE (-237))) (|HasCategory| |#3| (QUOTE (-370))) (|HasCategory| |#3| (QUOTE (-1060)))) (-3783 (|HasCategory| |#3| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#3| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (QUOTE (-237))) (|HasCategory| |#3| (QUOTE (-370))) (|HasCategory| |#3| (QUOTE (-1060)))) (-3783 (|HasCategory| |#3| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#3| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (QUOTE (-237))) (|HasCategory| |#3| (QUOTE (-1060)))) (|HasCategory| |#3| (QUOTE (-237))) (-3783 (|HasCategory| |#3| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#3| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (QUOTE (-132))) (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (QUOTE (-237))) (|HasCategory| |#3| (QUOTE (-370))) (|HasCategory| |#3| (QUOTE (-375))) (|HasCategory| |#3| (QUOTE (-734))) (|HasCategory| |#3| (QUOTE (-801))) (|HasCategory| |#3| (QUOTE (-856))) (|HasCategory| |#3| (QUOTE (-1060))) (|HasCategory| |#3| (QUOTE (-1111)))) (|HasCategory| |#3| (QUOTE (-1111))) (-3783 (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (LIST (QUOTE -909) (QUOTE (-1188))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (QUOTE (-25)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (QUOTE (-132)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (QUOTE (-174)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (QUOTE (-237)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (QUOTE (-370)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (QUOTE (-375)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (QUOTE (-734)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (QUOTE (-801)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (QUOTE (-856)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (QUOTE (-1060)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (QUOTE (-1111))))) (-3783 (-12 (|HasCategory| |#3| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-132))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-237))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-370))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-375))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-734))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-801))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-856))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (|HasCategory| |#3| (QUOTE (-1060))) (-12 (|HasCategory| |#3| (QUOTE (-1111))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572)))))) (-3783 (-12 (|HasCategory| |#3| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-132))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-237))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-370))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-375))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-734))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-801))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-856))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-1060))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-1111))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572)))))) (|HasCategory| (-572) (QUOTE (-858))) (-12 (|HasCategory| |#3| (QUOTE (-1060))) (|HasCategory| |#3| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-237))) (|HasCategory| |#3| (QUOTE (-1060)))) (-12 (|HasCategory| |#3| (QUOTE (-1060))) (|HasCategory| |#3| (LIST (QUOTE -909) (QUOTE (-1188))))) (-3783 (|HasCategory| |#3| (QUOTE (-1060))) (-12 (|HasCategory| |#3| (QUOTE (-1111))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572)))))) (-12 (|HasCategory| |#3| (QUOTE (-1111))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (QUOTE (-1111)))) (|HasAttribute| |#3| (QUOTE -4451)) (|HasCategory| |#3| (QUOTE (-132))) (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| |#3| (QUOTE (-1111))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|))))) +((-2813 (-12 (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-132))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-237))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-370))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-375))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-734))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-801))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-856))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1060))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1111))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|))) (|HasCategory| |#3| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|))) (|HasCategory| |#3| (LIST (QUOTE -909) (QUOTE (-1188)))))) (-2813 (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (QUOTE (-1111)))) (-12 (|HasCategory| |#3| (QUOTE (-237))) (|HasCategory| |#3| (QUOTE (-1060)))) (-12 (|HasCategory| |#3| (QUOTE (-1060))) (|HasCategory| |#3| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-1060))) (|HasCategory| |#3| (LIST (QUOTE -909) (QUOTE (-1188))))) (-12 (|HasCategory| |#3| (QUOTE (-1111))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1111))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (|HasCategory| |#3| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#3| (QUOTE (-370))) (-2813 (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (QUOTE (-370))) (|HasCategory| |#3| (QUOTE (-1060)))) (-2813 (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (QUOTE (-370)))) (|HasCategory| |#3| (QUOTE (-1060))) (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (QUOTE (-801))) (-2813 (|HasCategory| |#3| (QUOTE (-801))) (|HasCategory| |#3| (QUOTE (-856)))) (|HasCategory| |#3| (QUOTE (-856))) (|HasCategory| |#3| (QUOTE (-734))) (-2813 (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (QUOTE (-1060)))) (|HasCategory| |#3| (QUOTE (-375))) (|HasCategory| |#3| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#3| (LIST (QUOTE -909) (QUOTE (-1188)))) (-2813 (|HasCategory| |#3| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#3| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (QUOTE (-132))) (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (QUOTE (-237))) (|HasCategory| |#3| (QUOTE (-370))) (|HasCategory| |#3| (QUOTE (-1060)))) (-2813 (|HasCategory| |#3| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#3| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#3| (QUOTE (-132))) (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (QUOTE (-237))) (|HasCategory| |#3| (QUOTE (-370))) (|HasCategory| |#3| (QUOTE (-1060)))) (-2813 (|HasCategory| |#3| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#3| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (QUOTE (-237))) (|HasCategory| |#3| (QUOTE (-370))) (|HasCategory| |#3| (QUOTE (-1060)))) (-2813 (|HasCategory| |#3| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#3| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (QUOTE (-237))) (|HasCategory| |#3| (QUOTE (-1060)))) (|HasCategory| |#3| (QUOTE (-237))) (-2813 (|HasCategory| |#3| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#3| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (QUOTE (-132))) (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (QUOTE (-237))) (|HasCategory| |#3| (QUOTE (-370))) (|HasCategory| |#3| (QUOTE (-375))) (|HasCategory| |#3| (QUOTE (-734))) (|HasCategory| |#3| (QUOTE (-801))) (|HasCategory| |#3| (QUOTE (-856))) (|HasCategory| |#3| (QUOTE (-1060))) (|HasCategory| |#3| (QUOTE (-1111)))) (|HasCategory| |#3| (QUOTE (-1111))) (-2813 (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (LIST (QUOTE -909) (QUOTE (-1188))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (QUOTE (-25)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (QUOTE (-132)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (QUOTE (-174)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (QUOTE (-237)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (QUOTE (-370)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (QUOTE (-375)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (QUOTE (-734)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (QUOTE (-801)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (QUOTE (-856)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (QUOTE (-1060)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (QUOTE (-1111))))) (-2813 (-12 (|HasCategory| |#3| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-132))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-237))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-370))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-375))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-734))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-801))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-856))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (|HasCategory| |#3| (QUOTE (-1060))) (-12 (|HasCategory| |#3| (QUOTE (-1111))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572)))))) (-2813 (-12 (|HasCategory| |#3| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-132))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-174))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-237))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-370))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-375))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-734))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-801))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-856))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-1060))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-1111))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572)))))) (|HasCategory| (-572) (QUOTE (-858))) (-12 (|HasCategory| |#3| (QUOTE (-1060))) (|HasCategory| |#3| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (QUOTE (-237))) (|HasCategory| |#3| (QUOTE (-1060)))) (-12 (|HasCategory| |#3| (QUOTE (-1060))) (|HasCategory| |#3| (LIST (QUOTE -909) (QUOTE (-1188))))) (-2813 (|HasCategory| |#3| (QUOTE (-1060))) (-12 (|HasCategory| |#3| (QUOTE (-1111))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572)))))) (-12 (|HasCategory| |#3| (QUOTE (-1111))) (|HasCategory| |#3| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#3| (QUOTE (-1111)))) (|HasAttribute| |#3| (QUOTE -4451)) (|HasCategory| |#3| (QUOTE (-132))) (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| |#3| (QUOTE (-1111))) (|HasCategory| |#3| (LIST (QUOTE -315) (|devaluate| |#3|))))) (-1125 R |x|) ((|constructor| (NIL "This package produces functions for counting etc. real roots of univariate polynomials in \\spad{x} over \\spad{R},{} which must be an OrderedIntegralDomain")) (|countRealRootsMultiple| (((|Integer|) (|UnivariatePolynomial| |#2| |#1|)) "\\spad{countRealRootsMultiple(p)} says how many real roots \\spad{p} has,{} counted with multiplicity")) (|SturmHabichtMultiple| (((|Integer|) (|UnivariatePolynomial| |#2| |#1|) (|UnivariatePolynomial| |#2| |#1|)) "\\spad{SturmHabichtMultiple(p1,p2)} computes \\spad{c_}{+}\\spad{-c_}{-} where \\spad{c_}{+} is the number of real roots of \\spad{p1} with p2>0 and \\spad{c_}{-} is the number of real roots of \\spad{p1} with p2<0. If p2=1 what you get is the number of real roots of \\spad{p1}.")) (|countRealRoots| (((|Integer|) (|UnivariatePolynomial| |#2| |#1|)) "\\spad{countRealRoots(p)} says how many real roots \\spad{p} has")) (|SturmHabicht| (((|Integer|) (|UnivariatePolynomial| |#2| |#1|) (|UnivariatePolynomial| |#2| |#1|)) "\\spad{SturmHabicht(p1,p2)} computes \\spad{c_}{+}\\spad{-c_}{-} where \\spad{c_}{+} is the number of real roots of \\spad{p1} with p2>0 and \\spad{c_}{-} is the number of real roots of \\spad{p1} with p2<0. If p2=1 what you get is the number of real roots of \\spad{p1}.")) (|SturmHabichtCoefficients| (((|List| |#1|) (|UnivariatePolynomial| |#2| |#1|) (|UnivariatePolynomial| |#2| |#1|)) "\\spad{SturmHabichtCoefficients(p1,p2)} computes the principal Sturm-Habicht coefficients of \\spad{p1} and \\spad{p2}")) (|SturmHabichtSequence| (((|List| (|UnivariatePolynomial| |#2| |#1|)) (|UnivariatePolynomial| |#2| |#1|) (|UnivariatePolynomial| |#2| |#1|)) "\\spad{SturmHabichtSequence(p1,p2)} computes the Sturm-Habicht sequence of \\spad{p1} and \\spad{p2}")) (|subresultantSequence| (((|List| (|UnivariatePolynomial| |#2| |#1|)) (|UnivariatePolynomial| |#2| |#1|) (|UnivariatePolynomial| |#2| |#1|)) "\\spad{subresultantSequence(p1,p2)} computes the (standard) subresultant sequence of \\spad{p1} and \\spad{p2}"))) NIL @@ -4436,7 +4436,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 -(-1127 R -3636) +(-1127 R -1384) ((|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 @@ -4475,16 +4475,16 @@ NIL (-1136 R |VarSet|) ((|constructor| (NIL "\\indented{2}{This type is the basic representation of sparse recursive multivariate} polynomials. It is parameterized by the coefficient ring and the variable set which may be infinite. The variable ordering is determined by the variable set parameter. The coefficient ring may be non-commutative,{} but the variables are assumed to commute."))) (((-4456 "*") |has| |#1| (-174)) (-4447 |has| |#1| (-564)) (-4452 |has| |#1| (-6 -4452)) (-4449 . T) (-4448 . T) (-4451 . T)) -((|HasCategory| |#1| (QUOTE (-918))) (-3783 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-918)))) (-3783 (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-918)))) (-3783 (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-918)))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-174))) (-3783 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| |#2| (LIST (QUOTE -895) (QUOTE (-386))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -895) (QUOTE (-572))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| |#2| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#2| (LIST (QUOTE -622) (QUOTE (-544))))) (|HasCategory| |#1| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))) (-3783 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572)))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-370))) (|HasAttribute| |#1| (QUOTE -4452)) (|HasCategory| |#1| (QUOTE (-460))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-918)))) (-3783 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-918)))) (|HasCategory| |#1| (QUOTE (-146))))) +((|HasCategory| |#1| (QUOTE (-918))) (-2813 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-918)))) (-2813 (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-918)))) (-2813 (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-918)))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-174))) (-2813 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| |#2| (LIST (QUOTE -895) (QUOTE (-386))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -895) (QUOTE (-572))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| |#2| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#2| (LIST (QUOTE -622) (QUOTE (-544))))) (|HasCategory| |#1| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))) (-2813 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572)))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-370))) (|HasAttribute| |#1| (QUOTE -4452)) (|HasCategory| |#1| (QUOTE (-460))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-918)))) (-2813 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-918)))) (|HasCategory| |#1| (QUOTE (-146))))) (-1137 |Coef| |Var| SMP) ((|constructor| (NIL "This domain provides multivariate Taylor series with variables from an arbitrary ordered set. A Taylor series is represented by a stream of polynomials from the polynomial domain \\spad{SMP}. The \\spad{n}th element of the stream is a form of degree \\spad{n}. SMTS is an internal domain.")) (|fintegrate| (($ (|Mapping| $) |#2| |#1|) "\\spad{fintegrate(f,v,c)} is the integral of \\spad{f()} with respect \\indented{1}{to \\spad{v} and having \\spad{c} as the constant of integration.} \\indented{1}{The evaluation of \\spad{f()} is delayed.}")) (|integrate| (($ $ |#2| |#1|) "\\spad{integrate(s,v,c)} is the integral of \\spad{s} with respect \\indented{1}{to \\spad{v} and having \\spad{c} as the constant of integration.}")) (|csubst| (((|Mapping| (|Stream| |#3|) |#3|) (|List| |#2|) (|List| (|Stream| |#3|))) "\\spad{csubst(a,b)} is for internal use only")) (* (($ |#3| $) "\\spad{smp*ts} multiplies a TaylorSeries by a monomial \\spad{SMP}.")) (|coerce| (($ |#3|) "\\spad{coerce(poly)} regroups the terms by total degree and forms a series.") (($ |#2|) "\\spad{coerce(var)} converts a variable to a Taylor series")) (|coefficient| ((|#3| $ (|NonNegativeInteger|)) "\\spad{coefficient(s, n)} gives the terms of total degree \\spad{n}."))) (((-4456 "*") |has| |#1| (-174)) (-4447 |has| |#1| (-564)) (-4449 . T) (-4448 . T) (-4451 . T)) -((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-146))) (-3783 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564)))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-370)))) +((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-146))) (-2813 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564)))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-370)))) (-1138 R E V P) ((|constructor| (NIL "The category of square-free and normalized triangular sets. Thus,{} up to the primitivity axiom of [1],{} these sets are Lazard triangular sets.\\newline References : \\indented{1}{[1] \\spad{D}. LAZARD \"A new method for solving algebraic systems of} \\indented{5}{positive dimension\" Discr. App. Math. 33:147-160,{}1991}"))) ((-4455 . T) (-4454 . T)) NIL -(-1139 UP -3636) +(-1139 UP -1384) ((|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 @@ -4539,11 +4539,11 @@ NIL (-1152 V C) ((|constructor| (NIL "This domain exports a modest implementation of splitting trees. Spliiting trees are needed when the evaluation of some quantity under some hypothesis requires to split the hypothesis into sub-cases. For instance by adding some new hypothesis on one hand and its negation on another hand. The computations are terminated is a splitting tree \\axiom{a} when \\axiom{status(value(a))} is \\axiom{\\spad{true}}. Thus,{} if for the splitting tree \\axiom{a} the flag \\axiom{status(value(a))} is \\axiom{\\spad{true}},{} then \\axiom{status(value(\\spad{d}))} is \\axiom{\\spad{true}} for any subtree \\axiom{\\spad{d}} of \\axiom{a}. This property of splitting trees is called the termination condition. If no vertex in a splitting tree \\axiom{a} is equal to another,{} \\axiom{a} is said to satisfy the no-duplicates condition. The splitting tree \\axiom{a} will satisfy this condition if nodes are added to \\axiom{a} by mean of \\axiom{splitNodeOf!} and if \\axiom{construct} is only used to create the root of \\axiom{a} with no children.")) (|splitNodeOf!| (($ $ $ (|List| (|SplittingNode| |#1| |#2|)) (|Mapping| (|Boolean|) |#2| |#2|)) "\\axiom{splitNodeOf!(\\spad{l},{}a,{}\\spad{ls},{}sub?)} returns \\axiom{a} where the children list of \\axiom{\\spad{l}} has been set to \\axiom{[[\\spad{s}]\\$\\% for \\spad{s} in \\spad{ls} | not subNodeOf?(\\spad{s},{}a,{}sub?)]}. Thus,{} if \\axiom{\\spad{l}} is not a node of \\axiom{a},{} this latter splitting tree is unchanged.") (($ $ $ (|List| (|SplittingNode| |#1| |#2|))) "\\axiom{splitNodeOf!(\\spad{l},{}a,{}\\spad{ls})} returns \\axiom{a} where the children list of \\axiom{\\spad{l}} has been set to \\axiom{[[\\spad{s}]\\$\\% for \\spad{s} in \\spad{ls} | not nodeOf?(\\spad{s},{}a)]}. Thus,{} if \\axiom{\\spad{l}} is not a node of \\axiom{a},{} this latter splitting tree is unchanged.")) (|remove!| (($ (|SplittingNode| |#1| |#2|) $) "\\axiom{remove!(\\spad{s},{}a)} replaces a by remove(\\spad{s},{}a)")) (|remove| (($ (|SplittingNode| |#1| |#2|) $) "\\axiom{remove(\\spad{s},{}a)} returns the splitting tree obtained from a by removing every sub-tree \\axiom{\\spad{b}} such that \\axiom{value(\\spad{b})} and \\axiom{\\spad{s}} have the same value,{} condition and status.")) (|subNodeOf?| (((|Boolean|) (|SplittingNode| |#1| |#2|) $ (|Mapping| (|Boolean|) |#2| |#2|)) "\\axiom{subNodeOf?(\\spad{s},{}a,{}sub?)} returns \\spad{true} iff for some node \\axiom{\\spad{n}} in \\axiom{a} we have \\axiom{\\spad{s} = \\spad{n}} or \\axiom{status(\\spad{n})} and \\axiom{subNode?(\\spad{s},{}\\spad{n},{}sub?)}.")) (|nodeOf?| (((|Boolean|) (|SplittingNode| |#1| |#2|) $) "\\axiom{nodeOf?(\\spad{s},{}a)} returns \\spad{true} iff some node of \\axiom{a} is equal to \\axiom{\\spad{s}}")) (|result| (((|List| (|Record| (|:| |val| |#1|) (|:| |tower| |#2|))) $) "\\axiom{result(a)} where \\axiom{\\spad{ls}} is the leaves list of \\axiom{a} returns \\axiom{[[value(\\spad{s}),{}condition(\\spad{s})]\\$\\spad{VT} for \\spad{s} in \\spad{ls}]} if the computations are terminated in \\axiom{a} else an error is produced.")) (|conditions| (((|List| |#2|) $) "\\axiom{conditions(a)} returns the list of the conditions of the leaves of a")) (|construct| (($ |#1| |#2| |#1| (|List| |#2|)) "\\axiom{construct(\\spad{v1},{}\\spad{t},{}\\spad{v2},{}\\spad{lt})} creates a splitting tree with value (\\spadignore{i.e.} root vertex) given by \\axiom{[\\spad{v},{}\\spad{t}]\\$\\spad{S}} and with children list given by \\axiom{[[[\\spad{v},{}\\spad{t}]\\$\\spad{S}]\\$\\% for \\spad{s} in \\spad{ls}]}.") (($ |#1| |#2| (|List| (|SplittingNode| |#1| |#2|))) "\\axiom{construct(\\spad{v},{}\\spad{t},{}\\spad{ls})} creates a splitting tree with value (\\spadignore{i.e.} root vertex) given by \\axiom{[\\spad{v},{}\\spad{t}]\\$\\spad{S}} and with children list given by \\axiom{[[\\spad{s}]\\$\\% for \\spad{s} in \\spad{ls}]}.") (($ |#1| |#2| (|List| $)) "\\axiom{construct(\\spad{v},{}\\spad{t},{}la)} creates a splitting tree with value (\\spadignore{i.e.} root vertex) given by \\axiom{[\\spad{v},{}\\spad{t}]\\$\\spad{S}} and with \\axiom{la} as children list.") (($ (|SplittingNode| |#1| |#2|)) "\\axiom{construct(\\spad{s})} creates a splitting tree with value (\\spadignore{i.e.} root vertex) given by \\axiom{\\spad{s}} and no children. Thus,{} if the status of \\axiom{\\spad{s}} is \\spad{false},{} \\axiom{[\\spad{s}]} represents the starting point of the evaluation \\axiom{value(\\spad{s})} under the hypothesis \\axiom{condition(\\spad{s})}.")) (|updateStatus!| (($ $) "\\axiom{updateStatus!(a)} returns a where the status of the vertices are updated to satisfy the \"termination condition\".")) (|extractSplittingLeaf| (((|Union| $ "failed") $) "\\axiom{extractSplittingLeaf(a)} returns the left most leaf (as a tree) whose status is \\spad{false} if any,{} else \"failed\" is returned."))) ((-4454 . T) (-4455 . T)) -((-12 (|HasCategory| (-1151 |#1| |#2|) (LIST (QUOTE -315) (LIST (QUOTE -1151) (|devaluate| |#1|) (|devaluate| |#2|)))) (|HasCategory| (-1151 |#1| |#2|) (QUOTE (-1111)))) (|HasCategory| (-1151 |#1| |#2|) (QUOTE (-1111))) (-3783 (|HasCategory| (-1151 |#1| |#2|) (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| (-1151 |#1| |#2|) (LIST (QUOTE -315) (LIST (QUOTE -1151) (|devaluate| |#1|) (|devaluate| |#2|)))) (|HasCategory| (-1151 |#1| |#2|) (QUOTE (-1111))))) (|HasCategory| (-1151 |#1| |#2|) (LIST (QUOTE -621) (QUOTE (-870))))) +((-12 (|HasCategory| (-1151 |#1| |#2|) (LIST (QUOTE -315) (LIST (QUOTE -1151) (|devaluate| |#1|) (|devaluate| |#2|)))) (|HasCategory| (-1151 |#1| |#2|) (QUOTE (-1111)))) (|HasCategory| (-1151 |#1| |#2|) (QUOTE (-1111))) (-2813 (|HasCategory| (-1151 |#1| |#2|) (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| (-1151 |#1| |#2|) (LIST (QUOTE -315) (LIST (QUOTE -1151) (|devaluate| |#1|) (|devaluate| |#2|)))) (|HasCategory| (-1151 |#1| |#2|) (QUOTE (-1111))))) (|HasCategory| (-1151 |#1| |#2|) (LIST (QUOTE -621) (QUOTE (-870))))) (-1153 |ndim| R) ((|constructor| (NIL "\\spadtype{SquareMatrix} is a matrix domain of square matrices,{} where the number of rows (= number of columns) is a parameter of the type.")) (|unitsKnown| ((|attribute|) "the invertible matrices are simply the matrices whose determinants are units in the Ring \\spad{R}.")) (|central| ((|attribute|) "the elements of the Ring \\spad{R},{} viewed as diagonal matrices,{} commute with all matrices and,{} indeed,{} are the only matrices which commute with all matrices.")) (|squareMatrix| (($ (|Matrix| |#2|)) "\\spad{squareMatrix(m)} converts a matrix of type \\spadtype{Matrix} to a matrix of type \\spadtype{SquareMatrix}.")) (|transpose| (($ $) "\\spad{transpose(m)} returns the transpose of the matrix \\spad{m}.")) (|new| (($ |#2|) "\\spad{new(c)} constructs a new \\spadtype{SquareMatrix} object of dimension \\spad{ndim} with initial entries equal to \\spad{c}."))) ((-4451 . T) (-4443 |has| |#2| (-6 (-4456 "*"))) (-4454 . T) (-4448 . T) (-4449 . T)) -((|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (QUOTE (-237))) (|HasAttribute| |#2| (QUOTE (-4456 "*"))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572)))) (-3783 (-12 (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))))) (|HasCategory| |#2| (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#2| (QUOTE (-313))) (|HasCategory| |#2| (QUOTE (-564))) (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (QUOTE (-370))) (-3783 (|HasAttribute| |#2| (QUOTE (-4456 "*"))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (QUOTE (-237)))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (|HasCategory| |#2| (QUOTE (-174)))) +((|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (QUOTE (-237))) (|HasAttribute| |#2| (QUOTE (-4456 "*"))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572)))) (-2813 (-12 (|HasCategory| |#2| (QUOTE (-237))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))))) (|HasCategory| |#2| (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#2| (QUOTE (-313))) (|HasCategory| |#2| (QUOTE (-564))) (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (QUOTE (-370))) (-2813 (|HasAttribute| |#2| (QUOTE (-4456 "*"))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (QUOTE (-237)))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (|HasCategory| |#2| (QUOTE (-174)))) (-1154 S) ((|constructor| (NIL "A string aggregate is a category for strings,{} that is,{} one dimensional arrays of characters.")) (|elt| (($ $ $) "\\spad{elt(s,t)} returns the concatenation of \\spad{s} and \\spad{t}. It is provided to allow juxtaposition of strings to work as concatenation. For example,{} \\axiom{\"smoo\" \"shed\"} returns \\axiom{\"smooshed\"}.")) (|rightTrim| (($ $ (|CharacterClass|)) "\\spad{rightTrim(s,cc)} returns \\spad{s} with all trailing occurences of characters in \\spad{cc} deleted. For example,{} \\axiom{rightTrim(\"(abc)\",{} charClass \"()\")} returns \\axiom{\"(abc\"}.") (($ $ (|Character|)) "\\spad{rightTrim(s,c)} returns \\spad{s} with all trailing occurrences of \\spad{c} deleted. For example,{} \\axiom{rightTrim(\" abc \",{} char \" \")} returns \\axiom{\" abc\"}.")) (|leftTrim| (($ $ (|CharacterClass|)) "\\spad{leftTrim(s,cc)} returns \\spad{s} with all leading characters in \\spad{cc} deleted. For example,{} \\axiom{leftTrim(\"(abc)\",{} charClass \"()\")} returns \\axiom{\"abc)\"}.") (($ $ (|Character|)) "\\spad{leftTrim(s,c)} returns \\spad{s} with all leading characters \\spad{c} deleted. For example,{} \\axiom{leftTrim(\" abc \",{} char \" \")} returns \\axiom{\"abc \"}.")) (|trim| (($ $ (|CharacterClass|)) "\\spad{trim(s,cc)} returns \\spad{s} with all characters in \\spad{cc} deleted from right and left ends. For example,{} \\axiom{trim(\"(abc)\",{} charClass \"()\")} returns \\axiom{\"abc\"}.") (($ $ (|Character|)) "\\spad{trim(s,c)} returns \\spad{s} with all characters \\spad{c} deleted from right and left ends. For example,{} \\axiom{trim(\" abc \",{} char \" \")} returns \\axiom{\"abc\"}.")) (|split| (((|List| $) $ (|CharacterClass|)) "\\spad{split(s,cc)} returns a list of substrings delimited by characters in \\spad{cc}.") (((|List| $) $ (|Character|)) "\\spad{split(s,c)} returns a list of substrings delimited by character \\spad{c}.")) (|coerce| (($ (|Character|)) "\\spad{coerce(c)} returns \\spad{c} as a string \\spad{s} with the character \\spad{c}.")) (|position| (((|Integer|) (|CharacterClass|) $ (|Integer|)) "\\spad{position(cc,t,i)} returns the position \\axiom{\\spad{j} \\spad{>=} \\spad{i}} in \\spad{t} of the first character belonging to \\spad{cc}.") (((|Integer|) $ $ (|Integer|)) "\\spad{position(s,t,i)} returns the position \\spad{j} of the substring \\spad{s} in string \\spad{t},{} where \\axiom{\\spad{j} \\spad{>=} \\spad{i}} is required.")) (|replace| (($ $ (|UniversalSegment| (|Integer|)) $) "\\spad{replace(s,i..j,t)} replaces the substring \\axiom{\\spad{s}(\\spad{i}..\\spad{j})} of \\spad{s} by string \\spad{t}.")) (|match?| (((|Boolean|) $ $ (|Character|)) "\\spad{match?(s,t,c)} tests if \\spad{s} matches \\spad{t} except perhaps for multiple and consecutive occurrences of character \\spad{c}. Typically \\spad{c} is the blank character.")) (|match| (((|NonNegativeInteger|) $ $ (|Character|)) "\\spad{match(p,s,wc)} tests if pattern \\axiom{\\spad{p}} matches subject \\axiom{\\spad{s}} where \\axiom{\\spad{wc}} is a wild card character. If no match occurs,{} the index \\axiom{0} is returned; otheriwse,{} the value returned is the first index of the first character in the subject matching the subject (excluding that matched by an initial wild-card). For example,{} \\axiom{match(\"*to*\",{}\"yorktown\",{}\\spad{\"*\"})} returns \\axiom{5} indicating a successful match starting at index \\axiom{5} of \\axiom{\"yorktown\"}.")) (|substring?| (((|Boolean|) $ $ (|Integer|)) "\\spad{substring?(s,t,i)} tests if \\spad{s} is a substring of \\spad{t} beginning at index \\spad{i}. Note: \\axiom{substring?(\\spad{s},{}\\spad{t},{}0) = prefix?(\\spad{s},{}\\spad{t})}.")) (|suffix?| (((|Boolean|) $ $) "\\spad{suffix?(s,t)} tests if the string \\spad{s} is the final substring of \\spad{t}. Note: \\axiom{suffix?(\\spad{s},{}\\spad{t}) \\spad{==} reduce(and,{}[\\spad{s}.\\spad{i} = \\spad{t}.(\\spad{n} - \\spad{m} + \\spad{i}) for \\spad{i} in 0..maxIndex \\spad{s}])} where \\spad{m} and \\spad{n} denote the maxIndex of \\spad{s} and \\spad{t} respectively.")) (|prefix?| (((|Boolean|) $ $) "\\spad{prefix?(s,t)} tests if the string \\spad{s} is the initial substring of \\spad{t}. Note: \\axiom{prefix?(\\spad{s},{}\\spad{t}) \\spad{==} reduce(and,{}[\\spad{s}.\\spad{i} = \\spad{t}.\\spad{i} for \\spad{i} in 0..maxIndex \\spad{s}])}.")) (|upperCase!| (($ $) "\\spad{upperCase!(s)} destructively replaces the alphabetic characters in \\spad{s} by upper case characters.")) (|upperCase| (($ $) "\\spad{upperCase(s)} returns the string with all characters in upper case.")) (|lowerCase!| (($ $) "\\spad{lowerCase!(s)} destructively replaces the alphabetic characters in \\spad{s} by lower case.")) (|lowerCase| (($ $) "\\spad{lowerCase(s)} returns the string with all characters in lower case."))) NIL @@ -4563,7 +4563,7 @@ NIL (-1158 S) ((|constructor| (NIL "Linked List implementation of a Stack")) (|stack| (($ (|List| |#1|)) "\\spad{stack([x,y,...,z])} creates a stack with first (top) element \\spad{x},{} second element \\spad{y},{}...,{}and last element \\spad{z}."))) ((-4454 . T) (-4455 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1111))) (-3783 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) +((-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1111))) (-2813 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (-1159 A S) ((|constructor| (NIL "A stream aggregate is a linear aggregate which possibly has an infinite number of elements. A basic domain constructor which builds stream aggregates is \\spadtype{Stream}. From streams,{} a number of infinite structures such power series can be built. A stream aggregate may also be infinite since it may be cyclic. For example,{} see \\spadtype{DecimalExpansion}.")) (|possiblyInfinite?| (((|Boolean|) $) "\\spad{possiblyInfinite?(s)} tests if the stream \\spad{s} could possibly have an infinite number of elements. Note: for many datatypes,{} \\axiom{possiblyInfinite?(\\spad{s}) = not explictlyFinite?(\\spad{s})}.")) (|explicitlyFinite?| (((|Boolean|) $) "\\spad{explicitlyFinite?(s)} tests if the stream has a finite number of elements,{} and \\spad{false} otherwise. Note: for many datatypes,{} \\axiom{explicitlyFinite?(\\spad{s}) = not possiblyInfinite?(\\spad{s})}."))) NIL @@ -4575,7 +4575,7 @@ NIL (-1161 |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."))) ((-4455 . T)) -((-12 (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (QUOTE (-1111))) (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (LIST (QUOTE -315) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -1640) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3763) (|devaluate| |#2|)))))) (-3783 (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (QUOTE (-1111))) (|HasCategory| |#2| (QUOTE (-1111)))) (-3783 (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (QUOTE (-1111))) (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (LIST (QUOTE -622) (QUOTE (-544)))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (|HasCategory| |#1| (QUOTE (-858))) (-3783 (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (QUOTE (-1111)))) +((-12 (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (QUOTE (-1111))) (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (LIST (QUOTE -315) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -3690) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -1907) (|devaluate| |#2|)))))) (-2813 (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (QUOTE (-1111))) (|HasCategory| |#2| (QUOTE (-1111)))) (-2813 (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (QUOTE (-1111))) (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (LIST (QUOTE -622) (QUOTE (-544)))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (|HasCategory| |#1| (QUOTE (-858))) (-2813 (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (QUOTE (-1111)))) (-1162) ((|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 @@ -4603,7 +4603,7 @@ NIL (-1168 S) ((|constructor| (NIL "A stream is an implementation of an infinite sequence using a list of terms that have been computed and a function closure to compute additional terms when needed.")) (|filterUntil| (($ (|Mapping| (|Boolean|) |#1|) $) "\\spad{filterUntil(p,s)} returns \\spad{[x0,x1,...,x(n)]} where \\spad{s = [x0,x1,x2,..]} and \\spad{n} is the smallest index such that \\spad{p(xn) = true}.")) (|filterWhile| (($ (|Mapping| (|Boolean|) |#1|) $) "\\spad{filterWhile(p,s)} returns \\spad{[x0,x1,...,x(n-1)]} where \\spad{s = [x0,x1,x2,..]} and \\spad{n} is the smallest index such that \\spad{p(xn) = false}.")) (|generate| (($ (|Mapping| |#1| |#1|) |#1|) "\\spad{generate(f,x)} creates an infinite stream whose first element is \\spad{x} and whose \\spad{n}th element (\\spad{n > 1}) is \\spad{f} applied to the previous element. Note: \\spad{generate(f,x) = [x,f(x),f(f(x)),...]}.") (($ (|Mapping| |#1|)) "\\spad{generate(f)} creates an infinite stream all of whose elements are equal to \\spad{f()}. Note: \\spad{generate(f) = [f(),f(),f(),...]}.")) (|setrest!| (($ $ (|Integer|) $) "\\spad{setrest!(x,n,y)} sets rest(\\spad{x},{}\\spad{n}) to \\spad{y}. The function will expand cycles if necessary.")) (|showAll?| (((|Boolean|)) "\\spad{showAll?()} returns \\spad{true} if all computed entries of streams will be displayed.")) (|showAllElements| (((|OutputForm|) $) "\\spad{showAllElements(s)} creates an output form which displays all computed elements.")) (|output| (((|Void|) (|Integer|) $) "\\spad{output(n,st)} computes and displays the first \\spad{n} entries of \\spad{st}.")) (|cons| (($ |#1| $) "\\spad{cons(a,s)} returns a stream whose \\spad{first} is \\spad{a} and whose \\spad{rest} is \\spad{s}. Note: \\spad{cons(a,s) = concat(a,s)}.")) (|delay| (($ (|Mapping| $)) "\\spad{delay(f)} creates a stream with a lazy evaluation defined by function \\spad{f}. Caution: This function can only be called in compiled code.")) (|findCycle| (((|Record| (|:| |cycle?| (|Boolean|)) (|:| |prefix| (|NonNegativeInteger|)) (|:| |period| (|NonNegativeInteger|))) (|NonNegativeInteger|) $) "\\spad{findCycle(n,st)} determines if \\spad{st} is periodic within \\spad{n}.")) (|repeating?| (((|Boolean|) (|List| |#1|) $) "\\spad{repeating?(l,s)} returns \\spad{true} if a stream \\spad{s} is periodic with period \\spad{l},{} and \\spad{false} otherwise.")) (|repeating| (($ (|List| |#1|)) "\\spad{repeating(l)} is a repeating stream whose period is the list \\spad{l}.")) (|shallowlyMutable| ((|attribute|) "one may destructively alter a stream by assigning new values to its entries."))) ((-4455 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1111))) (-3783 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| (-572) (QUOTE (-858))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) +((-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1111))) (-2813 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| (-572) (QUOTE (-858))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (-1169) ((|constructor| (NIL "A category for string-like objects")) (|string| (($ (|Integer|)) "\\spad{string(i)} returns the decimal representation of \\spad{i} in a string"))) ((-4455 . T) (-4454 . T)) @@ -4611,11 +4611,11 @@ NIL (-1170) NIL ((-4455 . T) (-4454 . T)) -((-3783 (-12 (|HasCategory| (-145) (QUOTE (-858))) (|HasCategory| (-145) (LIST (QUOTE -315) (QUOTE (-145))))) (-12 (|HasCategory| (-145) (QUOTE (-1111))) (|HasCategory| (-145) (LIST (QUOTE -315) (QUOTE (-145)))))) (|HasCategory| (-145) (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| (-145) (QUOTE (-858))) (|HasCategory| (-572) (QUOTE (-858))) (|HasCategory| (-145) (QUOTE (-1111))) (|HasCategory| (-145) (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| (-145) (QUOTE (-1111))) (|HasCategory| (-145) (LIST (QUOTE -315) (QUOTE (-145)))))) +((-2813 (-12 (|HasCategory| (-145) (QUOTE (-858))) (|HasCategory| (-145) (LIST (QUOTE -315) (QUOTE (-145))))) (-12 (|HasCategory| (-145) (QUOTE (-1111))) (|HasCategory| (-145) (LIST (QUOTE -315) (QUOTE (-145)))))) (|HasCategory| (-145) (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| (-145) (QUOTE (-858))) (|HasCategory| (-572) (QUOTE (-858))) (|HasCategory| (-145) (QUOTE (-1111))) (|HasCategory| (-145) (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| (-145) (QUOTE (-1111))) (|HasCategory| (-145) (LIST (QUOTE -315) (QUOTE (-145)))))) (-1171 |Entry|) ((|constructor| (NIL "This domain provides tables where the keys are strings. A specialized hash function for strings is used."))) ((-4454 . T) (-4455 . T)) -((-12 (|HasCategory| (-2 (|:| -1640 (-1170)) (|:| -3763 |#1|)) (QUOTE (-1111))) (|HasCategory| (-2 (|:| -1640 (-1170)) (|:| -3763 |#1|)) (LIST (QUOTE -315) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -1640) (QUOTE (-1170))) (LIST (QUOTE |:|) (QUOTE -3763) (|devaluate| |#1|)))))) (-3783 (|HasCategory| (-2 (|:| -1640 (-1170)) (|:| -3763 |#1|)) (QUOTE (-1111))) (|HasCategory| |#1| (QUOTE (-1111)))) (-3783 (|HasCategory| (-2 (|:| -1640 (-1170)) (|:| -3763 |#1|)) (QUOTE (-1111))) (|HasCategory| (-2 (|:| -1640 (-1170)) (|:| -3763 |#1|)) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| (-2 (|:| -1640 (-1170)) (|:| -3763 |#1|)) (LIST (QUOTE -622) (QUOTE (-544)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| (-2 (|:| -1640 (-1170)) (|:| -3763 |#1|)) (QUOTE (-1111))) (|HasCategory| (-1170) (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-1111))) (-3783 (|HasCategory| (-2 (|:| -1640 (-1170)) (|:| -3763 |#1|)) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| (-2 (|:| -1640 (-1170)) (|:| -3763 |#1|)) (LIST (QUOTE -621) (QUOTE (-870))))) +((-12 (|HasCategory| (-2 (|:| -3690 (-1170)) (|:| -1907 |#1|)) (QUOTE (-1111))) (|HasCategory| (-2 (|:| -3690 (-1170)) (|:| -1907 |#1|)) (LIST (QUOTE -315) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -3690) (QUOTE (-1170))) (LIST (QUOTE |:|) (QUOTE -1907) (|devaluate| |#1|)))))) (-2813 (|HasCategory| (-2 (|:| -3690 (-1170)) (|:| -1907 |#1|)) (QUOTE (-1111))) (|HasCategory| |#1| (QUOTE (-1111)))) (-2813 (|HasCategory| (-2 (|:| -3690 (-1170)) (|:| -1907 |#1|)) (QUOTE (-1111))) (|HasCategory| (-2 (|:| -3690 (-1170)) (|:| -1907 |#1|)) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| (-2 (|:| -3690 (-1170)) (|:| -1907 |#1|)) (LIST (QUOTE -622) (QUOTE (-544)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| (-2 (|:| -3690 (-1170)) (|:| -1907 |#1|)) (QUOTE (-1111))) (|HasCategory| (-1170) (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-1111))) (-2813 (|HasCategory| (-2 (|:| -3690 (-1170)) (|:| -1907 |#1|)) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| (-2 (|:| -3690 (-1170)) (|:| -1907 |#1|)) (LIST (QUOTE -621) (QUOTE (-870))))) (-1172 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 @@ -4646,9 +4646,9 @@ NIL NIL (-1179 |Coef| |var| |cen|) ((|constructor| (NIL "Sparse Laurent series in one variable \\indented{2}{\\spadtype{SparseUnivariateLaurentSeries} is a domain representing Laurent} \\indented{2}{series in one variable with coefficients in an arbitrary ring.\\space{2}The} \\indented{2}{parameters of the type specify the coefficient ring,{} the power series} \\indented{2}{variable,{} and the center of the power series expansion.\\space{2}For example,{}} \\indented{2}{\\spad{SparseUnivariateLaurentSeries(Integer,x,3)} represents Laurent} \\indented{2}{series in \\spad{(x - 3)} with integer coefficients.}")) (|integrate| (($ $ (|Variable| |#2|)) "\\spad{integrate(f(x))} returns an anti-derivative of the power series \\spad{f(x)} with constant coefficient 0. We may integrate a series when we can divide coefficients by integers.")) (|differentiate| (($ $ (|Variable| |#2|)) "\\spad{differentiate(f(x),x)} returns the derivative of \\spad{f(x)} with respect to \\spad{x}.")) (|coerce| (($ (|Variable| |#2|)) "\\spad{coerce(var)} converts the series variable \\spad{var} into a Laurent series."))) -(((-4456 "*") -3783 (-3804 (|has| |#1| (-370)) (|has| (-1186 |#1| |#2| |#3|) (-828))) (|has| |#1| (-174)) (-3804 (|has| |#1| (-370)) (|has| (-1186 |#1| |#2| |#3|) (-918)))) (-4447 -3783 (-3804 (|has| |#1| (-370)) (|has| (-1186 |#1| |#2| |#3|) (-828))) (|has| |#1| (-564)) (-3804 (|has| |#1| (-370)) (|has| (-1186 |#1| |#2| |#3|) (-918)))) (-4452 |has| |#1| (-370)) (-4446 |has| |#1| (-370)) (-4448 . T) (-4449 . T) (-4451 . T)) -((-3783 (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-828))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-918))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-1033))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-1163))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (LIST (QUOTE -292) (LIST (QUOTE -1186) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1186) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (LIST (QUOTE -315) (LIST (QUOTE -1186) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (LIST (QUOTE -522) (QUOTE (-1188)) (LIST (QUOTE -1186) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (LIST (QUOTE -1049) (QUOTE (-1188)))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572)))))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-174))) (-3783 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564)))) (-3783 (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (QUOTE (-146)))) (-3783 (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (QUOTE (-148)))) (-3783 (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-572)) (|devaluate| |#1|)))))) (-3783 (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-237))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-572)) (|devaluate| |#1|))))) (|HasCategory| (-572) (QUOTE (-1123))) (-3783 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-564)))) (|HasCategory| |#1| (QUOTE (-370))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-918))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (LIST (QUOTE -1049) (QUOTE (-1188)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-1033))) (|HasCategory| |#1| (QUOTE (-370)))) (-3783 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-564)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-828))) (|HasCategory| |#1| (QUOTE (-370)))) (-3783 (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-828))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-370))))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-1163))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (LIST (QUOTE -292) (LIST (QUOTE -1186) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1186) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (LIST (QUOTE -315) (LIST (QUOTE -1186) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (LIST (QUOTE -522) (QUOTE (-1188)) (LIST (QUOTE -1186) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-572))))) (|HasSignature| |#1| (LIST (QUOTE -3491) (LIST (|devaluate| |#1|) (QUOTE (-1188)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-572))))) (-3783 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-968))) (|HasCategory| |#1| (QUOTE (-1214))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasSignature| |#1| (LIST (QUOTE -3270) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1188))))) (|HasSignature| |#1| (LIST (QUOTE -2221) (LIST (LIST (QUOTE -652) (QUOTE (-1188))) (|devaluate| |#1|)))))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-553))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-313))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-918))) (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-146))) (-3783 (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-828))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-918))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (QUOTE (-564)))) (-3783 (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572)))))) (-3783 (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-828))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-918))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (QUOTE (-174)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-918))) (|HasCategory| |#1| (QUOTE (-370)))) (-3783 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-918))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (QUOTE (-146))))) -(-1180 R -3636) +(((-4456 "*") -2813 (-2085 (|has| |#1| (-370)) (|has| (-1186 |#1| |#2| |#3|) (-828))) (|has| |#1| (-174)) (-2085 (|has| |#1| (-370)) (|has| (-1186 |#1| |#2| |#3|) (-918)))) (-4447 -2813 (-2085 (|has| |#1| (-370)) (|has| (-1186 |#1| |#2| |#3|) (-828))) (|has| |#1| (-564)) (-2085 (|has| |#1| (-370)) (|has| (-1186 |#1| |#2| |#3|) (-918)))) (-4452 |has| |#1| (-370)) (-4446 |has| |#1| (-370)) (-4448 . T) (-4449 . T) (-4451 . T)) +((-2813 (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-828))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-918))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-1033))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-1163))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (LIST (QUOTE -292) (LIST (QUOTE -1186) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1186) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (LIST (QUOTE -315) (LIST (QUOTE -1186) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (LIST (QUOTE -522) (QUOTE (-1188)) (LIST (QUOTE -1186) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (LIST (QUOTE -1049) (QUOTE (-1188)))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572)))))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-174))) (-2813 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564)))) (-2813 (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (QUOTE (-146)))) (-2813 (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (QUOTE (-148)))) (-2813 (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-572)) (|devaluate| |#1|)))))) (-2813 (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-237))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-572)) (|devaluate| |#1|))))) (|HasCategory| (-572) (QUOTE (-1123))) (-2813 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-564)))) (|HasCategory| |#1| (QUOTE (-370))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-918))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (LIST (QUOTE -1049) (QUOTE (-1188)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-1033))) (|HasCategory| |#1| (QUOTE (-370)))) (-2813 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-564)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-828))) (|HasCategory| |#1| (QUOTE (-370)))) (-2813 (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-828))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-370))))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-1163))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (LIST (QUOTE -292) (LIST (QUOTE -1186) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1186) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (LIST (QUOTE -315) (LIST (QUOTE -1186) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (LIST (QUOTE -522) (QUOTE (-1188)) (LIST (QUOTE -1186) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-572))))) (|HasSignature| |#1| (LIST (QUOTE -2940) (LIST (|devaluate| |#1|) (QUOTE (-1188)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-572))))) (-2813 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-968))) (|HasCategory| |#1| (QUOTE (-1214))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasSignature| |#1| (LIST (QUOTE -3921) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1188))))) (|HasSignature| |#1| (LIST (QUOTE -4353) (LIST (LIST (QUOTE -652) (QUOTE (-1188))) (|devaluate| |#1|)))))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-553))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-313))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-918))) (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-146))) (-2813 (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-828))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-918))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (QUOTE (-564)))) (-2813 (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572)))))) (-2813 (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-828))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-918))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (QUOTE (-174)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-918))) (|HasCategory| |#1| (QUOTE (-370)))) (-2813 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-918))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1186 |#1| |#2| |#3|) (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (QUOTE (-146))))) +(-1180 R -1384) ((|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 @@ -4667,15 +4667,15 @@ NIL (-1184 R) ((|constructor| (NIL "This domain represents univariate polynomials over arbitrary (not necessarily commutative) coefficient rings. The variable is unspecified so that the variable displays as \\spad{?} on output. If it is necessary to specify the variable name,{} use type \\spadtype{UnivariatePolynomial}. The representation is sparse in the sense that only non-zero terms are represented.")) (|fmecg| (($ $ (|NonNegativeInteger|) |#1| $) "\\spad{fmecg(p1,e,r,p2)} finds \\spad{X} : \\spad{p1} - \\spad{r} * X**e * \\spad{p2}")) (|outputForm| (((|OutputForm|) $ (|OutputForm|)) "\\spad{outputForm(p,var)} converts the SparseUnivariatePolynomial \\spad{p} to an output form (see \\spadtype{OutputForm}) printed as a polynomial in the output form variable."))) (((-4456 "*") |has| |#1| (-174)) (-4447 |has| |#1| (-564)) (-4450 |has| |#1| (-370)) (-4452 |has| |#1| (-6 -4452)) (-4449 . T) (-4448 . T) (-4451 . T)) -((|HasCategory| |#1| (QUOTE (-918))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-174))) (-3783 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564)))) (-12 (|HasCategory| (-1093) (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-386))))) (-12 (|HasCategory| (-1093) (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-572))))) (-12 (|HasCategory| (-1093) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386)))))) (-12 (|HasCategory| (-1093) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572)))))) (-12 (|HasCategory| (-1093) (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544))))) (|HasCategory| |#1| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))) (-3783 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572)))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (-3783 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-918)))) (-3783 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-918)))) (-3783 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-918)))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-1163))) (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#1| (QUOTE (-237))) (|HasAttribute| |#1| (QUOTE -4452)) (|HasCategory| |#1| (QUOTE (-460))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-918)))) (-3783 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-918)))) (|HasCategory| |#1| (QUOTE (-146))))) +((|HasCategory| |#1| (QUOTE (-918))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-174))) (-2813 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564)))) (-12 (|HasCategory| (-1093) (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-386))))) (-12 (|HasCategory| (-1093) (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| |#1| (LIST (QUOTE -895) (QUOTE (-572))))) (-12 (|HasCategory| (-1093) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386)))))) (-12 (|HasCategory| (-1093) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572)))))) (-12 (|HasCategory| (-1093) (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544))))) (|HasCategory| |#1| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))) (-2813 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572)))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (-2813 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-918)))) (-2813 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-918)))) (-2813 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-460))) (|HasCategory| |#1| (QUOTE (-918)))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-1163))) (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#1| (QUOTE (-237))) (|HasAttribute| |#1| (QUOTE -4452)) (|HasCategory| |#1| (QUOTE (-460))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-918)))) (-2813 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-918)))) (|HasCategory| |#1| (QUOTE (-146))))) (-1185 |Coef| |var| |cen|) ((|constructor| (NIL "Sparse Puiseux series in one variable \\indented{2}{\\spadtype{SparseUnivariatePuiseuxSeries} is a domain representing Puiseux} \\indented{2}{series in one variable with coefficients in an arbitrary ring.\\space{2}The} \\indented{2}{parameters of the type specify the coefficient ring,{} the power series} \\indented{2}{variable,{} and the center of the power series expansion.\\space{2}For example,{}} \\indented{2}{\\spad{SparseUnivariatePuiseuxSeries(Integer,x,3)} represents Puiseux} \\indented{2}{series in \\spad{(x - 3)} with \\spadtype{Integer} coefficients.}")) (|integrate| (($ $ (|Variable| |#2|)) "\\spad{integrate(f(x))} returns an anti-derivative of the power series \\spad{f(x)} with constant coefficient 0. We may integrate a series when we can divide coefficients by integers.")) (|differentiate| (($ $ (|Variable| |#2|)) "\\spad{differentiate(f(x),x)} returns the derivative of \\spad{f(x)} with respect to \\spad{x}."))) (((-4456 "*") |has| |#1| (-174)) (-4447 |has| |#1| (-564)) (-4452 |has| |#1| (-370)) (-4446 |has| |#1| (-370)) (-4448 . T) (-4449 . T) (-4451 . T)) -((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-174))) (-3783 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564)))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (-12 (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -415) (QUOTE (-572))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -415) (QUOTE (-572))) (|devaluate| |#1|)))) (|HasCategory| (-415 (-572)) (QUOTE (-1123))) (|HasCategory| |#1| (QUOTE (-370))) (-3783 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-564)))) (-3783 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-564)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -415) (QUOTE (-572)))))) (|HasSignature| |#1| (LIST (QUOTE -3491) (LIST (|devaluate| |#1|) (QUOTE (-1188)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -415) (QUOTE (-572)))))) (-3783 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-968))) (|HasCategory| |#1| (QUOTE (-1214))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasSignature| |#1| (LIST (QUOTE -3270) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1188))))) (|HasSignature| |#1| (LIST (QUOTE -2221) (LIST (LIST (QUOTE -652) (QUOTE (-1188))) (|devaluate| |#1|))))))) +((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-174))) (-2813 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564)))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (-12 (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -415) (QUOTE (-572))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -415) (QUOTE (-572))) (|devaluate| |#1|)))) (|HasCategory| (-415 (-572)) (QUOTE (-1123))) (|HasCategory| |#1| (QUOTE (-370))) (-2813 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-564)))) (-2813 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-564)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -415) (QUOTE (-572)))))) (|HasSignature| |#1| (LIST (QUOTE -2940) (LIST (|devaluate| |#1|) (QUOTE (-1188)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -415) (QUOTE (-572)))))) (-2813 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-968))) (|HasCategory| |#1| (QUOTE (-1214))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasSignature| |#1| (LIST (QUOTE -3921) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1188))))) (|HasSignature| |#1| (LIST (QUOTE -4353) (LIST (LIST (QUOTE -652) (QUOTE (-1188))) (|devaluate| |#1|))))))) (-1186 |Coef| |var| |cen|) ((|constructor| (NIL "Sparse Taylor series in one variable \\indented{2}{\\spadtype{SparseUnivariateTaylorSeries} is a domain representing Taylor} \\indented{2}{series in one variable with coefficients in an arbitrary ring.\\space{2}The} \\indented{2}{parameters of the type specify the coefficient ring,{} the power series} \\indented{2}{variable,{} and the center of the power series expansion.\\space{2}For example,{}} \\indented{2}{\\spadtype{SparseUnivariateTaylorSeries}(Integer,{}\\spad{x},{}3) represents Taylor} \\indented{2}{series in \\spad{(x - 3)} with \\spadtype{Integer} coefficients.}")) (|integrate| (($ $ (|Variable| |#2|)) "\\spad{integrate(f(x),x)} returns an anti-derivative of the power series \\spad{f(x)} with constant coefficient 0. We may integrate a series when we can divide coefficients by integers.")) (|differentiate| (($ $ (|Variable| |#2|)) "\\spad{differentiate(f(x),x)} computes the derivative of \\spad{f(x)} with respect to \\spad{x}.")) (|univariatePolynomial| (((|UnivariatePolynomial| |#2| |#1|) $ (|NonNegativeInteger|)) "\\spad{univariatePolynomial(f,k)} returns a univariate polynomial \\indented{1}{consisting of the sum of all terms of \\spad{f} of degree \\spad{<= k}.}")) (|coerce| (($ (|Variable| |#2|)) "\\spad{coerce(var)} converts the series variable \\spad{var} into a \\indented{1}{Taylor series.}") (($ (|UnivariatePolynomial| |#2| |#1|)) "\\spad{coerce(p)} converts a univariate polynomial \\spad{p} in the variable \\spad{var} to a univariate Taylor series in \\spad{var}."))) (((-4456 "*") |has| |#1| (-174)) (-4447 |has| |#1| (-564)) (-4448 . T) (-4449 . T) (-4451 . T)) -((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-564))) (-3783 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564)))) (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (-12 (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-779)) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-779)) (|devaluate| |#1|)))) (|HasCategory| (-779) (QUOTE (-1123))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-779))))) (|HasSignature| |#1| (LIST (QUOTE -3491) (LIST (|devaluate| |#1|) (QUOTE (-1188)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-779))))) (|HasCategory| |#1| (QUOTE (-370))) (-3783 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-968))) (|HasCategory| |#1| (QUOTE (-1214))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasSignature| |#1| (LIST (QUOTE -3270) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1188))))) (|HasSignature| |#1| (LIST (QUOTE -2221) (LIST (LIST (QUOTE -652) (QUOTE (-1188))) (|devaluate| |#1|))))))) +((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-564))) (-2813 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564)))) (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (-12 (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-779)) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-779)) (|devaluate| |#1|)))) (|HasCategory| (-779) (QUOTE (-1123))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-779))))) (|HasSignature| |#1| (LIST (QUOTE -2940) (LIST (|devaluate| |#1|) (QUOTE (-1188)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-779))))) (|HasCategory| |#1| (QUOTE (-370))) (-2813 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-968))) (|HasCategory| |#1| (QUOTE (-1214))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasSignature| |#1| (LIST (QUOTE -3921) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1188))))) (|HasSignature| |#1| (LIST (QUOTE -4353) (LIST (LIST (QUOTE -652) (QUOTE (-1188))) (|devaluate| |#1|))))))) (-1187) ((|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 @@ -4691,7 +4691,7 @@ NIL (-1190 R) ((|constructor| (NIL "This domain implements symmetric polynomial"))) (((-4456 "*") |has| |#1| (-174)) (-4447 |has| |#1| (-564)) (-4452 |has| |#1| (-6 -4452)) (-4448 . T) (-4449 . T) (-4451 . T)) -((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-564))) (-3783 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564)))) (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (-3783 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572)))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-460))) (-12 (|HasCategory| (-982) (QUOTE (-132))) (|HasCategory| |#1| (QUOTE (-564)))) (|HasAttribute| |#1| (QUOTE -4452))) +((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-564))) (-2813 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564)))) (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (-2813 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572)))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-460))) (-12 (|HasCategory| (-982) (QUOTE (-132))) (|HasCategory| |#1| (QUOTE (-564)))) (|HasAttribute| |#1| (QUOTE -4452))) (-1191) ((|constructor| (NIL "Creates and manipulates one global symbol table for FORTRAN code generation,{} containing details of types,{} dimensions,{} and argument lists.")) (|symbolTableOf| (((|SymbolTable|) (|Symbol|) $) "\\spad{symbolTableOf(f,tab)} returns the symbol table of \\spad{f}")) (|argumentListOf| (((|List| (|Symbol|)) (|Symbol|) $) "\\spad{argumentListOf(f,tab)} returns the argument list of \\spad{f}")) (|returnTypeOf| (((|Union| (|:| |fst| (|FortranScalarType|)) (|:| |void| "void")) (|Symbol|) $) "\\spad{returnTypeOf(f,tab)} returns the type of the object returned by \\spad{f}")) (|empty| (($) "\\spad{empty()} creates a new,{} empty symbol table.")) (|printTypes| (((|Void|) (|Symbol|)) "\\spad{printTypes(tab)} produces FORTRAN type declarations from \\spad{tab},{} on the current FORTRAN output stream")) (|printHeader| (((|Void|)) "\\spad{printHeader()} produces the FORTRAN header for the current subprogram in the global symbol table on the current FORTRAN output stream.") (((|Void|) (|Symbol|)) "\\spad{printHeader(f)} produces the FORTRAN header for subprogram \\spad{f} in the global symbol table on the current FORTRAN output stream.") (((|Void|) (|Symbol|) $) "\\spad{printHeader(f,tab)} produces the FORTRAN header for subprogram \\spad{f} in symbol table \\spad{tab} on the current FORTRAN output stream.")) (|returnType!| (((|Void|) (|Union| (|:| |fst| (|FortranScalarType|)) (|:| |void| "void"))) "\\spad{returnType!(t)} declares that the return type of he current subprogram in the global symbol table is \\spad{t}.") (((|Void|) (|Symbol|) (|Union| (|:| |fst| (|FortranScalarType|)) (|:| |void| "void"))) "\\spad{returnType!(f,t)} declares that the return type of subprogram \\spad{f} in the global symbol table is \\spad{t}.") (((|Void|) (|Symbol|) (|Union| (|:| |fst| (|FortranScalarType|)) (|:| |void| "void")) $) "\\spad{returnType!(f,t,tab)} declares that the return type of subprogram \\spad{f} in symbol table \\spad{tab} is \\spad{t}.")) (|argumentList!| (((|Void|) (|List| (|Symbol|))) "\\spad{argumentList!(l)} declares that the argument list for the current subprogram in the global symbol table is \\spad{l}.") (((|Void|) (|Symbol|) (|List| (|Symbol|))) "\\spad{argumentList!(f,l)} declares that the argument list for subprogram \\spad{f} in the global symbol table is \\spad{l}.") (((|Void|) (|Symbol|) (|List| (|Symbol|)) $) "\\spad{argumentList!(f,l,tab)} declares that the argument list for subprogram \\spad{f} in symbol table \\spad{tab} is \\spad{l}.")) (|endSubProgram| (((|Symbol|)) "\\spad{endSubProgram()} asserts that we are no longer processing the current subprogram.")) (|currentSubProgram| (((|Symbol|)) "\\spad{currentSubProgram()} returns the name of the current subprogram being processed")) (|newSubProgram| (((|Void|) (|Symbol|)) "\\spad{newSubProgram(f)} asserts that from now on type declarations are part of subprogram \\spad{f}.")) (|declare!| (((|FortranType|) (|Symbol|) (|FortranType|) (|Symbol|)) "\\spad{declare!(u,t,asp)} declares the parameter \\spad{u} to have type \\spad{t} in \\spad{asp}.") (((|FortranType|) (|Symbol|) (|FortranType|)) "\\spad{declare!(u,t)} declares the parameter \\spad{u} to have type \\spad{t} in the current level of the symbol table.") (((|FortranType|) (|List| (|Symbol|)) (|FortranType|) (|Symbol|) $) "\\spad{declare!(u,t,asp,tab)} declares the parameters \\spad{u} of subprogram \\spad{asp} to have type \\spad{t} in symbol table \\spad{tab}.") (((|FortranType|) (|Symbol|) (|FortranType|) (|Symbol|) $) "\\spad{declare!(u,t,asp,tab)} declares the parameter \\spad{u} of subprogram \\spad{asp} to have type \\spad{t} in symbol table \\spad{tab}.")) (|clearTheSymbolTable| (((|Void|) (|Symbol|)) "\\spad{clearTheSymbolTable(x)} removes the symbol \\spad{x} from the table") (((|Void|)) "\\spad{clearTheSymbolTable()} clears the current symbol table.")) (|showTheSymbolTable| (($) "\\spad{showTheSymbolTable()} returns the current symbol table."))) NIL @@ -4735,7 +4735,7 @@ NIL (-1201 |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}"))) ((-4454 . T) (-4455 . T)) -((-12 (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (QUOTE (-1111))) (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (LIST (QUOTE -315) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -1640) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3763) (|devaluate| |#2|)))))) (-3783 (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (QUOTE (-1111))) (|HasCategory| |#2| (QUOTE (-1111)))) (-3783 (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (QUOTE (-1111))) (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (LIST (QUOTE -622) (QUOTE (-544)))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (QUOTE (-1111))) (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#2| (QUOTE (-1111))) (-3783 (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| (-2 (|:| -1640 |#1|) (|:| -3763 |#2|)) (LIST (QUOTE -621) (QUOTE (-870))))) +((-12 (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (QUOTE (-1111))) (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (LIST (QUOTE -315) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -3690) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -1907) (|devaluate| |#2|)))))) (-2813 (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (QUOTE (-1111))) (|HasCategory| |#2| (QUOTE (-1111)))) (-2813 (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (QUOTE (-1111))) (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (LIST (QUOTE -622) (QUOTE (-544)))) (-12 (|HasCategory| |#2| (QUOTE (-1111))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (QUOTE (-1111))) (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#2| (QUOTE (-1111))) (-2813 (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#2| (LIST (QUOTE -621) (QUOTE (-870)))) (|HasCategory| (-2 (|:| -3690 |#1|) (|:| -1907 |#2|)) (LIST (QUOTE -621) (QUOTE (-870))))) (-1202 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 @@ -4791,7 +4791,7 @@ NIL (-1215 S) ((|constructor| (NIL "\\spadtype{Tree(S)} is a basic domains of tree structures. Each tree is either empty or else is a {\\it node} consisting of a value and a list of (sub)trees.")) (|cyclicParents| (((|List| $) $) "\\spad{cyclicParents(t)} returns a list of cycles that are parents of \\spad{t}.")) (|cyclicEqual?| (((|Boolean|) $ $) "\\spad{cyclicEqual?(t1, t2)} tests of two cyclic trees have the same structure.")) (|cyclicEntries| (((|List| $) $) "\\spad{cyclicEntries(t)} returns a list of top-level cycles in tree \\spad{t}.")) (|cyclicCopy| (($ $) "\\spad{cyclicCopy(l)} makes a copy of a (possibly) cyclic tree \\spad{l}.")) (|cyclic?| (((|Boolean|) $) "\\spad{cyclic?(t)} tests if \\spad{t} is a cyclic tree.")) (|tree| (($ |#1|) "\\spad{tree(nd)} creates a tree with value \\spad{nd},{} and no children") (($ (|List| |#1|)) "\\spad{tree(ls)} creates a tree from a list of elements of \\spad{s}.") (($ |#1| (|List| $)) "\\spad{tree(nd,ls)} creates a tree with value \\spad{nd},{} and children \\spad{ls}."))) ((-4455 . T) (-4454 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1111))) (-3783 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) +((-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1111))) (-2813 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (-1216 S) ((|constructor| (NIL "Category for the trigonometric functions.")) (|tan| (($ $) "\\spad{tan(x)} returns the tangent of \\spad{x}.")) (|sin| (($ $) "\\spad{sin(x)} returns the sine of \\spad{x}.")) (|sec| (($ $) "\\spad{sec(x)} returns the secant of \\spad{x}.")) (|csc| (($ $) "\\spad{csc(x)} returns the cosecant of \\spad{x}.")) (|cot| (($ $) "\\spad{cot(x)} returns the cotangent of \\spad{x}.")) (|cos| (($ $) "\\spad{cos(x)} returns the cosine of \\spad{x}."))) NIL @@ -4800,7 +4800,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 -(-1218 R -3636) +(-1218 R -1384) ((|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 @@ -4808,7 +4808,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 -(-1220 R -3636) +(-1220 R -1384) ((|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 -622) (LIST (QUOTE -901) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -895) (|devaluate| |#1|))) (|HasCategory| |#2| (LIST (QUOTE -622) (LIST (QUOTE -901) (|devaluate| |#1|)))) (|HasCategory| |#2| (LIST (QUOTE -895) (|devaluate| |#1|))))) @@ -4823,7 +4823,7 @@ NIL (-1223 |Coef|) ((|constructor| (NIL "\\spadtype{TaylorSeries} is a general multivariate Taylor series domain over the ring Coef and with variables of type Symbol.")) (|fintegrate| (($ (|Mapping| $) (|Symbol|) |#1|) "\\spad{fintegrate(f,v,c)} is the integral of \\spad{f()} with respect \\indented{1}{to \\spad{v} and having \\spad{c} as the constant of integration.} \\indented{1}{The evaluation of \\spad{f()} is delayed.}")) (|integrate| (($ $ (|Symbol|) |#1|) "\\spad{integrate(s,v,c)} is the integral of \\spad{s} with respect \\indented{1}{to \\spad{v} and having \\spad{c} as the constant of integration.}")) (|coerce| (($ (|Polynomial| |#1|)) "\\spad{coerce(s)} regroups terms of \\spad{s} by total degree \\indented{1}{and forms a series.}") (($ (|Symbol|)) "\\spad{coerce(s)} converts a variable to a Taylor series")) (|coefficient| (((|Polynomial| |#1|) $ (|NonNegativeInteger|)) "\\spad{coefficient(s, n)} gives the terms of total degree \\spad{n}."))) (((-4456 "*") |has| |#1| (-174)) (-4447 |has| |#1| (-564)) (-4449 . T) (-4448 . T) (-4451 . T)) -((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-146))) (-3783 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564)))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-370)))) +((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-146))) (-2813 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564)))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-370)))) (-1224 |Curve|) ((|constructor| (NIL "\\indented{2}{Package for constructing tubes around 3-dimensional parametric curves.} Domain of tubes around 3-dimensional parametric curves.")) (|tube| (($ |#1| (|List| (|List| (|Point| (|DoubleFloat|)))) (|Boolean|)) "\\spad{tube(c,ll,b)} creates a tube of the domain \\spadtype{TubePlot} from a space curve \\spad{c} of the category \\spadtype{PlottableSpaceCurveCategory},{} a list of lists of points (loops) \\spad{ll} and a boolean \\spad{b} which if \\spad{true} indicates a closed tube,{} or if \\spad{false} an open tube.")) (|setClosed| (((|Boolean|) $ (|Boolean|)) "\\spad{setClosed(t,b)} declares the given tube plot \\spad{t} to be closed if \\spad{b} is \\spad{true},{} or if \\spad{b} is \\spad{false},{} \\spad{t} is set to be open.")) (|open?| (((|Boolean|) $) "\\spad{open?(t)} tests whether the given tube plot \\spad{t} is open.")) (|closed?| (((|Boolean|) $) "\\spad{closed?(t)} tests whether the given tube plot \\spad{t} is closed.")) (|listLoops| (((|List| (|List| (|Point| (|DoubleFloat|)))) $) "\\spad{listLoops(t)} returns the list of lists of points,{} or the 'loops',{} of the given tube plot \\spad{t}.")) (|getCurve| ((|#1| $) "\\spad{getCurve(t)} returns the \\spadtype{PlottableSpaceCurveCategory} representing the parametric curve of the given tube plot \\spad{t}."))) NIL @@ -4836,7 +4836,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 (-1111))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) -(-1227 -3636) +(-1227 -1384) ((|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 @@ -4899,11 +4899,11 @@ NIL (-1242 |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)}."))) (((-4456 "*") |has| |#1| (-174)) (-4447 |has| |#1| (-564)) (-4452 |has| |#1| (-370)) (-4446 |has| |#1| (-370)) (-4448 . T) (-4449 . T) (-4451 . T)) -((-3783 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -292) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -522) (QUOTE (-1188)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-828)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-858)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-918)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-1033)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-1163)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -622) (QUOTE (-544))))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-1188)))))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-174))) (-3783 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564)))) (-3783 (|HasCategory| |#1| (QUOTE (-146))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-146))))) (-3783 (|HasCategory| |#1| (QUOTE (-148))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-148))))) (-3783 (-12 (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-572)) (|devaluate| |#1|))))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))))) (-3783 (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-237)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-572)) (|devaluate| |#1|))))) (|HasCategory| (-572) (QUOTE (-1123))) (-3783 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-564)))) (|HasCategory| |#1| (QUOTE (-370))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-918)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-1188))))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -622) (QUOTE (-544))))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-1033)))) (-3783 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-564)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-828)))) (-3783 (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-828)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-858))))) (-3783 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386)))))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572)))))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -292) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -522) (QUOTE (-1188)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-828)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-858)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-918)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-1033)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-1163)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -622) (QUOTE (-544))))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -895) (QUOTE (-386))))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -895) (QUOTE (-572))))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-1188)))))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-1163)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -292) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -522) (QUOTE (-1188)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572)))))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386)))))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -895) (QUOTE (-572))))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -895) (QUOTE (-386))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-572))))) (|HasSignature| |#1| (LIST (QUOTE -3491) (LIST (|devaluate| |#1|) (QUOTE (-1188)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-572))))) (-3783 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-968))) (|HasCategory| |#1| (QUOTE (-1214))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasSignature| |#1| (LIST (QUOTE -3270) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1188))))) (|HasSignature| |#1| (LIST (QUOTE -2221) (LIST (LIST (QUOTE -652) (QUOTE (-1188))) (|devaluate| |#1|)))))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-858)))) (|HasCategory| |#2| (QUOTE (-918))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-553)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-313)))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#2| (QUOTE (-146))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-918)))) (-3783 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-918)))) (|HasCategory| |#1| (QUOTE (-146))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-146)))))) +((-2813 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -292) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -522) (QUOTE (-1188)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-828)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-858)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-918)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-1033)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-1163)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -622) (QUOTE (-544))))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-1188)))))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-174))) (-2813 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564)))) (-2813 (|HasCategory| |#1| (QUOTE (-146))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-146))))) (-2813 (|HasCategory| |#1| (QUOTE (-148))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-148))))) (-2813 (-12 (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-572)) (|devaluate| |#1|))))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))))) (-2813 (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-237)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-572)) (|devaluate| |#1|))))) (|HasCategory| (-572) (QUOTE (-1123))) (-2813 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-564)))) (|HasCategory| |#1| (QUOTE (-370))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-918)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-1188))))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -622) (QUOTE (-544))))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-1033)))) (-2813 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-564)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-828)))) (-2813 (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-828)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-858))))) (-2813 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386)))))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572)))))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -292) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -522) (QUOTE (-1188)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-828)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-858)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-918)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-1033)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-1163)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -622) (QUOTE (-544))))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -895) (QUOTE (-386))))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -895) (QUOTE (-572))))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-1188)))))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572))))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-1163)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -292) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -315) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -522) (QUOTE (-1188)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572))))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572)))))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386)))))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -895) (QUOTE (-572))))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -895) (QUOTE (-386))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-572))))) (|HasSignature| |#1| (LIST (QUOTE -2940) (LIST (|devaluate| |#1|) (QUOTE (-1188)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-572))))) (-2813 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-968))) (|HasCategory| |#1| (QUOTE (-1214))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasSignature| |#1| (LIST (QUOTE -3921) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1188))))) (|HasSignature| |#1| (LIST (QUOTE -4353) (LIST (LIST (QUOTE -652) (QUOTE (-1188))) (|devaluate| |#1|)))))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-858)))) (|HasCategory| |#2| (QUOTE (-918))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-553)))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-313)))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#2| (QUOTE (-146))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-918)))) (-2813 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-918)))) (|HasCategory| |#1| (QUOTE (-146))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-146)))))) (-1243 |Coef| |var| |cen|) ((|constructor| (NIL "Dense Laurent series in one variable \\indented{2}{\\spadtype{UnivariateLaurentSeries} is a domain representing Laurent} \\indented{2}{series in one variable with coefficients in an arbitrary ring.\\space{2}The} \\indented{2}{parameters of the type specify the coefficient ring,{} the power series} \\indented{2}{variable,{} and the center of the power series expansion.\\space{2}For example,{}} \\indented{2}{\\spad{UnivariateLaurentSeries(Integer,x,3)} represents Laurent series in} \\indented{2}{\\spad{(x - 3)} with integer coefficients.}")) (|integrate| (($ $ (|Variable| |#2|)) "\\spad{integrate(f(x))} returns an anti-derivative of the power series \\spad{f(x)} with constant coefficient 0. We may integrate a series when we can divide coefficients by integers.")) (|differentiate| (($ $ (|Variable| |#2|)) "\\spad{differentiate(f(x),x)} returns the derivative of \\spad{f(x)} with respect to \\spad{x}.")) (|coerce| (($ (|Variable| |#2|)) "\\spad{coerce(var)} converts the series variable \\spad{var} into a Laurent series."))) -(((-4456 "*") -3783 (-3804 (|has| |#1| (-370)) (|has| (-1271 |#1| |#2| |#3|) (-828))) (|has| |#1| (-174)) (-3804 (|has| |#1| (-370)) (|has| (-1271 |#1| |#2| |#3|) (-918)))) (-4447 -3783 (-3804 (|has| |#1| (-370)) (|has| (-1271 |#1| |#2| |#3|) (-828))) (|has| |#1| (-564)) (-3804 (|has| |#1| (-370)) (|has| (-1271 |#1| |#2| |#3|) (-918)))) (-4452 |has| |#1| (-370)) (-4446 |has| |#1| (-370)) (-4448 . T) (-4449 . T) (-4451 . T)) -((-3783 (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-828))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-918))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-1033))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-1163))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (LIST (QUOTE -292) (LIST (QUOTE -1271) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1271) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (LIST (QUOTE -315) (LIST (QUOTE -1271) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (LIST (QUOTE -522) (QUOTE (-1188)) (LIST (QUOTE -1271) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (LIST (QUOTE -1049) (QUOTE (-1188)))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572)))))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-174))) (-3783 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564)))) (-3783 (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (QUOTE (-146)))) (-3783 (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (QUOTE (-148)))) (-3783 (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-572)) (|devaluate| |#1|)))))) (-3783 (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-237))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-572)) (|devaluate| |#1|))))) (|HasCategory| (-572) (QUOTE (-1123))) (-3783 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-564)))) (|HasCategory| |#1| (QUOTE (-370))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-918))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (LIST (QUOTE -1049) (QUOTE (-1188)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-1033))) (|HasCategory| |#1| (QUOTE (-370)))) (-3783 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-564)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-828))) (|HasCategory| |#1| (QUOTE (-370)))) (-3783 (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-828))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-370))))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-1163))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (LIST (QUOTE -292) (LIST (QUOTE -1271) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1271) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (LIST (QUOTE -315) (LIST (QUOTE -1271) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (LIST (QUOTE -522) (QUOTE (-1188)) (LIST (QUOTE -1271) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-572))))) (|HasSignature| |#1| (LIST (QUOTE -3491) (LIST (|devaluate| |#1|) (QUOTE (-1188)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-572))))) (-3783 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-968))) (|HasCategory| |#1| (QUOTE (-1214))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasSignature| |#1| (LIST (QUOTE -3270) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1188))))) (|HasSignature| |#1| (LIST (QUOTE -2221) (LIST (LIST (QUOTE -652) (QUOTE (-1188))) (|devaluate| |#1|)))))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-553))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-313))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-918))) (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-146))) (-3783 (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-828))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-918))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (QUOTE (-564)))) (-3783 (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572)))))) (-3783 (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-828))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-918))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (QUOTE (-174)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-918))) (|HasCategory| |#1| (QUOTE (-370)))) (-3783 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-918))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (QUOTE (-146))))) +(((-4456 "*") -2813 (-2085 (|has| |#1| (-370)) (|has| (-1271 |#1| |#2| |#3|) (-828))) (|has| |#1| (-174)) (-2085 (|has| |#1| (-370)) (|has| (-1271 |#1| |#2| |#3|) (-918)))) (-4447 -2813 (-2085 (|has| |#1| (-370)) (|has| (-1271 |#1| |#2| |#3|) (-828))) (|has| |#1| (-564)) (-2085 (|has| |#1| (-370)) (|has| (-1271 |#1| |#2| |#3|) (-918)))) (-4452 |has| |#1| (-370)) (-4446 |has| |#1| (-370)) (-4448 . T) (-4449 . T) (-4451 . T)) +((-2813 (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-828))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-918))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-1033))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-1163))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (LIST (QUOTE -292) (LIST (QUOTE -1271) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1271) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (LIST (QUOTE -315) (LIST (QUOTE -1271) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (LIST (QUOTE -522) (QUOTE (-1188)) (LIST (QUOTE -1271) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (LIST (QUOTE -1049) (QUOTE (-1188)))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572)))))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-174))) (-2813 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564)))) (-2813 (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (QUOTE (-146)))) (-2813 (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-148))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (QUOTE (-148)))) (-2813 (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-572)) (|devaluate| |#1|)))))) (-2813 (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-237))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-572)) (|devaluate| |#1|))))) (|HasCategory| (-572) (QUOTE (-1123))) (-2813 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-564)))) (|HasCategory| |#1| (QUOTE (-370))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-918))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (LIST (QUOTE -1049) (QUOTE (-1188)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-1033))) (|HasCategory| |#1| (QUOTE (-370)))) (-2813 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-564)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-828))) (|HasCategory| |#1| (QUOTE (-370)))) (-2813 (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-828))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-370))))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-1163))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (LIST (QUOTE -292) (LIST (QUOTE -1271) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1271) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (LIST (QUOTE -315) (LIST (QUOTE -1271) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (LIST (QUOTE -522) (QUOTE (-1188)) (LIST (QUOTE -1271) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-572))))) (|HasSignature| |#1| (LIST (QUOTE -2940) (LIST (|devaluate| |#1|) (QUOTE (-1188)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-572))))) (-2813 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-968))) (|HasCategory| |#1| (QUOTE (-1214))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasSignature| |#1| (LIST (QUOTE -3921) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1188))))) (|HasSignature| |#1| (LIST (QUOTE -4353) (LIST (LIST (QUOTE -652) (QUOTE (-1188))) (|devaluate| |#1|)))))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-553))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-313))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-918))) (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-146))) (-2813 (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-828))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-918))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (QUOTE (-564)))) (-2813 (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572)))))) (-2813 (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-828))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-918))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (QUOTE (-174)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-918))) (|HasCategory| |#1| (QUOTE (-370)))) (-2813 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-918))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| (-1271 |#1| |#2| |#3|) (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (QUOTE (-146))))) (-1244 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 @@ -4939,7 +4939,7 @@ NIL (-1252 |x| R) ((|constructor| (NIL "This domain represents univariate polynomials in some symbol over arbitrary (not necessarily commutative) coefficient rings. The representation is sparse in the sense that only non-zero terms are represented.")) (|fmecg| (($ $ (|NonNegativeInteger|) |#2| $) "\\spad{fmecg(p1,e,r,p2)} finds \\spad{X} : \\spad{p1} - \\spad{r} * X**e * \\spad{p2}"))) (((-4456 "*") |has| |#2| (-174)) (-4447 |has| |#2| (-564)) (-4450 |has| |#2| (-370)) (-4452 |has| |#2| (-6 -4452)) (-4449 . T) (-4448 . T) (-4451 . T)) -((|HasCategory| |#2| (QUOTE (-918))) (|HasCategory| |#2| (QUOTE (-564))) (|HasCategory| |#2| (QUOTE (-174))) (-3783 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-564)))) (-12 (|HasCategory| (-1093) (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| |#2| (LIST (QUOTE -895) (QUOTE (-386))))) (-12 (|HasCategory| (-1093) (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -895) (QUOTE (-572))))) (-12 (|HasCategory| (-1093) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| |#2| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386)))))) (-12 (|HasCategory| (-1093) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572)))))) (-12 (|HasCategory| (-1093) (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#2| (LIST (QUOTE -622) (QUOTE (-544))))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (QUOTE (-148))) (|HasCategory| |#2| (QUOTE (-146))) (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572)))) (-3783 (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572)))))) (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (-3783 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-460))) (|HasCategory| |#2| (QUOTE (-564))) (|HasCategory| |#2| (QUOTE (-918)))) (-3783 (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-460))) (|HasCategory| |#2| (QUOTE (-564))) (|HasCategory| |#2| (QUOTE (-918)))) (-3783 (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-460))) (|HasCategory| |#2| (QUOTE (-918)))) (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-1163))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (QUOTE (-237))) (|HasAttribute| |#2| (QUOTE -4452)) (|HasCategory| |#2| (QUOTE (-460))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#2| (QUOTE (-918)))) (-3783 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#2| (QUOTE (-918)))) (|HasCategory| |#2| (QUOTE (-146))))) +((|HasCategory| |#2| (QUOTE (-918))) (|HasCategory| |#2| (QUOTE (-564))) (|HasCategory| |#2| (QUOTE (-174))) (-2813 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-564)))) (-12 (|HasCategory| (-1093) (LIST (QUOTE -895) (QUOTE (-386)))) (|HasCategory| |#2| (LIST (QUOTE -895) (QUOTE (-386))))) (-12 (|HasCategory| (-1093) (LIST (QUOTE -895) (QUOTE (-572)))) (|HasCategory| |#2| (LIST (QUOTE -895) (QUOTE (-572))))) (-12 (|HasCategory| (-1093) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386))))) (|HasCategory| |#2| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-386)))))) (-12 (|HasCategory| (-1093) (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -622) (LIST (QUOTE -901) (QUOTE (-572)))))) (-12 (|HasCategory| (-1093) (LIST (QUOTE -622) (QUOTE (-544)))) (|HasCategory| |#2| (LIST (QUOTE -622) (QUOTE (-544))))) (|HasCategory| |#2| (LIST (QUOTE -647) (QUOTE (-572)))) (|HasCategory| |#2| (QUOTE (-148))) (|HasCategory| |#2| (QUOTE (-146))) (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -1049) (QUOTE (-572)))) (-2813 (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572)))))) (|HasCategory| |#2| (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (-2813 (|HasCategory| |#2| (QUOTE (-174))) (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-460))) (|HasCategory| |#2| (QUOTE (-564))) (|HasCategory| |#2| (QUOTE (-918)))) (-2813 (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-460))) (|HasCategory| |#2| (QUOTE (-564))) (|HasCategory| |#2| (QUOTE (-918)))) (-2813 (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-460))) (|HasCategory| |#2| (QUOTE (-918)))) (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-1163))) (|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasCategory| |#2| (QUOTE (-237))) (|HasAttribute| |#2| (QUOTE -4452)) (|HasCategory| |#2| (QUOTE (-460))) (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#2| (QUOTE (-918)))) (-2813 (-12 (|HasCategory| $ (QUOTE (-146))) (|HasCategory| |#2| (QUOTE (-918)))) (|HasCategory| |#2| (QUOTE (-146))))) (-1253 R PR S PS) ((|constructor| (NIL "Mapping from polynomials over \\spad{R} to polynomials over \\spad{S} given a map from \\spad{R} to \\spad{S} assumed to send zero to zero.")) (|map| ((|#4| (|Mapping| |#3| |#1|) |#2|) "\\spad{map(f, p)} takes a function \\spad{f} from \\spad{R} to \\spad{S},{} and applies it to each (non-zero) coefficient of a polynomial \\spad{p} over \\spad{R},{} getting a new polynomial over \\spad{S}. Note: since the map is not applied to zero elements,{} it may map zero to zero."))) NIL @@ -4955,7 +4955,7 @@ NIL (-1256 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 -909) (QUOTE (-1188)))) (|HasSignature| |#2| (LIST (QUOTE *) (LIST (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#2|)))) (|HasCategory| |#3| (QUOTE (-1123))) (|HasSignature| |#2| (LIST (QUOTE **) (LIST (|devaluate| |#2|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasSignature| |#2| (LIST (QUOTE -3491) (LIST (|devaluate| |#2|) (QUOTE (-1188)))))) +((|HasCategory| |#2| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasSignature| |#2| (LIST (QUOTE *) (LIST (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#2|)))) (|HasCategory| |#3| (QUOTE (-1123))) (|HasSignature| |#2| (LIST (QUOTE **) (LIST (|devaluate| |#2|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasSignature| |#2| (LIST (QUOTE -2940) (LIST (|devaluate| |#2|) (QUOTE (-1188)))))) (-1257 |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."))) (((-4456 "*") |has| |#1| (-174)) (-4447 |has| |#1| (-564)) (-4448 . T) (-4449 . T) (-4451 . T)) @@ -4983,15 +4983,15 @@ NIL (-1263 |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)}."))) (((-4456 "*") |has| |#1| (-174)) (-4447 |has| |#1| (-564)) (-4452 |has| |#1| (-370)) (-4446 |has| |#1| (-370)) (-4448 . T) (-4449 . T) (-4451 . T)) -((|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-174))) (-3783 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564)))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (-12 (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -415) (QUOTE (-572))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -415) (QUOTE (-572))) (|devaluate| |#1|)))) (|HasCategory| (-415 (-572)) (QUOTE (-1123))) (|HasCategory| |#1| (QUOTE (-370))) (-3783 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-564)))) (-3783 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-564)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -415) (QUOTE (-572)))))) (|HasSignature| |#1| (LIST (QUOTE -3491) (LIST (|devaluate| |#1|) (QUOTE (-1188)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -415) (QUOTE (-572)))))) (-3783 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-968))) (|HasCategory| |#1| (QUOTE (-1214))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasSignature| |#1| (LIST (QUOTE -3270) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1188))))) (|HasSignature| |#1| (LIST (QUOTE -2221) (LIST (LIST (QUOTE -652) (QUOTE (-1188))) (|devaluate| |#1|)))))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572)))))) +((|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-174))) (-2813 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564)))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (-12 (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -415) (QUOTE (-572))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -415) (QUOTE (-572))) (|devaluate| |#1|)))) (|HasCategory| (-415 (-572)) (QUOTE (-1123))) (|HasCategory| |#1| (QUOTE (-370))) (-2813 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-564)))) (-2813 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-564)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -415) (QUOTE (-572)))))) (|HasSignature| |#1| (LIST (QUOTE -2940) (LIST (|devaluate| |#1|) (QUOTE (-1188)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -415) (QUOTE (-572)))))) (-2813 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-968))) (|HasCategory| |#1| (QUOTE (-1214))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasSignature| |#1| (LIST (QUOTE -3921) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1188))))) (|HasSignature| |#1| (LIST (QUOTE -4353) (LIST (LIST (QUOTE -652) (QUOTE (-1188))) (|devaluate| |#1|)))))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572)))))) (-1264 |Coef| |var| |cen|) ((|constructor| (NIL "Dense Puiseux series in one variable \\indented{2}{\\spadtype{UnivariatePuiseuxSeries} is a domain representing Puiseux} \\indented{2}{series in one variable with coefficients in an arbitrary ring.\\space{2}The} \\indented{2}{parameters of the type specify the coefficient ring,{} the power series} \\indented{2}{variable,{} and the center of the power series expansion.\\space{2}For example,{}} \\indented{2}{\\spad{UnivariatePuiseuxSeries(Integer,x,3)} represents Puiseux series in} \\indented{2}{\\spad{(x - 3)} with \\spadtype{Integer} coefficients.}")) (|integrate| (($ $ (|Variable| |#2|)) "\\spad{integrate(f(x))} returns an anti-derivative of the power series \\spad{f(x)} with constant coefficient 0. We may integrate a series when we can divide coefficients by integers.")) (|differentiate| (($ $ (|Variable| |#2|)) "\\spad{differentiate(f(x),x)} returns the derivative of \\spad{f(x)} with respect to \\spad{x}."))) (((-4456 "*") |has| |#1| (-174)) (-4447 |has| |#1| (-564)) (-4452 |has| |#1| (-370)) (-4446 |has| |#1| (-370)) (-4448 . T) (-4449 . T) (-4451 . T)) -((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-174))) (-3783 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564)))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (-12 (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -415) (QUOTE (-572))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -415) (QUOTE (-572))) (|devaluate| |#1|)))) (|HasCategory| (-415 (-572)) (QUOTE (-1123))) (|HasCategory| |#1| (QUOTE (-370))) (-3783 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-564)))) (-3783 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-564)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -415) (QUOTE (-572)))))) (|HasSignature| |#1| (LIST (QUOTE -3491) (LIST (|devaluate| |#1|) (QUOTE (-1188)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -415) (QUOTE (-572)))))) (-3783 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-968))) (|HasCategory| |#1| (QUOTE (-1214))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasSignature| |#1| (LIST (QUOTE -3270) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1188))))) (|HasSignature| |#1| (LIST (QUOTE -2221) (LIST (LIST (QUOTE -652) (QUOTE (-1188))) (|devaluate| |#1|))))))) +((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-564))) (|HasCategory| |#1| (QUOTE (-174))) (-2813 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564)))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (-12 (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -415) (QUOTE (-572))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -415) (QUOTE (-572))) (|devaluate| |#1|)))) (|HasCategory| (-415 (-572)) (QUOTE (-1123))) (|HasCategory| |#1| (QUOTE (-370))) (-2813 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-564)))) (-2813 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-564)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -415) (QUOTE (-572)))))) (|HasSignature| |#1| (LIST (QUOTE -2940) (LIST (|devaluate| |#1|) (QUOTE (-1188)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -415) (QUOTE (-572)))))) (-2813 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-968))) (|HasCategory| |#1| (QUOTE (-1214))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasSignature| |#1| (LIST (QUOTE -3921) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1188))))) (|HasSignature| |#1| (LIST (QUOTE -4353) (LIST (LIST (QUOTE -652) (QUOTE (-1188))) (|devaluate| |#1|))))))) (-1265 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))}."))) (((-4456 "*") |has| (-1264 |#2| |#3| |#4|) (-174)) (-4447 |has| (-1264 |#2| |#3| |#4|) (-564)) (-4448 . T) (-4449 . T) (-4451 . T)) -((|HasCategory| (-1264 |#2| |#3| |#4|) (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| (-1264 |#2| |#3| |#4|) (QUOTE (-146))) (|HasCategory| (-1264 |#2| |#3| |#4|) (QUOTE (-148))) (|HasCategory| (-1264 |#2| |#3| |#4|) (QUOTE (-174))) (-3783 (|HasCategory| (-1264 |#2| |#3| |#4|) (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| (-1264 |#2| |#3| |#4|) (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572)))))) (|HasCategory| (-1264 |#2| |#3| |#4|) (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| (-1264 |#2| |#3| |#4|) (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| (-1264 |#2| |#3| |#4|) (QUOTE (-370))) (|HasCategory| (-1264 |#2| |#3| |#4|) (QUOTE (-460))) (|HasCategory| (-1264 |#2| |#3| |#4|) (QUOTE (-564)))) +((|HasCategory| (-1264 |#2| |#3| |#4|) (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| (-1264 |#2| |#3| |#4|) (QUOTE (-146))) (|HasCategory| (-1264 |#2| |#3| |#4|) (QUOTE (-148))) (|HasCategory| (-1264 |#2| |#3| |#4|) (QUOTE (-174))) (-2813 (|HasCategory| (-1264 |#2| |#3| |#4|) (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| (-1264 |#2| |#3| |#4|) (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572)))))) (|HasCategory| (-1264 |#2| |#3| |#4|) (LIST (QUOTE -1049) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| (-1264 |#2| |#3| |#4|) (LIST (QUOTE -1049) (QUOTE (-572)))) (|HasCategory| (-1264 |#2| |#3| |#4|) (QUOTE (-370))) (|HasCategory| (-1264 |#2| |#3| |#4|) (QUOTE (-460))) (|HasCategory| (-1264 |#2| |#3| |#4|) (QUOTE (-564)))) (-1266 A S) ((|constructor| (NIL "A unary-recursive aggregate is a one where nodes may have either 0 or 1 children. This aggregate models,{} though not precisely,{} a linked list possibly with a single cycle. A node with one children models a non-empty list,{} with the \\spadfun{value} of the list designating the head,{} or \\spadfun{first},{} of the list,{} and the child designating the tail,{} or \\spadfun{rest},{} of the list. A node with no child then designates the empty list. Since these aggregates are recursive aggregates,{} they may be cyclic.")) (|split!| (($ $ (|Integer|)) "\\spad{split!(u,n)} splits \\spad{u} into two aggregates: \\axiom{\\spad{v} = rest(\\spad{u},{}\\spad{n})} and \\axiom{\\spad{w} = first(\\spad{u},{}\\spad{n})},{} returning \\axiom{\\spad{v}}. Note: afterwards \\axiom{rest(\\spad{u},{}\\spad{n})} returns \\axiom{empty()}.")) (|setlast!| ((|#2| $ |#2|) "\\spad{setlast!(u,x)} destructively changes the last element of \\spad{u} to \\spad{x}.")) (|setrest!| (($ $ $) "\\spad{setrest!(u,v)} destructively changes the rest of \\spad{u} to \\spad{v}.")) (|setelt| ((|#2| $ "last" |#2|) "\\spad{setelt(u,\"last\",x)} (also written: \\axiom{\\spad{u}.last \\spad{:=} \\spad{b}}) is equivalent to \\axiom{setlast!(\\spad{u},{}\\spad{v})}.") (($ $ "rest" $) "\\spad{setelt(u,\"rest\",v)} (also written: \\axiom{\\spad{u}.rest \\spad{:=} \\spad{v}}) is equivalent to \\axiom{setrest!(\\spad{u},{}\\spad{v})}.") ((|#2| $ "first" |#2|) "\\spad{setelt(u,\"first\",x)} (also written: \\axiom{\\spad{u}.first \\spad{:=} \\spad{x}}) is equivalent to \\axiom{setfirst!(\\spad{u},{}\\spad{x})}.")) (|setfirst!| ((|#2| $ |#2|) "\\spad{setfirst!(u,x)} destructively changes the first element of a to \\spad{x}.")) (|cycleSplit!| (($ $) "\\spad{cycleSplit!(u)} splits the aggregate by dropping off the cycle. The value returned is the cycle entry,{} or nil if none exists. For example,{} if \\axiom{\\spad{w} = concat(\\spad{u},{}\\spad{v})} is the cyclic list where \\spad{v} is the head of the cycle,{} \\axiom{cycleSplit!(\\spad{w})} will drop \\spad{v} off \\spad{w} thus destructively changing \\spad{w} to \\spad{u},{} and returning \\spad{v}.")) (|concat!| (($ $ |#2|) "\\spad{concat!(u,x)} destructively adds element \\spad{x} to the end of \\spad{u}. Note: \\axiom{concat!(a,{}\\spad{x}) = setlast!(a,{}[\\spad{x}])}.") (($ $ $) "\\spad{concat!(u,v)} destructively concatenates \\spad{v} to the end of \\spad{u}. Note: \\axiom{concat!(\\spad{u},{}\\spad{v}) = setlast!(\\spad{u},{}\\spad{v})}.")) (|cycleTail| (($ $) "\\spad{cycleTail(u)} returns the last node in the cycle,{} or empty if none exists.")) (|cycleLength| (((|NonNegativeInteger|) $) "\\spad{cycleLength(u)} returns the length of a top-level cycle contained in aggregate \\spad{u},{} or 0 is \\spad{u} has no such cycle.")) (|cycleEntry| (($ $) "\\spad{cycleEntry(u)} returns the head of a top-level cycle contained in aggregate \\spad{u},{} or \\axiom{empty()} if none exists.")) (|third| ((|#2| $) "\\spad{third(u)} returns the third element of \\spad{u}. Note: \\axiom{third(\\spad{u}) = first(rest(rest(\\spad{u})))}.")) (|second| ((|#2| $) "\\spad{second(u)} returns the second element of \\spad{u}. Note: \\axiom{second(\\spad{u}) = first(rest(\\spad{u}))}.")) (|tail| (($ $) "\\spad{tail(u)} returns the last node of \\spad{u}. Note: if \\spad{u} is \\axiom{shallowlyMutable},{} \\axiom{setrest(tail(\\spad{u}),{}\\spad{v}) = concat(\\spad{u},{}\\spad{v})}.")) (|last| (($ $ (|NonNegativeInteger|)) "\\spad{last(u,n)} returns a copy of the last \\spad{n} (\\axiom{\\spad{n} \\spad{>=} 0}) nodes of \\spad{u}. Note: \\axiom{last(\\spad{u},{}\\spad{n})} is a list of \\spad{n} elements.") ((|#2| $) "\\spad{last(u)} resturn the last element of \\spad{u}. Note: for lists,{} \\axiom{last(\\spad{u}) = \\spad{u} . (maxIndex \\spad{u}) = \\spad{u} . (\\# \\spad{u} - 1)}.")) (|rest| (($ $ (|NonNegativeInteger|)) "\\spad{rest(u,n)} returns the \\axiom{\\spad{n}}th (\\spad{n} \\spad{>=} 0) node of \\spad{u}. Note: \\axiom{rest(\\spad{u},{}0) = \\spad{u}}.") (($ $) "\\spad{rest(u)} returns an aggregate consisting of all but the first element of \\spad{u} (equivalently,{} the next node of \\spad{u}).")) (|elt| ((|#2| $ "last") "\\spad{elt(u,\"last\")} (also written: \\axiom{\\spad{u} . last}) is equivalent to last \\spad{u}.") (($ $ "rest") "\\spad{elt(\\%,\"rest\")} (also written: \\axiom{\\spad{u}.rest}) is equivalent to \\axiom{rest \\spad{u}}.") ((|#2| $ "first") "\\spad{elt(u,\"first\")} (also written: \\axiom{\\spad{u} . first}) is equivalent to first \\spad{u}.")) (|first| (($ $ (|NonNegativeInteger|)) "\\spad{first(u,n)} returns a copy of the first \\spad{n} (\\axiom{\\spad{n} \\spad{>=} 0}) elements of \\spad{u}.") ((|#2| $) "\\spad{first(u)} returns the first element of \\spad{u} (equivalently,{} the value at the current node).")) (|concat| (($ |#2| $) "\\spad{concat(x,u)} returns aggregate consisting of \\spad{x} followed by the elements of \\spad{u}. Note: if \\axiom{\\spad{v} = concat(\\spad{x},{}\\spad{u})} then \\axiom{\\spad{x} = first \\spad{v}} and \\axiom{\\spad{u} = rest \\spad{v}}.") (($ $ $) "\\spad{concat(u,v)} returns an aggregate \\spad{w} consisting of the elements of \\spad{u} followed by the elements of \\spad{v}. Note: \\axiom{\\spad{v} = rest(\\spad{w},{}\\#a)}."))) NIL @@ -5007,7 +5007,7 @@ NIL (-1269 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 (-572)))) (|HasCategory| |#2| (QUOTE (-968))) (|HasCategory| |#2| (QUOTE (-1214))) (|HasSignature| |#2| (LIST (QUOTE -2221) (LIST (LIST (QUOTE -652) (QUOTE (-1188))) (|devaluate| |#2|)))) (|HasSignature| |#2| (LIST (QUOTE -3270) (LIST (|devaluate| |#2|) (|devaluate| |#2|) (QUOTE (-1188))))) (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-370)))) +((|HasCategory| |#2| (LIST (QUOTE -29) (QUOTE (-572)))) (|HasCategory| |#2| (QUOTE (-968))) (|HasCategory| |#2| (QUOTE (-1214))) (|HasSignature| |#2| (LIST (QUOTE -4353) (LIST (LIST (QUOTE -652) (QUOTE (-1188))) (|devaluate| |#2|)))) (|HasSignature| |#2| (LIST (QUOTE -3921) (LIST (|devaluate| |#2|) (|devaluate| |#2|) (QUOTE (-1188))))) (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#2| (QUOTE (-370)))) (-1270 |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."))) (((-4456 "*") |has| |#1| (-174)) (-4447 |has| |#1| (-564)) (-4448 . T) (-4449 . T) (-4451 . T)) @@ -5015,12 +5015,12 @@ NIL (-1271 |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))}.}")) (|differentiate| (($ $ (|Variable| |#2|)) "\\spad{differentiate(f(x),x)} computes the derivative of \\spad{f(x)} with respect to \\spad{x}.")) (|univariatePolynomial| (((|UnivariatePolynomial| |#2| |#1|) $ (|NonNegativeInteger|)) "\\spad{univariatePolynomial(f,k)} returns a univariate polynomial \\indented{1}{consisting of the sum of all terms of \\spad{f} of degree \\spad{<= k}.}")) (|coerce| (($ (|Variable| |#2|)) "\\spad{coerce(var)} converts the series variable \\spad{var} into a \\indented{1}{Taylor series.}") (($ (|UnivariatePolynomial| |#2| |#1|)) "\\spad{coerce(p)} converts a univariate polynomial \\spad{p} in the variable \\spad{var} to a univariate Taylor series in \\spad{var}."))) (((-4456 "*") |has| |#1| (-174)) (-4447 |has| |#1| (-564)) (-4448 . T) (-4449 . T) (-4451 . T)) -((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-564))) (-3783 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564)))) (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (-12 (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-779)) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-779)) (|devaluate| |#1|)))) (|HasCategory| (-779) (QUOTE (-1123))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-779))))) (|HasSignature| |#1| (LIST (QUOTE -3491) (LIST (|devaluate| |#1|) (QUOTE (-1188)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-779))))) (|HasCategory| |#1| (QUOTE (-370))) (-3783 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-968))) (|HasCategory| |#1| (QUOTE (-1214))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasSignature| |#1| (LIST (QUOTE -3270) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1188))))) (|HasSignature| |#1| (LIST (QUOTE -2221) (LIST (LIST (QUOTE -652) (QUOTE (-1188))) (|devaluate| |#1|))))))) +((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasCategory| |#1| (QUOTE (-564))) (-2813 (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-564)))) (|HasCategory| |#1| (QUOTE (-174))) (|HasCategory| |#1| (QUOTE (-146))) (|HasCategory| |#1| (QUOTE (-148))) (-12 (|HasCategory| |#1| (LIST (QUOTE -909) (QUOTE (-1188)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-779)) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-779)) (|devaluate| |#1|)))) (|HasCategory| (-779) (QUOTE (-1123))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-779))))) (|HasSignature| |#1| (LIST (QUOTE -2940) (LIST (|devaluate| |#1|) (QUOTE (-1188)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-779))))) (|HasCategory| |#1| (QUOTE (-370))) (-2813 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-572)))) (|HasCategory| |#1| (QUOTE (-968))) (|HasCategory| |#1| (QUOTE (-1214))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -415) (QUOTE (-572))))) (|HasSignature| |#1| (LIST (QUOTE -3921) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1188))))) (|HasSignature| |#1| (LIST (QUOTE -4353) (LIST (LIST (QUOTE -652) (QUOTE (-1188))) (|devaluate| |#1|))))))) (-1272 |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 -(-1273 -3636 UP L UTS) +(-1273 -1384 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 (-564)))) @@ -5047,7 +5047,7 @@ NIL (-1279 R) ((|constructor| (NIL "This type represents vector like objects with varying lengths and indexed by a finite segment of integers starting at 1.")) (|vector| (($ (|List| |#1|)) "\\spad{vector(l)} converts the list \\spad{l} to a vector."))) ((-4455 . T) (-4454 . T)) -((-3783 (-12 (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) (-3783 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544)))) (-3783 (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-1111)))) (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| (-572) (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-734))) (|HasCategory| |#1| (QUOTE (-1060))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (QUOTE (-1060)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) +((-2813 (-12 (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) (-2813 (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870))))) (|HasCategory| |#1| (LIST (QUOTE -622) (QUOTE (-544)))) (-2813 (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-1111)))) (|HasCategory| |#1| (QUOTE (-858))) (|HasCategory| (-572) (QUOTE (-858))) (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-734))) (|HasCategory| |#1| (QUOTE (-1060))) (-12 (|HasCategory| |#1| (QUOTE (-1013))) (|HasCategory| |#1| (QUOTE (-1060)))) (|HasCategory| |#1| (LIST (QUOTE -621) (QUOTE (-870)))) (-12 (|HasCategory| |#1| (QUOTE (-1111))) (|HasCategory| |#1| (LIST (QUOTE -315) (|devaluate| |#1|))))) (-1280) ((|constructor| (NIL "TwoDimensionalViewport creates viewports to display graphs.")) (|coerce| (((|OutputForm|) $) "\\spad{coerce(v)} returns the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport} as output of the domain \\spadtype{OutputForm}.")) (|key| (((|Integer|) $) "\\spad{key(v)} returns the process ID number of the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport}.")) (|reset| (((|Void|) $) "\\spad{reset(v)} sets the current state of the graph characteristics of the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} back to their initial settings.")) (|write| (((|String|) $ (|String|) (|List| (|String|))) "\\spad{write(v,s,lf)} takes the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} and creates a directory indicated by \\spad{s},{} which contains the graph data files for \\spad{v} and the optional file types indicated by the list \\spad{lf}.") (((|String|) $ (|String|) (|String|)) "\\spad{write(v,s,f)} takes the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} and creates a directory indicated by \\spad{s},{} which contains the graph data files for \\spad{v} and an optional file type \\spad{f}.") (((|String|) $ (|String|)) "\\spad{write(v,s)} takes the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} and creates a directory indicated by \\spad{s},{} which contains the graph data files for \\spad{v}.")) (|resize| (((|Void|) $ (|PositiveInteger|) (|PositiveInteger|)) "\\spad{resize(v,w,h)} displays the two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} with a width of \\spad{w} and a height of \\spad{h},{} keeping the upper left-hand corner position unchanged.")) (|update| (((|Void|) $ (|GraphImage|) (|PositiveInteger|)) "\\spad{update(v,gr,n)} drops the graph \\spad{gr} in slot \\spad{n} of viewport \\spad{v}. The graph \\spad{gr} must have been transmitted already and acquired an integer key.")) (|move| (((|Void|) $ (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{move(v,x,y)} displays the two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} with the upper left-hand corner of the viewport window at the screen coordinate position \\spad{x},{} \\spad{y}.")) (|show| (((|Void|) $ (|PositiveInteger|) (|String|)) "\\spad{show(v,n,s)} displays the graph in field \\spad{n} of the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} if \\spad{s} is \"on\",{} or does not display the graph if \\spad{s} is \"off\".")) (|translate| (((|Void|) $ (|PositiveInteger|) (|Float|) (|Float|)) "\\spad{translate(v,n,dx,dy)} displays the graph in field \\spad{n} of the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} translated by \\spad{dx} in the \\spad{x}-coordinate direction from the center of the viewport,{} and by \\spad{dy} in the \\spad{y}-coordinate direction from the center. Setting \\spad{dx} and \\spad{dy} to \\spad{0} places the center of the graph at the center of the viewport.")) (|scale| (((|Void|) $ (|PositiveInteger|) (|Float|) (|Float|)) "\\spad{scale(v,n,sx,sy)} displays the graph in field \\spad{n} of the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} scaled by the factor \\spad{sx} in the \\spad{x}-coordinate direction and by the factor \\spad{sy} in the \\spad{y}-coordinate direction.")) (|dimensions| (((|Void|) $ (|NonNegativeInteger|) (|NonNegativeInteger|) (|PositiveInteger|) (|PositiveInteger|)) "\\spad{dimensions(v,x,y,width,height)} sets the position of the upper left-hand corner of the two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} to the window coordinate \\spad{x},{} \\spad{y},{} and sets the dimensions of the window to that of \\spad{width},{} \\spad{height}. The new dimensions are not displayed until the function \\spadfun{makeViewport2D} is executed again for \\spad{v}.")) (|close| (((|Void|) $) "\\spad{close(v)} closes the viewport window of the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} and terminates the corresponding process ID.")) (|controlPanel| (((|Void|) $ (|String|)) "\\spad{controlPanel(v,s)} displays the control panel of the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} if \\spad{s} is \"on\",{} or hides the control panel if \\spad{s} is \"off\".")) (|connect| (((|Void|) $ (|PositiveInteger|) (|String|)) "\\spad{connect(v,n,s)} displays the lines connecting the graph points in field \\spad{n} of the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} if \\spad{s} is \"on\",{} or does not display the lines if \\spad{s} is \"off\".")) (|region| (((|Void|) $ (|PositiveInteger|) (|String|)) "\\spad{region(v,n,s)} displays the bounding box of the graph in field \\spad{n} of the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} if \\spad{s} is \"on\",{} or does not display the bounding box if \\spad{s} is \"off\".")) (|points| (((|Void|) $ (|PositiveInteger|) (|String|)) "\\spad{points(v,n,s)} displays the points of the graph in field \\spad{n} of the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} if \\spad{s} is \"on\",{} or does not display the points if \\spad{s} is \"off\".")) (|units| (((|Void|) $ (|PositiveInteger|) (|Palette|)) "\\spad{units(v,n,c)} displays the units of the graph in field \\spad{n} of the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} with the units color set to the given palette color \\spad{c}.") (((|Void|) $ (|PositiveInteger|) (|String|)) "\\spad{units(v,n,s)} displays the units of the graph in field \\spad{n} of the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} if \\spad{s} is \"on\",{} or does not display the units if \\spad{s} is \"off\".")) (|axes| (((|Void|) $ (|PositiveInteger|) (|Palette|)) "\\spad{axes(v,n,c)} displays the axes of the graph in field \\spad{n} of the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} with the axes color set to the given palette color \\spad{c}.") (((|Void|) $ (|PositiveInteger|) (|String|)) "\\spad{axes(v,n,s)} displays the axes of the graph in field \\spad{n} of the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} if \\spad{s} is \"on\",{} or does not display the axes if \\spad{s} is \"off\".")) (|getGraph| (((|GraphImage|) $ (|PositiveInteger|)) "\\spad{getGraph(v,n)} returns the graph which is of the domain \\spadtype{GraphImage} which is located in graph field \\spad{n} of the given two-dimensional viewport,{} \\spad{v},{} which is of the domain \\spadtype{TwoDimensionalViewport}.")) (|putGraph| (((|Void|) $ (|GraphImage|) (|PositiveInteger|)) "\\spad{putGraph(v,gi,n)} sets the graph field indicated by \\spad{n},{} of the indicated two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport},{} to be the graph,{} \\spad{gi} of domain \\spadtype{GraphImage}. The contents of viewport,{} \\spad{v},{} will contain \\spad{gi} when the function \\spadfun{makeViewport2D} is called to create the an updated viewport \\spad{v}.")) (|title| (((|Void|) $ (|String|)) "\\spad{title(v,s)} changes the title which is shown in the two-dimensional viewport window,{} \\spad{v} of domain \\spadtype{TwoDimensionalViewport}.")) (|graphs| (((|Vector| (|Union| (|GraphImage|) "undefined")) $) "\\spad{graphs(v)} returns a vector,{} or list,{} which is a union of all the graphs,{} of the domain \\spadtype{GraphImage},{} which are allocated for the two-dimensional viewport,{} \\spad{v},{} of domain \\spadtype{TwoDimensionalViewport}. Those graphs which have no data are labeled \"undefined\",{} otherwise their contents are shown.")) (|graphStates| (((|Vector| (|Record| (|:| |scaleX| (|DoubleFloat|)) (|:| |scaleY| (|DoubleFloat|)) (|:| |deltaX| (|DoubleFloat|)) (|:| |deltaY| (|DoubleFloat|)) (|:| |points| (|Integer|)) (|:| |connect| (|Integer|)) (|:| |spline| (|Integer|)) (|:| |axes| (|Integer|)) (|:| |axesColor| (|Palette|)) (|:| |units| (|Integer|)) (|:| |unitsColor| (|Palette|)) (|:| |showing| (|Integer|)))) $) "\\spad{graphStates(v)} returns and shows a listing of a record containing the current state of the characteristics of each of the ten graph records in the given two-dimensional viewport,{} \\spad{v},{} which is of domain \\spadtype{TwoDimensionalViewport}.")) (|graphState| (((|Void|) $ (|PositiveInteger|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|Integer|) (|Integer|) (|Integer|) (|Integer|) (|Palette|) (|Integer|) (|Palette|) (|Integer|)) "\\spad{graphState(v,num,sX,sY,dX,dY,pts,lns,box,axes,axesC,un,unC,cP)} sets the state of the characteristics for the graph indicated by \\spad{num} in the given two-dimensional viewport \\spad{v},{} of domain \\spadtype{TwoDimensionalViewport},{} to the values given as parameters. The scaling of the graph in the \\spad{x} and \\spad{y} component directions is set to be \\spad{sX} and \\spad{sY}; the window translation in the \\spad{x} and \\spad{y} component directions is set to be \\spad{dX} and \\spad{dY}; The graph points,{} lines,{} bounding \\spad{box},{} \\spad{axes},{} or units will be shown in the viewport if their given parameters \\spad{pts},{} \\spad{lns},{} \\spad{box},{} \\spad{axes} or \\spad{un} are set to be \\spad{1},{} but will not be shown if they are set to \\spad{0}. The color of the \\spad{axes} and the color of the units are indicated by the palette colors \\spad{axesC} and \\spad{unC} respectively. To display the control panel when the viewport window is displayed,{} set \\spad{cP} to \\spad{1},{} otherwise set it to \\spad{0}.")) (|options| (($ $ (|List| (|DrawOption|))) "\\spad{options(v,lopt)} takes the given two-dimensional viewport,{} \\spad{v},{} of the domain \\spadtype{TwoDimensionalViewport} and returns \\spad{v} with it\\spad{'s} draw options modified to be those which are indicated in the given list,{} \\spad{lopt} of domain \\spadtype{DrawOption}.") (((|List| (|DrawOption|)) $) "\\spad{options(v)} takes the given two-dimensional viewport,{} \\spad{v},{} of the domain \\spadtype{TwoDimensionalViewport} and returns a list containing the draw options from the domain \\spadtype{DrawOption} for \\spad{v}.")) (|makeViewport2D| (($ (|GraphImage|) (|List| (|DrawOption|))) "\\spad{makeViewport2D(gi,lopt)} creates and displays a viewport window of the domain \\spadtype{TwoDimensionalViewport} whose graph field is assigned to be the given graph,{} \\spad{gi},{} of domain \\spadtype{GraphImage},{} and whose options field is set to be the list of options,{} \\spad{lopt} of domain \\spadtype{DrawOption}.") (($ $) "\\spad{makeViewport2D(v)} takes the given two-dimensional viewport,{} \\spad{v},{} of the domain \\spadtype{TwoDimensionalViewport} and displays a viewport window on the screen which contains the contents of \\spad{v}.")) (|viewport2D| (($) "\\spad{viewport2D()} returns an undefined two-dimensional viewport of the domain \\spadtype{TwoDimensionalViewport} whose contents are empty.")) (|getPickedPoints| (((|List| (|Point| (|DoubleFloat|))) $) "\\spad{getPickedPoints(x)} returns a list of small floats for the points the user interactively picked on the viewport for full integration into the system,{} some design issues need to be addressed: \\spadignore{e.g.} how to go through the GraphImage interface,{} how to default to graphs,{} etc."))) NIL @@ -5080,7 +5080,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 -(-1288 K R UP -3636) +(-1288 K R UP -1384) ((|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 @@ -5116,11 +5116,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}."))) ((-4447 |has| |#2| (-6 -4447)) (-4449 . T) (-4448 . T) (-4451 . T)) NIL -(-1297 S -3636) +(-1297 S -1384) ((|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 (-375))) (|HasCategory| |#2| (QUOTE (-146))) (|HasCategory| |#2| (QUOTE (-148)))) -(-1298 -3636) +(-1298 -1384) ((|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}."))) ((-4446 . T) (-4452 . T) (-4447 . T) ((-4456 "*") . T) (-4448 . T) (-4449 . T) (-4451 . T)) NIL @@ -5180,4 +5180,4 @@ NIL NIL NIL NIL -((-3 NIL 2267449 2267454 2267459 2267464) (-2 NIL 2267429 2267434 2267439 2267444) (-1 NIL 2267409 2267414 2267419 2267424) (0 NIL 2267389 2267394 2267399 2267404) (-1308 "ZMOD.spad" 2267198 2267211 2267327 2267384) (-1307 "ZLINDEP.spad" 2266264 2266275 2267188 2267193) (-1306 "ZDSOLVE.spad" 2256209 2256231 2266254 2266259) (-1305 "YSTREAM.spad" 2255704 2255715 2256199 2256204) (-1304 "YDIAGRAM.spad" 2255338 2255347 2255694 2255699) (-1303 "XRPOLY.spad" 2254558 2254578 2255194 2255263) (-1302 "XPR.spad" 2252353 2252366 2254276 2254375) (-1301 "XPOLY.spad" 2251908 2251919 2252209 2252278) (-1300 "XPOLYC.spad" 2251227 2251243 2251834 2251903) (-1299 "XPBWPOLY.spad" 2249664 2249684 2251007 2251076) (-1298 "XF.spad" 2248127 2248142 2249566 2249659) (-1297 "XF.spad" 2246570 2246587 2248011 2248016) (-1296 "XFALG.spad" 2243618 2243634 2246496 2246565) (-1295 "XEXPPKG.spad" 2242869 2242895 2243608 2243613) (-1294 "XDPOLY.spad" 2242483 2242499 2242725 2242794) (-1293 "XALG.spad" 2242143 2242154 2242439 2242478) (-1292 "WUTSET.spad" 2237982 2237999 2241789 2241816) (-1291 "WP.spad" 2237181 2237225 2237840 2237907) (-1290 "WHILEAST.spad" 2236979 2236988 2237171 2237176) (-1289 "WHEREAST.spad" 2236650 2236659 2236969 2236974) (-1288 "WFFINTBS.spad" 2234313 2234335 2236640 2236645) (-1287 "WEIER.spad" 2232535 2232546 2234303 2234308) (-1286 "VSPACE.spad" 2232208 2232219 2232503 2232530) (-1285 "VSPACE.spad" 2231901 2231914 2232198 2232203) (-1284 "VOID.spad" 2231578 2231587 2231891 2231896) (-1283 "VIEW.spad" 2229258 2229267 2231568 2231573) (-1282 "VIEWDEF.spad" 2224459 2224468 2229248 2229253) (-1281 "VIEW3D.spad" 2208420 2208429 2224449 2224454) (-1280 "VIEW2D.spad" 2196311 2196320 2208410 2208415) (-1279 "VECTOR.spad" 2194985 2194996 2195236 2195263) (-1278 "VECTOR2.spad" 2193624 2193637 2194975 2194980) (-1277 "VECTCAT.spad" 2191528 2191539 2193592 2193619) (-1276 "VECTCAT.spad" 2189239 2189252 2191305 2191310) (-1275 "VARIABLE.spad" 2189019 2189034 2189229 2189234) (-1274 "UTYPE.spad" 2188663 2188672 2189009 2189014) (-1273 "UTSODETL.spad" 2187958 2187982 2188619 2188624) (-1272 "UTSODE.spad" 2186174 2186194 2187948 2187953) (-1271 "UTS.spad" 2180978 2181006 2184641 2184738) (-1270 "UTSCAT.spad" 2178457 2178473 2180876 2180973) (-1269 "UTSCAT.spad" 2175580 2175598 2178001 2178006) (-1268 "UTS2.spad" 2175175 2175210 2175570 2175575) (-1267 "URAGG.spad" 2169848 2169859 2175165 2175170) (-1266 "URAGG.spad" 2164485 2164498 2169804 2169809) (-1265 "UPXSSING.spad" 2162130 2162156 2163566 2163699) (-1264 "UPXS.spad" 2159284 2159312 2160262 2160411) (-1263 "UPXSCONS.spad" 2157043 2157063 2157416 2157565) (-1262 "UPXSCCA.spad" 2155614 2155634 2156889 2157038) (-1261 "UPXSCCA.spad" 2154327 2154349 2155604 2155609) (-1260 "UPXSCAT.spad" 2152916 2152932 2154173 2154322) (-1259 "UPXS2.spad" 2152459 2152512 2152906 2152911) (-1258 "UPSQFREE.spad" 2150873 2150887 2152449 2152454) (-1257 "UPSCAT.spad" 2148660 2148684 2150771 2150868) (-1256 "UPSCAT.spad" 2146153 2146179 2148266 2148271) (-1255 "UPOLYC.spad" 2141193 2141204 2145995 2146148) (-1254 "UPOLYC.spad" 2136125 2136138 2140929 2140934) (-1253 "UPOLYC2.spad" 2135596 2135615 2136115 2136120) (-1252 "UP.spad" 2132795 2132810 2133182 2133335) (-1251 "UPMP.spad" 2131695 2131708 2132785 2132790) (-1250 "UPDIVP.spad" 2131260 2131274 2131685 2131690) (-1249 "UPDECOMP.spad" 2129505 2129519 2131250 2131255) (-1248 "UPCDEN.spad" 2128714 2128730 2129495 2129500) (-1247 "UP2.spad" 2128078 2128099 2128704 2128709) (-1246 "UNISEG.spad" 2127431 2127442 2127997 2128002) (-1245 "UNISEG2.spad" 2126928 2126941 2127387 2127392) (-1244 "UNIFACT.spad" 2126031 2126043 2126918 2126923) (-1243 "ULS.spad" 2116589 2116617 2117676 2118105) (-1242 "ULSCONS.spad" 2108985 2109005 2109355 2109504) (-1241 "ULSCCAT.spad" 2106722 2106742 2108831 2108980) (-1240 "ULSCCAT.spad" 2104567 2104589 2106678 2106683) (-1239 "ULSCAT.spad" 2102799 2102815 2104413 2104562) (-1238 "ULS2.spad" 2102313 2102366 2102789 2102794) (-1237 "UINT8.spad" 2102190 2102199 2102303 2102308) (-1236 "UINT64.spad" 2102066 2102075 2102180 2102185) (-1235 "UINT32.spad" 2101942 2101951 2102056 2102061) (-1234 "UINT16.spad" 2101818 2101827 2101932 2101937) (-1233 "UFD.spad" 2100883 2100892 2101744 2101813) (-1232 "UFD.spad" 2100010 2100021 2100873 2100878) (-1231 "UDVO.spad" 2098891 2098900 2100000 2100005) (-1230 "UDPO.spad" 2096384 2096395 2098847 2098852) (-1229 "TYPE.spad" 2096316 2096325 2096374 2096379) (-1228 "TYPEAST.spad" 2096235 2096244 2096306 2096311) (-1227 "TWOFACT.spad" 2094887 2094902 2096225 2096230) (-1226 "TUPLE.spad" 2094373 2094384 2094786 2094791) (-1225 "TUBETOOL.spad" 2091240 2091249 2094363 2094368) (-1224 "TUBE.spad" 2089887 2089904 2091230 2091235) (-1223 "TS.spad" 2088486 2088502 2089452 2089549) (-1222 "TSETCAT.spad" 2075613 2075630 2088454 2088481) (-1221 "TSETCAT.spad" 2062726 2062745 2075569 2075574) (-1220 "TRMANIP.spad" 2057092 2057109 2062432 2062437) (-1219 "TRIMAT.spad" 2056055 2056080 2057082 2057087) (-1218 "TRIGMNIP.spad" 2054582 2054599 2056045 2056050) (-1217 "TRIGCAT.spad" 2054094 2054103 2054572 2054577) (-1216 "TRIGCAT.spad" 2053604 2053615 2054084 2054089) (-1215 "TREE.spad" 2052179 2052190 2053211 2053238) (-1214 "TRANFUN.spad" 2052018 2052027 2052169 2052174) (-1213 "TRANFUN.spad" 2051855 2051866 2052008 2052013) (-1212 "TOPSP.spad" 2051529 2051538 2051845 2051850) (-1211 "TOOLSIGN.spad" 2051192 2051203 2051519 2051524) (-1210 "TEXTFILE.spad" 2049753 2049762 2051182 2051187) (-1209 "TEX.spad" 2046899 2046908 2049743 2049748) (-1208 "TEX1.spad" 2046455 2046466 2046889 2046894) (-1207 "TEMUTL.spad" 2046010 2046019 2046445 2046450) (-1206 "TBCMPPK.spad" 2044103 2044126 2046000 2046005) (-1205 "TBAGG.spad" 2043153 2043176 2044083 2044098) (-1204 "TBAGG.spad" 2042211 2042236 2043143 2043148) (-1203 "TANEXP.spad" 2041619 2041630 2042201 2042206) (-1202 "TALGOP.spad" 2041343 2041354 2041609 2041614) (-1201 "TABLE.spad" 2039754 2039777 2040024 2040051) (-1200 "TABLEAU.spad" 2039235 2039246 2039744 2039749) (-1199 "TABLBUMP.spad" 2036038 2036049 2039225 2039230) (-1198 "SYSTEM.spad" 2035266 2035275 2036028 2036033) (-1197 "SYSSOLP.spad" 2032749 2032760 2035256 2035261) (-1196 "SYSPTR.spad" 2032648 2032657 2032739 2032744) (-1195 "SYSNNI.spad" 2031830 2031841 2032638 2032643) (-1194 "SYSINT.spad" 2031234 2031245 2031820 2031825) (-1193 "SYNTAX.spad" 2027440 2027449 2031224 2031229) (-1192 "SYMTAB.spad" 2025508 2025517 2027430 2027435) (-1191 "SYMS.spad" 2021531 2021540 2025498 2025503) (-1190 "SYMPOLY.spad" 2020538 2020549 2020620 2020747) (-1189 "SYMFUNC.spad" 2020039 2020050 2020528 2020533) (-1188 "SYMBOL.spad" 2017542 2017551 2020029 2020034) (-1187 "SWITCH.spad" 2014313 2014322 2017532 2017537) (-1186 "SUTS.spad" 2011218 2011246 2012780 2012877) (-1185 "SUPXS.spad" 2008359 2008387 2009350 2009499) (-1184 "SUP.spad" 2005172 2005183 2005945 2006098) (-1183 "SUPFRACF.spad" 2004277 2004295 2005162 2005167) (-1182 "SUP2.spad" 2003669 2003682 2004267 2004272) (-1181 "SUMRF.spad" 2002643 2002654 2003659 2003664) (-1180 "SUMFS.spad" 2002280 2002297 2002633 2002638) (-1179 "SULS.spad" 1992825 1992853 1993925 1994354) (-1178 "SUCHTAST.spad" 1992594 1992603 1992815 1992820) (-1177 "SUCH.spad" 1992276 1992291 1992584 1992589) (-1176 "SUBSPACE.spad" 1984391 1984406 1992266 1992271) (-1175 "SUBRESP.spad" 1983561 1983575 1984347 1984352) (-1174 "STTF.spad" 1979660 1979676 1983551 1983556) (-1173 "STTFNC.spad" 1976128 1976144 1979650 1979655) (-1172 "STTAYLOR.spad" 1968763 1968774 1976009 1976014) (-1171 "STRTBL.spad" 1967268 1967285 1967417 1967444) (-1170 "STRING.spad" 1966677 1966686 1966691 1966718) (-1169 "STRICAT.spad" 1966465 1966474 1966645 1966672) (-1168 "STREAM.spad" 1963383 1963394 1965990 1966005) (-1167 "STREAM3.spad" 1962956 1962971 1963373 1963378) (-1166 "STREAM2.spad" 1962084 1962097 1962946 1962951) (-1165 "STREAM1.spad" 1961790 1961801 1962074 1962079) (-1164 "STINPROD.spad" 1960726 1960742 1961780 1961785) (-1163 "STEP.spad" 1959927 1959936 1960716 1960721) (-1162 "STEPAST.spad" 1959161 1959170 1959917 1959922) (-1161 "STBL.spad" 1957687 1957715 1957854 1957869) (-1160 "STAGG.spad" 1956762 1956773 1957677 1957682) (-1159 "STAGG.spad" 1955835 1955848 1956752 1956757) (-1158 "STACK.spad" 1955192 1955203 1955442 1955469) (-1157 "SREGSET.spad" 1952896 1952913 1954838 1954865) (-1156 "SRDCMPK.spad" 1951457 1951477 1952886 1952891) (-1155 "SRAGG.spad" 1946600 1946609 1951425 1951452) (-1154 "SRAGG.spad" 1941763 1941774 1946590 1946595) (-1153 "SQMATRIX.spad" 1939379 1939397 1940295 1940382) (-1152 "SPLTREE.spad" 1933931 1933944 1938815 1938842) (-1151 "SPLNODE.spad" 1930519 1930532 1933921 1933926) (-1150 "SPFCAT.spad" 1929328 1929337 1930509 1930514) (-1149 "SPECOUT.spad" 1927880 1927889 1929318 1929323) (-1148 "SPADXPT.spad" 1919475 1919484 1927870 1927875) (-1147 "spad-parser.spad" 1918940 1918949 1919465 1919470) (-1146 "SPADAST.spad" 1918641 1918650 1918930 1918935) (-1145 "SPACEC.spad" 1902840 1902851 1918631 1918636) (-1144 "SPACE3.spad" 1902616 1902627 1902830 1902835) (-1143 "SORTPAK.spad" 1902165 1902178 1902572 1902577) (-1142 "SOLVETRA.spad" 1899928 1899939 1902155 1902160) (-1141 "SOLVESER.spad" 1898456 1898467 1899918 1899923) (-1140 "SOLVERAD.spad" 1894482 1894493 1898446 1898451) (-1139 "SOLVEFOR.spad" 1892944 1892962 1894472 1894477) (-1138 "SNTSCAT.spad" 1892544 1892561 1892912 1892939) (-1137 "SMTS.spad" 1890816 1890842 1892109 1892206) (-1136 "SMP.spad" 1888291 1888311 1888681 1888808) (-1135 "SMITH.spad" 1887136 1887161 1888281 1888286) (-1134 "SMATCAT.spad" 1885246 1885276 1887080 1887131) (-1133 "SMATCAT.spad" 1883288 1883320 1885124 1885129) (-1132 "SKAGG.spad" 1882251 1882262 1883256 1883283) (-1131 "SINT.spad" 1881191 1881200 1882117 1882246) (-1130 "SIMPAN.spad" 1880919 1880928 1881181 1881186) (-1129 "SIG.spad" 1880249 1880258 1880909 1880914) (-1128 "SIGNRF.spad" 1879367 1879378 1880239 1880244) (-1127 "SIGNEF.spad" 1878646 1878663 1879357 1879362) (-1126 "SIGAST.spad" 1878031 1878040 1878636 1878641) (-1125 "SHP.spad" 1875959 1875974 1877987 1877992) (-1124 "SHDP.spad" 1865670 1865697 1866179 1866310) (-1123 "SGROUP.spad" 1865278 1865287 1865660 1865665) (-1122 "SGROUP.spad" 1864884 1864895 1865268 1865273) (-1121 "SGCF.spad" 1858023 1858032 1864874 1864879) (-1120 "SFRTCAT.spad" 1856953 1856970 1857991 1858018) (-1119 "SFRGCD.spad" 1856016 1856036 1856943 1856948) (-1118 "SFQCMPK.spad" 1850653 1850673 1856006 1856011) (-1117 "SFORT.spad" 1850092 1850106 1850643 1850648) (-1116 "SEXOF.spad" 1849935 1849975 1850082 1850087) (-1115 "SEX.spad" 1849827 1849836 1849925 1849930) (-1114 "SEXCAT.spad" 1847608 1847648 1849817 1849822) (-1113 "SET.spad" 1845932 1845943 1847029 1847068) (-1112 "SETMN.spad" 1844382 1844399 1845922 1845927) (-1111 "SETCAT.spad" 1843704 1843713 1844372 1844377) (-1110 "SETCAT.spad" 1843024 1843035 1843694 1843699) (-1109 "SETAGG.spad" 1839573 1839584 1843004 1843019) (-1108 "SETAGG.spad" 1836130 1836143 1839563 1839568) (-1107 "SEQAST.spad" 1835833 1835842 1836120 1836125) (-1106 "SEGXCAT.spad" 1834989 1835002 1835823 1835828) (-1105 "SEG.spad" 1834802 1834813 1834908 1834913) (-1104 "SEGCAT.spad" 1833727 1833738 1834792 1834797) (-1103 "SEGBIND.spad" 1833485 1833496 1833674 1833679) (-1102 "SEGBIND2.spad" 1833183 1833196 1833475 1833480) (-1101 "SEGAST.spad" 1832897 1832906 1833173 1833178) (-1100 "SEG2.spad" 1832332 1832345 1832853 1832858) (-1099 "SDVAR.spad" 1831608 1831619 1832322 1832327) (-1098 "SDPOL.spad" 1829034 1829045 1829325 1829452) (-1097 "SCPKG.spad" 1827123 1827134 1829024 1829029) (-1096 "SCOPE.spad" 1826276 1826285 1827113 1827118) (-1095 "SCACHE.spad" 1824972 1824983 1826266 1826271) (-1094 "SASTCAT.spad" 1824881 1824890 1824962 1824967) (-1093 "SAOS.spad" 1824753 1824762 1824871 1824876) (-1092 "SAERFFC.spad" 1824466 1824486 1824743 1824748) (-1091 "SAE.spad" 1822641 1822657 1823252 1823387) (-1090 "SAEFACT.spad" 1822342 1822362 1822631 1822636) (-1089 "RURPK.spad" 1820001 1820017 1822332 1822337) (-1088 "RULESET.spad" 1819454 1819478 1819991 1819996) (-1087 "RULE.spad" 1817694 1817718 1819444 1819449) (-1086 "RULECOLD.spad" 1817546 1817559 1817684 1817689) (-1085 "RTVALUE.spad" 1817281 1817290 1817536 1817541) (-1084 "RSTRCAST.spad" 1816998 1817007 1817271 1817276) (-1083 "RSETGCD.spad" 1813376 1813396 1816988 1816993) (-1082 "RSETCAT.spad" 1803312 1803329 1813344 1813371) (-1081 "RSETCAT.spad" 1793268 1793287 1803302 1803307) (-1080 "RSDCMPK.spad" 1791720 1791740 1793258 1793263) (-1079 "RRCC.spad" 1790104 1790134 1791710 1791715) (-1078 "RRCC.spad" 1788486 1788518 1790094 1790099) (-1077 "RPTAST.spad" 1788188 1788197 1788476 1788481) (-1076 "RPOLCAT.spad" 1767548 1767563 1788056 1788183) (-1075 "RPOLCAT.spad" 1746621 1746638 1767131 1767136) (-1074 "ROUTINE.spad" 1742504 1742513 1745268 1745295) (-1073 "ROMAN.spad" 1741832 1741841 1742370 1742499) (-1072 "ROIRC.spad" 1740912 1740944 1741822 1741827) (-1071 "RNS.spad" 1739815 1739824 1740814 1740907) (-1070 "RNS.spad" 1738804 1738815 1739805 1739810) (-1069 "RNG.spad" 1738539 1738548 1738794 1738799) (-1068 "RNGBIND.spad" 1737699 1737713 1738494 1738499) (-1067 "RMODULE.spad" 1737464 1737475 1737689 1737694) (-1066 "RMCAT2.spad" 1736884 1736941 1737454 1737459) (-1065 "RMATRIX.spad" 1735708 1735727 1736051 1736090) (-1064 "RMATCAT.spad" 1731287 1731318 1735664 1735703) (-1063 "RMATCAT.spad" 1726756 1726789 1731135 1731140) (-1062 "RLINSET.spad" 1726150 1726161 1726746 1726751) (-1061 "RINTERP.spad" 1726038 1726058 1726140 1726145) (-1060 "RING.spad" 1725508 1725517 1726018 1726033) (-1059 "RING.spad" 1724986 1724997 1725498 1725503) (-1058 "RIDIST.spad" 1724378 1724387 1724976 1724981) (-1057 "RGCHAIN.spad" 1722961 1722977 1723863 1723890) (-1056 "RGBCSPC.spad" 1722742 1722754 1722951 1722956) (-1055 "RGBCMDL.spad" 1722272 1722284 1722732 1722737) (-1054 "RF.spad" 1719914 1719925 1722262 1722267) (-1053 "RFFACTOR.spad" 1719376 1719387 1719904 1719909) (-1052 "RFFACT.spad" 1719111 1719123 1719366 1719371) (-1051 "RFDIST.spad" 1718107 1718116 1719101 1719106) (-1050 "RETSOL.spad" 1717526 1717539 1718097 1718102) (-1049 "RETRACT.spad" 1716954 1716965 1717516 1717521) (-1048 "RETRACT.spad" 1716380 1716393 1716944 1716949) (-1047 "RETAST.spad" 1716192 1716201 1716370 1716375) (-1046 "RESULT.spad" 1714252 1714261 1714839 1714866) (-1045 "RESRING.spad" 1713599 1713646 1714190 1714247) (-1044 "RESLATC.spad" 1712923 1712934 1713589 1713594) (-1043 "REPSQ.spad" 1712654 1712665 1712913 1712918) (-1042 "REP.spad" 1710208 1710217 1712644 1712649) (-1041 "REPDB.spad" 1709915 1709926 1710198 1710203) (-1040 "REP2.spad" 1699573 1699584 1709757 1709762) (-1039 "REP1.spad" 1693769 1693780 1699523 1699528) (-1038 "REGSET.spad" 1691566 1691583 1693415 1693442) (-1037 "REF.spad" 1690901 1690912 1691521 1691526) (-1036 "REDORDER.spad" 1690107 1690124 1690891 1690896) (-1035 "RECLOS.spad" 1688890 1688910 1689594 1689687) (-1034 "REALSOLV.spad" 1688030 1688039 1688880 1688885) (-1033 "REAL.spad" 1687902 1687911 1688020 1688025) (-1032 "REAL0Q.spad" 1685200 1685215 1687892 1687897) (-1031 "REAL0.spad" 1682044 1682059 1685190 1685195) (-1030 "RDUCEAST.spad" 1681765 1681774 1682034 1682039) (-1029 "RDIV.spad" 1681420 1681445 1681755 1681760) (-1028 "RDIST.spad" 1680987 1680998 1681410 1681415) (-1027 "RDETRS.spad" 1679851 1679869 1680977 1680982) (-1026 "RDETR.spad" 1677990 1678008 1679841 1679846) (-1025 "RDEEFS.spad" 1677089 1677106 1677980 1677985) (-1024 "RDEEF.spad" 1676099 1676116 1677079 1677084) (-1023 "RCFIELD.spad" 1673285 1673294 1676001 1676094) (-1022 "RCFIELD.spad" 1670557 1670568 1673275 1673280) (-1021 "RCAGG.spad" 1668485 1668496 1670547 1670552) (-1020 "RCAGG.spad" 1666340 1666353 1668404 1668409) (-1019 "RATRET.spad" 1665700 1665711 1666330 1666335) (-1018 "RATFACT.spad" 1665392 1665404 1665690 1665695) (-1017 "RANDSRC.spad" 1664711 1664720 1665382 1665387) (-1016 "RADUTIL.spad" 1664467 1664476 1664701 1664706) (-1015 "RADIX.spad" 1661388 1661402 1662934 1663027) (-1014 "RADFF.spad" 1659801 1659838 1659920 1660076) (-1013 "RADCAT.spad" 1659396 1659405 1659791 1659796) (-1012 "RADCAT.spad" 1658989 1659000 1659386 1659391) (-1011 "QUEUE.spad" 1658337 1658348 1658596 1658623) (-1010 "QUAT.spad" 1656795 1656806 1657138 1657203) (-1009 "QUATCT2.spad" 1656415 1656434 1656785 1656790) (-1008 "QUATCAT.spad" 1654585 1654596 1656345 1656410) (-1007 "QUATCAT.spad" 1652506 1652519 1654268 1654273) (-1006 "QUAGG.spad" 1651333 1651344 1652474 1652501) (-1005 "QQUTAST.spad" 1651101 1651110 1651323 1651328) (-1004 "QFORM.spad" 1650719 1650734 1651091 1651096) (-1003 "QFCAT.spad" 1649421 1649432 1650621 1650714) (-1002 "QFCAT.spad" 1647714 1647727 1648916 1648921) (-1001 "QFCAT2.spad" 1647406 1647423 1647704 1647709) (-1000 "QEQUAT.spad" 1646964 1646973 1647396 1647401) (-999 "QCMPACK.spad" 1641711 1641730 1646954 1646959) (-998 "QALGSET.spad" 1637790 1637822 1641625 1641630) (-997 "QALGSET2.spad" 1635786 1635804 1637780 1637785) (-996 "PWFFINTB.spad" 1633202 1633223 1635776 1635781) (-995 "PUSHVAR.spad" 1632541 1632560 1633192 1633197) (-994 "PTRANFN.spad" 1628669 1628679 1632531 1632536) (-993 "PTPACK.spad" 1625757 1625767 1628659 1628664) (-992 "PTFUNC2.spad" 1625580 1625594 1625747 1625752) (-991 "PTCAT.spad" 1624835 1624845 1625548 1625575) (-990 "PSQFR.spad" 1624142 1624166 1624825 1624830) (-989 "PSEUDLIN.spad" 1623028 1623038 1624132 1624137) (-988 "PSETPK.spad" 1608461 1608477 1622906 1622911) (-987 "PSETCAT.spad" 1602381 1602404 1608441 1608456) (-986 "PSETCAT.spad" 1596275 1596300 1602337 1602342) (-985 "PSCURVE.spad" 1595258 1595266 1596265 1596270) (-984 "PSCAT.spad" 1594041 1594070 1595156 1595253) (-983 "PSCAT.spad" 1592914 1592945 1594031 1594036) (-982 "PRTITION.spad" 1591612 1591620 1592904 1592909) (-981 "PRTDAST.spad" 1591331 1591339 1591602 1591607) (-980 "PRS.spad" 1580893 1580910 1591287 1591292) (-979 "PRQAGG.spad" 1580328 1580338 1580861 1580888) (-978 "PROPLOG.spad" 1579900 1579908 1580318 1580323) (-977 "PROPFUN2.spad" 1579523 1579536 1579890 1579895) (-976 "PROPFUN1.spad" 1578921 1578932 1579513 1579518) (-975 "PROPFRML.spad" 1577489 1577500 1578911 1578916) (-974 "PROPERTY.spad" 1576977 1576985 1577479 1577484) (-973 "PRODUCT.spad" 1574659 1574671 1574943 1574998) (-972 "PR.spad" 1573051 1573063 1573750 1573877) (-971 "PRINT.spad" 1572803 1572811 1573041 1573046) (-970 "PRIMES.spad" 1571056 1571066 1572793 1572798) (-969 "PRIMELT.spad" 1569137 1569151 1571046 1571051) (-968 "PRIMCAT.spad" 1568764 1568772 1569127 1569132) (-967 "PRIMARR.spad" 1567769 1567779 1567947 1567974) (-966 "PRIMARR2.spad" 1566536 1566548 1567759 1567764) (-965 "PREASSOC.spad" 1565918 1565930 1566526 1566531) (-964 "PPCURVE.spad" 1565055 1565063 1565908 1565913) (-963 "PORTNUM.spad" 1564830 1564838 1565045 1565050) (-962 "POLYROOT.spad" 1563679 1563701 1564786 1564791) (-961 "POLY.spad" 1561014 1561024 1561529 1561656) (-960 "POLYLIFT.spad" 1560279 1560302 1561004 1561009) (-959 "POLYCATQ.spad" 1558397 1558419 1560269 1560274) (-958 "POLYCAT.spad" 1551867 1551888 1558265 1558392) (-957 "POLYCAT.spad" 1544675 1544698 1551075 1551080) (-956 "POLY2UP.spad" 1544127 1544141 1544665 1544670) (-955 "POLY2.spad" 1543724 1543736 1544117 1544122) (-954 "POLUTIL.spad" 1542665 1542694 1543680 1543685) (-953 "POLTOPOL.spad" 1541413 1541428 1542655 1542660) (-952 "POINT.spad" 1540251 1540261 1540338 1540365) (-951 "PNTHEORY.spad" 1536953 1536961 1540241 1540246) (-950 "PMTOOLS.spad" 1535728 1535742 1536943 1536948) (-949 "PMSYM.spad" 1535277 1535287 1535718 1535723) (-948 "PMQFCAT.spad" 1534868 1534882 1535267 1535272) (-947 "PMPRED.spad" 1534347 1534361 1534858 1534863) (-946 "PMPREDFS.spad" 1533801 1533823 1534337 1534342) (-945 "PMPLCAT.spad" 1532881 1532899 1533733 1533738) (-944 "PMLSAGG.spad" 1532466 1532480 1532871 1532876) (-943 "PMKERNEL.spad" 1532045 1532057 1532456 1532461) (-942 "PMINS.spad" 1531625 1531635 1532035 1532040) (-941 "PMFS.spad" 1531202 1531220 1531615 1531620) (-940 "PMDOWN.spad" 1530492 1530506 1531192 1531197) (-939 "PMASS.spad" 1529502 1529510 1530482 1530487) (-938 "PMASSFS.spad" 1528469 1528485 1529492 1529497) (-937 "PLOTTOOL.spad" 1528249 1528257 1528459 1528464) (-936 "PLOT.spad" 1523172 1523180 1528239 1528244) (-935 "PLOT3D.spad" 1519636 1519644 1523162 1523167) (-934 "PLOT1.spad" 1518793 1518803 1519626 1519631) (-933 "PLEQN.spad" 1506083 1506110 1518783 1518788) (-932 "PINTERP.spad" 1505705 1505724 1506073 1506078) (-931 "PINTERPA.spad" 1505489 1505505 1505695 1505700) (-930 "PI.spad" 1505098 1505106 1505463 1505484) (-929 "PID.spad" 1504068 1504076 1505024 1505093) (-928 "PICOERCE.spad" 1503725 1503735 1504058 1504063) (-927 "PGROEB.spad" 1502326 1502340 1503715 1503720) (-926 "PGE.spad" 1493943 1493951 1502316 1502321) (-925 "PGCD.spad" 1492833 1492850 1493933 1493938) (-924 "PFRPAC.spad" 1491982 1491992 1492823 1492828) (-923 "PFR.spad" 1488645 1488655 1491884 1491977) (-922 "PFOTOOLS.spad" 1487903 1487919 1488635 1488640) (-921 "PFOQ.spad" 1487273 1487291 1487893 1487898) (-920 "PFO.spad" 1486692 1486719 1487263 1487268) (-919 "PF.spad" 1486266 1486278 1486497 1486590) (-918 "PFECAT.spad" 1483948 1483956 1486192 1486261) (-917 "PFECAT.spad" 1481658 1481668 1483904 1483909) (-916 "PFBRU.spad" 1479546 1479558 1481648 1481653) (-915 "PFBR.spad" 1477106 1477129 1479536 1479541) (-914 "PERM.spad" 1472913 1472923 1476936 1476951) (-913 "PERMGRP.spad" 1467683 1467693 1472903 1472908) (-912 "PERMCAT.spad" 1466344 1466354 1467663 1467678) (-911 "PERMAN.spad" 1464876 1464890 1466334 1466339) (-910 "PENDTREE.spad" 1464217 1464227 1464505 1464510) (-909 "PDRING.spad" 1462768 1462778 1464197 1464212) (-908 "PDRING.spad" 1461327 1461339 1462758 1462763) (-907 "PDEPROB.spad" 1460342 1460350 1461317 1461322) (-906 "PDEPACK.spad" 1454382 1454390 1460332 1460337) (-905 "PDECOMP.spad" 1453852 1453869 1454372 1454377) (-904 "PDECAT.spad" 1452208 1452216 1453842 1453847) (-903 "PCOMP.spad" 1452061 1452074 1452198 1452203) (-902 "PBWLB.spad" 1450649 1450666 1452051 1452056) (-901 "PATTERN.spad" 1445188 1445198 1450639 1450644) (-900 "PATTERN2.spad" 1444926 1444938 1445178 1445183) (-899 "PATTERN1.spad" 1443262 1443278 1444916 1444921) (-898 "PATRES.spad" 1440837 1440849 1443252 1443257) (-897 "PATRES2.spad" 1440509 1440523 1440827 1440832) (-896 "PATMATCH.spad" 1438706 1438737 1440217 1440222) (-895 "PATMAB.spad" 1438135 1438145 1438696 1438701) (-894 "PATLRES.spad" 1437221 1437235 1438125 1438130) (-893 "PATAB.spad" 1436985 1436995 1437211 1437216) (-892 "PARTPERM.spad" 1434993 1435001 1436975 1436980) (-891 "PARSURF.spad" 1434427 1434455 1434983 1434988) (-890 "PARSU2.spad" 1434224 1434240 1434417 1434422) (-889 "script-parser.spad" 1433744 1433752 1434214 1434219) (-888 "PARSCURV.spad" 1433178 1433206 1433734 1433739) (-887 "PARSC2.spad" 1432969 1432985 1433168 1433173) (-886 "PARPCURV.spad" 1432431 1432459 1432959 1432964) (-885 "PARPC2.spad" 1432222 1432238 1432421 1432426) (-884 "PARAMAST.spad" 1431350 1431358 1432212 1432217) (-883 "PAN2EXPR.spad" 1430762 1430770 1431340 1431345) (-882 "PALETTE.spad" 1429732 1429740 1430752 1430757) (-881 "PAIR.spad" 1428719 1428732 1429320 1429325) (-880 "PADICRC.spad" 1426053 1426071 1427224 1427317) (-879 "PADICRAT.spad" 1424068 1424080 1424289 1424382) (-878 "PADIC.spad" 1423763 1423775 1423994 1424063) (-877 "PADICCT.spad" 1422312 1422324 1423689 1423758) (-876 "PADEPAC.spad" 1421001 1421020 1422302 1422307) (-875 "PADE.spad" 1419753 1419769 1420991 1420996) (-874 "OWP.spad" 1418993 1419023 1419611 1419678) (-873 "OVERSET.spad" 1418566 1418574 1418983 1418988) (-872 "OVAR.spad" 1418347 1418370 1418556 1418561) (-871 "OUT.spad" 1417433 1417441 1418337 1418342) (-870 "OUTFORM.spad" 1406825 1406833 1417423 1417428) (-869 "OUTBFILE.spad" 1406243 1406251 1406815 1406820) (-868 "OUTBCON.spad" 1405249 1405257 1406233 1406238) (-867 "OUTBCON.spad" 1404253 1404263 1405239 1405244) (-866 "OSI.spad" 1403728 1403736 1404243 1404248) (-865 "OSGROUP.spad" 1403646 1403654 1403718 1403723) (-864 "ORTHPOL.spad" 1402131 1402141 1403563 1403568) (-863 "OREUP.spad" 1401584 1401612 1401811 1401850) (-862 "ORESUP.spad" 1400885 1400909 1401264 1401303) (-861 "OREPCTO.spad" 1398742 1398754 1400805 1400810) (-860 "OREPCAT.spad" 1392889 1392899 1398698 1398737) (-859 "OREPCAT.spad" 1386926 1386938 1392737 1392742) (-858 "ORDSET.spad" 1386098 1386106 1386916 1386921) (-857 "ORDSET.spad" 1385268 1385278 1386088 1386093) (-856 "ORDRING.spad" 1384658 1384666 1385248 1385263) (-855 "ORDRING.spad" 1384056 1384066 1384648 1384653) (-854 "ORDMON.spad" 1383911 1383919 1384046 1384051) (-853 "ORDFUNS.spad" 1383043 1383059 1383901 1383906) (-852 "ORDFIN.spad" 1382863 1382871 1383033 1383038) (-851 "ORDCOMP.spad" 1381328 1381338 1382410 1382439) (-850 "ORDCOMP2.spad" 1380621 1380633 1381318 1381323) (-849 "OPTPROB.spad" 1379259 1379267 1380611 1380616) (-848 "OPTPACK.spad" 1371668 1371676 1379249 1379254) (-847 "OPTCAT.spad" 1369347 1369355 1371658 1371663) (-846 "OPSIG.spad" 1369001 1369009 1369337 1369342) (-845 "OPQUERY.spad" 1368550 1368558 1368991 1368996) (-844 "OP.spad" 1368292 1368302 1368372 1368439) (-843 "OPERCAT.spad" 1367758 1367768 1368282 1368287) (-842 "OPERCAT.spad" 1367222 1367234 1367748 1367753) (-841 "ONECOMP.spad" 1365967 1365977 1366769 1366798) (-840 "ONECOMP2.spad" 1365391 1365403 1365957 1365962) (-839 "OMSERVER.spad" 1364397 1364405 1365381 1365386) (-838 "OMSAGG.spad" 1364185 1364195 1364353 1364392) (-837 "OMPKG.spad" 1362801 1362809 1364175 1364180) (-836 "OM.spad" 1361774 1361782 1362791 1362796) (-835 "OMLO.spad" 1361175 1361187 1361636 1361675) (-834 "OMEXPR.spad" 1361009 1361019 1361165 1361170) (-833 "OMERR.spad" 1360554 1360562 1360999 1361004) (-832 "OMERRK.spad" 1359588 1359596 1360544 1360549) (-831 "OMENC.spad" 1358932 1358940 1359578 1359583) (-830 "OMDEV.spad" 1353241 1353249 1358922 1358927) (-829 "OMCONN.spad" 1352650 1352658 1353231 1353236) (-828 "OINTDOM.spad" 1352413 1352421 1352576 1352645) (-827 "OFMONOID.spad" 1350536 1350546 1352369 1352374) (-826 "ODVAR.spad" 1349797 1349807 1350526 1350531) (-825 "ODR.spad" 1349441 1349467 1349609 1349758) (-824 "ODPOL.spad" 1346823 1346833 1347163 1347290) (-823 "ODP.spad" 1336670 1336690 1337043 1337174) (-822 "ODETOOLS.spad" 1335319 1335338 1336660 1336665) (-821 "ODESYS.spad" 1333013 1333030 1335309 1335314) (-820 "ODERTRIC.spad" 1329022 1329039 1332970 1332975) (-819 "ODERED.spad" 1328421 1328445 1329012 1329017) (-818 "ODERAT.spad" 1326036 1326053 1328411 1328416) (-817 "ODEPRRIC.spad" 1323073 1323095 1326026 1326031) (-816 "ODEPROB.spad" 1322330 1322338 1323063 1323068) (-815 "ODEPRIM.spad" 1319664 1319686 1322320 1322325) (-814 "ODEPAL.spad" 1319050 1319074 1319654 1319659) (-813 "ODEPACK.spad" 1305716 1305724 1319040 1319045) (-812 "ODEINT.spad" 1305151 1305167 1305706 1305711) (-811 "ODEIFTBL.spad" 1302546 1302554 1305141 1305146) (-810 "ODEEF.spad" 1298037 1298053 1302536 1302541) (-809 "ODECONST.spad" 1297574 1297592 1298027 1298032) (-808 "ODECAT.spad" 1296172 1296180 1297564 1297569) (-807 "OCT.spad" 1294308 1294318 1295022 1295061) (-806 "OCTCT2.spad" 1293954 1293975 1294298 1294303) (-805 "OC.spad" 1291750 1291760 1293910 1293949) (-804 "OC.spad" 1289271 1289283 1291433 1291438) (-803 "OCAMON.spad" 1289119 1289127 1289261 1289266) (-802 "OASGP.spad" 1288934 1288942 1289109 1289114) (-801 "OAMONS.spad" 1288456 1288464 1288924 1288929) (-800 "OAMON.spad" 1288317 1288325 1288446 1288451) (-799 "OAGROUP.spad" 1288179 1288187 1288307 1288312) (-798 "NUMTUBE.spad" 1287770 1287786 1288169 1288174) (-797 "NUMQUAD.spad" 1275746 1275754 1287760 1287765) (-796 "NUMODE.spad" 1267100 1267108 1275736 1275741) (-795 "NUMINT.spad" 1264666 1264674 1267090 1267095) (-794 "NUMFMT.spad" 1263506 1263514 1264656 1264661) (-793 "NUMERIC.spad" 1255620 1255630 1263311 1263316) (-792 "NTSCAT.spad" 1254128 1254144 1255588 1255615) (-791 "NTPOLFN.spad" 1253679 1253689 1254045 1254050) (-790 "NSUP.spad" 1246725 1246735 1251265 1251418) (-789 "NSUP2.spad" 1246117 1246129 1246715 1246720) (-788 "NSMP.spad" 1242347 1242366 1242655 1242782) (-787 "NREP.spad" 1240725 1240739 1242337 1242342) (-786 "NPCOEF.spad" 1239971 1239991 1240715 1240720) (-785 "NORMRETR.spad" 1239569 1239608 1239961 1239966) (-784 "NORMPK.spad" 1237471 1237490 1239559 1239564) (-783 "NORMMA.spad" 1237159 1237185 1237461 1237466) (-782 "NONE.spad" 1236900 1236908 1237149 1237154) (-781 "NONE1.spad" 1236576 1236586 1236890 1236895) (-780 "NODE1.spad" 1236063 1236079 1236566 1236571) (-779 "NNI.spad" 1234958 1234966 1236037 1236058) (-778 "NLINSOL.spad" 1233584 1233594 1234948 1234953) (-777 "NIPROB.spad" 1232125 1232133 1233574 1233579) (-776 "NFINTBAS.spad" 1229685 1229702 1232115 1232120) (-775 "NETCLT.spad" 1229659 1229670 1229675 1229680) (-774 "NCODIV.spad" 1227875 1227891 1229649 1229654) (-773 "NCNTFRAC.spad" 1227517 1227531 1227865 1227870) (-772 "NCEP.spad" 1225683 1225697 1227507 1227512) (-771 "NASRING.spad" 1225279 1225287 1225673 1225678) (-770 "NASRING.spad" 1224873 1224883 1225269 1225274) (-769 "NARNG.spad" 1224225 1224233 1224863 1224868) (-768 "NARNG.spad" 1223575 1223585 1224215 1224220) (-767 "NAGSP.spad" 1222652 1222660 1223565 1223570) (-766 "NAGS.spad" 1212313 1212321 1222642 1222647) (-765 "NAGF07.spad" 1210744 1210752 1212303 1212308) (-764 "NAGF04.spad" 1205146 1205154 1210734 1210739) (-763 "NAGF02.spad" 1199215 1199223 1205136 1205141) (-762 "NAGF01.spad" 1194976 1194984 1199205 1199210) (-761 "NAGE04.spad" 1188676 1188684 1194966 1194971) (-760 "NAGE02.spad" 1179336 1179344 1188666 1188671) (-759 "NAGE01.spad" 1175338 1175346 1179326 1179331) (-758 "NAGD03.spad" 1173342 1173350 1175328 1175333) (-757 "NAGD02.spad" 1166089 1166097 1173332 1173337) (-756 "NAGD01.spad" 1160382 1160390 1166079 1166084) (-755 "NAGC06.spad" 1156257 1156265 1160372 1160377) (-754 "NAGC05.spad" 1154758 1154766 1156247 1156252) (-753 "NAGC02.spad" 1154025 1154033 1154748 1154753) (-752 "NAALG.spad" 1153566 1153576 1153993 1154020) (-751 "NAALG.spad" 1153127 1153139 1153556 1153561) (-750 "MULTSQFR.spad" 1150085 1150102 1153117 1153122) (-749 "MULTFACT.spad" 1149468 1149485 1150075 1150080) (-748 "MTSCAT.spad" 1147562 1147583 1149366 1149463) (-747 "MTHING.spad" 1147221 1147231 1147552 1147557) (-746 "MSYSCMD.spad" 1146655 1146663 1147211 1147216) (-745 "MSET.spad" 1144613 1144623 1146361 1146400) (-744 "MSETAGG.spad" 1144458 1144468 1144581 1144608) (-743 "MRING.spad" 1141435 1141447 1144166 1144233) (-742 "MRF2.spad" 1141005 1141019 1141425 1141430) (-741 "MRATFAC.spad" 1140551 1140568 1140995 1141000) (-740 "MPRFF.spad" 1138591 1138610 1140541 1140546) (-739 "MPOLY.spad" 1136062 1136077 1136421 1136548) (-738 "MPCPF.spad" 1135326 1135345 1136052 1136057) (-737 "MPC3.spad" 1135143 1135183 1135316 1135321) (-736 "MPC2.spad" 1134789 1134822 1135133 1135138) (-735 "MONOTOOL.spad" 1133140 1133157 1134779 1134784) (-734 "MONOID.spad" 1132459 1132467 1133130 1133135) (-733 "MONOID.spad" 1131776 1131786 1132449 1132454) (-732 "MONOGEN.spad" 1130524 1130537 1131636 1131771) (-731 "MONOGEN.spad" 1129294 1129309 1130408 1130413) (-730 "MONADWU.spad" 1127324 1127332 1129284 1129289) (-729 "MONADWU.spad" 1125352 1125362 1127314 1127319) (-728 "MONAD.spad" 1124512 1124520 1125342 1125347) (-727 "MONAD.spad" 1123670 1123680 1124502 1124507) (-726 "MOEBIUS.spad" 1122406 1122420 1123650 1123665) (-725 "MODULE.spad" 1122276 1122286 1122374 1122401) (-724 "MODULE.spad" 1122166 1122178 1122266 1122271) (-723 "MODRING.spad" 1121501 1121540 1122146 1122161) (-722 "MODOP.spad" 1120166 1120178 1121323 1121390) (-721 "MODMONOM.spad" 1119897 1119915 1120156 1120161) (-720 "MODMON.spad" 1116692 1116708 1117411 1117564) (-719 "MODFIELD.spad" 1116054 1116093 1116594 1116687) (-718 "MMLFORM.spad" 1114914 1114922 1116044 1116049) (-717 "MMAP.spad" 1114656 1114690 1114904 1114909) (-716 "MLO.spad" 1113115 1113125 1114612 1114651) (-715 "MLIFT.spad" 1111727 1111744 1113105 1113110) (-714 "MKUCFUNC.spad" 1111262 1111280 1111717 1111722) (-713 "MKRECORD.spad" 1110866 1110879 1111252 1111257) (-712 "MKFUNC.spad" 1110273 1110283 1110856 1110861) (-711 "MKFLCFN.spad" 1109241 1109251 1110263 1110268) (-710 "MKBCFUNC.spad" 1108736 1108754 1109231 1109236) (-709 "MINT.spad" 1108175 1108183 1108638 1108731) (-708 "MHROWRED.spad" 1106686 1106696 1108165 1108170) (-707 "MFLOAT.spad" 1105206 1105214 1106576 1106681) (-706 "MFINFACT.spad" 1104606 1104628 1105196 1105201) (-705 "MESH.spad" 1102388 1102396 1104596 1104601) (-704 "MDDFACT.spad" 1100599 1100609 1102378 1102383) (-703 "MDAGG.spad" 1099890 1099900 1100579 1100594) (-702 "MCMPLX.spad" 1095901 1095909 1096515 1096716) (-701 "MCDEN.spad" 1095111 1095123 1095891 1095896) (-700 "MCALCFN.spad" 1092233 1092259 1095101 1095106) (-699 "MAYBE.spad" 1091517 1091528 1092223 1092228) (-698 "MATSTOR.spad" 1088825 1088835 1091507 1091512) (-697 "MATRIX.spad" 1087529 1087539 1088013 1088040) (-696 "MATLIN.spad" 1084873 1084897 1087413 1087418) (-695 "MATCAT.spad" 1076602 1076624 1084841 1084868) (-694 "MATCAT.spad" 1068203 1068227 1076444 1076449) (-693 "MATCAT2.spad" 1067485 1067533 1068193 1068198) (-692 "MAPPKG3.spad" 1066400 1066414 1067475 1067480) (-691 "MAPPKG2.spad" 1065738 1065750 1066390 1066395) (-690 "MAPPKG1.spad" 1064566 1064576 1065728 1065733) (-689 "MAPPAST.spad" 1063881 1063889 1064556 1064561) (-688 "MAPHACK3.spad" 1063693 1063707 1063871 1063876) (-687 "MAPHACK2.spad" 1063462 1063474 1063683 1063688) (-686 "MAPHACK1.spad" 1063106 1063116 1063452 1063457) (-685 "MAGMA.spad" 1060896 1060913 1063096 1063101) (-684 "MACROAST.spad" 1060475 1060483 1060886 1060891) (-683 "M3D.spad" 1058195 1058205 1059853 1059858) (-682 "LZSTAGG.spad" 1055433 1055443 1058185 1058190) (-681 "LZSTAGG.spad" 1052669 1052681 1055423 1055428) (-680 "LWORD.spad" 1049374 1049391 1052659 1052664) (-679 "LSTAST.spad" 1049158 1049166 1049364 1049369) (-678 "LSQM.spad" 1047388 1047402 1047782 1047833) (-677 "LSPP.spad" 1046923 1046940 1047378 1047383) (-676 "LSMP.spad" 1045773 1045801 1046913 1046918) (-675 "LSMP1.spad" 1043591 1043605 1045763 1045768) (-674 "LSAGG.spad" 1043260 1043270 1043559 1043586) (-673 "LSAGG.spad" 1042949 1042961 1043250 1043255) (-672 "LPOLY.spad" 1041903 1041922 1042805 1042874) (-671 "LPEFRAC.spad" 1041174 1041184 1041893 1041898) (-670 "LO.spad" 1040575 1040589 1041108 1041135) (-669 "LOGIC.spad" 1040177 1040185 1040565 1040570) (-668 "LOGIC.spad" 1039777 1039787 1040167 1040172) (-667 "LODOOPS.spad" 1038707 1038719 1039767 1039772) (-666 "LODO.spad" 1038091 1038107 1038387 1038426) (-665 "LODOF.spad" 1037137 1037154 1038048 1038053) (-664 "LODOCAT.spad" 1035803 1035813 1037093 1037132) (-663 "LODOCAT.spad" 1034467 1034479 1035759 1035764) (-662 "LODO2.spad" 1033740 1033752 1034147 1034186) (-661 "LODO1.spad" 1033140 1033150 1033420 1033459) (-660 "LODEEF.spad" 1031942 1031960 1033130 1033135) (-659 "LNAGG.spad" 1028089 1028099 1031932 1031937) (-658 "LNAGG.spad" 1024200 1024212 1028045 1028050) (-657 "LMOPS.spad" 1020968 1020985 1024190 1024195) (-656 "LMODULE.spad" 1020736 1020746 1020958 1020963) (-655 "LMDICT.spad" 1020023 1020033 1020287 1020314) (-654 "LLINSET.spad" 1019420 1019430 1020013 1020018) (-653 "LITERAL.spad" 1019326 1019337 1019410 1019415) (-652 "LIST.spad" 1017061 1017071 1018473 1018500) (-651 "LIST3.spad" 1016372 1016386 1017051 1017056) (-650 "LIST2.spad" 1015074 1015086 1016362 1016367) (-649 "LIST2MAP.spad" 1011977 1011989 1015064 1015069) (-648 "LINSET.spad" 1011599 1011609 1011967 1011972) (-647 "LINEXP.spad" 1011033 1011043 1011579 1011594) (-646 "LINDEP.spad" 1009842 1009854 1010945 1010950) (-645 "LIMITRF.spad" 1007770 1007780 1009832 1009837) (-644 "LIMITPS.spad" 1006673 1006686 1007760 1007765) (-643 "LIE.spad" 1004689 1004701 1005963 1006108) (-642 "LIECAT.spad" 1004165 1004175 1004615 1004684) (-641 "LIECAT.spad" 1003669 1003681 1004121 1004126) (-640 "LIB.spad" 1001882 1001890 1002328 1002343) (-639 "LGROBP.spad" 999235 999254 1001872 1001877) (-638 "LF.spad" 998190 998206 999225 999230) (-637 "LFCAT.spad" 997249 997257 998180 998185) (-636 "LEXTRIPK.spad" 992752 992767 997239 997244) (-635 "LEXP.spad" 990755 990782 992732 992747) (-634 "LETAST.spad" 990454 990462 990745 990750) (-633 "LEADCDET.spad" 988852 988869 990444 990449) (-632 "LAZM3PK.spad" 987556 987578 988842 988847) (-631 "LAUPOL.spad" 986249 986262 987149 987218) (-630 "LAPLACE.spad" 985832 985848 986239 986244) (-629 "LA.spad" 985272 985286 985754 985793) (-628 "LALG.spad" 985048 985058 985252 985267) (-627 "LALG.spad" 984832 984844 985038 985043) (-626 "KVTFROM.spad" 984567 984577 984822 984827) (-625 "KTVLOGIC.spad" 984079 984087 984557 984562) (-624 "KRCFROM.spad" 983817 983827 984069 984074) (-623 "KOVACIC.spad" 982540 982557 983807 983812) (-622 "KONVERT.spad" 982262 982272 982530 982535) (-621 "KOERCE.spad" 981999 982009 982252 982257) (-620 "KERNEL.spad" 980654 980664 981783 981788) (-619 "KERNEL2.spad" 980357 980369 980644 980649) (-618 "KDAGG.spad" 979466 979488 980337 980352) (-617 "KDAGG.spad" 978583 978607 979456 979461) (-616 "KAFILE.spad" 977546 977562 977781 977808) (-615 "JORDAN.spad" 975375 975387 976836 976981) (-614 "JOINAST.spad" 975069 975077 975365 975370) (-613 "JAVACODE.spad" 974935 974943 975059 975064) (-612 "IXAGG.spad" 973068 973092 974925 974930) (-611 "IXAGG.spad" 971056 971082 972915 972920) (-610 "IVECTOR.spad" 969826 969841 969981 970008) (-609 "ITUPLE.spad" 968987 968997 969816 969821) (-608 "ITRIGMNP.spad" 967826 967845 968977 968982) (-607 "ITFUN3.spad" 967332 967346 967816 967821) (-606 "ITFUN2.spad" 967076 967088 967322 967327) (-605 "ITFORM.spad" 966431 966439 967066 967071) (-604 "ITAYLOR.spad" 964425 964440 966295 966392) (-603 "ISUPS.spad" 956862 956877 963399 963496) (-602 "ISUMP.spad" 956363 956379 956852 956857) (-601 "ISTRING.spad" 955451 955464 955532 955559) (-600 "ISAST.spad" 955170 955178 955441 955446) (-599 "IRURPK.spad" 953887 953906 955160 955165) (-598 "IRSN.spad" 951859 951867 953877 953882) (-597 "IRRF2F.spad" 950344 950354 951815 951820) (-596 "IRREDFFX.spad" 949945 949956 950334 950339) (-595 "IROOT.spad" 948284 948294 949935 949940) (-594 "IR.spad" 946085 946099 948139 948166) (-593 "IRFORM.spad" 945409 945417 946075 946080) (-592 "IR2.spad" 944437 944453 945399 945404) (-591 "IR2F.spad" 943643 943659 944427 944432) (-590 "IPRNTPK.spad" 943403 943411 943633 943638) (-589 "IPF.spad" 942968 942980 943208 943301) (-588 "IPADIC.spad" 942729 942755 942894 942963) (-587 "IP4ADDR.spad" 942286 942294 942719 942724) (-586 "IOMODE.spad" 941808 941816 942276 942281) (-585 "IOBFILE.spad" 941169 941177 941798 941803) (-584 "IOBCON.spad" 941034 941042 941159 941164) (-583 "INVLAPLA.spad" 940683 940699 941024 941029) (-582 "INTTR.spad" 934065 934082 940673 940678) (-581 "INTTOOLS.spad" 931820 931836 933639 933644) (-580 "INTSLPE.spad" 931140 931148 931810 931815) (-579 "INTRVL.spad" 930706 930716 931054 931135) (-578 "INTRF.spad" 929130 929144 930696 930701) (-577 "INTRET.spad" 928562 928572 929120 929125) (-576 "INTRAT.spad" 927289 927306 928552 928557) (-575 "INTPM.spad" 925674 925690 926932 926937) (-574 "INTPAF.spad" 923538 923556 925606 925611) (-573 "INTPACK.spad" 913912 913920 923528 923533) (-572 "INT.spad" 913360 913368 913766 913907) (-571 "INTHERTR.spad" 912634 912651 913350 913355) (-570 "INTHERAL.spad" 912304 912328 912624 912629) (-569 "INTHEORY.spad" 908743 908751 912294 912299) (-568 "INTG0.spad" 902476 902494 908675 908680) (-567 "INTFTBL.spad" 896505 896513 902466 902471) (-566 "INTFACT.spad" 895564 895574 896495 896500) (-565 "INTEF.spad" 893949 893965 895554 895559) (-564 "INTDOM.spad" 892572 892580 893875 893944) (-563 "INTDOM.spad" 891257 891267 892562 892567) (-562 "INTCAT.spad" 889516 889526 891171 891252) (-561 "INTBIT.spad" 889023 889031 889506 889511) (-560 "INTALG.spad" 888211 888238 889013 889018) (-559 "INTAF.spad" 887711 887727 888201 888206) (-558 "INTABL.spad" 886229 886260 886392 886419) (-557 "INT8.spad" 886109 886117 886219 886224) (-556 "INT64.spad" 885988 885996 886099 886104) (-555 "INT32.spad" 885867 885875 885978 885983) (-554 "INT16.spad" 885746 885754 885857 885862) (-553 "INS.spad" 883249 883257 885648 885741) (-552 "INS.spad" 880838 880848 883239 883244) (-551 "INPSIGN.spad" 880286 880299 880828 880833) (-550 "INPRODPF.spad" 879382 879401 880276 880281) (-549 "INPRODFF.spad" 878470 878494 879372 879377) (-548 "INNMFACT.spad" 877445 877462 878460 878465) (-547 "INMODGCD.spad" 876933 876963 877435 877440) (-546 "INFSP.spad" 875230 875252 876923 876928) (-545 "INFPROD0.spad" 874310 874329 875220 875225) (-544 "INFORM.spad" 871509 871517 874300 874305) (-543 "INFORM1.spad" 871134 871144 871499 871504) (-542 "INFINITY.spad" 870686 870694 871124 871129) (-541 "INETCLTS.spad" 870663 870671 870676 870681) (-540 "INEP.spad" 869201 869223 870653 870658) (-539 "INDE.spad" 868930 868947 869191 869196) (-538 "INCRMAPS.spad" 868351 868361 868920 868925) (-537 "INBFILE.spad" 867423 867431 868341 868346) (-536 "INBFF.spad" 863217 863228 867413 867418) (-535 "INBCON.spad" 861507 861515 863207 863212) (-534 "INBCON.spad" 859795 859805 861497 861502) (-533 "INAST.spad" 859456 859464 859785 859790) (-532 "IMPTAST.spad" 859164 859172 859446 859451) (-531 "IMATRIX.spad" 858109 858135 858621 858648) (-530 "IMATQF.spad" 857203 857247 858065 858070) (-529 "IMATLIN.spad" 855808 855832 857159 857164) (-528 "ILIST.spad" 854466 854481 854991 855018) (-527 "IIARRAY2.spad" 853854 853892 854073 854100) (-526 "IFF.spad" 853264 853280 853535 853628) (-525 "IFAST.spad" 852878 852886 853254 853259) (-524 "IFARRAY.spad" 850371 850386 852061 852088) (-523 "IFAMON.spad" 850233 850250 850327 850332) (-522 "IEVALAB.spad" 849638 849650 850223 850228) (-521 "IEVALAB.spad" 849041 849055 849628 849633) (-520 "IDPO.spad" 848839 848851 849031 849036) (-519 "IDPOAMS.spad" 848595 848607 848829 848834) (-518 "IDPOAM.spad" 848315 848327 848585 848590) (-517 "IDPC.spad" 847253 847265 848305 848310) (-516 "IDPAM.spad" 846998 847010 847243 847248) (-515 "IDPAG.spad" 846745 846757 846988 846993) (-514 "IDENT.spad" 846395 846403 846735 846740) (-513 "IDECOMP.spad" 843634 843652 846385 846390) (-512 "IDEAL.spad" 838583 838622 843569 843574) (-511 "ICDEN.spad" 837772 837788 838573 838578) (-510 "ICARD.spad" 836963 836971 837762 837767) (-509 "IBPTOOLS.spad" 835570 835587 836953 836958) (-508 "IBITS.spad" 834773 834786 835206 835233) (-507 "IBATOOL.spad" 831750 831769 834763 834768) (-506 "IBACHIN.spad" 830257 830272 831740 831745) (-505 "IARRAY2.spad" 829245 829271 829864 829891) (-504 "IARRAY1.spad" 828290 828305 828428 828455) (-503 "IAN.spad" 826513 826521 828106 828199) (-502 "IALGFACT.spad" 826116 826149 826503 826508) (-501 "HYPCAT.spad" 825540 825548 826106 826111) (-500 "HYPCAT.spad" 824962 824972 825530 825535) (-499 "HOSTNAME.spad" 824770 824778 824952 824957) (-498 "HOMOTOP.spad" 824513 824523 824760 824765) (-497 "HOAGG.spad" 821795 821805 824503 824508) (-496 "HOAGG.spad" 818852 818864 821562 821567) (-495 "HEXADEC.spad" 816954 816962 817319 817412) (-494 "HEUGCD.spad" 815989 816000 816944 816949) (-493 "HELLFDIV.spad" 815579 815603 815979 815984) (-492 "HEAP.spad" 814971 814981 815186 815213) (-491 "HEADAST.spad" 814504 814512 814961 814966) (-490 "HDP.spad" 804347 804363 804724 804855) (-489 "HDMP.spad" 801561 801576 802177 802304) (-488 "HB.spad" 799812 799820 801551 801556) (-487 "HASHTBL.spad" 798282 798313 798493 798520) (-486 "HASAST.spad" 797998 798006 798272 798277) (-485 "HACKPI.spad" 797489 797497 797900 797993) (-484 "GTSET.spad" 796428 796444 797135 797162) (-483 "GSTBL.spad" 794947 794982 795121 795136) (-482 "GSERIES.spad" 792118 792145 793079 793228) (-481 "GROUP.spad" 791391 791399 792098 792113) (-480 "GROUP.spad" 790672 790682 791381 791386) (-479 "GROEBSOL.spad" 789166 789187 790662 790667) (-478 "GRMOD.spad" 787737 787749 789156 789161) (-477 "GRMOD.spad" 786306 786320 787727 787732) (-476 "GRIMAGE.spad" 779195 779203 786296 786301) (-475 "GRDEF.spad" 777574 777582 779185 779190) (-474 "GRAY.spad" 776037 776045 777564 777569) (-473 "GRALG.spad" 775114 775126 776027 776032) (-472 "GRALG.spad" 774189 774203 775104 775109) (-471 "GPOLSET.spad" 773643 773666 773871 773898) (-470 "GOSPER.spad" 772912 772930 773633 773638) (-469 "GMODPOL.spad" 772060 772087 772880 772907) (-468 "GHENSEL.spad" 771143 771157 772050 772055) (-467 "GENUPS.spad" 767436 767449 771133 771138) (-466 "GENUFACT.spad" 767013 767023 767426 767431) (-465 "GENPGCD.spad" 766599 766616 767003 767008) (-464 "GENMFACT.spad" 766051 766070 766589 766594) (-463 "GENEEZ.spad" 764002 764015 766041 766046) (-462 "GDMP.spad" 761058 761075 761832 761959) (-461 "GCNAALG.spad" 754981 755008 760852 760919) (-460 "GCDDOM.spad" 754157 754165 754907 754976) (-459 "GCDDOM.spad" 753395 753405 754147 754152) (-458 "GB.spad" 750921 750959 753351 753356) (-457 "GBINTERN.spad" 746941 746979 750911 750916) (-456 "GBF.spad" 742708 742746 746931 746936) (-455 "GBEUCLID.spad" 740590 740628 742698 742703) (-454 "GAUSSFAC.spad" 739903 739911 740580 740585) (-453 "GALUTIL.spad" 738229 738239 739859 739864) (-452 "GALPOLYU.spad" 736683 736696 738219 738224) (-451 "GALFACTU.spad" 734856 734875 736673 736678) (-450 "GALFACT.spad" 725045 725056 734846 734851) (-449 "FVFUN.spad" 722068 722076 725035 725040) (-448 "FVC.spad" 721120 721128 722058 722063) (-447 "FUNDESC.spad" 720798 720806 721110 721115) (-446 "FUNCTION.spad" 720647 720659 720788 720793) (-445 "FT.spad" 718944 718952 720637 720642) (-444 "FTEM.spad" 718109 718117 718934 718939) (-443 "FSUPFACT.spad" 717009 717028 718045 718050) (-442 "FST.spad" 715095 715103 716999 717004) (-441 "FSRED.spad" 714575 714591 715085 715090) (-440 "FSPRMELT.spad" 713457 713473 714532 714537) (-439 "FSPECF.spad" 711548 711564 713447 713452) (-438 "FS.spad" 705816 705826 711323 711543) (-437 "FS.spad" 699862 699874 705371 705376) (-436 "FSINT.spad" 699522 699538 699852 699857) (-435 "FSERIES.spad" 698713 698725 699342 699441) (-434 "FSCINT.spad" 698030 698046 698703 698708) (-433 "FSAGG.spad" 697147 697157 697986 698025) (-432 "FSAGG.spad" 696226 696238 697067 697072) (-431 "FSAGG2.spad" 694969 694985 696216 696221) (-430 "FS2UPS.spad" 689460 689494 694959 694964) (-429 "FS2.spad" 689107 689123 689450 689455) (-428 "FS2EXPXP.spad" 688232 688255 689097 689102) (-427 "FRUTIL.spad" 687186 687196 688222 688227) (-426 "FR.spad" 680718 680728 686026 686095) (-425 "FRNAALG.spad" 675987 675997 680660 680713) (-424 "FRNAALG.spad" 671268 671280 675943 675948) (-423 "FRNAAF2.spad" 670724 670742 671258 671263) (-422 "FRMOD.spad" 670134 670164 670655 670660) (-421 "FRIDEAL.spad" 669359 669380 670114 670129) (-420 "FRIDEAL2.spad" 668963 668995 669349 669354) (-419 "FRETRCT.spad" 668474 668484 668953 668958) (-418 "FRETRCT.spad" 667851 667863 668332 668337) (-417 "FRAMALG.spad" 666199 666212 667807 667846) (-416 "FRAMALG.spad" 664579 664594 666189 666194) (-415 "FRAC.spad" 661678 661688 662081 662254) (-414 "FRAC2.spad" 661283 661295 661668 661673) (-413 "FR2.spad" 660619 660631 661273 661278) (-412 "FPS.spad" 657434 657442 660509 660614) (-411 "FPS.spad" 654277 654287 657354 657359) (-410 "FPC.spad" 653323 653331 654179 654272) (-409 "FPC.spad" 652455 652465 653313 653318) (-408 "FPATMAB.spad" 652217 652227 652445 652450) (-407 "FPARFRAC.spad" 650704 650721 652207 652212) (-406 "FORTRAN.spad" 649210 649253 650694 650699) (-405 "FORT.spad" 648159 648167 649200 649205) (-404 "FORTFN.spad" 645329 645337 648149 648154) (-403 "FORTCAT.spad" 645013 645021 645319 645324) (-402 "FORMULA.spad" 642487 642495 645003 645008) (-401 "FORMULA1.spad" 641966 641976 642477 642482) (-400 "FORDER.spad" 641657 641681 641956 641961) (-399 "FOP.spad" 640858 640866 641647 641652) (-398 "FNLA.spad" 640282 640304 640826 640853) (-397 "FNCAT.spad" 638877 638885 640272 640277) (-396 "FNAME.spad" 638769 638777 638867 638872) (-395 "FMTC.spad" 638567 638575 638695 638764) (-394 "FMONOID.spad" 638232 638242 638523 638528) (-393 "FMONCAT.spad" 635385 635395 638222 638227) (-392 "FM.spad" 635080 635092 635319 635346) (-391 "FMFUN.spad" 632110 632118 635070 635075) (-390 "FMC.spad" 631162 631170 632100 632105) (-389 "FMCAT.spad" 628830 628848 631130 631157) (-388 "FM1.spad" 628187 628199 628764 628791) (-387 "FLOATRP.spad" 625922 625936 628177 628182) (-386 "FLOAT.spad" 619236 619244 625788 625917) (-385 "FLOATCP.spad" 616667 616681 619226 619231) (-384 "FLINEXP.spad" 616379 616389 616647 616662) (-383 "FLINEXP.spad" 616045 616057 616315 616320) (-382 "FLASORT.spad" 615371 615383 616035 616040) (-381 "FLALG.spad" 613017 613036 615297 615366) (-380 "FLAGG.spad" 610059 610069 612997 613012) (-379 "FLAGG.spad" 607002 607014 609942 609947) (-378 "FLAGG2.spad" 605727 605743 606992 606997) (-377 "FINRALG.spad" 603788 603801 605683 605722) (-376 "FINRALG.spad" 601775 601790 603672 603677) (-375 "FINITE.spad" 600927 600935 601765 601770) (-374 "FINAALG.spad" 590048 590058 600869 600922) (-373 "FINAALG.spad" 579181 579193 590004 590009) (-372 "FILE.spad" 578764 578774 579171 579176) (-371 "FILECAT.spad" 577290 577307 578754 578759) (-370 "FIELD.spad" 576696 576704 577192 577285) (-369 "FIELD.spad" 576188 576198 576686 576691) (-368 "FGROUP.spad" 574835 574845 576168 576183) (-367 "FGLMICPK.spad" 573622 573637 574825 574830) (-366 "FFX.spad" 572997 573012 573338 573431) (-365 "FFSLPE.spad" 572500 572521 572987 572992) (-364 "FFPOLY.spad" 563762 563773 572490 572495) (-363 "FFPOLY2.spad" 562822 562839 563752 563757) (-362 "FFP.spad" 562219 562239 562538 562631) (-361 "FF.spad" 561667 561683 561900 561993) (-360 "FFNBX.spad" 560179 560199 561383 561476) (-359 "FFNBP.spad" 558692 558709 559895 559988) (-358 "FFNB.spad" 557157 557178 558373 558466) (-357 "FFINTBAS.spad" 554671 554690 557147 557152) (-356 "FFIELDC.spad" 552248 552256 554573 554666) (-355 "FFIELDC.spad" 549911 549921 552238 552243) (-354 "FFHOM.spad" 548659 548676 549901 549906) (-353 "FFF.spad" 546094 546105 548649 548654) (-352 "FFCGX.spad" 544941 544961 545810 545903) (-351 "FFCGP.spad" 543830 543850 544657 544750) (-350 "FFCG.spad" 542622 542643 543511 543604) (-349 "FFCAT.spad" 535795 535817 542461 542617) (-348 "FFCAT.spad" 529047 529071 535715 535720) (-347 "FFCAT2.spad" 528794 528834 529037 529042) (-346 "FEXPR.spad" 520511 520557 528550 528589) (-345 "FEVALAB.spad" 520219 520229 520501 520506) (-344 "FEVALAB.spad" 519712 519724 519996 520001) (-343 "FDIV.spad" 519154 519178 519702 519707) (-342 "FDIVCAT.spad" 517218 517242 519144 519149) (-341 "FDIVCAT.spad" 515280 515306 517208 517213) (-340 "FDIV2.spad" 514936 514976 515270 515275) (-339 "FCTRDATA.spad" 513944 513952 514926 514931) (-338 "FCPAK1.spad" 512511 512519 513934 513939) (-337 "FCOMP.spad" 511890 511900 512501 512506) (-336 "FC.spad" 501897 501905 511880 511885) (-335 "FAXF.spad" 494868 494882 501799 501892) (-334 "FAXF.spad" 487891 487907 494824 494829) (-333 "FARRAY.spad" 486041 486051 487074 487101) (-332 "FAMR.spad" 484177 484189 485939 486036) (-331 "FAMR.spad" 482297 482311 484061 484066) (-330 "FAMONOID.spad" 481965 481975 482251 482256) (-329 "FAMONC.spad" 480261 480273 481955 481960) (-328 "FAGROUP.spad" 479885 479895 480157 480184) (-327 "FACUTIL.spad" 478089 478106 479875 479880) (-326 "FACTFUNC.spad" 477283 477293 478079 478084) (-325 "EXPUPXS.spad" 474116 474139 475415 475564) (-324 "EXPRTUBE.spad" 471404 471412 474106 474111) (-323 "EXPRODE.spad" 468564 468580 471394 471399) (-322 "EXPR.spad" 463839 463849 464553 464960) (-321 "EXPR2UPS.spad" 459961 459974 463829 463834) (-320 "EXPR2.spad" 459666 459678 459951 459956) (-319 "EXPEXPAN.spad" 456606 456631 457238 457331) (-318 "EXIT.spad" 456277 456285 456596 456601) (-317 "EXITAST.spad" 456013 456021 456267 456272) (-316 "EVALCYC.spad" 455473 455487 456003 456008) (-315 "EVALAB.spad" 455045 455055 455463 455468) (-314 "EVALAB.spad" 454615 454627 455035 455040) (-313 "EUCDOM.spad" 452189 452197 454541 454610) (-312 "EUCDOM.spad" 449825 449835 452179 452184) (-311 "ESTOOLS.spad" 441671 441679 449815 449820) (-310 "ESTOOLS2.spad" 441274 441288 441661 441666) (-309 "ESTOOLS1.spad" 440959 440970 441264 441269) (-308 "ES.spad" 433774 433782 440949 440954) (-307 "ES.spad" 426495 426505 433672 433677) (-306 "ESCONT.spad" 423288 423296 426485 426490) (-305 "ESCONT1.spad" 423037 423049 423278 423283) (-304 "ES2.spad" 422542 422558 423027 423032) (-303 "ES1.spad" 422112 422128 422532 422537) (-302 "ERROR.spad" 419439 419447 422102 422107) (-301 "EQTBL.spad" 417911 417933 418120 418147) (-300 "EQ.spad" 412716 412726 415503 415615) (-299 "EQ2.spad" 412434 412446 412706 412711) (-298 "EP.spad" 408760 408770 412424 412429) (-297 "ENV.spad" 407438 407446 408750 408755) (-296 "ENTIRER.spad" 407106 407114 407382 407433) (-295 "EMR.spad" 406394 406435 407032 407101) (-294 "ELTAGG.spad" 404648 404667 406384 406389) (-293 "ELTAGG.spad" 402866 402887 404604 404609) (-292 "ELTAB.spad" 402341 402354 402856 402861) (-291 "ELFUTS.spad" 401728 401747 402331 402336) (-290 "ELEMFUN.spad" 401417 401425 401718 401723) (-289 "ELEMFUN.spad" 401104 401114 401407 401412) (-288 "ELAGG.spad" 399075 399085 401084 401099) (-287 "ELAGG.spad" 396983 396995 398994 398999) (-286 "ELABOR.spad" 396329 396337 396973 396978) (-285 "ELABEXPR.spad" 395261 395269 396319 396324) (-284 "EFUPXS.spad" 392037 392067 395217 395222) (-283 "EFULS.spad" 388873 388896 391993 391998) (-282 "EFSTRUC.spad" 386888 386904 388863 388868) (-281 "EF.spad" 381664 381680 386878 386883) (-280 "EAB.spad" 379940 379948 381654 381659) (-279 "E04UCFA.spad" 379476 379484 379930 379935) (-278 "E04NAFA.spad" 379053 379061 379466 379471) (-277 "E04MBFA.spad" 378633 378641 379043 379048) (-276 "E04JAFA.spad" 378169 378177 378623 378628) (-275 "E04GCFA.spad" 377705 377713 378159 378164) (-274 "E04FDFA.spad" 377241 377249 377695 377700) (-273 "E04DGFA.spad" 376777 376785 377231 377236) (-272 "E04AGNT.spad" 372627 372635 376767 376772) (-271 "DVARCAT.spad" 369316 369326 372617 372622) (-270 "DVARCAT.spad" 366003 366015 369306 369311) (-269 "DSMP.spad" 363470 363484 363775 363902) (-268 "DROPT.spad" 357429 357437 363460 363465) (-267 "DROPT1.spad" 357094 357104 357419 357424) (-266 "DROPT0.spad" 351951 351959 357084 357089) (-265 "DRAWPT.spad" 350124 350132 351941 351946) (-264 "DRAW.spad" 343000 343013 350114 350119) (-263 "DRAWHACK.spad" 342308 342318 342990 342995) (-262 "DRAWCX.spad" 339778 339786 342298 342303) (-261 "DRAWCURV.spad" 339325 339340 339768 339773) (-260 "DRAWCFUN.spad" 328857 328865 339315 339320) (-259 "DQAGG.spad" 327035 327045 328825 328852) (-258 "DPOLCAT.spad" 322384 322400 326903 327030) (-257 "DPOLCAT.spad" 317795 317813 322316 322321) (-256 "DPMO.spad" 310021 310037 310159 310460) (-255 "DPMM.spad" 302260 302278 302385 302686) (-254 "DOMTMPLT.spad" 302031 302039 302250 302255) (-253 "DOMCTOR.spad" 301786 301794 302021 302026) (-252 "DOMAIN.spad" 300873 300881 301776 301781) (-251 "DMP.spad" 298133 298148 298703 298830) (-250 "DLP.spad" 297485 297495 298123 298128) (-249 "DLIST.spad" 296064 296074 296668 296695) (-248 "DLAGG.spad" 294481 294491 296054 296059) (-247 "DIVRING.spad" 294023 294031 294425 294476) (-246 "DIVRING.spad" 293609 293619 294013 294018) (-245 "DISPLAY.spad" 291799 291807 293599 293604) (-244 "DIRPROD.spad" 281379 281395 282019 282150) (-243 "DIRPROD2.spad" 280197 280215 281369 281374) (-242 "DIRPCAT.spad" 279141 279157 280061 280192) (-241 "DIRPCAT.spad" 277814 277832 278736 278741) (-240 "DIOSP.spad" 276639 276647 277804 277809) (-239 "DIOPS.spad" 275635 275645 276619 276634) (-238 "DIOPS.spad" 274605 274617 275591 275596) (-237 "DIFRING.spad" 274211 274219 274585 274600) (-236 "DIFRING.spad" 273825 273835 274201 274206) (-235 "DIFFDOM.spad" 272990 273001 273815 273820) (-234 "DIFFDOM.spad" 272153 272166 272980 272985) (-233 "DIFEXT.spad" 271324 271334 272133 272148) (-232 "DIFEXT.spad" 270388 270400 271199 271204) (-231 "DIAGG.spad" 270018 270028 270368 270383) (-230 "DIAGG.spad" 269656 269668 270008 270013) (-229 "DHMATRIX.spad" 267968 267978 269113 269140) (-228 "DFSFUN.spad" 261608 261616 267958 267963) (-227 "DFLOAT.spad" 258339 258347 261498 261603) (-226 "DFINTTLS.spad" 256570 256586 258329 258334) (-225 "DERHAM.spad" 254484 254516 256550 256565) (-224 "DEQUEUE.spad" 253808 253818 254091 254118) (-223 "DEGRED.spad" 253425 253439 253798 253803) (-222 "DEFINTRF.spad" 250962 250972 253415 253420) (-221 "DEFINTEF.spad" 249472 249488 250952 250957) (-220 "DEFAST.spad" 248840 248848 249462 249467) (-219 "DECIMAL.spad" 246946 246954 247307 247400) (-218 "DDFACT.spad" 244759 244776 246936 246941) (-217 "DBLRESP.spad" 244359 244383 244749 244754) (-216 "DBASE.spad" 243023 243033 244349 244354) (-215 "DATAARY.spad" 242485 242498 243013 243018) (-214 "D03FAFA.spad" 242313 242321 242475 242480) (-213 "D03EEFA.spad" 242133 242141 242303 242308) (-212 "D03AGNT.spad" 241219 241227 242123 242128) (-211 "D02EJFA.spad" 240681 240689 241209 241214) (-210 "D02CJFA.spad" 240159 240167 240671 240676) (-209 "D02BHFA.spad" 239649 239657 240149 240154) (-208 "D02BBFA.spad" 239139 239147 239639 239644) (-207 "D02AGNT.spad" 233953 233961 239129 239134) (-206 "D01WGTS.spad" 232272 232280 233943 233948) (-205 "D01TRNS.spad" 232249 232257 232262 232267) (-204 "D01GBFA.spad" 231771 231779 232239 232244) (-203 "D01FCFA.spad" 231293 231301 231761 231766) (-202 "D01ASFA.spad" 230761 230769 231283 231288) (-201 "D01AQFA.spad" 230207 230215 230751 230756) (-200 "D01APFA.spad" 229631 229639 230197 230202) (-199 "D01ANFA.spad" 229125 229133 229621 229626) (-198 "D01AMFA.spad" 228635 228643 229115 229120) (-197 "D01ALFA.spad" 228175 228183 228625 228630) (-196 "D01AKFA.spad" 227701 227709 228165 228170) (-195 "D01AJFA.spad" 227224 227232 227691 227696) (-194 "D01AGNT.spad" 223291 223299 227214 227219) (-193 "CYCLOTOM.spad" 222797 222805 223281 223286) (-192 "CYCLES.spad" 219589 219597 222787 222792) (-191 "CVMP.spad" 219006 219016 219579 219584) (-190 "CTRIGMNP.spad" 217506 217522 218996 219001) (-189 "CTOR.spad" 217197 217205 217496 217501) (-188 "CTORKIND.spad" 216800 216808 217187 217192) (-187 "CTORCAT.spad" 216049 216057 216790 216795) (-186 "CTORCAT.spad" 215296 215306 216039 216044) (-185 "CTORCALL.spad" 214885 214895 215286 215291) (-184 "CSTTOOLS.spad" 214130 214143 214875 214880) (-183 "CRFP.spad" 207854 207867 214120 214125) (-182 "CRCEAST.spad" 207574 207582 207844 207849) (-181 "CRAPACK.spad" 206625 206635 207564 207569) (-180 "CPMATCH.spad" 206129 206144 206550 206555) (-179 "CPIMA.spad" 205834 205853 206119 206124) (-178 "COORDSYS.spad" 200843 200853 205824 205829) (-177 "CONTOUR.spad" 200254 200262 200833 200838) (-176 "CONTFRAC.spad" 196004 196014 200156 200249) (-175 "CONDUIT.spad" 195762 195770 195994 195999) (-174 "COMRING.spad" 195436 195444 195700 195757) (-173 "COMPPROP.spad" 194954 194962 195426 195431) (-172 "COMPLPAT.spad" 194721 194736 194944 194949) (-171 "COMPLEX.spad" 188858 188868 189102 189363) (-170 "COMPLEX2.spad" 188573 188585 188848 188853) (-169 "COMPILER.spad" 188122 188130 188563 188568) (-168 "COMPFACT.spad" 187724 187738 188112 188117) (-167 "COMPCAT.spad" 185796 185806 187458 187719) (-166 "COMPCAT.spad" 183596 183608 185260 185265) (-165 "COMMUPC.spad" 183344 183362 183586 183591) (-164 "COMMONOP.spad" 182877 182885 183334 183339) (-163 "COMM.spad" 182688 182696 182867 182872) (-162 "COMMAAST.spad" 182451 182459 182678 182683) (-161 "COMBOPC.spad" 181366 181374 182441 182446) (-160 "COMBINAT.spad" 180133 180143 181356 181361) (-159 "COMBF.spad" 177515 177531 180123 180128) (-158 "COLOR.spad" 176352 176360 177505 177510) (-157 "COLONAST.spad" 176018 176026 176342 176347) (-156 "CMPLXRT.spad" 175729 175746 176008 176013) (-155 "CLLCTAST.spad" 175391 175399 175719 175724) (-154 "CLIP.spad" 171499 171507 175381 175386) (-153 "CLIF.spad" 170154 170170 171455 171494) (-152 "CLAGG.spad" 166659 166669 170144 170149) (-151 "CLAGG.spad" 163035 163047 166522 166527) (-150 "CINTSLPE.spad" 162366 162379 163025 163030) (-149 "CHVAR.spad" 160504 160526 162356 162361) (-148 "CHARZ.spad" 160419 160427 160484 160499) (-147 "CHARPOL.spad" 159929 159939 160409 160414) (-146 "CHARNZ.spad" 159682 159690 159909 159924) (-145 "CHAR.spad" 157556 157564 159672 159677) (-144 "CFCAT.spad" 156884 156892 157546 157551) (-143 "CDEN.spad" 156080 156094 156874 156879) (-142 "CCLASS.spad" 154229 154237 155491 155530) (-141 "CATEGORY.spad" 153271 153279 154219 154224) (-140 "CATCTOR.spad" 153162 153170 153261 153266) (-139 "CATAST.spad" 152780 152788 153152 153157) (-138 "CASEAST.spad" 152494 152502 152770 152775) (-137 "CARTEN.spad" 147861 147885 152484 152489) (-136 "CARTEN2.spad" 147251 147278 147851 147856) (-135 "CARD.spad" 144546 144554 147225 147246) (-134 "CAPSLAST.spad" 144320 144328 144536 144541) (-133 "CACHSET.spad" 143944 143952 144310 144315) (-132 "CABMON.spad" 143499 143507 143934 143939) (-131 "BYTEORD.spad" 143174 143182 143489 143494) (-130 "BYTE.spad" 142601 142609 143164 143169) (-129 "BYTEBUF.spad" 140460 140468 141770 141797) (-128 "BTREE.spad" 139533 139543 140067 140094) (-127 "BTOURN.spad" 138538 138548 139140 139167) (-126 "BTCAT.spad" 137930 137940 138506 138533) (-125 "BTCAT.spad" 137342 137354 137920 137925) (-124 "BTAGG.spad" 136808 136816 137310 137337) (-123 "BTAGG.spad" 136294 136304 136798 136803) (-122 "BSTREE.spad" 135035 135045 135901 135928) (-121 "BRILL.spad" 133232 133243 135025 135030) (-120 "BRAGG.spad" 132172 132182 133222 133227) (-119 "BRAGG.spad" 131076 131088 132128 132133) (-118 "BPADICRT.spad" 129057 129069 129312 129405) (-117 "BPADIC.spad" 128721 128733 128983 129052) (-116 "BOUNDZRO.spad" 128377 128394 128711 128716) (-115 "BOP.spad" 123559 123567 128367 128372) (-114 "BOP1.spad" 121025 121035 123549 123554) (-113 "BOOLE.spad" 120675 120683 121015 121020) (-112 "BOOLEAN.spad" 120113 120121 120665 120670) (-111 "BMODULE.spad" 119825 119837 120081 120108) (-110 "BITS.spad" 119246 119254 119461 119488) (-109 "BINDING.spad" 118659 118667 119236 119241) (-108 "BINARY.spad" 116770 116778 117126 117219) (-107 "BGAGG.spad" 115975 115985 116750 116765) (-106 "BGAGG.spad" 115188 115200 115965 115970) (-105 "BFUNCT.spad" 114752 114760 115168 115183) (-104 "BEZOUT.spad" 113892 113919 114702 114707) (-103 "BBTREE.spad" 110737 110747 113499 113526) (-102 "BASTYPE.spad" 110409 110417 110727 110732) (-101 "BASTYPE.spad" 110079 110089 110399 110404) (-100 "BALFACT.spad" 109538 109551 110069 110074) (-99 "AUTOMOR.spad" 108989 108998 109518 109533) (-98 "ATTREG.spad" 105712 105719 108741 108984) (-97 "ATTRBUT.spad" 101735 101742 105692 105707) (-96 "ATTRAST.spad" 101452 101459 101725 101730) (-95 "ATRIG.spad" 100922 100929 101442 101447) (-94 "ATRIG.spad" 100390 100399 100912 100917) (-93 "ASTCAT.spad" 100294 100301 100380 100385) (-92 "ASTCAT.spad" 100196 100205 100284 100289) (-91 "ASTACK.spad" 99535 99544 99803 99830) (-90 "ASSOCEQ.spad" 98361 98372 99491 99496) (-89 "ASP9.spad" 97442 97455 98351 98356) (-88 "ASP8.spad" 96485 96498 97432 97437) (-87 "ASP80.spad" 95807 95820 96475 96480) (-86 "ASP7.spad" 94967 94980 95797 95802) (-85 "ASP78.spad" 94418 94431 94957 94962) (-84 "ASP77.spad" 93787 93800 94408 94413) (-83 "ASP74.spad" 92879 92892 93777 93782) (-82 "ASP73.spad" 92150 92163 92869 92874) (-81 "ASP6.spad" 91017 91030 92140 92145) (-80 "ASP55.spad" 89526 89539 91007 91012) (-79 "ASP50.spad" 87343 87356 89516 89521) (-78 "ASP4.spad" 86638 86651 87333 87338) (-77 "ASP49.spad" 85637 85650 86628 86633) (-76 "ASP42.spad" 84044 84083 85627 85632) (-75 "ASP41.spad" 82623 82662 84034 84039) (-74 "ASP35.spad" 81611 81624 82613 82618) (-73 "ASP34.spad" 80912 80925 81601 81606) (-72 "ASP33.spad" 80472 80485 80902 80907) (-71 "ASP31.spad" 79612 79625 80462 80467) (-70 "ASP30.spad" 78504 78517 79602 79607) (-69 "ASP29.spad" 77970 77983 78494 78499) (-68 "ASP28.spad" 69243 69256 77960 77965) (-67 "ASP27.spad" 68140 68153 69233 69238) (-66 "ASP24.spad" 67227 67240 68130 68135) (-65 "ASP20.spad" 66691 66704 67217 67222) (-64 "ASP1.spad" 66072 66085 66681 66686) (-63 "ASP19.spad" 60758 60771 66062 66067) (-62 "ASP12.spad" 60172 60185 60748 60753) (-61 "ASP10.spad" 59443 59456 60162 60167) (-60 "ARRAY2.spad" 58803 58812 59050 59077) (-59 "ARRAY1.spad" 57640 57649 57986 58013) (-58 "ARRAY12.spad" 56353 56364 57630 57635) (-57 "ARR2CAT.spad" 52127 52148 56321 56348) (-56 "ARR2CAT.spad" 47921 47944 52117 52122) (-55 "ARITY.spad" 47293 47300 47911 47916) (-54 "APPRULE.spad" 46553 46575 47283 47288) (-53 "APPLYORE.spad" 46172 46185 46543 46548) (-52 "ANY.spad" 45031 45038 46162 46167) (-51 "ANY1.spad" 44102 44111 45021 45026) (-50 "ANTISYM.spad" 42547 42563 44082 44097) (-49 "ANON.spad" 42240 42247 42537 42542) (-48 "AN.spad" 40549 40556 42056 42149) (-47 "AMR.spad" 38734 38745 40447 40544) (-46 "AMR.spad" 36756 36769 38471 38476) (-45 "ALIST.spad" 34168 34189 34518 34545) (-44 "ALGSC.spad" 33303 33329 34040 34093) (-43 "ALGPKG.spad" 29086 29097 33259 33264) (-42 "ALGMFACT.spad" 28279 28293 29076 29081) (-41 "ALGMANIP.spad" 25753 25768 28112 28117) (-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 2267377 2267382 2267387 2267392) (-2 NIL 2267357 2267362 2267367 2267372) (-1 NIL 2267337 2267342 2267347 2267352) (0 NIL 2267317 2267322 2267327 2267332) (-1308 "ZMOD.spad" 2267126 2267139 2267255 2267312) (-1307 "ZLINDEP.spad" 2266192 2266203 2267116 2267121) (-1306 "ZDSOLVE.spad" 2256137 2256159 2266182 2266187) (-1305 "YSTREAM.spad" 2255632 2255643 2256127 2256132) (-1304 "YDIAGRAM.spad" 2255266 2255275 2255622 2255627) (-1303 "XRPOLY.spad" 2254486 2254506 2255122 2255191) (-1302 "XPR.spad" 2252281 2252294 2254204 2254303) (-1301 "XPOLY.spad" 2251836 2251847 2252137 2252206) (-1300 "XPOLYC.spad" 2251155 2251171 2251762 2251831) (-1299 "XPBWPOLY.spad" 2249592 2249612 2250935 2251004) (-1298 "XF.spad" 2248055 2248070 2249494 2249587) (-1297 "XF.spad" 2246498 2246515 2247939 2247944) (-1296 "XFALG.spad" 2243546 2243562 2246424 2246493) (-1295 "XEXPPKG.spad" 2242797 2242823 2243536 2243541) (-1294 "XDPOLY.spad" 2242411 2242427 2242653 2242722) (-1293 "XALG.spad" 2242071 2242082 2242367 2242406) (-1292 "WUTSET.spad" 2237910 2237927 2241717 2241744) (-1291 "WP.spad" 2237109 2237153 2237768 2237835) (-1290 "WHILEAST.spad" 2236907 2236916 2237099 2237104) (-1289 "WHEREAST.spad" 2236578 2236587 2236897 2236902) (-1288 "WFFINTBS.spad" 2234241 2234263 2236568 2236573) (-1287 "WEIER.spad" 2232463 2232474 2234231 2234236) (-1286 "VSPACE.spad" 2232136 2232147 2232431 2232458) (-1285 "VSPACE.spad" 2231829 2231842 2232126 2232131) (-1284 "VOID.spad" 2231506 2231515 2231819 2231824) (-1283 "VIEW.spad" 2229186 2229195 2231496 2231501) (-1282 "VIEWDEF.spad" 2224387 2224396 2229176 2229181) (-1281 "VIEW3D.spad" 2208348 2208357 2224377 2224382) (-1280 "VIEW2D.spad" 2196239 2196248 2208338 2208343) (-1279 "VECTOR.spad" 2194913 2194924 2195164 2195191) (-1278 "VECTOR2.spad" 2193552 2193565 2194903 2194908) (-1277 "VECTCAT.spad" 2191456 2191467 2193520 2193547) (-1276 "VECTCAT.spad" 2189167 2189180 2191233 2191238) (-1275 "VARIABLE.spad" 2188947 2188962 2189157 2189162) (-1274 "UTYPE.spad" 2188591 2188600 2188937 2188942) (-1273 "UTSODETL.spad" 2187886 2187910 2188547 2188552) (-1272 "UTSODE.spad" 2186102 2186122 2187876 2187881) (-1271 "UTS.spad" 2180906 2180934 2184569 2184666) (-1270 "UTSCAT.spad" 2178385 2178401 2180804 2180901) (-1269 "UTSCAT.spad" 2175508 2175526 2177929 2177934) (-1268 "UTS2.spad" 2175103 2175138 2175498 2175503) (-1267 "URAGG.spad" 2169776 2169787 2175093 2175098) (-1266 "URAGG.spad" 2164413 2164426 2169732 2169737) (-1265 "UPXSSING.spad" 2162058 2162084 2163494 2163627) (-1264 "UPXS.spad" 2159212 2159240 2160190 2160339) (-1263 "UPXSCONS.spad" 2156971 2156991 2157344 2157493) (-1262 "UPXSCCA.spad" 2155542 2155562 2156817 2156966) (-1261 "UPXSCCA.spad" 2154255 2154277 2155532 2155537) (-1260 "UPXSCAT.spad" 2152844 2152860 2154101 2154250) (-1259 "UPXS2.spad" 2152387 2152440 2152834 2152839) (-1258 "UPSQFREE.spad" 2150801 2150815 2152377 2152382) (-1257 "UPSCAT.spad" 2148588 2148612 2150699 2150796) (-1256 "UPSCAT.spad" 2146081 2146107 2148194 2148199) (-1255 "UPOLYC.spad" 2141121 2141132 2145923 2146076) (-1254 "UPOLYC.spad" 2136053 2136066 2140857 2140862) (-1253 "UPOLYC2.spad" 2135524 2135543 2136043 2136048) (-1252 "UP.spad" 2132723 2132738 2133110 2133263) (-1251 "UPMP.spad" 2131623 2131636 2132713 2132718) (-1250 "UPDIVP.spad" 2131188 2131202 2131613 2131618) (-1249 "UPDECOMP.spad" 2129433 2129447 2131178 2131183) (-1248 "UPCDEN.spad" 2128642 2128658 2129423 2129428) (-1247 "UP2.spad" 2128006 2128027 2128632 2128637) (-1246 "UNISEG.spad" 2127359 2127370 2127925 2127930) (-1245 "UNISEG2.spad" 2126856 2126869 2127315 2127320) (-1244 "UNIFACT.spad" 2125959 2125971 2126846 2126851) (-1243 "ULS.spad" 2116517 2116545 2117604 2118033) (-1242 "ULSCONS.spad" 2108913 2108933 2109283 2109432) (-1241 "ULSCCAT.spad" 2106650 2106670 2108759 2108908) (-1240 "ULSCCAT.spad" 2104495 2104517 2106606 2106611) (-1239 "ULSCAT.spad" 2102727 2102743 2104341 2104490) (-1238 "ULS2.spad" 2102241 2102294 2102717 2102722) (-1237 "UINT8.spad" 2102118 2102127 2102231 2102236) (-1236 "UINT64.spad" 2101994 2102003 2102108 2102113) (-1235 "UINT32.spad" 2101870 2101879 2101984 2101989) (-1234 "UINT16.spad" 2101746 2101755 2101860 2101865) (-1233 "UFD.spad" 2100811 2100820 2101672 2101741) (-1232 "UFD.spad" 2099938 2099949 2100801 2100806) (-1231 "UDVO.spad" 2098819 2098828 2099928 2099933) (-1230 "UDPO.spad" 2096312 2096323 2098775 2098780) (-1229 "TYPE.spad" 2096244 2096253 2096302 2096307) (-1228 "TYPEAST.spad" 2096163 2096172 2096234 2096239) (-1227 "TWOFACT.spad" 2094815 2094830 2096153 2096158) (-1226 "TUPLE.spad" 2094301 2094312 2094714 2094719) (-1225 "TUBETOOL.spad" 2091168 2091177 2094291 2094296) (-1224 "TUBE.spad" 2089815 2089832 2091158 2091163) (-1223 "TS.spad" 2088414 2088430 2089380 2089477) (-1222 "TSETCAT.spad" 2075541 2075558 2088382 2088409) (-1221 "TSETCAT.spad" 2062654 2062673 2075497 2075502) (-1220 "TRMANIP.spad" 2057020 2057037 2062360 2062365) (-1219 "TRIMAT.spad" 2055983 2056008 2057010 2057015) (-1218 "TRIGMNIP.spad" 2054510 2054527 2055973 2055978) (-1217 "TRIGCAT.spad" 2054022 2054031 2054500 2054505) (-1216 "TRIGCAT.spad" 2053532 2053543 2054012 2054017) (-1215 "TREE.spad" 2052107 2052118 2053139 2053166) (-1214 "TRANFUN.spad" 2051946 2051955 2052097 2052102) (-1213 "TRANFUN.spad" 2051783 2051794 2051936 2051941) (-1212 "TOPSP.spad" 2051457 2051466 2051773 2051778) (-1211 "TOOLSIGN.spad" 2051120 2051131 2051447 2051452) (-1210 "TEXTFILE.spad" 2049681 2049690 2051110 2051115) (-1209 "TEX.spad" 2046827 2046836 2049671 2049676) (-1208 "TEX1.spad" 2046383 2046394 2046817 2046822) (-1207 "TEMUTL.spad" 2045938 2045947 2046373 2046378) (-1206 "TBCMPPK.spad" 2044031 2044054 2045928 2045933) (-1205 "TBAGG.spad" 2043081 2043104 2044011 2044026) (-1204 "TBAGG.spad" 2042139 2042164 2043071 2043076) (-1203 "TANEXP.spad" 2041547 2041558 2042129 2042134) (-1202 "TALGOP.spad" 2041271 2041282 2041537 2041542) (-1201 "TABLE.spad" 2039682 2039705 2039952 2039979) (-1200 "TABLEAU.spad" 2039163 2039174 2039672 2039677) (-1199 "TABLBUMP.spad" 2035966 2035977 2039153 2039158) (-1198 "SYSTEM.spad" 2035194 2035203 2035956 2035961) (-1197 "SYSSOLP.spad" 2032677 2032688 2035184 2035189) (-1196 "SYSPTR.spad" 2032576 2032585 2032667 2032672) (-1195 "SYSNNI.spad" 2031758 2031769 2032566 2032571) (-1194 "SYSINT.spad" 2031162 2031173 2031748 2031753) (-1193 "SYNTAX.spad" 2027368 2027377 2031152 2031157) (-1192 "SYMTAB.spad" 2025436 2025445 2027358 2027363) (-1191 "SYMS.spad" 2021459 2021468 2025426 2025431) (-1190 "SYMPOLY.spad" 2020466 2020477 2020548 2020675) (-1189 "SYMFUNC.spad" 2019967 2019978 2020456 2020461) (-1188 "SYMBOL.spad" 2017470 2017479 2019957 2019962) (-1187 "SWITCH.spad" 2014241 2014250 2017460 2017465) (-1186 "SUTS.spad" 2011146 2011174 2012708 2012805) (-1185 "SUPXS.spad" 2008287 2008315 2009278 2009427) (-1184 "SUP.spad" 2005100 2005111 2005873 2006026) (-1183 "SUPFRACF.spad" 2004205 2004223 2005090 2005095) (-1182 "SUP2.spad" 2003597 2003610 2004195 2004200) (-1181 "SUMRF.spad" 2002571 2002582 2003587 2003592) (-1180 "SUMFS.spad" 2002208 2002225 2002561 2002566) (-1179 "SULS.spad" 1992753 1992781 1993853 1994282) (-1178 "SUCHTAST.spad" 1992522 1992531 1992743 1992748) (-1177 "SUCH.spad" 1992204 1992219 1992512 1992517) (-1176 "SUBSPACE.spad" 1984319 1984334 1992194 1992199) (-1175 "SUBRESP.spad" 1983489 1983503 1984275 1984280) (-1174 "STTF.spad" 1979588 1979604 1983479 1983484) (-1173 "STTFNC.spad" 1976056 1976072 1979578 1979583) (-1172 "STTAYLOR.spad" 1968691 1968702 1975937 1975942) (-1171 "STRTBL.spad" 1967196 1967213 1967345 1967372) (-1170 "STRING.spad" 1966605 1966614 1966619 1966646) (-1169 "STRICAT.spad" 1966393 1966402 1966573 1966600) (-1168 "STREAM.spad" 1963311 1963322 1965918 1965933) (-1167 "STREAM3.spad" 1962884 1962899 1963301 1963306) (-1166 "STREAM2.spad" 1962012 1962025 1962874 1962879) (-1165 "STREAM1.spad" 1961718 1961729 1962002 1962007) (-1164 "STINPROD.spad" 1960654 1960670 1961708 1961713) (-1163 "STEP.spad" 1959855 1959864 1960644 1960649) (-1162 "STEPAST.spad" 1959089 1959098 1959845 1959850) (-1161 "STBL.spad" 1957615 1957643 1957782 1957797) (-1160 "STAGG.spad" 1956690 1956701 1957605 1957610) (-1159 "STAGG.spad" 1955763 1955776 1956680 1956685) (-1158 "STACK.spad" 1955120 1955131 1955370 1955397) (-1157 "SREGSET.spad" 1952824 1952841 1954766 1954793) (-1156 "SRDCMPK.spad" 1951385 1951405 1952814 1952819) (-1155 "SRAGG.spad" 1946528 1946537 1951353 1951380) (-1154 "SRAGG.spad" 1941691 1941702 1946518 1946523) (-1153 "SQMATRIX.spad" 1939307 1939325 1940223 1940310) (-1152 "SPLTREE.spad" 1933859 1933872 1938743 1938770) (-1151 "SPLNODE.spad" 1930447 1930460 1933849 1933854) (-1150 "SPFCAT.spad" 1929256 1929265 1930437 1930442) (-1149 "SPECOUT.spad" 1927808 1927817 1929246 1929251) (-1148 "SPADXPT.spad" 1919403 1919412 1927798 1927803) (-1147 "spad-parser.spad" 1918868 1918877 1919393 1919398) (-1146 "SPADAST.spad" 1918569 1918578 1918858 1918863) (-1145 "SPACEC.spad" 1902768 1902779 1918559 1918564) (-1144 "SPACE3.spad" 1902544 1902555 1902758 1902763) (-1143 "SORTPAK.spad" 1902093 1902106 1902500 1902505) (-1142 "SOLVETRA.spad" 1899856 1899867 1902083 1902088) (-1141 "SOLVESER.spad" 1898384 1898395 1899846 1899851) (-1140 "SOLVERAD.spad" 1894410 1894421 1898374 1898379) (-1139 "SOLVEFOR.spad" 1892872 1892890 1894400 1894405) (-1138 "SNTSCAT.spad" 1892472 1892489 1892840 1892867) (-1137 "SMTS.spad" 1890744 1890770 1892037 1892134) (-1136 "SMP.spad" 1888219 1888239 1888609 1888736) (-1135 "SMITH.spad" 1887064 1887089 1888209 1888214) (-1134 "SMATCAT.spad" 1885174 1885204 1887008 1887059) (-1133 "SMATCAT.spad" 1883216 1883248 1885052 1885057) (-1132 "SKAGG.spad" 1882179 1882190 1883184 1883211) (-1131 "SINT.spad" 1881119 1881128 1882045 1882174) (-1130 "SIMPAN.spad" 1880847 1880856 1881109 1881114) (-1129 "SIG.spad" 1880177 1880186 1880837 1880842) (-1128 "SIGNRF.spad" 1879295 1879306 1880167 1880172) (-1127 "SIGNEF.spad" 1878574 1878591 1879285 1879290) (-1126 "SIGAST.spad" 1877959 1877968 1878564 1878569) (-1125 "SHP.spad" 1875887 1875902 1877915 1877920) (-1124 "SHDP.spad" 1865598 1865625 1866107 1866238) (-1123 "SGROUP.spad" 1865206 1865215 1865588 1865593) (-1122 "SGROUP.spad" 1864812 1864823 1865196 1865201) (-1121 "SGCF.spad" 1857951 1857960 1864802 1864807) (-1120 "SFRTCAT.spad" 1856881 1856898 1857919 1857946) (-1119 "SFRGCD.spad" 1855944 1855964 1856871 1856876) (-1118 "SFQCMPK.spad" 1850581 1850601 1855934 1855939) (-1117 "SFORT.spad" 1850020 1850034 1850571 1850576) (-1116 "SEXOF.spad" 1849863 1849903 1850010 1850015) (-1115 "SEX.spad" 1849755 1849764 1849853 1849858) (-1114 "SEXCAT.spad" 1847536 1847576 1849745 1849750) (-1113 "SET.spad" 1845860 1845871 1846957 1846996) (-1112 "SETMN.spad" 1844310 1844327 1845850 1845855) (-1111 "SETCAT.spad" 1843632 1843641 1844300 1844305) (-1110 "SETCAT.spad" 1842952 1842963 1843622 1843627) (-1109 "SETAGG.spad" 1839501 1839512 1842932 1842947) (-1108 "SETAGG.spad" 1836058 1836071 1839491 1839496) (-1107 "SEQAST.spad" 1835761 1835770 1836048 1836053) (-1106 "SEGXCAT.spad" 1834917 1834930 1835751 1835756) (-1105 "SEG.spad" 1834730 1834741 1834836 1834841) (-1104 "SEGCAT.spad" 1833655 1833666 1834720 1834725) (-1103 "SEGBIND.spad" 1833413 1833424 1833602 1833607) (-1102 "SEGBIND2.spad" 1833111 1833124 1833403 1833408) (-1101 "SEGAST.spad" 1832825 1832834 1833101 1833106) (-1100 "SEG2.spad" 1832260 1832273 1832781 1832786) (-1099 "SDVAR.spad" 1831536 1831547 1832250 1832255) (-1098 "SDPOL.spad" 1828962 1828973 1829253 1829380) (-1097 "SCPKG.spad" 1827051 1827062 1828952 1828957) (-1096 "SCOPE.spad" 1826204 1826213 1827041 1827046) (-1095 "SCACHE.spad" 1824900 1824911 1826194 1826199) (-1094 "SASTCAT.spad" 1824809 1824818 1824890 1824895) (-1093 "SAOS.spad" 1824681 1824690 1824799 1824804) (-1092 "SAERFFC.spad" 1824394 1824414 1824671 1824676) (-1091 "SAE.spad" 1822569 1822585 1823180 1823315) (-1090 "SAEFACT.spad" 1822270 1822290 1822559 1822564) (-1089 "RURPK.spad" 1819929 1819945 1822260 1822265) (-1088 "RULESET.spad" 1819382 1819406 1819919 1819924) (-1087 "RULE.spad" 1817622 1817646 1819372 1819377) (-1086 "RULECOLD.spad" 1817474 1817487 1817612 1817617) (-1085 "RTVALUE.spad" 1817209 1817218 1817464 1817469) (-1084 "RSTRCAST.spad" 1816926 1816935 1817199 1817204) (-1083 "RSETGCD.spad" 1813304 1813324 1816916 1816921) (-1082 "RSETCAT.spad" 1803240 1803257 1813272 1813299) (-1081 "RSETCAT.spad" 1793196 1793215 1803230 1803235) (-1080 "RSDCMPK.spad" 1791648 1791668 1793186 1793191) (-1079 "RRCC.spad" 1790032 1790062 1791638 1791643) (-1078 "RRCC.spad" 1788414 1788446 1790022 1790027) (-1077 "RPTAST.spad" 1788116 1788125 1788404 1788409) (-1076 "RPOLCAT.spad" 1767476 1767491 1787984 1788111) (-1075 "RPOLCAT.spad" 1746549 1746566 1767059 1767064) (-1074 "ROUTINE.spad" 1742432 1742441 1745196 1745223) (-1073 "ROMAN.spad" 1741760 1741769 1742298 1742427) (-1072 "ROIRC.spad" 1740840 1740872 1741750 1741755) (-1071 "RNS.spad" 1739743 1739752 1740742 1740835) (-1070 "RNS.spad" 1738732 1738743 1739733 1739738) (-1069 "RNG.spad" 1738467 1738476 1738722 1738727) (-1068 "RNGBIND.spad" 1737627 1737641 1738422 1738427) (-1067 "RMODULE.spad" 1737392 1737403 1737617 1737622) (-1066 "RMCAT2.spad" 1736812 1736869 1737382 1737387) (-1065 "RMATRIX.spad" 1735636 1735655 1735979 1736018) (-1064 "RMATCAT.spad" 1731215 1731246 1735592 1735631) (-1063 "RMATCAT.spad" 1726684 1726717 1731063 1731068) (-1062 "RLINSET.spad" 1726078 1726089 1726674 1726679) (-1061 "RINTERP.spad" 1725966 1725986 1726068 1726073) (-1060 "RING.spad" 1725436 1725445 1725946 1725961) (-1059 "RING.spad" 1724914 1724925 1725426 1725431) (-1058 "RIDIST.spad" 1724306 1724315 1724904 1724909) (-1057 "RGCHAIN.spad" 1722889 1722905 1723791 1723818) (-1056 "RGBCSPC.spad" 1722670 1722682 1722879 1722884) (-1055 "RGBCMDL.spad" 1722200 1722212 1722660 1722665) (-1054 "RF.spad" 1719842 1719853 1722190 1722195) (-1053 "RFFACTOR.spad" 1719304 1719315 1719832 1719837) (-1052 "RFFACT.spad" 1719039 1719051 1719294 1719299) (-1051 "RFDIST.spad" 1718035 1718044 1719029 1719034) (-1050 "RETSOL.spad" 1717454 1717467 1718025 1718030) (-1049 "RETRACT.spad" 1716882 1716893 1717444 1717449) (-1048 "RETRACT.spad" 1716308 1716321 1716872 1716877) (-1047 "RETAST.spad" 1716120 1716129 1716298 1716303) (-1046 "RESULT.spad" 1714180 1714189 1714767 1714794) (-1045 "RESRING.spad" 1713527 1713574 1714118 1714175) (-1044 "RESLATC.spad" 1712851 1712862 1713517 1713522) (-1043 "REPSQ.spad" 1712582 1712593 1712841 1712846) (-1042 "REP.spad" 1710136 1710145 1712572 1712577) (-1041 "REPDB.spad" 1709843 1709854 1710126 1710131) (-1040 "REP2.spad" 1699501 1699512 1709685 1709690) (-1039 "REP1.spad" 1693697 1693708 1699451 1699456) (-1038 "REGSET.spad" 1691494 1691511 1693343 1693370) (-1037 "REF.spad" 1690829 1690840 1691449 1691454) (-1036 "REDORDER.spad" 1690035 1690052 1690819 1690824) (-1035 "RECLOS.spad" 1688818 1688838 1689522 1689615) (-1034 "REALSOLV.spad" 1687958 1687967 1688808 1688813) (-1033 "REAL.spad" 1687830 1687839 1687948 1687953) (-1032 "REAL0Q.spad" 1685128 1685143 1687820 1687825) (-1031 "REAL0.spad" 1681972 1681987 1685118 1685123) (-1030 "RDUCEAST.spad" 1681693 1681702 1681962 1681967) (-1029 "RDIV.spad" 1681348 1681373 1681683 1681688) (-1028 "RDIST.spad" 1680915 1680926 1681338 1681343) (-1027 "RDETRS.spad" 1679779 1679797 1680905 1680910) (-1026 "RDETR.spad" 1677918 1677936 1679769 1679774) (-1025 "RDEEFS.spad" 1677017 1677034 1677908 1677913) (-1024 "RDEEF.spad" 1676027 1676044 1677007 1677012) (-1023 "RCFIELD.spad" 1673213 1673222 1675929 1676022) (-1022 "RCFIELD.spad" 1670485 1670496 1673203 1673208) (-1021 "RCAGG.spad" 1668413 1668424 1670475 1670480) (-1020 "RCAGG.spad" 1666268 1666281 1668332 1668337) (-1019 "RATRET.spad" 1665628 1665639 1666258 1666263) (-1018 "RATFACT.spad" 1665320 1665332 1665618 1665623) (-1017 "RANDSRC.spad" 1664639 1664648 1665310 1665315) (-1016 "RADUTIL.spad" 1664395 1664404 1664629 1664634) (-1015 "RADIX.spad" 1661316 1661330 1662862 1662955) (-1014 "RADFF.spad" 1659729 1659766 1659848 1660004) (-1013 "RADCAT.spad" 1659324 1659333 1659719 1659724) (-1012 "RADCAT.spad" 1658917 1658928 1659314 1659319) (-1011 "QUEUE.spad" 1658265 1658276 1658524 1658551) (-1010 "QUAT.spad" 1656723 1656734 1657066 1657131) (-1009 "QUATCT2.spad" 1656343 1656362 1656713 1656718) (-1008 "QUATCAT.spad" 1654513 1654524 1656273 1656338) (-1007 "QUATCAT.spad" 1652434 1652447 1654196 1654201) (-1006 "QUAGG.spad" 1651261 1651272 1652402 1652429) (-1005 "QQUTAST.spad" 1651029 1651038 1651251 1651256) (-1004 "QFORM.spad" 1650647 1650662 1651019 1651024) (-1003 "QFCAT.spad" 1649349 1649360 1650549 1650642) (-1002 "QFCAT.spad" 1647642 1647655 1648844 1648849) (-1001 "QFCAT2.spad" 1647334 1647351 1647632 1647637) (-1000 "QEQUAT.spad" 1646892 1646901 1647324 1647329) (-999 "QCMPACK.spad" 1641639 1641658 1646882 1646887) (-998 "QALGSET.spad" 1637718 1637750 1641553 1641558) (-997 "QALGSET2.spad" 1635714 1635732 1637708 1637713) (-996 "PWFFINTB.spad" 1633130 1633151 1635704 1635709) (-995 "PUSHVAR.spad" 1632469 1632488 1633120 1633125) (-994 "PTRANFN.spad" 1628597 1628607 1632459 1632464) (-993 "PTPACK.spad" 1625685 1625695 1628587 1628592) (-992 "PTFUNC2.spad" 1625508 1625522 1625675 1625680) (-991 "PTCAT.spad" 1624763 1624773 1625476 1625503) (-990 "PSQFR.spad" 1624070 1624094 1624753 1624758) (-989 "PSEUDLIN.spad" 1622956 1622966 1624060 1624065) (-988 "PSETPK.spad" 1608389 1608405 1622834 1622839) (-987 "PSETCAT.spad" 1602309 1602332 1608369 1608384) (-986 "PSETCAT.spad" 1596203 1596228 1602265 1602270) (-985 "PSCURVE.spad" 1595186 1595194 1596193 1596198) (-984 "PSCAT.spad" 1593969 1593998 1595084 1595181) (-983 "PSCAT.spad" 1592842 1592873 1593959 1593964) (-982 "PRTITION.spad" 1591540 1591548 1592832 1592837) (-981 "PRTDAST.spad" 1591259 1591267 1591530 1591535) (-980 "PRS.spad" 1580821 1580838 1591215 1591220) (-979 "PRQAGG.spad" 1580256 1580266 1580789 1580816) (-978 "PROPLOG.spad" 1579828 1579836 1580246 1580251) (-977 "PROPFUN2.spad" 1579451 1579464 1579818 1579823) (-976 "PROPFUN1.spad" 1578849 1578860 1579441 1579446) (-975 "PROPFRML.spad" 1577417 1577428 1578839 1578844) (-974 "PROPERTY.spad" 1576905 1576913 1577407 1577412) (-973 "PRODUCT.spad" 1574587 1574599 1574871 1574926) (-972 "PR.spad" 1572979 1572991 1573678 1573805) (-971 "PRINT.spad" 1572731 1572739 1572969 1572974) (-970 "PRIMES.spad" 1570984 1570994 1572721 1572726) (-969 "PRIMELT.spad" 1569065 1569079 1570974 1570979) (-968 "PRIMCAT.spad" 1568692 1568700 1569055 1569060) (-967 "PRIMARR.spad" 1567697 1567707 1567875 1567902) (-966 "PRIMARR2.spad" 1566464 1566476 1567687 1567692) (-965 "PREASSOC.spad" 1565846 1565858 1566454 1566459) (-964 "PPCURVE.spad" 1564983 1564991 1565836 1565841) (-963 "PORTNUM.spad" 1564758 1564766 1564973 1564978) (-962 "POLYROOT.spad" 1563607 1563629 1564714 1564719) (-961 "POLY.spad" 1560942 1560952 1561457 1561584) (-960 "POLYLIFT.spad" 1560207 1560230 1560932 1560937) (-959 "POLYCATQ.spad" 1558325 1558347 1560197 1560202) (-958 "POLYCAT.spad" 1551795 1551816 1558193 1558320) (-957 "POLYCAT.spad" 1544603 1544626 1551003 1551008) (-956 "POLY2UP.spad" 1544055 1544069 1544593 1544598) (-955 "POLY2.spad" 1543652 1543664 1544045 1544050) (-954 "POLUTIL.spad" 1542593 1542622 1543608 1543613) (-953 "POLTOPOL.spad" 1541341 1541356 1542583 1542588) (-952 "POINT.spad" 1540179 1540189 1540266 1540293) (-951 "PNTHEORY.spad" 1536881 1536889 1540169 1540174) (-950 "PMTOOLS.spad" 1535656 1535670 1536871 1536876) (-949 "PMSYM.spad" 1535205 1535215 1535646 1535651) (-948 "PMQFCAT.spad" 1534796 1534810 1535195 1535200) (-947 "PMPRED.spad" 1534275 1534289 1534786 1534791) (-946 "PMPREDFS.spad" 1533729 1533751 1534265 1534270) (-945 "PMPLCAT.spad" 1532809 1532827 1533661 1533666) (-944 "PMLSAGG.spad" 1532394 1532408 1532799 1532804) (-943 "PMKERNEL.spad" 1531973 1531985 1532384 1532389) (-942 "PMINS.spad" 1531553 1531563 1531963 1531968) (-941 "PMFS.spad" 1531130 1531148 1531543 1531548) (-940 "PMDOWN.spad" 1530420 1530434 1531120 1531125) (-939 "PMASS.spad" 1529430 1529438 1530410 1530415) (-938 "PMASSFS.spad" 1528397 1528413 1529420 1529425) (-937 "PLOTTOOL.spad" 1528177 1528185 1528387 1528392) (-936 "PLOT.spad" 1523100 1523108 1528167 1528172) (-935 "PLOT3D.spad" 1519564 1519572 1523090 1523095) (-934 "PLOT1.spad" 1518721 1518731 1519554 1519559) (-933 "PLEQN.spad" 1506011 1506038 1518711 1518716) (-932 "PINTERP.spad" 1505633 1505652 1506001 1506006) (-931 "PINTERPA.spad" 1505417 1505433 1505623 1505628) (-930 "PI.spad" 1505026 1505034 1505391 1505412) (-929 "PID.spad" 1503996 1504004 1504952 1505021) (-928 "PICOERCE.spad" 1503653 1503663 1503986 1503991) (-927 "PGROEB.spad" 1502254 1502268 1503643 1503648) (-926 "PGE.spad" 1493871 1493879 1502244 1502249) (-925 "PGCD.spad" 1492761 1492778 1493861 1493866) (-924 "PFRPAC.spad" 1491910 1491920 1492751 1492756) (-923 "PFR.spad" 1488573 1488583 1491812 1491905) (-922 "PFOTOOLS.spad" 1487831 1487847 1488563 1488568) (-921 "PFOQ.spad" 1487201 1487219 1487821 1487826) (-920 "PFO.spad" 1486620 1486647 1487191 1487196) (-919 "PF.spad" 1486194 1486206 1486425 1486518) (-918 "PFECAT.spad" 1483876 1483884 1486120 1486189) (-917 "PFECAT.spad" 1481586 1481596 1483832 1483837) (-916 "PFBRU.spad" 1479474 1479486 1481576 1481581) (-915 "PFBR.spad" 1477034 1477057 1479464 1479469) (-914 "PERM.spad" 1472841 1472851 1476864 1476879) (-913 "PERMGRP.spad" 1467611 1467621 1472831 1472836) (-912 "PERMCAT.spad" 1466272 1466282 1467591 1467606) (-911 "PERMAN.spad" 1464804 1464818 1466262 1466267) (-910 "PENDTREE.spad" 1464145 1464155 1464433 1464438) (-909 "PDRING.spad" 1462696 1462706 1464125 1464140) (-908 "PDRING.spad" 1461255 1461267 1462686 1462691) (-907 "PDEPROB.spad" 1460270 1460278 1461245 1461250) (-906 "PDEPACK.spad" 1454310 1454318 1460260 1460265) (-905 "PDECOMP.spad" 1453780 1453797 1454300 1454305) (-904 "PDECAT.spad" 1452136 1452144 1453770 1453775) (-903 "PCOMP.spad" 1451989 1452002 1452126 1452131) (-902 "PBWLB.spad" 1450577 1450594 1451979 1451984) (-901 "PATTERN.spad" 1445116 1445126 1450567 1450572) (-900 "PATTERN2.spad" 1444854 1444866 1445106 1445111) (-899 "PATTERN1.spad" 1443190 1443206 1444844 1444849) (-898 "PATRES.spad" 1440765 1440777 1443180 1443185) (-897 "PATRES2.spad" 1440437 1440451 1440755 1440760) (-896 "PATMATCH.spad" 1438634 1438665 1440145 1440150) (-895 "PATMAB.spad" 1438063 1438073 1438624 1438629) (-894 "PATLRES.spad" 1437149 1437163 1438053 1438058) (-893 "PATAB.spad" 1436913 1436923 1437139 1437144) (-892 "PARTPERM.spad" 1434921 1434929 1436903 1436908) (-891 "PARSURF.spad" 1434355 1434383 1434911 1434916) (-890 "PARSU2.spad" 1434152 1434168 1434345 1434350) (-889 "script-parser.spad" 1433672 1433680 1434142 1434147) (-888 "PARSCURV.spad" 1433106 1433134 1433662 1433667) (-887 "PARSC2.spad" 1432897 1432913 1433096 1433101) (-886 "PARPCURV.spad" 1432359 1432387 1432887 1432892) (-885 "PARPC2.spad" 1432150 1432166 1432349 1432354) (-884 "PARAMAST.spad" 1431278 1431286 1432140 1432145) (-883 "PAN2EXPR.spad" 1430690 1430698 1431268 1431273) (-882 "PALETTE.spad" 1429660 1429668 1430680 1430685) (-881 "PAIR.spad" 1428647 1428660 1429248 1429253) (-880 "PADICRC.spad" 1425981 1425999 1427152 1427245) (-879 "PADICRAT.spad" 1423996 1424008 1424217 1424310) (-878 "PADIC.spad" 1423691 1423703 1423922 1423991) (-877 "PADICCT.spad" 1422240 1422252 1423617 1423686) (-876 "PADEPAC.spad" 1420929 1420948 1422230 1422235) (-875 "PADE.spad" 1419681 1419697 1420919 1420924) (-874 "OWP.spad" 1418921 1418951 1419539 1419606) (-873 "OVERSET.spad" 1418494 1418502 1418911 1418916) (-872 "OVAR.spad" 1418275 1418298 1418484 1418489) (-871 "OUT.spad" 1417361 1417369 1418265 1418270) (-870 "OUTFORM.spad" 1406753 1406761 1417351 1417356) (-869 "OUTBFILE.spad" 1406171 1406179 1406743 1406748) (-868 "OUTBCON.spad" 1405177 1405185 1406161 1406166) (-867 "OUTBCON.spad" 1404181 1404191 1405167 1405172) (-866 "OSI.spad" 1403656 1403664 1404171 1404176) (-865 "OSGROUP.spad" 1403574 1403582 1403646 1403651) (-864 "ORTHPOL.spad" 1402059 1402069 1403491 1403496) (-863 "OREUP.spad" 1401512 1401540 1401739 1401778) (-862 "ORESUP.spad" 1400813 1400837 1401192 1401231) (-861 "OREPCTO.spad" 1398670 1398682 1400733 1400738) (-860 "OREPCAT.spad" 1392817 1392827 1398626 1398665) (-859 "OREPCAT.spad" 1386854 1386866 1392665 1392670) (-858 "ORDSET.spad" 1386026 1386034 1386844 1386849) (-857 "ORDSET.spad" 1385196 1385206 1386016 1386021) (-856 "ORDRING.spad" 1384586 1384594 1385176 1385191) (-855 "ORDRING.spad" 1383984 1383994 1384576 1384581) (-854 "ORDMON.spad" 1383839 1383847 1383974 1383979) (-853 "ORDFUNS.spad" 1382971 1382987 1383829 1383834) (-852 "ORDFIN.spad" 1382791 1382799 1382961 1382966) (-851 "ORDCOMP.spad" 1381256 1381266 1382338 1382367) (-850 "ORDCOMP2.spad" 1380549 1380561 1381246 1381251) (-849 "OPTPROB.spad" 1379187 1379195 1380539 1380544) (-848 "OPTPACK.spad" 1371596 1371604 1379177 1379182) (-847 "OPTCAT.spad" 1369275 1369283 1371586 1371591) (-846 "OPSIG.spad" 1368929 1368937 1369265 1369270) (-845 "OPQUERY.spad" 1368478 1368486 1368919 1368924) (-844 "OP.spad" 1368220 1368230 1368300 1368367) (-843 "OPERCAT.spad" 1367686 1367696 1368210 1368215) (-842 "OPERCAT.spad" 1367150 1367162 1367676 1367681) (-841 "ONECOMP.spad" 1365895 1365905 1366697 1366726) (-840 "ONECOMP2.spad" 1365319 1365331 1365885 1365890) (-839 "OMSERVER.spad" 1364325 1364333 1365309 1365314) (-838 "OMSAGG.spad" 1364113 1364123 1364281 1364320) (-837 "OMPKG.spad" 1362729 1362737 1364103 1364108) (-836 "OM.spad" 1361702 1361710 1362719 1362724) (-835 "OMLO.spad" 1361127 1361139 1361588 1361627) (-834 "OMEXPR.spad" 1360961 1360971 1361117 1361122) (-833 "OMERR.spad" 1360506 1360514 1360951 1360956) (-832 "OMERRK.spad" 1359540 1359548 1360496 1360501) (-831 "OMENC.spad" 1358884 1358892 1359530 1359535) (-830 "OMDEV.spad" 1353193 1353201 1358874 1358879) (-829 "OMCONN.spad" 1352602 1352610 1353183 1353188) (-828 "OINTDOM.spad" 1352365 1352373 1352528 1352597) (-827 "OFMONOID.spad" 1350488 1350498 1352321 1352326) (-826 "ODVAR.spad" 1349749 1349759 1350478 1350483) (-825 "ODR.spad" 1349393 1349419 1349561 1349710) (-824 "ODPOL.spad" 1346775 1346785 1347115 1347242) (-823 "ODP.spad" 1336622 1336642 1336995 1337126) (-822 "ODETOOLS.spad" 1335271 1335290 1336612 1336617) (-821 "ODESYS.spad" 1332965 1332982 1335261 1335266) (-820 "ODERTRIC.spad" 1328974 1328991 1332922 1332927) (-819 "ODERED.spad" 1328373 1328397 1328964 1328969) (-818 "ODERAT.spad" 1325988 1326005 1328363 1328368) (-817 "ODEPRRIC.spad" 1323025 1323047 1325978 1325983) (-816 "ODEPROB.spad" 1322282 1322290 1323015 1323020) (-815 "ODEPRIM.spad" 1319616 1319638 1322272 1322277) (-814 "ODEPAL.spad" 1319002 1319026 1319606 1319611) (-813 "ODEPACK.spad" 1305668 1305676 1318992 1318997) (-812 "ODEINT.spad" 1305103 1305119 1305658 1305663) (-811 "ODEIFTBL.spad" 1302498 1302506 1305093 1305098) (-810 "ODEEF.spad" 1297989 1298005 1302488 1302493) (-809 "ODECONST.spad" 1297526 1297544 1297979 1297984) (-808 "ODECAT.spad" 1296124 1296132 1297516 1297521) (-807 "OCT.spad" 1294260 1294270 1294974 1295013) (-806 "OCTCT2.spad" 1293906 1293927 1294250 1294255) (-805 "OC.spad" 1291702 1291712 1293862 1293901) (-804 "OC.spad" 1289223 1289235 1291385 1291390) (-803 "OCAMON.spad" 1289071 1289079 1289213 1289218) (-802 "OASGP.spad" 1288886 1288894 1289061 1289066) (-801 "OAMONS.spad" 1288408 1288416 1288876 1288881) (-800 "OAMON.spad" 1288269 1288277 1288398 1288403) (-799 "OAGROUP.spad" 1288131 1288139 1288259 1288264) (-798 "NUMTUBE.spad" 1287722 1287738 1288121 1288126) (-797 "NUMQUAD.spad" 1275698 1275706 1287712 1287717) (-796 "NUMODE.spad" 1267052 1267060 1275688 1275693) (-795 "NUMINT.spad" 1264618 1264626 1267042 1267047) (-794 "NUMFMT.spad" 1263458 1263466 1264608 1264613) (-793 "NUMERIC.spad" 1255572 1255582 1263263 1263268) (-792 "NTSCAT.spad" 1254080 1254096 1255540 1255567) (-791 "NTPOLFN.spad" 1253631 1253641 1253997 1254002) (-790 "NSUP.spad" 1246677 1246687 1251217 1251370) (-789 "NSUP2.spad" 1246069 1246081 1246667 1246672) (-788 "NSMP.spad" 1242299 1242318 1242607 1242734) (-787 "NREP.spad" 1240677 1240691 1242289 1242294) (-786 "NPCOEF.spad" 1239923 1239943 1240667 1240672) (-785 "NORMRETR.spad" 1239521 1239560 1239913 1239918) (-784 "NORMPK.spad" 1237423 1237442 1239511 1239516) (-783 "NORMMA.spad" 1237111 1237137 1237413 1237418) (-782 "NONE.spad" 1236852 1236860 1237101 1237106) (-781 "NONE1.spad" 1236528 1236538 1236842 1236847) (-780 "NODE1.spad" 1236015 1236031 1236518 1236523) (-779 "NNI.spad" 1234910 1234918 1235989 1236010) (-778 "NLINSOL.spad" 1233536 1233546 1234900 1234905) (-777 "NIPROB.spad" 1232077 1232085 1233526 1233531) (-776 "NFINTBAS.spad" 1229637 1229654 1232067 1232072) (-775 "NETCLT.spad" 1229611 1229622 1229627 1229632) (-774 "NCODIV.spad" 1227827 1227843 1229601 1229606) (-773 "NCNTFRAC.spad" 1227469 1227483 1227817 1227822) (-772 "NCEP.spad" 1225635 1225649 1227459 1227464) (-771 "NASRING.spad" 1225231 1225239 1225625 1225630) (-770 "NASRING.spad" 1224825 1224835 1225221 1225226) (-769 "NARNG.spad" 1224177 1224185 1224815 1224820) (-768 "NARNG.spad" 1223527 1223537 1224167 1224172) (-767 "NAGSP.spad" 1222604 1222612 1223517 1223522) (-766 "NAGS.spad" 1212265 1212273 1222594 1222599) (-765 "NAGF07.spad" 1210696 1210704 1212255 1212260) (-764 "NAGF04.spad" 1205098 1205106 1210686 1210691) (-763 "NAGF02.spad" 1199167 1199175 1205088 1205093) (-762 "NAGF01.spad" 1194928 1194936 1199157 1199162) (-761 "NAGE04.spad" 1188628 1188636 1194918 1194923) (-760 "NAGE02.spad" 1179288 1179296 1188618 1188623) (-759 "NAGE01.spad" 1175290 1175298 1179278 1179283) (-758 "NAGD03.spad" 1173294 1173302 1175280 1175285) (-757 "NAGD02.spad" 1166041 1166049 1173284 1173289) (-756 "NAGD01.spad" 1160334 1160342 1166031 1166036) (-755 "NAGC06.spad" 1156209 1156217 1160324 1160329) (-754 "NAGC05.spad" 1154710 1154718 1156199 1156204) (-753 "NAGC02.spad" 1153977 1153985 1154700 1154705) (-752 "NAALG.spad" 1153518 1153528 1153945 1153972) (-751 "NAALG.spad" 1153079 1153091 1153508 1153513) (-750 "MULTSQFR.spad" 1150037 1150054 1153069 1153074) (-749 "MULTFACT.spad" 1149420 1149437 1150027 1150032) (-748 "MTSCAT.spad" 1147514 1147535 1149318 1149415) (-747 "MTHING.spad" 1147173 1147183 1147504 1147509) (-746 "MSYSCMD.spad" 1146607 1146615 1147163 1147168) (-745 "MSET.spad" 1144565 1144575 1146313 1146352) (-744 "MSETAGG.spad" 1144410 1144420 1144533 1144560) (-743 "MRING.spad" 1141387 1141399 1144118 1144185) (-742 "MRF2.spad" 1140957 1140971 1141377 1141382) (-741 "MRATFAC.spad" 1140503 1140520 1140947 1140952) (-740 "MPRFF.spad" 1138543 1138562 1140493 1140498) (-739 "MPOLY.spad" 1136014 1136029 1136373 1136500) (-738 "MPCPF.spad" 1135278 1135297 1136004 1136009) (-737 "MPC3.spad" 1135095 1135135 1135268 1135273) (-736 "MPC2.spad" 1134741 1134774 1135085 1135090) (-735 "MONOTOOL.spad" 1133092 1133109 1134731 1134736) (-734 "MONOID.spad" 1132411 1132419 1133082 1133087) (-733 "MONOID.spad" 1131728 1131738 1132401 1132406) (-732 "MONOGEN.spad" 1130476 1130489 1131588 1131723) (-731 "MONOGEN.spad" 1129246 1129261 1130360 1130365) (-730 "MONADWU.spad" 1127276 1127284 1129236 1129241) (-729 "MONADWU.spad" 1125304 1125314 1127266 1127271) (-728 "MONAD.spad" 1124464 1124472 1125294 1125299) (-727 "MONAD.spad" 1123622 1123632 1124454 1124459) (-726 "MOEBIUS.spad" 1122358 1122372 1123602 1123617) (-725 "MODULE.spad" 1122228 1122238 1122326 1122353) (-724 "MODULE.spad" 1122118 1122130 1122218 1122223) (-723 "MODRING.spad" 1121453 1121492 1122098 1122113) (-722 "MODOP.spad" 1120118 1120130 1121275 1121342) (-721 "MODMONOM.spad" 1119849 1119867 1120108 1120113) (-720 "MODMON.spad" 1116644 1116660 1117363 1117516) (-719 "MODFIELD.spad" 1116006 1116045 1116546 1116639) (-718 "MMLFORM.spad" 1114866 1114874 1115996 1116001) (-717 "MMAP.spad" 1114608 1114642 1114856 1114861) (-716 "MLO.spad" 1113067 1113077 1114564 1114603) (-715 "MLIFT.spad" 1111679 1111696 1113057 1113062) (-714 "MKUCFUNC.spad" 1111214 1111232 1111669 1111674) (-713 "MKRECORD.spad" 1110818 1110831 1111204 1111209) (-712 "MKFUNC.spad" 1110225 1110235 1110808 1110813) (-711 "MKFLCFN.spad" 1109193 1109203 1110215 1110220) (-710 "MKBCFUNC.spad" 1108688 1108706 1109183 1109188) (-709 "MINT.spad" 1108127 1108135 1108590 1108683) (-708 "MHROWRED.spad" 1106638 1106648 1108117 1108122) (-707 "MFLOAT.spad" 1105158 1105166 1106528 1106633) (-706 "MFINFACT.spad" 1104558 1104580 1105148 1105153) (-705 "MESH.spad" 1102340 1102348 1104548 1104553) (-704 "MDDFACT.spad" 1100551 1100561 1102330 1102335) (-703 "MDAGG.spad" 1099842 1099852 1100531 1100546) (-702 "MCMPLX.spad" 1095853 1095861 1096467 1096668) (-701 "MCDEN.spad" 1095063 1095075 1095843 1095848) (-700 "MCALCFN.spad" 1092185 1092211 1095053 1095058) (-699 "MAYBE.spad" 1091469 1091480 1092175 1092180) (-698 "MATSTOR.spad" 1088777 1088787 1091459 1091464) (-697 "MATRIX.spad" 1087481 1087491 1087965 1087992) (-696 "MATLIN.spad" 1084825 1084849 1087365 1087370) (-695 "MATCAT.spad" 1076554 1076576 1084793 1084820) (-694 "MATCAT.spad" 1068155 1068179 1076396 1076401) (-693 "MATCAT2.spad" 1067437 1067485 1068145 1068150) (-692 "MAPPKG3.spad" 1066352 1066366 1067427 1067432) (-691 "MAPPKG2.spad" 1065690 1065702 1066342 1066347) (-690 "MAPPKG1.spad" 1064518 1064528 1065680 1065685) (-689 "MAPPAST.spad" 1063833 1063841 1064508 1064513) (-688 "MAPHACK3.spad" 1063645 1063659 1063823 1063828) (-687 "MAPHACK2.spad" 1063414 1063426 1063635 1063640) (-686 "MAPHACK1.spad" 1063058 1063068 1063404 1063409) (-685 "MAGMA.spad" 1060848 1060865 1063048 1063053) (-684 "MACROAST.spad" 1060427 1060435 1060838 1060843) (-683 "M3D.spad" 1058147 1058157 1059805 1059810) (-682 "LZSTAGG.spad" 1055385 1055395 1058137 1058142) (-681 "LZSTAGG.spad" 1052621 1052633 1055375 1055380) (-680 "LWORD.spad" 1049326 1049343 1052611 1052616) (-679 "LSTAST.spad" 1049110 1049118 1049316 1049321) (-678 "LSQM.spad" 1047340 1047354 1047734 1047785) (-677 "LSPP.spad" 1046875 1046892 1047330 1047335) (-676 "LSMP.spad" 1045725 1045753 1046865 1046870) (-675 "LSMP1.spad" 1043543 1043557 1045715 1045720) (-674 "LSAGG.spad" 1043212 1043222 1043511 1043538) (-673 "LSAGG.spad" 1042901 1042913 1043202 1043207) (-672 "LPOLY.spad" 1041855 1041874 1042757 1042826) (-671 "LPEFRAC.spad" 1041126 1041136 1041845 1041850) (-670 "LO.spad" 1040527 1040541 1041060 1041087) (-669 "LOGIC.spad" 1040129 1040137 1040517 1040522) (-668 "LOGIC.spad" 1039729 1039739 1040119 1040124) (-667 "LODOOPS.spad" 1038659 1038671 1039719 1039724) (-666 "LODO.spad" 1038043 1038059 1038339 1038378) (-665 "LODOF.spad" 1037089 1037106 1038000 1038005) (-664 "LODOCAT.spad" 1035755 1035765 1037045 1037084) (-663 "LODOCAT.spad" 1034419 1034431 1035711 1035716) (-662 "LODO2.spad" 1033692 1033704 1034099 1034138) (-661 "LODO1.spad" 1033092 1033102 1033372 1033411) (-660 "LODEEF.spad" 1031894 1031912 1033082 1033087) (-659 "LNAGG.spad" 1028041 1028051 1031884 1031889) (-658 "LNAGG.spad" 1024152 1024164 1027997 1028002) (-657 "LMOPS.spad" 1020920 1020937 1024142 1024147) (-656 "LMODULE.spad" 1020688 1020698 1020910 1020915) (-655 "LMDICT.spad" 1019975 1019985 1020239 1020266) (-654 "LLINSET.spad" 1019372 1019382 1019965 1019970) (-653 "LITERAL.spad" 1019278 1019289 1019362 1019367) (-652 "LIST.spad" 1017013 1017023 1018425 1018452) (-651 "LIST3.spad" 1016324 1016338 1017003 1017008) (-650 "LIST2.spad" 1015026 1015038 1016314 1016319) (-649 "LIST2MAP.spad" 1011929 1011941 1015016 1015021) (-648 "LINSET.spad" 1011551 1011561 1011919 1011924) (-647 "LINEXP.spad" 1010985 1010995 1011531 1011546) (-646 "LINDEP.spad" 1009794 1009806 1010897 1010902) (-645 "LIMITRF.spad" 1007722 1007732 1009784 1009789) (-644 "LIMITPS.spad" 1006625 1006638 1007712 1007717) (-643 "LIE.spad" 1004641 1004653 1005915 1006060) (-642 "LIECAT.spad" 1004117 1004127 1004567 1004636) (-641 "LIECAT.spad" 1003621 1003633 1004073 1004078) (-640 "LIB.spad" 1001834 1001842 1002280 1002295) (-639 "LGROBP.spad" 999187 999206 1001824 1001829) (-638 "LF.spad" 998142 998158 999177 999182) (-637 "LFCAT.spad" 997201 997209 998132 998137) (-636 "LEXTRIPK.spad" 992704 992719 997191 997196) (-635 "LEXP.spad" 990707 990734 992684 992699) (-634 "LETAST.spad" 990406 990414 990697 990702) (-633 "LEADCDET.spad" 988804 988821 990396 990401) (-632 "LAZM3PK.spad" 987508 987530 988794 988799) (-631 "LAUPOL.spad" 986201 986214 987101 987170) (-630 "LAPLACE.spad" 985784 985800 986191 986196) (-629 "LA.spad" 985224 985238 985706 985745) (-628 "LALG.spad" 985000 985010 985204 985219) (-627 "LALG.spad" 984784 984796 984990 984995) (-626 "KVTFROM.spad" 984519 984529 984774 984779) (-625 "KTVLOGIC.spad" 984031 984039 984509 984514) (-624 "KRCFROM.spad" 983769 983779 984021 984026) (-623 "KOVACIC.spad" 982492 982509 983759 983764) (-622 "KONVERT.spad" 982214 982224 982482 982487) (-621 "KOERCE.spad" 981951 981961 982204 982209) (-620 "KERNEL.spad" 980606 980616 981735 981740) (-619 "KERNEL2.spad" 980309 980321 980596 980601) (-618 "KDAGG.spad" 979418 979440 980289 980304) (-617 "KDAGG.spad" 978535 978559 979408 979413) (-616 "KAFILE.spad" 977498 977514 977733 977760) (-615 "JORDAN.spad" 975327 975339 976788 976933) (-614 "JOINAST.spad" 975021 975029 975317 975322) (-613 "JAVACODE.spad" 974887 974895 975011 975016) (-612 "IXAGG.spad" 973020 973044 974877 974882) (-611 "IXAGG.spad" 971008 971034 972867 972872) (-610 "IVECTOR.spad" 969778 969793 969933 969960) (-609 "ITUPLE.spad" 968939 968949 969768 969773) (-608 "ITRIGMNP.spad" 967778 967797 968929 968934) (-607 "ITFUN3.spad" 967284 967298 967768 967773) (-606 "ITFUN2.spad" 967028 967040 967274 967279) (-605 "ITFORM.spad" 966383 966391 967018 967023) (-604 "ITAYLOR.spad" 964377 964392 966247 966344) (-603 "ISUPS.spad" 956814 956829 963351 963448) (-602 "ISUMP.spad" 956315 956331 956804 956809) (-601 "ISTRING.spad" 955403 955416 955484 955511) (-600 "ISAST.spad" 955122 955130 955393 955398) (-599 "IRURPK.spad" 953839 953858 955112 955117) (-598 "IRSN.spad" 951811 951819 953829 953834) (-597 "IRRF2F.spad" 950296 950306 951767 951772) (-596 "IRREDFFX.spad" 949897 949908 950286 950291) (-595 "IROOT.spad" 948236 948246 949887 949892) (-594 "IR.spad" 946037 946051 948091 948118) (-593 "IRFORM.spad" 945361 945369 946027 946032) (-592 "IR2.spad" 944389 944405 945351 945356) (-591 "IR2F.spad" 943595 943611 944379 944384) (-590 "IPRNTPK.spad" 943355 943363 943585 943590) (-589 "IPF.spad" 942920 942932 943160 943253) (-588 "IPADIC.spad" 942681 942707 942846 942915) (-587 "IP4ADDR.spad" 942238 942246 942671 942676) (-586 "IOMODE.spad" 941760 941768 942228 942233) (-585 "IOBFILE.spad" 941121 941129 941750 941755) (-584 "IOBCON.spad" 940986 940994 941111 941116) (-583 "INVLAPLA.spad" 940635 940651 940976 940981) (-582 "INTTR.spad" 934017 934034 940625 940630) (-581 "INTTOOLS.spad" 931772 931788 933591 933596) (-580 "INTSLPE.spad" 931092 931100 931762 931767) (-579 "INTRVL.spad" 930658 930668 931006 931087) (-578 "INTRF.spad" 929082 929096 930648 930653) (-577 "INTRET.spad" 928514 928524 929072 929077) (-576 "INTRAT.spad" 927241 927258 928504 928509) (-575 "INTPM.spad" 925626 925642 926884 926889) (-574 "INTPAF.spad" 923490 923508 925558 925563) (-573 "INTPACK.spad" 913864 913872 923480 923485) (-572 "INT.spad" 913312 913320 913718 913859) (-571 "INTHERTR.spad" 912586 912603 913302 913307) (-570 "INTHERAL.spad" 912256 912280 912576 912581) (-569 "INTHEORY.spad" 908695 908703 912246 912251) (-568 "INTG0.spad" 902428 902446 908627 908632) (-567 "INTFTBL.spad" 896457 896465 902418 902423) (-566 "INTFACT.spad" 895516 895526 896447 896452) (-565 "INTEF.spad" 893901 893917 895506 895511) (-564 "INTDOM.spad" 892524 892532 893827 893896) (-563 "INTDOM.spad" 891209 891219 892514 892519) (-562 "INTCAT.spad" 889468 889478 891123 891204) (-561 "INTBIT.spad" 888975 888983 889458 889463) (-560 "INTALG.spad" 888163 888190 888965 888970) (-559 "INTAF.spad" 887663 887679 888153 888158) (-558 "INTABL.spad" 886181 886212 886344 886371) (-557 "INT8.spad" 886061 886069 886171 886176) (-556 "INT64.spad" 885940 885948 886051 886056) (-555 "INT32.spad" 885819 885827 885930 885935) (-554 "INT16.spad" 885698 885706 885809 885814) (-553 "INS.spad" 883201 883209 885600 885693) (-552 "INS.spad" 880790 880800 883191 883196) (-551 "INPSIGN.spad" 880238 880251 880780 880785) (-550 "INPRODPF.spad" 879334 879353 880228 880233) (-549 "INPRODFF.spad" 878422 878446 879324 879329) (-548 "INNMFACT.spad" 877397 877414 878412 878417) (-547 "INMODGCD.spad" 876885 876915 877387 877392) (-546 "INFSP.spad" 875182 875204 876875 876880) (-545 "INFPROD0.spad" 874262 874281 875172 875177) (-544 "INFORM.spad" 871461 871469 874252 874257) (-543 "INFORM1.spad" 871086 871096 871451 871456) (-542 "INFINITY.spad" 870638 870646 871076 871081) (-541 "INETCLTS.spad" 870615 870623 870628 870633) (-540 "INEP.spad" 869153 869175 870605 870610) (-539 "INDE.spad" 868882 868899 869143 869148) (-538 "INCRMAPS.spad" 868303 868313 868872 868877) (-537 "INBFILE.spad" 867375 867383 868293 868298) (-536 "INBFF.spad" 863169 863180 867365 867370) (-535 "INBCON.spad" 861459 861467 863159 863164) (-534 "INBCON.spad" 859747 859757 861449 861454) (-533 "INAST.spad" 859408 859416 859737 859742) (-532 "IMPTAST.spad" 859116 859124 859398 859403) (-531 "IMATRIX.spad" 858061 858087 858573 858600) (-530 "IMATQF.spad" 857155 857199 858017 858022) (-529 "IMATLIN.spad" 855760 855784 857111 857116) (-528 "ILIST.spad" 854418 854433 854943 854970) (-527 "IIARRAY2.spad" 853806 853844 854025 854052) (-526 "IFF.spad" 853216 853232 853487 853580) (-525 "IFAST.spad" 852830 852838 853206 853211) (-524 "IFARRAY.spad" 850323 850338 852013 852040) (-523 "IFAMON.spad" 850185 850202 850279 850284) (-522 "IEVALAB.spad" 849590 849602 850175 850180) (-521 "IEVALAB.spad" 848993 849007 849580 849585) (-520 "IDPO.spad" 848791 848803 848983 848988) (-519 "IDPOAMS.spad" 848547 848559 848781 848786) (-518 "IDPOAM.spad" 848267 848279 848537 848542) (-517 "IDPC.spad" 847205 847217 848257 848262) (-516 "IDPAM.spad" 846950 846962 847195 847200) (-515 "IDPAG.spad" 846697 846709 846940 846945) (-514 "IDENT.spad" 846347 846355 846687 846692) (-513 "IDECOMP.spad" 843586 843604 846337 846342) (-512 "IDEAL.spad" 838535 838574 843521 843526) (-511 "ICDEN.spad" 837724 837740 838525 838530) (-510 "ICARD.spad" 836915 836923 837714 837719) (-509 "IBPTOOLS.spad" 835522 835539 836905 836910) (-508 "IBITS.spad" 834725 834738 835158 835185) (-507 "IBATOOL.spad" 831702 831721 834715 834720) (-506 "IBACHIN.spad" 830209 830224 831692 831697) (-505 "IARRAY2.spad" 829197 829223 829816 829843) (-504 "IARRAY1.spad" 828242 828257 828380 828407) (-503 "IAN.spad" 826465 826473 828058 828151) (-502 "IALGFACT.spad" 826068 826101 826455 826460) (-501 "HYPCAT.spad" 825492 825500 826058 826063) (-500 "HYPCAT.spad" 824914 824924 825482 825487) (-499 "HOSTNAME.spad" 824722 824730 824904 824909) (-498 "HOMOTOP.spad" 824465 824475 824712 824717) (-497 "HOAGG.spad" 821747 821757 824455 824460) (-496 "HOAGG.spad" 818804 818816 821514 821519) (-495 "HEXADEC.spad" 816906 816914 817271 817364) (-494 "HEUGCD.spad" 815941 815952 816896 816901) (-493 "HELLFDIV.spad" 815531 815555 815931 815936) (-492 "HEAP.spad" 814923 814933 815138 815165) (-491 "HEADAST.spad" 814456 814464 814913 814918) (-490 "HDP.spad" 804299 804315 804676 804807) (-489 "HDMP.spad" 801513 801528 802129 802256) (-488 "HB.spad" 799764 799772 801503 801508) (-487 "HASHTBL.spad" 798234 798265 798445 798472) (-486 "HASAST.spad" 797950 797958 798224 798229) (-485 "HACKPI.spad" 797441 797449 797852 797945) (-484 "GTSET.spad" 796380 796396 797087 797114) (-483 "GSTBL.spad" 794899 794934 795073 795088) (-482 "GSERIES.spad" 792070 792097 793031 793180) (-481 "GROUP.spad" 791343 791351 792050 792065) (-480 "GROUP.spad" 790624 790634 791333 791338) (-479 "GROEBSOL.spad" 789118 789139 790614 790619) (-478 "GRMOD.spad" 787689 787701 789108 789113) (-477 "GRMOD.spad" 786258 786272 787679 787684) (-476 "GRIMAGE.spad" 779147 779155 786248 786253) (-475 "GRDEF.spad" 777526 777534 779137 779142) (-474 "GRAY.spad" 775989 775997 777516 777521) (-473 "GRALG.spad" 775066 775078 775979 775984) (-472 "GRALG.spad" 774141 774155 775056 775061) (-471 "GPOLSET.spad" 773595 773618 773823 773850) (-470 "GOSPER.spad" 772864 772882 773585 773590) (-469 "GMODPOL.spad" 772012 772039 772832 772859) (-468 "GHENSEL.spad" 771095 771109 772002 772007) (-467 "GENUPS.spad" 767388 767401 771085 771090) (-466 "GENUFACT.spad" 766965 766975 767378 767383) (-465 "GENPGCD.spad" 766551 766568 766955 766960) (-464 "GENMFACT.spad" 766003 766022 766541 766546) (-463 "GENEEZ.spad" 763954 763967 765993 765998) (-462 "GDMP.spad" 761010 761027 761784 761911) (-461 "GCNAALG.spad" 754933 754960 760804 760871) (-460 "GCDDOM.spad" 754109 754117 754859 754928) (-459 "GCDDOM.spad" 753347 753357 754099 754104) (-458 "GB.spad" 750873 750911 753303 753308) (-457 "GBINTERN.spad" 746893 746931 750863 750868) (-456 "GBF.spad" 742660 742698 746883 746888) (-455 "GBEUCLID.spad" 740542 740580 742650 742655) (-454 "GAUSSFAC.spad" 739855 739863 740532 740537) (-453 "GALUTIL.spad" 738181 738191 739811 739816) (-452 "GALPOLYU.spad" 736635 736648 738171 738176) (-451 "GALFACTU.spad" 734808 734827 736625 736630) (-450 "GALFACT.spad" 724997 725008 734798 734803) (-449 "FVFUN.spad" 722020 722028 724987 724992) (-448 "FVC.spad" 721072 721080 722010 722015) (-447 "FUNDESC.spad" 720750 720758 721062 721067) (-446 "FUNCTION.spad" 720599 720611 720740 720745) (-445 "FT.spad" 718896 718904 720589 720594) (-444 "FTEM.spad" 718061 718069 718886 718891) (-443 "FSUPFACT.spad" 716961 716980 717997 718002) (-442 "FST.spad" 715047 715055 716951 716956) (-441 "FSRED.spad" 714527 714543 715037 715042) (-440 "FSPRMELT.spad" 713409 713425 714484 714489) (-439 "FSPECF.spad" 711500 711516 713399 713404) (-438 "FS.spad" 705768 705778 711275 711495) (-437 "FS.spad" 699814 699826 705323 705328) (-436 "FSINT.spad" 699474 699490 699804 699809) (-435 "FSERIES.spad" 698665 698677 699294 699393) (-434 "FSCINT.spad" 697982 697998 698655 698660) (-433 "FSAGG.spad" 697099 697109 697938 697977) (-432 "FSAGG.spad" 696178 696190 697019 697024) (-431 "FSAGG2.spad" 694921 694937 696168 696173) (-430 "FS2UPS.spad" 689412 689446 694911 694916) (-429 "FS2.spad" 689059 689075 689402 689407) (-428 "FS2EXPXP.spad" 688184 688207 689049 689054) (-427 "FRUTIL.spad" 687138 687148 688174 688179) (-426 "FR.spad" 680670 680680 685978 686047) (-425 "FRNAALG.spad" 675939 675949 680612 680665) (-424 "FRNAALG.spad" 671220 671232 675895 675900) (-423 "FRNAAF2.spad" 670676 670694 671210 671215) (-422 "FRMOD.spad" 670086 670116 670607 670612) (-421 "FRIDEAL.spad" 669311 669332 670066 670081) (-420 "FRIDEAL2.spad" 668915 668947 669301 669306) (-419 "FRETRCT.spad" 668426 668436 668905 668910) (-418 "FRETRCT.spad" 667803 667815 668284 668289) (-417 "FRAMALG.spad" 666151 666164 667759 667798) (-416 "FRAMALG.spad" 664531 664546 666141 666146) (-415 "FRAC.spad" 661630 661640 662033 662206) (-414 "FRAC2.spad" 661235 661247 661620 661625) (-413 "FR2.spad" 660571 660583 661225 661230) (-412 "FPS.spad" 657386 657394 660461 660566) (-411 "FPS.spad" 654229 654239 657306 657311) (-410 "FPC.spad" 653275 653283 654131 654224) (-409 "FPC.spad" 652407 652417 653265 653270) (-408 "FPATMAB.spad" 652169 652179 652397 652402) (-407 "FPARFRAC.spad" 650656 650673 652159 652164) (-406 "FORTRAN.spad" 649162 649205 650646 650651) (-405 "FORT.spad" 648111 648119 649152 649157) (-404 "FORTFN.spad" 645281 645289 648101 648106) (-403 "FORTCAT.spad" 644965 644973 645271 645276) (-402 "FORMULA.spad" 642439 642447 644955 644960) (-401 "FORMULA1.spad" 641918 641928 642429 642434) (-400 "FORDER.spad" 641609 641633 641908 641913) (-399 "FOP.spad" 640810 640818 641599 641604) (-398 "FNLA.spad" 640234 640256 640778 640805) (-397 "FNCAT.spad" 638829 638837 640224 640229) (-396 "FNAME.spad" 638721 638729 638819 638824) (-395 "FMTC.spad" 638519 638527 638647 638716) (-394 "FMONOID.spad" 638184 638194 638475 638480) (-393 "FMONCAT.spad" 635337 635347 638174 638179) (-392 "FM.spad" 635032 635044 635271 635298) (-391 "FMFUN.spad" 632062 632070 635022 635027) (-390 "FMC.spad" 631114 631122 632052 632057) (-389 "FMCAT.spad" 628782 628800 631082 631109) (-388 "FM1.spad" 628139 628151 628716 628743) (-387 "FLOATRP.spad" 625874 625888 628129 628134) (-386 "FLOAT.spad" 619188 619196 625740 625869) (-385 "FLOATCP.spad" 616619 616633 619178 619183) (-384 "FLINEXP.spad" 616331 616341 616599 616614) (-383 "FLINEXP.spad" 615997 616009 616267 616272) (-382 "FLASORT.spad" 615323 615335 615987 615992) (-381 "FLALG.spad" 612969 612988 615249 615318) (-380 "FLAGG.spad" 610011 610021 612949 612964) (-379 "FLAGG.spad" 606954 606966 609894 609899) (-378 "FLAGG2.spad" 605679 605695 606944 606949) (-377 "FINRALG.spad" 603740 603753 605635 605674) (-376 "FINRALG.spad" 601727 601742 603624 603629) (-375 "FINITE.spad" 600879 600887 601717 601722) (-374 "FINAALG.spad" 590000 590010 600821 600874) (-373 "FINAALG.spad" 579133 579145 589956 589961) (-372 "FILE.spad" 578716 578726 579123 579128) (-371 "FILECAT.spad" 577242 577259 578706 578711) (-370 "FIELD.spad" 576648 576656 577144 577237) (-369 "FIELD.spad" 576140 576150 576638 576643) (-368 "FGROUP.spad" 574787 574797 576120 576135) (-367 "FGLMICPK.spad" 573574 573589 574777 574782) (-366 "FFX.spad" 572949 572964 573290 573383) (-365 "FFSLPE.spad" 572452 572473 572939 572944) (-364 "FFPOLY.spad" 563714 563725 572442 572447) (-363 "FFPOLY2.spad" 562774 562791 563704 563709) (-362 "FFP.spad" 562171 562191 562490 562583) (-361 "FF.spad" 561619 561635 561852 561945) (-360 "FFNBX.spad" 560131 560151 561335 561428) (-359 "FFNBP.spad" 558644 558661 559847 559940) (-358 "FFNB.spad" 557109 557130 558325 558418) (-357 "FFINTBAS.spad" 554623 554642 557099 557104) (-356 "FFIELDC.spad" 552200 552208 554525 554618) (-355 "FFIELDC.spad" 549863 549873 552190 552195) (-354 "FFHOM.spad" 548611 548628 549853 549858) (-353 "FFF.spad" 546046 546057 548601 548606) (-352 "FFCGX.spad" 544893 544913 545762 545855) (-351 "FFCGP.spad" 543782 543802 544609 544702) (-350 "FFCG.spad" 542574 542595 543463 543556) (-349 "FFCAT.spad" 535747 535769 542413 542569) (-348 "FFCAT.spad" 528999 529023 535667 535672) (-347 "FFCAT2.spad" 528746 528786 528989 528994) (-346 "FEXPR.spad" 520463 520509 528502 528541) (-345 "FEVALAB.spad" 520171 520181 520453 520458) (-344 "FEVALAB.spad" 519664 519676 519948 519953) (-343 "FDIV.spad" 519106 519130 519654 519659) (-342 "FDIVCAT.spad" 517170 517194 519096 519101) (-341 "FDIVCAT.spad" 515232 515258 517160 517165) (-340 "FDIV2.spad" 514888 514928 515222 515227) (-339 "FCTRDATA.spad" 513896 513904 514878 514883) (-338 "FCPAK1.spad" 512463 512471 513886 513891) (-337 "FCOMP.spad" 511842 511852 512453 512458) (-336 "FC.spad" 501849 501857 511832 511837) (-335 "FAXF.spad" 494820 494834 501751 501844) (-334 "FAXF.spad" 487843 487859 494776 494781) (-333 "FARRAY.spad" 485993 486003 487026 487053) (-332 "FAMR.spad" 484129 484141 485891 485988) (-331 "FAMR.spad" 482249 482263 484013 484018) (-330 "FAMONOID.spad" 481917 481927 482203 482208) (-329 "FAMONC.spad" 480213 480225 481907 481912) (-328 "FAGROUP.spad" 479837 479847 480109 480136) (-327 "FACUTIL.spad" 478041 478058 479827 479832) (-326 "FACTFUNC.spad" 477235 477245 478031 478036) (-325 "EXPUPXS.spad" 474068 474091 475367 475516) (-324 "EXPRTUBE.spad" 471356 471364 474058 474063) (-323 "EXPRODE.spad" 468516 468532 471346 471351) (-322 "EXPR.spad" 463791 463801 464505 464912) (-321 "EXPR2UPS.spad" 459913 459926 463781 463786) (-320 "EXPR2.spad" 459618 459630 459903 459908) (-319 "EXPEXPAN.spad" 456558 456583 457190 457283) (-318 "EXIT.spad" 456229 456237 456548 456553) (-317 "EXITAST.spad" 455965 455973 456219 456224) (-316 "EVALCYC.spad" 455425 455439 455955 455960) (-315 "EVALAB.spad" 454997 455007 455415 455420) (-314 "EVALAB.spad" 454567 454579 454987 454992) (-313 "EUCDOM.spad" 452141 452149 454493 454562) (-312 "EUCDOM.spad" 449777 449787 452131 452136) (-311 "ESTOOLS.spad" 441623 441631 449767 449772) (-310 "ESTOOLS2.spad" 441226 441240 441613 441618) (-309 "ESTOOLS1.spad" 440911 440922 441216 441221) (-308 "ES.spad" 433726 433734 440901 440906) (-307 "ES.spad" 426447 426457 433624 433629) (-306 "ESCONT.spad" 423240 423248 426437 426442) (-305 "ESCONT1.spad" 422989 423001 423230 423235) (-304 "ES2.spad" 422494 422510 422979 422984) (-303 "ES1.spad" 422064 422080 422484 422489) (-302 "ERROR.spad" 419391 419399 422054 422059) (-301 "EQTBL.spad" 417863 417885 418072 418099) (-300 "EQ.spad" 412668 412678 415455 415567) (-299 "EQ2.spad" 412386 412398 412658 412663) (-298 "EP.spad" 408712 408722 412376 412381) (-297 "ENV.spad" 407390 407398 408702 408707) (-296 "ENTIRER.spad" 407058 407066 407334 407385) (-295 "EMR.spad" 406346 406387 406984 407053) (-294 "ELTAGG.spad" 404600 404619 406336 406341) (-293 "ELTAGG.spad" 402818 402839 404556 404561) (-292 "ELTAB.spad" 402293 402306 402808 402813) (-291 "ELFUTS.spad" 401680 401699 402283 402288) (-290 "ELEMFUN.spad" 401369 401377 401670 401675) (-289 "ELEMFUN.spad" 401056 401066 401359 401364) (-288 "ELAGG.spad" 399027 399037 401036 401051) (-287 "ELAGG.spad" 396935 396947 398946 398951) (-286 "ELABOR.spad" 396281 396289 396925 396930) (-285 "ELABEXPR.spad" 395213 395221 396271 396276) (-284 "EFUPXS.spad" 391989 392019 395169 395174) (-283 "EFULS.spad" 388825 388848 391945 391950) (-282 "EFSTRUC.spad" 386840 386856 388815 388820) (-281 "EF.spad" 381616 381632 386830 386835) (-280 "EAB.spad" 379892 379900 381606 381611) (-279 "E04UCFA.spad" 379428 379436 379882 379887) (-278 "E04NAFA.spad" 379005 379013 379418 379423) (-277 "E04MBFA.spad" 378585 378593 378995 379000) (-276 "E04JAFA.spad" 378121 378129 378575 378580) (-275 "E04GCFA.spad" 377657 377665 378111 378116) (-274 "E04FDFA.spad" 377193 377201 377647 377652) (-273 "E04DGFA.spad" 376729 376737 377183 377188) (-272 "E04AGNT.spad" 372579 372587 376719 376724) (-271 "DVARCAT.spad" 369268 369278 372569 372574) (-270 "DVARCAT.spad" 365955 365967 369258 369263) (-269 "DSMP.spad" 363422 363436 363727 363854) (-268 "DROPT.spad" 357381 357389 363412 363417) (-267 "DROPT1.spad" 357046 357056 357371 357376) (-266 "DROPT0.spad" 351903 351911 357036 357041) (-265 "DRAWPT.spad" 350076 350084 351893 351898) (-264 "DRAW.spad" 342952 342965 350066 350071) (-263 "DRAWHACK.spad" 342260 342270 342942 342947) (-262 "DRAWCX.spad" 339730 339738 342250 342255) (-261 "DRAWCURV.spad" 339277 339292 339720 339725) (-260 "DRAWCFUN.spad" 328809 328817 339267 339272) (-259 "DQAGG.spad" 326987 326997 328777 328804) (-258 "DPOLCAT.spad" 322336 322352 326855 326982) (-257 "DPOLCAT.spad" 317771 317789 322292 322297) (-256 "DPMO.spad" 309997 310013 310135 310436) (-255 "DPMM.spad" 302236 302254 302361 302662) (-254 "DOMTMPLT.spad" 302007 302015 302226 302231) (-253 "DOMCTOR.spad" 301762 301770 301997 302002) (-252 "DOMAIN.spad" 300849 300857 301752 301757) (-251 "DMP.spad" 298109 298124 298679 298806) (-250 "DLP.spad" 297461 297471 298099 298104) (-249 "DLIST.spad" 296040 296050 296644 296671) (-248 "DLAGG.spad" 294457 294467 296030 296035) (-247 "DIVRING.spad" 293999 294007 294401 294452) (-246 "DIVRING.spad" 293585 293595 293989 293994) (-245 "DISPLAY.spad" 291775 291783 293575 293580) (-244 "DIRPROD.spad" 281355 281371 281995 282126) (-243 "DIRPROD2.spad" 280173 280191 281345 281350) (-242 "DIRPCAT.spad" 279117 279133 280037 280168) (-241 "DIRPCAT.spad" 277790 277808 278712 278717) (-240 "DIOSP.spad" 276615 276623 277780 277785) (-239 "DIOPS.spad" 275611 275621 276595 276610) (-238 "DIOPS.spad" 274581 274593 275567 275572) (-237 "DIFRING.spad" 274187 274195 274561 274576) (-236 "DIFRING.spad" 273801 273811 274177 274182) (-235 "DIFFDOM.spad" 272966 272977 273791 273796) (-234 "DIFFDOM.spad" 272129 272142 272956 272961) (-233 "DIFEXT.spad" 271300 271310 272109 272124) (-232 "DIFEXT.spad" 270388 270400 271199 271204) (-231 "DIAGG.spad" 270018 270028 270368 270383) (-230 "DIAGG.spad" 269656 269668 270008 270013) (-229 "DHMATRIX.spad" 267968 267978 269113 269140) (-228 "DFSFUN.spad" 261608 261616 267958 267963) (-227 "DFLOAT.spad" 258339 258347 261498 261603) (-226 "DFINTTLS.spad" 256570 256586 258329 258334) (-225 "DERHAM.spad" 254484 254516 256550 256565) (-224 "DEQUEUE.spad" 253808 253818 254091 254118) (-223 "DEGRED.spad" 253425 253439 253798 253803) (-222 "DEFINTRF.spad" 250962 250972 253415 253420) (-221 "DEFINTEF.spad" 249472 249488 250952 250957) (-220 "DEFAST.spad" 248840 248848 249462 249467) (-219 "DECIMAL.spad" 246946 246954 247307 247400) (-218 "DDFACT.spad" 244759 244776 246936 246941) (-217 "DBLRESP.spad" 244359 244383 244749 244754) (-216 "DBASE.spad" 243023 243033 244349 244354) (-215 "DATAARY.spad" 242485 242498 243013 243018) (-214 "D03FAFA.spad" 242313 242321 242475 242480) (-213 "D03EEFA.spad" 242133 242141 242303 242308) (-212 "D03AGNT.spad" 241219 241227 242123 242128) (-211 "D02EJFA.spad" 240681 240689 241209 241214) (-210 "D02CJFA.spad" 240159 240167 240671 240676) (-209 "D02BHFA.spad" 239649 239657 240149 240154) (-208 "D02BBFA.spad" 239139 239147 239639 239644) (-207 "D02AGNT.spad" 233953 233961 239129 239134) (-206 "D01WGTS.spad" 232272 232280 233943 233948) (-205 "D01TRNS.spad" 232249 232257 232262 232267) (-204 "D01GBFA.spad" 231771 231779 232239 232244) (-203 "D01FCFA.spad" 231293 231301 231761 231766) (-202 "D01ASFA.spad" 230761 230769 231283 231288) (-201 "D01AQFA.spad" 230207 230215 230751 230756) (-200 "D01APFA.spad" 229631 229639 230197 230202) (-199 "D01ANFA.spad" 229125 229133 229621 229626) (-198 "D01AMFA.spad" 228635 228643 229115 229120) (-197 "D01ALFA.spad" 228175 228183 228625 228630) (-196 "D01AKFA.spad" 227701 227709 228165 228170) (-195 "D01AJFA.spad" 227224 227232 227691 227696) (-194 "D01AGNT.spad" 223291 223299 227214 227219) (-193 "CYCLOTOM.spad" 222797 222805 223281 223286) (-192 "CYCLES.spad" 219589 219597 222787 222792) (-191 "CVMP.spad" 219006 219016 219579 219584) (-190 "CTRIGMNP.spad" 217506 217522 218996 219001) (-189 "CTOR.spad" 217197 217205 217496 217501) (-188 "CTORKIND.spad" 216800 216808 217187 217192) (-187 "CTORCAT.spad" 216049 216057 216790 216795) (-186 "CTORCAT.spad" 215296 215306 216039 216044) (-185 "CTORCALL.spad" 214885 214895 215286 215291) (-184 "CSTTOOLS.spad" 214130 214143 214875 214880) (-183 "CRFP.spad" 207854 207867 214120 214125) (-182 "CRCEAST.spad" 207574 207582 207844 207849) (-181 "CRAPACK.spad" 206625 206635 207564 207569) (-180 "CPMATCH.spad" 206129 206144 206550 206555) (-179 "CPIMA.spad" 205834 205853 206119 206124) (-178 "COORDSYS.spad" 200843 200853 205824 205829) (-177 "CONTOUR.spad" 200254 200262 200833 200838) (-176 "CONTFRAC.spad" 196004 196014 200156 200249) (-175 "CONDUIT.spad" 195762 195770 195994 195999) (-174 "COMRING.spad" 195436 195444 195700 195757) (-173 "COMPPROP.spad" 194954 194962 195426 195431) (-172 "COMPLPAT.spad" 194721 194736 194944 194949) (-171 "COMPLEX.spad" 188858 188868 189102 189363) (-170 "COMPLEX2.spad" 188573 188585 188848 188853) (-169 "COMPILER.spad" 188122 188130 188563 188568) (-168 "COMPFACT.spad" 187724 187738 188112 188117) (-167 "COMPCAT.spad" 185796 185806 187458 187719) (-166 "COMPCAT.spad" 183596 183608 185260 185265) (-165 "COMMUPC.spad" 183344 183362 183586 183591) (-164 "COMMONOP.spad" 182877 182885 183334 183339) (-163 "COMM.spad" 182688 182696 182867 182872) (-162 "COMMAAST.spad" 182451 182459 182678 182683) (-161 "COMBOPC.spad" 181366 181374 182441 182446) (-160 "COMBINAT.spad" 180133 180143 181356 181361) (-159 "COMBF.spad" 177515 177531 180123 180128) (-158 "COLOR.spad" 176352 176360 177505 177510) (-157 "COLONAST.spad" 176018 176026 176342 176347) (-156 "CMPLXRT.spad" 175729 175746 176008 176013) (-155 "CLLCTAST.spad" 175391 175399 175719 175724) (-154 "CLIP.spad" 171499 171507 175381 175386) (-153 "CLIF.spad" 170154 170170 171455 171494) (-152 "CLAGG.spad" 166659 166669 170144 170149) (-151 "CLAGG.spad" 163035 163047 166522 166527) (-150 "CINTSLPE.spad" 162366 162379 163025 163030) (-149 "CHVAR.spad" 160504 160526 162356 162361) (-148 "CHARZ.spad" 160419 160427 160484 160499) (-147 "CHARPOL.spad" 159929 159939 160409 160414) (-146 "CHARNZ.spad" 159682 159690 159909 159924) (-145 "CHAR.spad" 157556 157564 159672 159677) (-144 "CFCAT.spad" 156884 156892 157546 157551) (-143 "CDEN.spad" 156080 156094 156874 156879) (-142 "CCLASS.spad" 154229 154237 155491 155530) (-141 "CATEGORY.spad" 153271 153279 154219 154224) (-140 "CATCTOR.spad" 153162 153170 153261 153266) (-139 "CATAST.spad" 152780 152788 153152 153157) (-138 "CASEAST.spad" 152494 152502 152770 152775) (-137 "CARTEN.spad" 147861 147885 152484 152489) (-136 "CARTEN2.spad" 147251 147278 147851 147856) (-135 "CARD.spad" 144546 144554 147225 147246) (-134 "CAPSLAST.spad" 144320 144328 144536 144541) (-133 "CACHSET.spad" 143944 143952 144310 144315) (-132 "CABMON.spad" 143499 143507 143934 143939) (-131 "BYTEORD.spad" 143174 143182 143489 143494) (-130 "BYTE.spad" 142601 142609 143164 143169) (-129 "BYTEBUF.spad" 140460 140468 141770 141797) (-128 "BTREE.spad" 139533 139543 140067 140094) (-127 "BTOURN.spad" 138538 138548 139140 139167) (-126 "BTCAT.spad" 137930 137940 138506 138533) (-125 "BTCAT.spad" 137342 137354 137920 137925) (-124 "BTAGG.spad" 136808 136816 137310 137337) (-123 "BTAGG.spad" 136294 136304 136798 136803) (-122 "BSTREE.spad" 135035 135045 135901 135928) (-121 "BRILL.spad" 133232 133243 135025 135030) (-120 "BRAGG.spad" 132172 132182 133222 133227) (-119 "BRAGG.spad" 131076 131088 132128 132133) (-118 "BPADICRT.spad" 129057 129069 129312 129405) (-117 "BPADIC.spad" 128721 128733 128983 129052) (-116 "BOUNDZRO.spad" 128377 128394 128711 128716) (-115 "BOP.spad" 123559 123567 128367 128372) (-114 "BOP1.spad" 121025 121035 123549 123554) (-113 "BOOLE.spad" 120675 120683 121015 121020) (-112 "BOOLEAN.spad" 120113 120121 120665 120670) (-111 "BMODULE.spad" 119825 119837 120081 120108) (-110 "BITS.spad" 119246 119254 119461 119488) (-109 "BINDING.spad" 118659 118667 119236 119241) (-108 "BINARY.spad" 116770 116778 117126 117219) (-107 "BGAGG.spad" 115975 115985 116750 116765) (-106 "BGAGG.spad" 115188 115200 115965 115970) (-105 "BFUNCT.spad" 114752 114760 115168 115183) (-104 "BEZOUT.spad" 113892 113919 114702 114707) (-103 "BBTREE.spad" 110737 110747 113499 113526) (-102 "BASTYPE.spad" 110409 110417 110727 110732) (-101 "BASTYPE.spad" 110079 110089 110399 110404) (-100 "BALFACT.spad" 109538 109551 110069 110074) (-99 "AUTOMOR.spad" 108989 108998 109518 109533) (-98 "ATTREG.spad" 105712 105719 108741 108984) (-97 "ATTRBUT.spad" 101735 101742 105692 105707) (-96 "ATTRAST.spad" 101452 101459 101725 101730) (-95 "ATRIG.spad" 100922 100929 101442 101447) (-94 "ATRIG.spad" 100390 100399 100912 100917) (-93 "ASTCAT.spad" 100294 100301 100380 100385) (-92 "ASTCAT.spad" 100196 100205 100284 100289) (-91 "ASTACK.spad" 99535 99544 99803 99830) (-90 "ASSOCEQ.spad" 98361 98372 99491 99496) (-89 "ASP9.spad" 97442 97455 98351 98356) (-88 "ASP8.spad" 96485 96498 97432 97437) (-87 "ASP80.spad" 95807 95820 96475 96480) (-86 "ASP7.spad" 94967 94980 95797 95802) (-85 "ASP78.spad" 94418 94431 94957 94962) (-84 "ASP77.spad" 93787 93800 94408 94413) (-83 "ASP74.spad" 92879 92892 93777 93782) (-82 "ASP73.spad" 92150 92163 92869 92874) (-81 "ASP6.spad" 91017 91030 92140 92145) (-80 "ASP55.spad" 89526 89539 91007 91012) (-79 "ASP50.spad" 87343 87356 89516 89521) (-78 "ASP4.spad" 86638 86651 87333 87338) (-77 "ASP49.spad" 85637 85650 86628 86633) (-76 "ASP42.spad" 84044 84083 85627 85632) (-75 "ASP41.spad" 82623 82662 84034 84039) (-74 "ASP35.spad" 81611 81624 82613 82618) (-73 "ASP34.spad" 80912 80925 81601 81606) (-72 "ASP33.spad" 80472 80485 80902 80907) (-71 "ASP31.spad" 79612 79625 80462 80467) (-70 "ASP30.spad" 78504 78517 79602 79607) (-69 "ASP29.spad" 77970 77983 78494 78499) (-68 "ASP28.spad" 69243 69256 77960 77965) (-67 "ASP27.spad" 68140 68153 69233 69238) (-66 "ASP24.spad" 67227 67240 68130 68135) (-65 "ASP20.spad" 66691 66704 67217 67222) (-64 "ASP1.spad" 66072 66085 66681 66686) (-63 "ASP19.spad" 60758 60771 66062 66067) (-62 "ASP12.spad" 60172 60185 60748 60753) (-61 "ASP10.spad" 59443 59456 60162 60167) (-60 "ARRAY2.spad" 58803 58812 59050 59077) (-59 "ARRAY1.spad" 57640 57649 57986 58013) (-58 "ARRAY12.spad" 56353 56364 57630 57635) (-57 "ARR2CAT.spad" 52127 52148 56321 56348) (-56 "ARR2CAT.spad" 47921 47944 52117 52122) (-55 "ARITY.spad" 47293 47300 47911 47916) (-54 "APPRULE.spad" 46553 46575 47283 47288) (-53 "APPLYORE.spad" 46172 46185 46543 46548) (-52 "ANY.spad" 45031 45038 46162 46167) (-51 "ANY1.spad" 44102 44111 45021 45026) (-50 "ANTISYM.spad" 42547 42563 44082 44097) (-49 "ANON.spad" 42240 42247 42537 42542) (-48 "AN.spad" 40549 40556 42056 42149) (-47 "AMR.spad" 38734 38745 40447 40544) (-46 "AMR.spad" 36756 36769 38471 38476) (-45 "ALIST.spad" 34168 34189 34518 34545) (-44 "ALGSC.spad" 33303 33329 34040 34093) (-43 "ALGPKG.spad" 29086 29097 33259 33264) (-42 "ALGMFACT.spad" 28279 28293 29076 29081) (-41 "ALGMANIP.spad" 25753 25768 28112 28117) (-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 |