diff options
Diffstat (limited to 'src/share/algebra/browse.daase')
| -rw-r--r-- | src/share/algebra/browse.daase | 650 |
1 files changed, 325 insertions, 325 deletions
diff --git a/src/share/algebra/browse.daase b/src/share/algebra/browse.daase index c9fd7594..8908645d 100644 --- a/src/share/algebra/browse.daase +++ b/src/share/algebra/browse.daase @@ -1,5 +1,5 @@ -(2267227 . 3462993424) +(2262520 . 3465590093) (-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 -2111) +(-32 R -3944) ((|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 -1039) (QUOTE (-567))))) @@ -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 -2111 UP UPUP -3416) +(-40 -3944 UP UPUP -1615) ((|constructor| (NIL "Function field defined by \\spad{f}(\\spad{x},{} \\spad{y}) = 0.")) (|knownInfBasis| (((|Void|) (|NonNegativeInteger|)) "\\spad{knownInfBasis(n)} \\undocumented{}"))) ((-4409 |has| (-410 |#2|) (-365)) (-4414 |has| (-410 |#2|) (-365)) (-4408 |has| (-410 |#2|) (-365)) ((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) -((|HasCategory| (-410 |#2|) (QUOTE (-145))) (|HasCategory| (-410 |#2|) (QUOTE (-147))) (|HasCategory| (-410 |#2|) (QUOTE (-351))) (-2909 (|HasCategory| (-410 |#2|) (QUOTE (-365))) (|HasCategory| (-410 |#2|) (QUOTE (-351)))) (|HasCategory| (-410 |#2|) (QUOTE (-365))) (|HasCategory| (-410 |#2|) (QUOTE (-370))) (-2909 (-12 (|HasCategory| (-410 |#2|) (QUOTE (-233))) (|HasCategory| (-410 |#2|) (QUOTE (-365)))) (|HasCategory| (-410 |#2|) (QUOTE (-351)))) (-2909 (-12 (|HasCategory| (-410 |#2|) (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| (-410 |#2|) (QUOTE (-365)))) (-12 (|HasCategory| (-410 |#2|) (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| (-410 |#2|) (QUOTE (-351))))) (|HasCategory| (-410 |#2|) (LIST (QUOTE -640) (QUOTE (-567)))) (-2909 (|HasCategory| (-410 |#2|) (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| (-410 |#2|) (QUOTE (-365)))) (|HasCategory| (-410 |#2|) (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| (-410 |#2|) (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-370))) (-12 (|HasCategory| (-410 |#2|) (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| (-410 |#2|) (QUOTE (-365)))) (-12 (|HasCategory| (-410 |#2|) (QUOTE (-233))) (|HasCategory| (-410 |#2|) (QUOTE (-365))))) -(-41 R -2111) +((|HasCategory| (-410 |#2|) (QUOTE (-145))) (|HasCategory| (-410 |#2|) (QUOTE (-147))) (|HasCategory| (-410 |#2|) (QUOTE (-351))) (-2871 (|HasCategory| (-410 |#2|) (QUOTE (-365))) (|HasCategory| (-410 |#2|) (QUOTE (-351)))) (|HasCategory| (-410 |#2|) (QUOTE (-365))) (|HasCategory| (-410 |#2|) (QUOTE (-370))) (-2871 (-12 (|HasCategory| (-410 |#2|) (QUOTE (-233))) (|HasCategory| (-410 |#2|) (QUOTE (-365)))) (|HasCategory| (-410 |#2|) (QUOTE (-351)))) (-2871 (-12 (|HasCategory| (-410 |#2|) (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| (-410 |#2|) (QUOTE (-365)))) (-12 (|HasCategory| (-410 |#2|) (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| (-410 |#2|) (QUOTE (-351))))) (|HasCategory| (-410 |#2|) (LIST (QUOTE -640) (QUOTE (-567)))) (-2871 (|HasCategory| (-410 |#2|) (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| (-410 |#2|) (QUOTE (-365)))) (|HasCategory| (-410 |#2|) (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| (-410 |#2|) (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-370))) (-12 (|HasCategory| (-410 |#2|) (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| (-410 |#2|) (QUOTE (-365)))) (-12 (|HasCategory| (-410 |#2|) (QUOTE (-233))) (|HasCategory| (-410 |#2|) (QUOTE (-365))))) +(-41 R -3944) ((|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 (-455))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -433) (|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."))) ((-4416 . T) (-4417 . T)) -((-2909 (-12 (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (QUOTE (-851))) (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (LIST (QUOTE -310) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -1762) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3859) (|devaluate| |#2|)))))) (-12 (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (QUOTE (-1100))) (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (LIST (QUOTE -310) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -1762) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3859) (|devaluate| |#2|))))))) (-2909 (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (QUOTE (-851))) (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (QUOTE (-1100))) (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (LIST (QUOTE -615) (QUOTE (-539)))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-2909 (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (QUOTE (-851))) (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (QUOTE (-1100))) (|HasCategory| |#2| (QUOTE (-1100)))) (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| (-567) (QUOTE (-851))) (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (QUOTE (-1100))) (-2909 (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863))))) (-2909 (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (QUOTE (-1100))) (|HasCategory| |#2| (QUOTE (-1100)))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (QUOTE (-1100))) (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (LIST (QUOTE -310) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -1762) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3859) (|devaluate| |#2|))))))) +((-2871 (-12 (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (QUOTE (-851))) (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (LIST (QUOTE -310) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -1812) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -4217) (|devaluate| |#2|)))))) (-12 (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (QUOTE (-1100))) (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (LIST (QUOTE -310) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -1812) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -4217) (|devaluate| |#2|))))))) (-2871 (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (QUOTE (-851))) (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (QUOTE (-1100))) (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (LIST (QUOTE -615) (QUOTE (-539)))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-2871 (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (QUOTE (-851))) (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (QUOTE (-1100))) (|HasCategory| |#2| (QUOTE (-1100)))) (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| (-567) (QUOTE (-851))) (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (QUOTE (-1100))) (-2871 (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863))))) (-2871 (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (QUOTE (-1100))) (|HasCategory| |#2| (QUOTE (-1100)))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (QUOTE (-1100))) (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (LIST (QUOTE -310) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -1812) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -4217) (|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 -2111) +(-54 |Base| R -3944) ((|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}"))) ((-4417 . T) (-4416 . T)) -((-2909 (-12 (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) (-2909 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539)))) (-2909 (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-1100)))) (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| (-567) (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) +((-2871 (-12 (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) (-2871 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539)))) (-2871 (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-1100)))) (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| (-567) (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|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}."))) ((-4416 . T) (-4417 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1100))) (-2909 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) -(-61 -1817) +((-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1100))) (-2871 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) +(-61 -2011) ((|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 -1817) +(-62 -2011) ((|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 -1817) +(-63 -2011) ((|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 -1817) +(-64 -2011) ((|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 -1817) +(-65 -2011) ((|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 -1817) +(-66 -2011) ((|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 -1817) +(-67 -2011) ((|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 -1817) +(-68 -2011) ((|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 -1817) +(-69 -2011) ((|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 -1817) +(-70 -2011) ((|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 -1817) +(-71 -2011) ((|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 -1817) +(-72 -2011) ((|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 -1817) +(-73 -2011) ((|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 -1817) +(-74 -2011) ((|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 -1817) +(-77 -2011) ((|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 -1817) +(-78 -2011) ((|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 -1817) +(-79 -2011) ((|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 -1817) +(-80 -2011) ((|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 -1817) +(-81 -2011) ((|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 -1817) +(-82 -2011) ((|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 -1817) +(-83 -2011) ((|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 -1817) +(-84 -2011) ((|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 -1817) +(-85 -2011) ((|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 -1817) +(-86 -2011) ((|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 -1817) +(-87 -2011) ((|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 -1817) +(-88 -2011) ((|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 -1817) +(-89 -2011) ((|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}."))) ((-4416 . T) (-4417 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1100))) (-2909 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) +((-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1100))) (-2871 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (-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}."))) ((-4416 . T) (-4417 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1100))) (-2909 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) +((-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1100))) (-2871 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (-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."))) ((-4408 . T) (-4414 . T) (-4409 . T) ((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) -((|HasCategory| (-567) (QUOTE (-910))) (|HasCategory| (-567) (LIST (QUOTE -1039) (QUOTE (-1176)))) (|HasCategory| (-567) (QUOTE (-145))) (|HasCategory| (-567) (QUOTE (-147))) (|HasCategory| (-567) (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| (-567) (QUOTE (-1023))) (|HasCategory| (-567) (QUOTE (-821))) (-2909 (|HasCategory| (-567) (QUOTE (-821))) (|HasCategory| (-567) (QUOTE (-851)))) (|HasCategory| (-567) (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| (-567) (QUOTE (-1151))) (|HasCategory| (-567) (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| (-567) (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| (-567) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| (-567) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| (-567) (QUOTE (-233))) (|HasCategory| (-567) (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| (-567) (LIST (QUOTE -517) (QUOTE (-1176)) (QUOTE (-567)))) (|HasCategory| (-567) (LIST (QUOTE -310) (QUOTE (-567)))) (|HasCategory| (-567) (LIST (QUOTE -287) (QUOTE (-567)) (QUOTE (-567)))) (|HasCategory| (-567) (QUOTE (-308))) (|HasCategory| (-567) (QUOTE (-548))) (|HasCategory| (-567) (QUOTE (-851))) (|HasCategory| (-567) (LIST (QUOTE -640) (QUOTE (-567)))) (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| (-567) (QUOTE (-910)))) (-2909 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| (-567) (QUOTE (-910)))) (|HasCategory| (-567) (QUOTE (-145))))) +((|HasCategory| (-567) (QUOTE (-910))) (|HasCategory| (-567) (LIST (QUOTE -1039) (QUOTE (-1176)))) (|HasCategory| (-567) (QUOTE (-145))) (|HasCategory| (-567) (QUOTE (-147))) (|HasCategory| (-567) (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| (-567) (QUOTE (-1023))) (|HasCategory| (-567) (QUOTE (-821))) (-2871 (|HasCategory| (-567) (QUOTE (-821))) (|HasCategory| (-567) (QUOTE (-851)))) (|HasCategory| (-567) (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| (-567) (QUOTE (-1151))) (|HasCategory| (-567) (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| (-567) (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| (-567) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| (-567) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| (-567) (QUOTE (-233))) (|HasCategory| (-567) (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| (-567) (LIST (QUOTE -517) (QUOTE (-1176)) (QUOTE (-567)))) (|HasCategory| (-567) (LIST (QUOTE -310) (QUOTE (-567)))) (|HasCategory| (-567) (LIST (QUOTE -287) (QUOTE (-567)) (QUOTE (-567)))) (|HasCategory| (-567) (QUOTE (-308))) (|HasCategory| (-567) (QUOTE (-548))) (|HasCategory| (-567) (QUOTE (-851))) (|HasCategory| (-567) (LIST (QUOTE -640) (QUOTE (-567)))) (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| (-567) (QUOTE (-910)))) (-2871 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| (-567) (QUOTE (-910)))) (|HasCategory| (-567) (QUOTE (-145))))) (-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 @@ -388,7 +388,7 @@ NIL ((|constructor| (NIL "A basic operator is an object that can be applied to a list of arguments from a set,{} the result being a kernel over that set.")) (|setProperties| (($ $ (|AssociationList| (|String|) (|None|))) "\\spad{setProperties(op, l)} sets the property list of \\spad{op} to \\spad{l}. Argument \\spad{op} is modified \"in place\",{} \\spadignore{i.e.} no copy is made.")) (|setProperty| (($ $ (|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 -(-115 -2111 UP) +(-115 -3944 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 @@ -399,7 +399,7 @@ NIL (-117 |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}."))) ((-4408 . T) (-4414 . T) (-4409 . T) ((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) -((|HasCategory| (-116 |#1|) (QUOTE (-910))) (|HasCategory| (-116 |#1|) (LIST (QUOTE -1039) (QUOTE (-1176)))) (|HasCategory| (-116 |#1|) (QUOTE (-145))) (|HasCategory| (-116 |#1|) (QUOTE (-147))) (|HasCategory| (-116 |#1|) (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| (-116 |#1|) (QUOTE (-1023))) (|HasCategory| (-116 |#1|) (QUOTE (-821))) (-2909 (|HasCategory| (-116 |#1|) (QUOTE (-821))) (|HasCategory| (-116 |#1|) (QUOTE (-851)))) (|HasCategory| (-116 |#1|) (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| (-116 |#1|) (QUOTE (-1151))) (|HasCategory| (-116 |#1|) (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| (-116 |#1|) (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| (-116 |#1|) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| (-116 |#1|) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| (-116 |#1|) (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| (-116 |#1|) (QUOTE (-233))) (|HasCategory| (-116 |#1|) (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| (-116 |#1|) (LIST (QUOTE -517) (QUOTE (-1176)) (LIST (QUOTE -116) (|devaluate| |#1|)))) (|HasCategory| (-116 |#1|) (LIST (QUOTE -310) (LIST (QUOTE -116) (|devaluate| |#1|)))) (|HasCategory| (-116 |#1|) (LIST (QUOTE -287) (LIST (QUOTE -116) (|devaluate| |#1|)) (LIST (QUOTE -116) (|devaluate| |#1|)))) (|HasCategory| (-116 |#1|) (QUOTE (-308))) (|HasCategory| (-116 |#1|) (QUOTE (-548))) (|HasCategory| (-116 |#1|) (QUOTE (-851))) (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| (-116 |#1|) (QUOTE (-910)))) (-2909 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| (-116 |#1|) (QUOTE (-910)))) (|HasCategory| (-116 |#1|) (QUOTE (-145))))) +((|HasCategory| (-116 |#1|) (QUOTE (-910))) (|HasCategory| (-116 |#1|) (LIST (QUOTE -1039) (QUOTE (-1176)))) (|HasCategory| (-116 |#1|) (QUOTE (-145))) (|HasCategory| (-116 |#1|) (QUOTE (-147))) (|HasCategory| (-116 |#1|) (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| (-116 |#1|) (QUOTE (-1023))) (|HasCategory| (-116 |#1|) (QUOTE (-821))) (-2871 (|HasCategory| (-116 |#1|) (QUOTE (-821))) (|HasCategory| (-116 |#1|) (QUOTE (-851)))) (|HasCategory| (-116 |#1|) (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| (-116 |#1|) (QUOTE (-1151))) (|HasCategory| (-116 |#1|) (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| (-116 |#1|) (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| (-116 |#1|) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| (-116 |#1|) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| (-116 |#1|) (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| (-116 |#1|) (QUOTE (-233))) (|HasCategory| (-116 |#1|) (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| (-116 |#1|) (LIST (QUOTE -517) (QUOTE (-1176)) (LIST (QUOTE -116) (|devaluate| |#1|)))) (|HasCategory| (-116 |#1|) (LIST (QUOTE -310) (LIST (QUOTE -116) (|devaluate| |#1|)))) (|HasCategory| (-116 |#1|) (LIST (QUOTE -287) (LIST (QUOTE -116) (|devaluate| |#1|)) (LIST (QUOTE -116) (|devaluate| |#1|)))) (|HasCategory| (-116 |#1|) (QUOTE (-308))) (|HasCategory| (-116 |#1|) (QUOTE (-548))) (|HasCategory| (-116 |#1|) (QUOTE (-851))) (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| (-116 |#1|) (QUOTE (-910)))) (-2871 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| (-116 |#1|) (QUOTE (-910)))) (|HasCategory| (-116 |#1|) (QUOTE (-145))))) (-118 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 @@ -415,7 +415,7 @@ NIL (-121 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"))) ((-4416 . T) (-4417 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1100))) (-2909 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) +((-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1100))) (-2871 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (-122 S) ((|constructor| (NIL "The bit aggregate category models aggregates representing large quantities of Boolean data.")) (|xor| (($ $ $) "\\spad{xor(a,b)} returns the logical {\\em exclusive-or} of bit aggregates \\axiom{a} and \\axiom{\\spad{b}}.")) (|or| (($ $ $) "\\spad{a or b} returns the logical {\\em or} of bit aggregates \\axiom{a} and \\axiom{\\spad{b}}.")) (|and| (($ $ $) "\\spad{a and b} returns the logical {\\em and} of bit aggregates \\axiom{a} and \\axiom{\\spad{b}}.")) (|nor| (($ $ $) "\\spad{nor(a,b)} returns the logical {\\em nor} of bit aggregates \\axiom{a} and \\axiom{\\spad{b}}.")) (|nand| (($ $ $) "\\spad{nand(a,b)} returns the logical {\\em nand} of bit aggregates \\axiom{a} and \\axiom{\\spad{b}}.")) (|not| (($ $) "\\spad{not(b)} returns the logical {\\em not} of bit aggregate \\axiom{\\spad{b}}."))) NIL @@ -435,15 +435,15 @@ NIL (-126 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."))) ((-4416 . T) (-4417 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1100))) (-2909 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) +((-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1100))) (-2871 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (-127 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."))) ((-4416 . T) (-4417 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1100))) (-2909 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) +((-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1100))) (-2871 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (-128) ((|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."))) ((-4417 . T) (-4416 . T)) -((-2909 (-12 (|HasCategory| (-129) (QUOTE (-851))) (|HasCategory| (-129) (LIST (QUOTE -310) (QUOTE (-129))))) (-12 (|HasCategory| (-129) (QUOTE (-1100))) (|HasCategory| (-129) (LIST (QUOTE -310) (QUOTE (-129)))))) (-2909 (-12 (|HasCategory| (-129) (QUOTE (-1100))) (|HasCategory| (-129) (LIST (QUOTE -310) (QUOTE (-129))))) (|HasCategory| (-129) (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| (-129) (LIST (QUOTE -615) (QUOTE (-539)))) (-2909 (|HasCategory| (-129) (QUOTE (-851))) (|HasCategory| (-129) (QUOTE (-1100)))) (|HasCategory| (-129) (QUOTE (-851))) (|HasCategory| (-567) (QUOTE (-851))) (|HasCategory| (-129) (QUOTE (-1100))) (|HasCategory| (-129) (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| (-129) (QUOTE (-1100))) (|HasCategory| (-129) (LIST (QUOTE -310) (QUOTE (-129)))))) +((-2871 (-12 (|HasCategory| (-129) (QUOTE (-851))) (|HasCategory| (-129) (LIST (QUOTE -310) (QUOTE (-129))))) (-12 (|HasCategory| (-129) (QUOTE (-1100))) (|HasCategory| (-129) (LIST (QUOTE -310) (QUOTE (-129)))))) (-2871 (-12 (|HasCategory| (-129) (QUOTE (-1100))) (|HasCategory| (-129) (LIST (QUOTE -310) (QUOTE (-129))))) (|HasCategory| (-129) (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| (-129) (LIST (QUOTE -615) (QUOTE (-539)))) (-2871 (|HasCategory| (-129) (QUOTE (-851))) (|HasCategory| (-129) (QUOTE (-1100)))) (|HasCategory| (-129) (QUOTE (-851))) (|HasCategory| (-567) (QUOTE (-851))) (|HasCategory| (-129) (QUOTE (-1100))) (|HasCategory| (-129) (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| (-129) (QUOTE (-1100))) (|HasCategory| (-129) (LIST (QUOTE -310) (QUOTE (-129)))))) (-129) ((|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 @@ -468,11 +468,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."))) (((-4418 "*") . T)) NIL -(-135 |minix| -2189 S T$) +(-135 |minix| -2675 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 -(-136 |minix| -2189 R) +(-136 |minix| -2675 R) ((|constructor| (NIL "CartesianTensor(minix,{}dim,{}\\spad{R}) provides Cartesian tensors with components belonging to a commutative ring \\spad{R}. These tensors can have any number of indices. Each index takes values from \\spad{minix} to \\spad{minix + dim - 1}.")) (|sample| (($) "\\spad{sample()} returns an object of type \\%.")) (|unravel| (($ (|List| |#3|)) "\\spad{unravel(t)} produces a tensor from a list of components such that \\indented{2}{\\spad{unravel(ravel(t)) = t}.}")) (|ravel| (((|List| |#3|) $) "\\spad{ravel(t)} produces a list of components from a tensor such that \\indented{2}{\\spad{unravel(ravel(t)) = t}.}")) (|leviCivitaSymbol| (($) "\\spad{leviCivitaSymbol()} is the rank \\spad{dim} tensor defined by \\spad{leviCivitaSymbol()(i1,...idim) = +1/0/-1} if \\spad{i1,...,idim} is an even/is nota /is an odd permutation of \\spad{minix,...,minix+dim-1}.")) (|kroneckerDelta| (($) "\\spad{kroneckerDelta()} is the rank 2 tensor defined by \\indented{3}{\\spad{kroneckerDelta()(i,j)}} \\indented{6}{\\spad{= 1\\space{2}if i = j}} \\indented{6}{\\spad{= 0 if\\space{2}i \\~= j}}")) (|reindex| (($ $ (|List| (|Integer|))) "\\spad{reindex(t,[i1,...,idim])} permutes the indices of \\spad{t}. For example,{} if \\spad{r = reindex(t, [4,1,2,3])} for a rank 4 tensor \\spad{t},{} then \\spad{r} is the rank for tensor given by \\indented{4}{\\spad{r(i,j,k,l) = t(l,i,j,k)}.}")) (|transpose| (($ $ (|Integer|) (|Integer|)) "\\spad{transpose(t,i,j)} exchanges the \\spad{i}\\spad{-}th and \\spad{j}\\spad{-}th indices of \\spad{t}. For example,{} if \\spad{r = transpose(t,2,3)} for a rank 4 tensor \\spad{t},{} then \\spad{r} is the rank 4 tensor given by \\indented{4}{\\spad{r(i,j,k,l) = t(i,k,j,l)}.}") (($ $) "\\spad{transpose(t)} exchanges the first and last indices of \\spad{t}. For example,{} if \\spad{r = transpose(t)} for a rank 4 tensor \\spad{t},{} then \\spad{r} is the rank 4 tensor given by \\indented{4}{\\spad{r(i,j,k,l) = t(l,j,k,i)}.}")) (|contract| (($ $ (|Integer|) (|Integer|)) "\\spad{contract(t,i,j)} is the contraction of tensor \\spad{t} which sums along the \\spad{i}\\spad{-}th and \\spad{j}\\spad{-}th indices. For example,{} if \\spad{r = contract(t,1,3)} for a rank 4 tensor \\spad{t},{} then \\spad{r} is the rank 2 \\spad{(= 4 - 2)} tensor given by \\indented{4}{\\spad{r(i,j) = sum(h=1..dim,t(h,i,h,j))}.}") (($ $ (|Integer|) $ (|Integer|)) "\\spad{contract(t,i,s,j)} is the inner product of tenors \\spad{s} and \\spad{t} which sums along the \\spad{k1}\\spad{-}th index of \\spad{t} and the \\spad{k2}\\spad{-}th index of \\spad{s}. For example,{} if \\spad{r = contract(s,2,t,1)} for rank 3 tensors rank 3 tensors \\spad{s} and \\spad{t},{} then \\spad{r} is the rank 4 \\spad{(= 3 + 3 - 2)} tensor given by \\indented{4}{\\spad{r(i,j,k,l) = sum(h=1..dim,s(i,h,j)*t(h,k,l))}.}")) (* (($ $ $) "\\spad{s*t} is the inner product of the tensors \\spad{s} and \\spad{t} which contracts the last index of \\spad{s} with the first index of \\spad{t},{} \\spadignore{i.e.} \\indented{4}{\\spad{t*s = contract(t,rank t, s, 1)}} \\indented{4}{\\spad{t*s = sum(k=1..N, t[i1,..,iN,k]*s[k,j1,..,jM])}} This is compatible with the use of \\spad{M*v} to denote the matrix-vector inner product.")) (|product| (($ $ $) "\\spad{product(s,t)} is the outer product of the tensors \\spad{s} and \\spad{t}. For example,{} if \\spad{r = product(s,t)} for rank 2 tensors \\spad{s} and \\spad{t},{} then \\spad{r} is a rank 4 tensor given by \\indented{4}{\\spad{r(i,j,k,l) = s(i,j)*t(k,l)}.}")) (|elt| ((|#3| $ (|List| (|Integer|))) "\\spad{elt(t,[i1,...,iN])} gives a component of a rank \\spad{N} tensor.") ((|#3| $ (|Integer|) (|Integer|) (|Integer|) (|Integer|)) "\\spad{elt(t,i,j,k,l)} gives a component of a rank 4 tensor.") ((|#3| $ (|Integer|) (|Integer|) (|Integer|)) "\\spad{elt(t,i,j,k)} gives a component of a rank 3 tensor.") ((|#3| $ (|Integer|) (|Integer|)) "\\spad{elt(t,i,j)} gives a component of a rank 2 tensor.") ((|#3| $ (|Integer|)) "\\spad{elt(t,i)} gives a component of a rank 1 tensor.") ((|#3| $) "\\spad{elt(t)} gives the component of a rank 0 tensor.")) (|rank| (((|NonNegativeInteger|) $) "\\spad{rank(t)} returns the tensorial rank of \\spad{t} (that is,{} the number of indices). This is the same as the graded module degree.")) (|coerce| (($ (|List| $)) "\\spad{coerce([t_1,...,t_dim])} allows tensors to be constructed using lists.") (($ (|List| |#3|)) "\\spad{coerce([r_1,...,r_dim])} allows tensors to be constructed using lists.") (($ (|SquareMatrix| |#2| |#3|)) "\\spad{coerce(m)} views a matrix as a rank 2 tensor.") (($ (|DirectProduct| |#2| |#3|)) "\\spad{coerce(v)} views a vector as a rank 1 tensor."))) NIL NIL @@ -495,7 +495,7 @@ NIL (-141) ((|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}."))) ((-4416 . T) (-4406 . T) (-4417 . T)) -((-2909 (-12 (|HasCategory| (-144) (QUOTE (-370))) (|HasCategory| (-144) (LIST (QUOTE -310) (QUOTE (-144))))) (-12 (|HasCategory| (-144) (QUOTE (-1100))) (|HasCategory| (-144) (LIST (QUOTE -310) (QUOTE (-144)))))) (|HasCategory| (-144) (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| (-144) (QUOTE (-370))) (|HasCategory| (-144) (QUOTE (-851))) (|HasCategory| (-144) (QUOTE (-1100))) (|HasCategory| (-144) (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| (-144) (QUOTE (-1100))) (|HasCategory| (-144) (LIST (QUOTE -310) (QUOTE (-144)))))) +((-2871 (-12 (|HasCategory| (-144) (QUOTE (-370))) (|HasCategory| (-144) (LIST (QUOTE -310) (QUOTE (-144))))) (-12 (|HasCategory| (-144) (QUOTE (-1100))) (|HasCategory| (-144) (LIST (QUOTE -310) (QUOTE (-144)))))) (|HasCategory| (-144) (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| (-144) (QUOTE (-370))) (|HasCategory| (-144) (QUOTE (-851))) (|HasCategory| (-144) (QUOTE (-1100))) (|HasCategory| (-144) (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| (-144) (QUOTE (-1100))) (|HasCategory| (-144) (LIST (QUOTE -310) (QUOTE (-144)))))) (-142 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 @@ -520,7 +520,7 @@ NIL ((|constructor| (NIL "Rings of Characteristic Zero."))) ((-4413 . T)) NIL -(-148 -2111 UP UPUP) +(-148 -3944 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 @@ -560,7 +560,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 -(-158 R -2111) +(-158 R -3944) ((|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 @@ -594,7 +594,7 @@ NIL ((|HasCategory| |#2| (QUOTE (-910))) (|HasCategory| |#2| (QUOTE (-548))) (|HasCategory| |#2| (QUOTE (-1003))) (|HasCategory| |#2| (QUOTE (-1201))) (|HasCategory| |#2| (QUOTE (-1060))) (|HasCategory| |#2| (QUOTE (-1023))) (|HasCategory| |#2| (QUOTE (-145))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#2| (QUOTE (-365))) (|HasAttribute| |#2| (QUOTE -4412)) (|HasAttribute| |#2| (QUOTE -4415)) (|HasCategory| |#2| (QUOTE (-308))) (|HasCategory| |#2| (QUOTE (-559)))) (-166 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})"))) -((-4409 -2909 (|has| |#1| (-559)) (-12 (|has| |#1| (-308)) (|has| |#1| (-910)))) (-4414 |has| |#1| (-365)) (-4408 |has| |#1| (-365)) (-4412 |has| |#1| (-6 -4412)) (-4415 |has| |#1| (-6 -4415)) (-2938 . T) ((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) +((-4409 -2871 (|has| |#1| (-559)) (-12 (|has| |#1| (-308)) (|has| |#1| (-910)))) (-4414 |has| |#1| (-365)) (-4408 |has| |#1| (-365)) (-4412 |has| |#1| (-6 -4412)) (-4415 |has| |#1| (-6 -4415)) (-3116 . T) ((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) NIL (-167 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."))) @@ -606,8 +606,8 @@ NIL NIL (-169 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}."))) -((-4409 -2909 (|has| |#1| (-559)) (-12 (|has| |#1| (-308)) (|has| |#1| (-910)))) (-4414 |has| |#1| (-365)) (-4408 |has| |#1| (-365)) (-4412 |has| |#1| (-6 -4412)) (-4415 |has| |#1| (-6 -4415)) (-2938 . T) ((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) -((|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-351))) (-2909 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-351)))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-370))) (-2909 (-12 (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| |#1| (QUOTE (-351)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-351)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -517) (QUOTE (-1176)) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-351)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-351)))) (-12 (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-351)))) (-12 (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-351)))) (|HasCategory| |#1| (QUOTE (-233))) (-12 (|HasCategory| |#1| (QUOTE (-308))) (|HasCategory| |#1| (QUOTE (-351)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-351)))) (-12 (|HasCategory| |#1| (QUOTE (-351))) (|HasCategory| |#1| (LIST (QUOTE -287) (|devaluate| |#1|) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-351))) (|HasCategory| |#1| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#1| (QUOTE (-351))) (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176))))) (-12 (|HasCategory| |#1| (QUOTE (-351))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| |#1| (QUOTE (-351))) (|HasCategory| |#1| (QUOTE (-559)))) (-12 (|HasCategory| |#1| (QUOTE (-351))) (|HasCategory| |#1| (QUOTE (-829)))) (-12 (|HasCategory| |#1| (QUOTE (-351))) (|HasCategory| |#1| (QUOTE (-1023)))) (-12 (|HasCategory| |#1| (QUOTE (-351))) (|HasCategory| |#1| (QUOTE (-1201)))) (-12 (|HasCategory| |#1| (QUOTE (-351))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539))))) (-12 (|HasCategory| |#1| (QUOTE (-351))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-351))) (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-381))))) (-12 (|HasCategory| |#1| (QUOTE (-351))) (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-567))))) (-12 (|HasCategory| |#1| (QUOTE (-351))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))))) (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#1| (LIST (QUOTE -640) (QUOTE (-567)))) (-2909 (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))) (-2909 (-12 (|HasCategory| |#1| (QUOTE (-308))) (|HasCategory| |#1| (QUOTE (-910)))) (|HasCategory| |#1| (QUOTE (-365))) (-12 (|HasCategory| |#1| (QUOTE (-351))) (|HasCategory| |#1| (QUOTE (-910))))) (-2909 (-12 (|HasCategory| |#1| (QUOTE (-308))) (|HasCategory| |#1| (QUOTE (-910)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-910)))) (-12 (|HasCategory| |#1| (QUOTE (-351))) (|HasCategory| |#1| (QUOTE (-910))))) (-2909 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-559)))) (-12 (|HasCategory| |#1| (QUOTE (-1003))) (|HasCategory| |#1| (QUOTE (-1201)))) (|HasCategory| |#1| (QUOTE (-1201))) (|HasCategory| |#1| (QUOTE (-1023))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539)))) (-2909 (|HasCategory| |#1| (QUOTE (-308))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-351))) (|HasCategory| |#1| (QUOTE (-559)))) (-2909 (|HasCategory| |#1| (QUOTE (-308))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-351)))) (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| |#1| (LIST (QUOTE -517) (QUOTE (-1176)) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -287) (|devaluate| |#1|) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-829))) (|HasCategory| |#1| (QUOTE (-1060))) (-12 (|HasCategory| |#1| (QUOTE (-1060))) (|HasCategory| |#1| (QUOTE (-1201)))) (|HasCategory| |#1| (QUOTE (-548))) (|HasCategory| |#1| (QUOTE (-308))) (|HasCategory| |#1| (QUOTE (-910))) (-2909 (-12 (|HasCategory| |#1| (QUOTE (-308))) (|HasCategory| |#1| (QUOTE (-910)))) (|HasCategory| |#1| (QUOTE (-365)))) (-2909 (-12 (|HasCategory| |#1| (QUOTE (-308))) (|HasCategory| |#1| (QUOTE (-910)))) (|HasCategory| |#1| (QUOTE (-559)))) (|HasCategory| |#1| (QUOTE (-233))) (-12 (|HasCategory| |#1| (QUOTE (-308))) (|HasCategory| |#1| (QUOTE (-910)))) (|HasAttribute| |#1| (QUOTE -4412)) (|HasAttribute| |#1| (QUOTE -4415)) (-12 (|HasCategory| |#1| (QUOTE (-233))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176))))) (-2909 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-308))) (|HasCategory| |#1| (QUOTE (-910)))) (|HasCategory| |#1| (QUOTE (-145)))) (-2909 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-308))) (|HasCategory| |#1| (QUOTE (-910)))) (|HasCategory| |#1| (QUOTE (-351))))) +((-4409 -2871 (|has| |#1| (-559)) (-12 (|has| |#1| (-308)) (|has| |#1| (-910)))) (-4414 |has| |#1| (-365)) (-4408 |has| |#1| (-365)) (-4412 |has| |#1| (-6 -4412)) (-4415 |has| |#1| (-6 -4415)) (-3116 . T) ((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) +((|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-351))) (-2871 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-351)))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-370))) (-2871 (-12 (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| |#1| (QUOTE (-351)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-351)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -517) (QUOTE (-1176)) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-351)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-351)))) (-12 (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-351)))) (-12 (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-351)))) (|HasCategory| |#1| (QUOTE (-233))) (-12 (|HasCategory| |#1| (QUOTE (-308))) (|HasCategory| |#1| (QUOTE (-351)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-351)))) (-12 (|HasCategory| |#1| (QUOTE (-351))) (|HasCategory| |#1| (LIST (QUOTE -287) (|devaluate| |#1|) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-351))) (|HasCategory| |#1| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#1| (QUOTE (-351))) (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176))))) (-12 (|HasCategory| |#1| (QUOTE (-351))) (|HasCategory| |#1| (QUOTE (-370)))) (-12 (|HasCategory| |#1| (QUOTE (-351))) (|HasCategory| |#1| (QUOTE (-559)))) (-12 (|HasCategory| |#1| (QUOTE (-351))) (|HasCategory| |#1| (QUOTE (-829)))) (-12 (|HasCategory| |#1| (QUOTE (-351))) (|HasCategory| |#1| (QUOTE (-1023)))) (-12 (|HasCategory| |#1| (QUOTE (-351))) (|HasCategory| |#1| (QUOTE (-1201)))) (-12 (|HasCategory| |#1| (QUOTE (-351))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539))))) (-12 (|HasCategory| |#1| (QUOTE (-351))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-351))) (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-381))))) (-12 (|HasCategory| |#1| (QUOTE (-351))) (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-567))))) (-12 (|HasCategory| |#1| (QUOTE (-351))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))))) (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#1| (LIST (QUOTE -640) (QUOTE (-567)))) (-2871 (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))) (-2871 (-12 (|HasCategory| |#1| (QUOTE (-308))) (|HasCategory| |#1| (QUOTE (-910)))) (|HasCategory| |#1| (QUOTE (-365))) (-12 (|HasCategory| |#1| (QUOTE (-351))) (|HasCategory| |#1| (QUOTE (-910))))) (-2871 (-12 (|HasCategory| |#1| (QUOTE (-308))) (|HasCategory| |#1| (QUOTE (-910)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-910)))) (-12 (|HasCategory| |#1| (QUOTE (-351))) (|HasCategory| |#1| (QUOTE (-910))))) (-2871 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-559)))) (-12 (|HasCategory| |#1| (QUOTE (-1003))) (|HasCategory| |#1| (QUOTE (-1201)))) (|HasCategory| |#1| (QUOTE (-1201))) (|HasCategory| |#1| (QUOTE (-1023))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539)))) (-2871 (|HasCategory| |#1| (QUOTE (-308))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-351))) (|HasCategory| |#1| (QUOTE (-559)))) (-2871 (|HasCategory| |#1| (QUOTE (-308))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-351)))) (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| |#1| (LIST (QUOTE -517) (QUOTE (-1176)) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -287) (|devaluate| |#1|) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-829))) (|HasCategory| |#1| (QUOTE (-1060))) (-12 (|HasCategory| |#1| (QUOTE (-1060))) (|HasCategory| |#1| (QUOTE (-1201)))) (|HasCategory| |#1| (QUOTE (-548))) (|HasCategory| |#1| (QUOTE (-308))) (|HasCategory| |#1| (QUOTE (-910))) (-2871 (-12 (|HasCategory| |#1| (QUOTE (-308))) (|HasCategory| |#1| (QUOTE (-910)))) (|HasCategory| |#1| (QUOTE (-365)))) (-2871 (-12 (|HasCategory| |#1| (QUOTE (-308))) (|HasCategory| |#1| (QUOTE (-910)))) (|HasCategory| |#1| (QUOTE (-559)))) (|HasCategory| |#1| (QUOTE (-233))) (-12 (|HasCategory| |#1| (QUOTE (-308))) (|HasCategory| |#1| (QUOTE (-910)))) (|HasAttribute| |#1| (QUOTE -4412)) (|HasAttribute| |#1| (QUOTE -4415)) (-12 (|HasCategory| |#1| (QUOTE (-233))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176))))) (-2871 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-308))) (|HasCategory| |#1| (QUOTE (-910)))) (|HasCategory| |#1| (QUOTE (-145)))) (-2871 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-308))) (|HasCategory| |#1| (QUOTE (-910)))) (|HasCategory| |#1| (QUOTE (-351))))) (-170 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 @@ -680,7 +680,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 -(-188 R -2111) +(-188 R -3944) ((|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 @@ -788,23 +788,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 -(-215 -2111 UP UPUP R) +(-215 -3944 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 -(-216 -2111 FP) +(-216 -3944 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 (-217) ((|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."))) ((-4408 . T) (-4414 . T) (-4409 . T) ((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) -((|HasCategory| (-567) (QUOTE (-910))) (|HasCategory| (-567) (LIST (QUOTE -1039) (QUOTE (-1176)))) (|HasCategory| (-567) (QUOTE (-145))) (|HasCategory| (-567) (QUOTE (-147))) (|HasCategory| (-567) (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| (-567) (QUOTE (-1023))) (|HasCategory| (-567) (QUOTE (-821))) (-2909 (|HasCategory| (-567) (QUOTE (-821))) (|HasCategory| (-567) (QUOTE (-851)))) (|HasCategory| (-567) (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| (-567) (QUOTE (-1151))) (|HasCategory| (-567) (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| (-567) (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| (-567) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| (-567) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| (-567) (QUOTE (-233))) (|HasCategory| (-567) (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| (-567) (LIST (QUOTE -517) (QUOTE (-1176)) (QUOTE (-567)))) (|HasCategory| (-567) (LIST (QUOTE -310) (QUOTE (-567)))) (|HasCategory| (-567) (LIST (QUOTE -287) (QUOTE (-567)) (QUOTE (-567)))) (|HasCategory| (-567) (QUOTE (-308))) (|HasCategory| (-567) (QUOTE (-548))) (|HasCategory| (-567) (QUOTE (-851))) (|HasCategory| (-567) (LIST (QUOTE -640) (QUOTE (-567)))) (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| (-567) (QUOTE (-910)))) (-2909 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| (-567) (QUOTE (-910)))) (|HasCategory| (-567) (QUOTE (-145))))) +((|HasCategory| (-567) (QUOTE (-910))) (|HasCategory| (-567) (LIST (QUOTE -1039) (QUOTE (-1176)))) (|HasCategory| (-567) (QUOTE (-145))) (|HasCategory| (-567) (QUOTE (-147))) (|HasCategory| (-567) (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| (-567) (QUOTE (-1023))) (|HasCategory| (-567) (QUOTE (-821))) (-2871 (|HasCategory| (-567) (QUOTE (-821))) (|HasCategory| (-567) (QUOTE (-851)))) (|HasCategory| (-567) (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| (-567) (QUOTE (-1151))) (|HasCategory| (-567) (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| (-567) (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| (-567) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| (-567) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| (-567) (QUOTE (-233))) (|HasCategory| (-567) (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| (-567) (LIST (QUOTE -517) (QUOTE (-1176)) (QUOTE (-567)))) (|HasCategory| (-567) (LIST (QUOTE -310) (QUOTE (-567)))) (|HasCategory| (-567) (LIST (QUOTE -287) (QUOTE (-567)) (QUOTE (-567)))) (|HasCategory| (-567) (QUOTE (-308))) (|HasCategory| (-567) (QUOTE (-548))) (|HasCategory| (-567) (QUOTE (-851))) (|HasCategory| (-567) (LIST (QUOTE -640) (QUOTE (-567)))) (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| (-567) (QUOTE (-910)))) (-2871 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| (-567) (QUOTE (-910)))) (|HasCategory| (-567) (QUOTE (-145))))) (-218) ((|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 -(-219 R -2111) +(-219 R -3944) ((|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 @@ -819,18 +819,18 @@ NIL (-222 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}."))) ((-4416 . T) (-4417 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1100))) (-2909 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) +((-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1100))) (-2871 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (-223 |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}."))) ((-4413 . T)) NIL -(-224 R -2111) +(-224 R -3944) ((|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 (-225) ((|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}."))) -((-2927 . T) (-4408 . T) (-4414 . T) (-4409 . T) ((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) +((-3112 . T) (-4408 . T) (-4414 . T) (-4409 . T) ((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) NIL (-226) ((|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)}.}"))) @@ -839,7 +839,7 @@ NIL (-227 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}"))) ((-4416 . T) (-4417 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1100))) (-2909 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (QUOTE (-308))) (|HasCategory| |#1| (QUOTE (-559))) (|HasAttribute| |#1| (QUOTE (-4418 "*"))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) +((-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1100))) (-2871 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (QUOTE (-308))) (|HasCategory| |#1| (QUOTE (-559))) (|HasAttribute| |#1| (QUOTE (-4418 "*"))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (-228 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 @@ -876,22 +876,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 -(-237 S -2189 R) +(-237 S -2675 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 (-365))) (|HasCategory| |#3| (QUOTE (-794))) (|HasCategory| |#3| (QUOTE (-849))) (|HasAttribute| |#3| (QUOTE -4413)) (|HasCategory| |#3| (QUOTE (-172))) (|HasCategory| |#3| (QUOTE (-370))) (|HasCategory| |#3| (QUOTE (-727))) (|HasCategory| |#3| (QUOTE (-131))) (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (QUOTE (-1050))) (|HasCategory| |#3| (QUOTE (-1100)))) -(-238 -2189 R) +(-238 -2675 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"))) ((-4410 |has| |#2| (-1050)) (-4411 |has| |#2| (-1050)) (-4413 |has| |#2| (-6 -4413)) ((-4418 "*") |has| |#2| (-172)) (-4416 . T)) NIL -(-239 -2189 A B) +(-239 -2675 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 -(-240 -2189 R) +(-240 -2675 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."))) ((-4410 |has| |#2| (-1050)) (-4411 |has| |#2| (-1050)) (-4413 |has| |#2| (-6 -4413)) ((-4418 "*") |has| |#2| (-172)) (-4416 . T)) -((-2909 (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-131))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-727))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-794))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-849))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1050))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))))) (-2909 (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-1100)))) (-12 (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (QUOTE (-1050)))) (-12 (|HasCategory| |#2| (QUOTE (-1050))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-1050))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176))))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#2| (QUOTE (-365))) (-2909 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-1050)))) (-2909 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-365)))) (|HasCategory| |#2| (QUOTE (-1050))) (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-794))) (-2909 (|HasCategory| |#2| (QUOTE (-794))) (|HasCategory| |#2| (QUOTE (-849)))) (|HasCategory| |#2| (QUOTE (-849))) (|HasCategory| |#2| (QUOTE (-727))) (-2909 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-1050)))) (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (-2909 (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-131))) (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-1050)))) (-2909 (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (QUOTE (-131))) (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-1050)))) (-2909 (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-1050)))) (-2909 (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (QUOTE (-1050)))) (|HasCategory| |#2| (QUOTE (-233))) (-2909 (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-131))) (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-727))) (|HasCategory| |#2| (QUOTE (-794))) (|HasCategory| |#2| (QUOTE (-849))) (|HasCategory| |#2| (QUOTE (-1050))) (|HasCategory| |#2| (QUOTE (-1100)))) (|HasCategory| |#2| (QUOTE (-1100))) (-2909 (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-25)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-131)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-172)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-233)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-365)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-370)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-727)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-794)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-849)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-1050)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-1100))))) (-2909 (-12 (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-131))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-727))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-794))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-849))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-1050))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567)))))) (-2909 (-12 (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-131))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-727))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-794))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-849))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-1050))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567)))))) (|HasCategory| (-567) (QUOTE (-851))) (-12 (|HasCategory| |#2| (QUOTE (-1050))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (QUOTE (-1050)))) (-12 (|HasCategory| |#2| (QUOTE (-1050))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176))))) (-2909 (|HasCategory| |#2| (QUOTE (-1050))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567)))))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-1100)))) (|HasAttribute| |#2| (QUOTE -4413)) (|HasCategory| |#2| (QUOTE (-131))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|))))) +((-2871 (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-131))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-727))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-794))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-849))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1050))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))))) (-2871 (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-1100)))) (-12 (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (QUOTE (-1050)))) (-12 (|HasCategory| |#2| (QUOTE (-1050))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-1050))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176))))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#2| (QUOTE (-365))) (-2871 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-1050)))) (-2871 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-365)))) (|HasCategory| |#2| (QUOTE (-1050))) (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-794))) (-2871 (|HasCategory| |#2| (QUOTE (-794))) (|HasCategory| |#2| (QUOTE (-849)))) (|HasCategory| |#2| (QUOTE (-849))) (|HasCategory| |#2| (QUOTE (-727))) (-2871 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-1050)))) (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (-2871 (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-131))) (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-1050)))) (-2871 (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (QUOTE (-131))) (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-1050)))) (-2871 (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-1050)))) (-2871 (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (QUOTE (-1050)))) (|HasCategory| |#2| (QUOTE (-233))) (-2871 (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-131))) (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-727))) (|HasCategory| |#2| (QUOTE (-794))) (|HasCategory| |#2| (QUOTE (-849))) (|HasCategory| |#2| (QUOTE (-1050))) (|HasCategory| |#2| (QUOTE (-1100)))) (|HasCategory| |#2| (QUOTE (-1100))) (-2871 (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-25)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-131)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-172)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-233)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-365)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-370)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-727)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-794)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-849)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-1050)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-1100))))) (-2871 (-12 (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-131))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-727))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-794))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-849))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-1050))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567)))))) (-2871 (-12 (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-131))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-727))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-794))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-849))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-1050))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567)))))) (|HasCategory| (-567) (QUOTE (-851))) (-12 (|HasCategory| |#2| (QUOTE (-1050))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (QUOTE (-1050)))) (-12 (|HasCategory| |#2| (QUOTE (-1050))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176))))) (-2871 (|HasCategory| |#2| (QUOTE (-1050))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567)))))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-1100)))) (|HasAttribute| |#2| (QUOTE -4413)) (|HasCategory| |#2| (QUOTE (-131))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|))))) (-241) ((|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 @@ -911,7 +911,7 @@ NIL (-245 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}"))) ((-4417 . T) (-4416 . T)) -((-2909 (-12 (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) (-2909 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539)))) (-2909 (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-1100)))) (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| (-567) (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) +((-2871 (-12 (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) (-2871 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539)))) (-2871 (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-1100)))) (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| (-567) (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) (-246 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 @@ -919,7 +919,7 @@ NIL (-247 |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"))) (((-4418 "*") |has| |#2| (-172)) (-4409 |has| |#2| (-559)) (-4414 |has| |#2| (-6 -4414)) (-4411 . T) (-4410 . T) (-4413 . T)) -((|HasCategory| |#2| (QUOTE (-910))) (-2909 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-455))) (|HasCategory| |#2| (QUOTE (-559))) (|HasCategory| |#2| (QUOTE (-910)))) (-2909 (|HasCategory| |#2| (QUOTE (-455))) (|HasCategory| |#2| (QUOTE (-559))) (|HasCategory| |#2| (QUOTE (-910)))) (-2909 (|HasCategory| |#2| (QUOTE (-455))) (|HasCategory| |#2| (QUOTE (-910)))) (|HasCategory| |#2| (QUOTE (-559))) (|HasCategory| |#2| (QUOTE (-172))) (-2909 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-559)))) (-12 (|HasCategory| (-865 |#1|) (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| |#2| (LIST (QUOTE -887) (QUOTE (-381))))) (-12 (|HasCategory| (-865 |#1|) (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -887) (QUOTE (-567))))) (-12 (|HasCategory| (-865 |#1|) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| |#2| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381)))))) (-12 (|HasCategory| (-865 |#1|) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567)))))) (-12 (|HasCategory| (-865 |#1|) (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#2| (LIST (QUOTE -615) (QUOTE (-539))))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-145))) (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567)))) (-2909 (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567)))))) (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-365))) (|HasAttribute| |#2| (QUOTE -4414)) (|HasCategory| |#2| (QUOTE (-455))) (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#2| (QUOTE (-910)))) (-2909 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#2| (QUOTE (-910)))) (|HasCategory| |#2| (QUOTE (-145))))) +((|HasCategory| |#2| (QUOTE (-910))) (-2871 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-455))) (|HasCategory| |#2| (QUOTE (-559))) (|HasCategory| |#2| (QUOTE (-910)))) (-2871 (|HasCategory| |#2| (QUOTE (-455))) (|HasCategory| |#2| (QUOTE (-559))) (|HasCategory| |#2| (QUOTE (-910)))) (-2871 (|HasCategory| |#2| (QUOTE (-455))) (|HasCategory| |#2| (QUOTE (-910)))) (|HasCategory| |#2| (QUOTE (-559))) (|HasCategory| |#2| (QUOTE (-172))) (-2871 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-559)))) (-12 (|HasCategory| (-865 |#1|) (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| |#2| (LIST (QUOTE -887) (QUOTE (-381))))) (-12 (|HasCategory| (-865 |#1|) (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -887) (QUOTE (-567))))) (-12 (|HasCategory| (-865 |#1|) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| |#2| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381)))))) (-12 (|HasCategory| (-865 |#1|) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567)))))) (-12 (|HasCategory| (-865 |#1|) (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#2| (LIST (QUOTE -615) (QUOTE (-539))))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-145))) (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567)))) (-2871 (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567)))))) (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-365))) (|HasAttribute| |#2| (QUOTE -4414)) (|HasCategory| |#2| (QUOTE (-455))) (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#2| (QUOTE (-910)))) (-2871 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#2| (QUOTE (-910)))) (|HasCategory| |#2| (QUOTE (-145))))) (-248) ((|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 @@ -934,12 +934,12 @@ NIL NIL (-251 |n| R M S) ((|constructor| (NIL "This constructor provides a direct product type with a left matrix-module view."))) -((-4413 -2909 (-1410 (|has| |#4| (-1050)) (|has| |#4| (-233))) (-1410 (|has| |#4| (-1050)) (|has| |#4| (-901 (-1176)))) (|has| |#4| (-6 -4413)) (-1410 (|has| |#4| (-1050)) (|has| |#4| (-640 (-567))))) (-4410 |has| |#4| (-1050)) (-4411 |has| |#4| (-1050)) ((-4418 "*") |has| |#4| (-172)) (-4416 . T)) -((-2909 (-12 (|HasCategory| |#4| (QUOTE (-172))) (|HasCategory| |#4| (LIST (QUOTE -310) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-233))) (|HasCategory| |#4| (LIST (QUOTE -310) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-365))) (|HasCategory| |#4| (LIST (QUOTE -310) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-370))) (|HasCategory| |#4| (LIST (QUOTE -310) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-727))) (|HasCategory| |#4| (LIST (QUOTE -310) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-794))) (|HasCategory| |#4| (LIST (QUOTE -310) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-849))) (|HasCategory| |#4| (LIST (QUOTE -310) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-1050))) (|HasCategory| |#4| (LIST (QUOTE -310) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-1100))) (|HasCategory| |#4| (LIST (QUOTE -310) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -310) (|devaluate| |#4|))) (|HasCategory| |#4| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -310) (|devaluate| |#4|))) (|HasCategory| |#4| (LIST (QUOTE -901) (QUOTE (-1176)))))) (|HasCategory| |#4| (QUOTE (-365))) (-2909 (|HasCategory| |#4| (QUOTE (-172))) (|HasCategory| |#4| (QUOTE (-365))) (|HasCategory| |#4| (QUOTE (-1050)))) (-2909 (|HasCategory| |#4| (QUOTE (-172))) (|HasCategory| |#4| (QUOTE (-365)))) (|HasCategory| |#4| (QUOTE (-1050))) (|HasCategory| |#4| (QUOTE (-172))) (|HasCategory| |#4| (QUOTE (-794))) (-2909 (|HasCategory| |#4| (QUOTE (-794))) (|HasCategory| |#4| (QUOTE (-849)))) (|HasCategory| |#4| (QUOTE (-849))) (|HasCategory| |#4| (QUOTE (-727))) (-2909 (|HasCategory| |#4| (QUOTE (-172))) (|HasCategory| |#4| (QUOTE (-1050)))) (|HasCategory| |#4| (QUOTE (-370))) (|HasCategory| |#4| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#4| (LIST (QUOTE -901) (QUOTE (-1176)))) (-2909 (|HasCategory| |#4| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#4| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#4| (QUOTE (-172))) (|HasCategory| |#4| (QUOTE (-233))) (|HasCategory| |#4| (QUOTE (-1050)))) (|HasCategory| |#4| (QUOTE (-233))) (|HasCategory| |#4| (QUOTE (-1100))) (-2909 (-12 (|HasCategory| |#4| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#4| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#4| (LIST (QUOTE -901) (QUOTE (-1176))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#4| (QUOTE (-172)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#4| (QUOTE (-233)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#4| (QUOTE (-365)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#4| (QUOTE (-370)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#4| (QUOTE (-727)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#4| (QUOTE (-794)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#4| (QUOTE (-849)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#4| (QUOTE (-1050)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#4| (QUOTE (-1100))))) (-2909 (-12 (|HasCategory| |#4| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#4| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#4| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#4| (QUOTE (-172))) (|HasCategory| |#4| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#4| (QUOTE (-233))) (|HasCategory| |#4| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#4| (QUOTE (-365))) (|HasCategory| |#4| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#4| (QUOTE (-370))) (|HasCategory| |#4| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#4| (QUOTE (-727))) (|HasCategory| |#4| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#4| (QUOTE (-794))) (|HasCategory| |#4| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#4| (QUOTE (-849))) (|HasCategory| |#4| (LIST (QUOTE -1039) (QUOTE (-567))))) (|HasCategory| |#4| (QUOTE (-1050))) (-12 (|HasCategory| |#4| (QUOTE (-1100))) (|HasCategory| |#4| (LIST (QUOTE -1039) (QUOTE (-567)))))) (-2909 (-12 (|HasCategory| |#4| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#4| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#4| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#4| (QUOTE (-172))) (|HasCategory| |#4| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#4| (QUOTE (-233))) (|HasCategory| |#4| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#4| (QUOTE (-365))) (|HasCategory| |#4| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#4| (QUOTE (-370))) (|HasCategory| |#4| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#4| (QUOTE (-727))) (|HasCategory| |#4| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#4| (QUOTE (-794))) (|HasCategory| |#4| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#4| (QUOTE (-849))) (|HasCategory| |#4| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#4| (QUOTE (-1050))) (|HasCategory| |#4| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#4| (QUOTE (-1100))) (|HasCategory| |#4| (LIST (QUOTE -1039) (QUOTE (-567)))))) (|HasCategory| (-567) (QUOTE (-851))) (-12 (|HasCategory| |#4| (QUOTE (-1050))) (|HasCategory| |#4| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#4| (QUOTE (-1050))) (|HasCategory| |#4| (LIST (QUOTE -901) (QUOTE (-1176))))) (-12 (|HasCategory| |#4| (QUOTE (-233))) (|HasCategory| |#4| (QUOTE (-1050)))) (-2909 (-12 (|HasCategory| |#4| (QUOTE (-233))) (|HasCategory| |#4| (QUOTE (-1050)))) (|HasCategory| |#4| (QUOTE (-727))) (-12 (|HasCategory| |#4| (QUOTE (-1050))) (|HasCategory| |#4| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#4| (QUOTE (-1050))) (|HasCategory| |#4| (LIST (QUOTE -901) (QUOTE (-1176)))))) (-12 (|HasCategory| |#4| (QUOTE (-1100))) (|HasCategory| |#4| (LIST (QUOTE -1039) (QUOTE (-567))))) (-2909 (|HasCategory| |#4| (QUOTE (-1050))) (-12 (|HasCategory| |#4| (QUOTE (-1100))) (|HasCategory| |#4| (LIST (QUOTE -1039) (QUOTE (-567)))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#4| (QUOTE (-1100)))) (-2909 (|HasAttribute| |#4| (QUOTE -4413)) (-12 (|HasCategory| |#4| (QUOTE (-233))) (|HasCategory| |#4| (QUOTE (-1050)))) (-12 (|HasCategory| |#4| (QUOTE (-1050))) (|HasCategory| |#4| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#4| (QUOTE (-1050))) (|HasCategory| |#4| (LIST (QUOTE -901) (QUOTE (-1176)))))) (|HasCategory| |#4| (QUOTE (-131))) (|HasCategory| |#4| (QUOTE (-25))) (|HasCategory| |#4| (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| |#4| (QUOTE (-1100))) (|HasCategory| |#4| (LIST (QUOTE -310) (|devaluate| |#4|))))) +((-4413 -2871 (-1692 (|has| |#4| (-1050)) (|has| |#4| (-233))) (-1692 (|has| |#4| (-1050)) (|has| |#4| (-901 (-1176)))) (|has| |#4| (-6 -4413)) (-1692 (|has| |#4| (-1050)) (|has| |#4| (-640 (-567))))) (-4410 |has| |#4| (-1050)) (-4411 |has| |#4| (-1050)) ((-4418 "*") |has| |#4| (-172)) (-4416 . T)) +((-2871 (-12 (|HasCategory| |#4| (QUOTE (-172))) (|HasCategory| |#4| (LIST (QUOTE -310) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-233))) (|HasCategory| |#4| (LIST (QUOTE -310) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-365))) (|HasCategory| |#4| (LIST (QUOTE -310) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-370))) (|HasCategory| |#4| (LIST (QUOTE -310) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-727))) (|HasCategory| |#4| (LIST (QUOTE -310) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-794))) (|HasCategory| |#4| (LIST (QUOTE -310) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-849))) (|HasCategory| |#4| (LIST (QUOTE -310) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-1050))) (|HasCategory| |#4| (LIST (QUOTE -310) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-1100))) (|HasCategory| |#4| (LIST (QUOTE -310) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -310) (|devaluate| |#4|))) (|HasCategory| |#4| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -310) (|devaluate| |#4|))) (|HasCategory| |#4| (LIST (QUOTE -901) (QUOTE (-1176)))))) (|HasCategory| |#4| (QUOTE (-365))) (-2871 (|HasCategory| |#4| (QUOTE (-172))) (|HasCategory| |#4| (QUOTE (-365))) (|HasCategory| |#4| (QUOTE (-1050)))) (-2871 (|HasCategory| |#4| (QUOTE (-172))) (|HasCategory| |#4| (QUOTE (-365)))) (|HasCategory| |#4| (QUOTE (-1050))) (|HasCategory| |#4| (QUOTE (-172))) (|HasCategory| |#4| (QUOTE (-794))) (-2871 (|HasCategory| |#4| (QUOTE (-794))) (|HasCategory| |#4| (QUOTE (-849)))) (|HasCategory| |#4| (QUOTE (-849))) (|HasCategory| |#4| (QUOTE (-727))) (-2871 (|HasCategory| |#4| (QUOTE (-172))) (|HasCategory| |#4| (QUOTE (-1050)))) (|HasCategory| |#4| (QUOTE (-370))) (|HasCategory| |#4| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#4| (LIST (QUOTE -901) (QUOTE (-1176)))) (-2871 (|HasCategory| |#4| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#4| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#4| (QUOTE (-172))) (|HasCategory| |#4| (QUOTE (-233))) (|HasCategory| |#4| (QUOTE (-1050)))) (|HasCategory| |#4| (QUOTE (-233))) (|HasCategory| |#4| (QUOTE (-1100))) (-2871 (-12 (|HasCategory| |#4| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#4| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#4| (LIST (QUOTE -901) (QUOTE (-1176))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#4| (QUOTE (-172)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#4| (QUOTE (-233)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#4| (QUOTE (-365)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#4| (QUOTE (-370)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#4| (QUOTE (-727)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#4| (QUOTE (-794)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#4| (QUOTE (-849)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#4| (QUOTE (-1050)))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#4| (QUOTE (-1100))))) (-2871 (-12 (|HasCategory| |#4| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#4| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#4| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#4| (QUOTE (-172))) (|HasCategory| |#4| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#4| (QUOTE (-233))) (|HasCategory| |#4| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#4| (QUOTE (-365))) (|HasCategory| |#4| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#4| (QUOTE (-370))) (|HasCategory| |#4| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#4| (QUOTE (-727))) (|HasCategory| |#4| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#4| (QUOTE (-794))) (|HasCategory| |#4| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#4| (QUOTE (-849))) (|HasCategory| |#4| (LIST (QUOTE -1039) (QUOTE (-567))))) (|HasCategory| |#4| (QUOTE (-1050))) (-12 (|HasCategory| |#4| (QUOTE (-1100))) (|HasCategory| |#4| (LIST (QUOTE -1039) (QUOTE (-567)))))) (-2871 (-12 (|HasCategory| |#4| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#4| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#4| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#4| (QUOTE (-172))) (|HasCategory| |#4| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#4| (QUOTE (-233))) (|HasCategory| |#4| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#4| (QUOTE (-365))) (|HasCategory| |#4| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#4| (QUOTE (-370))) (|HasCategory| |#4| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#4| (QUOTE (-727))) (|HasCategory| |#4| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#4| (QUOTE (-794))) (|HasCategory| |#4| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#4| (QUOTE (-849))) (|HasCategory| |#4| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#4| (QUOTE (-1050))) (|HasCategory| |#4| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#4| (QUOTE (-1100))) (|HasCategory| |#4| (LIST (QUOTE -1039) (QUOTE (-567)))))) (|HasCategory| (-567) (QUOTE (-851))) (-12 (|HasCategory| |#4| (QUOTE (-1050))) (|HasCategory| |#4| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#4| (QUOTE (-1050))) (|HasCategory| |#4| (LIST (QUOTE -901) (QUOTE (-1176))))) (-12 (|HasCategory| |#4| (QUOTE (-233))) (|HasCategory| |#4| (QUOTE (-1050)))) (-2871 (-12 (|HasCategory| |#4| (QUOTE (-233))) (|HasCategory| |#4| (QUOTE (-1050)))) (|HasCategory| |#4| (QUOTE (-727))) (-12 (|HasCategory| |#4| (QUOTE (-1050))) (|HasCategory| |#4| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#4| (QUOTE (-1050))) (|HasCategory| |#4| (LIST (QUOTE -901) (QUOTE (-1176)))))) (-12 (|HasCategory| |#4| (QUOTE (-1100))) (|HasCategory| |#4| (LIST (QUOTE -1039) (QUOTE (-567))))) (-2871 (|HasCategory| |#4| (QUOTE (-1050))) (-12 (|HasCategory| |#4| (QUOTE (-1100))) (|HasCategory| |#4| (LIST (QUOTE -1039) (QUOTE (-567)))))) (-12 (|HasCategory| |#4| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#4| (QUOTE (-1100)))) (-2871 (|HasAttribute| |#4| (QUOTE -4413)) (-12 (|HasCategory| |#4| (QUOTE (-233))) (|HasCategory| |#4| (QUOTE (-1050)))) (-12 (|HasCategory| |#4| (QUOTE (-1050))) (|HasCategory| |#4| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#4| (QUOTE (-1050))) (|HasCategory| |#4| (LIST (QUOTE -901) (QUOTE (-1176)))))) (|HasCategory| |#4| (QUOTE (-131))) (|HasCategory| |#4| (QUOTE (-25))) (|HasCategory| |#4| (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| |#4| (QUOTE (-1100))) (|HasCategory| |#4| (LIST (QUOTE -310) (|devaluate| |#4|))))) (-252 |n| R S) ((|constructor| (NIL "This constructor provides a direct product of \\spad{R}-modules with an \\spad{R}-module view."))) -((-4413 -2909 (-1410 (|has| |#3| (-1050)) (|has| |#3| (-233))) (-1410 (|has| |#3| (-1050)) (|has| |#3| (-901 (-1176)))) (|has| |#3| (-6 -4413)) (-1410 (|has| |#3| (-1050)) (|has| |#3| (-640 (-567))))) (-4410 |has| |#3| (-1050)) (-4411 |has| |#3| (-1050)) ((-4418 "*") |has| |#3| (-172)) (-4416 . T)) -((-2909 (-12 (|HasCategory| |#3| (QUOTE (-172))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-233))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-365))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-370))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-727))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-794))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-849))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1050))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1100))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|))) (|HasCategory| |#3| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|))) (|HasCategory| |#3| (LIST (QUOTE -901) (QUOTE (-1176)))))) (|HasCategory| |#3| (QUOTE (-365))) (-2909 (|HasCategory| |#3| (QUOTE (-172))) (|HasCategory| |#3| (QUOTE (-365))) (|HasCategory| |#3| (QUOTE (-1050)))) (-2909 (|HasCategory| |#3| (QUOTE (-172))) (|HasCategory| |#3| (QUOTE (-365)))) (|HasCategory| |#3| (QUOTE (-1050))) (|HasCategory| |#3| (QUOTE (-172))) (|HasCategory| |#3| (QUOTE (-794))) (-2909 (|HasCategory| |#3| (QUOTE (-794))) (|HasCategory| |#3| (QUOTE (-849)))) (|HasCategory| |#3| (QUOTE (-849))) (|HasCategory| |#3| (QUOTE (-727))) (-2909 (|HasCategory| |#3| (QUOTE (-172))) (|HasCategory| |#3| (QUOTE (-1050)))) (|HasCategory| |#3| (QUOTE (-370))) (|HasCategory| |#3| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#3| (LIST (QUOTE -901) (QUOTE (-1176)))) (-2909 (|HasCategory| |#3| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#3| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#3| (QUOTE (-172))) (|HasCategory| |#3| (QUOTE (-233))) (|HasCategory| |#3| (QUOTE (-1050)))) (|HasCategory| |#3| (QUOTE (-233))) (|HasCategory| |#3| (QUOTE (-1100))) (-2909 (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (LIST (QUOTE -901) (QUOTE (-1176))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (QUOTE (-172)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (QUOTE (-233)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (QUOTE (-365)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (QUOTE (-370)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (QUOTE (-727)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (QUOTE (-794)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (QUOTE (-849)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (QUOTE (-1050)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (QUOTE (-1100))))) (-2909 (-12 (|HasCategory| |#3| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-172))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-233))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-365))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-370))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-727))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-794))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-849))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (|HasCategory| |#3| (QUOTE (-1050))) (-12 (|HasCategory| |#3| (QUOTE (-1100))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567)))))) (-2909 (-12 (|HasCategory| |#3| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-172))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-233))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-365))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-370))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-727))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-794))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-849))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-1050))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-1100))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567)))))) (|HasCategory| (-567) (QUOTE (-851))) (-12 (|HasCategory| |#3| (QUOTE (-1050))) (|HasCategory| |#3| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-1050))) (|HasCategory| |#3| (LIST (QUOTE -901) (QUOTE (-1176))))) (-12 (|HasCategory| |#3| (QUOTE (-233))) (|HasCategory| |#3| (QUOTE (-1050)))) (-2909 (-12 (|HasCategory| |#3| (QUOTE (-233))) (|HasCategory| |#3| (QUOTE (-1050)))) (|HasCategory| |#3| (QUOTE (-727))) (-12 (|HasCategory| |#3| (QUOTE (-1050))) (|HasCategory| |#3| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-1050))) (|HasCategory| |#3| (LIST (QUOTE -901) (QUOTE (-1176)))))) (-12 (|HasCategory| |#3| (QUOTE (-1100))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-2909 (|HasCategory| |#3| (QUOTE (-1050))) (-12 (|HasCategory| |#3| (QUOTE (-1100))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567)))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (QUOTE (-1100)))) (-2909 (|HasAttribute| |#3| (QUOTE -4413)) (-12 (|HasCategory| |#3| (QUOTE (-233))) (|HasCategory| |#3| (QUOTE (-1050)))) (-12 (|HasCategory| |#3| (QUOTE (-1050))) (|HasCategory| |#3| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-1050))) (|HasCategory| |#3| (LIST (QUOTE -901) (QUOTE (-1176)))))) (|HasCategory| |#3| (QUOTE (-131))) (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| |#3| (QUOTE (-1100))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|))))) +((-4413 -2871 (-1692 (|has| |#3| (-1050)) (|has| |#3| (-233))) (-1692 (|has| |#3| (-1050)) (|has| |#3| (-901 (-1176)))) (|has| |#3| (-6 -4413)) (-1692 (|has| |#3| (-1050)) (|has| |#3| (-640 (-567))))) (-4410 |has| |#3| (-1050)) (-4411 |has| |#3| (-1050)) ((-4418 "*") |has| |#3| (-172)) (-4416 . T)) +((-2871 (-12 (|HasCategory| |#3| (QUOTE (-172))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-233))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-365))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-370))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-727))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-794))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-849))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1050))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1100))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|))) (|HasCategory| |#3| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|))) (|HasCategory| |#3| (LIST (QUOTE -901) (QUOTE (-1176)))))) (|HasCategory| |#3| (QUOTE (-365))) (-2871 (|HasCategory| |#3| (QUOTE (-172))) (|HasCategory| |#3| (QUOTE (-365))) (|HasCategory| |#3| (QUOTE (-1050)))) (-2871 (|HasCategory| |#3| (QUOTE (-172))) (|HasCategory| |#3| (QUOTE (-365)))) (|HasCategory| |#3| (QUOTE (-1050))) (|HasCategory| |#3| (QUOTE (-172))) (|HasCategory| |#3| (QUOTE (-794))) (-2871 (|HasCategory| |#3| (QUOTE (-794))) (|HasCategory| |#3| (QUOTE (-849)))) (|HasCategory| |#3| (QUOTE (-849))) (|HasCategory| |#3| (QUOTE (-727))) (-2871 (|HasCategory| |#3| (QUOTE (-172))) (|HasCategory| |#3| (QUOTE (-1050)))) (|HasCategory| |#3| (QUOTE (-370))) (|HasCategory| |#3| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#3| (LIST (QUOTE -901) (QUOTE (-1176)))) (-2871 (|HasCategory| |#3| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#3| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#3| (QUOTE (-172))) (|HasCategory| |#3| (QUOTE (-233))) (|HasCategory| |#3| (QUOTE (-1050)))) (|HasCategory| |#3| (QUOTE (-233))) (|HasCategory| |#3| (QUOTE (-1100))) (-2871 (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (LIST (QUOTE -901) (QUOTE (-1176))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (QUOTE (-172)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (QUOTE (-233)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (QUOTE (-365)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (QUOTE (-370)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (QUOTE (-727)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (QUOTE (-794)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (QUOTE (-849)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (QUOTE (-1050)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (QUOTE (-1100))))) (-2871 (-12 (|HasCategory| |#3| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-172))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-233))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-365))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-370))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-727))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-794))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-849))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (|HasCategory| |#3| (QUOTE (-1050))) (-12 (|HasCategory| |#3| (QUOTE (-1100))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567)))))) (-2871 (-12 (|HasCategory| |#3| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-172))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-233))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-365))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-370))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-727))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-794))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-849))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-1050))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-1100))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567)))))) (|HasCategory| (-567) (QUOTE (-851))) (-12 (|HasCategory| |#3| (QUOTE (-1050))) (|HasCategory| |#3| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-1050))) (|HasCategory| |#3| (LIST (QUOTE -901) (QUOTE (-1176))))) (-12 (|HasCategory| |#3| (QUOTE (-233))) (|HasCategory| |#3| (QUOTE (-1050)))) (-2871 (-12 (|HasCategory| |#3| (QUOTE (-233))) (|HasCategory| |#3| (QUOTE (-1050)))) (|HasCategory| |#3| (QUOTE (-727))) (-12 (|HasCategory| |#3| (QUOTE (-1050))) (|HasCategory| |#3| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-1050))) (|HasCategory| |#3| (LIST (QUOTE -901) (QUOTE (-1176)))))) (-12 (|HasCategory| |#3| (QUOTE (-1100))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-2871 (|HasCategory| |#3| (QUOTE (-1050))) (-12 (|HasCategory| |#3| (QUOTE (-1100))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567)))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (QUOTE (-1100)))) (-2871 (|HasAttribute| |#3| (QUOTE -4413)) (-12 (|HasCategory| |#3| (QUOTE (-233))) (|HasCategory| |#3| (QUOTE (-1050)))) (-12 (|HasCategory| |#3| (QUOTE (-1050))) (|HasCategory| |#3| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-1050))) (|HasCategory| |#3| (LIST (QUOTE -901) (QUOTE (-1176)))))) (|HasCategory| |#3| (QUOTE (-131))) (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| |#3| (QUOTE (-1100))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|))))) (-253 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 @@ -991,7 +991,7 @@ NIL (-265 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"))) (((-4418 "*") |has| |#1| (-172)) (-4409 |has| |#1| (-559)) (-4414 |has| |#1| (-6 -4414)) (-4411 . T) (-4410 . T) (-4413 . T)) -((|HasCategory| |#1| (QUOTE (-910))) (-2909 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-910)))) (-2909 (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-910)))) (-2909 (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-910)))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-172))) (-2909 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| |#3| (LIST (QUOTE -887) (QUOTE (-381))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| |#3| (LIST (QUOTE -887) (QUOTE (-567))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| |#3| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| |#3| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#3| (LIST (QUOTE -615) (QUOTE (-539))))) (|HasCategory| |#1| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))) (-2909 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567)))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-233))) (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#1| (QUOTE (-365))) (|HasAttribute| |#1| (QUOTE -4414)) (|HasCategory| |#1| (QUOTE (-455))) (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-910)))) (-2909 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-910)))) (|HasCategory| |#1| (QUOTE (-145))))) +((|HasCategory| |#1| (QUOTE (-910))) (-2871 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-910)))) (-2871 (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-910)))) (-2871 (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-910)))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-172))) (-2871 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| |#3| (LIST (QUOTE -887) (QUOTE (-381))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| |#3| (LIST (QUOTE -887) (QUOTE (-567))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| |#3| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| |#3| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#3| (LIST (QUOTE -615) (QUOTE (-539))))) (|HasCategory| |#1| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))) (-2871 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567)))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-233))) (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#1| (QUOTE (-365))) (|HasAttribute| |#1| (QUOTE -4414)) (|HasCategory| |#1| (QUOTE (-455))) (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-910)))) (-2871 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-910)))) (|HasCategory| |#1| (QUOTE (-145))))) (-266 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 @@ -1036,11 +1036,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 -(-277 R -2111) +(-277 R -3944) ((|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 -(-278 R -2111) +(-278 R -3944) ((|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 @@ -1088,7 +1088,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 -(-290 S R |Mod| -2362 -3768 |exactQuo|) +(-290 S R |Mod| -3793 -4048 |exactQuo|) ((|constructor| (NIL "These domains are used for the factorization and gcds of univariate polynomials over the integers in order to work modulo different primes. See \\spadtype{ModularRing},{} \\spadtype{ModularField}")) (|elt| ((|#2| $ |#2|) "\\spad{elt(x,r)} or \\spad{x}.\\spad{r} \\undocumented")) (|inv| (($ $) "\\spad{inv(x)} \\undocumented")) (|recip| (((|Union| $ "failed") $) "\\spad{recip(x)} \\undocumented")) (|exQuo| (((|Union| $ "failed") $ $) "\\spad{exQuo(x,y)} \\undocumented")) (|reduce| (($ |#2| |#3|) "\\spad{reduce(r,m)} \\undocumented")) (|coerce| ((|#2| $) "\\spad{coerce(x)} \\undocumented")) (|modulus| ((|#3| $) "\\spad{modulus(x)} \\undocumented"))) ((-4409 . T) ((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) NIL @@ -1110,21 +1110,21 @@ NIL NIL (-295 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."))) -((-4413 -2909 (|has| |#1| (-1050)) (|has| |#1| (-476))) (-4410 |has| |#1| (-1050)) (-4411 |has| |#1| (-1050))) -((|HasCategory| |#1| (QUOTE (-365))) (-2909 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-1050)))) (-2909 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-1050))) (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (-2909 (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#1| (QUOTE (-1050)))) (-2909 (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-1050)))) (-2909 (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-1050)))) (-2909 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-1050)))) (-2909 (|HasCategory| |#1| (QUOTE (-476))) (|HasCategory| |#1| (QUOTE (-727)))) (|HasCategory| |#1| (QUOTE (-476))) (-2909 (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-476))) (|HasCategory| |#1| (QUOTE (-727))) (|HasCategory| |#1| (QUOTE (-1050))) (|HasCategory| |#1| (QUOTE (-1112))) (|HasCategory| |#1| (QUOTE (-1100)))) (-2909 (|HasCategory| |#1| (QUOTE (-476))) (|HasCategory| |#1| (QUOTE (-727))) (|HasCategory| |#1| (QUOTE (-1112)))) (|HasCategory| |#1| (LIST (QUOTE -517) (QUOTE (-1176)) (|devaluate| |#1|))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-303))) (-2909 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-476)))) (-2909 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-727)))) (-2909 (|HasCategory| |#1| (QUOTE (-476))) (|HasCategory| |#1| (QUOTE (-1050)))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-1112))) (|HasCategory| |#1| (QUOTE (-727)))) +((-4413 -2871 (|has| |#1| (-1050)) (|has| |#1| (-476))) (-4410 |has| |#1| (-1050)) (-4411 |has| |#1| (-1050))) +((|HasCategory| |#1| (QUOTE (-365))) (-2871 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-1050)))) (-2871 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-1050))) (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (-2871 (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#1| (QUOTE (-1050)))) (-2871 (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-1050)))) (-2871 (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-1050)))) (-2871 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-1050)))) (-2871 (|HasCategory| |#1| (QUOTE (-476))) (|HasCategory| |#1| (QUOTE (-727)))) (|HasCategory| |#1| (QUOTE (-476))) (-2871 (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-476))) (|HasCategory| |#1| (QUOTE (-727))) (|HasCategory| |#1| (QUOTE (-1050))) (|HasCategory| |#1| (QUOTE (-1112))) (|HasCategory| |#1| (QUOTE (-1100)))) (-2871 (|HasCategory| |#1| (QUOTE (-476))) (|HasCategory| |#1| (QUOTE (-727))) (|HasCategory| |#1| (QUOTE (-1112)))) (|HasCategory| |#1| (LIST (QUOTE -517) (QUOTE (-1176)) (|devaluate| |#1|))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-303))) (-2871 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-476)))) (-2871 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-727)))) (-2871 (|HasCategory| |#1| (QUOTE (-476))) (|HasCategory| |#1| (QUOTE (-1050)))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-1112))) (|HasCategory| |#1| (QUOTE (-727)))) (-296 |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."))) ((-4416 . T) (-4417 . T)) -((-12 (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (QUOTE (-1100))) (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (LIST (QUOTE -310) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -1762) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3859) (|devaluate| |#2|)))))) (-2909 (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (QUOTE (-1100))) (|HasCategory| |#2| (QUOTE (-1100)))) (-2909 (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (QUOTE (-1100))) (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (LIST (QUOTE -615) (QUOTE (-539)))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (QUOTE (-1100))) (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#2| (QUOTE (-1100))) (-2909 (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (LIST (QUOTE -614) (QUOTE (-863))))) +((-12 (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (QUOTE (-1100))) (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (LIST (QUOTE -310) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -1812) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -4217) (|devaluate| |#2|)))))) (-2871 (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (QUOTE (-1100))) (|HasCategory| |#2| (QUOTE (-1100)))) (-2871 (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (QUOTE (-1100))) (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (LIST (QUOTE -615) (QUOTE (-539)))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (QUOTE (-1100))) (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#2| (QUOTE (-1100))) (-2871 (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (LIST (QUOTE -614) (QUOTE (-863))))) (-297) ((|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 -(-298 -2111 S) +(-298 -3944 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 -(-299 E -2111) +(-299 E -3944) ((|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 @@ -1172,7 +1172,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 -(-311 -2111) +(-311 -3944) ((|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 @@ -1187,7 +1187,7 @@ NIL (-314 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))}."))) ((-4408 . T) (-4414 . T) (-4409 . T) ((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) -((|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (QUOTE (-910))) (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (LIST (QUOTE -1039) (QUOTE (-1176)))) (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (QUOTE (-145))) (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (QUOTE (-147))) (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (QUOTE (-1023))) (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (QUOTE (-821))) (-2909 (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (QUOTE (-821))) (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (QUOTE (-851)))) (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (QUOTE (-1151))) (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (QUOTE (-233))) (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (LIST (QUOTE -517) (QUOTE (-1176)) (LIST (QUOTE -1252) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#4|)))) (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (LIST (QUOTE -310) (LIST (QUOTE -1252) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#4|)))) (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (LIST (QUOTE -287) (LIST (QUOTE -1252) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#4|)) (LIST (QUOTE -1252) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#4|)))) (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (QUOTE (-308))) (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (QUOTE (-548))) (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (QUOTE (-851))) (-12 (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (QUOTE (-910))) (|HasCategory| $ (QUOTE (-145)))) (-2909 (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (QUOTE (-145))) (-12 (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (QUOTE (-910))) (|HasCategory| $ (QUOTE (-145)))))) +((|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (QUOTE (-910))) (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (LIST (QUOTE -1039) (QUOTE (-1176)))) (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (QUOTE (-145))) (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (QUOTE (-147))) (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (QUOTE (-1023))) (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (QUOTE (-821))) (-2871 (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (QUOTE (-821))) (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (QUOTE (-851)))) (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (QUOTE (-1151))) (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (QUOTE (-233))) (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (LIST (QUOTE -517) (QUOTE (-1176)) (LIST (QUOTE -1252) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#4|)))) (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (LIST (QUOTE -310) (LIST (QUOTE -1252) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#4|)))) (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (LIST (QUOTE -287) (LIST (QUOTE -1252) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#4|)) (LIST (QUOTE -1252) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#4|)))) (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (QUOTE (-308))) (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (QUOTE (-548))) (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (QUOTE (-851))) (-12 (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (QUOTE (-910))) (|HasCategory| $ (QUOTE (-145)))) (-2871 (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (QUOTE (-145))) (-12 (|HasCategory| (-1252 |#1| |#2| |#3| |#4|) (QUOTE (-910))) (|HasCategory| $ (QUOTE (-145)))))) (-315 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 @@ -1198,9 +1198,9 @@ NIL NIL (-317 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."))) -((-4413 -2909 (-1410 (|has| |#1| (-1050)) (|has| |#1| (-640 (-567)))) (-12 (|has| |#1| (-559)) (-2909 (-1410 (|has| |#1| (-1050)) (|has| |#1| (-640 (-567)))) (|has| |#1| (-1050)) (|has| |#1| (-476)))) (|has| |#1| (-1050)) (|has| |#1| (-476))) (-4411 |has| |#1| (-172)) (-4410 |has| |#1| (-172)) ((-4418 "*") |has| |#1| (-559)) (-4409 |has| |#1| (-559)) (-4414 |has| |#1| (-559)) (-4408 |has| |#1| (-559))) -((-2909 (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (-12 (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))))) (|HasCategory| |#1| (QUOTE (-559))) (-2909 (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-1050)))) (|HasCategory| |#1| (QUOTE (-21))) (-2909 (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-559)))) (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-1050))) (|HasCategory| |#1| (LIST (QUOTE -640) (QUOTE (-567)))) (-2909 (|HasCategory| |#1| (QUOTE (-476))) (|HasCategory| |#1| (QUOTE (-1112)))) (|HasCategory| |#1| (QUOTE (-476))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539)))) (-2909 (|HasCategory| |#1| (QUOTE (-1050))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (-12 (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567))))) (-2909 (|HasCategory| |#1| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-1050)))) (-2909 (|HasCategory| |#1| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-1050)))) (-2909 (|HasCategory| |#1| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-1050)))) (-12 (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-559)))) (-2909 (|HasCategory| |#1| (QUOTE (-476))) (|HasCategory| |#1| (QUOTE (-559)))) (-12 (|HasCategory| |#1| (QUOTE (-1050))) (|HasCategory| |#1| (LIST (QUOTE -640) (QUOTE (-567))))) (-2909 (-12 (|HasCategory| |#1| (QUOTE (-1050))) (|HasCategory| |#1| (LIST (QUOTE -640) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-1112)))) (-2909 (|HasCategory| |#1| (QUOTE (-21))) (-12 (|HasCategory| |#1| (QUOTE (-1050))) (|HasCategory| |#1| (LIST (QUOTE -640) (QUOTE (-567)))))) (-2909 (|HasCategory| |#1| (QUOTE (-25))) (-12 (|HasCategory| |#1| (QUOTE (-1050))) (|HasCategory| |#1| (LIST (QUOTE -640) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-1112)))) (-2909 (|HasCategory| |#1| (QUOTE (-25))) (-12 (|HasCategory| |#1| (QUOTE (-1050))) (|HasCategory| |#1| (LIST (QUOTE -640) (QUOTE (-567)))))) (-2909 (|HasCategory| |#1| (QUOTE (-476))) (|HasCategory| |#1| (QUOTE (-1050)))) (-2909 (-12 (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-559)))) (-12 (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-1112))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| $ (QUOTE (-1050))) (|HasCategory| $ (LIST (QUOTE -1039) (QUOTE (-567))))) -(-318 R -2111) +((-4413 -2871 (-1692 (|has| |#1| (-1050)) (|has| |#1| (-640 (-567)))) (-12 (|has| |#1| (-559)) (-2871 (-1692 (|has| |#1| (-1050)) (|has| |#1| (-640 (-567)))) (|has| |#1| (-1050)) (|has| |#1| (-476)))) (|has| |#1| (-1050)) (|has| |#1| (-476))) (-4411 |has| |#1| (-172)) (-4410 |has| |#1| (-172)) ((-4418 "*") |has| |#1| (-559)) (-4409 |has| |#1| (-559)) (-4414 |has| |#1| (-559)) (-4408 |has| |#1| (-559))) +((-2871 (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (-12 (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))))) (|HasCategory| |#1| (QUOTE (-559))) (-2871 (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-1050)))) (|HasCategory| |#1| (QUOTE (-21))) (-2871 (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-559)))) (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-1050))) (|HasCategory| |#1| (LIST (QUOTE -640) (QUOTE (-567)))) (-2871 (|HasCategory| |#1| (QUOTE (-476))) (|HasCategory| |#1| (QUOTE (-1112)))) (|HasCategory| |#1| (QUOTE (-476))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539)))) (-2871 (|HasCategory| |#1| (QUOTE (-1050))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (-12 (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567))))) (-2871 (|HasCategory| |#1| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-1050)))) (-2871 (|HasCategory| |#1| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-1050)))) (-2871 (|HasCategory| |#1| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-1050)))) (-12 (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-559)))) (-2871 (|HasCategory| |#1| (QUOTE (-476))) (|HasCategory| |#1| (QUOTE (-559)))) (-12 (|HasCategory| |#1| (QUOTE (-1050))) (|HasCategory| |#1| (LIST (QUOTE -640) (QUOTE (-567))))) (-2871 (-12 (|HasCategory| |#1| (QUOTE (-1050))) (|HasCategory| |#1| (LIST (QUOTE -640) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-1112)))) (-2871 (|HasCategory| |#1| (QUOTE (-21))) (-12 (|HasCategory| |#1| (QUOTE (-1050))) (|HasCategory| |#1| (LIST (QUOTE -640) (QUOTE (-567)))))) (-2871 (|HasCategory| |#1| (QUOTE (-25))) (-12 (|HasCategory| |#1| (QUOTE (-1050))) (|HasCategory| |#1| (LIST (QUOTE -640) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-1112)))) (-2871 (|HasCategory| |#1| (QUOTE (-25))) (-12 (|HasCategory| |#1| (QUOTE (-1050))) (|HasCategory| |#1| (LIST (QUOTE -640) (QUOTE (-567)))))) (-2871 (|HasCategory| |#1| (QUOTE (-476))) (|HasCategory| |#1| (QUOTE (-1050)))) (-2871 (-12 (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-559)))) (-12 (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-1112))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| $ (QUOTE (-1050))) (|HasCategory| $ (LIST (QUOTE -1039) (QUOTE (-567))))) +(-318 R -3944) ((|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 @@ -1211,7 +1211,7 @@ NIL (-320 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."))) (((-4418 "*") |has| |#1| (-172)) (-4409 |has| |#1| (-559)) (-4414 |has| |#1| (-365)) (-4408 |has| |#1| (-365)) (-4410 . T) (-4411 . T) (-4413 . T)) -((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-172))) (-2909 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559)))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-147))) (-12 (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -410) (QUOTE (-567))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -410) (QUOTE (-567))) (|devaluate| |#1|)))) (|HasCategory| (-410 (-567)) (QUOTE (-1112))) (|HasCategory| |#1| (QUOTE (-365))) (-2909 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-559)))) (-2909 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-559)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -410) (QUOTE (-567)))))) (|HasSignature| |#1| (LIST (QUOTE -4101) (LIST (|devaluate| |#1|) (QUOTE (-1176)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -410) (QUOTE (-567)))))) (-2909 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-960))) (|HasCategory| |#1| (QUOTE (-1201))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasSignature| |#1| (LIST (QUOTE -2113) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1176))))) (|HasSignature| |#1| (LIST (QUOTE -2449) (LIST (LIST (QUOTE -645) (QUOTE (-1176))) (|devaluate| |#1|))))))) +((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-172))) (-2871 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559)))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-147))) (-12 (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -410) (QUOTE (-567))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -410) (QUOTE (-567))) (|devaluate| |#1|)))) (|HasCategory| (-410 (-567)) (QUOTE (-1112))) (|HasCategory| |#1| (QUOTE (-365))) (-2871 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-559)))) (-2871 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-559)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -410) (QUOTE (-567)))))) (|HasSignature| |#1| (LIST (QUOTE -4130) (LIST (|devaluate| |#1|) (QUOTE (-1176)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -410) (QUOTE (-567)))))) (-2871 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-960))) (|HasCategory| |#1| (QUOTE (-1201))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasSignature| |#1| (LIST (QUOTE -3337) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1176))))) (|HasSignature| |#1| (LIST (QUOTE -2921) (LIST (LIST (QUOTE -645) (QUOTE (-1176))) (|devaluate| |#1|))))))) (-321 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 @@ -1243,12 +1243,12 @@ NIL (-328 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."))) ((-4417 . T) (-4416 . T)) -((-2909 (-12 (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) (-2909 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539)))) (-2909 (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-1100)))) (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| (-567) (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) -(-329 S -2111) +((-2871 (-12 (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) (-2871 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539)))) (-2871 (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-1100)))) (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| (-567) (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) +(-329 S -3944) ((|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 (-370)))) -(-330 -2111) +(-330 -3944) ((|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."))) ((-4408 . T) (-4414 . T) (-4409 . T) ((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) NIL @@ -1272,15 +1272,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 -(-336 S -2111 UP UPUP R) +(-336 S -3944 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 -(-337 -2111 UP UPUP R) +(-337 -3944 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 -(-338 -2111 UP UPUP R) +(-338 -3944 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 @@ -1300,26 +1300,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 -(-343 S -2111 UP UPUP) +(-343 S -3944 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 (-370))) (|HasCategory| |#2| (QUOTE (-365)))) -(-344 -2111 UP UPUP) +(-344 -3944 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."))) ((-4409 |has| (-410 |#2|) (-365)) (-4414 |has| (-410 |#2|) (-365)) (-4408 |has| (-410 |#2|) (-365)) ((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) NIL (-345 |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."))) ((-4408 . T) (-4414 . T) (-4409 . T) ((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) -((-2909 (|HasCategory| (-911 |#1|) (QUOTE (-145))) (|HasCategory| (-911 |#1|) (QUOTE (-370)))) (|HasCategory| (-911 |#1|) (QUOTE (-147))) (|HasCategory| (-911 |#1|) (QUOTE (-370))) (|HasCategory| (-911 |#1|) (QUOTE (-145)))) +((-2871 (|HasCategory| (-911 |#1|) (QUOTE (-145))) (|HasCategory| (-911 |#1|) (QUOTE (-370)))) (|HasCategory| (-911 |#1|) (QUOTE (-147))) (|HasCategory| (-911 |#1|) (QUOTE (-370))) (|HasCategory| (-911 |#1|) (QUOTE (-145)))) (-346 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."))) ((-4408 . T) (-4414 . T) (-4409 . T) ((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) -((-2909 (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-145)))) +((-2871 (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-145)))) (-347 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."))) ((-4408 . T) (-4414 . T) (-4409 . T) ((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) -((-2909 (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-145)))) +((-2871 (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-145)))) (-348 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 @@ -1336,31 +1336,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."))) ((-4408 . T) (-4414 . T) (-4409 . T) ((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) NIL -(-352 R UP -2111) +(-352 R UP -3944) ((|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 (-353 |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."))) ((-4408 . T) (-4414 . T) (-4409 . T) ((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) -((-2909 (|HasCategory| (-911 |#1|) (QUOTE (-145))) (|HasCategory| (-911 |#1|) (QUOTE (-370)))) (|HasCategory| (-911 |#1|) (QUOTE (-147))) (|HasCategory| (-911 |#1|) (QUOTE (-370))) (|HasCategory| (-911 |#1|) (QUOTE (-145)))) +((-2871 (|HasCategory| (-911 |#1|) (QUOTE (-145))) (|HasCategory| (-911 |#1|) (QUOTE (-370)))) (|HasCategory| (-911 |#1|) (QUOTE (-147))) (|HasCategory| (-911 |#1|) (QUOTE (-370))) (|HasCategory| (-911 |#1|) (QUOTE (-145)))) (-354 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."))) ((-4408 . T) (-4414 . T) (-4409 . T) ((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) -((-2909 (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-145)))) +((-2871 (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-145)))) (-355 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."))) ((-4408 . T) (-4414 . T) (-4409 . T) ((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) -((-2909 (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-145)))) +((-2871 (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-145)))) (-356 |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}."))) ((-4408 . T) (-4414 . T) (-4409 . T) ((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) -((-2909 (|HasCategory| (-911 |#1|) (QUOTE (-145))) (|HasCategory| (-911 |#1|) (QUOTE (-370)))) (|HasCategory| (-911 |#1|) (QUOTE (-147))) (|HasCategory| (-911 |#1|) (QUOTE (-370))) (|HasCategory| (-911 |#1|) (QUOTE (-145)))) +((-2871 (|HasCategory| (-911 |#1|) (QUOTE (-145))) (|HasCategory| (-911 |#1|) (QUOTE (-370)))) (|HasCategory| (-911 |#1|) (QUOTE (-147))) (|HasCategory| (-911 |#1|) (QUOTE (-370))) (|HasCategory| (-911 |#1|) (QUOTE (-145)))) (-357 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."))) ((-4408 . T) (-4414 . T) (-4409 . T) ((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) -((-2909 (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-145)))) -(-358 -2111 GF) +((-2871 (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-145)))) +(-358 -3944 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 @@ -1368,14 +1368,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 -(-360 -2111 FP FPP) +(-360 -3944 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 (-361 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}."))) ((-4408 . T) (-4414 . T) (-4409 . T) ((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) -((-2909 (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-145)))) +((-2871 (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-370)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-145)))) (-362 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 @@ -1454,7 +1454,7 @@ NIL NIL (-381) ((|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}."))) -((-4399 . T) (-4407 . T) (-2927 . T) (-4408 . T) (-4414 . T) (-4409 . T) ((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) +((-4399 . T) (-4407 . T) (-3112 . T) (-4408 . T) (-4414 . T) (-4409 . T) ((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) NIL (-382 |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}."))) @@ -1485,7 +1485,7 @@ NIL NIL NIL (-389 S) -((|constructor| (NIL "The free monoid on a set \\spad{S} is the monoid of finite products of the form \\spad{reduce(*,[si ** ni])} where the \\spad{si}\\spad{'s} are in \\spad{S},{} and the \\spad{ni}\\spad{'s} are nonnegative integers. The multiplication is not commutative.")) (|mapGen| (($ (|Mapping| |#1| |#1|) $) "\\spad{mapGen(f, a1\\^e1 ... an\\^en)} returns \\spad{f(a1)\\^e1 ... f(an)\\^en}.")) (|mapExpon| (($ (|Mapping| (|NonNegativeInteger|) (|NonNegativeInteger|)) $) "\\spad{mapExpon(f, a1\\^e1 ... an\\^en)} returns \\spad{a1\\^f(e1) ... an\\^f(en)}.")) (|nthFactor| ((|#1| $ (|Integer|)) "\\spad{nthFactor(x, n)} returns the factor of the n^th monomial of \\spad{x}.")) (|nthExpon| (((|NonNegativeInteger|) $ (|Integer|)) "\\spad{nthExpon(x, n)} returns the exponent of the n^th monomial of \\spad{x}.")) (|factors| (((|List| (|Record| (|:| |gen| |#1|) (|:| |exp| (|NonNegativeInteger|)))) $) "\\spad{factors(a1\\^e1,...,an\\^en)} returns \\spad{[[a1, e1],...,[an, en]]}.")) (|size| (((|NonNegativeInteger|) $) "\\spad{size(x)} returns the number of monomials in \\spad{x}.")) (|overlap| (((|Record| (|:| |lm| $) (|:| |mm| $) (|:| |rm| $)) $ $) "\\spad{overlap(x, y)} returns \\spad{[l, m, r]} such that \\spad{x = l * m},{} \\spad{y = m * r} and \\spad{l} and \\spad{r} have no overlap,{} \\spadignore{i.e.} \\spad{overlap(l, r) = [l, 1, r]}.")) (|divide| (((|Union| (|Record| (|:| |lm| $) (|:| |rm| $)) "failed") $ $) "\\spad{divide(x, y)} returns the left and right exact quotients of \\spad{x} by \\spad{y},{} \\spadignore{i.e.} \\spad{[l, r]} such that \\spad{x = l * y * r},{} \"failed\" if \\spad{x} is not of the form \\spad{l * y * r}.")) (|rquo| (((|Union| $ "failed") $ $) "\\spad{rquo(x, y)} returns the exact right quotient of \\spad{x} by \\spad{y} \\spadignore{i.e.} \\spad{q} such that \\spad{x = q * y},{} \"failed\" if \\spad{x} is not of the form \\spad{q * y}.")) (|lquo| (((|Union| $ "failed") $ $) "\\spad{lquo(x, y)} returns the exact left quotient of \\spad{x} by \\spad{y} \\spadignore{i.e.} \\spad{q} such that \\spad{x = y * q},{} \"failed\" if \\spad{x} is not of the form \\spad{y * q}.")) (|hcrf| (($ $ $) "\\spad{hcrf(x, y)} returns the highest common right factor of \\spad{x} and \\spad{y},{} \\spadignore{i.e.} the largest \\spad{d} such that \\spad{x = a d} and \\spad{y = b d}.")) (|hclf| (($ $ $) "\\spad{hclf(x, y)} returns the highest common left factor of \\spad{x} and \\spad{y},{} \\spadignore{i.e.} the largest \\spad{d} such that \\spad{x = d a} and \\spad{y = d b}.")) (** (($ |#1| (|NonNegativeInteger|)) "\\spad{s ** n} returns the product of \\spad{s} by itself \\spad{n} times.")) (* (($ $ |#1|) "\\spad{x * s} returns the product of \\spad{x} by \\spad{s} on the right.") (($ |#1| $) "\\spad{s * x} returns the product of \\spad{x} by \\spad{s} on the left."))) +((|constructor| (NIL "The free monoid on a set \\spad{S} is the monoid of finite products of the form \\spad{reduce(*,[si ** ni])} where the \\spad{si}\\spad{'s} are in \\spad{S},{} and the \\spad{ni}\\spad{'s} are nonnegative integers. The multiplication is not commutative."))) NIL ((|HasCategory| |#1| (QUOTE (-851)))) (-390) @@ -1508,7 +1508,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 -(-395 -2111 UP UPUP R) +(-395 -3944 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 @@ -1532,11 +1532,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 -(-401 -1817 |returnType| -3914 |symbols|) +(-401 -2011 |returnType| -4174 |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 -(-402 -2111 UP) +(-402 -3944 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 @@ -1558,7 +1558,7 @@ NIL ((|HasAttribute| |#1| (QUOTE -4399)) (|HasAttribute| |#1| (QUOTE -4407))) (-407) ((|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\"."))) -((-2927 . T) (-4408 . T) (-4414 . T) (-4409 . T) ((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) +((-3112 . T) (-4408 . T) (-4414 . T) (-4409 . T) ((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) NIL (-408 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."))) @@ -1571,7 +1571,7 @@ NIL (-410 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."))) ((-4403 -12 (|has| |#1| (-6 -4414)) (|has| |#1| (-455)) (|has| |#1| (-6 -4403))) (-4408 . T) (-4414 . T) (-4409 . T) ((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) -((|HasCategory| |#1| (QUOTE (-910))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-1176)))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-147))) (-2909 (-12 (|HasCategory| |#1| (QUOTE (-548))) (|HasCategory| |#1| (QUOTE (-829)))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539))))) (|HasCategory| |#1| (QUOTE (-1023))) (|HasCategory| |#1| (QUOTE (-821))) (-2909 (|HasCategory| |#1| (QUOTE (-821))) (|HasCategory| |#1| (QUOTE (-851)))) (-2909 (-12 (|HasCategory| |#1| (QUOTE (-548))) (|HasCategory| |#1| (QUOTE (-829)))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-1151))) (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-381)))) (-2909 (-12 (|HasCategory| |#1| (QUOTE (-548))) (|HasCategory| |#1| (QUOTE (-829)))) (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (-2909 (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (-12 (|HasCategory| |#1| (QUOTE (-548))) (|HasCategory| |#1| (QUOTE (-829))))) (-2909 (|HasCategory| |#1| (LIST (QUOTE -640) (QUOTE (-567)))) (-12 (|HasCategory| |#1| (QUOTE (-548))) (|HasCategory| |#1| (QUOTE (-829))))) (|HasCategory| |#1| (QUOTE (-233))) (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#1| (LIST (QUOTE -517) (QUOTE (-1176)) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -287) (|devaluate| |#1|) (|devaluate| |#1|))) (-12 (|HasCategory| |#1| (QUOTE (-548))) (|HasCategory| |#1| (QUOTE (-829)))) (|HasCategory| |#1| (QUOTE (-308))) (|HasCategory| |#1| (QUOTE (-548))) (-12 (|HasAttribute| |#1| (QUOTE -4414)) (|HasAttribute| |#1| (QUOTE -4403)) (|HasCategory| |#1| (QUOTE (-455)))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -640) (QUOTE (-567)))) (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-910)))) (-2909 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-910)))) (|HasCategory| |#1| (QUOTE (-145))))) +((|HasCategory| |#1| (QUOTE (-910))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-1176)))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-147))) (-2871 (-12 (|HasCategory| |#1| (QUOTE (-548))) (|HasCategory| |#1| (QUOTE (-829)))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539))))) (|HasCategory| |#1| (QUOTE (-1023))) (|HasCategory| |#1| (QUOTE (-821))) (-2871 (|HasCategory| |#1| (QUOTE (-821))) (|HasCategory| |#1| (QUOTE (-851)))) (-2871 (-12 (|HasCategory| |#1| (QUOTE (-548))) (|HasCategory| |#1| (QUOTE (-829)))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-1151))) (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-381)))) (-2871 (-12 (|HasCategory| |#1| (QUOTE (-548))) (|HasCategory| |#1| (QUOTE (-829)))) (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (-2871 (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (-12 (|HasCategory| |#1| (QUOTE (-548))) (|HasCategory| |#1| (QUOTE (-829))))) (-2871 (|HasCategory| |#1| (LIST (QUOTE -640) (QUOTE (-567)))) (-12 (|HasCategory| |#1| (QUOTE (-548))) (|HasCategory| |#1| (QUOTE (-829))))) (|HasCategory| |#1| (QUOTE (-233))) (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#1| (LIST (QUOTE -517) (QUOTE (-1176)) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -287) (|devaluate| |#1|) (|devaluate| |#1|))) (-12 (|HasCategory| |#1| (QUOTE (-548))) (|HasCategory| |#1| (QUOTE (-829)))) (|HasCategory| |#1| (QUOTE (-308))) (|HasCategory| |#1| (QUOTE (-548))) (-12 (|HasAttribute| |#1| (QUOTE -4414)) (|HasAttribute| |#1| (QUOTE -4403)) (|HasCategory| |#1| (QUOTE (-455)))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -640) (QUOTE (-567)))) (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-910)))) (-2871 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-910)))) (|HasCategory| |#1| (QUOTE (-145))))) (-411 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 @@ -1592,11 +1592,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 -(-416 R -2111 UP A) +(-416 R -3944 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)}."))) ((-4413 . T)) NIL -(-417 R -2111 UP A |ibasis|) +(-417 R -3944 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 -1039) (|devaluate| |#2|)))) @@ -1615,7 +1615,7 @@ NIL (-421 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."))) ((-4409 . T) ((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) -((|HasCategory| |#1| (LIST (QUOTE -517) (QUOTE (-1176)) (QUOTE $))) (|HasCategory| |#1| (LIST (QUOTE -310) (QUOTE $))) (|HasCategory| |#1| (LIST (QUOTE -287) (QUOTE $) (QUOTE $))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#1| (QUOTE (-1220))) (-2909 (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-1220)))) (|HasCategory| |#1| (QUOTE (-1023))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| |#1| (LIST (QUOTE -517) (QUOTE (-1176)) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -287) (|devaluate| |#1|) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-233))) (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#1| (QUOTE (-548))) (|HasCategory| |#1| (QUOTE (-455)))) +((|HasCategory| |#1| (LIST (QUOTE -517) (QUOTE (-1176)) (QUOTE $))) (|HasCategory| |#1| (LIST (QUOTE -310) (QUOTE $))) (|HasCategory| |#1| (LIST (QUOTE -287) (QUOTE $) (QUOTE $))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#1| (QUOTE (-1220))) (-2871 (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-1220)))) (|HasCategory| |#1| (QUOTE (-1023))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| |#1| (LIST (QUOTE -517) (QUOTE (-1176)) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -287) (|devaluate| |#1|) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-233))) (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#1| (QUOTE (-548))) (|HasCategory| |#1| (QUOTE (-455)))) (-422 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 @@ -1644,7 +1644,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}."))) ((-4416 . T) (-4406 . T) (-4417 . T)) NIL -(-429 R -2111) +(-429 R -3944) ((|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 @@ -1652,7 +1652,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"))) ((-4403 -12 (|has| |#1| (-6 -4403)) (|has| |#2| (-6 -4403))) (-4410 . T) (-4411 . T) (-4413 . T)) ((-12 (|HasAttribute| |#1| (QUOTE -4403)) (|HasAttribute| |#2| (QUOTE -4403)))) -(-431 R -2111) +(-431 R -3944) ((|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 @@ -1662,17 +1662,17 @@ NIL ((|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| |#2| (QUOTE (-559))) (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-145))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-1050))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-476))) (|HasCategory| |#2| (QUOTE (-1112))) (|HasCategory| |#2| (LIST (QUOTE -615) (QUOTE (-539))))) (-433 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}."))) -((-4413 -2909 (|has| |#1| (-1050)) (|has| |#1| (-476))) (-4411 |has| |#1| (-172)) (-4410 |has| |#1| (-172)) ((-4418 "*") |has| |#1| (-559)) (-4409 |has| |#1| (-559)) (-4414 |has| |#1| (-559)) (-4408 |has| |#1| (-559))) +((-4413 -2871 (|has| |#1| (-1050)) (|has| |#1| (-476))) (-4411 |has| |#1| (-172)) (-4410 |has| |#1| (-172)) ((-4418 "*") |has| |#1| (-559)) (-4409 |has| |#1| (-559)) (-4414 |has| |#1| (-559)) (-4408 |has| |#1| (-559))) NIL -(-434 R -2111) +(-434 R -3944) ((|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 -(-435 R -2111) +(-435 R -3944) ((|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)))) -(-436 R -2111) +(-436 R -3944) ((|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 @@ -1680,7 +1680,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 -(-438 R -2111 UP) +(-438 R -3944 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 -1039) (QUOTE (-48))))) @@ -1712,7 +1712,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 -(-446 R UP -2111) +(-446 R UP -3944) ((|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 @@ -1759,7 +1759,7 @@ NIL (-457 |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"))) (((-4418 "*") |has| |#2| (-172)) (-4409 |has| |#2| (-559)) (-4414 |has| |#2| (-6 -4414)) (-4411 . T) (-4410 . T) (-4413 . T)) -((|HasCategory| |#2| (QUOTE (-910))) (-2909 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-455))) (|HasCategory| |#2| (QUOTE (-559))) (|HasCategory| |#2| (QUOTE (-910)))) (-2909 (|HasCategory| |#2| (QUOTE (-455))) (|HasCategory| |#2| (QUOTE (-559))) (|HasCategory| |#2| (QUOTE (-910)))) (-2909 (|HasCategory| |#2| (QUOTE (-455))) (|HasCategory| |#2| (QUOTE (-910)))) (|HasCategory| |#2| (QUOTE (-559))) (|HasCategory| |#2| (QUOTE (-172))) (-2909 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-559)))) (-12 (|HasCategory| (-865 |#1|) (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| |#2| (LIST (QUOTE -887) (QUOTE (-381))))) (-12 (|HasCategory| (-865 |#1|) (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -887) (QUOTE (-567))))) (-12 (|HasCategory| (-865 |#1|) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| |#2| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381)))))) (-12 (|HasCategory| (-865 |#1|) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567)))))) (-12 (|HasCategory| (-865 |#1|) (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#2| (LIST (QUOTE -615) (QUOTE (-539))))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-145))) (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567)))) (-2909 (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567)))))) (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-365))) (|HasAttribute| |#2| (QUOTE -4414)) (|HasCategory| |#2| (QUOTE (-455))) (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#2| (QUOTE (-910)))) (-2909 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#2| (QUOTE (-910)))) (|HasCategory| |#2| (QUOTE (-145))))) +((|HasCategory| |#2| (QUOTE (-910))) (-2871 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-455))) (|HasCategory| |#2| (QUOTE (-559))) (|HasCategory| |#2| (QUOTE (-910)))) (-2871 (|HasCategory| |#2| (QUOTE (-455))) (|HasCategory| |#2| (QUOTE (-559))) (|HasCategory| |#2| (QUOTE (-910)))) (-2871 (|HasCategory| |#2| (QUOTE (-455))) (|HasCategory| |#2| (QUOTE (-910)))) (|HasCategory| |#2| (QUOTE (-559))) (|HasCategory| |#2| (QUOTE (-172))) (-2871 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-559)))) (-12 (|HasCategory| (-865 |#1|) (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| |#2| (LIST (QUOTE -887) (QUOTE (-381))))) (-12 (|HasCategory| (-865 |#1|) (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -887) (QUOTE (-567))))) (-12 (|HasCategory| (-865 |#1|) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| |#2| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381)))))) (-12 (|HasCategory| (-865 |#1|) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567)))))) (-12 (|HasCategory| (-865 |#1|) (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#2| (LIST (QUOTE -615) (QUOTE (-539))))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-145))) (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567)))) (-2871 (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567)))))) (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-365))) (|HasAttribute| |#2| (QUOTE -4414)) (|HasCategory| |#2| (QUOTE (-455))) (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#2| (QUOTE (-910)))) (-2871 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#2| (QUOTE (-910)))) (|HasCategory| |#2| (QUOTE (-145))))) (-458 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 @@ -1824,7 +1824,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 -(-474 |lv| -2111 R) +(-474 |lv| -3944 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 @@ -1839,11 +1839,11 @@ NIL (-477 |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."))) (((-4418 "*") |has| |#1| (-172)) (-4409 |has| |#1| (-559)) (-4414 |has| |#1| (-365)) (-4408 |has| |#1| (-365)) (-4410 . T) (-4411 . T) (-4413 . T)) -((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-172))) (-2909 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559)))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-147))) (-12 (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -410) (QUOTE (-567))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -410) (QUOTE (-567))) (|devaluate| |#1|)))) (|HasCategory| (-410 (-567)) (QUOTE (-1112))) (|HasCategory| |#1| (QUOTE (-365))) (-2909 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-559)))) (-2909 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-559)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -410) (QUOTE (-567)))))) (|HasSignature| |#1| (LIST (QUOTE -4101) (LIST (|devaluate| |#1|) (QUOTE (-1176)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -410) (QUOTE (-567)))))) (-2909 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-960))) (|HasCategory| |#1| (QUOTE (-1201))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasSignature| |#1| (LIST (QUOTE -2113) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1176))))) (|HasSignature| |#1| (LIST (QUOTE -2449) (LIST (LIST (QUOTE -645) (QUOTE (-1176))) (|devaluate| |#1|))))))) +((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-172))) (-2871 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559)))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-147))) (-12 (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -410) (QUOTE (-567))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -410) (QUOTE (-567))) (|devaluate| |#1|)))) (|HasCategory| (-410 (-567)) (QUOTE (-1112))) (|HasCategory| |#1| (QUOTE (-365))) (-2871 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-559)))) (-2871 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-559)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -410) (QUOTE (-567)))))) (|HasSignature| |#1| (LIST (QUOTE -4130) (LIST (|devaluate| |#1|) (QUOTE (-1176)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -410) (QUOTE (-567)))))) (-2871 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-960))) (|HasCategory| |#1| (QUOTE (-1201))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasSignature| |#1| (LIST (QUOTE -3337) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1176))))) (|HasSignature| |#1| (LIST (QUOTE -2921) (LIST (LIST (QUOTE -645) (QUOTE (-1176))) (|devaluate| |#1|))))))) (-478 |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."))) ((-4417 . T)) -((-12 (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (QUOTE (-1100))) (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (LIST (QUOTE -310) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -1762) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3859) (|devaluate| |#2|)))))) (-2909 (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (QUOTE (-1100))) (|HasCategory| |#2| (QUOTE (-1100)))) (-2909 (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (QUOTE (-1100))) (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (LIST (QUOTE -615) (QUOTE (-539)))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (|HasCategory| |#1| (QUOTE (-851))) (-2909 (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (QUOTE (-1100)))) +((-12 (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (QUOTE (-1100))) (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (LIST (QUOTE -310) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -1812) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -4217) (|devaluate| |#2|)))))) (-2871 (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (QUOTE (-1100))) (|HasCategory| |#2| (QUOTE (-1100)))) (-2871 (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (QUOTE (-1100))) (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (LIST (QUOTE -615) (QUOTE (-539)))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (|HasCategory| |#1| (QUOTE (-851))) (-2871 (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (QUOTE (-1100)))) (-479 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)}"))) ((-4417 . T) (-4416 . T)) @@ -1859,7 +1859,7 @@ NIL (-482 |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."))) ((-4416 . T) (-4417 . T)) -((-12 (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (QUOTE (-1100))) (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (LIST (QUOTE -310) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -1762) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3859) (|devaluate| |#2|)))))) (-2909 (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (QUOTE (-1100))) (|HasCategory| |#2| (QUOTE (-1100)))) (-2909 (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (QUOTE (-1100))) (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (LIST (QUOTE -615) (QUOTE (-539)))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (QUOTE (-1100))) (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#2| (QUOTE (-1100))) (-2909 (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (LIST (QUOTE -614) (QUOTE (-863))))) +((-12 (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (QUOTE (-1100))) (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (LIST (QUOTE -310) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -1812) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -4217) (|devaluate| |#2|)))))) (-2871 (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (QUOTE (-1100))) (|HasCategory| |#2| (QUOTE (-1100)))) (-2871 (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (QUOTE (-1100))) (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (LIST (QUOTE -615) (QUOTE (-539)))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (QUOTE (-1100))) (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#2| (QUOTE (-1100))) (-2871 (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (LIST (QUOTE -614) (QUOTE (-863))))) (-483) ((|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 @@ -1867,11 +1867,11 @@ NIL (-484 |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"))) (((-4418 "*") |has| |#2| (-172)) (-4409 |has| |#2| (-559)) (-4414 |has| |#2| (-6 -4414)) (-4411 . T) (-4410 . T) (-4413 . T)) -((|HasCategory| |#2| (QUOTE (-910))) (-2909 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-455))) (|HasCategory| |#2| (QUOTE (-559))) (|HasCategory| |#2| (QUOTE (-910)))) (-2909 (|HasCategory| |#2| (QUOTE (-455))) (|HasCategory| |#2| (QUOTE (-559))) (|HasCategory| |#2| (QUOTE (-910)))) (-2909 (|HasCategory| |#2| (QUOTE (-455))) (|HasCategory| |#2| (QUOTE (-910)))) (|HasCategory| |#2| (QUOTE (-559))) (|HasCategory| |#2| (QUOTE (-172))) (-2909 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-559)))) (-12 (|HasCategory| (-865 |#1|) (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| |#2| (LIST (QUOTE -887) (QUOTE (-381))))) (-12 (|HasCategory| (-865 |#1|) (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -887) (QUOTE (-567))))) (-12 (|HasCategory| (-865 |#1|) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| |#2| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381)))))) (-12 (|HasCategory| (-865 |#1|) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567)))))) (-12 (|HasCategory| (-865 |#1|) (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#2| (LIST (QUOTE -615) (QUOTE (-539))))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-145))) (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567)))) (-2909 (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567)))))) (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-365))) (|HasAttribute| |#2| (QUOTE -4414)) (|HasCategory| |#2| (QUOTE (-455))) (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#2| (QUOTE (-910)))) (-2909 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#2| (QUOTE (-910)))) (|HasCategory| |#2| (QUOTE (-145))))) -(-485 -2189 S) +((|HasCategory| |#2| (QUOTE (-910))) (-2871 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-455))) (|HasCategory| |#2| (QUOTE (-559))) (|HasCategory| |#2| (QUOTE (-910)))) (-2871 (|HasCategory| |#2| (QUOTE (-455))) (|HasCategory| |#2| (QUOTE (-559))) (|HasCategory| |#2| (QUOTE (-910)))) (-2871 (|HasCategory| |#2| (QUOTE (-455))) (|HasCategory| |#2| (QUOTE (-910)))) (|HasCategory| |#2| (QUOTE (-559))) (|HasCategory| |#2| (QUOTE (-172))) (-2871 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-559)))) (-12 (|HasCategory| (-865 |#1|) (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| |#2| (LIST (QUOTE -887) (QUOTE (-381))))) (-12 (|HasCategory| (-865 |#1|) (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -887) (QUOTE (-567))))) (-12 (|HasCategory| (-865 |#1|) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| |#2| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381)))))) (-12 (|HasCategory| (-865 |#1|) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567)))))) (-12 (|HasCategory| (-865 |#1|) (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#2| (LIST (QUOTE -615) (QUOTE (-539))))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-145))) (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567)))) (-2871 (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567)))))) (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-365))) (|HasAttribute| |#2| (QUOTE -4414)) (|HasCategory| |#2| (QUOTE (-455))) (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#2| (QUOTE (-910)))) (-2871 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#2| (QUOTE (-910)))) (|HasCategory| |#2| (QUOTE (-145))))) +(-485 -2675 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}."))) ((-4410 |has| |#2| (-1050)) (-4411 |has| |#2| (-1050)) (-4413 |has| |#2| (-6 -4413)) ((-4418 "*") |has| |#2| (-172)) (-4416 . T)) -((-2909 (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-131))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-727))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-794))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-849))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1050))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))))) (-2909 (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-1100)))) (-12 (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (QUOTE (-1050)))) (-12 (|HasCategory| |#2| (QUOTE (-1050))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-1050))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176))))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#2| (QUOTE (-365))) (-2909 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-1050)))) (-2909 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-365)))) (|HasCategory| |#2| (QUOTE (-1050))) (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-794))) (-2909 (|HasCategory| |#2| (QUOTE (-794))) (|HasCategory| |#2| (QUOTE (-849)))) (|HasCategory| |#2| (QUOTE (-849))) (|HasCategory| |#2| (QUOTE (-727))) (-2909 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-1050)))) (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (-2909 (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-131))) (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-1050)))) (-2909 (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (QUOTE (-131))) (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-1050)))) (-2909 (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-1050)))) (-2909 (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (QUOTE (-1050)))) (|HasCategory| |#2| (QUOTE (-233))) (-2909 (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-131))) (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-727))) (|HasCategory| |#2| (QUOTE (-794))) (|HasCategory| |#2| (QUOTE (-849))) (|HasCategory| |#2| (QUOTE (-1050))) (|HasCategory| |#2| (QUOTE (-1100)))) (|HasCategory| |#2| (QUOTE (-1100))) (-2909 (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-25)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-131)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-172)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-233)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-365)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-370)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-727)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-794)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-849)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-1050)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-1100))))) (-2909 (-12 (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-131))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-727))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-794))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-849))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-1050))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567)))))) (-2909 (-12 (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-131))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-727))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-794))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-849))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-1050))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567)))))) (|HasCategory| (-567) (QUOTE (-851))) (-12 (|HasCategory| |#2| (QUOTE (-1050))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (QUOTE (-1050)))) (-12 (|HasCategory| |#2| (QUOTE (-1050))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176))))) (-2909 (|HasCategory| |#2| (QUOTE (-1050))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567)))))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-1100)))) (|HasAttribute| |#2| (QUOTE -4413)) (|HasCategory| |#2| (QUOTE (-131))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|))))) +((-2871 (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-131))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-727))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-794))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-849))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1050))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))))) (-2871 (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-1100)))) (-12 (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (QUOTE (-1050)))) (-12 (|HasCategory| |#2| (QUOTE (-1050))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-1050))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176))))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#2| (QUOTE (-365))) (-2871 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-1050)))) (-2871 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-365)))) (|HasCategory| |#2| (QUOTE (-1050))) (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-794))) (-2871 (|HasCategory| |#2| (QUOTE (-794))) (|HasCategory| |#2| (QUOTE (-849)))) (|HasCategory| |#2| (QUOTE (-849))) (|HasCategory| |#2| (QUOTE (-727))) (-2871 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-1050)))) (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (-2871 (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-131))) (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-1050)))) (-2871 (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (QUOTE (-131))) (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-1050)))) (-2871 (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-1050)))) (-2871 (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (QUOTE (-1050)))) (|HasCategory| |#2| (QUOTE (-233))) (-2871 (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-131))) (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-727))) (|HasCategory| |#2| (QUOTE (-794))) (|HasCategory| |#2| (QUOTE (-849))) (|HasCategory| |#2| (QUOTE (-1050))) (|HasCategory| |#2| (QUOTE (-1100)))) (|HasCategory| |#2| (QUOTE (-1100))) (-2871 (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-25)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-131)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-172)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-233)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-365)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-370)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-727)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-794)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-849)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-1050)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-1100))))) (-2871 (-12 (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-131))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-727))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-794))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-849))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-1050))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567)))))) (-2871 (-12 (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-131))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-727))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-794))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-849))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-1050))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567)))))) (|HasCategory| (-567) (QUOTE (-851))) (-12 (|HasCategory| |#2| (QUOTE (-1050))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (QUOTE (-1050)))) (-12 (|HasCategory| |#2| (QUOTE (-1050))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176))))) (-2871 (|HasCategory| |#2| (QUOTE (-1050))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567)))))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-1100)))) (|HasAttribute| |#2| (QUOTE -4413)) (|HasCategory| |#2| (QUOTE (-131))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|))))) (-486) ((|constructor| (NIL "This domain represents the header of a definition.")) (|parameters| (((|List| (|Identifier|)) $) "\\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| (|Identifier|))) "\\spad{headAst(f,[x1,..,xn])} constructs a function definition header."))) NIL @@ -1879,8 +1879,8 @@ NIL (-487 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}."))) ((-4416 . T) (-4417 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1100))) (-2909 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) -(-488 -2111 UP UPUP R) +((-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1100))) (-2871 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) +(-488 -3944 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 @@ -1891,7 +1891,7 @@ NIL (-490) ((|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."))) ((-4408 . T) (-4414 . T) (-4409 . T) ((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) -((|HasCategory| (-567) (QUOTE (-910))) (|HasCategory| (-567) (LIST (QUOTE -1039) (QUOTE (-1176)))) (|HasCategory| (-567) (QUOTE (-145))) (|HasCategory| (-567) (QUOTE (-147))) (|HasCategory| (-567) (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| (-567) (QUOTE (-1023))) (|HasCategory| (-567) (QUOTE (-821))) (-2909 (|HasCategory| (-567) (QUOTE (-821))) (|HasCategory| (-567) (QUOTE (-851)))) (|HasCategory| (-567) (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| (-567) (QUOTE (-1151))) (|HasCategory| (-567) (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| (-567) (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| (-567) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| (-567) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| (-567) (QUOTE (-233))) (|HasCategory| (-567) (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| (-567) (LIST (QUOTE -517) (QUOTE (-1176)) (QUOTE (-567)))) (|HasCategory| (-567) (LIST (QUOTE -310) (QUOTE (-567)))) (|HasCategory| (-567) (LIST (QUOTE -287) (QUOTE (-567)) (QUOTE (-567)))) (|HasCategory| (-567) (QUOTE (-308))) (|HasCategory| (-567) (QUOTE (-548))) (|HasCategory| (-567) (QUOTE (-851))) (|HasCategory| (-567) (LIST (QUOTE -640) (QUOTE (-567)))) (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| (-567) (QUOTE (-910)))) (-2909 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| (-567) (QUOTE (-910)))) (|HasCategory| (-567) (QUOTE (-145))))) +((|HasCategory| (-567) (QUOTE (-910))) (|HasCategory| (-567) (LIST (QUOTE -1039) (QUOTE (-1176)))) (|HasCategory| (-567) (QUOTE (-145))) (|HasCategory| (-567) (QUOTE (-147))) (|HasCategory| (-567) (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| (-567) (QUOTE (-1023))) (|HasCategory| (-567) (QUOTE (-821))) (-2871 (|HasCategory| (-567) (QUOTE (-821))) (|HasCategory| (-567) (QUOTE (-851)))) (|HasCategory| (-567) (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| (-567) (QUOTE (-1151))) (|HasCategory| (-567) (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| (-567) (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| (-567) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| (-567) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| (-567) (QUOTE (-233))) (|HasCategory| (-567) (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| (-567) (LIST (QUOTE -517) (QUOTE (-1176)) (QUOTE (-567)))) (|HasCategory| (-567) (LIST (QUOTE -310) (QUOTE (-567)))) (|HasCategory| (-567) (LIST (QUOTE -287) (QUOTE (-567)) (QUOTE (-567)))) (|HasCategory| (-567) (QUOTE (-308))) (|HasCategory| (-567) (QUOTE (-548))) (|HasCategory| (-567) (QUOTE (-851))) (|HasCategory| (-567) (LIST (QUOTE -640) (QUOTE (-567)))) (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| (-567) (QUOTE (-910)))) (-2871 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| (-567) (QUOTE (-910)))) (|HasCategory| (-567) (QUOTE (-145))))) (-491 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 @@ -1916,7 +1916,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 -(-497 -2111 UP |AlExt| |AlPol|) +(-497 -3944 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 @@ -1927,16 +1927,16 @@ NIL (-499 S |mn|) ((|constructor| (NIL "\\indented{1}{Author Micheal Monagan Aug/87} This is the basic one dimensional array data type."))) ((-4417 . T) (-4416 . T)) -((-2909 (-12 (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) (-2909 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539)))) (-2909 (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-1100)))) (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| (-567) (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) +((-2871 (-12 (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) (-2871 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539)))) (-2871 (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-1100)))) (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| (-567) (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) (-500 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."))) ((-4416 . T) (-4417 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1100))) (-2909 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) +((-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1100))) (-2871 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (-501 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 -(-502 R UP -2111) +(-502 R UP -3944) ((|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 @@ -1956,7 +1956,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 -(-507 -2111 |Expon| |VarSet| |DPoly|) +(-507 -3944 |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 -615) (QUOTE (-1176))))) @@ -2007,7 +2007,7 @@ NIL (-519 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}"))) ((-4417 . T) (-4416 . T)) -((-2909 (-12 (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) (-2909 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539)))) (-2909 (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-1100)))) (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| (-567) (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) +((-2871 (-12 (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) (-2871 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539)))) (-2871 (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-1100)))) (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| (-567) (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) (-520) ((|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 @@ -2015,15 +2015,15 @@ NIL (-521 |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}."))) ((-4408 . T) (-4414 . T) (-4409 . T) ((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) -((-2909 (|HasCategory| (-584 |#1|) (QUOTE (-145))) (|HasCategory| (-584 |#1|) (QUOTE (-370)))) (|HasCategory| (-584 |#1|) (QUOTE (-147))) (|HasCategory| (-584 |#1|) (QUOTE (-370))) (|HasCategory| (-584 |#1|) (QUOTE (-145)))) +((-2871 (|HasCategory| (-584 |#1|) (QUOTE (-145))) (|HasCategory| (-584 |#1|) (QUOTE (-370)))) (|HasCategory| (-584 |#1|) (QUOTE (-147))) (|HasCategory| (-584 |#1|) (QUOTE (-370))) (|HasCategory| (-584 |#1|) (QUOTE (-145)))) (-522 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}."))) ((-4416 . T) (-4417 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1100))) (-2909 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) +((-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1100))) (-2871 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (-523 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."))) ((-4417 . T) (-4416 . T)) -((-2909 (-12 (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) (-2909 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539)))) (-2909 (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-1100)))) (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| (-567) (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) +((-2871 (-12 (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) (-2871 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539)))) (-2871 (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-1100)))) (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| (-567) (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) (-524 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 @@ -2035,7 +2035,7 @@ NIL (-526 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."))) ((-4416 . T) (-4417 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1100))) (-2909 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (QUOTE (-308))) (|HasCategory| |#1| (QUOTE (-559))) (|HasAttribute| |#1| (QUOTE (-4418 "*"))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) +((-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1100))) (-2871 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (QUOTE (-308))) (|HasCategory| |#1| (QUOTE (-559))) (|HasAttribute| |#1| (QUOTE (-4418 "*"))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (-527) ((|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 @@ -2068,7 +2068,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 -(-535 K -2111 |Par|) +(-535 K -3944 |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 @@ -2092,7 +2092,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 -(-541 K -2111 |Par|) +(-541 K -3944 |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 @@ -2143,12 +2143,12 @@ NIL (-553 |Key| |Entry| |addDom|) ((|constructor| (NIL "This domain is used to provide a conditional \"add\" domain for the implementation of \\spadtype{Table}."))) ((-4416 . T) (-4417 . T)) -((-12 (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (QUOTE (-1100))) (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (LIST (QUOTE -310) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -1762) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3859) (|devaluate| |#2|)))))) (-2909 (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (QUOTE (-1100))) (|HasCategory| |#2| (QUOTE (-1100)))) (-2909 (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (QUOTE (-1100))) (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (LIST (QUOTE -615) (QUOTE (-539)))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (QUOTE (-1100))) (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#2| (QUOTE (-1100))) (-2909 (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (LIST (QUOTE -614) (QUOTE (-863))))) -(-554 R -2111) +((-12 (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (QUOTE (-1100))) (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (LIST (QUOTE -310) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -1812) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -4217) (|devaluate| |#2|)))))) (-2871 (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (QUOTE (-1100))) (|HasCategory| |#2| (QUOTE (-1100)))) (-2871 (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (QUOTE (-1100))) (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (LIST (QUOTE -615) (QUOTE (-539)))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (QUOTE (-1100))) (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#2| (QUOTE (-1100))) (-2871 (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (LIST (QUOTE -614) (QUOTE (-863))))) +(-554 R -3944) ((|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 -(-555 R0 -2111 UP UPUP R) +(-555 R0 -3944 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 @@ -2158,7 +2158,7 @@ NIL NIL (-557 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."))) -((-2927 . T) (-4409 . T) ((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) +((-3112 . T) (-4409 . T) ((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) NIL (-558 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."))) @@ -2168,7 +2168,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."))) ((-4409 . T) ((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) NIL -(-560 R -2111) +(-560 R -3944) ((|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 @@ -2180,7 +2180,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 -(-563 R -2111 L) +(-563 R -3944 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 -657) (|devaluate| |#2|)))) @@ -2188,11 +2188,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 -(-565 -2111 UP UPUP R) +(-565 -3944 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 -(-566 -2111 UP) +(-566 -3944 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 @@ -2204,15 +2204,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 -(-569 R -2111 L) +(-569 R -3944 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 -657) (|devaluate| |#2|)))) -(-570 R -2111) +(-570 R -3944) ((|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 -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| |#2| (QUOTE (-1139)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| |#2| (QUOTE (-630))))) -(-571 -2111 UP) +(-571 -3944 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 @@ -2220,27 +2220,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 -(-573 -2111) +(-573 -3944) ((|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 (-574 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."))) -((-2927 . T) (-4409 . T) ((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) +((-3112 . T) (-4409 . T) ((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) NIL (-575) ((|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 -(-576 R -2111) +(-576 R -3944) ((|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 -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| |#2| (QUOTE (-285))) (|HasCategory| |#2| (QUOTE (-630))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-1176))))) (-12 (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#2| (QUOTE (-285)))) (|HasCategory| |#1| (QUOTE (-559)))) -(-577 -2111 UP) +(-577 -3944 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 -(-578 R -2111) +(-578 R -3944) ((|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 @@ -2272,15 +2272,15 @@ NIL ((|constructor| (NIL "A package to print strings without line-feed nor carriage-return.")) (|iprint| (((|Void|) (|String|)) "\\axiom{iprint(\\spad{s})} prints \\axiom{\\spad{s}} at the current position of the cursor."))) NIL NIL -(-586 R -2111) +(-586 R -3944) ((|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 -(-587 E -2111) +(-587 E -3944) ((|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 -(-588 -2111) +(-588 -3944) ((|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}."))) ((-4411 . T) (-4410 . T)) ((|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-1176))))) @@ -2309,9 +2309,9 @@ NIL NIL NIL (-595 |mn|) -((|constructor| (NIL "This domain implements low-level strings")) (|hash| (((|Integer|) $) "\\spad{hash(x)} provides a hashing function for strings"))) +((|constructor| (NIL "This domain implements low-level strings"))) ((-4417 . T) (-4416 . T)) -((-2909 (-12 (|HasCategory| (-144) (QUOTE (-851))) (|HasCategory| (-144) (LIST (QUOTE -310) (QUOTE (-144))))) (-12 (|HasCategory| (-144) (QUOTE (-1100))) (|HasCategory| (-144) (LIST (QUOTE -310) (QUOTE (-144)))))) (-2909 (|HasCategory| (-144) (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| (-144) (QUOTE (-1100))) (|HasCategory| (-144) (LIST (QUOTE -310) (QUOTE (-144)))))) (|HasCategory| (-144) (LIST (QUOTE -615) (QUOTE (-539)))) (-2909 (|HasCategory| (-144) (QUOTE (-851))) (|HasCategory| (-144) (QUOTE (-1100)))) (|HasCategory| (-144) (QUOTE (-851))) (|HasCategory| (-567) (QUOTE (-851))) (|HasCategory| (-144) (QUOTE (-1100))) (|HasCategory| (-144) (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| (-144) (QUOTE (-1100))) (|HasCategory| (-144) (LIST (QUOTE -310) (QUOTE (-144)))))) +((-2871 (-12 (|HasCategory| (-144) (QUOTE (-851))) (|HasCategory| (-144) (LIST (QUOTE -310) (QUOTE (-144))))) (-12 (|HasCategory| (-144) (QUOTE (-1100))) (|HasCategory| (-144) (LIST (QUOTE -310) (QUOTE (-144)))))) (-2871 (|HasCategory| (-144) (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| (-144) (QUOTE (-1100))) (|HasCategory| (-144) (LIST (QUOTE -310) (QUOTE (-144)))))) (|HasCategory| (-144) (LIST (QUOTE -615) (QUOTE (-539)))) (-2871 (|HasCategory| (-144) (QUOTE (-851))) (|HasCategory| (-144) (QUOTE (-1100)))) (|HasCategory| (-144) (QUOTE (-851))) (|HasCategory| (-567) (QUOTE (-851))) (|HasCategory| (-144) (QUOTE (-1100))) (|HasCategory| (-144) (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| (-144) (QUOTE (-1100))) (|HasCategory| (-144) (LIST (QUOTE -310) (QUOTE (-144)))))) (-596 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 @@ -2319,10 +2319,10 @@ NIL (-597 |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}."))) (((-4418 "*") |has| |#1| (-172)) (-4409 |has| |#1| (-559)) (-4410 . T) (-4411 . T) (-4413 . T)) -((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-559))) (-2909 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559)))) (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-147))) (-12 (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-567)) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-567)) (|devaluate| |#1|)))) (|HasCategory| (-567) (QUOTE (-1112))) (|HasCategory| |#1| (QUOTE (-365))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-567))))) (|HasSignature| |#1| (LIST (QUOTE -4101) (LIST (|devaluate| |#1|) (QUOTE (-1176)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-567)))))) +((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-559))) (-2871 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559)))) (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-147))) (-12 (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-567)) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-567)) (|devaluate| |#1|)))) (|HasCategory| (-567) (QUOTE (-1112))) (|HasCategory| |#1| (QUOTE (-365))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-567))))) (|HasSignature| |#1| (LIST (QUOTE -4130) (LIST (|devaluate| |#1|) (QUOTE (-1176)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-567)))))) (-598 |Coef|) -((|constructor| (NIL "Internal package for dense Taylor series. This is an internal Taylor series type in which Taylor series are represented by a \\spadtype{Stream} of \\spadtype{Ring} elements. For univariate series,{} the \\spad{Stream} elements are the Taylor coefficients. For multivariate series,{} the \\spad{n}th Stream element is a form of degree \\spad{n} in the power series variables.")) (* (($ $ (|Integer|)) "\\spad{x*i} returns the product of integer \\spad{i} and the series \\spad{x}.") (($ $ |#1|) "\\spad{x*c} returns the product of \\spad{c} and the series \\spad{x}.") (($ |#1| $) "\\spad{c*x} returns the product of \\spad{c} and the series \\spad{x}.")) (|order| (((|NonNegativeInteger|) $ (|NonNegativeInteger|)) "\\spad{order(x,n)} returns the minimum of \\spad{n} and the order of \\spad{x}.") (((|NonNegativeInteger|) $) "\\spad{order(x)} returns the order of a power series \\spad{x},{} \\indented{1}{\\spadignore{i.e.} the degree of the first non-zero term of the series.}")) (|pole?| (((|Boolean|) $) "\\spad{pole?(x)} tests if the series \\spad{x} has a pole. \\indented{1}{Note: this is \\spad{false} when \\spad{x} is a Taylor series.}")) (|series| (($ (|Stream| |#1|)) "\\spad{series(s)} creates a power series from a stream of \\indented{1}{ring elements.} \\indented{1}{For univariate series types,{} the stream \\spad{s} should be a stream} \\indented{1}{of Taylor coefficients. For multivariate series types,{} the} \\indented{1}{stream \\spad{s} should be a stream of forms the \\spad{n}th element} \\indented{1}{of which is a} \\indented{1}{form of degree \\spad{n} in the power series variables.}")) (|coefficients| (((|Stream| |#1|) $) "\\spad{coefficients(x)} returns a stream of ring elements. \\indented{1}{When \\spad{x} is a univariate series,{} this is a stream of Taylor} \\indented{1}{coefficients. When \\spad{x} is a multivariate series,{} the} \\indented{1}{\\spad{n}th element of the stream is a form of} \\indented{1}{degree \\spad{n} in the power series variables.}"))) -((-4411 |has| |#1| (-559)) (-4410 |has| |#1| (-559)) ((-4418 "*") |has| |#1| (-559)) (-4409 |has| |#1| (-559)) (-4413 . T)) +((|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.}"))) +(((-4418 "*") |has| |#1| (-559)) (-4409 |has| |#1| (-559)) (-4410 . T) (-4411 . T) (-4413 . T)) ((|HasCategory| |#1| (QUOTE (-559)))) (-599 A B) ((|constructor| (NIL "Functions defined on streams with entries in two sets.")) (|map| (((|InfiniteTuple| |#2|) (|Mapping| |#2| |#1|) (|InfiniteTuple| |#1|)) "\\spad{map(f,[x0,x1,x2,...])} returns \\spad{[f(x0),f(x1),f(x2),..]}."))) @@ -2332,7 +2332,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 -(-601 R -2111 FG) +(-601 R -3944 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 @@ -2343,7 +2343,7 @@ NIL (-603 R |mn|) ((|constructor| (NIL "\\indented{2}{This type represents vector like objects with varying lengths} and a user-specified initial index."))) ((-4417 . T) (-4416 . T)) -((-2909 (-12 (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) (-2909 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539)))) (-2909 (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-1100)))) (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| (-567) (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-727))) (|HasCategory| |#1| (QUOTE (-1050))) (-12 (|HasCategory| |#1| (QUOTE (-1003))) (|HasCategory| |#1| (QUOTE (-1050)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) +((-2871 (-12 (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) (-2871 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539)))) (-2871 (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-1100)))) (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| (-567) (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-727))) (|HasCategory| |#1| (QUOTE (-1050))) (-12 (|HasCategory| |#1| (QUOTE (-1003))) (|HasCategory| |#1| (QUOTE (-1050)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) (-604 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 @@ -2362,12 +2362,12 @@ NIL NIL (-608 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)."))) -((-4413 -2909 (-1410 (|has| |#2| (-369 |#1|)) (|has| |#1| (-559))) (-12 (|has| |#2| (-420 |#1|)) (|has| |#1| (-559)))) (-4411 . T) (-4410 . T)) -((-2909 (|HasCategory| |#2| (LIST (QUOTE -369) (|devaluate| |#1|))) (|HasCategory| |#2| (LIST (QUOTE -420) (|devaluate| |#1|)))) (|HasCategory| |#2| (LIST (QUOTE -420) (|devaluate| |#1|))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -420) (|devaluate| |#1|)))) (-2909 (-12 (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#2| (LIST (QUOTE -369) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#2| (LIST (QUOTE -420) (|devaluate| |#1|))))) (|HasCategory| |#2| (LIST (QUOTE -369) (|devaluate| |#1|)))) +((-4413 -2871 (-1692 (|has| |#2| (-369 |#1|)) (|has| |#1| (-559))) (-12 (|has| |#2| (-420 |#1|)) (|has| |#1| (-559)))) (-4411 . T) (-4410 . T)) +((-2871 (|HasCategory| |#2| (LIST (QUOTE -369) (|devaluate| |#1|))) (|HasCategory| |#2| (LIST (QUOTE -420) (|devaluate| |#1|)))) (|HasCategory| |#2| (LIST (QUOTE -420) (|devaluate| |#1|))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -420) (|devaluate| |#1|)))) (-2871 (-12 (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#2| (LIST (QUOTE -369) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#2| (LIST (QUOTE -420) (|devaluate| |#1|))))) (|HasCategory| |#2| (LIST (QUOTE -369) (|devaluate| |#1|)))) (-609 |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."))) ((-4416 . T) (-4417 . T)) -((-12 (|HasCategory| (-2 (|:| -1762 (-1158)) (|:| -3859 |#1|)) (QUOTE (-1100))) (|HasCategory| (-2 (|:| -1762 (-1158)) (|:| -3859 |#1|)) (LIST (QUOTE -310) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -1762) (QUOTE (-1158))) (LIST (QUOTE |:|) (QUOTE -3859) (|devaluate| |#1|)))))) (|HasCategory| (-2 (|:| -1762 (-1158)) (|:| -3859 |#1|)) (LIST (QUOTE -615) (QUOTE (-539)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| (-1158) (QUOTE (-851))) (|HasCategory| (-2 (|:| -1762 (-1158)) (|:| -3859 |#1|)) (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| (-2 (|:| -1762 (-1158)) (|:| -3859 |#1|)) (LIST (QUOTE -614) (QUOTE (-863))))) +((-12 (|HasCategory| (-2 (|:| -1812 (-1158)) (|:| -4217 |#1|)) (QUOTE (-1100))) (|HasCategory| (-2 (|:| -1812 (-1158)) (|:| -4217 |#1|)) (LIST (QUOTE -310) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -1812) (QUOTE (-1158))) (LIST (QUOTE |:|) (QUOTE -4217) (|devaluate| |#1|)))))) (|HasCategory| (-2 (|:| -1812 (-1158)) (|:| -4217 |#1|)) (LIST (QUOTE -615) (QUOTE (-539)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| (-1158) (QUOTE (-851))) (|HasCategory| (-2 (|:| -1812 (-1158)) (|:| -4217 |#1|)) (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| (-2 (|:| -1812 (-1158)) (|:| -4217 |#1|)) (LIST (QUOTE -614) (QUOTE (-863))))) (-610 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 @@ -2392,7 +2392,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 -(-616 -2111 UP) +(-616 -3944 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 @@ -2420,7 +2420,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}."))) ((-4410 . T) (-4411 . T) (-4413 . T)) ((|HasCategory| |#1| (QUOTE (-849)))) -(-623 R -2111) +(-623 R -3944) ((|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 @@ -2452,18 +2452,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 -(-631 R -2111) +(-631 R -3944) ((|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 -(-632 |lv| -2111) +(-632 |lv| -3944) ((|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 (-633) ((|constructor| (NIL "This domain provides a simple way to save values in files.")) (|setelt| (((|Any|) $ (|Symbol|) (|Any|)) "\\spad{lib.k := v} saves the value \\spad{v} in the library \\spad{lib}. It can later be extracted using the key \\spad{k}.")) (|elt| (((|Any|) $ (|Symbol|)) "\\spad{elt(lib,k)} or \\spad{lib}.\\spad{k} extracts the value corresponding to the key \\spad{k} from the library \\spad{lib}.")) (|pack!| (($ $) "\\spad{pack!(f)} reorganizes the file \\spad{f} on disk to recover unused space.")) (|library| (($ (|FileName|)) "\\spad{library(ln)} creates a new library file."))) ((-4417 . T)) -((-12 (|HasCategory| (-2 (|:| -1762 (-1158)) (|:| -3859 (-52))) (QUOTE (-1100))) (|HasCategory| (-2 (|:| -1762 (-1158)) (|:| -3859 (-52))) (LIST (QUOTE -310) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -1762) (QUOTE (-1158))) (LIST (QUOTE |:|) (QUOTE -3859) (QUOTE (-52))))))) (-2909 (|HasCategory| (-2 (|:| -1762 (-1158)) (|:| -3859 (-52))) (QUOTE (-1100))) (|HasCategory| (-52) (QUOTE (-1100)))) (-2909 (|HasCategory| (-2 (|:| -1762 (-1158)) (|:| -3859 (-52))) (QUOTE (-1100))) (|HasCategory| (-2 (|:| -1762 (-1158)) (|:| -3859 (-52))) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| (-52) (QUOTE (-1100))) (|HasCategory| (-52) (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| (-2 (|:| -1762 (-1158)) (|:| -3859 (-52))) (LIST (QUOTE -615) (QUOTE (-539)))) (-12 (|HasCategory| (-52) (QUOTE (-1100))) (|HasCategory| (-52) (LIST (QUOTE -310) (QUOTE (-52))))) (|HasCategory| (-1158) (QUOTE (-851))) (-2909 (|HasCategory| (-2 (|:| -1762 (-1158)) (|:| -3859 (-52))) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| (-52) (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| (-52) (QUOTE (-1100))) (|HasCategory| (-52) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| (-2 (|:| -1762 (-1158)) (|:| -3859 (-52))) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| (-2 (|:| -1762 (-1158)) (|:| -3859 (-52))) (QUOTE (-1100)))) +((-12 (|HasCategory| (-2 (|:| -1812 (-1158)) (|:| -4217 (-52))) (QUOTE (-1100))) (|HasCategory| (-2 (|:| -1812 (-1158)) (|:| -4217 (-52))) (LIST (QUOTE -310) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -1812) (QUOTE (-1158))) (LIST (QUOTE |:|) (QUOTE -4217) (QUOTE (-52))))))) (-2871 (|HasCategory| (-2 (|:| -1812 (-1158)) (|:| -4217 (-52))) (QUOTE (-1100))) (|HasCategory| (-52) (QUOTE (-1100)))) (-2871 (|HasCategory| (-2 (|:| -1812 (-1158)) (|:| -4217 (-52))) (QUOTE (-1100))) (|HasCategory| (-2 (|:| -1812 (-1158)) (|:| -4217 (-52))) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| (-52) (QUOTE (-1100))) (|HasCategory| (-52) (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| (-2 (|:| -1812 (-1158)) (|:| -4217 (-52))) (LIST (QUOTE -615) (QUOTE (-539)))) (-12 (|HasCategory| (-52) (QUOTE (-1100))) (|HasCategory| (-52) (LIST (QUOTE -310) (QUOTE (-52))))) (|HasCategory| (-1158) (QUOTE (-851))) (-2871 (|HasCategory| (-2 (|:| -1812 (-1158)) (|:| -4217 (-52))) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| (-52) (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| (-52) (QUOTE (-1100))) (|HasCategory| (-52) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| (-2 (|:| -1812 (-1158)) (|:| -4217 (-52))) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| (-2 (|:| -1812 (-1158)) (|:| -4217 (-52))) (QUOTE (-1100)))) (-634 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 @@ -2474,8 +2474,8 @@ NIL NIL (-636 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)."))) -((-4413 -2909 (-1410 (|has| |#2| (-369 |#1|)) (|has| |#1| (-559))) (-12 (|has| |#2| (-420 |#1|)) (|has| |#1| (-559)))) (-4411 . T) (-4410 . T)) -((-2909 (|HasCategory| |#2| (LIST (QUOTE -369) (|devaluate| |#1|))) (|HasCategory| |#2| (LIST (QUOTE -420) (|devaluate| |#1|)))) (|HasCategory| |#2| (LIST (QUOTE -420) (|devaluate| |#1|))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -420) (|devaluate| |#1|)))) (-2909 (-12 (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#2| (LIST (QUOTE -369) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#2| (LIST (QUOTE -420) (|devaluate| |#1|))))) (|HasCategory| |#2| (LIST (QUOTE -369) (|devaluate| |#1|)))) +((-4413 -2871 (-1692 (|has| |#2| (-369 |#1|)) (|has| |#1| (-559))) (-12 (|has| |#2| (-420 |#1|)) (|has| |#1| (-559)))) (-4411 . T) (-4410 . T)) +((-2871 (|HasCategory| |#2| (LIST (QUOTE -369) (|devaluate| |#1|))) (|HasCategory| |#2| (LIST (QUOTE -420) (|devaluate| |#1|)))) (|HasCategory| |#2| (LIST (QUOTE -420) (|devaluate| |#1|))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -420) (|devaluate| |#1|)))) (-2871 (-12 (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#2| (LIST (QUOTE -369) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#2| (LIST (QUOTE -420) (|devaluate| |#1|))))) (|HasCategory| |#2| (LIST (QUOTE -369) (|devaluate| |#1|)))) (-637 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 @@ -2487,7 +2487,7 @@ NIL (-639 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 -((-1397 (|HasCategory| |#1| (QUOTE (-365)))) (|HasCategory| |#1| (QUOTE (-365)))) +((-1683 (|HasCategory| |#1| (QUOTE (-365)))) (|HasCategory| |#1| (QUOTE (-365)))) (-640 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}."))) ((-4413 . T)) @@ -2511,7 +2511,7 @@ NIL (-645 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."))) ((-4417 . T) (-4416 . T)) -((-2909 (-12 (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) (-2909 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539)))) (-2909 (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-1100)))) (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-829))) (|HasCategory| (-567) (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) +((-2871 (-12 (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) (-2871 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539)))) (-2871 (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-1100)))) (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-829))) (|HasCategory| (-567) (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) (-646 T$) ((|constructor| (NIL "This domain represents AST for Spad literals."))) NIL @@ -2523,7 +2523,7 @@ NIL (-648 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."))) ((-4416 . T) (-4417 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1100))) (-2909 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) +((-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1100))) (-2871 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (-649 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 @@ -2540,7 +2540,7 @@ NIL ((|constructor| (NIL "A linear aggregate is an aggregate whose elements are indexed by integers. Examples of linear aggregates are strings,{} lists,{} and arrays. Most of the exported operations for linear aggregates are non-destructive but are not always efficient for a particular aggregate. For example,{} \\spadfun{concat} of two lists needs only to copy its first argument,{} whereas \\spadfun{concat} of two arrays needs to copy both arguments. Most of the operations exported here apply to infinite objects (\\spadignore{e.g.} streams) as well to finite ones. For finite linear aggregates,{} see \\spadtype{FiniteLinearAggregate}.")) (|setelt| ((|#1| $ (|UniversalSegment| (|Integer|)) |#1|) "\\spad{setelt(u,i..j,x)} (also written: \\axiom{\\spad{u}(\\spad{i}..\\spad{j}) \\spad{:=} \\spad{x}}) destructively replaces each element in the segment \\axiom{\\spad{u}(\\spad{i}..\\spad{j})} by \\spad{x}. The value \\spad{x} is returned. Note: \\spad{u} is destructively change so that \\axiom{\\spad{u}.\\spad{k} \\spad{:=} \\spad{x} for \\spad{k} in \\spad{i}..\\spad{j}}; its length remains unchanged.")) (|insert| (($ $ $ (|Integer|)) "\\spad{insert(v,u,k)} returns a copy of \\spad{u} having \\spad{v} inserted beginning at the \\axiom{\\spad{i}}th element. Note: \\axiom{insert(\\spad{v},{}\\spad{u},{}\\spad{k}) = concat( \\spad{u}(0..\\spad{k}-1),{} \\spad{v},{} \\spad{u}(\\spad{k}..) )}.") (($ |#1| $ (|Integer|)) "\\spad{insert(x,u,i)} returns a copy of \\spad{u} having \\spad{x} as its \\axiom{\\spad{i}}th element. Note: \\axiom{insert(\\spad{x},{}a,{}\\spad{k}) = concat(concat(a(0..\\spad{k}-1),{}\\spad{x}),{}a(\\spad{k}..))}.")) (|delete| (($ $ (|UniversalSegment| (|Integer|))) "\\spad{delete(u,i..j)} returns a copy of \\spad{u} with the \\axiom{\\spad{i}}th through \\axiom{\\spad{j}}th element deleted. Note: \\axiom{delete(a,{}\\spad{i}..\\spad{j}) = concat(a(0..\\spad{i}-1),{}a(\\spad{j+1}..))}.") (($ $ (|Integer|)) "\\spad{delete(u,i)} returns a copy of \\spad{u} with the \\axiom{\\spad{i}}th element deleted. Note: for lists,{} \\axiom{delete(a,{}\\spad{i}) \\spad{==} concat(a(0..\\spad{i} - 1),{}a(\\spad{i} + 1,{}..))}.")) (|elt| (($ $ (|UniversalSegment| (|Integer|))) "\\spad{elt(u,i..j)} (also written: \\axiom{a(\\spad{i}..\\spad{j})}) returns the aggregate of elements \\axiom{\\spad{u}} for \\spad{k} from \\spad{i} to \\spad{j} in that order. Note: in general,{} \\axiom{a.\\spad{s} = [a.\\spad{k} for \\spad{i} in \\spad{s}]}.")) (|map| (($ (|Mapping| |#1| |#1| |#1|) $ $) "\\spad{map(f,u,v)} returns a new collection \\spad{w} with elements \\axiom{\\spad{z} = \\spad{f}(\\spad{x},{}\\spad{y})} for corresponding elements \\spad{x} and \\spad{y} from \\spad{u} and \\spad{v}. Note: for linear aggregates,{} \\axiom{\\spad{w}.\\spad{i} = \\spad{f}(\\spad{u}.\\spad{i},{}\\spad{v}.\\spad{i})}.")) (|concat| (($ (|List| $)) "\\spad{concat(u)},{} where \\spad{u} is a lists of aggregates \\axiom{[a,{}\\spad{b},{}...,{}\\spad{c}]},{} returns a single aggregate consisting of the elements of \\axiom{a} followed by those of \\spad{b} followed ... by the elements of \\spad{c}. Note: \\axiom{concat(a,{}\\spad{b},{}...,{}\\spad{c}) = concat(a,{}concat(\\spad{b},{}...,{}\\spad{c}))}.") (($ $ $) "\\spad{concat(u,v)} returns an aggregate consisting of the elements of \\spad{u} followed by the elements of \\spad{v}. Note: if \\axiom{\\spad{w} = concat(\\spad{u},{}\\spad{v})} then \\axiom{\\spad{w}.\\spad{i} = \\spad{u}.\\spad{i} for \\spad{i} in indices \\spad{u}} and \\axiom{\\spad{w}.(\\spad{j} + maxIndex \\spad{u}) = \\spad{v}.\\spad{j} for \\spad{j} in indices \\spad{v}}.") (($ |#1| $) "\\spad{concat(x,u)} returns aggregate \\spad{u} with additional element at the front. Note: for lists: \\axiom{concat(\\spad{x},{}\\spad{u}) \\spad{==} concat([\\spad{x}],{}\\spad{u})}.") (($ $ |#1|) "\\spad{concat(u,x)} returns aggregate \\spad{u} with additional element \\spad{x} at the end. Note: for lists,{} \\axiom{concat(\\spad{u},{}\\spad{x}) \\spad{==} concat(\\spad{u},{}[\\spad{x}])}")) (|new| (($ (|NonNegativeInteger|) |#1|) "\\spad{new(n,x)} returns \\axiom{fill!(new \\spad{n},{}\\spad{x})}."))) NIL NIL -(-653 R -2111 L) +(-653 R -3944 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 @@ -2560,11 +2560,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}."))) ((-4410 . T) (-4411 . T) (-4413 . T)) NIL -(-658 -2111 UP) +(-658 -3944 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)))) -(-659 A -2813) +(-659 A -2842) ((|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}}"))) ((-4410 . T) (-4411 . T) (-4413 . T)) ((|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-365)))) @@ -2600,11 +2600,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}."))) ((-4417 . T) (-4416 . T)) NIL -(-668 -2111) +(-668 -3944) ((|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 -(-669 -2111 |Row| |Col| M) +(-669 -3944 |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 @@ -2615,7 +2615,7 @@ NIL (-671 |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."))) ((-4413 . T) (-4416 . T) (-4410 . T) (-4411 . T)) -((|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (QUOTE (-233))) (|HasAttribute| |#2| (QUOTE (-4418 "*"))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567)))) (-2909 (-12 (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))))) (|HasCategory| |#2| (QUOTE (-308))) (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-559))) (-2909 (|HasAttribute| |#2| (QUOTE (-4418 "*"))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (QUOTE (-233)))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (|HasCategory| |#2| (QUOTE (-172)))) +((|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (QUOTE (-233))) (|HasAttribute| |#2| (QUOTE (-4418 "*"))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567)))) (-2871 (-12 (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))))) (|HasCategory| |#2| (QUOTE (-308))) (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-559))) (-2871 (|HasAttribute| |#2| (QUOTE (-4418 "*"))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (QUOTE (-233)))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (|HasCategory| |#2| (QUOTE (-172)))) (-672) ((|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 @@ -2635,7 +2635,7 @@ NIL (-676 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 -((-2909 (-12 (|HasCategory| |#1| (QUOTE (-1050))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) (|HasCategory| |#1| (QUOTE (-1100))) (-2909 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (QUOTE (-1050))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) +((-2871 (-12 (|HasCategory| |#1| (QUOTE (-1050))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) (|HasCategory| |#1| (QUOTE (-1100))) (-2871 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (QUOTE (-1050))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) (-677) ((|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 @@ -2691,7 +2691,7 @@ NIL (-690 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."))) ((-4416 . T) (-4417 . T)) -((-2909 (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) (|HasCategory| |#1| (QUOTE (-1100))) (-2909 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#1| (QUOTE (-308))) (|HasCategory| |#1| (QUOTE (-559))) (|HasAttribute| |#1| (QUOTE (-4418 "*"))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) +((-2871 (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) (|HasCategory| |#1| (QUOTE (-1100))) (-2871 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#1| (QUOTE (-308))) (|HasCategory| |#1| (QUOTE (-559))) (|HasAttribute| |#1| (QUOTE (-4418 "*"))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) (-691 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 @@ -2700,7 +2700,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 -(-693 S -2111 FLAF FLAS) +(-693 S -3944 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 @@ -2710,8 +2710,8 @@ NIL NIL (-695) ((|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"))) -((-4409 . T) (-4414 |has| (-700) (-365)) (-4408 |has| (-700) (-365)) (-2938 . T) (-4415 |has| (-700) (-6 -4415)) (-4412 |has| (-700) (-6 -4412)) ((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) -((|HasCategory| (-700) (QUOTE (-147))) (|HasCategory| (-700) (QUOTE (-145))) (|HasCategory| (-700) (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| (-700) (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| (-700) (QUOTE (-370))) (|HasCategory| (-700) (QUOTE (-365))) (-2909 (|HasCategory| (-700) (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| (-700) (QUOTE (-365)))) (|HasCategory| (-700) (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| (-700) (QUOTE (-233))) (-2909 (|HasCategory| (-700) (QUOTE (-365))) (|HasCategory| (-700) (QUOTE (-351)))) (|HasCategory| (-700) (QUOTE (-351))) (|HasCategory| (-700) (LIST (QUOTE -287) (QUOTE (-700)) (QUOTE (-700)))) (|HasCategory| (-700) (LIST (QUOTE -310) (QUOTE (-700)))) (|HasCategory| (-700) (LIST (QUOTE -517) (QUOTE (-1176)) (QUOTE (-700)))) (|HasCategory| (-700) (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| (-700) (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| (-700) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| (-700) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (-2909 (|HasCategory| (-700) (QUOTE (-308))) (|HasCategory| (-700) (QUOTE (-365))) (|HasCategory| (-700) (QUOTE (-351)))) (|HasCategory| (-700) (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| (-700) (QUOTE (-1023))) (|HasCategory| (-700) (QUOTE (-1201))) (-12 (|HasCategory| (-700) (QUOTE (-1003))) (|HasCategory| (-700) (QUOTE (-1201)))) (-2909 (-12 (|HasCategory| (-700) (QUOTE (-308))) (|HasCategory| (-700) (QUOTE (-910)))) (|HasCategory| (-700) (QUOTE (-365))) (-12 (|HasCategory| (-700) (QUOTE (-351))) (|HasCategory| (-700) (QUOTE (-910))))) (-2909 (-12 (|HasCategory| (-700) (QUOTE (-308))) (|HasCategory| (-700) (QUOTE (-910)))) (-12 (|HasCategory| (-700) (QUOTE (-365))) (|HasCategory| (-700) (QUOTE (-910)))) (-12 (|HasCategory| (-700) (QUOTE (-351))) (|HasCategory| (-700) (QUOTE (-910))))) (|HasCategory| (-700) (QUOTE (-548))) (-12 (|HasCategory| (-700) (QUOTE (-1060))) (|HasCategory| (-700) (QUOTE (-1201)))) (|HasCategory| (-700) (QUOTE (-1060))) (|HasCategory| (-700) (QUOTE (-308))) (|HasCategory| (-700) (QUOTE (-910))) (-2909 (-12 (|HasCategory| (-700) (QUOTE (-308))) (|HasCategory| (-700) (QUOTE (-910)))) (|HasCategory| (-700) (QUOTE (-365)))) (-2909 (-12 (|HasCategory| (-700) (QUOTE (-308))) (|HasCategory| (-700) (QUOTE (-910)))) (|HasCategory| (-700) (QUOTE (-559)))) (-12 (|HasCategory| (-700) (QUOTE (-233))) (|HasCategory| (-700) (QUOTE (-365)))) (-12 (|HasCategory| (-700) (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| (-700) (QUOTE (-365)))) (|HasCategory| (-700) (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| (-700) (QUOTE (-559))) (|HasAttribute| (-700) (QUOTE -4415)) (|HasAttribute| (-700) (QUOTE -4412)) (-12 (|HasCategory| (-700) (QUOTE (-308))) (|HasCategory| (-700) (QUOTE (-910)))) (-2909 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| (-700) (QUOTE (-308))) (|HasCategory| (-700) (QUOTE (-910)))) (|HasCategory| (-700) (QUOTE (-145)))) (-2909 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| (-700) (QUOTE (-308))) (|HasCategory| (-700) (QUOTE (-910)))) (|HasCategory| (-700) (QUOTE (-351))))) +((-4409 . T) (-4414 |has| (-700) (-365)) (-4408 |has| (-700) (-365)) (-3116 . T) (-4415 |has| (-700) (-6 -4415)) (-4412 |has| (-700) (-6 -4412)) ((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) +((|HasCategory| (-700) (QUOTE (-147))) (|HasCategory| (-700) (QUOTE (-145))) (|HasCategory| (-700) (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| (-700) (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| (-700) (QUOTE (-370))) (|HasCategory| (-700) (QUOTE (-365))) (-2871 (|HasCategory| (-700) (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| (-700) (QUOTE (-365)))) (|HasCategory| (-700) (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| (-700) (QUOTE (-233))) (-2871 (|HasCategory| (-700) (QUOTE (-365))) (|HasCategory| (-700) (QUOTE (-351)))) (|HasCategory| (-700) (QUOTE (-351))) (|HasCategory| (-700) (LIST (QUOTE -287) (QUOTE (-700)) (QUOTE (-700)))) (|HasCategory| (-700) (LIST (QUOTE -310) (QUOTE (-700)))) (|HasCategory| (-700) (LIST (QUOTE -517) (QUOTE (-1176)) (QUOTE (-700)))) (|HasCategory| (-700) (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| (-700) (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| (-700) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| (-700) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (-2871 (|HasCategory| (-700) (QUOTE (-308))) (|HasCategory| (-700) (QUOTE (-365))) (|HasCategory| (-700) (QUOTE (-351)))) (|HasCategory| (-700) (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| (-700) (QUOTE (-1023))) (|HasCategory| (-700) (QUOTE (-1201))) (-12 (|HasCategory| (-700) (QUOTE (-1003))) (|HasCategory| (-700) (QUOTE (-1201)))) (-2871 (-12 (|HasCategory| (-700) (QUOTE (-308))) (|HasCategory| (-700) (QUOTE (-910)))) (|HasCategory| (-700) (QUOTE (-365))) (-12 (|HasCategory| (-700) (QUOTE (-351))) (|HasCategory| (-700) (QUOTE (-910))))) (-2871 (-12 (|HasCategory| (-700) (QUOTE (-308))) (|HasCategory| (-700) (QUOTE (-910)))) (-12 (|HasCategory| (-700) (QUOTE (-365))) (|HasCategory| (-700) (QUOTE (-910)))) (-12 (|HasCategory| (-700) (QUOTE (-351))) (|HasCategory| (-700) (QUOTE (-910))))) (|HasCategory| (-700) (QUOTE (-548))) (-12 (|HasCategory| (-700) (QUOTE (-1060))) (|HasCategory| (-700) (QUOTE (-1201)))) (|HasCategory| (-700) (QUOTE (-1060))) (|HasCategory| (-700) (QUOTE (-308))) (|HasCategory| (-700) (QUOTE (-910))) (-2871 (-12 (|HasCategory| (-700) (QUOTE (-308))) (|HasCategory| (-700) (QUOTE (-910)))) (|HasCategory| (-700) (QUOTE (-365)))) (-2871 (-12 (|HasCategory| (-700) (QUOTE (-308))) (|HasCategory| (-700) (QUOTE (-910)))) (|HasCategory| (-700) (QUOTE (-559)))) (-12 (|HasCategory| (-700) (QUOTE (-233))) (|HasCategory| (-700) (QUOTE (-365)))) (-12 (|HasCategory| (-700) (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| (-700) (QUOTE (-365)))) (|HasCategory| (-700) (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| (-700) (QUOTE (-559))) (|HasAttribute| (-700) (QUOTE -4415)) (|HasAttribute| (-700) (QUOTE -4412)) (-12 (|HasCategory| (-700) (QUOTE (-308))) (|HasCategory| (-700) (QUOTE (-910)))) (-2871 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| (-700) (QUOTE (-308))) (|HasCategory| (-700) (QUOTE (-910)))) (|HasCategory| (-700) (QUOTE (-145)))) (-2871 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| (-700) (QUOTE (-308))) (|HasCategory| (-700) (QUOTE (-910)))) (|HasCategory| (-700) (QUOTE (-351))))) (-696 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}."))) ((-4417 . T)) @@ -2724,13 +2724,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 -(-699 OV E -2111 PG) +(-699 OV E -3944 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 (-700) ((|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}"))) -((-2927 . T) (-4408 . T) (-4414 . T) (-4409 . T) ((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) +((-3112 . T) (-4408 . T) (-4414 . T) (-4409 . T) ((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) NIL (-701 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."))) @@ -2756,7 +2756,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 -(-707 S -2692 I) +(-707 S -2703 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 @@ -2776,14 +2776,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 -(-712 R |Mod| -2362 -3768 |exactQuo|) +(-712 R |Mod| -3793 -4048 |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"))) ((-4408 . T) (-4414 . T) (-4409 . T) ((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) NIL (-713 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"))) (((-4418 "*") |has| |#1| (-172)) (-4409 |has| |#1| (-559)) (-4412 |has| |#1| (-365)) (-4414 |has| |#1| (-6 -4414)) (-4411 . T) (-4410 . T) (-4413 . T)) -((|HasCategory| |#1| (QUOTE (-910))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-172))) (-2909 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559)))) (-12 (|HasCategory| (-1082) (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-381))))) (-12 (|HasCategory| (-1082) (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-567))))) (-12 (|HasCategory| (-1082) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381)))))) (-12 (|HasCategory| (-1082) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567)))))) (-12 (|HasCategory| (-1082) (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539))))) (|HasCategory| |#1| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))) (-2909 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567)))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (-2909 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-910)))) (-2909 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-910)))) (-2909 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-910)))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-1151))) (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-351))) (|HasCategory| |#1| (QUOTE (-233))) (|HasAttribute| |#1| (QUOTE -4414)) (|HasCategory| |#1| (QUOTE (-455))) (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-910)))) (-2909 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-910)))) (|HasCategory| |#1| (QUOTE (-145))))) +((|HasCategory| |#1| (QUOTE (-910))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-172))) (-2871 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559)))) (-12 (|HasCategory| (-1082) (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-381))))) (-12 (|HasCategory| (-1082) (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-567))))) (-12 (|HasCategory| (-1082) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381)))))) (-12 (|HasCategory| (-1082) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567)))))) (-12 (|HasCategory| (-1082) (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539))))) (|HasCategory| |#1| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))) (-2871 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567)))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (-2871 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-910)))) (-2871 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-910)))) (-2871 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-910)))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-1151))) (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-351))) (|HasCategory| |#1| (QUOTE (-233))) (|HasAttribute| |#1| (QUOTE -4414)) (|HasCategory| |#1| (QUOTE (-455))) (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-910)))) (-2871 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-910)))) (|HasCategory| |#1| (QUOTE (-145))))) (-714 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 @@ -2792,7 +2792,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}."))) ((-4411 |has| |#1| (-172)) (-4410 |has| |#1| (-172)) (-4413 . T)) ((|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-147)))) -(-716 R |Mod| -2362 -3768 |exactQuo|) +(-716 R |Mod| -3793 -4048 |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"))) ((-4413 . T)) NIL @@ -2804,7 +2804,7 @@ NIL ((|constructor| (NIL "The category of modules over a commutative ring. \\blankline"))) ((-4411 . T) (-4410 . T)) NIL -(-719 -2111) +(-719 -3944) ((|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]]}."))) ((-4413 . T)) NIL @@ -2840,7 +2840,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 -(-728 -2111 UP) +(-728 -3944 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 @@ -2859,7 +2859,7 @@ NIL (-732 |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."))) (((-4418 "*") |has| |#2| (-172)) (-4409 |has| |#2| (-559)) (-4414 |has| |#2| (-6 -4414)) (-4411 . T) (-4410 . T) (-4413 . T)) -((|HasCategory| |#2| (QUOTE (-910))) (-2909 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-455))) (|HasCategory| |#2| (QUOTE (-559))) (|HasCategory| |#2| (QUOTE (-910)))) (-2909 (|HasCategory| |#2| (QUOTE (-455))) (|HasCategory| |#2| (QUOTE (-559))) (|HasCategory| |#2| (QUOTE (-910)))) (-2909 (|HasCategory| |#2| (QUOTE (-455))) (|HasCategory| |#2| (QUOTE (-910)))) (|HasCategory| |#2| (QUOTE (-559))) (|HasCategory| |#2| (QUOTE (-172))) (-2909 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-559)))) (-12 (|HasCategory| (-865 |#1|) (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| |#2| (LIST (QUOTE -887) (QUOTE (-381))))) (-12 (|HasCategory| (-865 |#1|) (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -887) (QUOTE (-567))))) (-12 (|HasCategory| (-865 |#1|) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| |#2| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381)))))) (-12 (|HasCategory| (-865 |#1|) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567)))))) (-12 (|HasCategory| (-865 |#1|) (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#2| (LIST (QUOTE -615) (QUOTE (-539))))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-145))) (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567)))) (-2909 (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567)))))) (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-365))) (|HasAttribute| |#2| (QUOTE -4414)) (|HasCategory| |#2| (QUOTE (-455))) (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#2| (QUOTE (-910)))) (-2909 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#2| (QUOTE (-910)))) (|HasCategory| |#2| (QUOTE (-145))))) +((|HasCategory| |#2| (QUOTE (-910))) (-2871 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-455))) (|HasCategory| |#2| (QUOTE (-559))) (|HasCategory| |#2| (QUOTE (-910)))) (-2871 (|HasCategory| |#2| (QUOTE (-455))) (|HasCategory| |#2| (QUOTE (-559))) (|HasCategory| |#2| (QUOTE (-910)))) (-2871 (|HasCategory| |#2| (QUOTE (-455))) (|HasCategory| |#2| (QUOTE (-910)))) (|HasCategory| |#2| (QUOTE (-559))) (|HasCategory| |#2| (QUOTE (-172))) (-2871 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-559)))) (-12 (|HasCategory| (-865 |#1|) (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| |#2| (LIST (QUOTE -887) (QUOTE (-381))))) (-12 (|HasCategory| (-865 |#1|) (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -887) (QUOTE (-567))))) (-12 (|HasCategory| (-865 |#1|) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| |#2| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381)))))) (-12 (|HasCategory| (-865 |#1|) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567)))))) (-12 (|HasCategory| (-865 |#1|) (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#2| (LIST (QUOTE -615) (QUOTE (-539))))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-145))) (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567)))) (-2871 (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567)))))) (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-365))) (|HasAttribute| |#2| (QUOTE -4414)) (|HasCategory| |#2| (QUOTE (-455))) (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#2| (QUOTE (-910)))) (-2871 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#2| (QUOTE (-910)))) (|HasCategory| |#2| (QUOTE (-145))))) (-733 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 @@ -2992,11 +2992,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 -(-766 -2111) +(-766 -3944) ((|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 -(-767 P -2111) +(-767 P -3944) ((|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 @@ -3004,7 +3004,7 @@ NIL NIL NIL NIL -(-769 UP -2111) +(-769 UP -3944) ((|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 @@ -3020,7 +3020,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."))) (((-4418 "*") . T)) NIL -(-773 R -2111) +(-773 R -3944) ((|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 @@ -3040,7 +3040,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 -(-778 -2111 |ExtF| |SUEx| |ExtP| |n|) +(-778 -3944 |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 @@ -3055,7 +3055,7 @@ NIL (-781 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."))) (((-4418 "*") |has| |#1| (-172)) (-4409 |has| |#1| (-559)) (-4414 |has| |#1| (-6 -4414)) (-4411 . T) (-4410 . T) (-4413 . T)) -((|HasCategory| |#1| (QUOTE (-910))) (-2909 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-910)))) (-2909 (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-910)))) (-2909 (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-910)))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-172))) (-2909 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| |#2| (LIST (QUOTE -887) (QUOTE (-381))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -887) (QUOTE (-567))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| |#2| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#2| (LIST (QUOTE -615) (QUOTE (-539))))) (|HasCategory| |#1| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))) (-2909 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567)))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -615) (QUOTE (-1176))))) (|HasCategory| |#2| (LIST (QUOTE -615) (QUOTE (-1176)))) (|HasCategory| |#1| (QUOTE (-365))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -615) (QUOTE (-1176))))) (-2909 (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -615) (QUOTE (-1176)))) (-1397 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -615) (QUOTE (-1176)))))) (-2909 (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -615) (QUOTE (-1176)))) (-1397 (|HasCategory| |#1| (QUOTE (-548)))) (-1397 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -615) (QUOTE (-1176)))) (-1397 (|HasCategory| |#1| (LIST (QUOTE -38) (QUOTE (-567))))) (-1397 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -615) (QUOTE (-1176)))) (-1397 (|HasCategory| |#1| (LIST (QUOTE -993) (QUOTE (-567))))))) (|HasAttribute| |#1| (QUOTE -4414)) (|HasCategory| |#1| (QUOTE (-455))) (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-910)))) (-2909 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-910)))) (|HasCategory| |#1| (QUOTE (-145))))) +((|HasCategory| |#1| (QUOTE (-910))) (-2871 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-910)))) (-2871 (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-910)))) (-2871 (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-910)))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-172))) (-2871 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| |#2| (LIST (QUOTE -887) (QUOTE (-381))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -887) (QUOTE (-567))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| |#2| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#2| (LIST (QUOTE -615) (QUOTE (-539))))) (|HasCategory| |#1| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))) (-2871 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567)))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -615) (QUOTE (-1176))))) (|HasCategory| |#2| (LIST (QUOTE -615) (QUOTE (-1176)))) (|HasCategory| |#1| (QUOTE (-365))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -615) (QUOTE (-1176))))) (-2871 (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -615) (QUOTE (-1176)))) (-1683 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -615) (QUOTE (-1176)))))) (-2871 (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -615) (QUOTE (-1176)))) (-1683 (|HasCategory| |#1| (QUOTE (-548)))) (-1683 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -615) (QUOTE (-1176)))) (-1683 (|HasCategory| |#1| (LIST (QUOTE -38) (QUOTE (-567))))) (-1683 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -615) (QUOTE (-1176)))) (-1683 (|HasCategory| |#1| (LIST (QUOTE -993) (QUOTE (-567))))))) (|HasAttribute| |#1| (QUOTE -4414)) (|HasCategory| |#1| (QUOTE (-455))) (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-910)))) (-2871 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-910)))) (|HasCategory| |#1| (QUOTE (-145))))) (-782 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 @@ -3063,7 +3063,7 @@ NIL (-783 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)}"))) (((-4418 "*") |has| |#1| (-172)) (-4409 |has| |#1| (-559)) (-4412 |has| |#1| (-365)) (-4414 |has| |#1| (-6 -4414)) (-4411 . T) (-4410 . T) (-4413 . T)) -((|HasCategory| |#1| (QUOTE (-910))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-172))) (-2909 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559)))) (-12 (|HasCategory| (-1082) (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-381))))) (-12 (|HasCategory| (-1082) (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-567))))) (-12 (|HasCategory| (-1082) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381)))))) (-12 (|HasCategory| (-1082) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567)))))) (-12 (|HasCategory| (-1082) (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539))))) (|HasCategory| |#1| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))) (-2909 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567)))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (-2909 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-910)))) (-2909 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-910)))) (-2909 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-910)))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-1151))) (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#1| (QUOTE (-233))) (|HasAttribute| |#1| (QUOTE -4414)) (|HasCategory| |#1| (QUOTE (-455))) (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-910)))) (-2909 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-910)))) (|HasCategory| |#1| (QUOTE (-145))))) +((|HasCategory| |#1| (QUOTE (-910))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-172))) (-2871 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559)))) (-12 (|HasCategory| (-1082) (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-381))))) (-12 (|HasCategory| (-1082) (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-567))))) (-12 (|HasCategory| (-1082) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381)))))) (-12 (|HasCategory| (-1082) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567)))))) (-12 (|HasCategory| (-1082) (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539))))) (|HasCategory| |#1| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))) (-2871 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567)))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (-2871 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-910)))) (-2871 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-910)))) (-2871 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-910)))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-1151))) (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#1| (QUOTE (-233))) (|HasAttribute| |#1| (QUOTE -4414)) (|HasCategory| |#1| (QUOTE (-455))) (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-910)))) (-2871 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-910)))) (|HasCategory| |#1| (QUOTE (-145))))) (-784 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 @@ -3124,23 +3124,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}."))) ((-4410 . T) (-4411 . T) (-4413 . T)) NIL -(-799 -2909 R OS S) +(-799 -2871 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 (-800 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}."))) ((-4410 . T) (-4411 . T) (-4413 . T)) -((|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (LIST (QUOTE -517) (QUOTE (-1176)) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -287) (|devaluate| |#1|) (|devaluate| |#1|))) (-2909 (|HasCategory| (-1000 |#1|) (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567)))))) (-2909 (|HasCategory| (-1000 |#1|) (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-1060))) (|HasCategory| |#1| (QUOTE (-548))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| (-1000 |#1|) (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| (-1000 |#1|) (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567))))) +((|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (LIST (QUOTE -517) (QUOTE (-1176)) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -287) (|devaluate| |#1|) (|devaluate| |#1|))) (-2871 (|HasCategory| (-1000 |#1|) (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567)))))) (-2871 (|HasCategory| (-1000 |#1|) (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-1060))) (|HasCategory| |#1| (QUOTE (-548))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| (-1000 |#1|) (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| (-1000 |#1|) (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567))))) (-801) ((|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 -(-802 R -2111 L) +(-802 R -3944 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 -(-803 R -2111) +(-803 R -3944) ((|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 @@ -3148,7 +3148,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 -(-805 R -2111) +(-805 R -3944) ((|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 @@ -3156,11 +3156,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 -(-807 -2111 UP UPUP R) +(-807 -3944 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 -(-808 -2111 UP L LQ) +(-808 -3944 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 @@ -3168,38 +3168,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 -(-810 -2111 UP L LQ) +(-810 -3944 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 -(-811 -2111 UP) +(-811 -3944 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 -(-812 -2111 L UP A LO) +(-812 -3944 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 -(-813 -2111 UP) +(-813 -3944 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)))) -(-814 -2111 LO) +(-814 -3944 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 -(-815 -2111 LODO) +(-815 -3944 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 -(-816 -2189 S |f|) +(-816 -2675 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}."))) ((-4410 |has| |#2| (-1050)) (-4411 |has| |#2| (-1050)) (-4413 |has| |#2| (-6 -4413)) ((-4418 "*") |has| |#2| (-172)) (-4416 . T)) -((-2909 (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-131))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-727))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-794))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-849))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1050))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))))) (-2909 (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-1100)))) (-12 (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (QUOTE (-1050)))) (-12 (|HasCategory| |#2| (QUOTE (-1050))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-1050))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176))))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#2| (QUOTE (-365))) (-2909 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-1050)))) (-2909 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-365)))) (|HasCategory| |#2| (QUOTE (-1050))) (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-794))) (-2909 (|HasCategory| |#2| (QUOTE (-794))) (|HasCategory| |#2| (QUOTE (-849)))) (|HasCategory| |#2| (QUOTE (-849))) (|HasCategory| |#2| (QUOTE (-727))) (-2909 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-1050)))) (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (-2909 (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-131))) (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-1050)))) (-2909 (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (QUOTE (-131))) (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-1050)))) (-2909 (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-1050)))) (-2909 (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (QUOTE (-1050)))) (|HasCategory| |#2| (QUOTE (-233))) (-2909 (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-131))) (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-727))) (|HasCategory| |#2| (QUOTE (-794))) (|HasCategory| |#2| (QUOTE (-849))) (|HasCategory| |#2| (QUOTE (-1050))) (|HasCategory| |#2| (QUOTE (-1100)))) (|HasCategory| |#2| (QUOTE (-1100))) (-2909 (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-25)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-131)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-172)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-233)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-365)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-370)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-727)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-794)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-849)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-1050)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-1100))))) (-2909 (-12 (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-131))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-727))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-794))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-849))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-1050))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567)))))) (-2909 (-12 (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-131))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-727))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-794))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-849))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-1050))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567)))))) (|HasCategory| (-567) (QUOTE (-851))) (-12 (|HasCategory| |#2| (QUOTE (-1050))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (QUOTE (-1050)))) (-12 (|HasCategory| |#2| (QUOTE (-1050))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176))))) (-2909 (|HasCategory| |#2| (QUOTE (-1050))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567)))))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-1100)))) (|HasAttribute| |#2| (QUOTE -4413)) (|HasCategory| |#2| (QUOTE (-131))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|))))) +((-2871 (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-131))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-727))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-794))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-849))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1050))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))))) (-2871 (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-1100)))) (-12 (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (QUOTE (-1050)))) (-12 (|HasCategory| |#2| (QUOTE (-1050))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-1050))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176))))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#2| (QUOTE (-365))) (-2871 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-1050)))) (-2871 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-365)))) (|HasCategory| |#2| (QUOTE (-1050))) (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-794))) (-2871 (|HasCategory| |#2| (QUOTE (-794))) (|HasCategory| |#2| (QUOTE (-849)))) (|HasCategory| |#2| (QUOTE (-849))) (|HasCategory| |#2| (QUOTE (-727))) (-2871 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-1050)))) (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (-2871 (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-131))) (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-1050)))) (-2871 (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (QUOTE (-131))) (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-1050)))) (-2871 (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-1050)))) (-2871 (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (QUOTE (-1050)))) (|HasCategory| |#2| (QUOTE (-233))) (-2871 (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-131))) (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-727))) (|HasCategory| |#2| (QUOTE (-794))) (|HasCategory| |#2| (QUOTE (-849))) (|HasCategory| |#2| (QUOTE (-1050))) (|HasCategory| |#2| (QUOTE (-1100)))) (|HasCategory| |#2| (QUOTE (-1100))) (-2871 (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-25)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-131)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-172)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-233)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-365)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-370)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-727)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-794)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-849)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-1050)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-1100))))) (-2871 (-12 (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-131))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-727))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-794))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-849))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-1050))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567)))))) (-2871 (-12 (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-131))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-370))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-727))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-794))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-849))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-1050))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567)))))) (|HasCategory| (-567) (QUOTE (-851))) (-12 (|HasCategory| |#2| (QUOTE (-1050))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (QUOTE (-1050)))) (-12 (|HasCategory| |#2| (QUOTE (-1050))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176))))) (-2871 (|HasCategory| |#2| (QUOTE (-1050))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567)))))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-1100)))) (|HasAttribute| |#2| (QUOTE -4413)) (|HasCategory| |#2| (QUOTE (-131))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|))))) (-817 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"))) (((-4418 "*") |has| |#1| (-172)) (-4409 |has| |#1| (-559)) (-4414 |has| |#1| (-6 -4414)) (-4411 . T) (-4410 . T) (-4413 . T)) -((|HasCategory| |#1| (QUOTE (-910))) (-2909 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-910)))) (-2909 (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-910)))) (-2909 (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-910)))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-172))) (-2909 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559)))) (-12 (|HasCategory| (-819 (-1176)) (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-381))))) (-12 (|HasCategory| (-819 (-1176)) (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-567))))) (-12 (|HasCategory| (-819 (-1176)) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381)))))) (-12 (|HasCategory| (-819 (-1176)) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567)))))) (-12 (|HasCategory| (-819 (-1176)) (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539))))) (|HasCategory| |#1| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))) (-2909 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567)))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-233))) (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#1| (QUOTE (-365))) (|HasAttribute| |#1| (QUOTE -4414)) (|HasCategory| |#1| (QUOTE (-455))) (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-910)))) (-2909 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-910)))) (|HasCategory| |#1| (QUOTE (-145))))) +((|HasCategory| |#1| (QUOTE (-910))) (-2871 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-910)))) (-2871 (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-910)))) (-2871 (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-910)))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-172))) (-2871 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559)))) (-12 (|HasCategory| (-819 (-1176)) (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-381))))) (-12 (|HasCategory| (-819 (-1176)) (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-567))))) (-12 (|HasCategory| (-819 (-1176)) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381)))))) (-12 (|HasCategory| (-819 (-1176)) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567)))))) (-12 (|HasCategory| (-819 (-1176)) (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539))))) (|HasCategory| |#1| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))) (-2871 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567)))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-233))) (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#1| (QUOTE (-365))) (|HasAttribute| |#1| (QUOTE -4414)) (|HasCategory| |#1| (QUOTE (-455))) (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-910)))) (-2871 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-910)))) (|HasCategory| |#1| (QUOTE (-145))))) (-818 |Kernels| R |var|) ((|constructor| (NIL "This constructor produces an ordinary differential ring from a partial differential ring by specifying a variable."))) (((-4418 "*") |has| |#2| (-365)) (-4409 |has| |#2| (-365)) (-4414 |has| |#2| (-365)) (-4408 |has| |#2| (-365)) (-4413 . T) (-4411 . T) (-4410 . T)) @@ -3209,9 +3209,9 @@ NIL NIL NIL (-820 S) -((|constructor| (NIL "\\indented{3}{The free monoid on a set \\spad{S} is the monoid of finite products of} the form \\spad{reduce(*,[si ** ni])} where the \\spad{si}\\spad{'s} are in \\spad{S},{} and the \\spad{ni}\\spad{'s} are non-negative integers. The multiplication is not commutative. For two elements \\spad{x} and \\spad{y} the relation \\spad{x < y} holds if either \\spad{length(x) < length(y)} holds or if these lengths are equal and if \\spad{x} is smaller than \\spad{y} \\spad{w}.\\spad{r}.\\spad{t}. the lexicographical ordering induced by \\spad{S}. This domain inherits implementation from \\spadtype{FreeMonoid}.")) (|varList| (((|List| |#1|) $) "\\spad{varList(x)} returns the list of variables of \\spad{x}.")) (|length| (((|NonNegativeInteger|) $) "\\spad{length(x)} returns the length of \\spad{x}.")) (|factors| (((|List| (|Record| (|:| |gen| |#1|) (|:| |exp| (|NonNegativeInteger|)))) $) "\\spad{factors(a1\\^e1,...,an\\^en)} returns \\spad{[[a1, e1],...,[an, en]]}.")) (|nthFactor| ((|#1| $ (|Integer|)) "\\spad{nthFactor(x, n)} returns the factor of the \\spad{n-th} monomial of \\spad{x}.")) (|nthExpon| (((|NonNegativeInteger|) $ (|Integer|)) "\\spad{nthExpon(x, n)} returns the exponent of the \\spad{n-th} monomial of \\spad{x}.")) (|size| (((|NonNegativeInteger|) $) "\\spad{size(x)} returns the number of monomials in \\spad{x}.")) (|overlap| (((|Record| (|:| |lm| $) (|:| |mm| $) (|:| |rm| $)) $ $) "\\spad{overlap(x, y)} returns \\spad{[l, m, r]} such that \\spad{x = l * m} and \\spad{y = m * r} hold and such that \\spad{l} and \\spad{r} have no overlap,{} that is \\spad{overlap(l, r) = [l, 1, r]}.")) (|div| (((|Union| (|Record| (|:| |lm| $) (|:| |rm| $)) "failed") $ $) "\\spad{x div y} returns the left and right exact quotients of \\spad{x} by \\spad{y},{} that is \\spad{[l, r]} such that \\spad{x = l * y * r}. \"failed\" is returned iff \\spad{x} is not of the form \\spad{l * y * r}.")) (|rquo| (((|Union| $ "failed") $ |#1|) "\\spad{rquo(x, s)} returns the exact right quotient of \\spad{x} by \\spad{s}.") (((|Union| $ "failed") $ $) "\\spad{rquo(x, y)} returns the exact right quotient of \\spad{x} by \\spad{y} that is \\spad{q} such that \\spad{x = q * y},{} \"failed\" if \\spad{x} is not of the form \\spad{q * y}.")) (|lquo| (((|Union| $ "failed") $ |#1|) "\\spad{lquo(x, s)} returns the exact left quotient of \\spad{x} by \\spad{s}.") (((|Union| $ "failed") $ $) "\\spad{lquo(x, y)} returns the exact left quotient of \\spad{x} \\indented{1}{by \\spad{y} that is \\spad{q} such that \\spad{x = y * q},{}} \"failed\" if \\spad{x} is not of the form \\spad{y * q}.")) (|hcrf| (($ $ $) "\\spad{hcrf(x, y)} returns the highest common right factor of \\spad{x} and \\spad{y},{} that is the largest \\spad{d} such that \\spad{x = a d} and \\spad{y = b d}.")) (|hclf| (($ $ $) "\\spad{hclf(x, y)} returns the highest common left factor of \\spad{x} and \\spad{y},{} that is the largest \\spad{d} such that \\spad{x = d a} and \\spad{y = d b}.")) (|lexico| (((|Boolean|) $ $) "\\spad{lexico(x,y)} returns \\spad{true} iff \\spad{x} is smaller than \\spad{y} \\spad{w}.\\spad{r}.\\spad{t}. the pure lexicographical ordering induced by \\spad{S}.")) (|mirror| (($ $) "\\spad{mirror(x)} returns the reversed word of \\spad{x}.")) (|rest| (($ $) "\\spad{rest(x)} returns \\spad{x} except the first letter.")) (|first| ((|#1| $) "\\spad{first(x)} returns the first letter of \\spad{x}.")) (** (($ |#1| (|NonNegativeInteger|)) "\\spad{s ** n} returns the product of \\spad{s} by itself \\spad{n} times.")) (* (($ $ |#1|) "\\spad{x * s} returns the product of \\spad{x} by \\spad{s} on the right.") (($ |#1| $) "\\spad{s * x} returns the product of \\spad{x} by \\spad{s} on the left."))) -NIL +((|constructor| (NIL "\\indented{3}{The free monoid on a set \\spad{S} is the monoid of finite products of} the form \\spad{reduce(*,[si ** ni])} where the \\spad{si}\\spad{'s} are in \\spad{S},{} and the \\spad{ni}\\spad{'s} are non-negative integers. The multiplication is not commutative. For two elements \\spad{x} and \\spad{y} the relation \\spad{x < y} holds if either \\spad{length(x) < length(y)} holds or if these lengths are equal and if \\spad{x} is smaller than \\spad{y} \\spad{w}.\\spad{r}.\\spad{t}. the lexicographical ordering induced by \\spad{S}. This domain inherits implementation from \\spadtype{FreeMonoid}.")) (|varList| (((|List| |#1|) $) "\\spad{varList(x)} returns the list of variables of \\spad{x}.")) (|length| (((|NonNegativeInteger|) $) "\\spad{length(x)} returns the length of \\spad{x}.")) (|div| (((|Union| (|Record| (|:| |lm| $) (|:| |rm| $)) "failed") $ $) "\\spad{x div y} returns the left and right exact quotients of \\spad{x} by \\spad{y},{} that is \\spad{[l, r]} such that \\spad{x = l * y * r}. \"failed\" is returned iff \\spad{x} is not of the form \\spad{l * y * r}. monomial of \\spad{x}.")) (|rquo| (((|Union| $ "failed") $ |#1|) "\\spad{rquo(x, s)} returns the exact right quotient of \\spad{x} by \\spad{s}.")) (|lquo| (((|Union| $ "failed") $ |#1|) "\\spad{lquo(x, s)} returns the exact left quotient of \\spad{x} by \\spad{s}.")) (|lexico| (((|Boolean|) $ $) "\\spad{lexico(x,y)} returns \\spad{true} iff \\spad{x} is smaller than \\spad{y} \\spad{w}.\\spad{r}.\\spad{t}. the pure lexicographical ordering induced by \\spad{S}.")) (|mirror| (($ $) "\\spad{mirror(x)} returns the reversed word of \\spad{x}.")) (|rest| (($ $) "\\spad{rest(x)} returns \\spad{x} except the first letter.")) (|first| ((|#1| $) "\\spad{first(x)} returns the first letter of \\spad{x}."))) NIL +((|HasCategory| |#1| (QUOTE (-851)))) (-821) ((|constructor| (NIL "The category of ordered commutative integral domains,{} where ordering and the arithmetic operations are compatible \\blankline"))) ((-4409 . T) ((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) @@ -3267,7 +3267,7 @@ NIL (-834 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."))) ((-4413 |has| |#1| (-849))) -((|HasCategory| |#1| (QUOTE (-849))) (|HasCategory| |#1| (QUOTE (-21))) (-2909 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-849)))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (-2909 (|HasCategory| |#1| (QUOTE (-849))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-548)))) +((|HasCategory| |#1| (QUOTE (-849))) (|HasCategory| |#1| (QUOTE (-21))) (-2871 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-849)))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (-2871 (|HasCategory| |#1| (QUOTE (-849))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-548)))) (-835 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 @@ -3307,12 +3307,12 @@ NIL (-844 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."))) ((-4413 |has| |#1| (-849))) -((|HasCategory| |#1| (QUOTE (-849))) (|HasCategory| |#1| (QUOTE (-21))) (-2909 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-849)))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (-2909 (|HasCategory| |#1| (QUOTE (-849))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-548)))) +((|HasCategory| |#1| (QUOTE (-849))) (|HasCategory| |#1| (QUOTE (-21))) (-2871 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-849)))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (-2871 (|HasCategory| |#1| (QUOTE (-849))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-548)))) (-845) ((|constructor| (NIL "Ordered finite sets.")) (|max| (($) "\\spad{max} is the maximum value of \\%.")) (|min| (($) "\\spad{min} is the minimum value of \\%."))) NIL NIL -(-846 -2189 S) +(-846 -2675 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 @@ -3348,11 +3348,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 (-365))) (|HasCategory| |#1| (QUOTE (-559)))) -(-855 R |sigma| -2605) +(-855 R |sigma| -2585) ((|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."))) ((-4410 . T) (-4411 . T) (-4413 . T)) ((|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-365)))) -(-856 |x| R |sigma| -2605) +(-856 |x| R |sigma| -2585) ((|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}."))) ((-4410 . T) (-4411 . T) (-4413 . T)) ((|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| |#2| (QUOTE (-559))) (|HasCategory| |#2| (QUOTE (-455))) (|HasCategory| |#2| (QUOTE (-365)))) @@ -3419,15 +3419,15 @@ NIL (-872 |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)."))) ((-4408 . T) (-4414 . T) (-4409 . T) ((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) -((|HasCategory| (-871 |#1|) (QUOTE (-910))) (|HasCategory| (-871 |#1|) (LIST (QUOTE -1039) (QUOTE (-1176)))) (|HasCategory| (-871 |#1|) (QUOTE (-145))) (|HasCategory| (-871 |#1|) (QUOTE (-147))) (|HasCategory| (-871 |#1|) (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| (-871 |#1|) (QUOTE (-1023))) (|HasCategory| (-871 |#1|) (QUOTE (-821))) (-2909 (|HasCategory| (-871 |#1|) (QUOTE (-821))) (|HasCategory| (-871 |#1|) (QUOTE (-851)))) (|HasCategory| (-871 |#1|) (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| (-871 |#1|) (QUOTE (-1151))) (|HasCategory| (-871 |#1|) (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| (-871 |#1|) (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| (-871 |#1|) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| (-871 |#1|) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| (-871 |#1|) (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| (-871 |#1|) (QUOTE (-233))) (|HasCategory| (-871 |#1|) (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| (-871 |#1|) (LIST (QUOTE -517) (QUOTE (-1176)) (LIST (QUOTE -871) (|devaluate| |#1|)))) (|HasCategory| (-871 |#1|) (LIST (QUOTE -310) (LIST (QUOTE -871) (|devaluate| |#1|)))) (|HasCategory| (-871 |#1|) (LIST (QUOTE -287) (LIST (QUOTE -871) (|devaluate| |#1|)) (LIST (QUOTE -871) (|devaluate| |#1|)))) (|HasCategory| (-871 |#1|) (QUOTE (-308))) (|HasCategory| (-871 |#1|) (QUOTE (-548))) (|HasCategory| (-871 |#1|) (QUOTE (-851))) (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| (-871 |#1|) (QUOTE (-910)))) (-2909 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| (-871 |#1|) (QUOTE (-910)))) (|HasCategory| (-871 |#1|) (QUOTE (-145))))) +((|HasCategory| (-871 |#1|) (QUOTE (-910))) (|HasCategory| (-871 |#1|) (LIST (QUOTE -1039) (QUOTE (-1176)))) (|HasCategory| (-871 |#1|) (QUOTE (-145))) (|HasCategory| (-871 |#1|) (QUOTE (-147))) (|HasCategory| (-871 |#1|) (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| (-871 |#1|) (QUOTE (-1023))) (|HasCategory| (-871 |#1|) (QUOTE (-821))) (-2871 (|HasCategory| (-871 |#1|) (QUOTE (-821))) (|HasCategory| (-871 |#1|) (QUOTE (-851)))) (|HasCategory| (-871 |#1|) (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| (-871 |#1|) (QUOTE (-1151))) (|HasCategory| (-871 |#1|) (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| (-871 |#1|) (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| (-871 |#1|) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| (-871 |#1|) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| (-871 |#1|) (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| (-871 |#1|) (QUOTE (-233))) (|HasCategory| (-871 |#1|) (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| (-871 |#1|) (LIST (QUOTE -517) (QUOTE (-1176)) (LIST (QUOTE -871) (|devaluate| |#1|)))) (|HasCategory| (-871 |#1|) (LIST (QUOTE -310) (LIST (QUOTE -871) (|devaluate| |#1|)))) (|HasCategory| (-871 |#1|) (LIST (QUOTE -287) (LIST (QUOTE -871) (|devaluate| |#1|)) (LIST (QUOTE -871) (|devaluate| |#1|)))) (|HasCategory| (-871 |#1|) (QUOTE (-308))) (|HasCategory| (-871 |#1|) (QUOTE (-548))) (|HasCategory| (-871 |#1|) (QUOTE (-851))) (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| (-871 |#1|) (QUOTE (-910)))) (-2871 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| (-871 |#1|) (QUOTE (-910)))) (|HasCategory| (-871 |#1|) (QUOTE (-145))))) (-873 |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)}."))) ((-4408 . T) (-4414 . T) (-4409 . T) ((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) -((|HasCategory| |#2| (QUOTE (-910))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-1176)))) (|HasCategory| |#2| (QUOTE (-145))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#2| (QUOTE (-1023))) (|HasCategory| |#2| (QUOTE (-821))) (-2909 (|HasCategory| |#2| (QUOTE (-821))) (|HasCategory| |#2| (QUOTE (-851)))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| |#2| (QUOTE (-1151))) (|HasCategory| |#2| (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| |#2| (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| |#2| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (LIST (QUOTE -517) (QUOTE (-1176)) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -287) (|devaluate| |#2|) (|devaluate| |#2|))) (|HasCategory| |#2| (QUOTE (-308))) (|HasCategory| |#2| (QUOTE (-548))) (|HasCategory| |#2| (QUOTE (-851))) (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#2| (QUOTE (-910)))) (-2909 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#2| (QUOTE (-910)))) (|HasCategory| |#2| (QUOTE (-145))))) +((|HasCategory| |#2| (QUOTE (-910))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-1176)))) (|HasCategory| |#2| (QUOTE (-145))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#2| (QUOTE (-1023))) (|HasCategory| |#2| (QUOTE (-821))) (-2871 (|HasCategory| |#2| (QUOTE (-821))) (|HasCategory| |#2| (QUOTE (-851)))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| |#2| (QUOTE (-1151))) (|HasCategory| |#2| (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| |#2| (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| |#2| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (LIST (QUOTE -517) (QUOTE (-1176)) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -287) (|devaluate| |#2|) (|devaluate| |#2|))) (|HasCategory| |#2| (QUOTE (-308))) (|HasCategory| |#2| (QUOTE (-548))) (|HasCategory| |#2| (QUOTE (-851))) (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#2| (QUOTE (-910)))) (-2871 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#2| (QUOTE (-910)))) (|HasCategory| |#2| (QUOTE (-145))))) (-874 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 (-1100))) (|HasCategory| |#2| (QUOTE (-1100)))) (-2909 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#2| (QUOTE (-1100)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863)))))) +((-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#2| (QUOTE (-1100)))) (-2871 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#2| (QUOTE (-1100)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863)))))) (-875) ((|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 @@ -3483,7 +3483,7 @@ NIL (-888 |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 (-1397 (|HasCategory| |#2| (QUOTE (-1050)))) (-1397 (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-1176)))))) (-12 (|HasCategory| |#2| (QUOTE (-1050))) (-1397 (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-1176)))))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-1176))))) +((-12 (-1683 (|HasCategory| |#2| (QUOTE (-1050)))) (-1683 (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-1176)))))) (-12 (|HasCategory| |#2| (QUOTE (-1050))) (-1683 (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-1176)))))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-1176))))) (-889 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 @@ -3492,7 +3492,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 -(-891 R -2692) +(-891 R -2703) ((|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 @@ -3516,7 +3516,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 -(-897 UP -2111) +(-897 UP -3944) ((|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 @@ -3539,7 +3539,7 @@ NIL (-902 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 (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1100))) (-2909 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) +((-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1100))) (-2871 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (-903 |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 @@ -3555,7 +3555,7 @@ NIL (-906 S) ((|constructor| (NIL "Permutation(\\spad{S}) implements the group of all bijections \\indented{2}{on a set \\spad{S},{} which move only a finite number of points.} \\indented{2}{A permutation is considered as a map from \\spad{S} into \\spad{S}. In particular} \\indented{2}{multiplication is defined as composition of maps:} \\indented{2}{{\\em pi1 * pi2 = pi1 o pi2}.} \\indented{2}{The internal representation of permuatations are two lists} \\indented{2}{of equal length representing preimages and images.}")) (|coerceImages| (($ (|List| |#1|)) "\\spad{coerceImages(ls)} coerces the list {\\em ls} to a permutation whose image is given by {\\em ls} and the preimage is fixed to be {\\em [1,...,n]}. Note: {coerceImages(\\spad{ls})=coercePreimagesImages([1,{}...,{}\\spad{n}],{}\\spad{ls})}. We assume that both preimage and image do not contain repetitions.")) (|fixedPoints| (((|Set| |#1|) $) "\\spad{fixedPoints(p)} returns the points fixed by the permutation \\spad{p}.")) (|sort| (((|List| $) (|List| $)) "\\spad{sort(lp)} sorts a list of permutations {\\em lp} according to cycle structure first according to length of cycles,{} second,{} if \\spad{S} has \\spadtype{Finite} or \\spad{S} has \\spadtype{OrderedSet} according to lexicographical order of entries in cycles of equal length.")) (|odd?| (((|Boolean|) $) "\\spad{odd?(p)} returns \\spad{true} if and only if \\spad{p} is an odd permutation \\spadignore{i.e.} {\\em sign(p)} is {\\em -1}.")) (|even?| (((|Boolean|) $) "\\spad{even?(p)} returns \\spad{true} if and only if \\spad{p} is an even permutation,{} \\spadignore{i.e.} {\\em sign(p)} is 1.")) (|sign| (((|Integer|) $) "\\spad{sign(p)} returns the signum of the permutation \\spad{p},{} \\spad{+1} or \\spad{-1}.")) (|numberOfCycles| (((|NonNegativeInteger|) $) "\\spad{numberOfCycles(p)} returns the number of non-trivial cycles of the permutation \\spad{p}.")) (|order| (((|NonNegativeInteger|) $) "\\spad{order(p)} returns the order of a permutation \\spad{p} as a group element.")) (|cyclePartition| (((|Partition|) $) "\\spad{cyclePartition(p)} returns the cycle structure of a permutation \\spad{p} including cycles of length 1 only if \\spad{S} is finite.")) (|movedPoints| (((|Set| |#1|) $) "\\spad{movedPoints(p)} returns the set of points moved by the permutation \\spad{p}.")) (|degree| (((|NonNegativeInteger|) $) "\\spad{degree(p)} retuns the number of points moved by the permutation \\spad{p}.")) (|coerceListOfPairs| (($ (|List| (|List| |#1|))) "\\spad{coerceListOfPairs(lls)} coerces a list of pairs {\\em lls} to a permutation. Error: if not consistent,{} \\spadignore{i.e.} the set of the first elements coincides with the set of second elements. coerce(\\spad{p}) generates output of the permutation \\spad{p} with domain OutputForm.")) (|coerce| (($ (|List| |#1|)) "\\spad{coerce(ls)} coerces a cycle {\\em ls},{} \\spadignore{i.e.} a list with not repetitions to a permutation,{} which maps {\\em ls.i} to {\\em ls.i+1},{} indices modulo the length of the list. Error: if repetitions occur.") (($ (|List| (|List| |#1|))) "\\spad{coerce(lls)} coerces a list of cycles {\\em lls} to a permutation,{} each cycle being a list with no repetitions,{} is coerced to the permutation,{} which maps {\\em ls.i} to {\\em ls.i+1},{} indices modulo the length of the list,{} then these permutations are mutiplied. Error: if repetitions occur in one cycle.")) (|coercePreimagesImages| (($ (|List| (|List| |#1|))) "\\spad{coercePreimagesImages(lls)} coerces the representation {\\em lls} of a permutation as a list of preimages and images to a permutation. We assume that both preimage and image do not contain repetitions.")) (|listRepresentation| (((|Record| (|:| |preimage| (|List| |#1|)) (|:| |image| (|List| |#1|))) $) "\\spad{listRepresentation(p)} produces a representation {\\em rep} of the permutation \\spad{p} as a list of preimages and images,{} \\spad{i}.\\spad{e} \\spad{p} maps {\\em (rep.preimage).k} to {\\em (rep.image).k} for all indices \\spad{k}. Elements of \\spad{S} not in {\\em (rep.preimage).k} are fixed points,{} and these are the only fixed points of the permutation."))) ((-4413 . T)) -((-2909 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-851)))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-851)))) +((-2871 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-851)))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-851)))) (-907 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 @@ -3576,7 +3576,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."))) ((-4408 . T) (-4414 . T) (-4409 . T) ((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) ((|HasCategory| $ (QUOTE (-147))) (|HasCategory| $ (QUOTE (-145))) (|HasCategory| $ (QUOTE (-370)))) -(-912 R0 -2111 UP UPUP R) +(-912 R0 -3944 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 @@ -3604,7 +3604,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 -(-919 -2111) +(-919 -3944) ((|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 @@ -3620,11 +3620,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}."))) (((-4418 "*") . T)) NIL -(-923 -2111 P) +(-923 -3944 P) ((|constructor| (NIL "This package exports interpolation algorithms")) (|LagrangeInterpolation| ((|#2| (|List| |#1|) (|List| |#1|)) "\\spad{LagrangeInterpolation(l1,l2)} \\undocumented"))) NIL NIL -(-924 |xx| -2111) +(-924 |xx| -3944) ((|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 @@ -3648,7 +3648,7 @@ NIL ((|constructor| (NIL "This package exports plotting tools")) (|calcRanges| (((|List| (|Segment| (|DoubleFloat|))) (|List| (|List| (|Point| (|DoubleFloat|))))) "\\spad{calcRanges(l)} \\undocumented"))) NIL NIL -(-930 R -2111) +(-930 R -3944) ((|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 @@ -3660,7 +3660,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 -(-933 S R -2111) +(-933 S R -3944) ((|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 @@ -3680,11 +3680,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 -887) (|devaluate| |#1|)))) -(-938 R -2111 -2692) +(-938 R -3944 -2703) ((|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 -(-939 -2692) +(-939 -2703) ((|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 @@ -3707,7 +3707,7 @@ NIL (-944 R) ((|constructor| (NIL "This domain implements points in coordinate space"))) ((-4417 . T) (-4416 . T)) -((-2909 (-12 (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) (-2909 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539)))) (-2909 (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-1100)))) (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| (-567) (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-727))) (|HasCategory| |#1| (QUOTE (-1050))) (-12 (|HasCategory| |#1| (QUOTE (-1003))) (|HasCategory| |#1| (QUOTE (-1050)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) +((-2871 (-12 (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) (-2871 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539)))) (-2871 (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-1100)))) (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| (-567) (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-727))) (|HasCategory| |#1| (QUOTE (-1050))) (-12 (|HasCategory| |#1| (QUOTE (-1003))) (|HasCategory| |#1| (QUOTE (-1050)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) (-945 |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 @@ -3732,7 +3732,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}."))) (((-4418 "*") |has| |#1| (-172)) (-4409 |has| |#1| (-559)) (-4414 |has| |#1| (-6 -4414)) (-4411 . T) (-4410 . T) (-4413 . T)) NIL -(-951 E V R P -2111) +(-951 E V R P -3944) ((|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 @@ -3743,8 +3743,8 @@ NIL (-953 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}."))) (((-4418 "*") |has| |#1| (-172)) (-4409 |has| |#1| (-559)) (-4414 |has| |#1| (-6 -4414)) (-4411 . T) (-4410 . T) (-4413 . T)) -((|HasCategory| |#1| (QUOTE (-910))) (-2909 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-910)))) (-2909 (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-910)))) (-2909 (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-910)))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-172))) (-2909 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559)))) (-12 (|HasCategory| (-1176) (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-381))))) (-12 (|HasCategory| (-1176) (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-567))))) (-12 (|HasCategory| (-1176) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381)))))) (-12 (|HasCategory| (-1176) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567)))))) (-12 (|HasCategory| (-1176) (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539))))) (|HasCategory| |#1| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))) (-2909 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567)))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-365))) (|HasAttribute| |#1| (QUOTE -4414)) (|HasCategory| |#1| (QUOTE (-455))) (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-910)))) (-2909 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-910)))) (|HasCategory| |#1| (QUOTE (-145))))) -(-954 E V R P -2111) +((|HasCategory| |#1| (QUOTE (-910))) (-2871 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-910)))) (-2871 (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-910)))) (-2871 (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-910)))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-172))) (-2871 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559)))) (-12 (|HasCategory| (-1176) (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-381))))) (-12 (|HasCategory| (-1176) (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-567))))) (-12 (|HasCategory| (-1176) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381)))))) (-12 (|HasCategory| (-1176) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567)))))) (-12 (|HasCategory| (-1176) (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539))))) (|HasCategory| |#1| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))) (-2871 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567)))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-365))) (|HasAttribute| |#1| (QUOTE -4414)) (|HasCategory| |#1| (QUOTE (-455))) (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-910)))) (-2871 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-910)))) (|HasCategory| |#1| (QUOTE (-145))))) +(-954 E V R P -3944) ((|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 (-455)))) @@ -3767,12 +3767,12 @@ NIL (-959 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"))) ((-4417 . T) (-4416 . T)) -((-2909 (-12 (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) (-2909 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539)))) (-2909 (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-1100)))) (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| (-567) (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) +((-2871 (-12 (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) (-2871 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539)))) (-2871 (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-1100)))) (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| (-567) (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) (-960) ((|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 -(-961 -2111) +(-961 -3944) ((|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 @@ -3787,11 +3787,11 @@ NIL (-964 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}"))) (((-4418 "*") |has| |#1| (-172)) (-4409 |has| |#1| (-559)) (-4414 |has| |#1| (-6 -4414)) (-4410 . T) (-4411 . T) (-4413 . T)) -((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-559))) (-2909 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559)))) (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-147))) (-2909 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567)))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-455))) (-12 (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#2| (QUOTE (-131)))) (|HasAttribute| |#1| (QUOTE -4414))) +((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-559))) (-2871 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559)))) (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-147))) (-2871 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567)))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-455))) (-12 (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#2| (QUOTE (-131)))) (|HasAttribute| |#1| (QUOTE -4414))) (-965 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"))) ((-4413 -12 (|has| |#2| (-476)) (|has| |#1| (-476)))) -((-2909 (-12 (|HasCategory| |#1| (QUOTE (-794))) (|HasCategory| |#2| (QUOTE (-794)))) (-12 (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#2| (QUOTE (-851))))) (-12 (|HasCategory| |#1| (QUOTE (-794))) (|HasCategory| |#2| (QUOTE (-794)))) (-2909 (-12 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-21)))) (-12 (|HasCategory| |#1| (QUOTE (-131))) (|HasCategory| |#2| (QUOTE (-131)))) (-12 (|HasCategory| |#1| (QUOTE (-794))) (|HasCategory| |#2| (QUOTE (-794))))) (-12 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-21)))) (-2909 (-12 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-21)))) (-12 (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-23)))) (-12 (|HasCategory| |#1| (QUOTE (-131))) (|HasCategory| |#2| (QUOTE (-131)))) (-12 (|HasCategory| |#1| (QUOTE (-794))) (|HasCategory| |#2| (QUOTE (-794))))) (-12 (|HasCategory| |#1| (QUOTE (-476))) (|HasCategory| |#2| (QUOTE (-476)))) (-2909 (-12 (|HasCategory| |#1| (QUOTE (-476))) (|HasCategory| |#2| (QUOTE (-476)))) (-12 (|HasCategory| |#1| (QUOTE (-727))) (|HasCategory| |#2| (QUOTE (-727))))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-370)))) (-2909 (-12 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-21)))) (-12 (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-23)))) (-12 (|HasCategory| |#1| (QUOTE (-131))) (|HasCategory| |#2| (QUOTE (-131)))) (-12 (|HasCategory| |#1| (QUOTE (-476))) (|HasCategory| |#2| (QUOTE (-476)))) (-12 (|HasCategory| |#1| (QUOTE (-727))) (|HasCategory| |#2| (QUOTE (-727)))) (-12 (|HasCategory| |#1| (QUOTE (-794))) (|HasCategory| |#2| (QUOTE (-794))))) (-12 (|HasCategory| |#1| (QUOTE (-727))) (|HasCategory| |#2| (QUOTE (-727)))) (-12 (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-23)))) (-12 (|HasCategory| |#1| (QUOTE (-131))) (|HasCategory| |#2| (QUOTE (-131)))) (-12 (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#2| (QUOTE (-851))))) +((-2871 (-12 (|HasCategory| |#1| (QUOTE (-794))) (|HasCategory| |#2| (QUOTE (-794)))) (-12 (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#2| (QUOTE (-851))))) (-12 (|HasCategory| |#1| (QUOTE (-794))) (|HasCategory| |#2| (QUOTE (-794)))) (-2871 (-12 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-21)))) (-12 (|HasCategory| |#1| (QUOTE (-131))) (|HasCategory| |#2| (QUOTE (-131)))) (-12 (|HasCategory| |#1| (QUOTE (-794))) (|HasCategory| |#2| (QUOTE (-794))))) (-12 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-21)))) (-2871 (-12 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-21)))) (-12 (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-23)))) (-12 (|HasCategory| |#1| (QUOTE (-131))) (|HasCategory| |#2| (QUOTE (-131)))) (-12 (|HasCategory| |#1| (QUOTE (-794))) (|HasCategory| |#2| (QUOTE (-794))))) (-12 (|HasCategory| |#1| (QUOTE (-476))) (|HasCategory| |#2| (QUOTE (-476)))) (-2871 (-12 (|HasCategory| |#1| (QUOTE (-476))) (|HasCategory| |#2| (QUOTE (-476)))) (-12 (|HasCategory| |#1| (QUOTE (-727))) (|HasCategory| |#2| (QUOTE (-727))))) (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#2| (QUOTE (-370)))) (-2871 (-12 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-21)))) (-12 (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-23)))) (-12 (|HasCategory| |#1| (QUOTE (-131))) (|HasCategory| |#2| (QUOTE (-131)))) (-12 (|HasCategory| |#1| (QUOTE (-476))) (|HasCategory| |#2| (QUOTE (-476)))) (-12 (|HasCategory| |#1| (QUOTE (-727))) (|HasCategory| |#2| (QUOTE (-727)))) (-12 (|HasCategory| |#1| (QUOTE (-794))) (|HasCategory| |#2| (QUOTE (-794))))) (-12 (|HasCategory| |#1| (QUOTE (-727))) (|HasCategory| |#2| (QUOTE (-727)))) (-12 (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-23)))) (-12 (|HasCategory| |#1| (QUOTE (-131))) (|HasCategory| |#2| (QUOTE (-131)))) (-12 (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#2| (QUOTE (-851))))) (-966) ((|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 @@ -3872,7 +3872,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 -(-986 K R UP -2111) +(-986 K R UP -3944) ((|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 @@ -3931,11 +3931,11 @@ NIL (-1000 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.}"))) ((-4409 |has| |#1| (-291)) (-4410 . T) (-4411 . T) (-4413 . T)) -((|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#1| (QUOTE (-365))) (-2909 (|HasCategory| |#1| (QUOTE (-291))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasCategory| |#1| (QUOTE (-291))) (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#1| (LIST (QUOTE -517) (QUOTE (-1176)) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -287) (|devaluate| |#1|) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-233))) (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (-2909 (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-1060))) (|HasCategory| |#1| (QUOTE (-548)))) +((|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#1| (QUOTE (-365))) (-2871 (|HasCategory| |#1| (QUOTE (-291))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasCategory| |#1| (QUOTE (-291))) (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#1| (LIST (QUOTE -517) (QUOTE (-1176)) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))) (|HasCategory| |#1| (LIST (QUOTE -287) (|devaluate| |#1|) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-233))) (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (-2871 (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-1060))) (|HasCategory| |#1| (QUOTE (-548)))) (-1001 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}."))) ((-4416 . T) (-4417 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1100))) (-2909 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) +((-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1100))) (-2871 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (-1002 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 @@ -3944,14 +3944,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 -(-1004 -2111 UP UPUP |radicnd| |n|) +(-1004 -3944 UP UPUP |radicnd| |n|) ((|constructor| (NIL "Function field defined by y**n = \\spad{f}(\\spad{x})."))) ((-4409 |has| (-410 |#2|) (-365)) (-4414 |has| (-410 |#2|) (-365)) (-4408 |has| (-410 |#2|) (-365)) ((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) -((|HasCategory| (-410 |#2|) (QUOTE (-145))) (|HasCategory| (-410 |#2|) (QUOTE (-147))) (|HasCategory| (-410 |#2|) (QUOTE (-351))) (-2909 (|HasCategory| (-410 |#2|) (QUOTE (-365))) (|HasCategory| (-410 |#2|) (QUOTE (-351)))) (|HasCategory| (-410 |#2|) (QUOTE (-365))) (|HasCategory| (-410 |#2|) (QUOTE (-370))) (-2909 (-12 (|HasCategory| (-410 |#2|) (QUOTE (-233))) (|HasCategory| (-410 |#2|) (QUOTE (-365)))) (|HasCategory| (-410 |#2|) (QUOTE (-351)))) (-2909 (-12 (|HasCategory| (-410 |#2|) (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| (-410 |#2|) (QUOTE (-365)))) (-12 (|HasCategory| (-410 |#2|) (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| (-410 |#2|) (QUOTE (-351))))) (|HasCategory| (-410 |#2|) (LIST (QUOTE -640) (QUOTE (-567)))) (-2909 (|HasCategory| (-410 |#2|) (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| (-410 |#2|) (QUOTE (-365)))) (|HasCategory| (-410 |#2|) (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| (-410 |#2|) (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-370))) (-12 (|HasCategory| (-410 |#2|) (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| (-410 |#2|) (QUOTE (-365)))) (-12 (|HasCategory| (-410 |#2|) (QUOTE (-233))) (|HasCategory| (-410 |#2|) (QUOTE (-365))))) +((|HasCategory| (-410 |#2|) (QUOTE (-145))) (|HasCategory| (-410 |#2|) (QUOTE (-147))) (|HasCategory| (-410 |#2|) (QUOTE (-351))) (-2871 (|HasCategory| (-410 |#2|) (QUOTE (-365))) (|HasCategory| (-410 |#2|) (QUOTE (-351)))) (|HasCategory| (-410 |#2|) (QUOTE (-365))) (|HasCategory| (-410 |#2|) (QUOTE (-370))) (-2871 (-12 (|HasCategory| (-410 |#2|) (QUOTE (-233))) (|HasCategory| (-410 |#2|) (QUOTE (-365)))) (|HasCategory| (-410 |#2|) (QUOTE (-351)))) (-2871 (-12 (|HasCategory| (-410 |#2|) (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| (-410 |#2|) (QUOTE (-365)))) (-12 (|HasCategory| (-410 |#2|) (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| (-410 |#2|) (QUOTE (-351))))) (|HasCategory| (-410 |#2|) (LIST (QUOTE -640) (QUOTE (-567)))) (-2871 (|HasCategory| (-410 |#2|) (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| (-410 |#2|) (QUOTE (-365)))) (|HasCategory| (-410 |#2|) (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| (-410 |#2|) (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-370))) (-12 (|HasCategory| (-410 |#2|) (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| (-410 |#2|) (QUOTE (-365)))) (-12 (|HasCategory| (-410 |#2|) (QUOTE (-233))) (|HasCategory| (-410 |#2|) (QUOTE (-365))))) (-1005 |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."))) ((-4408 . T) (-4414 . T) (-4409 . T) ((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) -((|HasCategory| (-567) (QUOTE (-910))) (|HasCategory| (-567) (LIST (QUOTE -1039) (QUOTE (-1176)))) (|HasCategory| (-567) (QUOTE (-145))) (|HasCategory| (-567) (QUOTE (-147))) (|HasCategory| (-567) (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| (-567) (QUOTE (-1023))) (|HasCategory| (-567) (QUOTE (-821))) (-2909 (|HasCategory| (-567) (QUOTE (-821))) (|HasCategory| (-567) (QUOTE (-851)))) (|HasCategory| (-567) (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| (-567) (QUOTE (-1151))) (|HasCategory| (-567) (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| (-567) (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| (-567) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| (-567) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| (-567) (QUOTE (-233))) (|HasCategory| (-567) (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| (-567) (LIST (QUOTE -517) (QUOTE (-1176)) (QUOTE (-567)))) (|HasCategory| (-567) (LIST (QUOTE -310) (QUOTE (-567)))) (|HasCategory| (-567) (LIST (QUOTE -287) (QUOTE (-567)) (QUOTE (-567)))) (|HasCategory| (-567) (QUOTE (-308))) (|HasCategory| (-567) (QUOTE (-548))) (|HasCategory| (-567) (QUOTE (-851))) (|HasCategory| (-567) (LIST (QUOTE -640) (QUOTE (-567)))) (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| (-567) (QUOTE (-910)))) (-2909 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| (-567) (QUOTE (-910)))) (|HasCategory| (-567) (QUOTE (-145))))) +((|HasCategory| (-567) (QUOTE (-910))) (|HasCategory| (-567) (LIST (QUOTE -1039) (QUOTE (-1176)))) (|HasCategory| (-567) (QUOTE (-145))) (|HasCategory| (-567) (QUOTE (-147))) (|HasCategory| (-567) (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| (-567) (QUOTE (-1023))) (|HasCategory| (-567) (QUOTE (-821))) (-2871 (|HasCategory| (-567) (QUOTE (-821))) (|HasCategory| (-567) (QUOTE (-851)))) (|HasCategory| (-567) (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| (-567) (QUOTE (-1151))) (|HasCategory| (-567) (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| (-567) (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| (-567) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| (-567) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| (-567) (QUOTE (-233))) (|HasCategory| (-567) (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| (-567) (LIST (QUOTE -517) (QUOTE (-1176)) (QUOTE (-567)))) (|HasCategory| (-567) (LIST (QUOTE -310) (QUOTE (-567)))) (|HasCategory| (-567) (LIST (QUOTE -287) (QUOTE (-567)) (QUOTE (-567)))) (|HasCategory| (-567) (QUOTE (-308))) (|HasCategory| (-567) (QUOTE (-548))) (|HasCategory| (-567) (QUOTE (-851))) (|HasCategory| (-567) (LIST (QUOTE -640) (QUOTE (-567)))) (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| (-567) (QUOTE (-910)))) (-2871 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| (-567) (QUOTE (-910)))) (|HasCategory| (-567) (QUOTE (-145))))) (-1006) ((|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 @@ -3984,19 +3984,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}}"))) ((-4409 . T) (-4414 . T) (-4408 . T) (-4411 . T) (-4410 . T) ((-4418 "*") . T) (-4413 . T)) NIL -(-1014 R -2111) +(-1014 R -3944) ((|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 -(-1015 R -2111) +(-1015 R -3944) ((|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 -(-1016 -2111 UP) +(-1016 -3944 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 -(-1017 -2111 UP) +(-1017 -3944 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 @@ -4031,8 +4031,8 @@ NIL (-1025 |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"))) ((-4409 . T) (-4414 . T) (-4408 . T) (-4411 . T) (-4410 . T) ((-4418 "*") . T) (-4413 . T)) -((-2909 (|HasCategory| (-410 (-567)) (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| (-410 (-567)) (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| (-410 (-567)) (LIST (QUOTE -1039) (QUOTE (-567))))) -(-1026 -2111 L) +((-2871 (|HasCategory| (-410 (-567)) (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| (-410 (-567)) (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| (-410 (-567)) (LIST (QUOTE -1039) (QUOTE (-567))))) +(-1026 -3944 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 @@ -4068,14 +4068,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 -(-1035 -2111 |Expon| |VarSet| |FPol| |LFPol|) +(-1035 -3944 |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"))) (((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) NIL (-1036) ((|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.}"))) ((-4416 . T) (-4417 . T)) -((-12 (|HasCategory| (-2 (|:| -1762 (-1176)) (|:| -3859 (-52))) (QUOTE (-1100))) (|HasCategory| (-2 (|:| -1762 (-1176)) (|:| -3859 (-52))) (LIST (QUOTE -310) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -1762) (QUOTE (-1176))) (LIST (QUOTE |:|) (QUOTE -3859) (QUOTE (-52))))))) (-2909 (|HasCategory| (-2 (|:| -1762 (-1176)) (|:| -3859 (-52))) (QUOTE (-1100))) (|HasCategory| (-52) (QUOTE (-1100)))) (-2909 (|HasCategory| (-2 (|:| -1762 (-1176)) (|:| -3859 (-52))) (QUOTE (-1100))) (|HasCategory| (-2 (|:| -1762 (-1176)) (|:| -3859 (-52))) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| (-52) (QUOTE (-1100))) (|HasCategory| (-52) (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| (-2 (|:| -1762 (-1176)) (|:| -3859 (-52))) (LIST (QUOTE -615) (QUOTE (-539)))) (-12 (|HasCategory| (-52) (QUOTE (-1100))) (|HasCategory| (-52) (LIST (QUOTE -310) (QUOTE (-52))))) (|HasCategory| (-2 (|:| -1762 (-1176)) (|:| -3859 (-52))) (QUOTE (-1100))) (|HasCategory| (-1176) (QUOTE (-851))) (|HasCategory| (-52) (QUOTE (-1100))) (-2909 (|HasCategory| (-2 (|:| -1762 (-1176)) (|:| -3859 (-52))) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| (-52) (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| (-52) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| (-2 (|:| -1762 (-1176)) (|:| -3859 (-52))) (LIST (QUOTE -614) (QUOTE (-863))))) +((-12 (|HasCategory| (-2 (|:| -1812 (-1176)) (|:| -4217 (-52))) (QUOTE (-1100))) (|HasCategory| (-2 (|:| -1812 (-1176)) (|:| -4217 (-52))) (LIST (QUOTE -310) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -1812) (QUOTE (-1176))) (LIST (QUOTE |:|) (QUOTE -4217) (QUOTE (-52))))))) (-2871 (|HasCategory| (-2 (|:| -1812 (-1176)) (|:| -4217 (-52))) (QUOTE (-1100))) (|HasCategory| (-52) (QUOTE (-1100)))) (-2871 (|HasCategory| (-2 (|:| -1812 (-1176)) (|:| -4217 (-52))) (QUOTE (-1100))) (|HasCategory| (-2 (|:| -1812 (-1176)) (|:| -4217 (-52))) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| (-52) (QUOTE (-1100))) (|HasCategory| (-52) (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| (-2 (|:| -1812 (-1176)) (|:| -4217 (-52))) (LIST (QUOTE -615) (QUOTE (-539)))) (-12 (|HasCategory| (-52) (QUOTE (-1100))) (|HasCategory| (-52) (LIST (QUOTE -310) (QUOTE (-52))))) (|HasCategory| (-2 (|:| -1812 (-1176)) (|:| -4217 (-52))) (QUOTE (-1100))) (|HasCategory| (-1176) (QUOTE (-851))) (|HasCategory| (-52) (QUOTE (-1100))) (-2871 (|HasCategory| (-2 (|:| -1812 (-1176)) (|:| -4217 (-52))) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| (-52) (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| (-52) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| (-2 (|:| -1812 (-1176)) (|:| -4217 (-52))) (LIST (QUOTE -614) (QUOTE (-863))))) (-1037) ((|constructor| (NIL "This domain represents `return' expressions.")) (|expression| (((|SpadAst|) $) "\\spad{expression(e)} returns the expression returned by `e'."))) NIL @@ -4132,7 +4132,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."))) ((-4413 . T)) NIL -(-1051 |xx| -2111) +(-1051 |xx| -3944) ((|constructor| (NIL "This package exports rational interpolation algorithms"))) NIL NIL @@ -4151,7 +4151,7 @@ NIL (-1055 |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}."))) ((-4416 . T) (-4411 . T) (-4410 . T)) -((|HasCategory| |#3| (QUOTE (-172))) (-2909 (-12 (|HasCategory| |#3| (QUOTE (-172))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-365))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1100))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|))))) (|HasCategory| |#3| (LIST (QUOTE -615) (QUOTE (-539)))) (-2909 (|HasCategory| |#3| (QUOTE (-172))) (|HasCategory| |#3| (QUOTE (-365)))) (|HasCategory| |#3| (QUOTE (-365))) (|HasCategory| |#3| (QUOTE (-1100))) (|HasCategory| |#3| (QUOTE (-308))) (|HasCategory| |#3| (QUOTE (-559))) (-12 (|HasCategory| |#3| (QUOTE (-1100))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|)))) (|HasCategory| |#3| (LIST (QUOTE -614) (QUOTE (-863))))) +((|HasCategory| |#3| (QUOTE (-172))) (-2871 (-12 (|HasCategory| |#3| (QUOTE (-172))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-365))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1100))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|))))) (|HasCategory| |#3| (LIST (QUOTE -615) (QUOTE (-539)))) (-2871 (|HasCategory| |#3| (QUOTE (-172))) (|HasCategory| |#3| (QUOTE (-365)))) (|HasCategory| |#3| (QUOTE (-365))) (|HasCategory| |#3| (QUOTE (-1100))) (|HasCategory| |#3| (QUOTE (-308))) (|HasCategory| |#3| (QUOTE (-559))) (-12 (|HasCategory| |#3| (QUOTE (-1100))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|)))) (|HasCategory| |#3| (LIST (QUOTE -614) (QUOTE (-863))))) (-1056 |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 @@ -4183,7 +4183,7 @@ NIL (-1063) ((|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}"))) ((-4416 . T) (-4417 . T)) -((-12 (|HasCategory| (-2 (|:| -1762 (-1176)) (|:| -3859 (-52))) (QUOTE (-1100))) (|HasCategory| (-2 (|:| -1762 (-1176)) (|:| -3859 (-52))) (LIST (QUOTE -310) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -1762) (QUOTE (-1176))) (LIST (QUOTE |:|) (QUOTE -3859) (QUOTE (-52))))))) (-2909 (|HasCategory| (-2 (|:| -1762 (-1176)) (|:| -3859 (-52))) (QUOTE (-1100))) (|HasCategory| (-52) (QUOTE (-1100)))) (-2909 (|HasCategory| (-2 (|:| -1762 (-1176)) (|:| -3859 (-52))) (QUOTE (-1100))) (|HasCategory| (-2 (|:| -1762 (-1176)) (|:| -3859 (-52))) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| (-52) (QUOTE (-1100))) (|HasCategory| (-52) (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| (-2 (|:| -1762 (-1176)) (|:| -3859 (-52))) (LIST (QUOTE -615) (QUOTE (-539)))) (-12 (|HasCategory| (-52) (QUOTE (-1100))) (|HasCategory| (-52) (LIST (QUOTE -310) (QUOTE (-52))))) (|HasCategory| (-2 (|:| -1762 (-1176)) (|:| -3859 (-52))) (QUOTE (-1100))) (|HasCategory| (-1176) (QUOTE (-851))) (|HasCategory| (-52) (QUOTE (-1100))) (-2909 (|HasCategory| (-2 (|:| -1762 (-1176)) (|:| -3859 (-52))) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| (-52) (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| (-52) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| (-2 (|:| -1762 (-1176)) (|:| -3859 (-52))) (LIST (QUOTE -614) (QUOTE (-863))))) +((-12 (|HasCategory| (-2 (|:| -1812 (-1176)) (|:| -4217 (-52))) (QUOTE (-1100))) (|HasCategory| (-2 (|:| -1812 (-1176)) (|:| -4217 (-52))) (LIST (QUOTE -310) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -1812) (QUOTE (-1176))) (LIST (QUOTE |:|) (QUOTE -4217) (QUOTE (-52))))))) (-2871 (|HasCategory| (-2 (|:| -1812 (-1176)) (|:| -4217 (-52))) (QUOTE (-1100))) (|HasCategory| (-52) (QUOTE (-1100)))) (-2871 (|HasCategory| (-2 (|:| -1812 (-1176)) (|:| -4217 (-52))) (QUOTE (-1100))) (|HasCategory| (-2 (|:| -1812 (-1176)) (|:| -4217 (-52))) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| (-52) (QUOTE (-1100))) (|HasCategory| (-52) (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| (-2 (|:| -1812 (-1176)) (|:| -4217 (-52))) (LIST (QUOTE -615) (QUOTE (-539)))) (-12 (|HasCategory| (-52) (QUOTE (-1100))) (|HasCategory| (-52) (LIST (QUOTE -310) (QUOTE (-52))))) (|HasCategory| (-2 (|:| -1812 (-1176)) (|:| -4217 (-52))) (QUOTE (-1100))) (|HasCategory| (-1176) (QUOTE (-851))) (|HasCategory| (-52) (QUOTE (-1100))) (-2871 (|HasCategory| (-2 (|:| -1812 (-1176)) (|:| -4217 (-52))) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| (-52) (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| (-52) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| (-2 (|:| -1812 (-1176)) (|:| -4217 (-52))) (LIST (QUOTE -614) (QUOTE (-863))))) (-1064 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 @@ -4232,11 +4232,11 @@ NIL ((|constructor| (NIL "This domain implements named rules")) (|name| (((|Symbol|) $) "\\spad{name(x)} returns the symbol"))) NIL NIL -(-1076 |Base| R -2111) +(-1076 |Base| R -3944) ((|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 -(-1077 |Base| R -2111) +(-1077 |Base| R -3944) ((|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 @@ -4251,7 +4251,7 @@ NIL (-1080 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."))) ((-4409 |has| |#1| (-365)) (-4414 |has| |#1| (-365)) (-4408 |has| |#1| (-365)) ((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) -((|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-351))) (-2909 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-351)))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-370))) (-2909 (-12 (|HasCategory| |#1| (QUOTE (-233))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasCategory| |#1| (QUOTE (-351)))) (-2909 (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176))))) (-12 (|HasCategory| |#1| (QUOTE (-351))) (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))))) (|HasCategory| |#1| (LIST (QUOTE -640) (QUOTE (-567)))) (-2909 (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176))))) (-12 (|HasCategory| |#1| (QUOTE (-233))) (|HasCategory| |#1| (QUOTE (-365))))) +((|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-351))) (-2871 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-351)))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-370))) (-2871 (-12 (|HasCategory| |#1| (QUOTE (-233))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasCategory| |#1| (QUOTE (-351)))) (-2871 (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176))))) (-12 (|HasCategory| |#1| (QUOTE (-351))) (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))))) (|HasCategory| |#1| (LIST (QUOTE -640) (QUOTE (-567)))) (-2871 (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176))))) (-12 (|HasCategory| |#1| (QUOTE (-233))) (|HasCategory| |#1| (QUOTE (-365))))) (-1081 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 @@ -4279,7 +4279,7 @@ NIL (-1087 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"))) (((-4418 "*") |has| |#1| (-172)) (-4409 |has| |#1| (-559)) (-4414 |has| |#1| (-6 -4414)) (-4411 . T) (-4410 . T) (-4413 . T)) -((|HasCategory| |#1| (QUOTE (-910))) (-2909 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-910)))) (-2909 (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-910)))) (-2909 (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-910)))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-172))) (-2909 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559)))) (-12 (|HasCategory| (-1088 (-1176)) (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-381))))) (-12 (|HasCategory| (-1088 (-1176)) (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-567))))) (-12 (|HasCategory| (-1088 (-1176)) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381)))))) (-12 (|HasCategory| (-1088 (-1176)) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567)))))) (-12 (|HasCategory| (-1088 (-1176)) (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539))))) (|HasCategory| |#1| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))) (-2909 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567)))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-233))) (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#1| (QUOTE (-365))) (|HasAttribute| |#1| (QUOTE -4414)) (|HasCategory| |#1| (QUOTE (-455))) (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-910)))) (-2909 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-910)))) (|HasCategory| |#1| (QUOTE (-145))))) +((|HasCategory| |#1| (QUOTE (-910))) (-2871 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-910)))) (-2871 (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-910)))) (-2871 (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-910)))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-172))) (-2871 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559)))) (-12 (|HasCategory| (-1088 (-1176)) (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-381))))) (-12 (|HasCategory| (-1088 (-1176)) (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-567))))) (-12 (|HasCategory| (-1088 (-1176)) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381)))))) (-12 (|HasCategory| (-1088 (-1176)) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567)))))) (-12 (|HasCategory| (-1088 (-1176)) (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539))))) (|HasCategory| |#1| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))) (-2871 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567)))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-233))) (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#1| (QUOTE (-365))) (|HasAttribute| |#1| (QUOTE -4414)) (|HasCategory| |#1| (QUOTE (-455))) (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-910)))) (-2871 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-910)))) (|HasCategory| |#1| (QUOTE (-145))))) (-1088 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 @@ -4339,7 +4339,7 @@ NIL (-1102 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)}}"))) ((-4416 . T) (-4406 . T) (-4417 . T)) -((-2909 (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) +((-2871 (-12 (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#1| (QUOTE (-370))) (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) (-1103 |Str| |Sym| |Int| |Flt| |Expr|) ((|constructor| (NIL "This category allows the manipulation of Lisp values while keeping the grunge fairly localized.")) (|elt| (($ $ (|List| (|Integer|))) "\\spad{elt((a1,...,an), [i1,...,im])} returns \\spad{(a_i1,...,a_im)}.") (($ $ (|Integer|)) "\\spad{elt((a1,...,an), i)} returns \\spad{ai}.")) (|#| (((|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 @@ -4383,7 +4383,7 @@ NIL (-1113 |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}."))) ((-4410 |has| |#3| (-1050)) (-4411 |has| |#3| (-1050)) (-4413 |has| |#3| (-6 -4413)) ((-4418 "*") |has| |#3| (-172)) (-4416 . T)) -((-2909 (-12 (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-131))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-172))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-233))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-365))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-370))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-727))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-794))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-849))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1050))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1100))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|))) (|HasCategory| |#3| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|))) (|HasCategory| |#3| (LIST (QUOTE -901) (QUOTE (-1176)))))) (-2909 (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (QUOTE (-1100)))) (-12 (|HasCategory| |#3| (QUOTE (-233))) (|HasCategory| |#3| (QUOTE (-1050)))) (-12 (|HasCategory| |#3| (QUOTE (-1050))) (|HasCategory| |#3| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-1050))) (|HasCategory| |#3| (LIST (QUOTE -901) (QUOTE (-1176))))) (-12 (|HasCategory| |#3| (QUOTE (-1100))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1100))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (|HasCategory| |#3| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#3| (QUOTE (-365))) (-2909 (|HasCategory| |#3| (QUOTE (-172))) (|HasCategory| |#3| (QUOTE (-365))) (|HasCategory| |#3| (QUOTE (-1050)))) (-2909 (|HasCategory| |#3| (QUOTE (-172))) (|HasCategory| |#3| (QUOTE (-365)))) (|HasCategory| |#3| (QUOTE (-1050))) (|HasCategory| |#3| (QUOTE (-172))) (|HasCategory| |#3| (QUOTE (-794))) (-2909 (|HasCategory| |#3| (QUOTE (-794))) (|HasCategory| |#3| (QUOTE (-849)))) (|HasCategory| |#3| (QUOTE (-849))) (|HasCategory| |#3| (QUOTE (-727))) (-2909 (|HasCategory| |#3| (QUOTE (-172))) (|HasCategory| |#3| (QUOTE (-1050)))) (|HasCategory| |#3| (QUOTE (-370))) (|HasCategory| |#3| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#3| (LIST (QUOTE -901) (QUOTE (-1176)))) (-2909 (|HasCategory| |#3| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#3| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (QUOTE (-131))) (|HasCategory| |#3| (QUOTE (-172))) (|HasCategory| |#3| (QUOTE (-233))) (|HasCategory| |#3| (QUOTE (-365))) (|HasCategory| |#3| (QUOTE (-1050)))) (-2909 (|HasCategory| |#3| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#3| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#3| (QUOTE (-131))) (|HasCategory| |#3| (QUOTE (-172))) (|HasCategory| |#3| (QUOTE (-233))) (|HasCategory| |#3| (QUOTE (-365))) (|HasCategory| |#3| (QUOTE (-1050)))) (-2909 (|HasCategory| |#3| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#3| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#3| (QUOTE (-172))) (|HasCategory| |#3| (QUOTE (-233))) (|HasCategory| |#3| (QUOTE (-365))) (|HasCategory| |#3| (QUOTE (-1050)))) (-2909 (|HasCategory| |#3| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#3| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#3| (QUOTE (-172))) (|HasCategory| |#3| (QUOTE (-233))) (|HasCategory| |#3| (QUOTE (-1050)))) (|HasCategory| |#3| (QUOTE (-233))) (-2909 (|HasCategory| |#3| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#3| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (QUOTE (-131))) (|HasCategory| |#3| (QUOTE (-172))) (|HasCategory| |#3| (QUOTE (-233))) (|HasCategory| |#3| (QUOTE (-365))) (|HasCategory| |#3| (QUOTE (-370))) (|HasCategory| |#3| (QUOTE (-727))) (|HasCategory| |#3| (QUOTE (-794))) (|HasCategory| |#3| (QUOTE (-849))) (|HasCategory| |#3| (QUOTE (-1050))) (|HasCategory| |#3| (QUOTE (-1100)))) (|HasCategory| |#3| (QUOTE (-1100))) (-2909 (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (LIST (QUOTE -901) (QUOTE (-1176))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (QUOTE (-25)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (QUOTE (-131)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (QUOTE (-172)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (QUOTE (-233)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (QUOTE (-365)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (QUOTE (-370)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (QUOTE (-727)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (QUOTE (-794)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (QUOTE (-849)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (QUOTE (-1050)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (QUOTE (-1100))))) (-2909 (-12 (|HasCategory| |#3| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-131))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-172))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-233))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-365))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-370))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-727))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-794))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-849))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (|HasCategory| |#3| (QUOTE (-1050))) (-12 (|HasCategory| |#3| (QUOTE (-1100))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567)))))) (-2909 (-12 (|HasCategory| |#3| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-131))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-172))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-233))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-365))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-370))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-727))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-794))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-849))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-1050))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-1100))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567)))))) (|HasCategory| (-567) (QUOTE (-851))) (-12 (|HasCategory| |#3| (QUOTE (-1050))) (|HasCategory| |#3| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-233))) (|HasCategory| |#3| (QUOTE (-1050)))) (-12 (|HasCategory| |#3| (QUOTE (-1050))) (|HasCategory| |#3| (LIST (QUOTE -901) (QUOTE (-1176))))) (-2909 (|HasCategory| |#3| (QUOTE (-1050))) (-12 (|HasCategory| |#3| (QUOTE (-1100))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567)))))) (-12 (|HasCategory| |#3| (QUOTE (-1100))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (QUOTE (-1100)))) (|HasAttribute| |#3| (QUOTE -4413)) (|HasCategory| |#3| (QUOTE (-131))) (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| |#3| (QUOTE (-1100))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|))))) +((-2871 (-12 (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-131))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-172))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-233))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-365))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-370))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-727))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-794))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-849))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1050))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1100))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|))) (|HasCategory| |#3| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|))) (|HasCategory| |#3| (LIST (QUOTE -901) (QUOTE (-1176)))))) (-2871 (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (QUOTE (-1100)))) (-12 (|HasCategory| |#3| (QUOTE (-233))) (|HasCategory| |#3| (QUOTE (-1050)))) (-12 (|HasCategory| |#3| (QUOTE (-1050))) (|HasCategory| |#3| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-1050))) (|HasCategory| |#3| (LIST (QUOTE -901) (QUOTE (-1176))))) (-12 (|HasCategory| |#3| (QUOTE (-1100))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1100))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (|HasCategory| |#3| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#3| (QUOTE (-365))) (-2871 (|HasCategory| |#3| (QUOTE (-172))) (|HasCategory| |#3| (QUOTE (-365))) (|HasCategory| |#3| (QUOTE (-1050)))) (-2871 (|HasCategory| |#3| (QUOTE (-172))) (|HasCategory| |#3| (QUOTE (-365)))) (|HasCategory| |#3| (QUOTE (-1050))) (|HasCategory| |#3| (QUOTE (-172))) (|HasCategory| |#3| (QUOTE (-794))) (-2871 (|HasCategory| |#3| (QUOTE (-794))) (|HasCategory| |#3| (QUOTE (-849)))) (|HasCategory| |#3| (QUOTE (-849))) (|HasCategory| |#3| (QUOTE (-727))) (-2871 (|HasCategory| |#3| (QUOTE (-172))) (|HasCategory| |#3| (QUOTE (-1050)))) (|HasCategory| |#3| (QUOTE (-370))) (|HasCategory| |#3| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#3| (LIST (QUOTE -901) (QUOTE (-1176)))) (-2871 (|HasCategory| |#3| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#3| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (QUOTE (-131))) (|HasCategory| |#3| (QUOTE (-172))) (|HasCategory| |#3| (QUOTE (-233))) (|HasCategory| |#3| (QUOTE (-365))) (|HasCategory| |#3| (QUOTE (-1050)))) (-2871 (|HasCategory| |#3| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#3| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#3| (QUOTE (-131))) (|HasCategory| |#3| (QUOTE (-172))) (|HasCategory| |#3| (QUOTE (-233))) (|HasCategory| |#3| (QUOTE (-365))) (|HasCategory| |#3| (QUOTE (-1050)))) (-2871 (|HasCategory| |#3| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#3| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#3| (QUOTE (-172))) (|HasCategory| |#3| (QUOTE (-233))) (|HasCategory| |#3| (QUOTE (-365))) (|HasCategory| |#3| (QUOTE (-1050)))) (-2871 (|HasCategory| |#3| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#3| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#3| (QUOTE (-172))) (|HasCategory| |#3| (QUOTE (-233))) (|HasCategory| |#3| (QUOTE (-1050)))) (|HasCategory| |#3| (QUOTE (-233))) (-2871 (|HasCategory| |#3| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#3| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (QUOTE (-131))) (|HasCategory| |#3| (QUOTE (-172))) (|HasCategory| |#3| (QUOTE (-233))) (|HasCategory| |#3| (QUOTE (-365))) (|HasCategory| |#3| (QUOTE (-370))) (|HasCategory| |#3| (QUOTE (-727))) (|HasCategory| |#3| (QUOTE (-794))) (|HasCategory| |#3| (QUOTE (-849))) (|HasCategory| |#3| (QUOTE (-1050))) (|HasCategory| |#3| (QUOTE (-1100)))) (|HasCategory| |#3| (QUOTE (-1100))) (-2871 (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (LIST (QUOTE -901) (QUOTE (-1176))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (QUOTE (-25)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (QUOTE (-131)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (QUOTE (-172)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (QUOTE (-233)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (QUOTE (-365)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (QUOTE (-370)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (QUOTE (-727)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (QUOTE (-794)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (QUOTE (-849)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (QUOTE (-1050)))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (QUOTE (-1100))))) (-2871 (-12 (|HasCategory| |#3| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-131))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-172))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-233))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-365))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-370))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-727))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-794))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-849))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (|HasCategory| |#3| (QUOTE (-1050))) (-12 (|HasCategory| |#3| (QUOTE (-1100))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567)))))) (-2871 (-12 (|HasCategory| |#3| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-131))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-172))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-233))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-365))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-370))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-727))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-794))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-849))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-1050))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-1100))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567)))))) (|HasCategory| (-567) (QUOTE (-851))) (-12 (|HasCategory| |#3| (QUOTE (-1050))) (|HasCategory| |#3| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (QUOTE (-233))) (|HasCategory| |#3| (QUOTE (-1050)))) (-12 (|HasCategory| |#3| (QUOTE (-1050))) (|HasCategory| |#3| (LIST (QUOTE -901) (QUOTE (-1176))))) (-2871 (|HasCategory| |#3| (QUOTE (-1050))) (-12 (|HasCategory| |#3| (QUOTE (-1100))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567)))))) (-12 (|HasCategory| |#3| (QUOTE (-1100))) (|HasCategory| |#3| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#3| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#3| (QUOTE (-1100)))) (|HasAttribute| |#3| (QUOTE -4413)) (|HasCategory| |#3| (QUOTE (-131))) (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| |#3| (QUOTE (-1100))) (|HasCategory| |#3| (LIST (QUOTE -310) (|devaluate| |#3|))))) (-1114 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 @@ -4392,7 +4392,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 -(-1116 R -2111) +(-1116 R -3944) ((|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 @@ -4431,16 +4431,16 @@ NIL (-1125 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."))) (((-4418 "*") |has| |#1| (-172)) (-4409 |has| |#1| (-559)) (-4414 |has| |#1| (-6 -4414)) (-4411 . T) (-4410 . T) (-4413 . T)) -((|HasCategory| |#1| (QUOTE (-910))) (-2909 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-910)))) (-2909 (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-910)))) (-2909 (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-910)))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-172))) (-2909 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| |#2| (LIST (QUOTE -887) (QUOTE (-381))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -887) (QUOTE (-567))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| |#2| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#2| (LIST (QUOTE -615) (QUOTE (-539))))) (|HasCategory| |#1| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))) (-2909 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567)))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-365))) (|HasAttribute| |#1| (QUOTE -4414)) (|HasCategory| |#1| (QUOTE (-455))) (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-910)))) (-2909 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-910)))) (|HasCategory| |#1| (QUOTE (-145))))) +((|HasCategory| |#1| (QUOTE (-910))) (-2871 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-910)))) (-2871 (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-910)))) (-2871 (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-910)))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-172))) (-2871 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| |#2| (LIST (QUOTE -887) (QUOTE (-381))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -887) (QUOTE (-567))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| |#2| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#2| (LIST (QUOTE -615) (QUOTE (-539))))) (|HasCategory| |#1| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))) (-2871 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567)))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-365))) (|HasAttribute| |#1| (QUOTE -4414)) (|HasCategory| |#1| (QUOTE (-455))) (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-910)))) (-2871 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-910)))) (|HasCategory| |#1| (QUOTE (-145))))) (-1126 |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}."))) (((-4418 "*") |has| |#1| (-172)) (-4409 |has| |#1| (-559)) (-4411 . T) (-4410 . T) (-4413 . T)) -((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-145))) (-2909 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559)))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-365)))) +((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-145))) (-2871 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559)))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-365)))) (-1127 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}"))) ((-4417 . T) (-4416 . T)) NIL -(-1128 UP -2111) +(-1128 UP -3944) ((|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 @@ -4495,11 +4495,11 @@ NIL (-1141 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."))) ((-4416 . T) (-4417 . T)) -((-12 (|HasCategory| (-1140 |#1| |#2|) (LIST (QUOTE -310) (LIST (QUOTE -1140) (|devaluate| |#1|) (|devaluate| |#2|)))) (|HasCategory| (-1140 |#1| |#2|) (QUOTE (-1100)))) (|HasCategory| (-1140 |#1| |#2|) (QUOTE (-1100))) (-2909 (|HasCategory| (-1140 |#1| |#2|) (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| (-1140 |#1| |#2|) (LIST (QUOTE -310) (LIST (QUOTE -1140) (|devaluate| |#1|) (|devaluate| |#2|)))) (|HasCategory| (-1140 |#1| |#2|) (QUOTE (-1100))))) (|HasCategory| (-1140 |#1| |#2|) (LIST (QUOTE -614) (QUOTE (-863))))) +((-12 (|HasCategory| (-1140 |#1| |#2|) (LIST (QUOTE -310) (LIST (QUOTE -1140) (|devaluate| |#1|) (|devaluate| |#2|)))) (|HasCategory| (-1140 |#1| |#2|) (QUOTE (-1100)))) (|HasCategory| (-1140 |#1| |#2|) (QUOTE (-1100))) (-2871 (|HasCategory| (-1140 |#1| |#2|) (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| (-1140 |#1| |#2|) (LIST (QUOTE -310) (LIST (QUOTE -1140) (|devaluate| |#1|) (|devaluate| |#2|)))) (|HasCategory| (-1140 |#1| |#2|) (QUOTE (-1100))))) (|HasCategory| (-1140 |#1| |#2|) (LIST (QUOTE -614) (QUOTE (-863))))) (-1142 |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}."))) ((-4413 . T) (-4405 |has| |#2| (-6 (-4418 "*"))) (-4416 . T) (-4410 . T) (-4411 . T)) -((|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (QUOTE (-233))) (|HasAttribute| |#2| (QUOTE (-4418 "*"))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567)))) (-2909 (-12 (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))))) (|HasCategory| |#2| (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#2| (QUOTE (-308))) (|HasCategory| |#2| (QUOTE (-559))) (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (QUOTE (-365))) (-2909 (|HasAttribute| |#2| (QUOTE (-4418 "*"))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (QUOTE (-233)))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (|HasCategory| |#2| (QUOTE (-172)))) +((|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (QUOTE (-233))) (|HasAttribute| |#2| (QUOTE (-4418 "*"))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567)))) (-2871 (-12 (|HasCategory| |#2| (QUOTE (-233))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))))) (|HasCategory| |#2| (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#2| (QUOTE (-308))) (|HasCategory| |#2| (QUOTE (-559))) (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (QUOTE (-365))) (-2871 (|HasAttribute| |#2| (QUOTE (-4418 "*"))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (QUOTE (-233)))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (|HasCategory| |#2| (QUOTE (-172)))) (-1143 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 @@ -4519,7 +4519,7 @@ NIL (-1147 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}."))) ((-4416 . T) (-4417 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1100))) (-2909 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) +((-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1100))) (-2871 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (-1148 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 @@ -4531,7 +4531,7 @@ NIL (-1150 |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."))) ((-4417 . T)) -((-12 (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (QUOTE (-1100))) (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (LIST (QUOTE -310) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -1762) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3859) (|devaluate| |#2|)))))) (-2909 (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (QUOTE (-1100))) (|HasCategory| |#2| (QUOTE (-1100)))) (-2909 (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (QUOTE (-1100))) (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (LIST (QUOTE -615) (QUOTE (-539)))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (|HasCategory| |#1| (QUOTE (-851))) (-2909 (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (QUOTE (-1100)))) +((-12 (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (QUOTE (-1100))) (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (LIST (QUOTE -310) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -1812) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -4217) (|devaluate| |#2|)))))) (-2871 (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (QUOTE (-1100))) (|HasCategory| |#2| (QUOTE (-1100)))) (-2871 (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (QUOTE (-1100))) (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (LIST (QUOTE -615) (QUOTE (-539)))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (|HasCategory| |#1| (QUOTE (-851))) (-2871 (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (QUOTE (-1100)))) (-1151) ((|constructor| (NIL "A class of objects which can be 'stepped through'. Repeated applications of \\spadfun{nextItem} is guaranteed never to return duplicate items and only return \"failed\" after exhausting all elements of the domain. This assumes that the sequence starts with \\spad{init()}. For infinite domains,{} repeated application of \\spadfun{nextItem} is not required to reach all possible domain elements starting from any initial element. \\blankline Conditional attributes: \\indented{2}{infinite\\tab{15}repeated \\spad{nextItem}\\spad{'s} are never \"failed\".}")) (|nextItem| (((|Union| $ "failed") $) "\\spad{nextItem(x)} returns the next item,{} or \"failed\" if domain is exhausted.")) (|init| (($) "\\spad{init()} chooses an initial object for stepping."))) NIL @@ -4555,7 +4555,7 @@ NIL (-1156 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."))) ((-4417 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1100))) (-2909 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| (-567) (QUOTE (-851))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) +((-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1100))) (-2871 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| (-567) (QUOTE (-851))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (-1157) ((|constructor| (NIL "A category for string-like objects")) (|string| (($ (|Integer|)) "\\spad{string(i)} returns the decimal representation of \\spad{i} in a string"))) ((-4417 . T) (-4416 . T)) @@ -4563,11 +4563,11 @@ NIL (-1158) NIL ((-4417 . T) (-4416 . T)) -((-2909 (-12 (|HasCategory| (-144) (QUOTE (-851))) (|HasCategory| (-144) (LIST (QUOTE -310) (QUOTE (-144))))) (-12 (|HasCategory| (-144) (QUOTE (-1100))) (|HasCategory| (-144) (LIST (QUOTE -310) (QUOTE (-144)))))) (|HasCategory| (-144) (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| (-144) (QUOTE (-851))) (|HasCategory| (-567) (QUOTE (-851))) (|HasCategory| (-144) (QUOTE (-1100))) (|HasCategory| (-144) (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| (-144) (QUOTE (-1100))) (|HasCategory| (-144) (LIST (QUOTE -310) (QUOTE (-144)))))) +((-2871 (-12 (|HasCategory| (-144) (QUOTE (-851))) (|HasCategory| (-144) (LIST (QUOTE -310) (QUOTE (-144))))) (-12 (|HasCategory| (-144) (QUOTE (-1100))) (|HasCategory| (-144) (LIST (QUOTE -310) (QUOTE (-144)))))) (|HasCategory| (-144) (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| (-144) (QUOTE (-851))) (|HasCategory| (-567) (QUOTE (-851))) (|HasCategory| (-144) (QUOTE (-1100))) (|HasCategory| (-144) (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| (-144) (QUOTE (-1100))) (|HasCategory| (-144) (LIST (QUOTE -310) (QUOTE (-144)))))) (-1159 |Entry|) ((|constructor| (NIL "This domain provides tables where the keys are strings. A specialized hash function for strings is used."))) ((-4416 . T) (-4417 . T)) -((-12 (|HasCategory| (-2 (|:| -1762 (-1158)) (|:| -3859 |#1|)) (QUOTE (-1100))) (|HasCategory| (-2 (|:| -1762 (-1158)) (|:| -3859 |#1|)) (LIST (QUOTE -310) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -1762) (QUOTE (-1158))) (LIST (QUOTE |:|) (QUOTE -3859) (|devaluate| |#1|)))))) (-2909 (|HasCategory| (-2 (|:| -1762 (-1158)) (|:| -3859 |#1|)) (QUOTE (-1100))) (|HasCategory| |#1| (QUOTE (-1100)))) (-2909 (|HasCategory| (-2 (|:| -1762 (-1158)) (|:| -3859 |#1|)) (QUOTE (-1100))) (|HasCategory| (-2 (|:| -1762 (-1158)) (|:| -3859 |#1|)) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| (-2 (|:| -1762 (-1158)) (|:| -3859 |#1|)) (LIST (QUOTE -615) (QUOTE (-539)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| (-2 (|:| -1762 (-1158)) (|:| -3859 |#1|)) (QUOTE (-1100))) (|HasCategory| (-1158) (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-1100))) (-2909 (|HasCategory| (-2 (|:| -1762 (-1158)) (|:| -3859 |#1|)) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| (-2 (|:| -1762 (-1158)) (|:| -3859 |#1|)) (LIST (QUOTE -614) (QUOTE (-863))))) +((-12 (|HasCategory| (-2 (|:| -1812 (-1158)) (|:| -4217 |#1|)) (QUOTE (-1100))) (|HasCategory| (-2 (|:| -1812 (-1158)) (|:| -4217 |#1|)) (LIST (QUOTE -310) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -1812) (QUOTE (-1158))) (LIST (QUOTE |:|) (QUOTE -4217) (|devaluate| |#1|)))))) (-2871 (|HasCategory| (-2 (|:| -1812 (-1158)) (|:| -4217 |#1|)) (QUOTE (-1100))) (|HasCategory| |#1| (QUOTE (-1100)))) (-2871 (|HasCategory| (-2 (|:| -1812 (-1158)) (|:| -4217 |#1|)) (QUOTE (-1100))) (|HasCategory| (-2 (|:| -1812 (-1158)) (|:| -4217 |#1|)) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| (-2 (|:| -1812 (-1158)) (|:| -4217 |#1|)) (LIST (QUOTE -615) (QUOTE (-539)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| (-2 (|:| -1812 (-1158)) (|:| -4217 |#1|)) (QUOTE (-1100))) (|HasCategory| (-1158) (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-1100))) (-2871 (|HasCategory| (-2 (|:| -1812 (-1158)) (|:| -4217 |#1|)) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| (-2 (|:| -1812 (-1158)) (|:| -4217 |#1|)) (LIST (QUOTE -614) (QUOTE (-863))))) (-1160 A) ((|constructor| (NIL "StreamTaylorSeriesOperations implements Taylor series arithmetic,{} where a Taylor series is represented by a stream of its coefficients.")) (|power| (((|Stream| |#1|) |#1| (|Stream| |#1|)) "\\spad{power(a,f)} returns the power series \\spad{f} raised to the power \\spad{a}.")) (|lazyGintegrate| (((|Stream| |#1|) (|Mapping| |#1| (|Integer|)) |#1| (|Mapping| (|Stream| |#1|))) "\\spad{lazyGintegrate(f,r,g)} is used for fixed point computations.")) (|mapdiv| (((|Stream| |#1|) (|Stream| |#1|) (|Stream| |#1|)) "\\spad{mapdiv([a0,a1,..],[b0,b1,..])} returns \\spad{[a0/b0,a1/b1,..]}.")) (|powern| (((|Stream| |#1|) (|Fraction| (|Integer|)) (|Stream| |#1|)) "\\spad{powern(r,f)} raises power series \\spad{f} to the power \\spad{r}.")) (|nlde| (((|Stream| |#1|) (|Stream| (|Stream| |#1|))) "\\spad{nlde(u)} solves a first order non-linear differential equation described by \\spad{u} of the form \\spad{[[b<0,0>,b<0,1>,...],[b<1,0>,b<1,1>,.],...]}. the differential equation has the form \\spad{y' = sum(i=0 to infinity,j=0 to infinity,b<i,j>*(x**i)*(y**j))}.")) (|lazyIntegrate| (((|Stream| |#1|) |#1| (|Mapping| (|Stream| |#1|))) "\\spad{lazyIntegrate(r,f)} is a local function used for fixed point computations.")) (|integrate| (((|Stream| |#1|) |#1| (|Stream| |#1|)) "\\spad{integrate(r,a)} returns the integral of the power series \\spad{a} with respect to the power series variableintegration where \\spad{r} denotes the constant of integration. Thus \\spad{integrate(a,[a0,a1,a2,...]) = [a,a0,a1/2,a2/3,...]}.")) (|invmultisect| (((|Stream| |#1|) (|Integer|) (|Integer|) (|Stream| |#1|)) "\\spad{invmultisect(a,b,st)} substitutes \\spad{x**((a+b)*n)} for \\spad{x**n} and multiplies by \\spad{x**b}.")) (|multisect| (((|Stream| |#1|) (|Integer|) (|Integer|) (|Stream| |#1|)) "\\spad{multisect(a,b,st)} selects the coefficients of \\spad{x**((a+b)*n+a)},{} and changes them to \\spad{x**n}.")) (|generalLambert| (((|Stream| |#1|) (|Stream| |#1|) (|Integer|) (|Integer|)) "\\spad{generalLambert(f(x),a,d)} returns \\spad{f(x**a) + f(x**(a + d)) + f(x**(a + 2 d)) + ...}. \\spad{f(x)} should have zero constant coefficient and \\spad{a} and \\spad{d} should be positive.")) (|evenlambert| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{evenlambert(st)} computes \\spad{f(x**2) + f(x**4) + f(x**6) + ...} if \\spad{st} is a stream representing \\spad{f(x)}. This function is used for computing infinite products. If \\spad{f(x)} is a power series with constant coefficient 1,{} then \\spad{prod(f(x**(2*n)),n=1..infinity) = exp(evenlambert(log(f(x))))}.")) (|oddlambert| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{oddlambert(st)} computes \\spad{f(x) + f(x**3) + f(x**5) + ...} if \\spad{st} is a stream representing \\spad{f(x)}. This function is used for computing infinite products. If \\spad{f}(\\spad{x}) is a power series with constant coefficient 1 then \\spad{prod(f(x**(2*n-1)),n=1..infinity) = exp(oddlambert(log(f(x))))}.")) (|lambert| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{lambert(st)} computes \\spad{f(x) + f(x**2) + f(x**3) + ...} if \\spad{st} is a stream representing \\spad{f(x)}. This function is used for computing infinite products. If \\spad{f(x)} is a power series with constant coefficient 1 then \\spad{prod(f(x**n),n = 1..infinity) = exp(lambert(log(f(x))))}.")) (|addiag| (((|Stream| |#1|) (|Stream| (|Stream| |#1|))) "\\spad{addiag(x)} performs diagonal addition of a stream of streams. if \\spad{x} = \\spad{[[a<0,0>,a<0,1>,..],[a<1,0>,a<1,1>,..],[a<2,0>,a<2,1>,..],..]} and \\spad{addiag(x) = [b<0,b<1>,...], then b<k> = sum(i+j=k,a<i,j>)}.")) (|revert| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{revert(a)} computes the inverse of a power series \\spad{a} with respect to composition. the series should have constant coefficient 0 and first order coefficient 1.")) (|lagrange| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{lagrange(g)} produces the power series for \\spad{f} where \\spad{f} is implicitly defined as \\spad{f(z) = z*g(f(z))}.")) (|compose| (((|Stream| |#1|) (|Stream| |#1|) (|Stream| |#1|)) "\\spad{compose(a,b)} composes the power series \\spad{a} with the power series \\spad{b}.")) (|eval| (((|Stream| |#1|) (|Stream| |#1|) |#1|) "\\spad{eval(a,r)} returns a stream of partial sums of the power series \\spad{a} evaluated at the power series variable equal to \\spad{r}.")) (|coerce| (((|Stream| |#1|) |#1|) "\\spad{coerce(r)} converts a ring element \\spad{r} to a stream with one element.")) (|gderiv| (((|Stream| |#1|) (|Mapping| |#1| (|Integer|)) (|Stream| |#1|)) "\\spad{gderiv(f,[a0,a1,a2,..])} returns \\spad{[f(0)*a0,f(1)*a1,f(2)*a2,..]}.")) (|deriv| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{deriv(a)} returns the derivative of the power series with respect to the power series variable. Thus \\spad{deriv([a0,a1,a2,...])} returns \\spad{[a1,2 a2,3 a3,...]}.")) (|mapmult| (((|Stream| |#1|) (|Stream| |#1|) (|Stream| |#1|)) "\\spad{mapmult([a0,a1,..],[b0,b1,..])} returns \\spad{[a0*b0,a1*b1,..]}.")) (|int| (((|Stream| |#1|) |#1|) "\\spad{int(r)} returns [\\spad{r},{}\\spad{r+1},{}\\spad{r+2},{}...],{} where \\spad{r} is a ring element.")) (|oddintegers| (((|Stream| (|Integer|)) (|Integer|)) "\\spad{oddintegers(n)} returns \\spad{[n,n+2,n+4,...]}.")) (|integers| (((|Stream| (|Integer|)) (|Integer|)) "\\spad{integers(n)} returns \\spad{[n,n+1,n+2,...]}.")) (|monom| (((|Stream| |#1|) |#1| (|Integer|)) "\\spad{monom(deg,coef)} is a monomial of degree \\spad{deg} with coefficient \\spad{coef}.")) (|recip| (((|Union| (|Stream| |#1|) "failed") (|Stream| |#1|)) "\\spad{recip(a)} returns the power series reciprocal of \\spad{a},{} or \"failed\" if not possible.")) (/ (((|Stream| |#1|) (|Stream| |#1|) (|Stream| |#1|)) "\\spad{a / b} returns the power series quotient of \\spad{a} by \\spad{b}. An error message is returned if \\spad{b} is not invertible. This function is used in fixed point computations.")) (|exquo| (((|Union| (|Stream| |#1|) "failed") (|Stream| |#1|) (|Stream| |#1|)) "\\spad{exquo(a,b)} returns the power series quotient of \\spad{a} by \\spad{b},{} if the quotient exists,{} and \"failed\" otherwise")) (* (((|Stream| |#1|) (|Stream| |#1|) |#1|) "\\spad{a * r} returns the power series scalar multiplication of \\spad{a} by \\spad{r:} \\spad{[a0,a1,...] * r = [a0 * r,a1 * r,...]}") (((|Stream| |#1|) |#1| (|Stream| |#1|)) "\\spad{r * a} returns the power series scalar multiplication of \\spad{r} by \\spad{a}: \\spad{r * [a0,a1,...] = [r * a0,r * a1,...]}") (((|Stream| |#1|) (|Stream| |#1|) (|Stream| |#1|)) "\\spad{a * b} returns the power series (Cauchy) product of \\spad{a} and \\spad{b:} \\spad{[a0,a1,...] * [b0,b1,...] = [c0,c1,...]} where \\spad{ck = sum(i + j = k,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 @@ -4598,9 +4598,9 @@ NIL NIL (-1167 |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."))) -(((-4418 "*") -2909 (-1410 (|has| |#1| (-365)) (|has| (-1174 |#1| |#2| |#3|) (-821))) (|has| |#1| (-172)) (-1410 (|has| |#1| (-365)) (|has| (-1174 |#1| |#2| |#3|) (-910)))) (-4409 -2909 (-1410 (|has| |#1| (-365)) (|has| (-1174 |#1| |#2| |#3|) (-821))) (|has| |#1| (-559)) (-1410 (|has| |#1| (-365)) (|has| (-1174 |#1| |#2| |#3|) (-910)))) (-4414 |has| |#1| (-365)) (-4408 |has| |#1| (-365)) (-4410 . T) (-4411 . T) (-4413 . T)) -((-2909 (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-821))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-910))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-1023))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-1151))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (LIST (QUOTE -287) (LIST (QUOTE -1174) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1174) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (LIST (QUOTE -310) (LIST (QUOTE -1174) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (LIST (QUOTE -517) (QUOTE (-1176)) (LIST (QUOTE -1174) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (LIST (QUOTE -1039) (QUOTE (-1176)))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567)))))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-172))) (-2909 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559)))) (-2909 (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasCategory| |#1| (QUOTE (-145)))) (-2909 (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasCategory| |#1| (QUOTE (-147)))) (-2909 (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-567)) (|devaluate| |#1|)))))) (-2909 (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-233))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-567)) (|devaluate| |#1|))))) (|HasCategory| (-567) (QUOTE (-1112))) (-2909 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-559)))) (|HasCategory| |#1| (QUOTE (-365))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-910))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (LIST (QUOTE -1039) (QUOTE (-1176)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-1023))) (|HasCategory| |#1| (QUOTE (-365)))) (-2909 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-559)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-821))) (|HasCategory| |#1| (QUOTE (-365)))) (-2909 (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-821))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-365))))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-1151))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (LIST (QUOTE -287) (LIST (QUOTE -1174) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1174) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (LIST (QUOTE -310) (LIST (QUOTE -1174) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (LIST (QUOTE -517) (QUOTE (-1176)) (LIST (QUOTE -1174) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-567))))) (|HasSignature| |#1| (LIST (QUOTE -4101) (LIST (|devaluate| |#1|) (QUOTE (-1176)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-567))))) (-2909 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-960))) (|HasCategory| |#1| (QUOTE (-1201))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasSignature| |#1| (LIST (QUOTE -2113) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1176))))) (|HasSignature| |#1| (LIST (QUOTE -2449) (LIST (LIST (QUOTE -645) (QUOTE (-1176))) (|devaluate| |#1|)))))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-548))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-308))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-910))) (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-145))) (-2909 (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-821))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-910))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasCategory| |#1| (QUOTE (-559)))) (-2909 (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567)))))) (-2909 (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-821))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-910))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasCategory| |#1| (QUOTE (-172)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-910))) (|HasCategory| |#1| (QUOTE (-365)))) (-2909 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-910))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasCategory| |#1| (QUOTE (-145))))) -(-1168 R -2111) +(((-4418 "*") -2871 (-1692 (|has| |#1| (-365)) (|has| (-1174 |#1| |#2| |#3|) (-821))) (|has| |#1| (-172)) (-1692 (|has| |#1| (-365)) (|has| (-1174 |#1| |#2| |#3|) (-910)))) (-4409 -2871 (-1692 (|has| |#1| (-365)) (|has| (-1174 |#1| |#2| |#3|) (-821))) (|has| |#1| (-559)) (-1692 (|has| |#1| (-365)) (|has| (-1174 |#1| |#2| |#3|) (-910)))) (-4414 |has| |#1| (-365)) (-4408 |has| |#1| (-365)) (-4410 . T) (-4411 . T) (-4413 . T)) +((-2871 (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-821))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-910))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-1023))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-1151))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (LIST (QUOTE -287) (LIST (QUOTE -1174) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1174) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (LIST (QUOTE -310) (LIST (QUOTE -1174) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (LIST (QUOTE -517) (QUOTE (-1176)) (LIST (QUOTE -1174) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (LIST (QUOTE -1039) (QUOTE (-1176)))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567)))))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-172))) (-2871 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559)))) (-2871 (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasCategory| |#1| (QUOTE (-145)))) (-2871 (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasCategory| |#1| (QUOTE (-147)))) (-2871 (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-567)) (|devaluate| |#1|)))))) (-2871 (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-233))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-567)) (|devaluate| |#1|))))) (|HasCategory| (-567) (QUOTE (-1112))) (-2871 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-559)))) (|HasCategory| |#1| (QUOTE (-365))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-910))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (LIST (QUOTE -1039) (QUOTE (-1176)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-1023))) (|HasCategory| |#1| (QUOTE (-365)))) (-2871 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-559)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-821))) (|HasCategory| |#1| (QUOTE (-365)))) (-2871 (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-821))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-365))))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-1151))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (LIST (QUOTE -287) (LIST (QUOTE -1174) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1174) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (LIST (QUOTE -310) (LIST (QUOTE -1174) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (LIST (QUOTE -517) (QUOTE (-1176)) (LIST (QUOTE -1174) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-567))))) (|HasSignature| |#1| (LIST (QUOTE -4130) (LIST (|devaluate| |#1|) (QUOTE (-1176)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-567))))) (-2871 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-960))) (|HasCategory| |#1| (QUOTE (-1201))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasSignature| |#1| (LIST (QUOTE -3337) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1176))))) (|HasSignature| |#1| (LIST (QUOTE -2921) (LIST (LIST (QUOTE -645) (QUOTE (-1176))) (|devaluate| |#1|)))))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-548))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-308))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-910))) (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-145))) (-2871 (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-821))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-910))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasCategory| |#1| (QUOTE (-559)))) (-2871 (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567)))))) (-2871 (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-821))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-910))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasCategory| |#1| (QUOTE (-172)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-910))) (|HasCategory| |#1| (QUOTE (-365)))) (-2871 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-910))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1174 |#1| |#2| |#3|) (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasCategory| |#1| (QUOTE (-145))))) +(-1168 R -3944) ((|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 @@ -4619,15 +4619,15 @@ NIL (-1172 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."))) (((-4418 "*") |has| |#1| (-172)) (-4409 |has| |#1| (-559)) (-4412 |has| |#1| (-365)) (-4414 |has| |#1| (-6 -4414)) (-4411 . T) (-4410 . T) (-4413 . T)) -((|HasCategory| |#1| (QUOTE (-910))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-172))) (-2909 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559)))) (-12 (|HasCategory| (-1082) (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-381))))) (-12 (|HasCategory| (-1082) (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-567))))) (-12 (|HasCategory| (-1082) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381)))))) (-12 (|HasCategory| (-1082) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567)))))) (-12 (|HasCategory| (-1082) (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539))))) (|HasCategory| |#1| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))) (-2909 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567)))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (-2909 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-910)))) (-2909 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-910)))) (-2909 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-910)))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-1151))) (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#1| (QUOTE (-233))) (|HasAttribute| |#1| (QUOTE -4414)) (|HasCategory| |#1| (QUOTE (-455))) (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-910)))) (-2909 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-910)))) (|HasCategory| |#1| (QUOTE (-145))))) +((|HasCategory| |#1| (QUOTE (-910))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-172))) (-2871 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559)))) (-12 (|HasCategory| (-1082) (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-381))))) (-12 (|HasCategory| (-1082) (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| |#1| (LIST (QUOTE -887) (QUOTE (-567))))) (-12 (|HasCategory| (-1082) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381)))))) (-12 (|HasCategory| (-1082) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567)))))) (-12 (|HasCategory| (-1082) (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539))))) (|HasCategory| |#1| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))) (-2871 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567)))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (-2871 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-910)))) (-2871 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-910)))) (-2871 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-455))) (|HasCategory| |#1| (QUOTE (-910)))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-1151))) (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#1| (QUOTE (-233))) (|HasAttribute| |#1| (QUOTE -4414)) (|HasCategory| |#1| (QUOTE (-455))) (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-910)))) (-2871 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-910)))) (|HasCategory| |#1| (QUOTE (-145))))) (-1173 |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}."))) (((-4418 "*") |has| |#1| (-172)) (-4409 |has| |#1| (-559)) (-4414 |has| |#1| (-365)) (-4408 |has| |#1| (-365)) (-4410 . T) (-4411 . T) (-4413 . T)) -((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-172))) (-2909 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559)))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-147))) (-12 (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -410) (QUOTE (-567))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -410) (QUOTE (-567))) (|devaluate| |#1|)))) (|HasCategory| (-410 (-567)) (QUOTE (-1112))) (|HasCategory| |#1| (QUOTE (-365))) (-2909 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-559)))) (-2909 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-559)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -410) (QUOTE (-567)))))) (|HasSignature| |#1| (LIST (QUOTE -4101) (LIST (|devaluate| |#1|) (QUOTE (-1176)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -410) (QUOTE (-567)))))) (-2909 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-960))) (|HasCategory| |#1| (QUOTE (-1201))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasSignature| |#1| (LIST (QUOTE -2113) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1176))))) (|HasSignature| |#1| (LIST (QUOTE -2449) (LIST (LIST (QUOTE -645) (QUOTE (-1176))) (|devaluate| |#1|))))))) +((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-172))) (-2871 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559)))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-147))) (-12 (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -410) (QUOTE (-567))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -410) (QUOTE (-567))) (|devaluate| |#1|)))) (|HasCategory| (-410 (-567)) (QUOTE (-1112))) (|HasCategory| |#1| (QUOTE (-365))) (-2871 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-559)))) (-2871 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-559)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -410) (QUOTE (-567)))))) (|HasSignature| |#1| (LIST (QUOTE -4130) (LIST (|devaluate| |#1|) (QUOTE (-1176)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -410) (QUOTE (-567)))))) (-2871 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-960))) (|HasCategory| |#1| (QUOTE (-1201))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasSignature| |#1| (LIST (QUOTE -3337) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1176))))) (|HasSignature| |#1| (LIST (QUOTE -2921) (LIST (LIST (QUOTE -645) (QUOTE (-1176))) (|devaluate| |#1|))))))) (-1174 |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}."))) (((-4418 "*") |has| |#1| (-172)) (-4409 |has| |#1| (-559)) (-4410 . T) (-4411 . T) (-4413 . T)) -((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-559))) (-2909 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559)))) (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-147))) (-12 (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-772)) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-772)) (|devaluate| |#1|)))) (|HasCategory| (-772) (QUOTE (-1112))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-772))))) (|HasSignature| |#1| (LIST (QUOTE -4101) (LIST (|devaluate| |#1|) (QUOTE (-1176)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-772))))) (|HasCategory| |#1| (QUOTE (-365))) (-2909 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-960))) (|HasCategory| |#1| (QUOTE (-1201))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasSignature| |#1| (LIST (QUOTE -2113) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1176))))) (|HasSignature| |#1| (LIST (QUOTE -2449) (LIST (LIST (QUOTE -645) (QUOTE (-1176))) (|devaluate| |#1|))))))) +((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-559))) (-2871 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559)))) (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-147))) (-12 (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-772)) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-772)) (|devaluate| |#1|)))) (|HasCategory| (-772) (QUOTE (-1112))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-772))))) (|HasSignature| |#1| (LIST (QUOTE -4130) (LIST (|devaluate| |#1|) (QUOTE (-1176)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-772))))) (|HasCategory| |#1| (QUOTE (-365))) (-2871 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-960))) (|HasCategory| |#1| (QUOTE (-1201))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasSignature| |#1| (LIST (QUOTE -3337) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1176))))) (|HasSignature| |#1| (LIST (QUOTE -2921) (LIST (LIST (QUOTE -645) (QUOTE (-1176))) (|devaluate| |#1|))))))) (-1175) ((|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 @@ -4643,7 +4643,7 @@ NIL (-1178 R) ((|constructor| (NIL "This domain implements symmetric polynomial"))) (((-4418 "*") |has| |#1| (-172)) (-4409 |has| |#1| (-559)) (-4414 |has| |#1| (-6 -4414)) (-4410 . T) (-4411 . T) (-4413 . T)) -((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-559))) (-2909 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559)))) (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-147))) (-2909 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567)))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-455))) (-12 (|HasCategory| (-972) (QUOTE (-131))) (|HasCategory| |#1| (QUOTE (-559)))) (|HasAttribute| |#1| (QUOTE -4414))) +((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-559))) (-2871 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559)))) (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-147))) (-2871 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567)))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-455))) (-12 (|HasCategory| (-972) (QUOTE (-131))) (|HasCategory| |#1| (QUOTE (-559)))) (|HasAttribute| |#1| (QUOTE -4414))) (-1179) ((|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 @@ -4687,7 +4687,7 @@ NIL (-1189 |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}"))) ((-4416 . T) (-4417 . T)) -((-12 (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (QUOTE (-1100))) (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (LIST (QUOTE -310) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -1762) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -3859) (|devaluate| |#2|)))))) (-2909 (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (QUOTE (-1100))) (|HasCategory| |#2| (QUOTE (-1100)))) (-2909 (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (QUOTE (-1100))) (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (LIST (QUOTE -615) (QUOTE (-539)))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (QUOTE (-1100))) (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#2| (QUOTE (-1100))) (-2909 (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| (-2 (|:| -1762 |#1|) (|:| -3859 |#2|)) (LIST (QUOTE -614) (QUOTE (-863))))) +((-12 (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (QUOTE (-1100))) (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (LIST (QUOTE -310) (LIST (QUOTE -2) (LIST (QUOTE |:|) (QUOTE -1812) (|devaluate| |#1|)) (LIST (QUOTE |:|) (QUOTE -4217) (|devaluate| |#2|)))))) (-2871 (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (QUOTE (-1100))) (|HasCategory| |#2| (QUOTE (-1100)))) (-2871 (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (QUOTE (-1100))) (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (LIST (QUOTE -615) (QUOTE (-539)))) (-12 (|HasCategory| |#2| (QUOTE (-1100))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (QUOTE (-1100))) (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#2| (QUOTE (-1100))) (-2871 (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#2| (LIST (QUOTE -614) (QUOTE (-863)))) (|HasCategory| (-2 (|:| -1812 |#1|) (|:| -4217 |#2|)) (LIST (QUOTE -614) (QUOTE (-863))))) (-1190 R) ((|constructor| (NIL "Expands tangents of sums and scalar products.")) (|tanNa| ((|#1| |#1| (|Integer|)) "\\spad{tanNa(a, n)} returns \\spad{f(a)} such that if \\spad{a = tan(u)} then \\spad{f(a) = tan(n * u)}.")) (|tanAn| (((|SparseUnivariatePolynomial| |#1|) |#1| (|PositiveInteger|)) "\\spad{tanAn(a, n)} returns \\spad{P(x)} such that if \\spad{a = tan(u)} then \\spad{P(tan(u/n)) = 0}.")) (|tanSum| ((|#1| (|List| |#1|)) "\\spad{tanSum([a1,...,an])} returns \\spad{f(a1,...,an)} such that if \\spad{ai = tan(ui)} then \\spad{f(a1,...,an) = tan(u1 + ... + un)}."))) NIL @@ -4739,7 +4739,7 @@ NIL (-1202 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}."))) ((-4417 . T) (-4416 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1100))) (-2909 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) +((-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1100))) (-2871 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (-1203 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 @@ -4748,7 +4748,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 -(-1205 R -2111) +(-1205 R -3944) ((|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 @@ -4756,7 +4756,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 -(-1207 R -2111) +(-1207 R -3944) ((|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 -615) (LIST (QUOTE -893) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -887) (|devaluate| |#1|))) (|HasCategory| |#2| (LIST (QUOTE -615) (LIST (QUOTE -893) (|devaluate| |#1|)))) (|HasCategory| |#2| (LIST (QUOTE -887) (|devaluate| |#1|))))) @@ -4771,7 +4771,7 @@ NIL (-1210 |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}."))) (((-4418 "*") |has| |#1| (-172)) (-4409 |has| |#1| (-559)) (-4411 . T) (-4410 . T) (-4413 . T)) -((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-145))) (-2909 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559)))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-365)))) +((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-145))) (-2871 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559)))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-365)))) (-1211 |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 @@ -4784,7 +4784,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 (-1100))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) -(-1214 -2111) +(-1214 -3944) ((|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 @@ -4847,11 +4847,11 @@ NIL (-1229 |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)}."))) (((-4418 "*") |has| |#1| (-172)) (-4409 |has| |#1| (-559)) (-4414 |has| |#1| (-365)) (-4408 |has| |#1| (-365)) (-4410 . T) (-4411 . T) (-4413 . T)) -((-2909 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -287) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -517) (QUOTE (-1176)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-821)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-851)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-910)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-1023)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-1151)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -615) (QUOTE (-539))))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-1176)))))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-172))) (-2909 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559)))) (-2909 (|HasCategory| |#1| (QUOTE (-145))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-145))))) (-2909 (|HasCategory| |#1| (QUOTE (-147))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-147))))) (-2909 (-12 (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-567)) (|devaluate| |#1|))))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))))) (-2909 (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-233)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-567)) (|devaluate| |#1|))))) (|HasCategory| (-567) (QUOTE (-1112))) (-2909 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-559)))) (|HasCategory| |#1| (QUOTE (-365))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-910)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-1176))))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -615) (QUOTE (-539))))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-1023)))) (-2909 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-559)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-821)))) (-2909 (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-821)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-851))))) (-2909 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381)))))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567)))))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -287) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -517) (QUOTE (-1176)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-821)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-851)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-910)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-1023)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-1151)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -615) (QUOTE (-539))))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -887) (QUOTE (-381))))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -887) (QUOTE (-567))))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-1176)))))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-1151)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -287) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -517) (QUOTE (-1176)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567)))))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381)))))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -887) (QUOTE (-567))))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -887) (QUOTE (-381))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-567))))) (|HasSignature| |#1| (LIST (QUOTE -4101) (LIST (|devaluate| |#1|) (QUOTE (-1176)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-567))))) (-2909 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-960))) (|HasCategory| |#1| (QUOTE (-1201))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasSignature| |#1| (LIST (QUOTE -2113) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1176))))) (|HasSignature| |#1| (LIST (QUOTE -2449) (LIST (LIST (QUOTE -645) (QUOTE (-1176))) (|devaluate| |#1|)))))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-851)))) (|HasCategory| |#2| (QUOTE (-910))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-548)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-308)))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#2| (QUOTE (-145))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-910)))) (-2909 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-910)))) (|HasCategory| |#1| (QUOTE (-145))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-145)))))) +((-2871 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -287) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -517) (QUOTE (-1176)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-821)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-851)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-910)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-1023)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-1151)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -615) (QUOTE (-539))))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-1176)))))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-172))) (-2871 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559)))) (-2871 (|HasCategory| |#1| (QUOTE (-145))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-145))))) (-2871 (|HasCategory| |#1| (QUOTE (-147))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-147))))) (-2871 (-12 (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-567)) (|devaluate| |#1|))))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))))) (-2871 (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-233)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-567)) (|devaluate| |#1|))))) (|HasCategory| (-567) (QUOTE (-1112))) (-2871 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-559)))) (|HasCategory| |#1| (QUOTE (-365))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-910)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-1176))))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -615) (QUOTE (-539))))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-1023)))) (-2871 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-559)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-821)))) (-2871 (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-821)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-851))))) (-2871 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381)))))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567)))))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -287) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -517) (QUOTE (-1176)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-821)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-851)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-910)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-1023)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-1151)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -615) (QUOTE (-539))))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -887) (QUOTE (-381))))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -887) (QUOTE (-567))))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-1176)))))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567))))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-1151)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -287) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -310) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -517) (QUOTE (-1176)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567))))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567)))))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381)))))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -887) (QUOTE (-567))))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (LIST (QUOTE -887) (QUOTE (-381))))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-567))))) (|HasSignature| |#1| (LIST (QUOTE -4130) (LIST (|devaluate| |#1|) (QUOTE (-1176)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-567))))) (-2871 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-960))) (|HasCategory| |#1| (QUOTE (-1201))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasSignature| |#1| (LIST (QUOTE -3337) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1176))))) (|HasSignature| |#1| (LIST (QUOTE -2921) (LIST (LIST (QUOTE -645) (QUOTE (-1176))) (|devaluate| |#1|)))))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-851)))) (|HasCategory| |#2| (QUOTE (-910))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-548)))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-308)))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#2| (QUOTE (-145))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-910)))) (-2871 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-910)))) (|HasCategory| |#1| (QUOTE (-145))) (-12 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-145)))))) (-1230 |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."))) -(((-4418 "*") -2909 (-1410 (|has| |#1| (-365)) (|has| (-1258 |#1| |#2| |#3|) (-821))) (|has| |#1| (-172)) (-1410 (|has| |#1| (-365)) (|has| (-1258 |#1| |#2| |#3|) (-910)))) (-4409 -2909 (-1410 (|has| |#1| (-365)) (|has| (-1258 |#1| |#2| |#3|) (-821))) (|has| |#1| (-559)) (-1410 (|has| |#1| (-365)) (|has| (-1258 |#1| |#2| |#3|) (-910)))) (-4414 |has| |#1| (-365)) (-4408 |has| |#1| (-365)) (-4410 . T) (-4411 . T) (-4413 . T)) -((-2909 (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-821))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-910))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-1023))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-1151))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (LIST (QUOTE -287) (LIST (QUOTE -1258) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1258) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (LIST (QUOTE -310) (LIST (QUOTE -1258) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (LIST (QUOTE -517) (QUOTE (-1176)) (LIST (QUOTE -1258) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (LIST (QUOTE -1039) (QUOTE (-1176)))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567)))))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-172))) (-2909 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559)))) (-2909 (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasCategory| |#1| (QUOTE (-145)))) (-2909 (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasCategory| |#1| (QUOTE (-147)))) (-2909 (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-567)) (|devaluate| |#1|)))))) (-2909 (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-233))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-567)) (|devaluate| |#1|))))) (|HasCategory| (-567) (QUOTE (-1112))) (-2909 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-559)))) (|HasCategory| |#1| (QUOTE (-365))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-910))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (LIST (QUOTE -1039) (QUOTE (-1176)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-1023))) (|HasCategory| |#1| (QUOTE (-365)))) (-2909 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-559)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-821))) (|HasCategory| |#1| (QUOTE (-365)))) (-2909 (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-821))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-365))))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-1151))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (LIST (QUOTE -287) (LIST (QUOTE -1258) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1258) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (LIST (QUOTE -310) (LIST (QUOTE -1258) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (LIST (QUOTE -517) (QUOTE (-1176)) (LIST (QUOTE -1258) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-567))))) (|HasSignature| |#1| (LIST (QUOTE -4101) (LIST (|devaluate| |#1|) (QUOTE (-1176)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-567))))) (-2909 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-960))) (|HasCategory| |#1| (QUOTE (-1201))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasSignature| |#1| (LIST (QUOTE -2113) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1176))))) (|HasSignature| |#1| (LIST (QUOTE -2449) (LIST (LIST (QUOTE -645) (QUOTE (-1176))) (|devaluate| |#1|)))))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-548))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-308))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-910))) (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-145))) (-2909 (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-821))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-910))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasCategory| |#1| (QUOTE (-559)))) (-2909 (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567)))))) (-2909 (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-821))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-910))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasCategory| |#1| (QUOTE (-172)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-910))) (|HasCategory| |#1| (QUOTE (-365)))) (-2909 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-910))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasCategory| |#1| (QUOTE (-145))))) +(((-4418 "*") -2871 (-1692 (|has| |#1| (-365)) (|has| (-1258 |#1| |#2| |#3|) (-821))) (|has| |#1| (-172)) (-1692 (|has| |#1| (-365)) (|has| (-1258 |#1| |#2| |#3|) (-910)))) (-4409 -2871 (-1692 (|has| |#1| (-365)) (|has| (-1258 |#1| |#2| |#3|) (-821))) (|has| |#1| (-559)) (-1692 (|has| |#1| (-365)) (|has| (-1258 |#1| |#2| |#3|) (-910)))) (-4414 |has| |#1| (-365)) (-4408 |has| |#1| (-365)) (-4410 . T) (-4411 . T) (-4413 . T)) +((-2871 (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-821))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-910))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-1023))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-1151))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (LIST (QUOTE -287) (LIST (QUOTE -1258) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1258) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (LIST (QUOTE -310) (LIST (QUOTE -1258) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (LIST (QUOTE -517) (QUOTE (-1176)) (LIST (QUOTE -1258) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (LIST (QUOTE -1039) (QUOTE (-1176)))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567)))))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-172))) (-2871 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559)))) (-2871 (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasCategory| |#1| (QUOTE (-145)))) (-2871 (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasCategory| |#1| (QUOTE (-147)))) (-2871 (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-567)) (|devaluate| |#1|)))))) (-2871 (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-233))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-567)) (|devaluate| |#1|))))) (|HasCategory| (-567) (QUOTE (-1112))) (-2871 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-559)))) (|HasCategory| |#1| (QUOTE (-365))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-910))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (LIST (QUOTE -1039) (QUOTE (-1176)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-1023))) (|HasCategory| |#1| (QUOTE (-365)))) (-2871 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-559)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-821))) (|HasCategory| |#1| (QUOTE (-365)))) (-2871 (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-821))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-365))))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-1151))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (LIST (QUOTE -287) (LIST (QUOTE -1258) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (LIST (QUOTE -1258) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (LIST (QUOTE -310) (LIST (QUOTE -1258) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (LIST (QUOTE -517) (QUOTE (-1176)) (LIST (QUOTE -1258) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-567))))) (|HasSignature| |#1| (LIST (QUOTE -4130) (LIST (|devaluate| |#1|) (QUOTE (-1176)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-567))))) (-2871 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-960))) (|HasCategory| |#1| (QUOTE (-1201))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasSignature| |#1| (LIST (QUOTE -3337) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1176))))) (|HasSignature| |#1| (LIST (QUOTE -2921) (LIST (LIST (QUOTE -645) (QUOTE (-1176))) (|devaluate| |#1|)))))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-548))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-308))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-910))) (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-145))) (-2871 (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-821))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-910))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasCategory| |#1| (QUOTE (-559)))) (-2871 (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567)))))) (-2871 (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-821))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-910))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasCategory| |#1| (QUOTE (-172)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-910))) (|HasCategory| |#1| (QUOTE (-365)))) (-2871 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-910))) (|HasCategory| |#1| (QUOTE (-365)))) (-12 (|HasCategory| (-1258 |#1| |#2| |#3|) (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-365)))) (|HasCategory| |#1| (QUOTE (-145))))) (-1231 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 @@ -4887,7 +4887,7 @@ NIL (-1239 |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}"))) (((-4418 "*") |has| |#2| (-172)) (-4409 |has| |#2| (-559)) (-4412 |has| |#2| (-365)) (-4414 |has| |#2| (-6 -4414)) (-4411 . T) (-4410 . T) (-4413 . T)) -((|HasCategory| |#2| (QUOTE (-910))) (|HasCategory| |#2| (QUOTE (-559))) (|HasCategory| |#2| (QUOTE (-172))) (-2909 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-559)))) (-12 (|HasCategory| (-1082) (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| |#2| (LIST (QUOTE -887) (QUOTE (-381))))) (-12 (|HasCategory| (-1082) (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -887) (QUOTE (-567))))) (-12 (|HasCategory| (-1082) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| |#2| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381)))))) (-12 (|HasCategory| (-1082) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567)))))) (-12 (|HasCategory| (-1082) (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#2| (LIST (QUOTE -615) (QUOTE (-539))))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-145))) (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567)))) (-2909 (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567)))))) (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (-2909 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-455))) (|HasCategory| |#2| (QUOTE (-559))) (|HasCategory| |#2| (QUOTE (-910)))) (-2909 (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-455))) (|HasCategory| |#2| (QUOTE (-559))) (|HasCategory| |#2| (QUOTE (-910)))) (-2909 (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-455))) (|HasCategory| |#2| (QUOTE (-910)))) (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-1151))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (QUOTE (-233))) (|HasAttribute| |#2| (QUOTE -4414)) (|HasCategory| |#2| (QUOTE (-455))) (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#2| (QUOTE (-910)))) (-2909 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#2| (QUOTE (-910)))) (|HasCategory| |#2| (QUOTE (-145))))) +((|HasCategory| |#2| (QUOTE (-910))) (|HasCategory| |#2| (QUOTE (-559))) (|HasCategory| |#2| (QUOTE (-172))) (-2871 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-559)))) (-12 (|HasCategory| (-1082) (LIST (QUOTE -887) (QUOTE (-381)))) (|HasCategory| |#2| (LIST (QUOTE -887) (QUOTE (-381))))) (-12 (|HasCategory| (-1082) (LIST (QUOTE -887) (QUOTE (-567)))) (|HasCategory| |#2| (LIST (QUOTE -887) (QUOTE (-567))))) (-12 (|HasCategory| (-1082) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381))))) (|HasCategory| |#2| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-381)))))) (-12 (|HasCategory| (-1082) (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -615) (LIST (QUOTE -893) (QUOTE (-567)))))) (-12 (|HasCategory| (-1082) (LIST (QUOTE -615) (QUOTE (-539)))) (|HasCategory| |#2| (LIST (QUOTE -615) (QUOTE (-539))))) (|HasCategory| |#2| (LIST (QUOTE -640) (QUOTE (-567)))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-145))) (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -1039) (QUOTE (-567)))) (-2871 (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567)))))) (|HasCategory| |#2| (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (-2871 (|HasCategory| |#2| (QUOTE (-172))) (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-455))) (|HasCategory| |#2| (QUOTE (-559))) (|HasCategory| |#2| (QUOTE (-910)))) (-2871 (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-455))) (|HasCategory| |#2| (QUOTE (-559))) (|HasCategory| |#2| (QUOTE (-910)))) (-2871 (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-455))) (|HasCategory| |#2| (QUOTE (-910)))) (|HasCategory| |#2| (QUOTE (-365))) (|HasCategory| |#2| (QUOTE (-1151))) (|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasCategory| |#2| (QUOTE (-233))) (|HasAttribute| |#2| (QUOTE -4414)) (|HasCategory| |#2| (QUOTE (-455))) (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#2| (QUOTE (-910)))) (-2871 (-12 (|HasCategory| $ (QUOTE (-145))) (|HasCategory| |#2| (QUOTE (-910)))) (|HasCategory| |#2| (QUOTE (-145))))) (-1240 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 @@ -4903,7 +4903,7 @@ NIL (-1243 S |Coef| |Expon|) ((|constructor| (NIL "\\spadtype{UnivariatePowerSeriesCategory} is the most general univariate power series category with exponents in an ordered abelian monoid. Note: this category exports a substitution function if it is possible to multiply exponents. Note: this category exports a derivative operation if it is possible to multiply coefficients by exponents.")) (|eval| (((|Stream| |#2|) $ |#2|) "\\spad{eval(f,a)} evaluates a power series at a value in the ground ring by returning a stream of partial sums.")) (|extend| (($ $ |#3|) "\\spad{extend(f,n)} causes all terms of \\spad{f} of degree \\spad{<=} \\spad{n} to be computed.")) (|approximate| ((|#2| $ |#3|) "\\spad{approximate(f)} returns a truncated power series with the series variable viewed as an element of the coefficient domain.")) (|truncate| (($ $ |#3| |#3|) "\\spad{truncate(f,k1,k2)} returns a (finite) power series consisting of the sum of all terms of \\spad{f} of degree \\spad{d} with \\spad{k1 <= d <= k2}.") (($ $ |#3|) "\\spad{truncate(f,k)} returns a (finite) power series consisting of the sum of all terms of \\spad{f} of degree \\spad{<= k}.")) (|order| ((|#3| $ |#3|) "\\spad{order(f,n) = min(m,n)},{} where \\spad{m} is the degree of the lowest order non-zero term in \\spad{f}.") ((|#3| $) "\\spad{order(f)} is the degree of the lowest order non-zero term in \\spad{f}. This will result in an infinite loop if \\spad{f} has no non-zero terms.")) (|multiplyExponents| (($ $ (|PositiveInteger|)) "\\spad{multiplyExponents(f,n)} multiplies all exponents of the power series \\spad{f} by the positive integer \\spad{n}.")) (|center| ((|#2| $) "\\spad{center(f)} returns the point about which the series \\spad{f} is expanded.")) (|variable| (((|Symbol|) $) "\\spad{variable(f)} returns the (unique) power series variable of the power series \\spad{f}.")) (|elt| ((|#2| $ |#3|) "\\spad{elt(f(x),r)} returns the coefficient of the term of degree \\spad{r} in \\spad{f(x)}. This is the same as the function \\spadfun{coefficient}.")) (|terms| (((|Stream| (|Record| (|:| |k| |#3|) (|:| |c| |#2|))) $) "\\spad{terms(f(x))} returns a stream of non-zero terms,{} where a a term is an exponent-coefficient pair. The terms in the stream are ordered by increasing order of exponents."))) NIL -((|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasSignature| |#2| (LIST (QUOTE *) (LIST (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#2|)))) (|HasCategory| |#3| (QUOTE (-1112))) (|HasSignature| |#2| (LIST (QUOTE **) (LIST (|devaluate| |#2|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasSignature| |#2| (LIST (QUOTE -4101) (LIST (|devaluate| |#2|) (QUOTE (-1176)))))) +((|HasCategory| |#2| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasSignature| |#2| (LIST (QUOTE *) (LIST (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#2|)))) (|HasCategory| |#3| (QUOTE (-1112))) (|HasSignature| |#2| (LIST (QUOTE **) (LIST (|devaluate| |#2|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasSignature| |#2| (LIST (QUOTE -4130) (LIST (|devaluate| |#2|) (QUOTE (-1176)))))) (-1244 |Coef| |Expon|) ((|constructor| (NIL "\\spadtype{UnivariatePowerSeriesCategory} is the most general univariate power series category with exponents in an ordered abelian monoid. Note: this category exports a substitution function if it is possible to multiply exponents. Note: this category exports a derivative operation if it is possible to multiply coefficients by exponents.")) (|eval| (((|Stream| |#1|) $ |#1|) "\\spad{eval(f,a)} evaluates a power series at a value in the ground ring by returning a stream of partial sums.")) (|extend| (($ $ |#2|) "\\spad{extend(f,n)} causes all terms of \\spad{f} of degree \\spad{<=} \\spad{n} to be computed.")) (|approximate| ((|#1| $ |#2|) "\\spad{approximate(f)} returns a truncated power series with the series variable viewed as an element of the coefficient domain.")) (|truncate| (($ $ |#2| |#2|) "\\spad{truncate(f,k1,k2)} returns a (finite) power series consisting of the sum of all terms of \\spad{f} of degree \\spad{d} with \\spad{k1 <= d <= k2}.") (($ $ |#2|) "\\spad{truncate(f,k)} returns a (finite) power series consisting of the sum of all terms of \\spad{f} of degree \\spad{<= k}.")) (|order| ((|#2| $ |#2|) "\\spad{order(f,n) = min(m,n)},{} where \\spad{m} is the degree of the lowest order non-zero term in \\spad{f}.") ((|#2| $) "\\spad{order(f)} is the degree of the lowest order non-zero term in \\spad{f}. This will result in an infinite loop if \\spad{f} has no non-zero terms.")) (|multiplyExponents| (($ $ (|PositiveInteger|)) "\\spad{multiplyExponents(f,n)} multiplies all exponents of the power series \\spad{f} by the positive integer \\spad{n}.")) (|center| ((|#1| $) "\\spad{center(f)} returns the point about which the series \\spad{f} is expanded.")) (|variable| (((|Symbol|) $) "\\spad{variable(f)} returns the (unique) power series variable of the power series \\spad{f}.")) (|elt| ((|#1| $ |#2|) "\\spad{elt(f(x),r)} returns the coefficient of the term of degree \\spad{r} in \\spad{f(x)}. This is the same as the function \\spadfun{coefficient}.")) (|terms| (((|Stream| (|Record| (|:| |k| |#2|) (|:| |c| |#1|))) $) "\\spad{terms(f(x))} returns a stream of non-zero terms,{} where a a term is an exponent-coefficient pair. The terms in the stream are ordered by increasing order of exponents."))) (((-4418 "*") |has| |#1| (-172)) (-4409 |has| |#1| (-559)) (-4410 . T) (-4411 . T) (-4413 . T)) @@ -4931,15 +4931,15 @@ NIL (-1250 |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)}."))) (((-4418 "*") |has| |#1| (-172)) (-4409 |has| |#1| (-559)) (-4414 |has| |#1| (-365)) (-4408 |has| |#1| (-365)) (-4410 . T) (-4411 . T) (-4413 . T)) -((|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-172))) (-2909 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559)))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-147))) (-12 (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -410) (QUOTE (-567))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -410) (QUOTE (-567))) (|devaluate| |#1|)))) (|HasCategory| (-410 (-567)) (QUOTE (-1112))) (|HasCategory| |#1| (QUOTE (-365))) (-2909 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-559)))) (-2909 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-559)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -410) (QUOTE (-567)))))) (|HasSignature| |#1| (LIST (QUOTE -4101) (LIST (|devaluate| |#1|) (QUOTE (-1176)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -410) (QUOTE (-567)))))) (-2909 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-960))) (|HasCategory| |#1| (QUOTE (-1201))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasSignature| |#1| (LIST (QUOTE -2113) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1176))))) (|HasSignature| |#1| (LIST (QUOTE -2449) (LIST (LIST (QUOTE -645) (QUOTE (-1176))) (|devaluate| |#1|)))))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567)))))) +((|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-172))) (-2871 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559)))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-147))) (-12 (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -410) (QUOTE (-567))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -410) (QUOTE (-567))) (|devaluate| |#1|)))) (|HasCategory| (-410 (-567)) (QUOTE (-1112))) (|HasCategory| |#1| (QUOTE (-365))) (-2871 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-559)))) (-2871 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-559)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -410) (QUOTE (-567)))))) (|HasSignature| |#1| (LIST (QUOTE -4130) (LIST (|devaluate| |#1|) (QUOTE (-1176)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -410) (QUOTE (-567)))))) (-2871 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-960))) (|HasCategory| |#1| (QUOTE (-1201))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasSignature| |#1| (LIST (QUOTE -3337) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1176))))) (|HasSignature| |#1| (LIST (QUOTE -2921) (LIST (LIST (QUOTE -645) (QUOTE (-1176))) (|devaluate| |#1|)))))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567)))))) (-1251 |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}."))) (((-4418 "*") |has| |#1| (-172)) (-4409 |has| |#1| (-559)) (-4414 |has| |#1| (-365)) (-4408 |has| |#1| (-365)) (-4410 . T) (-4411 . T) (-4413 . T)) -((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-172))) (-2909 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559)))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-147))) (-12 (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -410) (QUOTE (-567))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -410) (QUOTE (-567))) (|devaluate| |#1|)))) (|HasCategory| (-410 (-567)) (QUOTE (-1112))) (|HasCategory| |#1| (QUOTE (-365))) (-2909 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-559)))) (-2909 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-559)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -410) (QUOTE (-567)))))) (|HasSignature| |#1| (LIST (QUOTE -4101) (LIST (|devaluate| |#1|) (QUOTE (-1176)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -410) (QUOTE (-567)))))) (-2909 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-960))) (|HasCategory| |#1| (QUOTE (-1201))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasSignature| |#1| (LIST (QUOTE -2113) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1176))))) (|HasSignature| |#1| (LIST (QUOTE -2449) (LIST (LIST (QUOTE -645) (QUOTE (-1176))) (|devaluate| |#1|))))))) +((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-172))) (-2871 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559)))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-147))) (-12 (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -410) (QUOTE (-567))) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (LIST (QUOTE -410) (QUOTE (-567))) (|devaluate| |#1|)))) (|HasCategory| (-410 (-567)) (QUOTE (-1112))) (|HasCategory| |#1| (QUOTE (-365))) (-2871 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-559)))) (-2871 (|HasCategory| |#1| (QUOTE (-365))) (|HasCategory| |#1| (QUOTE (-559)))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -410) (QUOTE (-567)))))) (|HasSignature| |#1| (LIST (QUOTE -4130) (LIST (|devaluate| |#1|) (QUOTE (-1176)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (LIST (QUOTE -410) (QUOTE (-567)))))) (-2871 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-960))) (|HasCategory| |#1| (QUOTE (-1201))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasSignature| |#1| (LIST (QUOTE -3337) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1176))))) (|HasSignature| |#1| (LIST (QUOTE -2921) (LIST (LIST (QUOTE -645) (QUOTE (-1176))) (|devaluate| |#1|))))))) (-1252 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))}."))) (((-4418 "*") |has| (-1251 |#2| |#3| |#4|) (-172)) (-4409 |has| (-1251 |#2| |#3| |#4|) (-559)) (-4410 . T) (-4411 . T) (-4413 . T)) -((|HasCategory| (-1251 |#2| |#3| |#4|) (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| (-1251 |#2| |#3| |#4|) (QUOTE (-145))) (|HasCategory| (-1251 |#2| |#3| |#4|) (QUOTE (-147))) (|HasCategory| (-1251 |#2| |#3| |#4|) (QUOTE (-172))) (-2909 (|HasCategory| (-1251 |#2| |#3| |#4|) (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| (-1251 |#2| |#3| |#4|) (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567)))))) (|HasCategory| (-1251 |#2| |#3| |#4|) (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| (-1251 |#2| |#3| |#4|) (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| (-1251 |#2| |#3| |#4|) (QUOTE (-365))) (|HasCategory| (-1251 |#2| |#3| |#4|) (QUOTE (-455))) (|HasCategory| (-1251 |#2| |#3| |#4|) (QUOTE (-559)))) +((|HasCategory| (-1251 |#2| |#3| |#4|) (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| (-1251 |#2| |#3| |#4|) (QUOTE (-145))) (|HasCategory| (-1251 |#2| |#3| |#4|) (QUOTE (-147))) (|HasCategory| (-1251 |#2| |#3| |#4|) (QUOTE (-172))) (-2871 (|HasCategory| (-1251 |#2| |#3| |#4|) (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| (-1251 |#2| |#3| |#4|) (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567)))))) (|HasCategory| (-1251 |#2| |#3| |#4|) (LIST (QUOTE -1039) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| (-1251 |#2| |#3| |#4|) (LIST (QUOTE -1039) (QUOTE (-567)))) (|HasCategory| (-1251 |#2| |#3| |#4|) (QUOTE (-365))) (|HasCategory| (-1251 |#2| |#3| |#4|) (QUOTE (-455))) (|HasCategory| (-1251 |#2| |#3| |#4|) (QUOTE (-559)))) (-1253 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 @@ -4955,7 +4955,7 @@ NIL (-1256 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 (-567)))) (|HasCategory| |#2| (QUOTE (-960))) (|HasCategory| |#2| (QUOTE (-1201))) (|HasSignature| |#2| (LIST (QUOTE -2449) (LIST (LIST (QUOTE -645) (QUOTE (-1176))) (|devaluate| |#2|)))) (|HasSignature| |#2| (LIST (QUOTE -2113) (LIST (|devaluate| |#2|) (|devaluate| |#2|) (QUOTE (-1176))))) (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-365)))) +((|HasCategory| |#2| (LIST (QUOTE -29) (QUOTE (-567)))) (|HasCategory| |#2| (QUOTE (-960))) (|HasCategory| |#2| (QUOTE (-1201))) (|HasSignature| |#2| (LIST (QUOTE -2921) (LIST (LIST (QUOTE -645) (QUOTE (-1176))) (|devaluate| |#2|)))) (|HasSignature| |#2| (LIST (QUOTE -3337) (LIST (|devaluate| |#2|) (|devaluate| |#2|) (QUOTE (-1176))))) (|HasCategory| |#2| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#2| (QUOTE (-365)))) (-1257 |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."))) (((-4418 "*") |has| |#1| (-172)) (-4409 |has| |#1| (-559)) (-4410 . T) (-4411 . T) (-4413 . T)) @@ -4963,12 +4963,12 @@ NIL (-1258 |Coef| |var| |cen|) ((|constructor| (NIL "Dense Taylor series in one variable \\spadtype{UnivariateTaylorSeries} is a domain representing Taylor series in one variable with coefficients in an arbitrary ring. The parameters of the type specify the coefficient ring,{} the power series variable,{} and the center of the power series expansion. For example,{} \\spadtype{UnivariateTaylorSeries}(Integer,{}\\spad{x},{}3) represents Taylor series in \\spad{(x - 3)} with \\spadtype{Integer} coefficients.")) (|integrate| (($ $ (|Variable| |#2|)) "\\spad{integrate(f(x),x)} returns an anti-derivative of the power series \\spad{f(x)} with constant coefficient 0. We may integrate a series when we can divide coefficients by integers.")) (|invmultisect| (($ (|Integer|) (|Integer|) $) "\\spad{invmultisect(a,b,f(x))} substitutes \\spad{x^((a+b)*n)} \\indented{1}{for \\spad{x^n} and multiples by \\spad{x^b}.}")) (|multisect| (($ (|Integer|) (|Integer|) $) "\\spad{multisect(a,b,f(x))} selects the coefficients of \\indented{1}{\\spad{x^((a+b)*n+a)},{} and changes this monomial to \\spad{x^n}.}")) (|revert| (($ $) "\\spad{revert(f(x))} returns a Taylor series \\spad{g(x)} such that \\spad{f(g(x)) = g(f(x)) = x}. Series \\spad{f(x)} should have constant coefficient 0 and 1st order coefficient 1.")) (|generalLambert| (($ $ (|Integer|) (|Integer|)) "\\spad{generalLambert(f(x),a,d)} returns \\spad{f(x^a) + f(x^(a + d)) + \\indented{1}{f(x^(a + 2 d)) + ... }. \\spad{f(x)} should have zero constant} \\indented{1}{coefficient and \\spad{a} and \\spad{d} should be positive.}")) (|evenlambert| (($ $) "\\spad{evenlambert(f(x))} returns \\spad{f(x^2) + f(x^4) + f(x^6) + ...}. \\indented{1}{\\spad{f(x)} should have a zero constant coefficient.} \\indented{1}{This function is used for computing infinite products.} \\indented{1}{If \\spad{f(x)} is a Taylor series with constant term 1,{} then} \\indented{1}{\\spad{product(n=1..infinity,f(x^(2*n))) = exp(log(evenlambert(f(x))))}.}")) (|oddlambert| (($ $) "\\spad{oddlambert(f(x))} returns \\spad{f(x) + f(x^3) + f(x^5) + ...}. \\indented{1}{\\spad{f(x)} should have a zero constant coefficient.} \\indented{1}{This function is used for computing infinite products.} \\indented{1}{If \\spad{f(x)} is a Taylor series with constant term 1,{} then} \\indented{1}{\\spad{product(n=1..infinity,f(x^(2*n-1)))=exp(log(oddlambert(f(x))))}.}")) (|lambert| (($ $) "\\spad{lambert(f(x))} returns \\spad{f(x) + f(x^2) + f(x^3) + ...}. \\indented{1}{This function is used for computing infinite products.} \\indented{1}{\\spad{f(x)} should have zero constant coefficient.} \\indented{1}{If \\spad{f(x)} is a Taylor series with constant term 1,{} then} \\indented{1}{\\spad{product(n = 1..infinity,f(x^n)) = exp(log(lambert(f(x))))}.}")) (|lagrange| (($ $) "\\spad{lagrange(g(x))} produces the Taylor series for \\spad{f(x)} \\indented{1}{where \\spad{f(x)} is implicitly defined as \\spad{f(x) = x*g(f(x))}.}")) (|differentiate| (($ $ (|Variable| |#2|)) "\\spad{differentiate(f(x),x)} computes the derivative of \\spad{f(x)} with respect to \\spad{x}.")) (|univariatePolynomial| (((|UnivariatePolynomial| |#2| |#1|) $ (|NonNegativeInteger|)) "\\spad{univariatePolynomial(f,k)} returns a univariate polynomial \\indented{1}{consisting of the sum of all terms of \\spad{f} of degree \\spad{<= k}.}")) (|coerce| (($ (|Variable| |#2|)) "\\spad{coerce(var)} converts the series variable \\spad{var} into a \\indented{1}{Taylor series.}") (($ (|UnivariatePolynomial| |#2| |#1|)) "\\spad{coerce(p)} converts a univariate polynomial \\spad{p} in the variable \\spad{var} to a univariate Taylor series in \\spad{var}."))) (((-4418 "*") |has| |#1| (-172)) (-4409 |has| |#1| (-559)) (-4410 . T) (-4411 . T) (-4413 . T)) -((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-559))) (-2909 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559)))) (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-147))) (-12 (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-772)) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-772)) (|devaluate| |#1|)))) (|HasCategory| (-772) (QUOTE (-1112))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-772))))) (|HasSignature| |#1| (LIST (QUOTE -4101) (LIST (|devaluate| |#1|) (QUOTE (-1176)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-772))))) (|HasCategory| |#1| (QUOTE (-365))) (-2909 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-960))) (|HasCategory| |#1| (QUOTE (-1201))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasSignature| |#1| (LIST (QUOTE -2113) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1176))))) (|HasSignature| |#1| (LIST (QUOTE -2449) (LIST (LIST (QUOTE -645) (QUOTE (-1176))) (|devaluate| |#1|))))))) +((|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasCategory| |#1| (QUOTE (-559))) (-2871 (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-559)))) (|HasCategory| |#1| (QUOTE (-172))) (|HasCategory| |#1| (QUOTE (-145))) (|HasCategory| |#1| (QUOTE (-147))) (-12 (|HasCategory| |#1| (LIST (QUOTE -901) (QUOTE (-1176)))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-772)) (|devaluate| |#1|))))) (|HasSignature| |#1| (LIST (QUOTE *) (LIST (|devaluate| |#1|) (QUOTE (-772)) (|devaluate| |#1|)))) (|HasCategory| (-772) (QUOTE (-1112))) (-12 (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-772))))) (|HasSignature| |#1| (LIST (QUOTE -4130) (LIST (|devaluate| |#1|) (QUOTE (-1176)))))) (|HasSignature| |#1| (LIST (QUOTE **) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-772))))) (|HasCategory| |#1| (QUOTE (-365))) (-2871 (-12 (|HasCategory| |#1| (LIST (QUOTE -29) (QUOTE (-567)))) (|HasCategory| |#1| (QUOTE (-960))) (|HasCategory| |#1| (QUOTE (-1201))) (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567)))))) (-12 (|HasCategory| |#1| (LIST (QUOTE -38) (LIST (QUOTE -410) (QUOTE (-567))))) (|HasSignature| |#1| (LIST (QUOTE -3337) (LIST (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1176))))) (|HasSignature| |#1| (LIST (QUOTE -2921) (LIST (LIST (QUOTE -645) (QUOTE (-1176))) (|devaluate| |#1|))))))) (-1259 |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 -(-1260 -2111 UP L UTS) +(-1260 -3944 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 (-559)))) @@ -4995,7 +4995,7 @@ NIL (-1266 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."))) ((-4417 . T) (-4416 . T)) -((-2909 (-12 (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) (-2909 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539)))) (-2909 (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-1100)))) (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| (-567) (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-727))) (|HasCategory| |#1| (QUOTE (-1050))) (-12 (|HasCategory| |#1| (QUOTE (-1003))) (|HasCategory| |#1| (QUOTE (-1050)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) +((-2871 (-12 (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) (-2871 (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863))))) (|HasCategory| |#1| (LIST (QUOTE -615) (QUOTE (-539)))) (-2871 (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-1100)))) (|HasCategory| |#1| (QUOTE (-851))) (|HasCategory| (-567) (QUOTE (-851))) (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-727))) (|HasCategory| |#1| (QUOTE (-1050))) (-12 (|HasCategory| |#1| (QUOTE (-1003))) (|HasCategory| |#1| (QUOTE (-1050)))) (|HasCategory| |#1| (LIST (QUOTE -614) (QUOTE (-863)))) (-12 (|HasCategory| |#1| (QUOTE (-1100))) (|HasCategory| |#1| (LIST (QUOTE -310) (|devaluate| |#1|))))) (-1267) ((|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 @@ -5028,7 +5028,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 -(-1275 K R UP -2111) +(-1275 K R UP -3944) ((|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 @@ -5064,11 +5064,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}."))) ((-4409 |has| |#2| (-6 -4409)) (-4411 . T) (-4410 . T) (-4413 . T)) NIL -(-1284 S -2111) +(-1284 S -3944) ((|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 (-370))) (|HasCategory| |#2| (QUOTE (-145))) (|HasCategory| |#2| (QUOTE (-147)))) -(-1285 -2111) +(-1285 -3944) ((|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}."))) ((-4408 . T) (-4414 . T) (-4409 . T) ((-4418 "*") . T) (-4410 . T) (-4411 . T) (-4413 . T)) NIL @@ -5124,4 +5124,4 @@ NIL NIL NIL NIL -((-3 NIL 2267207 2267212 2267217 2267222) (-2 NIL 2267187 2267192 2267197 2267202) (-1 NIL 2267167 2267172 2267177 2267182) (0 NIL 2267147 2267152 2267157 2267162) (-1294 "ZMOD.spad" 2266956 2266969 2267085 2267142) (-1293 "ZLINDEP.spad" 2266022 2266033 2266946 2266951) (-1292 "ZDSOLVE.spad" 2255967 2255989 2266012 2266017) (-1291 "YSTREAM.spad" 2255462 2255473 2255957 2255962) (-1290 "XRPOLY.spad" 2254682 2254702 2255318 2255387) (-1289 "XPR.spad" 2252477 2252490 2254400 2254499) (-1288 "XPOLY.spad" 2252032 2252043 2252333 2252402) (-1287 "XPOLYC.spad" 2251351 2251367 2251958 2252027) (-1286 "XPBWPOLY.spad" 2249788 2249808 2251131 2251200) (-1285 "XF.spad" 2248251 2248266 2249690 2249783) (-1284 "XF.spad" 2246694 2246711 2248135 2248140) (-1283 "XFALG.spad" 2243742 2243758 2246620 2246689) (-1282 "XEXPPKG.spad" 2242993 2243019 2243732 2243737) (-1281 "XDPOLY.spad" 2242607 2242623 2242849 2242918) (-1280 "XALG.spad" 2242267 2242278 2242563 2242602) (-1279 "WUTSET.spad" 2238106 2238123 2241913 2241940) (-1278 "WP.spad" 2237305 2237349 2237964 2238031) (-1277 "WHILEAST.spad" 2237103 2237112 2237295 2237300) (-1276 "WHEREAST.spad" 2236774 2236783 2237093 2237098) (-1275 "WFFINTBS.spad" 2234437 2234459 2236764 2236769) (-1274 "WEIER.spad" 2232659 2232670 2234427 2234432) (-1273 "VSPACE.spad" 2232332 2232343 2232627 2232654) (-1272 "VSPACE.spad" 2232025 2232038 2232322 2232327) (-1271 "VOID.spad" 2231702 2231711 2232015 2232020) (-1270 "VIEW.spad" 2229382 2229391 2231692 2231697) (-1269 "VIEWDEF.spad" 2224583 2224592 2229372 2229377) (-1268 "VIEW3D.spad" 2208544 2208553 2224573 2224578) (-1267 "VIEW2D.spad" 2196435 2196444 2208534 2208539) (-1266 "VECTOR.spad" 2195109 2195120 2195360 2195387) (-1265 "VECTOR2.spad" 2193748 2193761 2195099 2195104) (-1264 "VECTCAT.spad" 2191652 2191663 2193716 2193743) (-1263 "VECTCAT.spad" 2189363 2189376 2191429 2191434) (-1262 "VARIABLE.spad" 2189143 2189158 2189353 2189358) (-1261 "UTYPE.spad" 2188787 2188796 2189133 2189138) (-1260 "UTSODETL.spad" 2188082 2188106 2188743 2188748) (-1259 "UTSODE.spad" 2186298 2186318 2188072 2188077) (-1258 "UTS.spad" 2181111 2181139 2184765 2184862) (-1257 "UTSCAT.spad" 2178590 2178606 2181009 2181106) (-1256 "UTSCAT.spad" 2175713 2175731 2178134 2178139) (-1255 "UTS2.spad" 2175308 2175343 2175703 2175708) (-1254 "URAGG.spad" 2169981 2169992 2175298 2175303) (-1253 "URAGG.spad" 2164618 2164631 2169937 2169942) (-1252 "UPXSSING.spad" 2162263 2162289 2163699 2163832) (-1251 "UPXS.spad" 2159417 2159445 2160395 2160544) (-1250 "UPXSCONS.spad" 2157176 2157196 2157549 2157698) (-1249 "UPXSCCA.spad" 2155747 2155767 2157022 2157171) (-1248 "UPXSCCA.spad" 2154460 2154482 2155737 2155742) (-1247 "UPXSCAT.spad" 2153049 2153065 2154306 2154455) (-1246 "UPXS2.spad" 2152592 2152645 2153039 2153044) (-1245 "UPSQFREE.spad" 2151006 2151020 2152582 2152587) (-1244 "UPSCAT.spad" 2148617 2148641 2150904 2151001) (-1243 "UPSCAT.spad" 2145934 2145960 2148223 2148228) (-1242 "UPOLYC.spad" 2140974 2140985 2145776 2145929) (-1241 "UPOLYC.spad" 2135906 2135919 2140710 2140715) (-1240 "UPOLYC2.spad" 2135377 2135396 2135896 2135901) (-1239 "UP.spad" 2132576 2132591 2132963 2133116) (-1238 "UPMP.spad" 2131476 2131489 2132566 2132571) (-1237 "UPDIVP.spad" 2131041 2131055 2131466 2131471) (-1236 "UPDECOMP.spad" 2129286 2129300 2131031 2131036) (-1235 "UPCDEN.spad" 2128495 2128511 2129276 2129281) (-1234 "UP2.spad" 2127859 2127880 2128485 2128490) (-1233 "UNISEG.spad" 2127212 2127223 2127778 2127783) (-1232 "UNISEG2.spad" 2126709 2126722 2127168 2127173) (-1231 "UNIFACT.spad" 2125812 2125824 2126699 2126704) (-1230 "ULS.spad" 2116370 2116398 2117457 2117886) (-1229 "ULSCONS.spad" 2108766 2108786 2109136 2109285) (-1228 "ULSCCAT.spad" 2106503 2106523 2108612 2108761) (-1227 "ULSCCAT.spad" 2104348 2104370 2106459 2106464) (-1226 "ULSCAT.spad" 2102580 2102596 2104194 2104343) (-1225 "ULS2.spad" 2102094 2102147 2102570 2102575) (-1224 "UINT8.spad" 2101971 2101980 2102084 2102089) (-1223 "UINT64.spad" 2101847 2101856 2101961 2101966) (-1222 "UINT32.spad" 2101723 2101732 2101837 2101842) (-1221 "UINT16.spad" 2101599 2101608 2101713 2101718) (-1220 "UFD.spad" 2100664 2100673 2101525 2101594) (-1219 "UFD.spad" 2099791 2099802 2100654 2100659) (-1218 "UDVO.spad" 2098672 2098681 2099781 2099786) (-1217 "UDPO.spad" 2096165 2096176 2098628 2098633) (-1216 "TYPE.spad" 2096097 2096106 2096155 2096160) (-1215 "TYPEAST.spad" 2096016 2096025 2096087 2096092) (-1214 "TWOFACT.spad" 2094668 2094683 2096006 2096011) (-1213 "TUPLE.spad" 2094154 2094165 2094567 2094572) (-1212 "TUBETOOL.spad" 2091021 2091030 2094144 2094149) (-1211 "TUBE.spad" 2089668 2089685 2091011 2091016) (-1210 "TS.spad" 2088267 2088283 2089233 2089330) (-1209 "TSETCAT.spad" 2075394 2075411 2088235 2088262) (-1208 "TSETCAT.spad" 2062507 2062526 2075350 2075355) (-1207 "TRMANIP.spad" 2056873 2056890 2062213 2062218) (-1206 "TRIMAT.spad" 2055836 2055861 2056863 2056868) (-1205 "TRIGMNIP.spad" 2054363 2054380 2055826 2055831) (-1204 "TRIGCAT.spad" 2053875 2053884 2054353 2054358) (-1203 "TRIGCAT.spad" 2053385 2053396 2053865 2053870) (-1202 "TREE.spad" 2051960 2051971 2052992 2053019) (-1201 "TRANFUN.spad" 2051799 2051808 2051950 2051955) (-1200 "TRANFUN.spad" 2051636 2051647 2051789 2051794) (-1199 "TOPSP.spad" 2051310 2051319 2051626 2051631) (-1198 "TOOLSIGN.spad" 2050973 2050984 2051300 2051305) (-1197 "TEXTFILE.spad" 2049534 2049543 2050963 2050968) (-1196 "TEX.spad" 2046680 2046689 2049524 2049529) (-1195 "TEX1.spad" 2046236 2046247 2046670 2046675) (-1194 "TEMUTL.spad" 2045791 2045800 2046226 2046231) (-1193 "TBCMPPK.spad" 2043884 2043907 2045781 2045786) (-1192 "TBAGG.spad" 2042934 2042957 2043864 2043879) (-1191 "TBAGG.spad" 2041992 2042017 2042924 2042929) (-1190 "TANEXP.spad" 2041400 2041411 2041982 2041987) (-1189 "TABLE.spad" 2039811 2039834 2040081 2040108) (-1188 "TABLEAU.spad" 2039292 2039303 2039801 2039806) (-1187 "TABLBUMP.spad" 2036095 2036106 2039282 2039287) (-1186 "SYSTEM.spad" 2035323 2035332 2036085 2036090) (-1185 "SYSSOLP.spad" 2032806 2032817 2035313 2035318) (-1184 "SYSPTR.spad" 2032705 2032714 2032796 2032801) (-1183 "SYSNNI.spad" 2031887 2031898 2032695 2032700) (-1182 "SYSINT.spad" 2031291 2031302 2031877 2031882) (-1181 "SYNTAX.spad" 2027497 2027506 2031281 2031286) (-1180 "SYMTAB.spad" 2025565 2025574 2027487 2027492) (-1179 "SYMS.spad" 2021588 2021597 2025555 2025560) (-1178 "SYMPOLY.spad" 2020595 2020606 2020677 2020804) (-1177 "SYMFUNC.spad" 2020096 2020107 2020585 2020590) (-1176 "SYMBOL.spad" 2017599 2017608 2020086 2020091) (-1175 "SWITCH.spad" 2014370 2014379 2017589 2017594) (-1174 "SUTS.spad" 2011275 2011303 2012837 2012934) (-1173 "SUPXS.spad" 2008416 2008444 2009407 2009556) (-1172 "SUP.spad" 2005229 2005240 2006002 2006155) (-1171 "SUPFRACF.spad" 2004334 2004352 2005219 2005224) (-1170 "SUP2.spad" 2003726 2003739 2004324 2004329) (-1169 "SUMRF.spad" 2002700 2002711 2003716 2003721) (-1168 "SUMFS.spad" 2002337 2002354 2002690 2002695) (-1167 "SULS.spad" 1992882 1992910 1993982 1994411) (-1166 "SUCHTAST.spad" 1992651 1992660 1992872 1992877) (-1165 "SUCH.spad" 1992333 1992348 1992641 1992646) (-1164 "SUBSPACE.spad" 1984448 1984463 1992323 1992328) (-1163 "SUBRESP.spad" 1983618 1983632 1984404 1984409) (-1162 "STTF.spad" 1979717 1979733 1983608 1983613) (-1161 "STTFNC.spad" 1976185 1976201 1979707 1979712) (-1160 "STTAYLOR.spad" 1968839 1968850 1976066 1976071) (-1159 "STRTBL.spad" 1967344 1967361 1967493 1967520) (-1158 "STRING.spad" 1966753 1966762 1966767 1966794) (-1157 "STRICAT.spad" 1966541 1966550 1966721 1966748) (-1156 "STREAM.spad" 1963459 1963470 1966066 1966081) (-1155 "STREAM3.spad" 1963032 1963047 1963449 1963454) (-1154 "STREAM2.spad" 1962160 1962173 1963022 1963027) (-1153 "STREAM1.spad" 1961866 1961877 1962150 1962155) (-1152 "STINPROD.spad" 1960802 1960818 1961856 1961861) (-1151 "STEP.spad" 1960003 1960012 1960792 1960797) (-1150 "STBL.spad" 1958529 1958557 1958696 1958711) (-1149 "STAGG.spad" 1957604 1957615 1958519 1958524) (-1148 "STAGG.spad" 1956677 1956690 1957594 1957599) (-1147 "STACK.spad" 1956034 1956045 1956284 1956311) (-1146 "SREGSET.spad" 1953738 1953755 1955680 1955707) (-1145 "SRDCMPK.spad" 1952299 1952319 1953728 1953733) (-1144 "SRAGG.spad" 1947442 1947451 1952267 1952294) (-1143 "SRAGG.spad" 1942605 1942616 1947432 1947437) (-1142 "SQMATRIX.spad" 1940221 1940239 1941137 1941224) (-1141 "SPLTREE.spad" 1934773 1934786 1939657 1939684) (-1140 "SPLNODE.spad" 1931361 1931374 1934763 1934768) (-1139 "SPFCAT.spad" 1930170 1930179 1931351 1931356) (-1138 "SPECOUT.spad" 1928722 1928731 1930160 1930165) (-1137 "SPADXPT.spad" 1920861 1920870 1928712 1928717) (-1136 "spad-parser.spad" 1920326 1920335 1920851 1920856) (-1135 "SPADAST.spad" 1920027 1920036 1920316 1920321) (-1134 "SPACEC.spad" 1904226 1904237 1920017 1920022) (-1133 "SPACE3.spad" 1904002 1904013 1904216 1904221) (-1132 "SORTPAK.spad" 1903551 1903564 1903958 1903963) (-1131 "SOLVETRA.spad" 1901314 1901325 1903541 1903546) (-1130 "SOLVESER.spad" 1899842 1899853 1901304 1901309) (-1129 "SOLVERAD.spad" 1895868 1895879 1899832 1899837) (-1128 "SOLVEFOR.spad" 1894330 1894348 1895858 1895863) (-1127 "SNTSCAT.spad" 1893930 1893947 1894298 1894325) (-1126 "SMTS.spad" 1892202 1892228 1893495 1893592) (-1125 "SMP.spad" 1889677 1889697 1890067 1890194) (-1124 "SMITH.spad" 1888522 1888547 1889667 1889672) (-1123 "SMATCAT.spad" 1886632 1886662 1888466 1888517) (-1122 "SMATCAT.spad" 1884674 1884706 1886510 1886515) (-1121 "SKAGG.spad" 1883637 1883648 1884642 1884669) (-1120 "SINT.spad" 1882469 1882478 1883503 1883632) (-1119 "SIMPAN.spad" 1882197 1882206 1882459 1882464) (-1118 "SIG.spad" 1881527 1881536 1882187 1882192) (-1117 "SIGNRF.spad" 1880645 1880656 1881517 1881522) (-1116 "SIGNEF.spad" 1879924 1879941 1880635 1880640) (-1115 "SIGAST.spad" 1879309 1879318 1879914 1879919) (-1114 "SHP.spad" 1877237 1877252 1879265 1879270) (-1113 "SHDP.spad" 1866948 1866975 1867457 1867588) (-1112 "SGROUP.spad" 1866556 1866565 1866938 1866943) (-1111 "SGROUP.spad" 1866162 1866173 1866546 1866551) (-1110 "SGCF.spad" 1859325 1859334 1866152 1866157) (-1109 "SFRTCAT.spad" 1858255 1858272 1859293 1859320) (-1108 "SFRGCD.spad" 1857318 1857338 1858245 1858250) (-1107 "SFQCMPK.spad" 1851955 1851975 1857308 1857313) (-1106 "SFORT.spad" 1851394 1851408 1851945 1851950) (-1105 "SEXOF.spad" 1851237 1851277 1851384 1851389) (-1104 "SEX.spad" 1851129 1851138 1851227 1851232) (-1103 "SEXCAT.spad" 1848730 1848770 1851119 1851124) (-1102 "SET.spad" 1847054 1847065 1848151 1848190) (-1101 "SETMN.spad" 1845504 1845521 1847044 1847049) (-1100 "SETCAT.spad" 1844826 1844835 1845494 1845499) (-1099 "SETCAT.spad" 1844146 1844157 1844816 1844821) (-1098 "SETAGG.spad" 1840695 1840706 1844126 1844141) (-1097 "SETAGG.spad" 1837252 1837265 1840685 1840690) (-1096 "SEQAST.spad" 1836955 1836964 1837242 1837247) (-1095 "SEGXCAT.spad" 1836111 1836124 1836945 1836950) (-1094 "SEG.spad" 1835924 1835935 1836030 1836035) (-1093 "SEGCAT.spad" 1834849 1834860 1835914 1835919) (-1092 "SEGBIND.spad" 1833923 1833934 1834804 1834809) (-1091 "SEGBIND2.spad" 1833621 1833634 1833913 1833918) (-1090 "SEGAST.spad" 1833335 1833344 1833611 1833616) (-1089 "SEG2.spad" 1832770 1832783 1833291 1833296) (-1088 "SDVAR.spad" 1832046 1832057 1832760 1832765) (-1087 "SDPOL.spad" 1829472 1829483 1829763 1829890) (-1086 "SCPKG.spad" 1827561 1827572 1829462 1829467) (-1085 "SCOPE.spad" 1826714 1826723 1827551 1827556) (-1084 "SCACHE.spad" 1825410 1825421 1826704 1826709) (-1083 "SASTCAT.spad" 1825319 1825328 1825400 1825405) (-1082 "SAOS.spad" 1825191 1825200 1825309 1825314) (-1081 "SAERFFC.spad" 1824904 1824924 1825181 1825186) (-1080 "SAE.spad" 1823079 1823095 1823690 1823825) (-1079 "SAEFACT.spad" 1822780 1822800 1823069 1823074) (-1078 "RURPK.spad" 1820439 1820455 1822770 1822775) (-1077 "RULESET.spad" 1819892 1819916 1820429 1820434) (-1076 "RULE.spad" 1818132 1818156 1819882 1819887) (-1075 "RULECOLD.spad" 1817984 1817997 1818122 1818127) (-1074 "RTVALUE.spad" 1817719 1817728 1817974 1817979) (-1073 "RSTRCAST.spad" 1817436 1817445 1817709 1817714) (-1072 "RSETGCD.spad" 1813814 1813834 1817426 1817431) (-1071 "RSETCAT.spad" 1803750 1803767 1813782 1813809) (-1070 "RSETCAT.spad" 1793706 1793725 1803740 1803745) (-1069 "RSDCMPK.spad" 1792158 1792178 1793696 1793701) (-1068 "RRCC.spad" 1790542 1790572 1792148 1792153) (-1067 "RRCC.spad" 1788924 1788956 1790532 1790537) (-1066 "RPTAST.spad" 1788626 1788635 1788914 1788919) (-1065 "RPOLCAT.spad" 1767986 1768001 1788494 1788621) (-1064 "RPOLCAT.spad" 1747060 1747077 1767570 1767575) (-1063 "ROUTINE.spad" 1742943 1742952 1745707 1745734) (-1062 "ROMAN.spad" 1742271 1742280 1742809 1742938) (-1061 "ROIRC.spad" 1741351 1741383 1742261 1742266) (-1060 "RNS.spad" 1740254 1740263 1741253 1741346) (-1059 "RNS.spad" 1739243 1739254 1740244 1740249) (-1058 "RNG.spad" 1738978 1738987 1739233 1739238) (-1057 "RMODULE.spad" 1738743 1738754 1738968 1738973) (-1056 "RMCAT2.spad" 1738163 1738220 1738733 1738738) (-1055 "RMATRIX.spad" 1736987 1737006 1737330 1737369) (-1054 "RMATCAT.spad" 1732566 1732597 1736943 1736982) (-1053 "RMATCAT.spad" 1728035 1728068 1732414 1732419) (-1052 "RLINSET.spad" 1727429 1727440 1728025 1728030) (-1051 "RINTERP.spad" 1727317 1727337 1727419 1727424) (-1050 "RING.spad" 1726787 1726796 1727297 1727312) (-1049 "RING.spad" 1726265 1726276 1726777 1726782) (-1048 "RIDIST.spad" 1725657 1725666 1726255 1726260) (-1047 "RGCHAIN.spad" 1724240 1724256 1725142 1725169) (-1046 "RGBCSPC.spad" 1724021 1724033 1724230 1724235) (-1045 "RGBCMDL.spad" 1723551 1723563 1724011 1724016) (-1044 "RF.spad" 1721193 1721204 1723541 1723546) (-1043 "RFFACTOR.spad" 1720655 1720666 1721183 1721188) (-1042 "RFFACT.spad" 1720390 1720402 1720645 1720650) (-1041 "RFDIST.spad" 1719386 1719395 1720380 1720385) (-1040 "RETSOL.spad" 1718805 1718818 1719376 1719381) (-1039 "RETRACT.spad" 1718233 1718244 1718795 1718800) (-1038 "RETRACT.spad" 1717659 1717672 1718223 1718228) (-1037 "RETAST.spad" 1717471 1717480 1717649 1717654) (-1036 "RESULT.spad" 1715531 1715540 1716118 1716145) (-1035 "RESRING.spad" 1714878 1714925 1715469 1715526) (-1034 "RESLATC.spad" 1714202 1714213 1714868 1714873) (-1033 "REPSQ.spad" 1713933 1713944 1714192 1714197) (-1032 "REP.spad" 1711487 1711496 1713923 1713928) (-1031 "REPDB.spad" 1711194 1711205 1711477 1711482) (-1030 "REP2.spad" 1700852 1700863 1711036 1711041) (-1029 "REP1.spad" 1695048 1695059 1700802 1700807) (-1028 "REGSET.spad" 1692845 1692862 1694694 1694721) (-1027 "REF.spad" 1692180 1692191 1692800 1692805) (-1026 "REDORDER.spad" 1691386 1691403 1692170 1692175) (-1025 "RECLOS.spad" 1690169 1690189 1690873 1690966) (-1024 "REALSOLV.spad" 1689309 1689318 1690159 1690164) (-1023 "REAL.spad" 1689181 1689190 1689299 1689304) (-1022 "REAL0Q.spad" 1686479 1686494 1689171 1689176) (-1021 "REAL0.spad" 1683323 1683338 1686469 1686474) (-1020 "RDUCEAST.spad" 1683044 1683053 1683313 1683318) (-1019 "RDIV.spad" 1682699 1682724 1683034 1683039) (-1018 "RDIST.spad" 1682266 1682277 1682689 1682694) (-1017 "RDETRS.spad" 1681130 1681148 1682256 1682261) (-1016 "RDETR.spad" 1679269 1679287 1681120 1681125) (-1015 "RDEEFS.spad" 1678368 1678385 1679259 1679264) (-1014 "RDEEF.spad" 1677378 1677395 1678358 1678363) (-1013 "RCFIELD.spad" 1674564 1674573 1677280 1677373) (-1012 "RCFIELD.spad" 1671836 1671847 1674554 1674559) (-1011 "RCAGG.spad" 1669764 1669775 1671826 1671831) (-1010 "RCAGG.spad" 1667619 1667632 1669683 1669688) (-1009 "RATRET.spad" 1666979 1666990 1667609 1667614) (-1008 "RATFACT.spad" 1666671 1666683 1666969 1666974) (-1007 "RANDSRC.spad" 1665990 1665999 1666661 1666666) (-1006 "RADUTIL.spad" 1665746 1665755 1665980 1665985) (-1005 "RADIX.spad" 1662667 1662681 1664213 1664306) (-1004 "RADFF.spad" 1661080 1661117 1661199 1661355) (-1003 "RADCAT.spad" 1660675 1660684 1661070 1661075) (-1002 "RADCAT.spad" 1660268 1660279 1660665 1660670) (-1001 "QUEUE.spad" 1659616 1659627 1659875 1659902) (-1000 "QUAT.spad" 1658197 1658208 1658540 1658605) (-999 "QUATCT2.spad" 1657818 1657836 1658187 1658192) (-998 "QUATCAT.spad" 1655989 1655999 1657748 1657813) (-997 "QUATCAT.spad" 1653911 1653923 1655672 1655677) (-996 "QUAGG.spad" 1652739 1652749 1653879 1653906) (-995 "QQUTAST.spad" 1652508 1652516 1652729 1652734) (-994 "QFORM.spad" 1651973 1651987 1652498 1652503) (-993 "QFCAT.spad" 1650676 1650686 1651875 1651968) (-992 "QFCAT.spad" 1648970 1648982 1650171 1650176) (-991 "QFCAT2.spad" 1648663 1648679 1648960 1648965) (-990 "QEQUAT.spad" 1648222 1648230 1648653 1648658) (-989 "QCMPACK.spad" 1642969 1642988 1648212 1648217) (-988 "QALGSET.spad" 1639048 1639080 1642883 1642888) (-987 "QALGSET2.spad" 1637044 1637062 1639038 1639043) (-986 "PWFFINTB.spad" 1634460 1634481 1637034 1637039) (-985 "PUSHVAR.spad" 1633799 1633818 1634450 1634455) (-984 "PTRANFN.spad" 1629927 1629937 1633789 1633794) (-983 "PTPACK.spad" 1627015 1627025 1629917 1629922) (-982 "PTFUNC2.spad" 1626838 1626852 1627005 1627010) (-981 "PTCAT.spad" 1626093 1626103 1626806 1626833) (-980 "PSQFR.spad" 1625400 1625424 1626083 1626088) (-979 "PSEUDLIN.spad" 1624286 1624296 1625390 1625395) (-978 "PSETPK.spad" 1609719 1609735 1624164 1624169) (-977 "PSETCAT.spad" 1603639 1603662 1609699 1609714) (-976 "PSETCAT.spad" 1597533 1597558 1603595 1603600) (-975 "PSCURVE.spad" 1596516 1596524 1597523 1597528) (-974 "PSCAT.spad" 1595299 1595328 1596414 1596511) (-973 "PSCAT.spad" 1594172 1594203 1595289 1595294) (-972 "PRTITION.spad" 1593133 1593141 1594162 1594167) (-971 "PRTDAST.spad" 1592852 1592860 1593123 1593128) (-970 "PRS.spad" 1582414 1582431 1592808 1592813) (-969 "PRQAGG.spad" 1581849 1581859 1582382 1582409) (-968 "PROPLOG.spad" 1581148 1581156 1581839 1581844) (-967 "PROPFRML.spad" 1579964 1579975 1581138 1581143) (-966 "PROPERTY.spad" 1579452 1579460 1579954 1579959) (-965 "PRODUCT.spad" 1577134 1577146 1577418 1577473) (-964 "PR.spad" 1575526 1575538 1576225 1576352) (-963 "PRINT.spad" 1575278 1575286 1575516 1575521) (-962 "PRIMES.spad" 1573531 1573541 1575268 1575273) (-961 "PRIMELT.spad" 1571612 1571626 1573521 1573526) (-960 "PRIMCAT.spad" 1571239 1571247 1571602 1571607) (-959 "PRIMARR.spad" 1570244 1570254 1570422 1570449) (-958 "PRIMARR2.spad" 1569011 1569023 1570234 1570239) (-957 "PREASSOC.spad" 1568393 1568405 1569001 1569006) (-956 "PPCURVE.spad" 1567530 1567538 1568383 1568388) (-955 "PORTNUM.spad" 1567305 1567313 1567520 1567525) (-954 "POLYROOT.spad" 1566154 1566176 1567261 1567266) (-953 "POLY.spad" 1563489 1563499 1564004 1564131) (-952 "POLYLIFT.spad" 1562754 1562777 1563479 1563484) (-951 "POLYCATQ.spad" 1560872 1560894 1562744 1562749) (-950 "POLYCAT.spad" 1554342 1554363 1560740 1560867) (-949 "POLYCAT.spad" 1547150 1547173 1553550 1553555) (-948 "POLY2UP.spad" 1546602 1546616 1547140 1547145) (-947 "POLY2.spad" 1546199 1546211 1546592 1546597) (-946 "POLUTIL.spad" 1545140 1545169 1546155 1546160) (-945 "POLTOPOL.spad" 1543888 1543903 1545130 1545135) (-944 "POINT.spad" 1542726 1542736 1542813 1542840) (-943 "PNTHEORY.spad" 1539428 1539436 1542716 1542721) (-942 "PMTOOLS.spad" 1538203 1538217 1539418 1539423) (-941 "PMSYM.spad" 1537752 1537762 1538193 1538198) (-940 "PMQFCAT.spad" 1537343 1537357 1537742 1537747) (-939 "PMPRED.spad" 1536822 1536836 1537333 1537338) (-938 "PMPREDFS.spad" 1536276 1536298 1536812 1536817) (-937 "PMPLCAT.spad" 1535356 1535374 1536208 1536213) (-936 "PMLSAGG.spad" 1534941 1534955 1535346 1535351) (-935 "PMKERNEL.spad" 1534520 1534532 1534931 1534936) (-934 "PMINS.spad" 1534100 1534110 1534510 1534515) (-933 "PMFS.spad" 1533677 1533695 1534090 1534095) (-932 "PMDOWN.spad" 1532967 1532981 1533667 1533672) (-931 "PMASS.spad" 1531977 1531985 1532957 1532962) (-930 "PMASSFS.spad" 1530944 1530960 1531967 1531972) (-929 "PLOTTOOL.spad" 1530724 1530732 1530934 1530939) (-928 "PLOT.spad" 1525647 1525655 1530714 1530719) (-927 "PLOT3D.spad" 1522111 1522119 1525637 1525642) (-926 "PLOT1.spad" 1521268 1521278 1522101 1522106) (-925 "PLEQN.spad" 1508558 1508585 1521258 1521263) (-924 "PINTERP.spad" 1508180 1508199 1508548 1508553) (-923 "PINTERPA.spad" 1507964 1507980 1508170 1508175) (-922 "PI.spad" 1507573 1507581 1507938 1507959) (-921 "PID.spad" 1506543 1506551 1507499 1507568) (-920 "PICOERCE.spad" 1506200 1506210 1506533 1506538) (-919 "PGROEB.spad" 1504801 1504815 1506190 1506195) (-918 "PGE.spad" 1496418 1496426 1504791 1504796) (-917 "PGCD.spad" 1495308 1495325 1496408 1496413) (-916 "PFRPAC.spad" 1494457 1494467 1495298 1495303) (-915 "PFR.spad" 1491120 1491130 1494359 1494452) (-914 "PFOTOOLS.spad" 1490378 1490394 1491110 1491115) (-913 "PFOQ.spad" 1489748 1489766 1490368 1490373) (-912 "PFO.spad" 1489167 1489194 1489738 1489743) (-911 "PF.spad" 1488741 1488753 1488972 1489065) (-910 "PFECAT.spad" 1486423 1486431 1488667 1488736) (-909 "PFECAT.spad" 1484133 1484143 1486379 1486384) (-908 "PFBRU.spad" 1482021 1482033 1484123 1484128) (-907 "PFBR.spad" 1479581 1479604 1482011 1482016) (-906 "PERM.spad" 1475266 1475276 1479411 1479426) (-905 "PERMGRP.spad" 1470028 1470038 1475256 1475261) (-904 "PERMCAT.spad" 1468586 1468596 1470008 1470023) (-903 "PERMAN.spad" 1467118 1467132 1468576 1468581) (-902 "PENDTREE.spad" 1466459 1466469 1466747 1466752) (-901 "PDRING.spad" 1465010 1465020 1466439 1466454) (-900 "PDRING.spad" 1463569 1463581 1465000 1465005) (-899 "PDEPROB.spad" 1462584 1462592 1463559 1463564) (-898 "PDEPACK.spad" 1456624 1456632 1462574 1462579) (-897 "PDECOMP.spad" 1456094 1456111 1456614 1456619) (-896 "PDECAT.spad" 1454450 1454458 1456084 1456089) (-895 "PCOMP.spad" 1454303 1454316 1454440 1454445) (-894 "PBWLB.spad" 1452891 1452908 1454293 1454298) (-893 "PATTERN.spad" 1447430 1447440 1452881 1452886) (-892 "PATTERN2.spad" 1447168 1447180 1447420 1447425) (-891 "PATTERN1.spad" 1445504 1445520 1447158 1447163) (-890 "PATRES.spad" 1443079 1443091 1445494 1445499) (-889 "PATRES2.spad" 1442751 1442765 1443069 1443074) (-888 "PATMATCH.spad" 1440948 1440979 1442459 1442464) (-887 "PATMAB.spad" 1440377 1440387 1440938 1440943) (-886 "PATLRES.spad" 1439463 1439477 1440367 1440372) (-885 "PATAB.spad" 1439227 1439237 1439453 1439458) (-884 "PARTPERM.spad" 1436627 1436635 1439217 1439222) (-883 "PARSURF.spad" 1436061 1436089 1436617 1436622) (-882 "PARSU2.spad" 1435858 1435874 1436051 1436056) (-881 "script-parser.spad" 1435378 1435386 1435848 1435853) (-880 "PARSCURV.spad" 1434812 1434840 1435368 1435373) (-879 "PARSC2.spad" 1434603 1434619 1434802 1434807) (-878 "PARPCURV.spad" 1434065 1434093 1434593 1434598) (-877 "PARPC2.spad" 1433856 1433872 1434055 1434060) (-876 "PAN2EXPR.spad" 1433268 1433276 1433846 1433851) (-875 "PALETTE.spad" 1432238 1432246 1433258 1433263) (-874 "PAIR.spad" 1431225 1431238 1431826 1431831) (-873 "PADICRC.spad" 1428559 1428577 1429730 1429823) (-872 "PADICRAT.spad" 1426574 1426586 1426795 1426888) (-871 "PADIC.spad" 1426269 1426281 1426500 1426569) (-870 "PADICCT.spad" 1424818 1424830 1426195 1426264) (-869 "PADEPAC.spad" 1423507 1423526 1424808 1424813) (-868 "PADE.spad" 1422259 1422275 1423497 1423502) (-867 "OWP.spad" 1421499 1421529 1422117 1422184) (-866 "OVERSET.spad" 1421072 1421080 1421489 1421494) (-865 "OVAR.spad" 1420853 1420876 1421062 1421067) (-864 "OUT.spad" 1419939 1419947 1420843 1420848) (-863 "OUTFORM.spad" 1409331 1409339 1419929 1419934) (-862 "OUTBFILE.spad" 1408749 1408757 1409321 1409326) (-861 "OUTBCON.spad" 1407755 1407763 1408739 1408744) (-860 "OUTBCON.spad" 1406759 1406769 1407745 1407750) (-859 "OSI.spad" 1406234 1406242 1406749 1406754) (-858 "OSGROUP.spad" 1406152 1406160 1406224 1406229) (-857 "ORTHPOL.spad" 1404637 1404647 1406069 1406074) (-856 "OREUP.spad" 1404090 1404118 1404317 1404356) (-855 "ORESUP.spad" 1403391 1403415 1403770 1403809) (-854 "OREPCTO.spad" 1401248 1401260 1403311 1403316) (-853 "OREPCAT.spad" 1395395 1395405 1401204 1401243) (-852 "OREPCAT.spad" 1389432 1389444 1395243 1395248) (-851 "ORDSET.spad" 1388604 1388612 1389422 1389427) (-850 "ORDSET.spad" 1387774 1387784 1388594 1388599) (-849 "ORDRING.spad" 1387164 1387172 1387754 1387769) (-848 "ORDRING.spad" 1386562 1386572 1387154 1387159) (-847 "ORDMON.spad" 1386417 1386425 1386552 1386557) (-846 "ORDFUNS.spad" 1385549 1385565 1386407 1386412) (-845 "ORDFIN.spad" 1385369 1385377 1385539 1385544) (-844 "ORDCOMP.spad" 1383834 1383844 1384916 1384945) (-843 "ORDCOMP2.spad" 1383127 1383139 1383824 1383829) (-842 "OPTPROB.spad" 1381765 1381773 1383117 1383122) (-841 "OPTPACK.spad" 1374174 1374182 1381755 1381760) (-840 "OPTCAT.spad" 1371853 1371861 1374164 1374169) (-839 "OPSIG.spad" 1371507 1371515 1371843 1371848) (-838 "OPQUERY.spad" 1371056 1371064 1371497 1371502) (-837 "OP.spad" 1370798 1370808 1370878 1370945) (-836 "OPERCAT.spad" 1370264 1370274 1370788 1370793) (-835 "OPERCAT.spad" 1369728 1369740 1370254 1370259) (-834 "ONECOMP.spad" 1368473 1368483 1369275 1369304) (-833 "ONECOMP2.spad" 1367897 1367909 1368463 1368468) (-832 "OMSERVER.spad" 1366903 1366911 1367887 1367892) (-831 "OMSAGG.spad" 1366691 1366701 1366859 1366898) (-830 "OMPKG.spad" 1365307 1365315 1366681 1366686) (-829 "OM.spad" 1364280 1364288 1365297 1365302) (-828 "OMLO.spad" 1363705 1363717 1364166 1364205) (-827 "OMEXPR.spad" 1363539 1363549 1363695 1363700) (-826 "OMERR.spad" 1363084 1363092 1363529 1363534) (-825 "OMERRK.spad" 1362118 1362126 1363074 1363079) (-824 "OMENC.spad" 1361462 1361470 1362108 1362113) (-823 "OMDEV.spad" 1355771 1355779 1361452 1361457) (-822 "OMCONN.spad" 1355180 1355188 1355761 1355766) (-821 "OINTDOM.spad" 1354943 1354951 1355106 1355175) (-820 "OFMONOID.spad" 1351192 1351202 1354933 1354938) (-819 "ODVAR.spad" 1350453 1350463 1351182 1351187) (-818 "ODR.spad" 1350097 1350123 1350265 1350414) (-817 "ODPOL.spad" 1347479 1347489 1347819 1347946) (-816 "ODP.spad" 1337326 1337346 1337699 1337830) (-815 "ODETOOLS.spad" 1335975 1335994 1337316 1337321) (-814 "ODESYS.spad" 1333669 1333686 1335965 1335970) (-813 "ODERTRIC.spad" 1329678 1329695 1333626 1333631) (-812 "ODERED.spad" 1329077 1329101 1329668 1329673) (-811 "ODERAT.spad" 1326692 1326709 1329067 1329072) (-810 "ODEPRRIC.spad" 1323729 1323751 1326682 1326687) (-809 "ODEPROB.spad" 1322986 1322994 1323719 1323724) (-808 "ODEPRIM.spad" 1320320 1320342 1322976 1322981) (-807 "ODEPAL.spad" 1319706 1319730 1320310 1320315) (-806 "ODEPACK.spad" 1306372 1306380 1319696 1319701) (-805 "ODEINT.spad" 1305807 1305823 1306362 1306367) (-804 "ODEIFTBL.spad" 1303202 1303210 1305797 1305802) (-803 "ODEEF.spad" 1298693 1298709 1303192 1303197) (-802 "ODECONST.spad" 1298230 1298248 1298683 1298688) (-801 "ODECAT.spad" 1296828 1296836 1298220 1298225) (-800 "OCT.spad" 1294964 1294974 1295678 1295717) (-799 "OCTCT2.spad" 1294610 1294631 1294954 1294959) (-798 "OC.spad" 1292406 1292416 1294566 1294605) (-797 "OC.spad" 1289927 1289939 1292089 1292094) (-796 "OCAMON.spad" 1289775 1289783 1289917 1289922) (-795 "OASGP.spad" 1289590 1289598 1289765 1289770) (-794 "OAMONS.spad" 1289112 1289120 1289580 1289585) (-793 "OAMON.spad" 1288973 1288981 1289102 1289107) (-792 "OAGROUP.spad" 1288835 1288843 1288963 1288968) (-791 "NUMTUBE.spad" 1288426 1288442 1288825 1288830) (-790 "NUMQUAD.spad" 1276402 1276410 1288416 1288421) (-789 "NUMODE.spad" 1267756 1267764 1276392 1276397) (-788 "NUMINT.spad" 1265322 1265330 1267746 1267751) (-787 "NUMFMT.spad" 1264162 1264170 1265312 1265317) (-786 "NUMERIC.spad" 1256276 1256286 1263967 1263972) (-785 "NTSCAT.spad" 1254784 1254800 1256244 1256271) (-784 "NTPOLFN.spad" 1254335 1254345 1254701 1254706) (-783 "NSUP.spad" 1247381 1247391 1251921 1252074) (-782 "NSUP2.spad" 1246773 1246785 1247371 1247376) (-781 "NSMP.spad" 1243004 1243023 1243312 1243439) (-780 "NREP.spad" 1241382 1241396 1242994 1242999) (-779 "NPCOEF.spad" 1240628 1240648 1241372 1241377) (-778 "NORMRETR.spad" 1240226 1240265 1240618 1240623) (-777 "NORMPK.spad" 1238128 1238147 1240216 1240221) (-776 "NORMMA.spad" 1237816 1237842 1238118 1238123) (-775 "NONE.spad" 1237557 1237565 1237806 1237811) (-774 "NONE1.spad" 1237233 1237243 1237547 1237552) (-773 "NODE1.spad" 1236720 1236736 1237223 1237228) (-772 "NNI.spad" 1235615 1235623 1236694 1236715) (-771 "NLINSOL.spad" 1234241 1234251 1235605 1235610) (-770 "NIPROB.spad" 1232782 1232790 1234231 1234236) (-769 "NFINTBAS.spad" 1230342 1230359 1232772 1232777) (-768 "NETCLT.spad" 1230316 1230327 1230332 1230337) (-767 "NCODIV.spad" 1228532 1228548 1230306 1230311) (-766 "NCNTFRAC.spad" 1228174 1228188 1228522 1228527) (-765 "NCEP.spad" 1226340 1226354 1228164 1228169) (-764 "NASRING.spad" 1225936 1225944 1226330 1226335) (-763 "NASRING.spad" 1225530 1225540 1225926 1225931) (-762 "NARNG.spad" 1224882 1224890 1225520 1225525) (-761 "NARNG.spad" 1224232 1224242 1224872 1224877) (-760 "NAGSP.spad" 1223309 1223317 1224222 1224227) (-759 "NAGS.spad" 1212970 1212978 1223299 1223304) (-758 "NAGF07.spad" 1211401 1211409 1212960 1212965) (-757 "NAGF04.spad" 1205803 1205811 1211391 1211396) (-756 "NAGF02.spad" 1199872 1199880 1205793 1205798) (-755 "NAGF01.spad" 1195633 1195641 1199862 1199867) (-754 "NAGE04.spad" 1189333 1189341 1195623 1195628) (-753 "NAGE02.spad" 1179993 1180001 1189323 1189328) (-752 "NAGE01.spad" 1175995 1176003 1179983 1179988) (-751 "NAGD03.spad" 1173999 1174007 1175985 1175990) (-750 "NAGD02.spad" 1166746 1166754 1173989 1173994) (-749 "NAGD01.spad" 1161039 1161047 1166736 1166741) (-748 "NAGC06.spad" 1156914 1156922 1161029 1161034) (-747 "NAGC05.spad" 1155415 1155423 1156904 1156909) (-746 "NAGC02.spad" 1154682 1154690 1155405 1155410) (-745 "NAALG.spad" 1154223 1154233 1154650 1154677) (-744 "NAALG.spad" 1153784 1153796 1154213 1154218) (-743 "MULTSQFR.spad" 1150742 1150759 1153774 1153779) (-742 "MULTFACT.spad" 1150125 1150142 1150732 1150737) (-741 "MTSCAT.spad" 1148219 1148240 1150023 1150120) (-740 "MTHING.spad" 1147878 1147888 1148209 1148214) (-739 "MSYSCMD.spad" 1147312 1147320 1147868 1147873) (-738 "MSET.spad" 1145270 1145280 1147018 1147057) (-737 "MSETAGG.spad" 1145115 1145125 1145238 1145265) (-736 "MRING.spad" 1142092 1142104 1144823 1144890) (-735 "MRF2.spad" 1141662 1141676 1142082 1142087) (-734 "MRATFAC.spad" 1141208 1141225 1141652 1141657) (-733 "MPRFF.spad" 1139248 1139267 1141198 1141203) (-732 "MPOLY.spad" 1136719 1136734 1137078 1137205) (-731 "MPCPF.spad" 1135983 1136002 1136709 1136714) (-730 "MPC3.spad" 1135800 1135840 1135973 1135978) (-729 "MPC2.spad" 1135446 1135479 1135790 1135795) (-728 "MONOTOOL.spad" 1133797 1133814 1135436 1135441) (-727 "MONOID.spad" 1133116 1133124 1133787 1133792) (-726 "MONOID.spad" 1132433 1132443 1133106 1133111) (-725 "MONOGEN.spad" 1131181 1131194 1132293 1132428) (-724 "MONOGEN.spad" 1129951 1129966 1131065 1131070) (-723 "MONADWU.spad" 1127981 1127989 1129941 1129946) (-722 "MONADWU.spad" 1126009 1126019 1127971 1127976) (-721 "MONAD.spad" 1125169 1125177 1125999 1126004) (-720 "MONAD.spad" 1124327 1124337 1125159 1125164) (-719 "MOEBIUS.spad" 1123063 1123077 1124307 1124322) (-718 "MODULE.spad" 1122933 1122943 1123031 1123058) (-717 "MODULE.spad" 1122823 1122835 1122923 1122928) (-716 "MODRING.spad" 1122158 1122197 1122803 1122818) (-715 "MODOP.spad" 1120823 1120835 1121980 1122047) (-714 "MODMONOM.spad" 1120554 1120572 1120813 1120818) (-713 "MODMON.spad" 1117349 1117365 1118068 1118221) (-712 "MODFIELD.spad" 1116711 1116750 1117251 1117344) (-711 "MMLFORM.spad" 1115571 1115579 1116701 1116706) (-710 "MMAP.spad" 1115313 1115347 1115561 1115566) (-709 "MLO.spad" 1113772 1113782 1115269 1115308) (-708 "MLIFT.spad" 1112384 1112401 1113762 1113767) (-707 "MKUCFUNC.spad" 1111919 1111937 1112374 1112379) (-706 "MKRECORD.spad" 1111523 1111536 1111909 1111914) (-705 "MKFUNC.spad" 1110930 1110940 1111513 1111518) (-704 "MKFLCFN.spad" 1109898 1109908 1110920 1110925) (-703 "MKBCFUNC.spad" 1109393 1109411 1109888 1109893) (-702 "MINT.spad" 1108832 1108840 1109295 1109388) (-701 "MHROWRED.spad" 1107343 1107353 1108822 1108827) (-700 "MFLOAT.spad" 1105863 1105871 1107233 1107338) (-699 "MFINFACT.spad" 1105263 1105285 1105853 1105858) (-698 "MESH.spad" 1103045 1103053 1105253 1105258) (-697 "MDDFACT.spad" 1101256 1101266 1103035 1103040) (-696 "MDAGG.spad" 1100547 1100557 1101236 1101251) (-695 "MCMPLX.spad" 1096558 1096566 1097172 1097373) (-694 "MCDEN.spad" 1095768 1095780 1096548 1096553) (-693 "MCALCFN.spad" 1092890 1092916 1095758 1095763) (-692 "MAYBE.spad" 1092174 1092185 1092880 1092885) (-691 "MATSTOR.spad" 1089482 1089492 1092164 1092169) (-690 "MATRIX.spad" 1088186 1088196 1088670 1088697) (-689 "MATLIN.spad" 1085530 1085554 1088070 1088075) (-688 "MATCAT.spad" 1077259 1077281 1085498 1085525) (-687 "MATCAT.spad" 1068860 1068884 1077101 1077106) (-686 "MATCAT2.spad" 1068142 1068190 1068850 1068855) (-685 "MAPPKG3.spad" 1067057 1067071 1068132 1068137) (-684 "MAPPKG2.spad" 1066395 1066407 1067047 1067052) (-683 "MAPPKG1.spad" 1065223 1065233 1066385 1066390) (-682 "MAPPAST.spad" 1064538 1064546 1065213 1065218) (-681 "MAPHACK3.spad" 1064350 1064364 1064528 1064533) (-680 "MAPHACK2.spad" 1064119 1064131 1064340 1064345) (-679 "MAPHACK1.spad" 1063763 1063773 1064109 1064114) (-678 "MAGMA.spad" 1061553 1061570 1063753 1063758) (-677 "MACROAST.spad" 1061132 1061140 1061543 1061548) (-676 "M3D.spad" 1058852 1058862 1060510 1060515) (-675 "LZSTAGG.spad" 1056090 1056100 1058842 1058847) (-674 "LZSTAGG.spad" 1053326 1053338 1056080 1056085) (-673 "LWORD.spad" 1050031 1050048 1053316 1053321) (-672 "LSTAST.spad" 1049815 1049823 1050021 1050026) (-671 "LSQM.spad" 1048045 1048059 1048439 1048490) (-670 "LSPP.spad" 1047580 1047597 1048035 1048040) (-669 "LSMP.spad" 1046430 1046458 1047570 1047575) (-668 "LSMP1.spad" 1044248 1044262 1046420 1046425) (-667 "LSAGG.spad" 1043917 1043927 1044216 1044243) (-666 "LSAGG.spad" 1043606 1043618 1043907 1043912) (-665 "LPOLY.spad" 1042560 1042579 1043462 1043531) (-664 "LPEFRAC.spad" 1041831 1041841 1042550 1042555) (-663 "LO.spad" 1041232 1041246 1041765 1041792) (-662 "LOGIC.spad" 1040834 1040842 1041222 1041227) (-661 "LOGIC.spad" 1040434 1040444 1040824 1040829) (-660 "LODOOPS.spad" 1039364 1039376 1040424 1040429) (-659 "LODO.spad" 1038748 1038764 1039044 1039083) (-658 "LODOF.spad" 1037794 1037811 1038705 1038710) (-657 "LODOCAT.spad" 1036460 1036470 1037750 1037789) (-656 "LODOCAT.spad" 1035124 1035136 1036416 1036421) (-655 "LODO2.spad" 1034397 1034409 1034804 1034843) (-654 "LODO1.spad" 1033797 1033807 1034077 1034116) (-653 "LODEEF.spad" 1032599 1032617 1033787 1033792) (-652 "LNAGG.spad" 1028431 1028441 1032589 1032594) (-651 "LNAGG.spad" 1024227 1024239 1028387 1028392) (-650 "LMOPS.spad" 1020995 1021012 1024217 1024222) (-649 "LMODULE.spad" 1020763 1020773 1020985 1020990) (-648 "LMDICT.spad" 1020050 1020060 1020314 1020341) (-647 "LLINSET.spad" 1019447 1019457 1020040 1020045) (-646 "LITERAL.spad" 1019353 1019364 1019437 1019442) (-645 "LIST.spad" 1017088 1017098 1018500 1018527) (-644 "LIST3.spad" 1016399 1016413 1017078 1017083) (-643 "LIST2.spad" 1015101 1015113 1016389 1016394) (-642 "LIST2MAP.spad" 1012004 1012016 1015091 1015096) (-641 "LINSET.spad" 1011626 1011636 1011994 1011999) (-640 "LINEXP.spad" 1011060 1011070 1011606 1011621) (-639 "LINDEP.spad" 1009869 1009881 1010972 1010977) (-638 "LIMITRF.spad" 1007797 1007807 1009859 1009864) (-637 "LIMITPS.spad" 1006700 1006713 1007787 1007792) (-636 "LIE.spad" 1004716 1004728 1005990 1006135) (-635 "LIECAT.spad" 1004192 1004202 1004642 1004711) (-634 "LIECAT.spad" 1003696 1003708 1004148 1004153) (-633 "LIB.spad" 1001746 1001754 1002355 1002370) (-632 "LGROBP.spad" 999099 999118 1001736 1001741) (-631 "LF.spad" 998054 998070 999089 999094) (-630 "LFCAT.spad" 997113 997121 998044 998049) (-629 "LEXTRIPK.spad" 992616 992631 997103 997108) (-628 "LEXP.spad" 990619 990646 992596 992611) (-627 "LETAST.spad" 990318 990326 990609 990614) (-626 "LEADCDET.spad" 988716 988733 990308 990313) (-625 "LAZM3PK.spad" 987420 987442 988706 988711) (-624 "LAUPOL.spad" 986113 986126 987013 987082) (-623 "LAPLACE.spad" 985696 985712 986103 986108) (-622 "LA.spad" 985136 985150 985618 985657) (-621 "LALG.spad" 984912 984922 985116 985131) (-620 "LALG.spad" 984696 984708 984902 984907) (-619 "KVTFROM.spad" 984431 984441 984686 984691) (-618 "KTVLOGIC.spad" 983943 983951 984421 984426) (-617 "KRCFROM.spad" 983681 983691 983933 983938) (-616 "KOVACIC.spad" 982404 982421 983671 983676) (-615 "KONVERT.spad" 982126 982136 982394 982399) (-614 "KOERCE.spad" 981863 981873 982116 982121) (-613 "KERNEL.spad" 980518 980528 981647 981652) (-612 "KERNEL2.spad" 980221 980233 980508 980513) (-611 "KDAGG.spad" 979330 979352 980201 980216) (-610 "KDAGG.spad" 978447 978471 979320 979325) (-609 "KAFILE.spad" 977410 977426 977645 977672) (-608 "JORDAN.spad" 975239 975251 976700 976845) (-607 "JOINAST.spad" 974933 974941 975229 975234) (-606 "JAVACODE.spad" 974799 974807 974923 974928) (-605 "IXAGG.spad" 972932 972956 974789 974794) (-604 "IXAGG.spad" 970920 970946 972779 972784) (-603 "IVECTOR.spad" 969690 969705 969845 969872) (-602 "ITUPLE.spad" 968851 968861 969680 969685) (-601 "ITRIGMNP.spad" 967690 967709 968841 968846) (-600 "ITFUN3.spad" 967196 967210 967680 967685) (-599 "ITFUN2.spad" 966940 966952 967186 967191) (-598 "ITAYLOR.spad" 964734 964749 966776 966901) (-597 "ISUPS.spad" 957171 957186 963708 963805) (-596 "ISUMP.spad" 956672 956688 957161 957166) (-595 "ISTRING.spad" 955675 955688 955841 955868) (-594 "ISAST.spad" 955394 955402 955665 955670) (-593 "IRURPK.spad" 954111 954130 955384 955389) (-592 "IRSN.spad" 952115 952123 954101 954106) (-591 "IRRF2F.spad" 950600 950610 952071 952076) (-590 "IRREDFFX.spad" 950201 950212 950590 950595) (-589 "IROOT.spad" 948540 948550 950191 950196) (-588 "IR.spad" 946341 946355 948395 948422) (-587 "IR2.spad" 945369 945385 946331 946336) (-586 "IR2F.spad" 944575 944591 945359 945364) (-585 "IPRNTPK.spad" 944335 944343 944565 944570) (-584 "IPF.spad" 943900 943912 944140 944233) (-583 "IPADIC.spad" 943661 943687 943826 943895) (-582 "IP4ADDR.spad" 943218 943226 943651 943656) (-581 "IOMODE.spad" 942839 942847 943208 943213) (-580 "IOBFILE.spad" 942200 942208 942829 942834) (-579 "IOBCON.spad" 942065 942073 942190 942195) (-578 "INVLAPLA.spad" 941714 941730 942055 942060) (-577 "INTTR.spad" 935096 935113 941704 941709) (-576 "INTTOOLS.spad" 932851 932867 934670 934675) (-575 "INTSLPE.spad" 932171 932179 932841 932846) (-574 "INTRVL.spad" 931737 931747 932085 932166) (-573 "INTRF.spad" 930161 930175 931727 931732) (-572 "INTRET.spad" 929593 929603 930151 930156) (-571 "INTRAT.spad" 928320 928337 929583 929588) (-570 "INTPM.spad" 926705 926721 927963 927968) (-569 "INTPAF.spad" 924569 924587 926637 926642) (-568 "INTPACK.spad" 914943 914951 924559 924564) (-567 "INT.spad" 914391 914399 914797 914938) (-566 "INTHERTR.spad" 913665 913682 914381 914386) (-565 "INTHERAL.spad" 913335 913359 913655 913660) (-564 "INTHEORY.spad" 909774 909782 913325 913330) (-563 "INTG0.spad" 903507 903525 909706 909711) (-562 "INTFTBL.spad" 897536 897544 903497 903502) (-561 "INTFACT.spad" 896595 896605 897526 897531) (-560 "INTEF.spad" 894980 894996 896585 896590) (-559 "INTDOM.spad" 893603 893611 894906 894975) (-558 "INTDOM.spad" 892288 892298 893593 893598) (-557 "INTCAT.spad" 890547 890557 892202 892283) (-556 "INTBIT.spad" 890054 890062 890537 890542) (-555 "INTALG.spad" 889242 889269 890044 890049) (-554 "INTAF.spad" 888742 888758 889232 889237) (-553 "INTABL.spad" 887260 887291 887423 887450) (-552 "INT8.spad" 887140 887148 887250 887255) (-551 "INT64.spad" 887019 887027 887130 887135) (-550 "INT32.spad" 886898 886906 887009 887014) (-549 "INT16.spad" 886777 886785 886888 886893) (-548 "INS.spad" 884280 884288 886679 886772) (-547 "INS.spad" 881869 881879 884270 884275) (-546 "INPSIGN.spad" 881317 881330 881859 881864) (-545 "INPRODPF.spad" 880413 880432 881307 881312) (-544 "INPRODFF.spad" 879501 879525 880403 880408) (-543 "INNMFACT.spad" 878476 878493 879491 879496) (-542 "INMODGCD.spad" 877964 877994 878466 878471) (-541 "INFSP.spad" 876261 876283 877954 877959) (-540 "INFPROD0.spad" 875341 875360 876251 876256) (-539 "INFORM.spad" 872540 872548 875331 875336) (-538 "INFORM1.spad" 872165 872175 872530 872535) (-537 "INFINITY.spad" 871717 871725 872155 872160) (-536 "INETCLTS.spad" 871694 871702 871707 871712) (-535 "INEP.spad" 870232 870254 871684 871689) (-534 "INDE.spad" 869961 869978 870222 870227) (-533 "INCRMAPS.spad" 869382 869392 869951 869956) (-532 "INBFILE.spad" 868454 868462 869372 869377) (-531 "INBFF.spad" 864248 864259 868444 868449) (-530 "INBCON.spad" 862538 862546 864238 864243) (-529 "INBCON.spad" 860826 860836 862528 862533) (-528 "INAST.spad" 860487 860495 860816 860821) (-527 "IMPTAST.spad" 860195 860203 860477 860482) (-526 "IMATRIX.spad" 859140 859166 859652 859679) (-525 "IMATQF.spad" 858234 858278 859096 859101) (-524 "IMATLIN.spad" 856839 856863 858190 858195) (-523 "ILIST.spad" 855497 855512 856022 856049) (-522 "IIARRAY2.spad" 854885 854923 855104 855131) (-521 "IFF.spad" 854295 854311 854566 854659) (-520 "IFAST.spad" 853909 853917 854285 854290) (-519 "IFARRAY.spad" 851402 851417 853092 853119) (-518 "IFAMON.spad" 851264 851281 851358 851363) (-517 "IEVALAB.spad" 850669 850681 851254 851259) (-516 "IEVALAB.spad" 850072 850086 850659 850664) (-515 "IDPO.spad" 849870 849882 850062 850067) (-514 "IDPOAMS.spad" 849626 849638 849860 849865) (-513 "IDPOAM.spad" 849346 849358 849616 849621) (-512 "IDPC.spad" 848284 848296 849336 849341) (-511 "IDPAM.spad" 848029 848041 848274 848279) (-510 "IDPAG.spad" 847776 847788 848019 848024) (-509 "IDENT.spad" 847426 847434 847766 847771) (-508 "IDECOMP.spad" 844665 844683 847416 847421) (-507 "IDEAL.spad" 839614 839653 844600 844605) (-506 "ICDEN.spad" 838803 838819 839604 839609) (-505 "ICARD.spad" 837994 838002 838793 838798) (-504 "IBPTOOLS.spad" 836601 836618 837984 837989) (-503 "IBITS.spad" 835804 835817 836237 836264) (-502 "IBATOOL.spad" 832781 832800 835794 835799) (-501 "IBACHIN.spad" 831288 831303 832771 832776) (-500 "IARRAY2.spad" 830276 830302 830895 830922) (-499 "IARRAY1.spad" 829321 829336 829459 829486) (-498 "IAN.spad" 827544 827552 829137 829230) (-497 "IALGFACT.spad" 827147 827180 827534 827539) (-496 "HYPCAT.spad" 826571 826579 827137 827142) (-495 "HYPCAT.spad" 825993 826003 826561 826566) (-494 "HOSTNAME.spad" 825801 825809 825983 825988) (-493 "HOMOTOP.spad" 825544 825554 825791 825796) (-492 "HOAGG.spad" 822826 822836 825534 825539) (-491 "HOAGG.spad" 819883 819895 822593 822598) (-490 "HEXADEC.spad" 817985 817993 818350 818443) (-489 "HEUGCD.spad" 817020 817031 817975 817980) (-488 "HELLFDIV.spad" 816610 816634 817010 817015) (-487 "HEAP.spad" 816002 816012 816217 816244) (-486 "HEADAST.spad" 815539 815547 815992 815997) (-485 "HDP.spad" 805382 805398 805759 805890) (-484 "HDMP.spad" 802596 802611 803212 803339) (-483 "HB.spad" 800847 800855 802586 802591) (-482 "HASHTBL.spad" 799317 799348 799528 799555) (-481 "HASAST.spad" 799033 799041 799307 799312) (-480 "HACKPI.spad" 798524 798532 798935 799028) (-479 "GTSET.spad" 797463 797479 798170 798197) (-478 "GSTBL.spad" 795982 796017 796156 796171) (-477 "GSERIES.spad" 793153 793180 794114 794263) (-476 "GROUP.spad" 792426 792434 793133 793148) (-475 "GROUP.spad" 791707 791717 792416 792421) (-474 "GROEBSOL.spad" 790201 790222 791697 791702) (-473 "GRMOD.spad" 788772 788784 790191 790196) (-472 "GRMOD.spad" 787341 787355 788762 788767) (-471 "GRIMAGE.spad" 780230 780238 787331 787336) (-470 "GRDEF.spad" 778609 778617 780220 780225) (-469 "GRAY.spad" 777072 777080 778599 778604) (-468 "GRALG.spad" 776149 776161 777062 777067) (-467 "GRALG.spad" 775224 775238 776139 776144) (-466 "GPOLSET.spad" 774678 774701 774906 774933) (-465 "GOSPER.spad" 773947 773965 774668 774673) (-464 "GMODPOL.spad" 773095 773122 773915 773942) (-463 "GHENSEL.spad" 772178 772192 773085 773090) (-462 "GENUPS.spad" 768471 768484 772168 772173) (-461 "GENUFACT.spad" 768048 768058 768461 768466) (-460 "GENPGCD.spad" 767634 767651 768038 768043) (-459 "GENMFACT.spad" 767086 767105 767624 767629) (-458 "GENEEZ.spad" 765037 765050 767076 767081) (-457 "GDMP.spad" 762093 762110 762867 762994) (-456 "GCNAALG.spad" 756016 756043 761887 761954) (-455 "GCDDOM.spad" 755192 755200 755942 756011) (-454 "GCDDOM.spad" 754430 754440 755182 755187) (-453 "GB.spad" 751956 751994 754386 754391) (-452 "GBINTERN.spad" 747976 748014 751946 751951) (-451 "GBF.spad" 743743 743781 747966 747971) (-450 "GBEUCLID.spad" 741625 741663 743733 743738) (-449 "GAUSSFAC.spad" 740938 740946 741615 741620) (-448 "GALUTIL.spad" 739264 739274 740894 740899) (-447 "GALPOLYU.spad" 737718 737731 739254 739259) (-446 "GALFACTU.spad" 735891 735910 737708 737713) (-445 "GALFACT.spad" 726080 726091 735881 735886) (-444 "FVFUN.spad" 723103 723111 726070 726075) (-443 "FVC.spad" 722155 722163 723093 723098) (-442 "FUNDESC.spad" 721833 721841 722145 722150) (-441 "FUNCTION.spad" 721682 721694 721823 721828) (-440 "FT.spad" 719979 719987 721672 721677) (-439 "FTEM.spad" 719144 719152 719969 719974) (-438 "FSUPFACT.spad" 718044 718063 719080 719085) (-437 "FST.spad" 716130 716138 718034 718039) (-436 "FSRED.spad" 715610 715626 716120 716125) (-435 "FSPRMELT.spad" 714492 714508 715567 715572) (-434 "FSPECF.spad" 712583 712599 714482 714487) (-433 "FS.spad" 706851 706861 712358 712578) (-432 "FS.spad" 700897 700909 706406 706411) (-431 "FSINT.spad" 700557 700573 700887 700892) (-430 "FSERIES.spad" 699748 699760 700377 700476) (-429 "FSCINT.spad" 699065 699081 699738 699743) (-428 "FSAGG.spad" 698182 698192 699021 699060) (-427 "FSAGG.spad" 697261 697273 698102 698107) (-426 "FSAGG2.spad" 696004 696020 697251 697256) (-425 "FS2UPS.spad" 690495 690529 695994 695999) (-424 "FS2.spad" 690142 690158 690485 690490) (-423 "FS2EXPXP.spad" 689267 689290 690132 690137) (-422 "FRUTIL.spad" 688221 688231 689257 689262) (-421 "FR.spad" 681937 681947 687245 687314) (-420 "FRNAALG.spad" 677056 677066 681879 681932) (-419 "FRNAALG.spad" 672187 672199 677012 677017) (-418 "FRNAAF2.spad" 671643 671661 672177 672182) (-417 "FRMOD.spad" 671053 671083 671574 671579) (-416 "FRIDEAL.spad" 670278 670299 671033 671048) (-415 "FRIDEAL2.spad" 669882 669914 670268 670273) (-414 "FRETRCT.spad" 669393 669403 669872 669877) (-413 "FRETRCT.spad" 668770 668782 669251 669256) (-412 "FRAMALG.spad" 667118 667131 668726 668765) (-411 "FRAMALG.spad" 665498 665513 667108 667113) (-410 "FRAC.spad" 662597 662607 663000 663173) (-409 "FRAC2.spad" 662202 662214 662587 662592) (-408 "FR2.spad" 661538 661550 662192 662197) (-407 "FPS.spad" 658353 658361 661428 661533) (-406 "FPS.spad" 655196 655206 658273 658278) (-405 "FPC.spad" 654242 654250 655098 655191) (-404 "FPC.spad" 653374 653384 654232 654237) (-403 "FPATMAB.spad" 653136 653146 653364 653369) (-402 "FPARFRAC.spad" 651623 651640 653126 653131) (-401 "FORTRAN.spad" 650129 650172 651613 651618) (-400 "FORT.spad" 649078 649086 650119 650124) (-399 "FORTFN.spad" 646248 646256 649068 649073) (-398 "FORTCAT.spad" 645932 645940 646238 646243) (-397 "FORMULA.spad" 643406 643414 645922 645927) (-396 "FORMULA1.spad" 642885 642895 643396 643401) (-395 "FORDER.spad" 642576 642600 642875 642880) (-394 "FOP.spad" 641777 641785 642566 642571) (-393 "FNLA.spad" 641201 641223 641745 641772) (-392 "FNCAT.spad" 639796 639804 641191 641196) (-391 "FNAME.spad" 639688 639696 639786 639791) (-390 "FMTC.spad" 639486 639494 639614 639683) (-389 "FMONOID.spad" 636603 636613 639442 639447) (-388 "FMONCAT.spad" 633756 633766 636593 636598) (-387 "FM.spad" 633451 633463 633690 633717) (-386 "FMFUN.spad" 630481 630489 633441 633446) (-385 "FMC.spad" 629533 629541 630471 630476) (-384 "FMCAT.spad" 627201 627219 629501 629528) (-383 "FM1.spad" 626558 626570 627135 627162) (-382 "FLOATRP.spad" 624293 624307 626548 626553) (-381 "FLOAT.spad" 617607 617615 624159 624288) (-380 "FLOATCP.spad" 615038 615052 617597 617602) (-379 "FLINEXP.spad" 614750 614760 615018 615033) (-378 "FLINEXP.spad" 614416 614428 614686 614691) (-377 "FLASORT.spad" 613742 613754 614406 614411) (-376 "FLALG.spad" 611388 611407 613668 613737) (-375 "FLAGG.spad" 608430 608440 611368 611383) (-374 "FLAGG.spad" 605373 605385 608313 608318) (-373 "FLAGG2.spad" 604098 604114 605363 605368) (-372 "FINRALG.spad" 602159 602172 604054 604093) (-371 "FINRALG.spad" 600146 600161 602043 602048) (-370 "FINITE.spad" 599298 599306 600136 600141) (-369 "FINAALG.spad" 588419 588429 599240 599293) (-368 "FINAALG.spad" 577552 577564 588375 588380) (-367 "FILE.spad" 577135 577145 577542 577547) (-366 "FILECAT.spad" 575661 575678 577125 577130) (-365 "FIELD.spad" 575067 575075 575563 575656) (-364 "FIELD.spad" 574559 574569 575057 575062) (-363 "FGROUP.spad" 573206 573216 574539 574554) (-362 "FGLMICPK.spad" 571993 572008 573196 573201) (-361 "FFX.spad" 571368 571383 571709 571802) (-360 "FFSLPE.spad" 570871 570892 571358 571363) (-359 "FFPOLY.spad" 562133 562144 570861 570866) (-358 "FFPOLY2.spad" 561193 561210 562123 562128) (-357 "FFP.spad" 560590 560610 560909 561002) (-356 "FF.spad" 560038 560054 560271 560364) (-355 "FFNBX.spad" 558550 558570 559754 559847) (-354 "FFNBP.spad" 557063 557080 558266 558359) (-353 "FFNB.spad" 555528 555549 556744 556837) (-352 "FFINTBAS.spad" 553042 553061 555518 555523) (-351 "FFIELDC.spad" 550619 550627 552944 553037) (-350 "FFIELDC.spad" 548282 548292 550609 550614) (-349 "FFHOM.spad" 547030 547047 548272 548277) (-348 "FFF.spad" 544465 544476 547020 547025) (-347 "FFCGX.spad" 543312 543332 544181 544274) (-346 "FFCGP.spad" 542201 542221 543028 543121) (-345 "FFCG.spad" 540993 541014 541882 541975) (-344 "FFCAT.spad" 534166 534188 540832 540988) (-343 "FFCAT.spad" 527418 527442 534086 534091) (-342 "FFCAT2.spad" 527165 527205 527408 527413) (-341 "FEXPR.spad" 518882 518928 526921 526960) (-340 "FEVALAB.spad" 518590 518600 518872 518877) (-339 "FEVALAB.spad" 518083 518095 518367 518372) (-338 "FDIV.spad" 517525 517549 518073 518078) (-337 "FDIVCAT.spad" 515589 515613 517515 517520) (-336 "FDIVCAT.spad" 513651 513677 515579 515584) (-335 "FDIV2.spad" 513307 513347 513641 513646) (-334 "FCTRDATA.spad" 512315 512323 513297 513302) (-333 "FCPAK1.spad" 510882 510890 512305 512310) (-332 "FCOMP.spad" 510261 510271 510872 510877) (-331 "FC.spad" 500268 500276 510251 510256) (-330 "FAXF.spad" 493239 493253 500170 500263) (-329 "FAXF.spad" 486262 486278 493195 493200) (-328 "FARRAY.spad" 484412 484422 485445 485472) (-327 "FAMR.spad" 482548 482560 484310 484407) (-326 "FAMR.spad" 480668 480682 482432 482437) (-325 "FAMONOID.spad" 480336 480346 480622 480627) (-324 "FAMONC.spad" 478632 478644 480326 480331) (-323 "FAGROUP.spad" 478256 478266 478528 478555) (-322 "FACUTIL.spad" 476460 476477 478246 478251) (-321 "FACTFUNC.spad" 475654 475664 476450 476455) (-320 "EXPUPXS.spad" 472487 472510 473786 473935) (-319 "EXPRTUBE.spad" 469775 469783 472477 472482) (-318 "EXPRODE.spad" 466935 466951 469765 469770) (-317 "EXPR.spad" 462210 462220 462924 463331) (-316 "EXPR2UPS.spad" 458332 458345 462200 462205) (-315 "EXPR2.spad" 458037 458049 458322 458327) (-314 "EXPEXPAN.spad" 454977 455002 455609 455702) (-313 "EXIT.spad" 454648 454656 454967 454972) (-312 "EXITAST.spad" 454384 454392 454638 454643) (-311 "EVALCYC.spad" 453844 453858 454374 454379) (-310 "EVALAB.spad" 453416 453426 453834 453839) (-309 "EVALAB.spad" 452986 452998 453406 453411) (-308 "EUCDOM.spad" 450560 450568 452912 452981) (-307 "EUCDOM.spad" 448196 448206 450550 450555) (-306 "ESTOOLS.spad" 440042 440050 448186 448191) (-305 "ESTOOLS2.spad" 439645 439659 440032 440037) (-304 "ESTOOLS1.spad" 439330 439341 439635 439640) (-303 "ES.spad" 432145 432153 439320 439325) (-302 "ES.spad" 424866 424876 432043 432048) (-301 "ESCONT.spad" 421659 421667 424856 424861) (-300 "ESCONT1.spad" 421408 421420 421649 421654) (-299 "ES2.spad" 420913 420929 421398 421403) (-298 "ES1.spad" 420483 420499 420903 420908) (-297 "ERROR.spad" 417810 417818 420473 420478) (-296 "EQTBL.spad" 416282 416304 416491 416518) (-295 "EQ.spad" 411087 411097 413874 413986) (-294 "EQ2.spad" 410805 410817 411077 411082) (-293 "EP.spad" 407131 407141 410795 410800) (-292 "ENV.spad" 405793 405801 407121 407126) (-291 "ENTIRER.spad" 405461 405469 405737 405788) (-290 "EMR.spad" 404668 404709 405387 405456) (-289 "ELTAGG.spad" 402922 402941 404658 404663) (-288 "ELTAGG.spad" 401140 401161 402878 402883) (-287 "ELTAB.spad" 400589 400607 401130 401135) (-286 "ELFUTS.spad" 399976 399995 400579 400584) (-285 "ELEMFUN.spad" 399665 399673 399966 399971) (-284 "ELEMFUN.spad" 399352 399362 399655 399660) (-283 "ELAGG.spad" 397323 397333 399332 399347) (-282 "ELAGG.spad" 395231 395243 397242 397247) (-281 "ELABEXPR.spad" 394163 394171 395221 395226) (-280 "EFUPXS.spad" 390939 390969 394119 394124) (-279 "EFULS.spad" 387775 387798 390895 390900) (-278 "EFSTRUC.spad" 385790 385806 387765 387770) (-277 "EF.spad" 380566 380582 385780 385785) (-276 "EAB.spad" 378842 378850 380556 380561) (-275 "E04UCFA.spad" 378378 378386 378832 378837) (-274 "E04NAFA.spad" 377955 377963 378368 378373) (-273 "E04MBFA.spad" 377535 377543 377945 377950) (-272 "E04JAFA.spad" 377071 377079 377525 377530) (-271 "E04GCFA.spad" 376607 376615 377061 377066) (-270 "E04FDFA.spad" 376143 376151 376597 376602) (-269 "E04DGFA.spad" 375679 375687 376133 376138) (-268 "E04AGNT.spad" 371529 371537 375669 375674) (-267 "DVARCAT.spad" 368218 368228 371519 371524) (-266 "DVARCAT.spad" 364905 364917 368208 368213) (-265 "DSMP.spad" 362372 362386 362677 362804) (-264 "DROPT.spad" 356331 356339 362362 362367) (-263 "DROPT1.spad" 355996 356006 356321 356326) (-262 "DROPT0.spad" 350853 350861 355986 355991) (-261 "DRAWPT.spad" 349026 349034 350843 350848) (-260 "DRAW.spad" 341902 341915 349016 349021) (-259 "DRAWHACK.spad" 341210 341220 341892 341897) (-258 "DRAWCX.spad" 338680 338688 341200 341205) (-257 "DRAWCURV.spad" 338227 338242 338670 338675) (-256 "DRAWCFUN.spad" 327759 327767 338217 338222) (-255 "DQAGG.spad" 325937 325947 327727 327754) (-254 "DPOLCAT.spad" 321286 321302 325805 325932) (-253 "DPOLCAT.spad" 316721 316739 321242 321247) (-252 "DPMO.spad" 308947 308963 309085 309386) (-251 "DPMM.spad" 301186 301204 301311 301612) (-250 "DOMTMPLT.spad" 300846 300854 301176 301181) (-249 "DOMCTOR.spad" 300601 300609 300836 300841) (-248 "DOMAIN.spad" 299688 299696 300591 300596) (-247 "DMP.spad" 296948 296963 297518 297645) (-246 "DLP.spad" 296300 296310 296938 296943) (-245 "DLIST.spad" 294879 294889 295483 295510) (-244 "DLAGG.spad" 293296 293306 294869 294874) (-243 "DIVRING.spad" 292838 292846 293240 293291) (-242 "DIVRING.spad" 292424 292434 292828 292833) (-241 "DISPLAY.spad" 290614 290622 292414 292419) (-240 "DIRPROD.spad" 280194 280210 280834 280965) (-239 "DIRPROD2.spad" 279012 279030 280184 280189) (-238 "DIRPCAT.spad" 277956 277972 278876 279007) (-237 "DIRPCAT.spad" 276629 276647 277551 277556) (-236 "DIOSP.spad" 275454 275462 276619 276624) (-235 "DIOPS.spad" 274450 274460 275434 275449) (-234 "DIOPS.spad" 273420 273432 274406 274411) (-233 "DIFRING.spad" 272716 272724 273400 273415) (-232 "DIFRING.spad" 272020 272030 272706 272711) (-231 "DIFEXT.spad" 271191 271201 272000 272015) (-230 "DIFEXT.spad" 270279 270291 271090 271095) (-229 "DIAGG.spad" 269909 269919 270259 270274) (-228 "DIAGG.spad" 269547 269559 269899 269904) (-227 "DHMATRIX.spad" 267859 267869 269004 269031) (-226 "DFSFUN.spad" 261499 261507 267849 267854) (-225 "DFLOAT.spad" 258230 258238 261389 261494) (-224 "DFINTTLS.spad" 256461 256477 258220 258225) (-223 "DERHAM.spad" 254375 254407 256441 256456) (-222 "DEQUEUE.spad" 253699 253709 253982 254009) (-221 "DEGRED.spad" 253316 253330 253689 253694) (-220 "DEFINTRF.spad" 250853 250863 253306 253311) (-219 "DEFINTEF.spad" 249363 249379 250843 250848) (-218 "DEFAST.spad" 248731 248739 249353 249358) (-217 "DECIMAL.spad" 246837 246845 247198 247291) (-216 "DDFACT.spad" 244650 244667 246827 246832) (-215 "DBLRESP.spad" 244250 244274 244640 244645) (-214 "DBASE.spad" 242914 242924 244240 244245) (-213 "DATAARY.spad" 242376 242389 242904 242909) (-212 "D03FAFA.spad" 242204 242212 242366 242371) (-211 "D03EEFA.spad" 242024 242032 242194 242199) (-210 "D03AGNT.spad" 241110 241118 242014 242019) (-209 "D02EJFA.spad" 240572 240580 241100 241105) (-208 "D02CJFA.spad" 240050 240058 240562 240567) (-207 "D02BHFA.spad" 239540 239548 240040 240045) (-206 "D02BBFA.spad" 239030 239038 239530 239535) (-205 "D02AGNT.spad" 233844 233852 239020 239025) (-204 "D01WGTS.spad" 232163 232171 233834 233839) (-203 "D01TRNS.spad" 232140 232148 232153 232158) (-202 "D01GBFA.spad" 231662 231670 232130 232135) (-201 "D01FCFA.spad" 231184 231192 231652 231657) (-200 "D01ASFA.spad" 230652 230660 231174 231179) (-199 "D01AQFA.spad" 230098 230106 230642 230647) (-198 "D01APFA.spad" 229522 229530 230088 230093) (-197 "D01ANFA.spad" 229016 229024 229512 229517) (-196 "D01AMFA.spad" 228526 228534 229006 229011) (-195 "D01ALFA.spad" 228066 228074 228516 228521) (-194 "D01AKFA.spad" 227592 227600 228056 228061) (-193 "D01AJFA.spad" 227115 227123 227582 227587) (-192 "D01AGNT.spad" 223182 223190 227105 227110) (-191 "CYCLOTOM.spad" 222688 222696 223172 223177) (-190 "CYCLES.spad" 219544 219552 222678 222683) (-189 "CVMP.spad" 218961 218971 219534 219539) (-188 "CTRIGMNP.spad" 217461 217477 218951 218956) (-187 "CTOR.spad" 217152 217160 217451 217456) (-186 "CTORKIND.spad" 216755 216763 217142 217147) (-185 "CTORCAT.spad" 216004 216012 216745 216750) (-184 "CTORCAT.spad" 215251 215261 215994 215999) (-183 "CTORCALL.spad" 214840 214850 215241 215246) (-182 "CSTTOOLS.spad" 214085 214098 214830 214835) (-181 "CRFP.spad" 207809 207822 214075 214080) (-180 "CRCEAST.spad" 207529 207537 207799 207804) (-179 "CRAPACK.spad" 206580 206590 207519 207524) (-178 "CPMATCH.spad" 206084 206099 206505 206510) (-177 "CPIMA.spad" 205789 205808 206074 206079) (-176 "COORDSYS.spad" 200798 200808 205779 205784) (-175 "CONTOUR.spad" 200209 200217 200788 200793) (-174 "CONTFRAC.spad" 195959 195969 200111 200204) (-173 "CONDUIT.spad" 195717 195725 195949 195954) (-172 "COMRING.spad" 195391 195399 195655 195712) (-171 "COMPPROP.spad" 194909 194917 195381 195386) (-170 "COMPLPAT.spad" 194676 194691 194899 194904) (-169 "COMPLEX.spad" 188813 188823 189057 189318) (-168 "COMPLEX2.spad" 188528 188540 188803 188808) (-167 "COMPFACT.spad" 188130 188144 188518 188523) (-166 "COMPCAT.spad" 186202 186212 187864 188125) (-165 "COMPCAT.spad" 184002 184014 185666 185671) (-164 "COMMUPC.spad" 183750 183768 183992 183997) (-163 "COMMONOP.spad" 183283 183291 183740 183745) (-162 "COMM.spad" 183094 183102 183273 183278) (-161 "COMMAAST.spad" 182857 182865 183084 183089) (-160 "COMBOPC.spad" 181772 181780 182847 182852) (-159 "COMBINAT.spad" 180539 180549 181762 181767) (-158 "COMBF.spad" 177921 177937 180529 180534) (-157 "COLOR.spad" 176758 176766 177911 177916) (-156 "COLONAST.spad" 176424 176432 176748 176753) (-155 "CMPLXRT.spad" 176135 176152 176414 176419) (-154 "CLLCTAST.spad" 175797 175805 176125 176130) (-153 "CLIP.spad" 171905 171913 175787 175792) (-152 "CLIF.spad" 170560 170576 171861 171900) (-151 "CLAGG.spad" 167065 167075 170550 170555) (-150 "CLAGG.spad" 163441 163453 166928 166933) (-149 "CINTSLPE.spad" 162772 162785 163431 163436) (-148 "CHVAR.spad" 160910 160932 162762 162767) (-147 "CHARZ.spad" 160825 160833 160890 160905) (-146 "CHARPOL.spad" 160335 160345 160815 160820) (-145 "CHARNZ.spad" 160088 160096 160315 160330) (-144 "CHAR.spad" 157962 157970 160078 160083) (-143 "CFCAT.spad" 157290 157298 157952 157957) (-142 "CDEN.spad" 156486 156500 157280 157285) (-141 "CCLASS.spad" 154635 154643 155897 155936) (-140 "CATEGORY.spad" 153677 153685 154625 154630) (-139 "CATCTOR.spad" 153568 153576 153667 153672) (-138 "CATAST.spad" 153186 153194 153558 153563) (-137 "CASEAST.spad" 152900 152908 153176 153181) (-136 "CARTEN.spad" 148187 148211 152890 152895) (-135 "CARTEN2.spad" 147577 147604 148177 148182) (-134 "CARD.spad" 144872 144880 147551 147572) (-133 "CAPSLAST.spad" 144646 144654 144862 144867) (-132 "CACHSET.spad" 144270 144278 144636 144641) (-131 "CABMON.spad" 143825 143833 144260 144265) (-130 "BYTEORD.spad" 143500 143508 143815 143820) (-129 "BYTE.spad" 142927 142935 143490 143495) (-128 "BYTEBUF.spad" 140786 140794 142096 142123) (-127 "BTREE.spad" 139859 139869 140393 140420) (-126 "BTOURN.spad" 138864 138874 139466 139493) (-125 "BTCAT.spad" 138256 138266 138832 138859) (-124 "BTCAT.spad" 137668 137680 138246 138251) (-123 "BTAGG.spad" 136796 136804 137636 137663) (-122 "BTAGG.spad" 135944 135954 136786 136791) (-121 "BSTREE.spad" 134685 134695 135551 135578) (-120 "BRILL.spad" 132882 132893 134675 134680) (-119 "BRAGG.spad" 131822 131832 132872 132877) (-118 "BRAGG.spad" 130726 130738 131778 131783) (-117 "BPADICRT.spad" 128707 128719 128962 129055) (-116 "BPADIC.spad" 128371 128383 128633 128702) (-115 "BOUNDZRO.spad" 128027 128044 128361 128366) (-114 "BOP.spad" 123209 123217 128017 128022) (-113 "BOP1.spad" 120675 120685 123199 123204) (-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 2262500 2262505 2262510 2262515) (-2 NIL 2262480 2262485 2262490 2262495) (-1 NIL 2262460 2262465 2262470 2262475) (0 NIL 2262440 2262445 2262450 2262455) (-1294 "ZMOD.spad" 2262249 2262262 2262378 2262435) (-1293 "ZLINDEP.spad" 2261315 2261326 2262239 2262244) (-1292 "ZDSOLVE.spad" 2251260 2251282 2261305 2261310) (-1291 "YSTREAM.spad" 2250755 2250766 2251250 2251255) (-1290 "XRPOLY.spad" 2249975 2249995 2250611 2250680) (-1289 "XPR.spad" 2247770 2247783 2249693 2249792) (-1288 "XPOLY.spad" 2247325 2247336 2247626 2247695) (-1287 "XPOLYC.spad" 2246644 2246660 2247251 2247320) (-1286 "XPBWPOLY.spad" 2245081 2245101 2246424 2246493) (-1285 "XF.spad" 2243544 2243559 2244983 2245076) (-1284 "XF.spad" 2241987 2242004 2243428 2243433) (-1283 "XFALG.spad" 2239035 2239051 2241913 2241982) (-1282 "XEXPPKG.spad" 2238286 2238312 2239025 2239030) (-1281 "XDPOLY.spad" 2237900 2237916 2238142 2238211) (-1280 "XALG.spad" 2237560 2237571 2237856 2237895) (-1279 "WUTSET.spad" 2233399 2233416 2237206 2237233) (-1278 "WP.spad" 2232598 2232642 2233257 2233324) (-1277 "WHILEAST.spad" 2232396 2232405 2232588 2232593) (-1276 "WHEREAST.spad" 2232067 2232076 2232386 2232391) (-1275 "WFFINTBS.spad" 2229730 2229752 2232057 2232062) (-1274 "WEIER.spad" 2227952 2227963 2229720 2229725) (-1273 "VSPACE.spad" 2227625 2227636 2227920 2227947) (-1272 "VSPACE.spad" 2227318 2227331 2227615 2227620) (-1271 "VOID.spad" 2226995 2227004 2227308 2227313) (-1270 "VIEW.spad" 2224675 2224684 2226985 2226990) (-1269 "VIEWDEF.spad" 2219876 2219885 2224665 2224670) (-1268 "VIEW3D.spad" 2203837 2203846 2219866 2219871) (-1267 "VIEW2D.spad" 2191728 2191737 2203827 2203832) (-1266 "VECTOR.spad" 2190402 2190413 2190653 2190680) (-1265 "VECTOR2.spad" 2189041 2189054 2190392 2190397) (-1264 "VECTCAT.spad" 2186945 2186956 2189009 2189036) (-1263 "VECTCAT.spad" 2184656 2184669 2186722 2186727) (-1262 "VARIABLE.spad" 2184436 2184451 2184646 2184651) (-1261 "UTYPE.spad" 2184080 2184089 2184426 2184431) (-1260 "UTSODETL.spad" 2183375 2183399 2184036 2184041) (-1259 "UTSODE.spad" 2181591 2181611 2183365 2183370) (-1258 "UTS.spad" 2176404 2176432 2180058 2180155) (-1257 "UTSCAT.spad" 2173883 2173899 2176302 2176399) (-1256 "UTSCAT.spad" 2171006 2171024 2173427 2173432) (-1255 "UTS2.spad" 2170601 2170636 2170996 2171001) (-1254 "URAGG.spad" 2165274 2165285 2170591 2170596) (-1253 "URAGG.spad" 2159911 2159924 2165230 2165235) (-1252 "UPXSSING.spad" 2157556 2157582 2158992 2159125) (-1251 "UPXS.spad" 2154710 2154738 2155688 2155837) (-1250 "UPXSCONS.spad" 2152469 2152489 2152842 2152991) (-1249 "UPXSCCA.spad" 2151040 2151060 2152315 2152464) (-1248 "UPXSCCA.spad" 2149753 2149775 2151030 2151035) (-1247 "UPXSCAT.spad" 2148342 2148358 2149599 2149748) (-1246 "UPXS2.spad" 2147885 2147938 2148332 2148337) (-1245 "UPSQFREE.spad" 2146299 2146313 2147875 2147880) (-1244 "UPSCAT.spad" 2143910 2143934 2146197 2146294) (-1243 "UPSCAT.spad" 2141227 2141253 2143516 2143521) (-1242 "UPOLYC.spad" 2136267 2136278 2141069 2141222) (-1241 "UPOLYC.spad" 2131199 2131212 2136003 2136008) (-1240 "UPOLYC2.spad" 2130670 2130689 2131189 2131194) (-1239 "UP.spad" 2127869 2127884 2128256 2128409) (-1238 "UPMP.spad" 2126769 2126782 2127859 2127864) (-1237 "UPDIVP.spad" 2126334 2126348 2126759 2126764) (-1236 "UPDECOMP.spad" 2124579 2124593 2126324 2126329) (-1235 "UPCDEN.spad" 2123788 2123804 2124569 2124574) (-1234 "UP2.spad" 2123152 2123173 2123778 2123783) (-1233 "UNISEG.spad" 2122505 2122516 2123071 2123076) (-1232 "UNISEG2.spad" 2122002 2122015 2122461 2122466) (-1231 "UNIFACT.spad" 2121105 2121117 2121992 2121997) (-1230 "ULS.spad" 2111663 2111691 2112750 2113179) (-1229 "ULSCONS.spad" 2104059 2104079 2104429 2104578) (-1228 "ULSCCAT.spad" 2101796 2101816 2103905 2104054) (-1227 "ULSCCAT.spad" 2099641 2099663 2101752 2101757) (-1226 "ULSCAT.spad" 2097873 2097889 2099487 2099636) (-1225 "ULS2.spad" 2097387 2097440 2097863 2097868) (-1224 "UINT8.spad" 2097264 2097273 2097377 2097382) (-1223 "UINT64.spad" 2097140 2097149 2097254 2097259) (-1222 "UINT32.spad" 2097016 2097025 2097130 2097135) (-1221 "UINT16.spad" 2096892 2096901 2097006 2097011) (-1220 "UFD.spad" 2095957 2095966 2096818 2096887) (-1219 "UFD.spad" 2095084 2095095 2095947 2095952) (-1218 "UDVO.spad" 2093965 2093974 2095074 2095079) (-1217 "UDPO.spad" 2091458 2091469 2093921 2093926) (-1216 "TYPE.spad" 2091390 2091399 2091448 2091453) (-1215 "TYPEAST.spad" 2091309 2091318 2091380 2091385) (-1214 "TWOFACT.spad" 2089961 2089976 2091299 2091304) (-1213 "TUPLE.spad" 2089447 2089458 2089860 2089865) (-1212 "TUBETOOL.spad" 2086314 2086323 2089437 2089442) (-1211 "TUBE.spad" 2084961 2084978 2086304 2086309) (-1210 "TS.spad" 2083560 2083576 2084526 2084623) (-1209 "TSETCAT.spad" 2070687 2070704 2083528 2083555) (-1208 "TSETCAT.spad" 2057800 2057819 2070643 2070648) (-1207 "TRMANIP.spad" 2052166 2052183 2057506 2057511) (-1206 "TRIMAT.spad" 2051129 2051154 2052156 2052161) (-1205 "TRIGMNIP.spad" 2049656 2049673 2051119 2051124) (-1204 "TRIGCAT.spad" 2049168 2049177 2049646 2049651) (-1203 "TRIGCAT.spad" 2048678 2048689 2049158 2049163) (-1202 "TREE.spad" 2047253 2047264 2048285 2048312) (-1201 "TRANFUN.spad" 2047092 2047101 2047243 2047248) (-1200 "TRANFUN.spad" 2046929 2046940 2047082 2047087) (-1199 "TOPSP.spad" 2046603 2046612 2046919 2046924) (-1198 "TOOLSIGN.spad" 2046266 2046277 2046593 2046598) (-1197 "TEXTFILE.spad" 2044827 2044836 2046256 2046261) (-1196 "TEX.spad" 2041973 2041982 2044817 2044822) (-1195 "TEX1.spad" 2041529 2041540 2041963 2041968) (-1194 "TEMUTL.spad" 2041084 2041093 2041519 2041524) (-1193 "TBCMPPK.spad" 2039177 2039200 2041074 2041079) (-1192 "TBAGG.spad" 2038227 2038250 2039157 2039172) (-1191 "TBAGG.spad" 2037285 2037310 2038217 2038222) (-1190 "TANEXP.spad" 2036693 2036704 2037275 2037280) (-1189 "TABLE.spad" 2035104 2035127 2035374 2035401) (-1188 "TABLEAU.spad" 2034585 2034596 2035094 2035099) (-1187 "TABLBUMP.spad" 2031388 2031399 2034575 2034580) (-1186 "SYSTEM.spad" 2030616 2030625 2031378 2031383) (-1185 "SYSSOLP.spad" 2028099 2028110 2030606 2030611) (-1184 "SYSPTR.spad" 2027998 2028007 2028089 2028094) (-1183 "SYSNNI.spad" 2027180 2027191 2027988 2027993) (-1182 "SYSINT.spad" 2026584 2026595 2027170 2027175) (-1181 "SYNTAX.spad" 2022790 2022799 2026574 2026579) (-1180 "SYMTAB.spad" 2020858 2020867 2022780 2022785) (-1179 "SYMS.spad" 2016881 2016890 2020848 2020853) (-1178 "SYMPOLY.spad" 2015888 2015899 2015970 2016097) (-1177 "SYMFUNC.spad" 2015389 2015400 2015878 2015883) (-1176 "SYMBOL.spad" 2012892 2012901 2015379 2015384) (-1175 "SWITCH.spad" 2009663 2009672 2012882 2012887) (-1174 "SUTS.spad" 2006568 2006596 2008130 2008227) (-1173 "SUPXS.spad" 2003709 2003737 2004700 2004849) (-1172 "SUP.spad" 2000522 2000533 2001295 2001448) (-1171 "SUPFRACF.spad" 1999627 1999645 2000512 2000517) (-1170 "SUP2.spad" 1999019 1999032 1999617 1999622) (-1169 "SUMRF.spad" 1997993 1998004 1999009 1999014) (-1168 "SUMFS.spad" 1997630 1997647 1997983 1997988) (-1167 "SULS.spad" 1988175 1988203 1989275 1989704) (-1166 "SUCHTAST.spad" 1987944 1987953 1988165 1988170) (-1165 "SUCH.spad" 1987626 1987641 1987934 1987939) (-1164 "SUBSPACE.spad" 1979741 1979756 1987616 1987621) (-1163 "SUBRESP.spad" 1978911 1978925 1979697 1979702) (-1162 "STTF.spad" 1975010 1975026 1978901 1978906) (-1161 "STTFNC.spad" 1971478 1971494 1975000 1975005) (-1160 "STTAYLOR.spad" 1964132 1964143 1971359 1971364) (-1159 "STRTBL.spad" 1962637 1962654 1962786 1962813) (-1158 "STRING.spad" 1962046 1962055 1962060 1962087) (-1157 "STRICAT.spad" 1961834 1961843 1962014 1962041) (-1156 "STREAM.spad" 1958752 1958763 1961359 1961374) (-1155 "STREAM3.spad" 1958325 1958340 1958742 1958747) (-1154 "STREAM2.spad" 1957453 1957466 1958315 1958320) (-1153 "STREAM1.spad" 1957159 1957170 1957443 1957448) (-1152 "STINPROD.spad" 1956095 1956111 1957149 1957154) (-1151 "STEP.spad" 1955296 1955305 1956085 1956090) (-1150 "STBL.spad" 1953822 1953850 1953989 1954004) (-1149 "STAGG.spad" 1952897 1952908 1953812 1953817) (-1148 "STAGG.spad" 1951970 1951983 1952887 1952892) (-1147 "STACK.spad" 1951327 1951338 1951577 1951604) (-1146 "SREGSET.spad" 1949031 1949048 1950973 1951000) (-1145 "SRDCMPK.spad" 1947592 1947612 1949021 1949026) (-1144 "SRAGG.spad" 1942735 1942744 1947560 1947587) (-1143 "SRAGG.spad" 1937898 1937909 1942725 1942730) (-1142 "SQMATRIX.spad" 1935514 1935532 1936430 1936517) (-1141 "SPLTREE.spad" 1930066 1930079 1934950 1934977) (-1140 "SPLNODE.spad" 1926654 1926667 1930056 1930061) (-1139 "SPFCAT.spad" 1925463 1925472 1926644 1926649) (-1138 "SPECOUT.spad" 1924015 1924024 1925453 1925458) (-1137 "SPADXPT.spad" 1916154 1916163 1924005 1924010) (-1136 "spad-parser.spad" 1915619 1915628 1916144 1916149) (-1135 "SPADAST.spad" 1915320 1915329 1915609 1915614) (-1134 "SPACEC.spad" 1899519 1899530 1915310 1915315) (-1133 "SPACE3.spad" 1899295 1899306 1899509 1899514) (-1132 "SORTPAK.spad" 1898844 1898857 1899251 1899256) (-1131 "SOLVETRA.spad" 1896607 1896618 1898834 1898839) (-1130 "SOLVESER.spad" 1895135 1895146 1896597 1896602) (-1129 "SOLVERAD.spad" 1891161 1891172 1895125 1895130) (-1128 "SOLVEFOR.spad" 1889623 1889641 1891151 1891156) (-1127 "SNTSCAT.spad" 1889223 1889240 1889591 1889618) (-1126 "SMTS.spad" 1887495 1887521 1888788 1888885) (-1125 "SMP.spad" 1884970 1884990 1885360 1885487) (-1124 "SMITH.spad" 1883815 1883840 1884960 1884965) (-1123 "SMATCAT.spad" 1881925 1881955 1883759 1883810) (-1122 "SMATCAT.spad" 1879967 1879999 1881803 1881808) (-1121 "SKAGG.spad" 1878930 1878941 1879935 1879962) (-1120 "SINT.spad" 1877762 1877771 1878796 1878925) (-1119 "SIMPAN.spad" 1877490 1877499 1877752 1877757) (-1118 "SIG.spad" 1876820 1876829 1877480 1877485) (-1117 "SIGNRF.spad" 1875938 1875949 1876810 1876815) (-1116 "SIGNEF.spad" 1875217 1875234 1875928 1875933) (-1115 "SIGAST.spad" 1874602 1874611 1875207 1875212) (-1114 "SHP.spad" 1872530 1872545 1874558 1874563) (-1113 "SHDP.spad" 1862241 1862268 1862750 1862881) (-1112 "SGROUP.spad" 1861849 1861858 1862231 1862236) (-1111 "SGROUP.spad" 1861455 1861466 1861839 1861844) (-1110 "SGCF.spad" 1854618 1854627 1861445 1861450) (-1109 "SFRTCAT.spad" 1853548 1853565 1854586 1854613) (-1108 "SFRGCD.spad" 1852611 1852631 1853538 1853543) (-1107 "SFQCMPK.spad" 1847248 1847268 1852601 1852606) (-1106 "SFORT.spad" 1846687 1846701 1847238 1847243) (-1105 "SEXOF.spad" 1846530 1846570 1846677 1846682) (-1104 "SEX.spad" 1846422 1846431 1846520 1846525) (-1103 "SEXCAT.spad" 1844023 1844063 1846412 1846417) (-1102 "SET.spad" 1842347 1842358 1843444 1843483) (-1101 "SETMN.spad" 1840797 1840814 1842337 1842342) (-1100 "SETCAT.spad" 1840119 1840128 1840787 1840792) (-1099 "SETCAT.spad" 1839439 1839450 1840109 1840114) (-1098 "SETAGG.spad" 1835988 1835999 1839419 1839434) (-1097 "SETAGG.spad" 1832545 1832558 1835978 1835983) (-1096 "SEQAST.spad" 1832248 1832257 1832535 1832540) (-1095 "SEGXCAT.spad" 1831404 1831417 1832238 1832243) (-1094 "SEG.spad" 1831217 1831228 1831323 1831328) (-1093 "SEGCAT.spad" 1830142 1830153 1831207 1831212) (-1092 "SEGBIND.spad" 1829216 1829227 1830097 1830102) (-1091 "SEGBIND2.spad" 1828914 1828927 1829206 1829211) (-1090 "SEGAST.spad" 1828628 1828637 1828904 1828909) (-1089 "SEG2.spad" 1828063 1828076 1828584 1828589) (-1088 "SDVAR.spad" 1827339 1827350 1828053 1828058) (-1087 "SDPOL.spad" 1824765 1824776 1825056 1825183) (-1086 "SCPKG.spad" 1822854 1822865 1824755 1824760) (-1085 "SCOPE.spad" 1822007 1822016 1822844 1822849) (-1084 "SCACHE.spad" 1820703 1820714 1821997 1822002) (-1083 "SASTCAT.spad" 1820612 1820621 1820693 1820698) (-1082 "SAOS.spad" 1820484 1820493 1820602 1820607) (-1081 "SAERFFC.spad" 1820197 1820217 1820474 1820479) (-1080 "SAE.spad" 1818372 1818388 1818983 1819118) (-1079 "SAEFACT.spad" 1818073 1818093 1818362 1818367) (-1078 "RURPK.spad" 1815732 1815748 1818063 1818068) (-1077 "RULESET.spad" 1815185 1815209 1815722 1815727) (-1076 "RULE.spad" 1813425 1813449 1815175 1815180) (-1075 "RULECOLD.spad" 1813277 1813290 1813415 1813420) (-1074 "RTVALUE.spad" 1813012 1813021 1813267 1813272) (-1073 "RSTRCAST.spad" 1812729 1812738 1813002 1813007) (-1072 "RSETGCD.spad" 1809107 1809127 1812719 1812724) (-1071 "RSETCAT.spad" 1799043 1799060 1809075 1809102) (-1070 "RSETCAT.spad" 1788999 1789018 1799033 1799038) (-1069 "RSDCMPK.spad" 1787451 1787471 1788989 1788994) (-1068 "RRCC.spad" 1785835 1785865 1787441 1787446) (-1067 "RRCC.spad" 1784217 1784249 1785825 1785830) (-1066 "RPTAST.spad" 1783919 1783928 1784207 1784212) (-1065 "RPOLCAT.spad" 1763279 1763294 1783787 1783914) (-1064 "RPOLCAT.spad" 1742353 1742370 1762863 1762868) (-1063 "ROUTINE.spad" 1738236 1738245 1741000 1741027) (-1062 "ROMAN.spad" 1737564 1737573 1738102 1738231) (-1061 "ROIRC.spad" 1736644 1736676 1737554 1737559) (-1060 "RNS.spad" 1735547 1735556 1736546 1736639) (-1059 "RNS.spad" 1734536 1734547 1735537 1735542) (-1058 "RNG.spad" 1734271 1734280 1734526 1734531) (-1057 "RMODULE.spad" 1734036 1734047 1734261 1734266) (-1056 "RMCAT2.spad" 1733456 1733513 1734026 1734031) (-1055 "RMATRIX.spad" 1732280 1732299 1732623 1732662) (-1054 "RMATCAT.spad" 1727859 1727890 1732236 1732275) (-1053 "RMATCAT.spad" 1723328 1723361 1727707 1727712) (-1052 "RLINSET.spad" 1722722 1722733 1723318 1723323) (-1051 "RINTERP.spad" 1722610 1722630 1722712 1722717) (-1050 "RING.spad" 1722080 1722089 1722590 1722605) (-1049 "RING.spad" 1721558 1721569 1722070 1722075) (-1048 "RIDIST.spad" 1720950 1720959 1721548 1721553) (-1047 "RGCHAIN.spad" 1719533 1719549 1720435 1720462) (-1046 "RGBCSPC.spad" 1719314 1719326 1719523 1719528) (-1045 "RGBCMDL.spad" 1718844 1718856 1719304 1719309) (-1044 "RF.spad" 1716486 1716497 1718834 1718839) (-1043 "RFFACTOR.spad" 1715948 1715959 1716476 1716481) (-1042 "RFFACT.spad" 1715683 1715695 1715938 1715943) (-1041 "RFDIST.spad" 1714679 1714688 1715673 1715678) (-1040 "RETSOL.spad" 1714098 1714111 1714669 1714674) (-1039 "RETRACT.spad" 1713526 1713537 1714088 1714093) (-1038 "RETRACT.spad" 1712952 1712965 1713516 1713521) (-1037 "RETAST.spad" 1712764 1712773 1712942 1712947) (-1036 "RESULT.spad" 1710824 1710833 1711411 1711438) (-1035 "RESRING.spad" 1710171 1710218 1710762 1710819) (-1034 "RESLATC.spad" 1709495 1709506 1710161 1710166) (-1033 "REPSQ.spad" 1709226 1709237 1709485 1709490) (-1032 "REP.spad" 1706780 1706789 1709216 1709221) (-1031 "REPDB.spad" 1706487 1706498 1706770 1706775) (-1030 "REP2.spad" 1696145 1696156 1706329 1706334) (-1029 "REP1.spad" 1690341 1690352 1696095 1696100) (-1028 "REGSET.spad" 1688138 1688155 1689987 1690014) (-1027 "REF.spad" 1687473 1687484 1688093 1688098) (-1026 "REDORDER.spad" 1686679 1686696 1687463 1687468) (-1025 "RECLOS.spad" 1685462 1685482 1686166 1686259) (-1024 "REALSOLV.spad" 1684602 1684611 1685452 1685457) (-1023 "REAL.spad" 1684474 1684483 1684592 1684597) (-1022 "REAL0Q.spad" 1681772 1681787 1684464 1684469) (-1021 "REAL0.spad" 1678616 1678631 1681762 1681767) (-1020 "RDUCEAST.spad" 1678337 1678346 1678606 1678611) (-1019 "RDIV.spad" 1677992 1678017 1678327 1678332) (-1018 "RDIST.spad" 1677559 1677570 1677982 1677987) (-1017 "RDETRS.spad" 1676423 1676441 1677549 1677554) (-1016 "RDETR.spad" 1674562 1674580 1676413 1676418) (-1015 "RDEEFS.spad" 1673661 1673678 1674552 1674557) (-1014 "RDEEF.spad" 1672671 1672688 1673651 1673656) (-1013 "RCFIELD.spad" 1669857 1669866 1672573 1672666) (-1012 "RCFIELD.spad" 1667129 1667140 1669847 1669852) (-1011 "RCAGG.spad" 1665057 1665068 1667119 1667124) (-1010 "RCAGG.spad" 1662912 1662925 1664976 1664981) (-1009 "RATRET.spad" 1662272 1662283 1662902 1662907) (-1008 "RATFACT.spad" 1661964 1661976 1662262 1662267) (-1007 "RANDSRC.spad" 1661283 1661292 1661954 1661959) (-1006 "RADUTIL.spad" 1661039 1661048 1661273 1661278) (-1005 "RADIX.spad" 1657960 1657974 1659506 1659599) (-1004 "RADFF.spad" 1656373 1656410 1656492 1656648) (-1003 "RADCAT.spad" 1655968 1655977 1656363 1656368) (-1002 "RADCAT.spad" 1655561 1655572 1655958 1655963) (-1001 "QUEUE.spad" 1654909 1654920 1655168 1655195) (-1000 "QUAT.spad" 1653490 1653501 1653833 1653898) (-999 "QUATCT2.spad" 1653111 1653129 1653480 1653485) (-998 "QUATCAT.spad" 1651282 1651292 1653041 1653106) (-997 "QUATCAT.spad" 1649204 1649216 1650965 1650970) (-996 "QUAGG.spad" 1648032 1648042 1649172 1649199) (-995 "QQUTAST.spad" 1647801 1647809 1648022 1648027) (-994 "QFORM.spad" 1647266 1647280 1647791 1647796) (-993 "QFCAT.spad" 1645969 1645979 1647168 1647261) (-992 "QFCAT.spad" 1644263 1644275 1645464 1645469) (-991 "QFCAT2.spad" 1643956 1643972 1644253 1644258) (-990 "QEQUAT.spad" 1643515 1643523 1643946 1643951) (-989 "QCMPACK.spad" 1638262 1638281 1643505 1643510) (-988 "QALGSET.spad" 1634341 1634373 1638176 1638181) (-987 "QALGSET2.spad" 1632337 1632355 1634331 1634336) (-986 "PWFFINTB.spad" 1629753 1629774 1632327 1632332) (-985 "PUSHVAR.spad" 1629092 1629111 1629743 1629748) (-984 "PTRANFN.spad" 1625220 1625230 1629082 1629087) (-983 "PTPACK.spad" 1622308 1622318 1625210 1625215) (-982 "PTFUNC2.spad" 1622131 1622145 1622298 1622303) (-981 "PTCAT.spad" 1621386 1621396 1622099 1622126) (-980 "PSQFR.spad" 1620693 1620717 1621376 1621381) (-979 "PSEUDLIN.spad" 1619579 1619589 1620683 1620688) (-978 "PSETPK.spad" 1605012 1605028 1619457 1619462) (-977 "PSETCAT.spad" 1598932 1598955 1604992 1605007) (-976 "PSETCAT.spad" 1592826 1592851 1598888 1598893) (-975 "PSCURVE.spad" 1591809 1591817 1592816 1592821) (-974 "PSCAT.spad" 1590592 1590621 1591707 1591804) (-973 "PSCAT.spad" 1589465 1589496 1590582 1590587) (-972 "PRTITION.spad" 1588426 1588434 1589455 1589460) (-971 "PRTDAST.spad" 1588145 1588153 1588416 1588421) (-970 "PRS.spad" 1577707 1577724 1588101 1588106) (-969 "PRQAGG.spad" 1577142 1577152 1577675 1577702) (-968 "PROPLOG.spad" 1576441 1576449 1577132 1577137) (-967 "PROPFRML.spad" 1575257 1575268 1576431 1576436) (-966 "PROPERTY.spad" 1574745 1574753 1575247 1575252) (-965 "PRODUCT.spad" 1572427 1572439 1572711 1572766) (-964 "PR.spad" 1570819 1570831 1571518 1571645) (-963 "PRINT.spad" 1570571 1570579 1570809 1570814) (-962 "PRIMES.spad" 1568824 1568834 1570561 1570566) (-961 "PRIMELT.spad" 1566905 1566919 1568814 1568819) (-960 "PRIMCAT.spad" 1566532 1566540 1566895 1566900) (-959 "PRIMARR.spad" 1565537 1565547 1565715 1565742) (-958 "PRIMARR2.spad" 1564304 1564316 1565527 1565532) (-957 "PREASSOC.spad" 1563686 1563698 1564294 1564299) (-956 "PPCURVE.spad" 1562823 1562831 1563676 1563681) (-955 "PORTNUM.spad" 1562598 1562606 1562813 1562818) (-954 "POLYROOT.spad" 1561447 1561469 1562554 1562559) (-953 "POLY.spad" 1558782 1558792 1559297 1559424) (-952 "POLYLIFT.spad" 1558047 1558070 1558772 1558777) (-951 "POLYCATQ.spad" 1556165 1556187 1558037 1558042) (-950 "POLYCAT.spad" 1549635 1549656 1556033 1556160) (-949 "POLYCAT.spad" 1542443 1542466 1548843 1548848) (-948 "POLY2UP.spad" 1541895 1541909 1542433 1542438) (-947 "POLY2.spad" 1541492 1541504 1541885 1541890) (-946 "POLUTIL.spad" 1540433 1540462 1541448 1541453) (-945 "POLTOPOL.spad" 1539181 1539196 1540423 1540428) (-944 "POINT.spad" 1538019 1538029 1538106 1538133) (-943 "PNTHEORY.spad" 1534721 1534729 1538009 1538014) (-942 "PMTOOLS.spad" 1533496 1533510 1534711 1534716) (-941 "PMSYM.spad" 1533045 1533055 1533486 1533491) (-940 "PMQFCAT.spad" 1532636 1532650 1533035 1533040) (-939 "PMPRED.spad" 1532115 1532129 1532626 1532631) (-938 "PMPREDFS.spad" 1531569 1531591 1532105 1532110) (-937 "PMPLCAT.spad" 1530649 1530667 1531501 1531506) (-936 "PMLSAGG.spad" 1530234 1530248 1530639 1530644) (-935 "PMKERNEL.spad" 1529813 1529825 1530224 1530229) (-934 "PMINS.spad" 1529393 1529403 1529803 1529808) (-933 "PMFS.spad" 1528970 1528988 1529383 1529388) (-932 "PMDOWN.spad" 1528260 1528274 1528960 1528965) (-931 "PMASS.spad" 1527270 1527278 1528250 1528255) (-930 "PMASSFS.spad" 1526237 1526253 1527260 1527265) (-929 "PLOTTOOL.spad" 1526017 1526025 1526227 1526232) (-928 "PLOT.spad" 1520940 1520948 1526007 1526012) (-927 "PLOT3D.spad" 1517404 1517412 1520930 1520935) (-926 "PLOT1.spad" 1516561 1516571 1517394 1517399) (-925 "PLEQN.spad" 1503851 1503878 1516551 1516556) (-924 "PINTERP.spad" 1503473 1503492 1503841 1503846) (-923 "PINTERPA.spad" 1503257 1503273 1503463 1503468) (-922 "PI.spad" 1502866 1502874 1503231 1503252) (-921 "PID.spad" 1501836 1501844 1502792 1502861) (-920 "PICOERCE.spad" 1501493 1501503 1501826 1501831) (-919 "PGROEB.spad" 1500094 1500108 1501483 1501488) (-918 "PGE.spad" 1491711 1491719 1500084 1500089) (-917 "PGCD.spad" 1490601 1490618 1491701 1491706) (-916 "PFRPAC.spad" 1489750 1489760 1490591 1490596) (-915 "PFR.spad" 1486413 1486423 1489652 1489745) (-914 "PFOTOOLS.spad" 1485671 1485687 1486403 1486408) (-913 "PFOQ.spad" 1485041 1485059 1485661 1485666) (-912 "PFO.spad" 1484460 1484487 1485031 1485036) (-911 "PF.spad" 1484034 1484046 1484265 1484358) (-910 "PFECAT.spad" 1481716 1481724 1483960 1484029) (-909 "PFECAT.spad" 1479426 1479436 1481672 1481677) (-908 "PFBRU.spad" 1477314 1477326 1479416 1479421) (-907 "PFBR.spad" 1474874 1474897 1477304 1477309) (-906 "PERM.spad" 1470559 1470569 1474704 1474719) (-905 "PERMGRP.spad" 1465321 1465331 1470549 1470554) (-904 "PERMCAT.spad" 1463879 1463889 1465301 1465316) (-903 "PERMAN.spad" 1462411 1462425 1463869 1463874) (-902 "PENDTREE.spad" 1461752 1461762 1462040 1462045) (-901 "PDRING.spad" 1460303 1460313 1461732 1461747) (-900 "PDRING.spad" 1458862 1458874 1460293 1460298) (-899 "PDEPROB.spad" 1457877 1457885 1458852 1458857) (-898 "PDEPACK.spad" 1451917 1451925 1457867 1457872) (-897 "PDECOMP.spad" 1451387 1451404 1451907 1451912) (-896 "PDECAT.spad" 1449743 1449751 1451377 1451382) (-895 "PCOMP.spad" 1449596 1449609 1449733 1449738) (-894 "PBWLB.spad" 1448184 1448201 1449586 1449591) (-893 "PATTERN.spad" 1442723 1442733 1448174 1448179) (-892 "PATTERN2.spad" 1442461 1442473 1442713 1442718) (-891 "PATTERN1.spad" 1440797 1440813 1442451 1442456) (-890 "PATRES.spad" 1438372 1438384 1440787 1440792) (-889 "PATRES2.spad" 1438044 1438058 1438362 1438367) (-888 "PATMATCH.spad" 1436241 1436272 1437752 1437757) (-887 "PATMAB.spad" 1435670 1435680 1436231 1436236) (-886 "PATLRES.spad" 1434756 1434770 1435660 1435665) (-885 "PATAB.spad" 1434520 1434530 1434746 1434751) (-884 "PARTPERM.spad" 1431920 1431928 1434510 1434515) (-883 "PARSURF.spad" 1431354 1431382 1431910 1431915) (-882 "PARSU2.spad" 1431151 1431167 1431344 1431349) (-881 "script-parser.spad" 1430671 1430679 1431141 1431146) (-880 "PARSCURV.spad" 1430105 1430133 1430661 1430666) (-879 "PARSC2.spad" 1429896 1429912 1430095 1430100) (-878 "PARPCURV.spad" 1429358 1429386 1429886 1429891) (-877 "PARPC2.spad" 1429149 1429165 1429348 1429353) (-876 "PAN2EXPR.spad" 1428561 1428569 1429139 1429144) (-875 "PALETTE.spad" 1427531 1427539 1428551 1428556) (-874 "PAIR.spad" 1426518 1426531 1427119 1427124) (-873 "PADICRC.spad" 1423852 1423870 1425023 1425116) (-872 "PADICRAT.spad" 1421867 1421879 1422088 1422181) (-871 "PADIC.spad" 1421562 1421574 1421793 1421862) (-870 "PADICCT.spad" 1420111 1420123 1421488 1421557) (-869 "PADEPAC.spad" 1418800 1418819 1420101 1420106) (-868 "PADE.spad" 1417552 1417568 1418790 1418795) (-867 "OWP.spad" 1416792 1416822 1417410 1417477) (-866 "OVERSET.spad" 1416365 1416373 1416782 1416787) (-865 "OVAR.spad" 1416146 1416169 1416355 1416360) (-864 "OUT.spad" 1415232 1415240 1416136 1416141) (-863 "OUTFORM.spad" 1404624 1404632 1415222 1415227) (-862 "OUTBFILE.spad" 1404042 1404050 1404614 1404619) (-861 "OUTBCON.spad" 1403048 1403056 1404032 1404037) (-860 "OUTBCON.spad" 1402052 1402062 1403038 1403043) (-859 "OSI.spad" 1401527 1401535 1402042 1402047) (-858 "OSGROUP.spad" 1401445 1401453 1401517 1401522) (-857 "ORTHPOL.spad" 1399930 1399940 1401362 1401367) (-856 "OREUP.spad" 1399383 1399411 1399610 1399649) (-855 "ORESUP.spad" 1398684 1398708 1399063 1399102) (-854 "OREPCTO.spad" 1396541 1396553 1398604 1398609) (-853 "OREPCAT.spad" 1390688 1390698 1396497 1396536) (-852 "OREPCAT.spad" 1384725 1384737 1390536 1390541) (-851 "ORDSET.spad" 1383897 1383905 1384715 1384720) (-850 "ORDSET.spad" 1383067 1383077 1383887 1383892) (-849 "ORDRING.spad" 1382457 1382465 1383047 1383062) (-848 "ORDRING.spad" 1381855 1381865 1382447 1382452) (-847 "ORDMON.spad" 1381710 1381718 1381845 1381850) (-846 "ORDFUNS.spad" 1380842 1380858 1381700 1381705) (-845 "ORDFIN.spad" 1380662 1380670 1380832 1380837) (-844 "ORDCOMP.spad" 1379127 1379137 1380209 1380238) (-843 "ORDCOMP2.spad" 1378420 1378432 1379117 1379122) (-842 "OPTPROB.spad" 1377058 1377066 1378410 1378415) (-841 "OPTPACK.spad" 1369467 1369475 1377048 1377053) (-840 "OPTCAT.spad" 1367146 1367154 1369457 1369462) (-839 "OPSIG.spad" 1366800 1366808 1367136 1367141) (-838 "OPQUERY.spad" 1366349 1366357 1366790 1366795) (-837 "OP.spad" 1366091 1366101 1366171 1366238) (-836 "OPERCAT.spad" 1365557 1365567 1366081 1366086) (-835 "OPERCAT.spad" 1365021 1365033 1365547 1365552) (-834 "ONECOMP.spad" 1363766 1363776 1364568 1364597) (-833 "ONECOMP2.spad" 1363190 1363202 1363756 1363761) (-832 "OMSERVER.spad" 1362196 1362204 1363180 1363185) (-831 "OMSAGG.spad" 1361984 1361994 1362152 1362191) (-830 "OMPKG.spad" 1360600 1360608 1361974 1361979) (-829 "OM.spad" 1359573 1359581 1360590 1360595) (-828 "OMLO.spad" 1358998 1359010 1359459 1359498) (-827 "OMEXPR.spad" 1358832 1358842 1358988 1358993) (-826 "OMERR.spad" 1358377 1358385 1358822 1358827) (-825 "OMERRK.spad" 1357411 1357419 1358367 1358372) (-824 "OMENC.spad" 1356755 1356763 1357401 1357406) (-823 "OMDEV.spad" 1351064 1351072 1356745 1356750) (-822 "OMCONN.spad" 1350473 1350481 1351054 1351059) (-821 "OINTDOM.spad" 1350236 1350244 1350399 1350468) (-820 "OFMONOID.spad" 1348359 1348369 1350192 1350197) (-819 "ODVAR.spad" 1347620 1347630 1348349 1348354) (-818 "ODR.spad" 1347264 1347290 1347432 1347581) (-817 "ODPOL.spad" 1344646 1344656 1344986 1345113) (-816 "ODP.spad" 1334493 1334513 1334866 1334997) (-815 "ODETOOLS.spad" 1333142 1333161 1334483 1334488) (-814 "ODESYS.spad" 1330836 1330853 1333132 1333137) (-813 "ODERTRIC.spad" 1326845 1326862 1330793 1330798) (-812 "ODERED.spad" 1326244 1326268 1326835 1326840) (-811 "ODERAT.spad" 1323859 1323876 1326234 1326239) (-810 "ODEPRRIC.spad" 1320896 1320918 1323849 1323854) (-809 "ODEPROB.spad" 1320153 1320161 1320886 1320891) (-808 "ODEPRIM.spad" 1317487 1317509 1320143 1320148) (-807 "ODEPAL.spad" 1316873 1316897 1317477 1317482) (-806 "ODEPACK.spad" 1303539 1303547 1316863 1316868) (-805 "ODEINT.spad" 1302974 1302990 1303529 1303534) (-804 "ODEIFTBL.spad" 1300369 1300377 1302964 1302969) (-803 "ODEEF.spad" 1295860 1295876 1300359 1300364) (-802 "ODECONST.spad" 1295397 1295415 1295850 1295855) (-801 "ODECAT.spad" 1293995 1294003 1295387 1295392) (-800 "OCT.spad" 1292131 1292141 1292845 1292884) (-799 "OCTCT2.spad" 1291777 1291798 1292121 1292126) (-798 "OC.spad" 1289573 1289583 1291733 1291772) (-797 "OC.spad" 1287094 1287106 1289256 1289261) (-796 "OCAMON.spad" 1286942 1286950 1287084 1287089) (-795 "OASGP.spad" 1286757 1286765 1286932 1286937) (-794 "OAMONS.spad" 1286279 1286287 1286747 1286752) (-793 "OAMON.spad" 1286140 1286148 1286269 1286274) (-792 "OAGROUP.spad" 1286002 1286010 1286130 1286135) (-791 "NUMTUBE.spad" 1285593 1285609 1285992 1285997) (-790 "NUMQUAD.spad" 1273569 1273577 1285583 1285588) (-789 "NUMODE.spad" 1264923 1264931 1273559 1273564) (-788 "NUMINT.spad" 1262489 1262497 1264913 1264918) (-787 "NUMFMT.spad" 1261329 1261337 1262479 1262484) (-786 "NUMERIC.spad" 1253443 1253453 1261134 1261139) (-785 "NTSCAT.spad" 1251951 1251967 1253411 1253438) (-784 "NTPOLFN.spad" 1251502 1251512 1251868 1251873) (-783 "NSUP.spad" 1244548 1244558 1249088 1249241) (-782 "NSUP2.spad" 1243940 1243952 1244538 1244543) (-781 "NSMP.spad" 1240171 1240190 1240479 1240606) (-780 "NREP.spad" 1238549 1238563 1240161 1240166) (-779 "NPCOEF.spad" 1237795 1237815 1238539 1238544) (-778 "NORMRETR.spad" 1237393 1237432 1237785 1237790) (-777 "NORMPK.spad" 1235295 1235314 1237383 1237388) (-776 "NORMMA.spad" 1234983 1235009 1235285 1235290) (-775 "NONE.spad" 1234724 1234732 1234973 1234978) (-774 "NONE1.spad" 1234400 1234410 1234714 1234719) (-773 "NODE1.spad" 1233887 1233903 1234390 1234395) (-772 "NNI.spad" 1232782 1232790 1233861 1233882) (-771 "NLINSOL.spad" 1231408 1231418 1232772 1232777) (-770 "NIPROB.spad" 1229949 1229957 1231398 1231403) (-769 "NFINTBAS.spad" 1227509 1227526 1229939 1229944) (-768 "NETCLT.spad" 1227483 1227494 1227499 1227504) (-767 "NCODIV.spad" 1225699 1225715 1227473 1227478) (-766 "NCNTFRAC.spad" 1225341 1225355 1225689 1225694) (-765 "NCEP.spad" 1223507 1223521 1225331 1225336) (-764 "NASRING.spad" 1223103 1223111 1223497 1223502) (-763 "NASRING.spad" 1222697 1222707 1223093 1223098) (-762 "NARNG.spad" 1222049 1222057 1222687 1222692) (-761 "NARNG.spad" 1221399 1221409 1222039 1222044) (-760 "NAGSP.spad" 1220476 1220484 1221389 1221394) (-759 "NAGS.spad" 1210137 1210145 1220466 1220471) (-758 "NAGF07.spad" 1208568 1208576 1210127 1210132) (-757 "NAGF04.spad" 1202970 1202978 1208558 1208563) (-756 "NAGF02.spad" 1197039 1197047 1202960 1202965) (-755 "NAGF01.spad" 1192800 1192808 1197029 1197034) (-754 "NAGE04.spad" 1186500 1186508 1192790 1192795) (-753 "NAGE02.spad" 1177160 1177168 1186490 1186495) (-752 "NAGE01.spad" 1173162 1173170 1177150 1177155) (-751 "NAGD03.spad" 1171166 1171174 1173152 1173157) (-750 "NAGD02.spad" 1163913 1163921 1171156 1171161) (-749 "NAGD01.spad" 1158206 1158214 1163903 1163908) (-748 "NAGC06.spad" 1154081 1154089 1158196 1158201) (-747 "NAGC05.spad" 1152582 1152590 1154071 1154076) (-746 "NAGC02.spad" 1151849 1151857 1152572 1152577) (-745 "NAALG.spad" 1151390 1151400 1151817 1151844) (-744 "NAALG.spad" 1150951 1150963 1151380 1151385) (-743 "MULTSQFR.spad" 1147909 1147926 1150941 1150946) (-742 "MULTFACT.spad" 1147292 1147309 1147899 1147904) (-741 "MTSCAT.spad" 1145386 1145407 1147190 1147287) (-740 "MTHING.spad" 1145045 1145055 1145376 1145381) (-739 "MSYSCMD.spad" 1144479 1144487 1145035 1145040) (-738 "MSET.spad" 1142437 1142447 1144185 1144224) (-737 "MSETAGG.spad" 1142282 1142292 1142405 1142432) (-736 "MRING.spad" 1139259 1139271 1141990 1142057) (-735 "MRF2.spad" 1138829 1138843 1139249 1139254) (-734 "MRATFAC.spad" 1138375 1138392 1138819 1138824) (-733 "MPRFF.spad" 1136415 1136434 1138365 1138370) (-732 "MPOLY.spad" 1133886 1133901 1134245 1134372) (-731 "MPCPF.spad" 1133150 1133169 1133876 1133881) (-730 "MPC3.spad" 1132967 1133007 1133140 1133145) (-729 "MPC2.spad" 1132613 1132646 1132957 1132962) (-728 "MONOTOOL.spad" 1130964 1130981 1132603 1132608) (-727 "MONOID.spad" 1130283 1130291 1130954 1130959) (-726 "MONOID.spad" 1129600 1129610 1130273 1130278) (-725 "MONOGEN.spad" 1128348 1128361 1129460 1129595) (-724 "MONOGEN.spad" 1127118 1127133 1128232 1128237) (-723 "MONADWU.spad" 1125148 1125156 1127108 1127113) (-722 "MONADWU.spad" 1123176 1123186 1125138 1125143) (-721 "MONAD.spad" 1122336 1122344 1123166 1123171) (-720 "MONAD.spad" 1121494 1121504 1122326 1122331) (-719 "MOEBIUS.spad" 1120230 1120244 1121474 1121489) (-718 "MODULE.spad" 1120100 1120110 1120198 1120225) (-717 "MODULE.spad" 1119990 1120002 1120090 1120095) (-716 "MODRING.spad" 1119325 1119364 1119970 1119985) (-715 "MODOP.spad" 1117990 1118002 1119147 1119214) (-714 "MODMONOM.spad" 1117721 1117739 1117980 1117985) (-713 "MODMON.spad" 1114516 1114532 1115235 1115388) (-712 "MODFIELD.spad" 1113878 1113917 1114418 1114511) (-711 "MMLFORM.spad" 1112738 1112746 1113868 1113873) (-710 "MMAP.spad" 1112480 1112514 1112728 1112733) (-709 "MLO.spad" 1110939 1110949 1112436 1112475) (-708 "MLIFT.spad" 1109551 1109568 1110929 1110934) (-707 "MKUCFUNC.spad" 1109086 1109104 1109541 1109546) (-706 "MKRECORD.spad" 1108690 1108703 1109076 1109081) (-705 "MKFUNC.spad" 1108097 1108107 1108680 1108685) (-704 "MKFLCFN.spad" 1107065 1107075 1108087 1108092) (-703 "MKBCFUNC.spad" 1106560 1106578 1107055 1107060) (-702 "MINT.spad" 1105999 1106007 1106462 1106555) (-701 "MHROWRED.spad" 1104510 1104520 1105989 1105994) (-700 "MFLOAT.spad" 1103030 1103038 1104400 1104505) (-699 "MFINFACT.spad" 1102430 1102452 1103020 1103025) (-698 "MESH.spad" 1100212 1100220 1102420 1102425) (-697 "MDDFACT.spad" 1098423 1098433 1100202 1100207) (-696 "MDAGG.spad" 1097714 1097724 1098403 1098418) (-695 "MCMPLX.spad" 1093725 1093733 1094339 1094540) (-694 "MCDEN.spad" 1092935 1092947 1093715 1093720) (-693 "MCALCFN.spad" 1090057 1090083 1092925 1092930) (-692 "MAYBE.spad" 1089341 1089352 1090047 1090052) (-691 "MATSTOR.spad" 1086649 1086659 1089331 1089336) (-690 "MATRIX.spad" 1085353 1085363 1085837 1085864) (-689 "MATLIN.spad" 1082697 1082721 1085237 1085242) (-688 "MATCAT.spad" 1074426 1074448 1082665 1082692) (-687 "MATCAT.spad" 1066027 1066051 1074268 1074273) (-686 "MATCAT2.spad" 1065309 1065357 1066017 1066022) (-685 "MAPPKG3.spad" 1064224 1064238 1065299 1065304) (-684 "MAPPKG2.spad" 1063562 1063574 1064214 1064219) (-683 "MAPPKG1.spad" 1062390 1062400 1063552 1063557) (-682 "MAPPAST.spad" 1061705 1061713 1062380 1062385) (-681 "MAPHACK3.spad" 1061517 1061531 1061695 1061700) (-680 "MAPHACK2.spad" 1061286 1061298 1061507 1061512) (-679 "MAPHACK1.spad" 1060930 1060940 1061276 1061281) (-678 "MAGMA.spad" 1058720 1058737 1060920 1060925) (-677 "MACROAST.spad" 1058299 1058307 1058710 1058715) (-676 "M3D.spad" 1056019 1056029 1057677 1057682) (-675 "LZSTAGG.spad" 1053257 1053267 1056009 1056014) (-674 "LZSTAGG.spad" 1050493 1050505 1053247 1053252) (-673 "LWORD.spad" 1047198 1047215 1050483 1050488) (-672 "LSTAST.spad" 1046982 1046990 1047188 1047193) (-671 "LSQM.spad" 1045212 1045226 1045606 1045657) (-670 "LSPP.spad" 1044747 1044764 1045202 1045207) (-669 "LSMP.spad" 1043597 1043625 1044737 1044742) (-668 "LSMP1.spad" 1041415 1041429 1043587 1043592) (-667 "LSAGG.spad" 1041084 1041094 1041383 1041410) (-666 "LSAGG.spad" 1040773 1040785 1041074 1041079) (-665 "LPOLY.spad" 1039727 1039746 1040629 1040698) (-664 "LPEFRAC.spad" 1038998 1039008 1039717 1039722) (-663 "LO.spad" 1038399 1038413 1038932 1038959) (-662 "LOGIC.spad" 1038001 1038009 1038389 1038394) (-661 "LOGIC.spad" 1037601 1037611 1037991 1037996) (-660 "LODOOPS.spad" 1036531 1036543 1037591 1037596) (-659 "LODO.spad" 1035915 1035931 1036211 1036250) (-658 "LODOF.spad" 1034961 1034978 1035872 1035877) (-657 "LODOCAT.spad" 1033627 1033637 1034917 1034956) (-656 "LODOCAT.spad" 1032291 1032303 1033583 1033588) (-655 "LODO2.spad" 1031564 1031576 1031971 1032010) (-654 "LODO1.spad" 1030964 1030974 1031244 1031283) (-653 "LODEEF.spad" 1029766 1029784 1030954 1030959) (-652 "LNAGG.spad" 1025598 1025608 1029756 1029761) (-651 "LNAGG.spad" 1021394 1021406 1025554 1025559) (-650 "LMOPS.spad" 1018162 1018179 1021384 1021389) (-649 "LMODULE.spad" 1017930 1017940 1018152 1018157) (-648 "LMDICT.spad" 1017217 1017227 1017481 1017508) (-647 "LLINSET.spad" 1016614 1016624 1017207 1017212) (-646 "LITERAL.spad" 1016520 1016531 1016604 1016609) (-645 "LIST.spad" 1014255 1014265 1015667 1015694) (-644 "LIST3.spad" 1013566 1013580 1014245 1014250) (-643 "LIST2.spad" 1012268 1012280 1013556 1013561) (-642 "LIST2MAP.spad" 1009171 1009183 1012258 1012263) (-641 "LINSET.spad" 1008793 1008803 1009161 1009166) (-640 "LINEXP.spad" 1008227 1008237 1008773 1008788) (-639 "LINDEP.spad" 1007036 1007048 1008139 1008144) (-638 "LIMITRF.spad" 1004964 1004974 1007026 1007031) (-637 "LIMITPS.spad" 1003867 1003880 1004954 1004959) (-636 "LIE.spad" 1001883 1001895 1003157 1003302) (-635 "LIECAT.spad" 1001359 1001369 1001809 1001878) (-634 "LIECAT.spad" 1000863 1000875 1001315 1001320) (-633 "LIB.spad" 998913 998921 999522 999537) (-632 "LGROBP.spad" 996266 996285 998903 998908) (-631 "LF.spad" 995221 995237 996256 996261) (-630 "LFCAT.spad" 994280 994288 995211 995216) (-629 "LEXTRIPK.spad" 989783 989798 994270 994275) (-628 "LEXP.spad" 987786 987813 989763 989778) (-627 "LETAST.spad" 987485 987493 987776 987781) (-626 "LEADCDET.spad" 985883 985900 987475 987480) (-625 "LAZM3PK.spad" 984587 984609 985873 985878) (-624 "LAUPOL.spad" 983280 983293 984180 984249) (-623 "LAPLACE.spad" 982863 982879 983270 983275) (-622 "LA.spad" 982303 982317 982785 982824) (-621 "LALG.spad" 982079 982089 982283 982298) (-620 "LALG.spad" 981863 981875 982069 982074) (-619 "KVTFROM.spad" 981598 981608 981853 981858) (-618 "KTVLOGIC.spad" 981110 981118 981588 981593) (-617 "KRCFROM.spad" 980848 980858 981100 981105) (-616 "KOVACIC.spad" 979571 979588 980838 980843) (-615 "KONVERT.spad" 979293 979303 979561 979566) (-614 "KOERCE.spad" 979030 979040 979283 979288) (-613 "KERNEL.spad" 977685 977695 978814 978819) (-612 "KERNEL2.spad" 977388 977400 977675 977680) (-611 "KDAGG.spad" 976497 976519 977368 977383) (-610 "KDAGG.spad" 975614 975638 976487 976492) (-609 "KAFILE.spad" 974577 974593 974812 974839) (-608 "JORDAN.spad" 972406 972418 973867 974012) (-607 "JOINAST.spad" 972100 972108 972396 972401) (-606 "JAVACODE.spad" 971966 971974 972090 972095) (-605 "IXAGG.spad" 970099 970123 971956 971961) (-604 "IXAGG.spad" 968087 968113 969946 969951) (-603 "IVECTOR.spad" 966857 966872 967012 967039) (-602 "ITUPLE.spad" 966018 966028 966847 966852) (-601 "ITRIGMNP.spad" 964857 964876 966008 966013) (-600 "ITFUN3.spad" 964363 964377 964847 964852) (-599 "ITFUN2.spad" 964107 964119 964353 964358) (-598 "ITAYLOR.spad" 962101 962116 963971 964068) (-597 "ISUPS.spad" 954538 954553 961075 961172) (-596 "ISUMP.spad" 954039 954055 954528 954533) (-595 "ISTRING.spad" 953127 953140 953208 953235) (-594 "ISAST.spad" 952846 952854 953117 953122) (-593 "IRURPK.spad" 951563 951582 952836 952841) (-592 "IRSN.spad" 949567 949575 951553 951558) (-591 "IRRF2F.spad" 948052 948062 949523 949528) (-590 "IRREDFFX.spad" 947653 947664 948042 948047) (-589 "IROOT.spad" 945992 946002 947643 947648) (-588 "IR.spad" 943793 943807 945847 945874) (-587 "IR2.spad" 942821 942837 943783 943788) (-586 "IR2F.spad" 942027 942043 942811 942816) (-585 "IPRNTPK.spad" 941787 941795 942017 942022) (-584 "IPF.spad" 941352 941364 941592 941685) (-583 "IPADIC.spad" 941113 941139 941278 941347) (-582 "IP4ADDR.spad" 940670 940678 941103 941108) (-581 "IOMODE.spad" 940291 940299 940660 940665) (-580 "IOBFILE.spad" 939652 939660 940281 940286) (-579 "IOBCON.spad" 939517 939525 939642 939647) (-578 "INVLAPLA.spad" 939166 939182 939507 939512) (-577 "INTTR.spad" 932548 932565 939156 939161) (-576 "INTTOOLS.spad" 930303 930319 932122 932127) (-575 "INTSLPE.spad" 929623 929631 930293 930298) (-574 "INTRVL.spad" 929189 929199 929537 929618) (-573 "INTRF.spad" 927613 927627 929179 929184) (-572 "INTRET.spad" 927045 927055 927603 927608) (-571 "INTRAT.spad" 925772 925789 927035 927040) (-570 "INTPM.spad" 924157 924173 925415 925420) (-569 "INTPAF.spad" 922021 922039 924089 924094) (-568 "INTPACK.spad" 912395 912403 922011 922016) (-567 "INT.spad" 911843 911851 912249 912390) (-566 "INTHERTR.spad" 911117 911134 911833 911838) (-565 "INTHERAL.spad" 910787 910811 911107 911112) (-564 "INTHEORY.spad" 907226 907234 910777 910782) (-563 "INTG0.spad" 900959 900977 907158 907163) (-562 "INTFTBL.spad" 894988 894996 900949 900954) (-561 "INTFACT.spad" 894047 894057 894978 894983) (-560 "INTEF.spad" 892432 892448 894037 894042) (-559 "INTDOM.spad" 891055 891063 892358 892427) (-558 "INTDOM.spad" 889740 889750 891045 891050) (-557 "INTCAT.spad" 887999 888009 889654 889735) (-556 "INTBIT.spad" 887506 887514 887989 887994) (-555 "INTALG.spad" 886694 886721 887496 887501) (-554 "INTAF.spad" 886194 886210 886684 886689) (-553 "INTABL.spad" 884712 884743 884875 884902) (-552 "INT8.spad" 884592 884600 884702 884707) (-551 "INT64.spad" 884471 884479 884582 884587) (-550 "INT32.spad" 884350 884358 884461 884466) (-549 "INT16.spad" 884229 884237 884340 884345) (-548 "INS.spad" 881732 881740 884131 884224) (-547 "INS.spad" 879321 879331 881722 881727) (-546 "INPSIGN.spad" 878769 878782 879311 879316) (-545 "INPRODPF.spad" 877865 877884 878759 878764) (-544 "INPRODFF.spad" 876953 876977 877855 877860) (-543 "INNMFACT.spad" 875928 875945 876943 876948) (-542 "INMODGCD.spad" 875416 875446 875918 875923) (-541 "INFSP.spad" 873713 873735 875406 875411) (-540 "INFPROD0.spad" 872793 872812 873703 873708) (-539 "INFORM.spad" 869992 870000 872783 872788) (-538 "INFORM1.spad" 869617 869627 869982 869987) (-537 "INFINITY.spad" 869169 869177 869607 869612) (-536 "INETCLTS.spad" 869146 869154 869159 869164) (-535 "INEP.spad" 867684 867706 869136 869141) (-534 "INDE.spad" 867413 867430 867674 867679) (-533 "INCRMAPS.spad" 866834 866844 867403 867408) (-532 "INBFILE.spad" 865906 865914 866824 866829) (-531 "INBFF.spad" 861700 861711 865896 865901) (-530 "INBCON.spad" 859990 859998 861690 861695) (-529 "INBCON.spad" 858278 858288 859980 859985) (-528 "INAST.spad" 857939 857947 858268 858273) (-527 "IMPTAST.spad" 857647 857655 857929 857934) (-526 "IMATRIX.spad" 856592 856618 857104 857131) (-525 "IMATQF.spad" 855686 855730 856548 856553) (-524 "IMATLIN.spad" 854291 854315 855642 855647) (-523 "ILIST.spad" 852949 852964 853474 853501) (-522 "IIARRAY2.spad" 852337 852375 852556 852583) (-521 "IFF.spad" 851747 851763 852018 852111) (-520 "IFAST.spad" 851361 851369 851737 851742) (-519 "IFARRAY.spad" 848854 848869 850544 850571) (-518 "IFAMON.spad" 848716 848733 848810 848815) (-517 "IEVALAB.spad" 848121 848133 848706 848711) (-516 "IEVALAB.spad" 847524 847538 848111 848116) (-515 "IDPO.spad" 847322 847334 847514 847519) (-514 "IDPOAMS.spad" 847078 847090 847312 847317) (-513 "IDPOAM.spad" 846798 846810 847068 847073) (-512 "IDPC.spad" 845736 845748 846788 846793) (-511 "IDPAM.spad" 845481 845493 845726 845731) (-510 "IDPAG.spad" 845228 845240 845471 845476) (-509 "IDENT.spad" 844878 844886 845218 845223) (-508 "IDECOMP.spad" 842117 842135 844868 844873) (-507 "IDEAL.spad" 837066 837105 842052 842057) (-506 "ICDEN.spad" 836255 836271 837056 837061) (-505 "ICARD.spad" 835446 835454 836245 836250) (-504 "IBPTOOLS.spad" 834053 834070 835436 835441) (-503 "IBITS.spad" 833256 833269 833689 833716) (-502 "IBATOOL.spad" 830233 830252 833246 833251) (-501 "IBACHIN.spad" 828740 828755 830223 830228) (-500 "IARRAY2.spad" 827728 827754 828347 828374) (-499 "IARRAY1.spad" 826773 826788 826911 826938) (-498 "IAN.spad" 824996 825004 826589 826682) (-497 "IALGFACT.spad" 824599 824632 824986 824991) (-496 "HYPCAT.spad" 824023 824031 824589 824594) (-495 "HYPCAT.spad" 823445 823455 824013 824018) (-494 "HOSTNAME.spad" 823253 823261 823435 823440) (-493 "HOMOTOP.spad" 822996 823006 823243 823248) (-492 "HOAGG.spad" 820278 820288 822986 822991) (-491 "HOAGG.spad" 817335 817347 820045 820050) (-490 "HEXADEC.spad" 815437 815445 815802 815895) (-489 "HEUGCD.spad" 814472 814483 815427 815432) (-488 "HELLFDIV.spad" 814062 814086 814462 814467) (-487 "HEAP.spad" 813454 813464 813669 813696) (-486 "HEADAST.spad" 812991 812999 813444 813449) (-485 "HDP.spad" 802834 802850 803211 803342) (-484 "HDMP.spad" 800048 800063 800664 800791) (-483 "HB.spad" 798299 798307 800038 800043) (-482 "HASHTBL.spad" 796769 796800 796980 797007) (-481 "HASAST.spad" 796485 796493 796759 796764) (-480 "HACKPI.spad" 795976 795984 796387 796480) (-479 "GTSET.spad" 794915 794931 795622 795649) (-478 "GSTBL.spad" 793434 793469 793608 793623) (-477 "GSERIES.spad" 790605 790632 791566 791715) (-476 "GROUP.spad" 789878 789886 790585 790600) (-475 "GROUP.spad" 789159 789169 789868 789873) (-474 "GROEBSOL.spad" 787653 787674 789149 789154) (-473 "GRMOD.spad" 786224 786236 787643 787648) (-472 "GRMOD.spad" 784793 784807 786214 786219) (-471 "GRIMAGE.spad" 777682 777690 784783 784788) (-470 "GRDEF.spad" 776061 776069 777672 777677) (-469 "GRAY.spad" 774524 774532 776051 776056) (-468 "GRALG.spad" 773601 773613 774514 774519) (-467 "GRALG.spad" 772676 772690 773591 773596) (-466 "GPOLSET.spad" 772130 772153 772358 772385) (-465 "GOSPER.spad" 771399 771417 772120 772125) (-464 "GMODPOL.spad" 770547 770574 771367 771394) (-463 "GHENSEL.spad" 769630 769644 770537 770542) (-462 "GENUPS.spad" 765923 765936 769620 769625) (-461 "GENUFACT.spad" 765500 765510 765913 765918) (-460 "GENPGCD.spad" 765086 765103 765490 765495) (-459 "GENMFACT.spad" 764538 764557 765076 765081) (-458 "GENEEZ.spad" 762489 762502 764528 764533) (-457 "GDMP.spad" 759545 759562 760319 760446) (-456 "GCNAALG.spad" 753468 753495 759339 759406) (-455 "GCDDOM.spad" 752644 752652 753394 753463) (-454 "GCDDOM.spad" 751882 751892 752634 752639) (-453 "GB.spad" 749408 749446 751838 751843) (-452 "GBINTERN.spad" 745428 745466 749398 749403) (-451 "GBF.spad" 741195 741233 745418 745423) (-450 "GBEUCLID.spad" 739077 739115 741185 741190) (-449 "GAUSSFAC.spad" 738390 738398 739067 739072) (-448 "GALUTIL.spad" 736716 736726 738346 738351) (-447 "GALPOLYU.spad" 735170 735183 736706 736711) (-446 "GALFACTU.spad" 733343 733362 735160 735165) (-445 "GALFACT.spad" 723532 723543 733333 733338) (-444 "FVFUN.spad" 720555 720563 723522 723527) (-443 "FVC.spad" 719607 719615 720545 720550) (-442 "FUNDESC.spad" 719285 719293 719597 719602) (-441 "FUNCTION.spad" 719134 719146 719275 719280) (-440 "FT.spad" 717431 717439 719124 719129) (-439 "FTEM.spad" 716596 716604 717421 717426) (-438 "FSUPFACT.spad" 715496 715515 716532 716537) (-437 "FST.spad" 713582 713590 715486 715491) (-436 "FSRED.spad" 713062 713078 713572 713577) (-435 "FSPRMELT.spad" 711944 711960 713019 713024) (-434 "FSPECF.spad" 710035 710051 711934 711939) (-433 "FS.spad" 704303 704313 709810 710030) (-432 "FS.spad" 698349 698361 703858 703863) (-431 "FSINT.spad" 698009 698025 698339 698344) (-430 "FSERIES.spad" 697200 697212 697829 697928) (-429 "FSCINT.spad" 696517 696533 697190 697195) (-428 "FSAGG.spad" 695634 695644 696473 696512) (-427 "FSAGG.spad" 694713 694725 695554 695559) (-426 "FSAGG2.spad" 693456 693472 694703 694708) (-425 "FS2UPS.spad" 687947 687981 693446 693451) (-424 "FS2.spad" 687594 687610 687937 687942) (-423 "FS2EXPXP.spad" 686719 686742 687584 687589) (-422 "FRUTIL.spad" 685673 685683 686709 686714) (-421 "FR.spad" 679389 679399 684697 684766) (-420 "FRNAALG.spad" 674508 674518 679331 679384) (-419 "FRNAALG.spad" 669639 669651 674464 674469) (-418 "FRNAAF2.spad" 669095 669113 669629 669634) (-417 "FRMOD.spad" 668505 668535 669026 669031) (-416 "FRIDEAL.spad" 667730 667751 668485 668500) (-415 "FRIDEAL2.spad" 667334 667366 667720 667725) (-414 "FRETRCT.spad" 666845 666855 667324 667329) (-413 "FRETRCT.spad" 666222 666234 666703 666708) (-412 "FRAMALG.spad" 664570 664583 666178 666217) (-411 "FRAMALG.spad" 662950 662965 664560 664565) (-410 "FRAC.spad" 660049 660059 660452 660625) (-409 "FRAC2.spad" 659654 659666 660039 660044) (-408 "FR2.spad" 658990 659002 659644 659649) (-407 "FPS.spad" 655805 655813 658880 658985) (-406 "FPS.spad" 652648 652658 655725 655730) (-405 "FPC.spad" 651694 651702 652550 652643) (-404 "FPC.spad" 650826 650836 651684 651689) (-403 "FPATMAB.spad" 650588 650598 650816 650821) (-402 "FPARFRAC.spad" 649075 649092 650578 650583) (-401 "FORTRAN.spad" 647581 647624 649065 649070) (-400 "FORT.spad" 646530 646538 647571 647576) (-399 "FORTFN.spad" 643700 643708 646520 646525) (-398 "FORTCAT.spad" 643384 643392 643690 643695) (-397 "FORMULA.spad" 640858 640866 643374 643379) (-396 "FORMULA1.spad" 640337 640347 640848 640853) (-395 "FORDER.spad" 640028 640052 640327 640332) (-394 "FOP.spad" 639229 639237 640018 640023) (-393 "FNLA.spad" 638653 638675 639197 639224) (-392 "FNCAT.spad" 637248 637256 638643 638648) (-391 "FNAME.spad" 637140 637148 637238 637243) (-390 "FMTC.spad" 636938 636946 637066 637135) (-389 "FMONOID.spad" 636603 636613 636894 636899) (-388 "FMONCAT.spad" 633756 633766 636593 636598) (-387 "FM.spad" 633451 633463 633690 633717) (-386 "FMFUN.spad" 630481 630489 633441 633446) (-385 "FMC.spad" 629533 629541 630471 630476) (-384 "FMCAT.spad" 627201 627219 629501 629528) (-383 "FM1.spad" 626558 626570 627135 627162) (-382 "FLOATRP.spad" 624293 624307 626548 626553) (-381 "FLOAT.spad" 617607 617615 624159 624288) (-380 "FLOATCP.spad" 615038 615052 617597 617602) (-379 "FLINEXP.spad" 614750 614760 615018 615033) (-378 "FLINEXP.spad" 614416 614428 614686 614691) (-377 "FLASORT.spad" 613742 613754 614406 614411) (-376 "FLALG.spad" 611388 611407 613668 613737) (-375 "FLAGG.spad" 608430 608440 611368 611383) (-374 "FLAGG.spad" 605373 605385 608313 608318) (-373 "FLAGG2.spad" 604098 604114 605363 605368) (-372 "FINRALG.spad" 602159 602172 604054 604093) (-371 "FINRALG.spad" 600146 600161 602043 602048) (-370 "FINITE.spad" 599298 599306 600136 600141) (-369 "FINAALG.spad" 588419 588429 599240 599293) (-368 "FINAALG.spad" 577552 577564 588375 588380) (-367 "FILE.spad" 577135 577145 577542 577547) (-366 "FILECAT.spad" 575661 575678 577125 577130) (-365 "FIELD.spad" 575067 575075 575563 575656) (-364 "FIELD.spad" 574559 574569 575057 575062) (-363 "FGROUP.spad" 573206 573216 574539 574554) (-362 "FGLMICPK.spad" 571993 572008 573196 573201) (-361 "FFX.spad" 571368 571383 571709 571802) (-360 "FFSLPE.spad" 570871 570892 571358 571363) (-359 "FFPOLY.spad" 562133 562144 570861 570866) (-358 "FFPOLY2.spad" 561193 561210 562123 562128) (-357 "FFP.spad" 560590 560610 560909 561002) (-356 "FF.spad" 560038 560054 560271 560364) (-355 "FFNBX.spad" 558550 558570 559754 559847) (-354 "FFNBP.spad" 557063 557080 558266 558359) (-353 "FFNB.spad" 555528 555549 556744 556837) (-352 "FFINTBAS.spad" 553042 553061 555518 555523) (-351 "FFIELDC.spad" 550619 550627 552944 553037) (-350 "FFIELDC.spad" 548282 548292 550609 550614) (-349 "FFHOM.spad" 547030 547047 548272 548277) (-348 "FFF.spad" 544465 544476 547020 547025) (-347 "FFCGX.spad" 543312 543332 544181 544274) (-346 "FFCGP.spad" 542201 542221 543028 543121) (-345 "FFCG.spad" 540993 541014 541882 541975) (-344 "FFCAT.spad" 534166 534188 540832 540988) (-343 "FFCAT.spad" 527418 527442 534086 534091) (-342 "FFCAT2.spad" 527165 527205 527408 527413) (-341 "FEXPR.spad" 518882 518928 526921 526960) (-340 "FEVALAB.spad" 518590 518600 518872 518877) (-339 "FEVALAB.spad" 518083 518095 518367 518372) (-338 "FDIV.spad" 517525 517549 518073 518078) (-337 "FDIVCAT.spad" 515589 515613 517515 517520) (-336 "FDIVCAT.spad" 513651 513677 515579 515584) (-335 "FDIV2.spad" 513307 513347 513641 513646) (-334 "FCTRDATA.spad" 512315 512323 513297 513302) (-333 "FCPAK1.spad" 510882 510890 512305 512310) (-332 "FCOMP.spad" 510261 510271 510872 510877) (-331 "FC.spad" 500268 500276 510251 510256) (-330 "FAXF.spad" 493239 493253 500170 500263) (-329 "FAXF.spad" 486262 486278 493195 493200) (-328 "FARRAY.spad" 484412 484422 485445 485472) (-327 "FAMR.spad" 482548 482560 484310 484407) (-326 "FAMR.spad" 480668 480682 482432 482437) (-325 "FAMONOID.spad" 480336 480346 480622 480627) (-324 "FAMONC.spad" 478632 478644 480326 480331) (-323 "FAGROUP.spad" 478256 478266 478528 478555) (-322 "FACUTIL.spad" 476460 476477 478246 478251) (-321 "FACTFUNC.spad" 475654 475664 476450 476455) (-320 "EXPUPXS.spad" 472487 472510 473786 473935) (-319 "EXPRTUBE.spad" 469775 469783 472477 472482) (-318 "EXPRODE.spad" 466935 466951 469765 469770) (-317 "EXPR.spad" 462210 462220 462924 463331) (-316 "EXPR2UPS.spad" 458332 458345 462200 462205) (-315 "EXPR2.spad" 458037 458049 458322 458327) (-314 "EXPEXPAN.spad" 454977 455002 455609 455702) (-313 "EXIT.spad" 454648 454656 454967 454972) (-312 "EXITAST.spad" 454384 454392 454638 454643) (-311 "EVALCYC.spad" 453844 453858 454374 454379) (-310 "EVALAB.spad" 453416 453426 453834 453839) (-309 "EVALAB.spad" 452986 452998 453406 453411) (-308 "EUCDOM.spad" 450560 450568 452912 452981) (-307 "EUCDOM.spad" 448196 448206 450550 450555) (-306 "ESTOOLS.spad" 440042 440050 448186 448191) (-305 "ESTOOLS2.spad" 439645 439659 440032 440037) (-304 "ESTOOLS1.spad" 439330 439341 439635 439640) (-303 "ES.spad" 432145 432153 439320 439325) (-302 "ES.spad" 424866 424876 432043 432048) (-301 "ESCONT.spad" 421659 421667 424856 424861) (-300 "ESCONT1.spad" 421408 421420 421649 421654) (-299 "ES2.spad" 420913 420929 421398 421403) (-298 "ES1.spad" 420483 420499 420903 420908) (-297 "ERROR.spad" 417810 417818 420473 420478) (-296 "EQTBL.spad" 416282 416304 416491 416518) (-295 "EQ.spad" 411087 411097 413874 413986) (-294 "EQ2.spad" 410805 410817 411077 411082) (-293 "EP.spad" 407131 407141 410795 410800) (-292 "ENV.spad" 405793 405801 407121 407126) (-291 "ENTIRER.spad" 405461 405469 405737 405788) (-290 "EMR.spad" 404668 404709 405387 405456) (-289 "ELTAGG.spad" 402922 402941 404658 404663) (-288 "ELTAGG.spad" 401140 401161 402878 402883) (-287 "ELTAB.spad" 400589 400607 401130 401135) (-286 "ELFUTS.spad" 399976 399995 400579 400584) (-285 "ELEMFUN.spad" 399665 399673 399966 399971) (-284 "ELEMFUN.spad" 399352 399362 399655 399660) (-283 "ELAGG.spad" 397323 397333 399332 399347) (-282 "ELAGG.spad" 395231 395243 397242 397247) (-281 "ELABEXPR.spad" 394163 394171 395221 395226) (-280 "EFUPXS.spad" 390939 390969 394119 394124) (-279 "EFULS.spad" 387775 387798 390895 390900) (-278 "EFSTRUC.spad" 385790 385806 387765 387770) (-277 "EF.spad" 380566 380582 385780 385785) (-276 "EAB.spad" 378842 378850 380556 380561) (-275 "E04UCFA.spad" 378378 378386 378832 378837) (-274 "E04NAFA.spad" 377955 377963 378368 378373) (-273 "E04MBFA.spad" 377535 377543 377945 377950) (-272 "E04JAFA.spad" 377071 377079 377525 377530) (-271 "E04GCFA.spad" 376607 376615 377061 377066) (-270 "E04FDFA.spad" 376143 376151 376597 376602) (-269 "E04DGFA.spad" 375679 375687 376133 376138) (-268 "E04AGNT.spad" 371529 371537 375669 375674) (-267 "DVARCAT.spad" 368218 368228 371519 371524) (-266 "DVARCAT.spad" 364905 364917 368208 368213) (-265 "DSMP.spad" 362372 362386 362677 362804) (-264 "DROPT.spad" 356331 356339 362362 362367) (-263 "DROPT1.spad" 355996 356006 356321 356326) (-262 "DROPT0.spad" 350853 350861 355986 355991) (-261 "DRAWPT.spad" 349026 349034 350843 350848) (-260 "DRAW.spad" 341902 341915 349016 349021) (-259 "DRAWHACK.spad" 341210 341220 341892 341897) (-258 "DRAWCX.spad" 338680 338688 341200 341205) (-257 "DRAWCURV.spad" 338227 338242 338670 338675) (-256 "DRAWCFUN.spad" 327759 327767 338217 338222) (-255 "DQAGG.spad" 325937 325947 327727 327754) (-254 "DPOLCAT.spad" 321286 321302 325805 325932) (-253 "DPOLCAT.spad" 316721 316739 321242 321247) (-252 "DPMO.spad" 308947 308963 309085 309386) (-251 "DPMM.spad" 301186 301204 301311 301612) (-250 "DOMTMPLT.spad" 300846 300854 301176 301181) (-249 "DOMCTOR.spad" 300601 300609 300836 300841) (-248 "DOMAIN.spad" 299688 299696 300591 300596) (-247 "DMP.spad" 296948 296963 297518 297645) (-246 "DLP.spad" 296300 296310 296938 296943) (-245 "DLIST.spad" 294879 294889 295483 295510) (-244 "DLAGG.spad" 293296 293306 294869 294874) (-243 "DIVRING.spad" 292838 292846 293240 293291) (-242 "DIVRING.spad" 292424 292434 292828 292833) (-241 "DISPLAY.spad" 290614 290622 292414 292419) (-240 "DIRPROD.spad" 280194 280210 280834 280965) (-239 "DIRPROD2.spad" 279012 279030 280184 280189) (-238 "DIRPCAT.spad" 277956 277972 278876 279007) (-237 "DIRPCAT.spad" 276629 276647 277551 277556) (-236 "DIOSP.spad" 275454 275462 276619 276624) (-235 "DIOPS.spad" 274450 274460 275434 275449) (-234 "DIOPS.spad" 273420 273432 274406 274411) (-233 "DIFRING.spad" 272716 272724 273400 273415) (-232 "DIFRING.spad" 272020 272030 272706 272711) (-231 "DIFEXT.spad" 271191 271201 272000 272015) (-230 "DIFEXT.spad" 270279 270291 271090 271095) (-229 "DIAGG.spad" 269909 269919 270259 270274) (-228 "DIAGG.spad" 269547 269559 269899 269904) (-227 "DHMATRIX.spad" 267859 267869 269004 269031) (-226 "DFSFUN.spad" 261499 261507 267849 267854) (-225 "DFLOAT.spad" 258230 258238 261389 261494) (-224 "DFINTTLS.spad" 256461 256477 258220 258225) (-223 "DERHAM.spad" 254375 254407 256441 256456) (-222 "DEQUEUE.spad" 253699 253709 253982 254009) (-221 "DEGRED.spad" 253316 253330 253689 253694) (-220 "DEFINTRF.spad" 250853 250863 253306 253311) (-219 "DEFINTEF.spad" 249363 249379 250843 250848) (-218 "DEFAST.spad" 248731 248739 249353 249358) (-217 "DECIMAL.spad" 246837 246845 247198 247291) (-216 "DDFACT.spad" 244650 244667 246827 246832) (-215 "DBLRESP.spad" 244250 244274 244640 244645) (-214 "DBASE.spad" 242914 242924 244240 244245) (-213 "DATAARY.spad" 242376 242389 242904 242909) (-212 "D03FAFA.spad" 242204 242212 242366 242371) (-211 "D03EEFA.spad" 242024 242032 242194 242199) (-210 "D03AGNT.spad" 241110 241118 242014 242019) (-209 "D02EJFA.spad" 240572 240580 241100 241105) (-208 "D02CJFA.spad" 240050 240058 240562 240567) (-207 "D02BHFA.spad" 239540 239548 240040 240045) (-206 "D02BBFA.spad" 239030 239038 239530 239535) (-205 "D02AGNT.spad" 233844 233852 239020 239025) (-204 "D01WGTS.spad" 232163 232171 233834 233839) (-203 "D01TRNS.spad" 232140 232148 232153 232158) (-202 "D01GBFA.spad" 231662 231670 232130 232135) (-201 "D01FCFA.spad" 231184 231192 231652 231657) (-200 "D01ASFA.spad" 230652 230660 231174 231179) (-199 "D01AQFA.spad" 230098 230106 230642 230647) (-198 "D01APFA.spad" 229522 229530 230088 230093) (-197 "D01ANFA.spad" 229016 229024 229512 229517) (-196 "D01AMFA.spad" 228526 228534 229006 229011) (-195 "D01ALFA.spad" 228066 228074 228516 228521) (-194 "D01AKFA.spad" 227592 227600 228056 228061) (-193 "D01AJFA.spad" 227115 227123 227582 227587) (-192 "D01AGNT.spad" 223182 223190 227105 227110) (-191 "CYCLOTOM.spad" 222688 222696 223172 223177) (-190 "CYCLES.spad" 219544 219552 222678 222683) (-189 "CVMP.spad" 218961 218971 219534 219539) (-188 "CTRIGMNP.spad" 217461 217477 218951 218956) (-187 "CTOR.spad" 217152 217160 217451 217456) (-186 "CTORKIND.spad" 216755 216763 217142 217147) (-185 "CTORCAT.spad" 216004 216012 216745 216750) (-184 "CTORCAT.spad" 215251 215261 215994 215999) (-183 "CTORCALL.spad" 214840 214850 215241 215246) (-182 "CSTTOOLS.spad" 214085 214098 214830 214835) (-181 "CRFP.spad" 207809 207822 214075 214080) (-180 "CRCEAST.spad" 207529 207537 207799 207804) (-179 "CRAPACK.spad" 206580 206590 207519 207524) (-178 "CPMATCH.spad" 206084 206099 206505 206510) (-177 "CPIMA.spad" 205789 205808 206074 206079) (-176 "COORDSYS.spad" 200798 200808 205779 205784) (-175 "CONTOUR.spad" 200209 200217 200788 200793) (-174 "CONTFRAC.spad" 195959 195969 200111 200204) (-173 "CONDUIT.spad" 195717 195725 195949 195954) (-172 "COMRING.spad" 195391 195399 195655 195712) (-171 "COMPPROP.spad" 194909 194917 195381 195386) (-170 "COMPLPAT.spad" 194676 194691 194899 194904) (-169 "COMPLEX.spad" 188813 188823 189057 189318) (-168 "COMPLEX2.spad" 188528 188540 188803 188808) (-167 "COMPFACT.spad" 188130 188144 188518 188523) (-166 "COMPCAT.spad" 186202 186212 187864 188125) (-165 "COMPCAT.spad" 184002 184014 185666 185671) (-164 "COMMUPC.spad" 183750 183768 183992 183997) (-163 "COMMONOP.spad" 183283 183291 183740 183745) (-162 "COMM.spad" 183094 183102 183273 183278) (-161 "COMMAAST.spad" 182857 182865 183084 183089) (-160 "COMBOPC.spad" 181772 181780 182847 182852) (-159 "COMBINAT.spad" 180539 180549 181762 181767) (-158 "COMBF.spad" 177921 177937 180529 180534) (-157 "COLOR.spad" 176758 176766 177911 177916) (-156 "COLONAST.spad" 176424 176432 176748 176753) (-155 "CMPLXRT.spad" 176135 176152 176414 176419) (-154 "CLLCTAST.spad" 175797 175805 176125 176130) (-153 "CLIP.spad" 171905 171913 175787 175792) (-152 "CLIF.spad" 170560 170576 171861 171900) (-151 "CLAGG.spad" 167065 167075 170550 170555) (-150 "CLAGG.spad" 163441 163453 166928 166933) (-149 "CINTSLPE.spad" 162772 162785 163431 163436) (-148 "CHVAR.spad" 160910 160932 162762 162767) (-147 "CHARZ.spad" 160825 160833 160890 160905) (-146 "CHARPOL.spad" 160335 160345 160815 160820) (-145 "CHARNZ.spad" 160088 160096 160315 160330) (-144 "CHAR.spad" 157962 157970 160078 160083) (-143 "CFCAT.spad" 157290 157298 157952 157957) (-142 "CDEN.spad" 156486 156500 157280 157285) (-141 "CCLASS.spad" 154635 154643 155897 155936) (-140 "CATEGORY.spad" 153677 153685 154625 154630) (-139 "CATCTOR.spad" 153568 153576 153667 153672) (-138 "CATAST.spad" 153186 153194 153558 153563) (-137 "CASEAST.spad" 152900 152908 153176 153181) (-136 "CARTEN.spad" 148187 148211 152890 152895) (-135 "CARTEN2.spad" 147577 147604 148177 148182) (-134 "CARD.spad" 144872 144880 147551 147572) (-133 "CAPSLAST.spad" 144646 144654 144862 144867) (-132 "CACHSET.spad" 144270 144278 144636 144641) (-131 "CABMON.spad" 143825 143833 144260 144265) (-130 "BYTEORD.spad" 143500 143508 143815 143820) (-129 "BYTE.spad" 142927 142935 143490 143495) (-128 "BYTEBUF.spad" 140786 140794 142096 142123) (-127 "BTREE.spad" 139859 139869 140393 140420) (-126 "BTOURN.spad" 138864 138874 139466 139493) (-125 "BTCAT.spad" 138256 138266 138832 138859) (-124 "BTCAT.spad" 137668 137680 138246 138251) (-123 "BTAGG.spad" 136796 136804 137636 137663) (-122 "BTAGG.spad" 135944 135954 136786 136791) (-121 "BSTREE.spad" 134685 134695 135551 135578) (-120 "BRILL.spad" 132882 132893 134675 134680) (-119 "BRAGG.spad" 131822 131832 132872 132877) (-118 "BRAGG.spad" 130726 130738 131778 131783) (-117 "BPADICRT.spad" 128707 128719 128962 129055) (-116 "BPADIC.spad" 128371 128383 128633 128702) (-115 "BOUNDZRO.spad" 128027 128044 128361 128366) (-114 "BOP.spad" 123209 123217 128017 128022) (-113 "BOP1.spad" 120675 120685 123199 123204) (-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 |