diff options
Diffstat (limited to 'src/share/algebra/browse.daase')
| -rw-r--r-- | src/share/algebra/browse.daase | 646 |
1 files changed, 323 insertions, 323 deletions
diff --git a/src/share/algebra/browse.daase b/src/share/algebra/browse.daase index f731e903..59c65b35 100644 --- a/src/share/algebra/browse.daase +++ b/src/share/algebra/browse.daase @@ -1,5 +1,5 @@ -(2294555 . 3514591832) +(2294555 . 3514823548) (-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,16 +56,16 @@ 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 `d'.")) (|base| (((|SpadAst|) $) "\\spad{base(d)} returns the base domain(\\spad{s}) of the add-domain expression."))) NIL NIL -(-32 R -4131) +(-32 R -4164) ((|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 -1070) (QUOTE (-560))))) (-33 S) -((|constructor| (NIL "The notion of aggregate serves to model any data structure aggregate,{} designating any collection of objects,{} with heterogenous or homogeneous members,{} with a finite or infinite number of members,{} explicitly or implicitly represented. An aggregate can in principle represent everything from a string of characters to abstract sets such as \"the set of \\spad{x} satisfying relation {\\em r(x)}\" An attribute \\spadatt{finiteAggregate} is used to assert that a domain has a finite number of elements.")) (|#| (((|NonNegativeInteger|) $) "\\spad{\\# u} returns the number of items in \\spad{u}.")) (|sample| (($) "\\spad{sample yields} a value of type \\%")) (|size?| (((|Boolean|) $ (|NonNegativeInteger|)) "\\spad{size?(u,n)} tests if \\spad{u} has exactly \\spad{n} elements.")) (|more?| (((|Boolean|) $ (|NonNegativeInteger|)) "\\spad{more?(u,n)} tests if \\spad{u} has greater than \\spad{n} elements.")) (|less?| (((|Boolean|) $ (|NonNegativeInteger|)) "\\spad{less?(u,n)} tests if \\spad{u} has less than \\spad{n} elements.")) (|empty?| (((|Boolean|) $) "\\spad{empty?(u)} tests if \\spad{u} has 0 elements.")) (|empty| (($) "\\spad{empty()}\\$\\spad{D} creates an aggregate of type \\spad{D} with 0 elements. Note: The {\\em \\$D} can be dropped if understood by context,{} \\spadignore{e.g.} \\axiom{u: \\spad{D} := empty()}.")) (|copy| (($ $) "\\spad{copy(u)} returns a top-level (non-recursive) copy of \\spad{u}. Note: for collections,{} \\axiom{copy(\\spad{u}) == [\\spad{x} for \\spad{x} in \\spad{u}]}.")) (|eq?| (((|Boolean|) $ $) "\\spad{eq?(u,v)} tests if \\spad{u} and \\spad{v} are same objects."))) +((|constructor| (NIL "The notion of aggregate serves to model any data structure aggregate,{} designating any collection of objects,{} with heterogenous or homogeneous members,{} with a finite or infinite number of members,{} explicitly or implicitly represented. An aggregate can in principle represent everything from a string of characters to abstract sets such as \"the set of \\spad{x} satisfying relation {\\em r(x)}\" An attribute \\spadatt{finiteAggregate} is used to assert that a domain has a finite number of elements.")) (|#| (((|NonNegativeInteger|) $) "\\spad{\\# u} returns the number of items in \\spad{u}.")) (|sample| (($) "\\spad{sample yields} a value of type \\%")) (|empty?| (((|Boolean|) $) "\\spad{empty?(u)} tests if \\spad{u} has 0 elements.")) (|empty| (($) "\\spad{empty()}\\$\\spad{D} creates an aggregate of type \\spad{D} with 0 elements. Note: The {\\em \\$D} can be dropped if understood by context,{} \\spadignore{e.g.} \\axiom{u: \\spad{D} := empty()}.")) (|copy| (($ $) "\\spad{copy(u)} returns a top-level (non-recursive) copy of \\spad{u}. Note: for collections,{} \\axiom{copy(\\spad{u}) == [\\spad{x} for \\spad{x} in \\spad{u}]}.")) (|eq?| (((|Boolean|) $ $) "\\spad{eq?(u,v)} tests if \\spad{u} and \\spad{v} are same objects."))) NIL ((|HasAttribute| |#1| (QUOTE -4510))) (-34) -((|constructor| (NIL "The notion of aggregate serves to model any data structure aggregate,{} designating any collection of objects,{} with heterogenous or homogeneous members,{} with a finite or infinite number of members,{} explicitly or implicitly represented. An aggregate can in principle represent everything from a string of characters to abstract sets such as \"the set of \\spad{x} satisfying relation {\\em r(x)}\" An attribute \\spadatt{finiteAggregate} is used to assert that a domain has a finite number of elements.")) (|#| (((|NonNegativeInteger|) $) "\\spad{\\# u} returns the number of items in \\spad{u}.")) (|sample| (($) "\\spad{sample yields} a value of type \\%")) (|size?| (((|Boolean|) $ (|NonNegativeInteger|)) "\\spad{size?(u,n)} tests if \\spad{u} has exactly \\spad{n} elements.")) (|more?| (((|Boolean|) $ (|NonNegativeInteger|)) "\\spad{more?(u,n)} tests if \\spad{u} has greater than \\spad{n} elements.")) (|less?| (((|Boolean|) $ (|NonNegativeInteger|)) "\\spad{less?(u,n)} tests if \\spad{u} has less than \\spad{n} elements.")) (|empty?| (((|Boolean|) $) "\\spad{empty?(u)} tests if \\spad{u} has 0 elements.")) (|empty| (($) "\\spad{empty()}\\$\\spad{D} creates an aggregate of type \\spad{D} with 0 elements. Note: The {\\em \\$D} can be dropped if understood by context,{} \\spadignore{e.g.} \\axiom{u: \\spad{D} := empty()}.")) (|copy| (($ $) "\\spad{copy(u)} returns a top-level (non-recursive) copy of \\spad{u}. Note: for collections,{} \\axiom{copy(\\spad{u}) == [\\spad{x} for \\spad{x} in \\spad{u}]}.")) (|eq?| (((|Boolean|) $ $) "\\spad{eq?(u,v)} tests if \\spad{u} and \\spad{v} are same objects."))) +((|constructor| (NIL "The notion of aggregate serves to model any data structure aggregate,{} designating any collection of objects,{} with heterogenous or homogeneous members,{} with a finite or infinite number of members,{} explicitly or implicitly represented. An aggregate can in principle represent everything from a string of characters to abstract sets such as \"the set of \\spad{x} satisfying relation {\\em r(x)}\" An attribute \\spadatt{finiteAggregate} is used to assert that a domain has a finite number of elements.")) (|#| (((|NonNegativeInteger|) $) "\\spad{\\# u} returns the number of items in \\spad{u}.")) (|sample| (($) "\\spad{sample yields} a value of type \\%")) (|empty?| (((|Boolean|) $) "\\spad{empty?(u)} tests if \\spad{u} has 0 elements.")) (|empty| (($) "\\spad{empty()}\\$\\spad{D} creates an aggregate of type \\spad{D} with 0 elements. Note: The {\\em \\$D} can be dropped if understood by context,{} \\spadignore{e.g.} \\axiom{u: \\spad{D} := empty()}.")) (|copy| (($ $) "\\spad{copy(u)} returns a top-level (non-recursive) copy of \\spad{u}. Note: for collections,{} \\axiom{copy(\\spad{u}) == [\\spad{x} for \\spad{x} in \\spad{u}]}.")) (|eq?| (((|Boolean|) $ $) "\\spad{eq?(u,v)} tests if \\spad{u} and \\spad{v} are same objects."))) NIL NIL (-35) @@ -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 \\spad{a1},{}...,{}an."))) NIL NIL -(-40 -4131 UP UPUP -3851) +(-40 -4164 UP UPUP -3871) ((|constructor| (NIL "Function field defined by \\spad{f}(\\spad{x},{} \\spad{y}) = 0.")) (|knownInfBasis| (((|Void|) (|NonNegativeInteger|)) "\\spad{knownInfBasis(n)} \\undocumented{}"))) ((-4503 |has| (-421 |#2|) (-376)) (-4508 |has| (-421 |#2|) (-376)) (-4502 |has| (-421 |#2|) (-376)) ((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) -((|HasCategory| (-421 |#2|) (QUOTE (-147))) (|HasCategory| (-421 |#2|) (QUOTE (-149))) (|HasCategory| (-421 |#2|) (QUOTE (-363))) (-4133 (|HasCategory| (-421 |#2|) (QUOTE (-376))) (|HasCategory| (-421 |#2|) (QUOTE (-363)))) (|HasCategory| (-421 |#2|) (QUOTE (-376))) (|HasCategory| (-421 |#2|) (QUOTE (-381))) (-4133 (-12 (|HasCategory| (-421 |#2|) (QUOTE (-240))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (|HasCategory| (-421 |#2|) (QUOTE (-363)))) (-4133 (-12 (|HasCategory| (-421 |#2|) (QUOTE (-240))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (-12 (|HasCategory| (-421 |#2|) (QUOTE (-239))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (|HasCategory| (-421 |#2|) (QUOTE (-363)))) (-4133 (-12 (|HasCategory| (-421 |#2|) (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (-12 (|HasCategory| (-421 |#2|) (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| (-421 |#2|) (QUOTE (-363))))) (-4133 (-12 (|HasCategory| (-421 |#2|) (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (-12 (|HasCategory| (-421 |#2|) (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| (-421 |#2|) (QUOTE (-376))))) (|HasCategory| (-421 |#2|) (|%list| (QUOTE -660) (QUOTE (-560)))) (-4133 (|HasCategory| (-421 |#2|) (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (|HasCategory| (-421 |#2|) (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| (-421 |#2|) (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-381))) (-12 (|HasCategory| (-421 |#2|) (QUOTE (-239))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (-12 (|HasCategory| (-421 |#2|) (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (-12 (|HasCategory| (-421 |#2|) (QUOTE (-240))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (-12 (|HasCategory| (-421 |#2|) (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| (-421 |#2|) (QUOTE (-376))))) -(-41 R -4131) +((|HasCategory| (-421 |#2|) (QUOTE (-147))) (|HasCategory| (-421 |#2|) (QUOTE (-149))) (|HasCategory| (-421 |#2|) (QUOTE (-363))) (-4144 (|HasCategory| (-421 |#2|) (QUOTE (-376))) (|HasCategory| (-421 |#2|) (QUOTE (-363)))) (|HasCategory| (-421 |#2|) (QUOTE (-376))) (|HasCategory| (-421 |#2|) (QUOTE (-381))) (-4144 (-12 (|HasCategory| (-421 |#2|) (QUOTE (-240))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (|HasCategory| (-421 |#2|) (QUOTE (-363)))) (-4144 (-12 (|HasCategory| (-421 |#2|) (QUOTE (-240))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (-12 (|HasCategory| (-421 |#2|) (QUOTE (-239))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (|HasCategory| (-421 |#2|) (QUOTE (-363)))) (-4144 (-12 (|HasCategory| (-421 |#2|) (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (-12 (|HasCategory| (-421 |#2|) (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| (-421 |#2|) (QUOTE (-363))))) (-4144 (-12 (|HasCategory| (-421 |#2|) (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (-12 (|HasCategory| (-421 |#2|) (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| (-421 |#2|) (QUOTE (-376))))) (|HasCategory| (-421 |#2|) (|%list| (QUOTE -660) (QUOTE (-560)))) (-4144 (|HasCategory| (-421 |#2|) (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (|HasCategory| (-421 |#2|) (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| (-421 |#2|) (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-381))) (-12 (|HasCategory| (-421 |#2|) (QUOTE (-239))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (-12 (|HasCategory| (-421 |#2|) (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (-12 (|HasCategory| (-421 |#2|) (QUOTE (-240))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (-12 (|HasCategory| (-421 |#2|) (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| (-421 |#2|) (QUOTE (-376))))) +(-41 R -4164) ((|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}'s which are algebraic from the denominators in \\spad{f}.") ((|#2| |#2| (|List| |#2|)) "\\spad{ratDenom(f, [a1,...,an])} removes the \\spad{ai}'s which are algebraic kernels from the denominators in \\spad{f}.") ((|#2| |#2| |#2|) "\\spad{ratDenom(f, a)} removes \\spad{a} from the denominators in \\spad{f} if \\spad{a} is an algebraic kernel.") ((|#2| |#2|) "\\spad{ratDenom(f)} rationalizes the denominators appearing in \\spad{f} by moving all the algebraic quantities into the numerators.")) (|rootSplit| ((|#2| |#2|) "\\spad{rootSplit(f)} transforms every radical of the form \\spad{(a/b)**(1/n)} appearing in \\spad{f} into \\spad{a**(1/n) / b**(1/n)}. This transformation is not in general valid for all complex numbers \\spad{a} and \\spad{b}.")) (|coerce| (($ (|SparseMultivariatePolynomial| |#1| (|Kernel| $))) "\\spad{coerce(x)} \\undocumented")) (|denom| (((|SparseMultivariatePolynomial| |#1| (|Kernel| $)) $) "\\spad{denom(x)} \\undocumented")) (|numer| (((|SparseMultivariatePolynomial| |#1| (|Kernel| $)) $) "\\spad{numer(x)} \\undocumented"))) NIL ((-12 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| |#2| (|%list| (QUOTE -435) (|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."))) ((-4510 . T) (-4511 . T)) -((-4133 (-12 (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-872))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -1580) (|devaluate| |#1|)) (|%list| (QUOTE |:|) (QUOTE -3432) (|devaluate| |#2|)))))) (-12 (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-1133))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -1580) (|devaluate| |#1|)) (|%list| (QUOTE |:|) (QUOTE -3432) (|devaluate| |#2|))))))) (-4133 (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-872))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-1133))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (|%list| (QUOTE -633) (QUOTE (-549)))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-4133 (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-872))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-1133))) (|HasCategory| |#2| (QUOTE (-1133)))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-872))) (-4133 (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-872))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-1133))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-1133)))) (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| (-560) (QUOTE (-872))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-1133))) (-4133 (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-1133))) (|HasCategory| |#2| (QUOTE (-1133)))) (-4133 (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888))))) (-4133 (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-102)))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-102))) (-12 (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-1133))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -1580) (|devaluate| |#1|)) (|%list| (QUOTE |:|) (QUOTE -3432) (|devaluate| |#2|))))))) +((-4144 (-12 (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-872))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -2118) (|devaluate| |#1|)) (|%list| (QUOTE |:|) (QUOTE -3964) (|devaluate| |#2|)))))) (-12 (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-1133))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -2118) (|devaluate| |#1|)) (|%list| (QUOTE |:|) (QUOTE -3964) (|devaluate| |#2|))))))) (-4144 (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-872))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-1133))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (|%list| (QUOTE -633) (QUOTE (-549)))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-4144 (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-872))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-1133))) (|HasCategory| |#2| (QUOTE (-1133)))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-872))) (-4144 (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-872))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-1133))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-1133)))) (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| (-560) (QUOTE (-872))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-1133))) (-4144 (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-1133))) (|HasCategory| |#2| (QUOTE (-1133)))) (-4144 (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888))))) (-4144 (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-102)))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-102))) (-12 (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-1133))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -2118) (|devaluate| |#1|)) (|%list| (QUOTE |:|) (QUOTE -3964) (|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 -4131) +(-54 |Base| R -4164) ((|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},{}...,{}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},{}...,{}rn to \\spad{f} an unlimited number of times,{} \\spadignore{i.e.} until none of \\spad{r1},{}...,{}rn is applicable to the expression."))) NIL NIL @@ -163,7 +163,7 @@ NIL (-58 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}"))) ((-4511 . T) (-4510 . T)) -((-4133 (-12 (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549)))) (-4133 (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133)))) (|HasCategory| |#1| (QUOTE (-872))) (-4133 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133)))) (|HasCategory| (-560) (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) +((-4144 (-12 (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549)))) (-4144 (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133)))) (|HasCategory| |#1| (QUOTE (-872))) (-4144 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133)))) (|HasCategory| (-560) (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-59 A B) ((|constructor| (NIL "\\indented{1}{This package provides tools for operating on one-dimensional arrays} with unary and binary functions involving different underlying types")) (|map| (((|OneDimensionalArray| |#2|) (|Mapping| |#2| |#1|) (|OneDimensionalArray| |#1|)) "\\spad{map(f,a)} applies function \\spad{f} to each member of one-dimensional array \\spad{a} resulting in a new one-dimensional array over a possibly different underlying domain.")) (|reduce| ((|#2| (|Mapping| |#2| |#1| |#2|) (|OneDimensionalArray| |#1|) |#2|) "\\spad{reduce(f,a,r)} applies function \\spad{f} to each successive element of the one-dimensional array \\spad{a} and an accumulant initialized to \\spad{r}. For example,{} \\spad{reduce(_+\\$Integer,[1,2,3],0)} does \\spad{3+(2+(1+0))}. Note: third argument \\spad{r} may be regarded as the identity element for the function \\spad{f}.")) (|scan| (((|OneDimensionalArray| |#2|) (|Mapping| |#2| |#1| |#2|) (|OneDimensionalArray| |#1|) |#2|) "\\spad{scan(f,a,r)} successively applies \\spad{reduce(f,x,r)} to more and more leading sub-arrays \\spad{x} of one-dimensional array \\spad{a}. More precisely,{} if \\spad{a} is \\spad{[a1,a2,...]},{} then \\spad{scan(f,a,r)} returns \\spad{[reduce(f,[a1],r),reduce(f,[a1,a2],r),...]}."))) NIL @@ -171,64 +171,64 @@ NIL (-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's."))) ((-4510 . T) (-4511 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1133))) (-4133 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1133)))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102)))) -(-61 -3665) +((-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1133))) (-4144 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1133)))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102)))) +(-61 -4401) ((|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 -(-62 -3665) +(-62 -4401) ((|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 -(-63 -3665) +(-63 -4401) ((|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 -(-64 -3665) +(-64 -4401) ((|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 -(-65 -3665) +(-65 -4401) ((|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 -3665) +(-66 -4401) ((|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 -3665) +(-67 -4401) ((|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 -3665) +(-68 -4401) ((|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 -3665) +(-69 -4401) ((|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 -3665) +(-70 -4401) ((|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 -3665) +(-71 -4401) ((|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 -3665) +(-72 -4401) ((|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 -3665) +(-73 -4401) ((|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 -3665) +(-74 -4401) ((|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 -(-75 -3665) +(-75 -4401) ((|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 @@ -240,51 +240,51 @@ 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 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 -(-78 -3665) +(-78 -4401) ((|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 -(-79 -3665) +(-79 -4401) ((|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 -3665) +(-80 -4401) ((|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 -3665) +(-81 -4401) ((|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 -3665) +(-82 -4401) ((|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 -(-83 -3665) +(-83 -4401) ((|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 -(-84 -3665) +(-84 -4401) ((|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 -(-85 -3665) +(-85 -4401) ((|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 -(-86 -3665) +(-86 -4401) ((|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 -(-87 -3665) +(-87 -4401) ((|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 -(-88 -3665) +(-88 -4401) ((|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 -(-89 -3665) +(-89 -4401) ((|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}."))) ((-4510 . T) (-4511 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1133))) (-4133 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1133)))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102)))) +((-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1133))) (-4144 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1133)))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102)))) (-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 pl and 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{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 ls.")) (|balancedBinaryTree| (($ (|NonNegativeInteger|) |#1|) "\\spad{balancedBinaryTree(n, s)} creates a balanced binary tree with \\spad{n} nodes each with value \\spad{s}."))) ((-4510 . T) (-4511 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1133))) (-4133 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1133)))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102)))) +((-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1133))) (-4144 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1133)))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102)))) (-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."))) ((-4502 . T) (-4508 . T) (-4503 . T) ((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) -((|HasCategory| (-560) (QUOTE (-940))) (|HasCategory| (-560) (|%list| (QUOTE -1070) (QUOTE (-1209)))) (|HasCategory| (-560) (QUOTE (-147))) (|HasCategory| (-560) (QUOTE (-149))) (|HasCategory| (-560) (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| (-560) (QUOTE (-1052))) (|HasCategory| (-560) (QUOTE (-844))) (|HasCategory| (-560) (QUOTE (-872))) (-4133 (|HasCategory| (-560) (QUOTE (-844))) (|HasCategory| (-560) (QUOTE (-872)))) (|HasCategory| (-560) (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| (-560) (QUOTE (-1184))) (|HasCategory| (-560) (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| (-560) (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| (-560) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| (-560) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| (-560) (QUOTE (-239))) (|HasCategory| (-560) (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| (-560) (QUOTE (-240))) (|HasCategory| (-560) (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| (-560) (|%list| (QUOTE -528) (QUOTE (-1209)) (QUOTE (-560)))) (|HasCategory| (-560) (|%list| (QUOTE -321) (QUOTE (-560)))) (|HasCategory| (-560) (|%list| (QUOTE -298) (QUOTE (-560)) (QUOTE (-560)))) (|HasCategory| (-560) (QUOTE (-319))) (|HasCategory| (-560) (QUOTE (-559))) (|HasCategory| (-560) (|%list| (QUOTE -660) (QUOTE (-560)))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-560) (QUOTE (-940)))) (-4133 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-560) (QUOTE (-940)))) (|HasCategory| (-560) (QUOTE (-147))))) +((|HasCategory| (-560) (QUOTE (-940))) (|HasCategory| (-560) (|%list| (QUOTE -1070) (QUOTE (-1209)))) (|HasCategory| (-560) (QUOTE (-147))) (|HasCategory| (-560) (QUOTE (-149))) (|HasCategory| (-560) (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| (-560) (QUOTE (-1052))) (|HasCategory| (-560) (QUOTE (-844))) (|HasCategory| (-560) (QUOTE (-872))) (-4144 (|HasCategory| (-560) (QUOTE (-844))) (|HasCategory| (-560) (QUOTE (-872)))) (|HasCategory| (-560) (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| (-560) (QUOTE (-1184))) (|HasCategory| (-560) (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| (-560) (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| (-560) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| (-560) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| (-560) (QUOTE (-239))) (|HasCategory| (-560) (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| (-560) (QUOTE (-240))) (|HasCategory| (-560) (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| (-560) (|%list| (QUOTE -528) (QUOTE (-1209)) (QUOTE (-560)))) (|HasCategory| (-560) (|%list| (QUOTE -321) (QUOTE (-560)))) (|HasCategory| (-560) (|%list| (QUOTE -298) (QUOTE (-560)) (QUOTE (-560)))) (|HasCategory| (-560) (QUOTE (-319))) (|HasCategory| (-560) (QUOTE (-559))) (|HasCategory| (-560) (|%list| (QUOTE -660) (QUOTE (-560)))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-560) (QUOTE (-940)))) (-4144 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-560) (QUOTE (-940)))) (|HasCategory| (-560) (QUOTE (-147))))) (-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 `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 @@ -396,7 +396,7 @@ NIL ((|constructor| (NIL "This package exports functions to set some commonly used properties of operators,{} including properties which contain functions.")) (|constantOpIfCan| (((|Union| |#1| "failed") (|BasicOperator|)) "\\spad{constantOpIfCan(op)} returns \\spad{a} if \\spad{op} is the constant nullary operator always returning \\spad{a},{} \"failed\" otherwise.")) (|constantOperator| (((|BasicOperator|) |#1|) "\\spad{constantOperator(a)} returns a nullary operator op such that \\spad{op()} always evaluate to \\spad{a}.")) (|derivative| (((|Union| (|List| (|Mapping| |#1| (|List| |#1|))) "failed") (|BasicOperator|)) "\\spad{derivative(op)} returns the value of the \"\\%diff\" property of \\spad{op} if it has one,{} and \"failed\" otherwise.") (((|BasicOperator|) (|BasicOperator|) (|Mapping| |#1| |#1|)) "\\spad{derivative(op, foo)} attaches foo as the \"\\%diff\" property of \\spad{op}. If \\spad{op} has an \"\\%diff\" property \\spad{f},{} then applying a derivation \\spad{D} to \\spad{op}(a) returns \\spad{f(a) * D(a)}. Argument \\spad{op} must be unary.") (((|BasicOperator|) (|BasicOperator|) (|List| (|Mapping| |#1| (|List| |#1|)))) "\\spad{derivative(op, [foo1,...,foon])} attaches [\\spad{foo1},{}...,{}foon] as the \"\\%diff\" property of \\spad{op}. If \\spad{op} has an \"\\%diff\" property \\spad{[f1,...,fn]} then applying a derivation \\spad{D} to \\spad{op(a1,...,an)} returns \\spad{f1(a1,...,an) * D(a1) + ... + fn(a1,...,an) * D(an)}.")) (|evaluate| (((|Union| (|Mapping| |#1| (|List| |#1|)) "failed") (|BasicOperator|)) "\\spad{evaluate(op)} returns the value of the \"\\%eval\" property of \\spad{op} if it has one,{} and \"failed\" otherwise.") (((|BasicOperator|) (|BasicOperator|) (|Mapping| |#1| |#1|)) "\\spad{evaluate(op, foo)} attaches foo as the \"\\%eval\" property of \\spad{op}. If \\spad{op} has an \"\\%eval\" property \\spad{f},{} then applying \\spad{op} to a returns the result of \\spad{f(a)}. Argument \\spad{op} must be unary.") (((|BasicOperator|) (|BasicOperator|) (|Mapping| |#1| (|List| |#1|))) "\\spad{evaluate(op, foo)} attaches foo as the \"\\%eval\" property of \\spad{op}. If \\spad{op} has an \"\\%eval\" property \\spad{f},{} then applying \\spad{op} to \\spad{(a1,...,an)} returns the result of \\spad{f(a1,...,an)}.") (((|Union| |#1| "failed") (|BasicOperator|) (|List| |#1|)) "\\spad{evaluate(op, [a1,...,an])} checks if \\spad{op} has an \"\\%eval\" property \\spad{f}. If it has,{} then \\spad{f(a1,...,an)} is returned,{} and \"failed\" otherwise."))) NIL NIL -(-117 -4131 UP) +(-117 -4164 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 @@ -407,7 +407,7 @@ NIL (-119 |p|) ((|constructor| (NIL "Stream-based implementation of 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}."))) ((-4502 . T) (-4508 . T) (-4503 . T) ((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) -((|HasCategory| (-118 |#1|) (QUOTE (-940))) (|HasCategory| (-118 |#1|) (|%list| (QUOTE -1070) (QUOTE (-1209)))) (|HasCategory| (-118 |#1|) (QUOTE (-147))) (|HasCategory| (-118 |#1|) (QUOTE (-149))) (|HasCategory| (-118 |#1|) (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| (-118 |#1|) (QUOTE (-1052))) (|HasCategory| (-118 |#1|) (QUOTE (-844))) (|HasCategory| (-118 |#1|) (QUOTE (-872))) (-4133 (|HasCategory| (-118 |#1|) (QUOTE (-844))) (|HasCategory| (-118 |#1|) (QUOTE (-872)))) (|HasCategory| (-118 |#1|) (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| (-118 |#1|) (QUOTE (-1184))) (|HasCategory| (-118 |#1|) (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| (-118 |#1|) (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| (-118 |#1|) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| (-118 |#1|) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| (-118 |#1|) (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| (-118 |#1|) (QUOTE (-239))) (|HasCategory| (-118 |#1|) (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| (-118 |#1|) (QUOTE (-240))) (|HasCategory| (-118 |#1|) (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| (-118 |#1|) (|%list| (QUOTE -528) (QUOTE (-1209)) (|%list| (QUOTE -118) (|devaluate| |#1|)))) (|HasCategory| (-118 |#1|) (|%list| (QUOTE -321) (|%list| (QUOTE -118) (|devaluate| |#1|)))) (|HasCategory| (-118 |#1|) (|%list| (QUOTE -298) (|%list| (QUOTE -118) (|devaluate| |#1|)) (|%list| (QUOTE -118) (|devaluate| |#1|)))) (|HasCategory| (-118 |#1|) (QUOTE (-319))) (|HasCategory| (-118 |#1|) (QUOTE (-559))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-118 |#1|) (QUOTE (-940)))) (-4133 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-118 |#1|) (QUOTE (-940)))) (|HasCategory| (-118 |#1|) (QUOTE (-147))))) +((|HasCategory| (-118 |#1|) (QUOTE (-940))) (|HasCategory| (-118 |#1|) (|%list| (QUOTE -1070) (QUOTE (-1209)))) (|HasCategory| (-118 |#1|) (QUOTE (-147))) (|HasCategory| (-118 |#1|) (QUOTE (-149))) (|HasCategory| (-118 |#1|) (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| (-118 |#1|) (QUOTE (-1052))) (|HasCategory| (-118 |#1|) (QUOTE (-844))) (|HasCategory| (-118 |#1|) (QUOTE (-872))) (-4144 (|HasCategory| (-118 |#1|) (QUOTE (-844))) (|HasCategory| (-118 |#1|) (QUOTE (-872)))) (|HasCategory| (-118 |#1|) (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| (-118 |#1|) (QUOTE (-1184))) (|HasCategory| (-118 |#1|) (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| (-118 |#1|) (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| (-118 |#1|) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| (-118 |#1|) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| (-118 |#1|) (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| (-118 |#1|) (QUOTE (-239))) (|HasCategory| (-118 |#1|) (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| (-118 |#1|) (QUOTE (-240))) (|HasCategory| (-118 |#1|) (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| (-118 |#1|) (|%list| (QUOTE -528) (QUOTE (-1209)) (|%list| (QUOTE -118) (|devaluate| |#1|)))) (|HasCategory| (-118 |#1|) (|%list| (QUOTE -321) (|%list| (QUOTE -118) (|devaluate| |#1|)))) (|HasCategory| (-118 |#1|) (|%list| (QUOTE -298) (|%list| (QUOTE -118) (|devaluate| |#1|)) (|%list| (QUOTE -118) (|devaluate| |#1|)))) (|HasCategory| (-118 |#1|) (QUOTE (-319))) (|HasCategory| (-118 |#1|) (QUOTE (-559))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-118 |#1|) (QUOTE (-940)))) (-4144 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-118 |#1|) (QUOTE (-940)))) (|HasCategory| (-118 |#1|) (QUOTE (-147))))) (-120 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{b}}) is equivalent to \\axiom{setright!(a,{}\\spad{b})}.") (($ $ "left" $) "\\spad{setelt(a,\"left\",b)} (also written \\axiom{a . left := \\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 @@ -423,7 +423,7 @@ NIL (-123 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"))) ((-4510 . T) (-4511 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1133))) (-4133 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1133)))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102)))) +((-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1133))) (-4144 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1133)))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102)))) (-124 S) ((|constructor| (NIL "The bit aggregate category models aggregates representing large quantities of Boolean data.")) (|xor| (($ $ $) "\\spad{xor(a,b)} returns the logical {\\em exclusive-or} of bit aggregates \\axiom{a} and \\axiom{\\spad{b}}.")) (|nor| (($ $ $) "\\spad{nor(a,b)} returns the logical {\\em nor} of bit aggregates \\axiom{a} and \\axiom{\\spad{b}}.")) (|nand| (($ $ $) "\\spad{nand(a,b)} returns the logical {\\em nand} of bit aggregates \\axiom{a} and \\axiom{\\spad{b}}."))) NIL @@ -443,11 +443,11 @@ NIL (-128 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."))) ((-4510 . T) (-4511 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1133))) (-4133 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1133)))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102)))) +((-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1133))) (-4144 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1133)))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102)))) (-129 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."))) ((-4510 . T) (-4511 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1133))) (-4133 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1133)))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102)))) +((-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1133))) (-4144 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1133)))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102)))) (-130) ((|constructor| (NIL "Byte is the datatype of 8-bit sized unsigned integer values.")) (|sample| (($) "\\spad{sample} gives a sample datum of type Byte.")) (|bitior| (($ $ $) "bitor(\\spad{x},{}\\spad{y}) returns the bitwise `inclusive or' of `x' and `y'.")) (|bitand| (($ $ $) "\\spad{bitand(x,y)} returns the bitwise `and' of `x' and `y'.")) (|byte| (($ (|NonNegativeInteger|)) "\\spad{byte(x)} injects the unsigned integer value `v' into the Byte algebra. `v' must be non-negative and less than 256."))) NIL @@ -455,7 +455,7 @@ NIL (-131) ((|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 `n'. The array can then store up to `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 `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."))) ((-4511 . T) (-4510 . T)) -((-4133 (-12 (|HasCategory| (-130) (QUOTE (-872))) (|HasCategory| (-130) (|%list| (QUOTE -321) (QUOTE (-130))))) (-12 (|HasCategory| (-130) (QUOTE (-1133))) (|HasCategory| (-130) (|%list| (QUOTE -321) (QUOTE (-130)))))) (-4133 (-12 (|HasCategory| (-130) (QUOTE (-1133))) (|HasCategory| (-130) (|%list| (QUOTE -321) (QUOTE (-130))))) (|HasCategory| (-130) (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| (-130) (|%list| (QUOTE -633) (QUOTE (-549)))) (-4133 (|HasCategory| (-130) (QUOTE (-872))) (|HasCategory| (-130) (QUOTE (-1133)))) (|HasCategory| (-130) (QUOTE (-872))) (-4133 (|HasCategory| (-130) (QUOTE (-102))) (|HasCategory| (-130) (QUOTE (-872))) (|HasCategory| (-130) (QUOTE (-1133)))) (|HasCategory| (-560) (QUOTE (-872))) (|HasCategory| (-130) (QUOTE (-1133))) (|HasCategory| (-130) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-130) (QUOTE (-102))) (-12 (|HasCategory| (-130) (QUOTE (-1133))) (|HasCategory| (-130) (|%list| (QUOTE -321) (QUOTE (-130)))))) +((-4144 (-12 (|HasCategory| (-130) (QUOTE (-872))) (|HasCategory| (-130) (|%list| (QUOTE -321) (QUOTE (-130))))) (-12 (|HasCategory| (-130) (QUOTE (-1133))) (|HasCategory| (-130) (|%list| (QUOTE -321) (QUOTE (-130)))))) (-4144 (-12 (|HasCategory| (-130) (QUOTE (-1133))) (|HasCategory| (-130) (|%list| (QUOTE -321) (QUOTE (-130))))) (|HasCategory| (-130) (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| (-130) (|%list| (QUOTE -633) (QUOTE (-549)))) (-4144 (|HasCategory| (-130) (QUOTE (-872))) (|HasCategory| (-130) (QUOTE (-1133)))) (|HasCategory| (-130) (QUOTE (-872))) (-4144 (|HasCategory| (-130) (QUOTE (-102))) (|HasCategory| (-130) (QUOTE (-872))) (|HasCategory| (-130) (QUOTE (-1133)))) (|HasCategory| (-560) (QUOTE (-872))) (|HasCategory| (-130) (QUOTE (-1133))) (|HasCategory| (-130) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-130) (QUOTE (-102))) (-12 (|HasCategory| (-130) (QUOTE (-1133))) (|HasCategory| (-130) (|%list| (QUOTE -321) (QUOTE (-130)))))) (-132) ((|constructor| (NIL "This datatype describes byte order of machine values stored memory.")) (|unknownEndian| (($) "\\spad{unknownEndian} for none of the above.")) (|bigEndian| (($) "\\spad{bigEndian} describes big endian host")) (|littleEndian| (($) "\\spad{littleEndian} describes little endian host"))) NIL @@ -476,11 +476,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."))) (((-4512 "*") . T)) NIL -(-137 |minix| -4478 R) +(-137 |minix| -2127 R) ((|constructor| (NIL "CartesianTensor(minix,{}dim,{}\\spad{R}) provides Cartesian tensors with components belonging to a commutative ring \\spad{R}. These tensors can have any number of indices. Each index takes values from \\spad{minix} to \\spad{minix + dim - 1}.")) (|sample| (($) "\\spad{sample()} returns an object of type \\%.")) (|unravel| (($ (|List| |#3|)) "\\spad{unravel(t)} produces a tensor from a list of components such that \\indented{2}{\\spad{unravel(ravel(t)) = t}.}")) (|ravel| (((|List| |#3|) $) "\\spad{ravel(t)} produces a list of components from a tensor such that \\indented{2}{\\spad{unravel(ravel(t)) = t}.}")) (|leviCivitaSymbol| (($) "\\spad{leviCivitaSymbol()} is the rank \\spad{dim} tensor defined by \\spad{leviCivitaSymbol()(i1,...idim) = +1/0/-1} if \\spad{i1,...,idim} is an even/is nota /is an odd permutation of \\spad{minix,...,minix+dim-1}.")) (|kroneckerDelta| (($) "\\spad{kroneckerDelta()} is the rank 2 tensor defined by \\indented{3}{\\spad{kroneckerDelta()(i,j)}} \\indented{6}{\\spad{= 1\\space{2}if i = j}} \\indented{6}{\\spad{= 0 if\\space{2}i \\~= j}}")) (|reindex| (($ $ (|List| (|Integer|))) "\\spad{reindex(t,[i1,...,idim])} permutes the indices of \\spad{t}. For example,{} if \\spad{r = reindex(t, [4,1,2,3])} for a rank 4 tensor \\spad{t},{} then \\spad{r} is the rank for tensor given by \\indented{4}{\\spad{r(i,j,k,l) = t(l,i,j,k)}.}")) (|transpose| (($ $ (|Integer|) (|Integer|)) "\\spad{transpose(t,i,j)} exchanges the \\spad{i}\\spad{-}th and \\spad{j}\\spad{-}th indices of \\spad{t}. For example,{} if \\spad{r = transpose(t,2,3)} for a rank 4 tensor \\spad{t},{} then \\spad{r} is the rank 4 tensor given by \\indented{4}{\\spad{r(i,j,k,l) = t(i,k,j,l)}.}") (($ $) "\\spad{transpose(t)} exchanges the first and last indices of \\spad{t}. For example,{} if \\spad{r = transpose(t)} for a rank 4 tensor \\spad{t},{} then \\spad{r} is the rank 4 tensor given by \\indented{4}{\\spad{r(i,j,k,l) = t(l,j,k,i)}.}")) (|contract| (($ $ (|Integer|) (|Integer|)) "\\spad{contract(t,i,j)} is the contraction of tensor \\spad{t} which sums along the \\spad{i}\\spad{-}th and \\spad{j}\\spad{-}th indices. For example,{} if \\spad{r = contract(t,1,3)} for a rank 4 tensor \\spad{t},{} then \\spad{r} is the rank 2 \\spad{(= 4 - 2)} tensor given by \\indented{4}{\\spad{r(i,j) = sum(h=1..dim,t(h,i,h,j))}.}") (($ $ (|Integer|) $ (|Integer|)) "\\spad{contract(t,i,s,j)} is the inner product of tenors \\spad{s} and \\spad{t} which sums along the \\spad{k1}\\spad{-}th index of \\spad{t} and the \\spad{k2}\\spad{-}th index of \\spad{s}. For example,{} if \\spad{r = contract(s,2,t,1)} for rank 3 tensors rank 3 tensors \\spad{s} and \\spad{t},{} then \\spad{r} is the rank 4 \\spad{(= 3 + 3 - 2)} tensor given by \\indented{4}{\\spad{r(i,j,k,l) = sum(h=1..dim,s(i,h,j)*t(h,k,l))}.}")) (* (($ $ $) "\\spad{s*t} is the inner product of the tensors \\spad{s} and \\spad{t} which contracts the last index of \\spad{s} with the first index of \\spad{t},{} \\spadignore{i.e.} \\indented{4}{\\spad{t*s = contract(t,rank t, s, 1)}} \\indented{4}{\\spad{t*s = sum(k=1..N, t[i1,..,iN,k]*s[k,j1,..,jM])}} This is compatible with the use of \\spad{M*v} to denote the matrix-vector inner product.")) (|product| (($ $ $) "\\spad{product(s,t)} is the outer product of the tensors \\spad{s} and \\spad{t}. For example,{} if \\spad{r = product(s,t)} for rank 2 tensors \\spad{s} and \\spad{t},{} then \\spad{r} is a rank 4 tensor given by \\indented{4}{\\spad{r(i,j,k,l) = s(i,j)*t(k,l)}.}")) (|elt| ((|#3| $ (|List| (|Integer|))) "\\spad{elt(t,[i1,...,iN])} gives a component of a rank \\spad{N} tensor.") ((|#3| $ (|Integer|) (|Integer|) (|Integer|) (|Integer|)) "\\spad{elt(t,i,j,k,l)} gives a component of a rank 4 tensor.") ((|#3| $ (|Integer|) (|Integer|) (|Integer|)) "\\spad{elt(t,i,j,k)} gives a component of a rank 3 tensor.") ((|#3| $ (|Integer|) (|Integer|)) "\\spad{elt(t,i,j)} gives a component of a rank 2 tensor.") ((|#3| $) "\\spad{elt(t)} gives the component of a rank 0 tensor.")) (|rank| (((|NonNegativeInteger|) $) "\\spad{rank(t)} returns the tensorial rank of \\spad{t} (that is,{} the number of indices). This is the same as the graded module degree.")) (|coerce| (($ (|List| $)) "\\spad{coerce([t_1,...,t_dim])} allows tensors to be constructed using lists.") (($ (|List| |#3|)) "\\spad{coerce([r_1,...,r_dim])} allows tensors to be constructed using lists.") (($ (|SquareMatrix| |#2| |#3|)) "\\spad{coerce(m)} views a matrix as a rank 2 tensor.") (($ (|DirectProduct| |#2| |#3|)) "\\spad{coerce(v)} views a vector as a rank 1 tensor."))) NIL NIL -(-138 |minix| -4478 S T$) +(-138 |minix| -2127 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 @@ -503,7 +503,7 @@ NIL (-143) ((|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}."))) ((-4510 . T) (-4500 . T) (-4511 . T)) -((-4133 (-12 (|HasCategory| (-146) (QUOTE (-381))) (|HasCategory| (-146) (|%list| (QUOTE -321) (QUOTE (-146))))) (-12 (|HasCategory| (-146) (QUOTE (-1133))) (|HasCategory| (-146) (|%list| (QUOTE -321) (QUOTE (-146)))))) (|HasCategory| (-146) (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| (-146) (QUOTE (-381))) (|HasCategory| (-146) (QUOTE (-872))) (|HasCategory| (-146) (QUOTE (-1133))) (|HasCategory| (-146) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-146) (QUOTE (-102))) (-12 (|HasCategory| (-146) (QUOTE (-1133))) (|HasCategory| (-146) (|%list| (QUOTE -321) (QUOTE (-146)))))) +((-4144 (-12 (|HasCategory| (-146) (QUOTE (-381))) (|HasCategory| (-146) (|%list| (QUOTE -321) (QUOTE (-146))))) (-12 (|HasCategory| (-146) (QUOTE (-1133))) (|HasCategory| (-146) (|%list| (QUOTE -321) (QUOTE (-146)))))) (|HasCategory| (-146) (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| (-146) (QUOTE (-381))) (|HasCategory| (-146) (QUOTE (-872))) (|HasCategory| (-146) (QUOTE (-1133))) (|HasCategory| (-146) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-146) (QUOTE (-102))) (-12 (|HasCategory| (-146) (QUOTE (-1133))) (|HasCategory| (-146) (|%list| (QUOTE -321) (QUOTE (-146)))))) (-144 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}'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}'s.")) (|commonDenominator| ((|#1| |#3|) "\\spad{commonDenominator([q1,...,qn])} returns a common denominator \\spad{d} for \\spad{q1},{}...,{}qn."))) NIL @@ -528,7 +528,7 @@ NIL ((|constructor| (NIL "Rings of Characteristic Zero."))) ((-4507 . T)) NIL -(-150 -4131 UP UPUP) +(-150 -4164 UP UPUP) ((|constructor| (NIL "Tools to send a point to infinity on an algebraic curve.")) (|chvar| (((|Record| (|:| |func| |#3|) (|:| |poly| |#3|) (|:| |c1| (|Fraction| |#2|)) (|:| |c2| (|Fraction| |#2|)) (|:| |deg| (|NonNegativeInteger|))) |#3| |#3|) "\\spad{chvar(f(x,y), p(x,y))} returns \\spad{[g(z,t), q(z,t), c1(z), c2(z), n]} such that under the change of variable \\spad{x = c1(z)},{} \\spad{y = t * c2(z)},{} one gets \\spad{f(x,y) = g(z,t)}. The algebraic relation between \\spad{x} and \\spad{y} is \\spad{p(x, y) = 0}. The algebraic relation between \\spad{z} and \\spad{t} is \\spad{q(z, t) = 0}.")) (|eval| ((|#3| |#3| (|Fraction| |#2|) (|Fraction| |#2|)) "\\spad{eval(p(x,y), f(x), g(x))} returns \\spad{p(f(x), y * g(x))}.")) (|goodPoint| ((|#1| |#3| |#3|) "\\spad{goodPoint(p, q)} returns an integer a such that a is neither a pole of \\spad{p(x,y)} nor a branch point of \\spad{q(x,y) = 0}.")) (|rootPoly| (((|Record| (|:| |exponent| (|NonNegativeInteger|)) (|:| |coef| (|Fraction| |#2|)) (|:| |radicand| |#2|)) (|Fraction| |#2|) (|NonNegativeInteger|)) "\\spad{rootPoly(g, n)} returns \\spad{[m, c, P]} such that \\spad{c * g ** (1/n) = P ** (1/m)} thus if \\spad{y**n = g},{} then \\spad{z**m = P} where \\spad{z = c * y}.")) (|radPoly| (((|Union| (|Record| (|:| |radicand| (|Fraction| |#2|)) (|:| |deg| (|NonNegativeInteger|))) "failed") |#3|) "\\spad{radPoly(p(x, y))} returns \\spad{[c(x), n]} if \\spad{p} is of the form \\spad{y**n - c(x)},{} \"failed\" otherwise.")) (|mkIntegral| (((|Record| (|:| |coef| (|Fraction| |#2|)) (|:| |poly| |#3|)) |#3|) "\\spad{mkIntegral(p(x,y))} returns \\spad{[c(x), q(x,z)]} such that \\spad{z = c * y} is integral. The algebraic relation between \\spad{x} and \\spad{y} is \\spad{p(x, y) = 0}. The algebraic relation between \\spad{x} and \\spad{z} is \\spad{q(x, z) = 0}."))) NIL NIL @@ -568,7 +568,7 @@ NIL ((|constructor| (NIL "Color() specifies a domain of 27 colors provided in the \\Language{} system (the colors mix additively).")) (|color| (($ (|Integer|)) "\\spad{color(i)} returns a color of the indicated hue \\spad{i}.")) (|numberOfHues| (((|PositiveInteger|)) "\\spad{numberOfHues()} returns the number of total hues,{} set in totalHues.")) (|hue| (((|Integer|) $) "\\spad{hue(c)} returns the hue index of the indicated color \\spad{c}.")) (|blue| (($) "\\spad{blue()} returns the position of the blue hue from total hues.")) (|green| (($) "\\spad{green()} returns the position of the green hue from total hues.")) (|yellow| (($) "\\spad{yellow()} returns the position of the yellow hue from total hues.")) (|red| (($) "\\spad{red()} returns the position of the red hue from total hues.")) (+ (($ $ $) "\\spad{c1 + c2} additively mixes the two colors \\spad{c1} and \\spad{c2}.")) (* (($ (|DoubleFloat|) $) "\\spad{s * c},{} returns the color \\spad{c},{} whose weighted shade has been scaled by \\spad{s}.") (($ (|PositiveInteger|) $) "\\spad{s * c},{} returns the color \\spad{c},{} whose weighted shade has been scaled by \\spad{s}."))) NIL NIL -(-160 R -4131) +(-160 R -4164) ((|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})/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.} 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.} 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.} n!/(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 @@ -602,7 +602,7 @@ NIL ((|HasCategory| |#2| (QUOTE (-940))) (|HasCategory| |#2| (QUOTE (-559))) (|HasCategory| |#2| (QUOTE (-1034))) (|HasCategory| |#2| (QUOTE (-1235))) (|HasCategory| |#2| (QUOTE (-1092))) (|HasCategory| |#2| (QUOTE (-1052))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-149))) (|HasCategory| |#2| (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#2| (QUOTE (-376))) (|HasAttribute| |#2| (QUOTE -4506)) (|HasAttribute| |#2| (QUOTE -4509)) (|HasCategory| |#2| (QUOTE (-319))) (|HasCategory| |#2| (QUOTE (-571)))) (-168 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})"))) -((-4503 -4133 (|has| |#1| (-571)) (-12 (|has| |#1| (-319)) (|has| |#1| (-940)))) (-4508 |has| |#1| (-376)) (-4502 |has| |#1| (-376)) (-4506 |has| |#1| (-6 -4506)) (-4509 |has| |#1| (-6 -4509)) (-2804 . T) ((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) +((-4503 -4144 (|has| |#1| (-571)) (-12 (|has| |#1| (-319)) (|has| |#1| (-940)))) (-4508 |has| |#1| (-376)) (-4502 |has| |#1| (-376)) (-4506 |has| |#1| (-6 -4506)) (-4509 |has| |#1| (-6 -4509)) (-2873 . T) ((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) NIL (-169 RR PR) ((|constructor| (NIL "\\indented{1}{Author:} Date Created: Date Last Updated: Basic Functions: Related Constructors: Complex,{} UnivariatePolynomial Also See: AMS Classifications: Keywords: complex,{} polynomial factorization,{} factor References:")) (|factor| (((|Factored| |#2|) |#2|) "\\spad{factor(p)} factorizes the polynomial \\spad{p} with complex coefficients."))) @@ -614,8 +614,8 @@ NIL NIL (-171 R) ((|constructor| (NIL "\\spadtype {Complex(R)} creates the domain of elements of the form \\spad{a + b * i} where \\spad{a} and \\spad{b} come from the ring \\spad{R},{} and \\spad{i} is a new element such that \\spad{i**2 = -1}."))) -((-4503 -4133 (|has| |#1| (-571)) (-12 (|has| |#1| (-319)) (|has| |#1| (-940)))) (-4508 |has| |#1| (-376)) (-4502 |has| |#1| (-376)) (-4506 |has| |#1| (-6 -4506)) (-4509 |has| |#1| (-6 -4509)) (-2804 . T) ((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) -((|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-363))) (-4133 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-363)))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-381))) (-4133 (|HasCategory| |#1| (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-363)))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (QUOTE (-363)))) (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (-4133 (|HasCategory| |#1| (|%list| (QUOTE -930) (QUOTE (-1209)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))))) (|HasCategory| |#1| (|%list| (QUOTE -660) (QUOTE (-560)))) (-4133 (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560)))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-940)))) (|HasCategory| |#1| (QUOTE (-376))) (-12 (|HasCategory| |#1| (QUOTE (-363))) (|HasCategory| |#1| (QUOTE (-940))))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-940)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-940)))) (-12 (|HasCategory| |#1| (QUOTE (-363))) (|HasCategory| |#1| (QUOTE (-940))))) (-4133 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-571)))) (-12 (|HasCategory| |#1| (QUOTE (-1034))) (|HasCategory| |#1| (QUOTE (-1235)))) (|HasCategory| |#1| (QUOTE (-1235))) (|HasCategory| |#1| (QUOTE (-1052))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549)))) (-4133 (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-363))) (|HasCategory| |#1| (QUOTE (-571)))) (-4133 (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-363)))) (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -528) (QUOTE (-1209)) (|devaluate| |#1|))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))) (|HasCategory| |#1| (|%list| (QUOTE -298) (|devaluate| |#1|) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-845))) (|HasCategory| |#1| (QUOTE (-1092))) (-12 (|HasCategory| |#1| (QUOTE (-1092))) (|HasCategory| |#1| (QUOTE (-1235)))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-940))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-940)))) (|HasCategory| |#1| (QUOTE (-376)))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-940)))) (|HasCategory| |#1| (QUOTE (-571)))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-239)))) (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-240))) (-12 (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-940)))) (|HasAttribute| |#1| (QUOTE -4506)) (|HasAttribute| |#1| (QUOTE -4509)) (-12 (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -930) (QUOTE (-1209))))) (-12 (|HasCategory| |#1| (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209))))) (-4133 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-940)))) (|HasCategory| |#1| (QUOTE (-147)))) (-4133 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-940)))) (|HasCategory| |#1| (QUOTE (-363))))) +((-4503 -4144 (|has| |#1| (-571)) (-12 (|has| |#1| (-319)) (|has| |#1| (-940)))) (-4508 |has| |#1| (-376)) (-4502 |has| |#1| (-376)) (-4506 |has| |#1| (-6 -4506)) (-4509 |has| |#1| (-6 -4509)) (-2873 . T) ((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) +((|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-363))) (-4144 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-363)))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-381))) (-4144 (|HasCategory| |#1| (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-363)))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (QUOTE (-363)))) (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (-4144 (|HasCategory| |#1| (|%list| (QUOTE -930) (QUOTE (-1209)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))))) (|HasCategory| |#1| (|%list| (QUOTE -660) (QUOTE (-560)))) (-4144 (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560)))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-940)))) (|HasCategory| |#1| (QUOTE (-376))) (-12 (|HasCategory| |#1| (QUOTE (-363))) (|HasCategory| |#1| (QUOTE (-940))))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-940)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-940)))) (-12 (|HasCategory| |#1| (QUOTE (-363))) (|HasCategory| |#1| (QUOTE (-940))))) (-4144 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-571)))) (-12 (|HasCategory| |#1| (QUOTE (-1034))) (|HasCategory| |#1| (QUOTE (-1235)))) (|HasCategory| |#1| (QUOTE (-1235))) (|HasCategory| |#1| (QUOTE (-1052))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549)))) (-4144 (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-363))) (|HasCategory| |#1| (QUOTE (-571)))) (-4144 (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-363)))) (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -528) (QUOTE (-1209)) (|devaluate| |#1|))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))) (|HasCategory| |#1| (|%list| (QUOTE -298) (|devaluate| |#1|) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-845))) (|HasCategory| |#1| (QUOTE (-1092))) (-12 (|HasCategory| |#1| (QUOTE (-1092))) (|HasCategory| |#1| (QUOTE (-1235)))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-940))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-940)))) (|HasCategory| |#1| (QUOTE (-376)))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-940)))) (|HasCategory| |#1| (QUOTE (-571)))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-239)))) (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-240))) (-12 (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-940)))) (|HasAttribute| |#1| (QUOTE -4506)) (|HasAttribute| |#1| (QUOTE -4509)) (-12 (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -930) (QUOTE (-1209))))) (-12 (|HasCategory| |#1| (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209))))) (-4144 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-940)))) (|HasCategory| |#1| (QUOTE (-147)))) (-4144 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-940)))) (|HasCategory| |#1| (QUOTE (-363))))) (-172 R S) ((|constructor| (NIL "This package extends maps from underlying rings to maps between complex over those rings.")) (|map| (((|Complex| |#2|) (|Mapping| |#2| |#1|) (|Complex| |#1|)) "\\spad{map(f,u)} maps \\spad{f} onto real and imaginary parts of \\spad{u}."))) NIL @@ -692,7 +692,7 @@ NIL ((|constructor| (NIL "This domain enumerates the three kinds of constructors available in OpenAxiom: category constructors,{} domain constructors,{} and package constructors.")) (|package| (($) "`package' is the kind of package constructors.")) (|domain| (($) "`domain' is the kind of domain constructors")) (|category| (($) "`category' is the kind of category constructors"))) NIL NIL -(-191 R -4131) +(-191 R -4164) ((|constructor| (NIL "\\spadtype{ComplexTrigonometricManipulations} provides function that compute the real and imaginary parts of complex functions.")) (|complexForm| (((|Complex| (|Expression| |#1|)) |#2|) "\\spad{complexForm(f)} returns \\spad{[real f, imag f]}.")) (|trigs| ((|#2| |#2|) "\\spad{trigs(f)} rewrites all the complex logs and exponentials appearing in \\spad{f} in terms of trigonometric functions.")) (|real?| (((|Boolean|) |#2|) "\\spad{real?(f)} returns \\spad{true} if \\spad{f = real f}.")) (|imag| (((|Expression| |#1|) |#2|) "\\spad{imag(f)} returns the imaginary part of \\spad{f} where \\spad{f} is a complex function.")) (|real| (((|Expression| |#1|) |#2|) "\\spad{real(f)} returns the real part of \\spad{f} where \\spad{f} is a complex function.")) (|complexElementary| ((|#2| |#2| (|Symbol|)) "\\spad{complexElementary(f, x)} rewrites the kernels of \\spad{f} involving \\spad{x} in terms of the 2 fundamental complex transcendental elementary functions: \\spad{log, exp}.") ((|#2| |#2|) "\\spad{complexElementary(f)} rewrites \\spad{f} in terms of the 2 fundamental complex transcendental elementary functions: \\spad{log, exp}.")) (|complexNormalize| ((|#2| |#2| (|Symbol|)) "\\spad{complexNormalize(f, x)} rewrites \\spad{f} using the least possible number of complex independent kernels involving \\spad{x}.") ((|#2| |#2|) "\\spad{complexNormalize(f)} rewrites \\spad{f} using the least possible number of complex independent kernels."))) NIL NIL @@ -804,23 +804,23 @@ NIL ((|constructor| (NIL "\\indented{1}{Author: Gabriel Dos Reis} Date Created: July 2,{} 2010 Date Last Modified: July 2,{} 2010 Descrption: \\indented{2}{Representation of a dual vector space basis,{} given by symbols.}")) (|dual| (($ (|LinearBasis| |#1|)) "\\spad{dual x} constructs the dual vector of a linear element which is part of a basis."))) NIL NIL -(-219 -4131 UP UPUP R) +(-219 -4164 UP UPUP R) ((|constructor| (NIL "This package provides functions for computing the residues of a function on an algebraic curve.")) (|doubleResultant| ((|#2| |#4| (|Mapping| |#2| |#2|)) "\\spad{doubleResultant(f, ')} returns \\spad{p}(\\spad{x}) whose roots are rational multiples of the residues of \\spad{f} at all its finite poles. Argument ' is the derivation to use."))) NIL NIL -(-220 -4131 FP) +(-220 -4164 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 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 (-221) ((|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."))) ((-4502 . T) (-4508 . T) (-4503 . T) ((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) -((|HasCategory| (-560) (QUOTE (-940))) (|HasCategory| (-560) (|%list| (QUOTE -1070) (QUOTE (-1209)))) (|HasCategory| (-560) (QUOTE (-147))) (|HasCategory| (-560) (QUOTE (-149))) (|HasCategory| (-560) (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| (-560) (QUOTE (-1052))) (|HasCategory| (-560) (QUOTE (-844))) (|HasCategory| (-560) (QUOTE (-872))) (-4133 (|HasCategory| (-560) (QUOTE (-844))) (|HasCategory| (-560) (QUOTE (-872)))) (|HasCategory| (-560) (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| (-560) (QUOTE (-1184))) (|HasCategory| (-560) (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| (-560) (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| (-560) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| (-560) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| (-560) (QUOTE (-239))) (|HasCategory| (-560) (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| (-560) (QUOTE (-240))) (|HasCategory| (-560) (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| (-560) (|%list| (QUOTE -528) (QUOTE (-1209)) (QUOTE (-560)))) (|HasCategory| (-560) (|%list| (QUOTE -321) (QUOTE (-560)))) (|HasCategory| (-560) (|%list| (QUOTE -298) (QUOTE (-560)) (QUOTE (-560)))) (|HasCategory| (-560) (QUOTE (-319))) (|HasCategory| (-560) (QUOTE (-559))) (|HasCategory| (-560) (|%list| (QUOTE -660) (QUOTE (-560)))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-560) (QUOTE (-940)))) (-4133 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-560) (QUOTE (-940)))) (|HasCategory| (-560) (QUOTE (-147))))) +((|HasCategory| (-560) (QUOTE (-940))) (|HasCategory| (-560) (|%list| (QUOTE -1070) (QUOTE (-1209)))) (|HasCategory| (-560) (QUOTE (-147))) (|HasCategory| (-560) (QUOTE (-149))) (|HasCategory| (-560) (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| (-560) (QUOTE (-1052))) (|HasCategory| (-560) (QUOTE (-844))) (|HasCategory| (-560) (QUOTE (-872))) (-4144 (|HasCategory| (-560) (QUOTE (-844))) (|HasCategory| (-560) (QUOTE (-872)))) (|HasCategory| (-560) (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| (-560) (QUOTE (-1184))) (|HasCategory| (-560) (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| (-560) (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| (-560) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| (-560) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| (-560) (QUOTE (-239))) (|HasCategory| (-560) (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| (-560) (QUOTE (-240))) (|HasCategory| (-560) (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| (-560) (|%list| (QUOTE -528) (QUOTE (-1209)) (QUOTE (-560)))) (|HasCategory| (-560) (|%list| (QUOTE -321) (QUOTE (-560)))) (|HasCategory| (-560) (|%list| (QUOTE -298) (QUOTE (-560)) (QUOTE (-560)))) (|HasCategory| (-560) (QUOTE (-319))) (|HasCategory| (-560) (QUOTE (-559))) (|HasCategory| (-560) (|%list| (QUOTE -660) (QUOTE (-560)))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-560) (QUOTE (-940)))) (-4144 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-560) (QUOTE (-940)))) (|HasCategory| (-560) (QUOTE (-147))))) (-222) ((|constructor| (NIL "This domain represents the syntax of a definition.")) (|body| (((|SpadAst|) $) "\\spad{body(d)} returns the right hand side of the definition `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 `d'. This is a list of identifiers starting with the name of the operation followed by the name of the parameters,{} if any."))) NIL NIL -(-223 R -4131) +(-223 R -4164) ((|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 @@ -835,18 +835,18 @@ NIL (-226 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}."))) ((-4510 . T) (-4511 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1133))) (-4133 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1133)))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102)))) +((-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1133))) (-4144 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1133)))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102)))) (-227 |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}."))) ((-4507 . T)) NIL -(-228 R -4131) +(-228 R -4164) ((|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 (-229) ((|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}."))) -((-2793 . T) (-4502 . T) (-4508 . T) (-4503 . T) ((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) +((-2862 . T) (-4502 . T) (-4508 . T) (-4503 . T) ((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) NIL (-230) ((|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)}.}"))) @@ -855,7 +855,7 @@ NIL (-231 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}"))) ((-4510 . T) (-4511 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1133))) (-4133 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1133)))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-571))) (|HasAttribute| |#1| (QUOTE (-4512 "*"))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102)))) +((-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1133))) (-4144 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1133)))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-571))) (|HasAttribute| |#1| (QUOTE (-4512 "*"))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102)))) (-232 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 @@ -904,19 +904,19 @@ 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 -(-244 S -4478 R) +(-244 S -2127 R) ((|constructor| (NIL "\\indented{2}{This category represents a finite cartesian product of a given type.} Many categorical properties are preserved under this construction.")) (|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 (-376))) (|HasCategory| |#3| (QUOTE (-817))) (|HasCategory| |#3| (QUOTE (-872))) (|HasAttribute| |#3| (QUOTE -4507)) (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (QUOTE (-381))) (|HasCategory| |#3| (QUOTE (-748))) (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (QUOTE (-23))) (|HasCategory| |#3| (QUOTE (-133))) (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (QUOTE (-1081))) (|HasCategory| |#3| (QUOTE (-1133)))) -(-245 -4478 R) +(-245 -2127 R) ((|constructor| (NIL "\\indented{2}{This category represents a finite cartesian product of a given type.} Many categorical properties are preserved under this construction.")) (|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"))) ((-4504 |has| |#2| (-1081)) (-4505 |has| |#2| (-1081)) (-4507 |has| |#2| (-6 -4507)) (-4510 . T)) NIL -(-246 -4478 R) +(-246 -2127 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."))) ((-4504 |has| |#2| (-1081)) (-4505 |has| |#2| (-1081)) (-4507 |has| |#2| (-6 -4507)) (-4510 . T)) -((-4133 (-12 (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-748))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-817))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-872))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))))) (-4133 (-12 (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-1081)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-1133)))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-1081)))) (-12 (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209))))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#2| (QUOTE (-376))) (-4133 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1081)))) (-4133 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-376)))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (QUOTE (-748))) (|HasCategory| |#2| (QUOTE (-817))) (-4133 (|HasCategory| |#2| (QUOTE (-817))) (|HasCategory| |#2| (QUOTE (-872)))) (|HasCategory| |#2| (QUOTE (-872))) (|HasCategory| |#2| (QUOTE (-381))) (-4133 (-12 (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-175)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-240)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-376)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-1081))))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (-4133 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (QUOTE (-748))) (|HasCategory| |#2| (QUOTE (-817))) (|HasCategory| |#2| (QUOTE (-872))) (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (QUOTE (-1133)))) (-4133 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (QUOTE (-748))) (|HasCategory| |#2| (QUOTE (-817))) (|HasCategory| |#2| (QUOTE (-872))) (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (QUOTE (-1133)))) (-4133 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1081)))) (-4133 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1081)))) (-4133 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1081)))) (-4133 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1081)))) (-4133 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-1081)))) (|HasCategory| |#2| (QUOTE (-240))) (-4133 (|HasCategory| |#2| (QUOTE (-240))) (-12 (|HasCategory| |#2| (QUOTE (-239))) (|HasCategory| |#2| (QUOTE (-1081))))) (-4133 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (-12 (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (|%list| (QUOTE -930) (QUOTE (-1209)))))) (|HasCategory| |#2| (QUOTE (-1133))) (-4133 (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-21)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-23)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-25)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-133)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-175)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-240)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-376)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-381)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-748)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-817)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-872)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-1081)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-1133))))) (-4133 (-12 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-748))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-817))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-872))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-1081))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560)))))) (-4133 (-12 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-748))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-817))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-872))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560)))))) (|HasCategory| (-560) (QUOTE (-872))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-1081)))) (-12 (|HasCategory| |#2| (QUOTE (-239))) (|HasCategory| |#2| (QUOTE (-1081)))) (-12 (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (|%list| (QUOTE -930) (QUOTE (-1209))))) (-4133 (|HasCategory| |#2| (QUOTE (-1081))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560)))))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-1133)))) (|HasAttribute| |#2| (QUOTE -4507)) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-1081)))) (-12 (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209))))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#2| (QUOTE (-102))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|))))) -(-247 -4478 A B) +((-4144 (-12 (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-748))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-817))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-872))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))))) (-4144 (-12 (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-1081)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-1133)))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-1081)))) (-12 (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209))))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#2| (QUOTE (-376))) (-4144 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1081)))) (-4144 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-376)))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (QUOTE (-748))) (|HasCategory| |#2| (QUOTE (-817))) (-4144 (|HasCategory| |#2| (QUOTE (-817))) (|HasCategory| |#2| (QUOTE (-872)))) (|HasCategory| |#2| (QUOTE (-872))) (|HasCategory| |#2| (QUOTE (-381))) (-4144 (-12 (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-175)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-240)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-376)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-1081))))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (-4144 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (QUOTE (-748))) (|HasCategory| |#2| (QUOTE (-817))) (|HasCategory| |#2| (QUOTE (-872))) (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (QUOTE (-1133)))) (-4144 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (QUOTE (-748))) (|HasCategory| |#2| (QUOTE (-817))) (|HasCategory| |#2| (QUOTE (-872))) (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (QUOTE (-1133)))) (-4144 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1081)))) (-4144 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1081)))) (-4144 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1081)))) (-4144 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1081)))) (-4144 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-1081)))) (|HasCategory| |#2| (QUOTE (-240))) (-4144 (|HasCategory| |#2| (QUOTE (-240))) (-12 (|HasCategory| |#2| (QUOTE (-239))) (|HasCategory| |#2| (QUOTE (-1081))))) (-4144 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (-12 (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (|%list| (QUOTE -930) (QUOTE (-1209)))))) (|HasCategory| |#2| (QUOTE (-1133))) (-4144 (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-21)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-23)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-25)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-133)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-175)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-240)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-376)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-381)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-748)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-817)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-872)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-1081)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-1133))))) (-4144 (-12 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-748))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-817))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-872))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-1081))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560)))))) (-4144 (-12 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-748))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-817))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-872))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560)))))) (|HasCategory| (-560) (QUOTE (-872))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-1081)))) (-12 (|HasCategory| |#2| (QUOTE (-239))) (|HasCategory| |#2| (QUOTE (-1081)))) (-12 (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (|%list| (QUOTE -930) (QUOTE (-1209))))) (-4144 (|HasCategory| |#2| (QUOTE (-1081))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560)))))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-1133)))) (|HasAttribute| |#2| (QUOTE -4507)) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-1081)))) (-12 (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209))))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#2| (QUOTE (-102))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|))))) +(-247 -2127 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 @@ -939,7 +939,7 @@ NIL (-252 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}"))) ((-4511 . T) (-4510 . T)) -((-4133 (-12 (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549)))) (-4133 (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133)))) (|HasCategory| |#1| (QUOTE (-872))) (-4133 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133)))) (|HasCategory| (-560) (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) +((-4144 (-12 (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549)))) (-4144 (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133)))) (|HasCategory| |#1| (QUOTE (-872))) (-4144 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133)))) (|HasCategory| (-560) (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-253 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'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 @@ -951,7 +951,7 @@ NIL (-255 |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"))) (((-4512 "*") |has| |#2| (-175)) (-4503 |has| |#2| (-571)) (-4508 |has| |#2| (-6 -4508)) (-4505 . T) (-4504 . T) (-4507 . T)) -((|HasCategory| |#2| (QUOTE (-940))) (-4133 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-466))) (|HasCategory| |#2| (QUOTE (-571))) (|HasCategory| |#2| (QUOTE (-940)))) (-4133 (|HasCategory| |#2| (QUOTE (-466))) (|HasCategory| |#2| (QUOTE (-571))) (|HasCategory| |#2| (QUOTE (-940)))) (-4133 (|HasCategory| |#2| (QUOTE (-466))) (|HasCategory| |#2| (QUOTE (-940)))) (|HasCategory| |#2| (QUOTE (-571))) (|HasCategory| |#2| (QUOTE (-175))) (-4133 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-571)))) (-12 (|HasCategory| (-889 |#1|) (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| |#2| (|%list| (QUOTE -912) (QUOTE (-391))))) (-12 (|HasCategory| (-889 |#1|) (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| |#2| (|%list| (QUOTE -912) (QUOTE (-560))))) (-12 (|HasCategory| (-889 |#1|) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| |#2| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391)))))) (-12 (|HasCategory| (-889 |#1|) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560)))))) (-12 (|HasCategory| (-889 |#1|) (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#2| (|%list| (QUOTE -633) (QUOTE (-549))))) (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-149))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560)))) (-4133 (|HasCategory| |#2| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560)))))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-376))) (|HasAttribute| |#2| (QUOTE -4508)) (|HasCategory| |#2| (QUOTE (-466))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-940)))) (-4133 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-940)))) (|HasCategory| |#2| (QUOTE (-147))))) +((|HasCategory| |#2| (QUOTE (-940))) (-4144 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-466))) (|HasCategory| |#2| (QUOTE (-571))) (|HasCategory| |#2| (QUOTE (-940)))) (-4144 (|HasCategory| |#2| (QUOTE (-466))) (|HasCategory| |#2| (QUOTE (-571))) (|HasCategory| |#2| (QUOTE (-940)))) (-4144 (|HasCategory| |#2| (QUOTE (-466))) (|HasCategory| |#2| (QUOTE (-940)))) (|HasCategory| |#2| (QUOTE (-571))) (|HasCategory| |#2| (QUOTE (-175))) (-4144 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-571)))) (-12 (|HasCategory| (-889 |#1|) (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| |#2| (|%list| (QUOTE -912) (QUOTE (-391))))) (-12 (|HasCategory| (-889 |#1|) (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| |#2| (|%list| (QUOTE -912) (QUOTE (-560))))) (-12 (|HasCategory| (-889 |#1|) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| |#2| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391)))))) (-12 (|HasCategory| (-889 |#1|) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560)))))) (-12 (|HasCategory| (-889 |#1|) (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#2| (|%list| (QUOTE -633) (QUOTE (-549))))) (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-149))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560)))) (-4144 (|HasCategory| |#2| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560)))))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-376))) (|HasAttribute| |#2| (QUOTE -4508)) (|HasCategory| |#2| (QUOTE (-466))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-940)))) (-4144 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-940)))) (|HasCategory| |#2| (QUOTE (-147))))) (-256) ((|showSummary| (((|Void|) $) "\\spad{showSummary(d)} prints out implementation detail information of domain `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 `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 `d'."))) NIL @@ -966,12 +966,12 @@ NIL NIL (-259 |n| R M S) ((|constructor| (NIL "This constructor provides a direct product type with a left matrix-module view."))) -((-4507 -4133 (-2522 (|has| |#4| (-1081)) (|has| |#4| (-240))) (|has| |#4| (-6 -4507)) (-2522 (|has| |#4| (-1081)) (|has| |#4| (-928 (-1209))))) (-4504 |has| |#4| (-1081)) (-4505 |has| |#4| (-1081)) (-4510 . T)) -((-4133 (-12 (|HasCategory| |#4| (QUOTE (-21))) (|HasCategory| |#4| (|%list| (QUOTE -321) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-175))) (|HasCategory| |#4| (|%list| (QUOTE -321) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-240))) (|HasCategory| |#4| (|%list| (QUOTE -321) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-376))) (|HasCategory| |#4| (|%list| (QUOTE -321) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-381))) (|HasCategory| |#4| (|%list| (QUOTE -321) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-748))) (|HasCategory| |#4| (|%list| (QUOTE -321) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-817))) (|HasCategory| |#4| (|%list| (QUOTE -321) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-872))) (|HasCategory| |#4| (|%list| (QUOTE -321) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-1081))) (|HasCategory| |#4| (|%list| (QUOTE -321) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-1133))) (|HasCategory| |#4| (|%list| (QUOTE -321) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (|%list| (QUOTE -321) (|devaluate| |#4|))) (|HasCategory| |#4| (|%list| (QUOTE -928) (QUOTE (-1209)))))) (|HasCategory| |#4| (QUOTE (-376))) (-4133 (|HasCategory| |#4| (QUOTE (-175))) (|HasCategory| |#4| (QUOTE (-376))) (|HasCategory| |#4| (QUOTE (-1081)))) (-4133 (|HasCategory| |#4| (QUOTE (-175))) (|HasCategory| |#4| (QUOTE (-376)))) (|HasCategory| |#4| (QUOTE (-1081))) (|HasCategory| |#4| (QUOTE (-748))) (|HasCategory| |#4| (QUOTE (-817))) (-4133 (|HasCategory| |#4| (QUOTE (-817))) (|HasCategory| |#4| (QUOTE (-872)))) (|HasCategory| |#4| (QUOTE (-872))) (|HasCategory| |#4| (QUOTE (-381))) (-4133 (-12 (|HasCategory| |#4| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#4| (|%list| (QUOTE -928) (QUOTE (-1209))))) (-12 (|HasCategory| |#4| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#4| (QUOTE (-175)))) (-12 (|HasCategory| |#4| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#4| (QUOTE (-240)))) (-12 (|HasCategory| |#4| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#4| (QUOTE (-376)))) (-12 (|HasCategory| |#4| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#4| (QUOTE (-1081))))) (|HasCategory| |#4| (|%list| (QUOTE -928) (QUOTE (-1209)))) (-4133 (|HasCategory| |#4| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#4| (QUOTE (-240))) (|HasCategory| |#4| (QUOTE (-1081)))) (|HasCategory| |#4| (QUOTE (-240))) (-4133 (|HasCategory| |#4| (QUOTE (-240))) (-12 (|HasCategory| |#4| (QUOTE (-239))) (|HasCategory| |#4| (QUOTE (-1081))))) (-4133 (|HasCategory| |#4| (|%list| (QUOTE -928) (QUOTE (-1209)))) (-12 (|HasCategory| |#4| (QUOTE (-1081))) (|HasCategory| |#4| (|%list| (QUOTE -930) (QUOTE (-1209)))))) (|HasCategory| |#4| (QUOTE (-1133))) (-4133 (-12 (|HasCategory| |#4| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#4| (|%list| (QUOTE -928) (QUOTE (-1209))))) (-12 (|HasCategory| |#4| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#4| (QUOTE (-21)))) (-12 (|HasCategory| |#4| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#4| (QUOTE (-175)))) (-12 (|HasCategory| |#4| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#4| (QUOTE (-240)))) (-12 (|HasCategory| |#4| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#4| (QUOTE (-376)))) (-12 (|HasCategory| |#4| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#4| (QUOTE (-381)))) (-12 (|HasCategory| |#4| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#4| (QUOTE (-748)))) (-12 (|HasCategory| |#4| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#4| (QUOTE (-817)))) (-12 (|HasCategory| |#4| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#4| (QUOTE (-872)))) (-12 (|HasCategory| |#4| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#4| (QUOTE (-1081)))) (-12 (|HasCategory| |#4| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#4| (QUOTE (-1133))))) (-4133 (-12 (|HasCategory| |#4| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#4| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#4| (QUOTE (-21))) (|HasCategory| |#4| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#4| (QUOTE (-175))) (|HasCategory| |#4| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#4| (QUOTE (-240))) (|HasCategory| |#4| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#4| (QUOTE (-376))) (|HasCategory| |#4| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#4| (QUOTE (-381))) (|HasCategory| |#4| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#4| (QUOTE (-748))) (|HasCategory| |#4| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#4| (QUOTE (-817))) (|HasCategory| |#4| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#4| (QUOTE (-872))) (|HasCategory| |#4| (|%list| (QUOTE -1070) (QUOTE (-560))))) (|HasCategory| |#4| (QUOTE (-1081))) (-12 (|HasCategory| |#4| (QUOTE (-1133))) (|HasCategory| |#4| (|%list| (QUOTE -1070) (QUOTE (-560)))))) (-4133 (-12 (|HasCategory| |#4| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#4| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#4| (QUOTE (-21))) (|HasCategory| |#4| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#4| (QUOTE (-175))) (|HasCategory| |#4| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#4| (QUOTE (-240))) (|HasCategory| |#4| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#4| (QUOTE (-376))) (|HasCategory| |#4| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#4| (QUOTE (-381))) (|HasCategory| |#4| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#4| (QUOTE (-748))) (|HasCategory| |#4| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#4| (QUOTE (-817))) (|HasCategory| |#4| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#4| (QUOTE (-872))) (|HasCategory| |#4| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#4| (QUOTE (-1081))) (|HasCategory| |#4| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#4| (QUOTE (-1133))) (|HasCategory| |#4| (|%list| (QUOTE -1070) (QUOTE (-560)))))) (|HasCategory| (-560) (QUOTE (-872))) (-12 (|HasCategory| |#4| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#4| (QUOTE (-1081)))) (-4133 (-12 (|HasCategory| |#4| (QUOTE (-1081))) (|HasCategory| |#4| (|%list| (QUOTE -928) (QUOTE (-1209))))) (-12 (|HasCategory| |#4| (QUOTE (-1081))) (|HasCategory| |#4| (|%list| (QUOTE -930) (QUOTE (-1209)))))) (-4133 (-12 (|HasCategory| |#4| (QUOTE (-240))) (|HasCategory| |#4| (QUOTE (-1081)))) (-12 (|HasCategory| |#4| (QUOTE (-239))) (|HasCategory| |#4| (QUOTE (-1081))))) (-12 (|HasCategory| |#4| (QUOTE (-1133))) (|HasCategory| |#4| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-4133 (|HasCategory| |#4| (QUOTE (-1081))) (-12 (|HasCategory| |#4| (QUOTE (-1133))) (|HasCategory| |#4| (|%list| (QUOTE -1070) (QUOTE (-560)))))) (-12 (|HasCategory| |#4| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#4| (QUOTE (-1133)))) (-4133 (|HasAttribute| |#4| (QUOTE -4507)) (-12 (|HasCategory| |#4| (QUOTE (-240))) (|HasCategory| |#4| (QUOTE (-1081)))) (-12 (|HasCategory| |#4| (QUOTE (-1081))) (|HasCategory| |#4| (|%list| (QUOTE -928) (QUOTE (-1209)))))) (-12 (|HasCategory| |#4| (QUOTE (-239))) (|HasCategory| |#4| (QUOTE (-1081)))) (-12 (|HasCategory| |#4| (QUOTE (-1081))) (|HasCategory| |#4| (|%list| (QUOTE -930) (QUOTE (-1209))))) (|HasCategory| |#4| (QUOTE (-175))) (|HasCategory| |#4| (QUOTE (-21))) (|HasCategory| |#4| (QUOTE (-23))) (|HasCategory| |#4| (QUOTE (-133))) (|HasCategory| |#4| (QUOTE (-25))) (|HasCategory| |#4| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#4| (QUOTE (-102))) (-12 (|HasCategory| |#4| (QUOTE (-1133))) (|HasCategory| |#4| (|%list| (QUOTE -321) (|devaluate| |#4|))))) +((-4507 -4144 (-2609 (|has| |#4| (-1081)) (|has| |#4| (-240))) (|has| |#4| (-6 -4507)) (-2609 (|has| |#4| (-1081)) (|has| |#4| (-928 (-1209))))) (-4504 |has| |#4| (-1081)) (-4505 |has| |#4| (-1081)) (-4510 . T)) +((-4144 (-12 (|HasCategory| |#4| (QUOTE (-21))) (|HasCategory| |#4| (|%list| (QUOTE -321) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-175))) (|HasCategory| |#4| (|%list| (QUOTE -321) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-240))) (|HasCategory| |#4| (|%list| (QUOTE -321) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-376))) (|HasCategory| |#4| (|%list| (QUOTE -321) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-381))) (|HasCategory| |#4| (|%list| (QUOTE -321) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-748))) (|HasCategory| |#4| (|%list| (QUOTE -321) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-817))) (|HasCategory| |#4| (|%list| (QUOTE -321) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-872))) (|HasCategory| |#4| (|%list| (QUOTE -321) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-1081))) (|HasCategory| |#4| (|%list| (QUOTE -321) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (QUOTE (-1133))) (|HasCategory| |#4| (|%list| (QUOTE -321) (|devaluate| |#4|)))) (-12 (|HasCategory| |#4| (|%list| (QUOTE -321) (|devaluate| |#4|))) (|HasCategory| |#4| (|%list| (QUOTE -928) (QUOTE (-1209)))))) (|HasCategory| |#4| (QUOTE (-376))) (-4144 (|HasCategory| |#4| (QUOTE (-175))) (|HasCategory| |#4| (QUOTE (-376))) (|HasCategory| |#4| (QUOTE (-1081)))) (-4144 (|HasCategory| |#4| (QUOTE (-175))) (|HasCategory| |#4| (QUOTE (-376)))) (|HasCategory| |#4| (QUOTE (-1081))) (|HasCategory| |#4| (QUOTE (-748))) (|HasCategory| |#4| (QUOTE (-817))) (-4144 (|HasCategory| |#4| (QUOTE (-817))) (|HasCategory| |#4| (QUOTE (-872)))) (|HasCategory| |#4| (QUOTE (-872))) (|HasCategory| |#4| (QUOTE (-381))) (-4144 (-12 (|HasCategory| |#4| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#4| (|%list| (QUOTE -928) (QUOTE (-1209))))) (-12 (|HasCategory| |#4| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#4| (QUOTE (-175)))) (-12 (|HasCategory| |#4| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#4| (QUOTE (-240)))) (-12 (|HasCategory| |#4| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#4| (QUOTE (-376)))) (-12 (|HasCategory| |#4| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#4| (QUOTE (-1081))))) (|HasCategory| |#4| (|%list| (QUOTE -928) (QUOTE (-1209)))) (-4144 (|HasCategory| |#4| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#4| (QUOTE (-240))) (|HasCategory| |#4| (QUOTE (-1081)))) (|HasCategory| |#4| (QUOTE (-240))) (-4144 (|HasCategory| |#4| (QUOTE (-240))) (-12 (|HasCategory| |#4| (QUOTE (-239))) (|HasCategory| |#4| (QUOTE (-1081))))) (-4144 (|HasCategory| |#4| (|%list| (QUOTE -928) (QUOTE (-1209)))) (-12 (|HasCategory| |#4| (QUOTE (-1081))) (|HasCategory| |#4| (|%list| (QUOTE -930) (QUOTE (-1209)))))) (|HasCategory| |#4| (QUOTE (-1133))) (-4144 (-12 (|HasCategory| |#4| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#4| (|%list| (QUOTE -928) (QUOTE (-1209))))) (-12 (|HasCategory| |#4| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#4| (QUOTE (-21)))) (-12 (|HasCategory| |#4| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#4| (QUOTE (-175)))) (-12 (|HasCategory| |#4| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#4| (QUOTE (-240)))) (-12 (|HasCategory| |#4| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#4| (QUOTE (-376)))) (-12 (|HasCategory| |#4| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#4| (QUOTE (-381)))) (-12 (|HasCategory| |#4| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#4| (QUOTE (-748)))) (-12 (|HasCategory| |#4| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#4| (QUOTE (-817)))) (-12 (|HasCategory| |#4| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#4| (QUOTE (-872)))) (-12 (|HasCategory| |#4| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#4| (QUOTE (-1081)))) (-12 (|HasCategory| |#4| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#4| (QUOTE (-1133))))) (-4144 (-12 (|HasCategory| |#4| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#4| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#4| (QUOTE (-21))) (|HasCategory| |#4| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#4| (QUOTE (-175))) (|HasCategory| |#4| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#4| (QUOTE (-240))) (|HasCategory| |#4| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#4| (QUOTE (-376))) (|HasCategory| |#4| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#4| (QUOTE (-381))) (|HasCategory| |#4| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#4| (QUOTE (-748))) (|HasCategory| |#4| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#4| (QUOTE (-817))) (|HasCategory| |#4| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#4| (QUOTE (-872))) (|HasCategory| |#4| (|%list| (QUOTE -1070) (QUOTE (-560))))) (|HasCategory| |#4| (QUOTE (-1081))) (-12 (|HasCategory| |#4| (QUOTE (-1133))) (|HasCategory| |#4| (|%list| (QUOTE -1070) (QUOTE (-560)))))) (-4144 (-12 (|HasCategory| |#4| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#4| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#4| (QUOTE (-21))) (|HasCategory| |#4| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#4| (QUOTE (-175))) (|HasCategory| |#4| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#4| (QUOTE (-240))) (|HasCategory| |#4| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#4| (QUOTE (-376))) (|HasCategory| |#4| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#4| (QUOTE (-381))) (|HasCategory| |#4| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#4| (QUOTE (-748))) (|HasCategory| |#4| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#4| (QUOTE (-817))) (|HasCategory| |#4| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#4| (QUOTE (-872))) (|HasCategory| |#4| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#4| (QUOTE (-1081))) (|HasCategory| |#4| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#4| (QUOTE (-1133))) (|HasCategory| |#4| (|%list| (QUOTE -1070) (QUOTE (-560)))))) (|HasCategory| (-560) (QUOTE (-872))) (-12 (|HasCategory| |#4| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#4| (QUOTE (-1081)))) (-4144 (-12 (|HasCategory| |#4| (QUOTE (-1081))) (|HasCategory| |#4| (|%list| (QUOTE -928) (QUOTE (-1209))))) (-12 (|HasCategory| |#4| (QUOTE (-1081))) (|HasCategory| |#4| (|%list| (QUOTE -930) (QUOTE (-1209)))))) (-4144 (-12 (|HasCategory| |#4| (QUOTE (-240))) (|HasCategory| |#4| (QUOTE (-1081)))) (-12 (|HasCategory| |#4| (QUOTE (-239))) (|HasCategory| |#4| (QUOTE (-1081))))) (-12 (|HasCategory| |#4| (QUOTE (-1133))) (|HasCategory| |#4| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-4144 (|HasCategory| |#4| (QUOTE (-1081))) (-12 (|HasCategory| |#4| (QUOTE (-1133))) (|HasCategory| |#4| (|%list| (QUOTE -1070) (QUOTE (-560)))))) (-12 (|HasCategory| |#4| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#4| (QUOTE (-1133)))) (-4144 (|HasAttribute| |#4| (QUOTE -4507)) (-12 (|HasCategory| |#4| (QUOTE (-240))) (|HasCategory| |#4| (QUOTE (-1081)))) (-12 (|HasCategory| |#4| (QUOTE (-1081))) (|HasCategory| |#4| (|%list| (QUOTE -928) (QUOTE (-1209)))))) (-12 (|HasCategory| |#4| (QUOTE (-239))) (|HasCategory| |#4| (QUOTE (-1081)))) (-12 (|HasCategory| |#4| (QUOTE (-1081))) (|HasCategory| |#4| (|%list| (QUOTE -930) (QUOTE (-1209))))) (|HasCategory| |#4| (QUOTE (-175))) (|HasCategory| |#4| (QUOTE (-21))) (|HasCategory| |#4| (QUOTE (-23))) (|HasCategory| |#4| (QUOTE (-133))) (|HasCategory| |#4| (QUOTE (-25))) (|HasCategory| |#4| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#4| (QUOTE (-102))) (-12 (|HasCategory| |#4| (QUOTE (-1133))) (|HasCategory| |#4| (|%list| (QUOTE -321) (|devaluate| |#4|))))) (-260 |n| R S) ((|constructor| (NIL "This constructor provides a direct product of \\spad{R}-modules with an \\spad{R}-module view."))) -((-4507 -4133 (-2522 (|has| |#3| (-1081)) (|has| |#3| (-240))) (|has| |#3| (-6 -4507)) (-2522 (|has| |#3| (-1081)) (|has| |#3| (-928 (-1209))))) (-4504 |has| |#3| (-1081)) (-4505 |has| |#3| (-1081)) (-4510 . T)) -((-4133 (-12 (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-381))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-748))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-817))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-872))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1081))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1133))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|))) (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209)))))) (|HasCategory| |#3| (QUOTE (-376))) (-4133 (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (QUOTE (-1081)))) (-4133 (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (QUOTE (-376)))) (|HasCategory| |#3| (QUOTE (-1081))) (|HasCategory| |#3| (QUOTE (-748))) (|HasCategory| |#3| (QUOTE (-817))) (-4133 (|HasCategory| |#3| (QUOTE (-817))) (|HasCategory| |#3| (QUOTE (-872)))) (|HasCategory| |#3| (QUOTE (-872))) (|HasCategory| |#3| (QUOTE (-381))) (-4133 (-12 (|HasCategory| |#3| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209))))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#3| (QUOTE (-175)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#3| (QUOTE (-240)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#3| (QUOTE (-376)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#3| (QUOTE (-1081))))) (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209)))) (-4133 (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (QUOTE (-1081)))) (|HasCategory| |#3| (QUOTE (-240))) (-4133 (|HasCategory| |#3| (QUOTE (-240))) (-12 (|HasCategory| |#3| (QUOTE (-239))) (|HasCategory| |#3| (QUOTE (-1081))))) (-4133 (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209)))) (-12 (|HasCategory| |#3| (QUOTE (-1081))) (|HasCategory| |#3| (|%list| (QUOTE -930) (QUOTE (-1209)))))) (|HasCategory| |#3| (QUOTE (-1133))) (-4133 (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209))))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-21)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-175)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-240)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-376)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-381)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-748)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-817)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-872)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-1081)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-1133))))) (-4133 (-12 (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-381))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-748))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-817))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-872))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-1081))) (-12 (|HasCategory| |#3| (QUOTE (-1133))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560)))))) (-4133 (-12 (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-381))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-748))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-817))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-872))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-1081))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-1133))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560)))))) (|HasCategory| (-560) (QUOTE (-872))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#3| (QUOTE (-1081)))) (-4133 (-12 (|HasCategory| |#3| (QUOTE (-1081))) (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209))))) (-12 (|HasCategory| |#3| (QUOTE (-1081))) (|HasCategory| |#3| (|%list| (QUOTE -930) (QUOTE (-1209)))))) (-4133 (-12 (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (QUOTE (-1081)))) (-12 (|HasCategory| |#3| (QUOTE (-239))) (|HasCategory| |#3| (QUOTE (-1081))))) (-12 (|HasCategory| |#3| (QUOTE (-1133))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-4133 (|HasCategory| |#3| (QUOTE (-1081))) (-12 (|HasCategory| |#3| (QUOTE (-1133))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560)))))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-1133)))) (-4133 (|HasAttribute| |#3| (QUOTE -4507)) (-12 (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (QUOTE (-1081)))) (-12 (|HasCategory| |#3| (QUOTE (-1081))) (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209)))))) (-12 (|HasCategory| |#3| (QUOTE (-239))) (|HasCategory| |#3| (QUOTE (-1081)))) (-12 (|HasCategory| |#3| (QUOTE (-1081))) (|HasCategory| |#3| (|%list| (QUOTE -930) (QUOTE (-1209))))) (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (QUOTE (-23))) (|HasCategory| |#3| (QUOTE (-133))) (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#3| (QUOTE (-102))) (-12 (|HasCategory| |#3| (QUOTE (-1133))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|))))) +((-4507 -4144 (-2609 (|has| |#3| (-1081)) (|has| |#3| (-240))) (|has| |#3| (-6 -4507)) (-2609 (|has| |#3| (-1081)) (|has| |#3| (-928 (-1209))))) (-4504 |has| |#3| (-1081)) (-4505 |has| |#3| (-1081)) (-4510 . T)) +((-4144 (-12 (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-381))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-748))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-817))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-872))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1081))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1133))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|))) (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209)))))) (|HasCategory| |#3| (QUOTE (-376))) (-4144 (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (QUOTE (-1081)))) (-4144 (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (QUOTE (-376)))) (|HasCategory| |#3| (QUOTE (-1081))) (|HasCategory| |#3| (QUOTE (-748))) (|HasCategory| |#3| (QUOTE (-817))) (-4144 (|HasCategory| |#3| (QUOTE (-817))) (|HasCategory| |#3| (QUOTE (-872)))) (|HasCategory| |#3| (QUOTE (-872))) (|HasCategory| |#3| (QUOTE (-381))) (-4144 (-12 (|HasCategory| |#3| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209))))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#3| (QUOTE (-175)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#3| (QUOTE (-240)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#3| (QUOTE (-376)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#3| (QUOTE (-1081))))) (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209)))) (-4144 (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (QUOTE (-1081)))) (|HasCategory| |#3| (QUOTE (-240))) (-4144 (|HasCategory| |#3| (QUOTE (-240))) (-12 (|HasCategory| |#3| (QUOTE (-239))) (|HasCategory| |#3| (QUOTE (-1081))))) (-4144 (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209)))) (-12 (|HasCategory| |#3| (QUOTE (-1081))) (|HasCategory| |#3| (|%list| (QUOTE -930) (QUOTE (-1209)))))) (|HasCategory| |#3| (QUOTE (-1133))) (-4144 (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209))))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-21)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-175)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-240)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-376)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-381)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-748)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-817)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-872)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-1081)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-1133))))) (-4144 (-12 (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-381))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-748))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-817))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-872))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-1081))) (-12 (|HasCategory| |#3| (QUOTE (-1133))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560)))))) (-4144 (-12 (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-381))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-748))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-817))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-872))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-1081))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-1133))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560)))))) (|HasCategory| (-560) (QUOTE (-872))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#3| (QUOTE (-1081)))) (-4144 (-12 (|HasCategory| |#3| (QUOTE (-1081))) (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209))))) (-12 (|HasCategory| |#3| (QUOTE (-1081))) (|HasCategory| |#3| (|%list| (QUOTE -930) (QUOTE (-1209)))))) (-4144 (-12 (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (QUOTE (-1081)))) (-12 (|HasCategory| |#3| (QUOTE (-239))) (|HasCategory| |#3| (QUOTE (-1081))))) (-12 (|HasCategory| |#3| (QUOTE (-1133))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-4144 (|HasCategory| |#3| (QUOTE (-1081))) (-12 (|HasCategory| |#3| (QUOTE (-1133))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560)))))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-1133)))) (-4144 (|HasAttribute| |#3| (QUOTE -4507)) (-12 (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (QUOTE (-1081)))) (-12 (|HasCategory| |#3| (QUOTE (-1081))) (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209)))))) (-12 (|HasCategory| |#3| (QUOTE (-239))) (|HasCategory| |#3| (QUOTE (-1081)))) (-12 (|HasCategory| |#3| (QUOTE (-1081))) (|HasCategory| |#3| (|%list| (QUOTE -930) (QUOTE (-1209))))) (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (QUOTE (-23))) (|HasCategory| |#3| (QUOTE (-133))) (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#3| (QUOTE (-102))) (-12 (|HasCategory| |#3| (QUOTE (-1133))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|))))) (-261 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} := 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 @@ -1031,7 +1031,7 @@ NIL (-275 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"))) (((-4512 "*") |has| |#1| (-175)) (-4503 |has| |#1| (-571)) (-4508 |has| |#1| (-6 -4508)) (-4505 . T) (-4504 . T) (-4507 . T)) -((|HasCategory| |#1| (QUOTE (-940))) (-4133 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-940)))) (-4133 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-940)))) (-4133 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-940)))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-175))) (-4133 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| |#3| (|%list| (QUOTE -912) (QUOTE (-391))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| |#3| (|%list| (QUOTE -912) (QUOTE (-560))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| |#3| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| |#3| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#3| (|%list| (QUOTE -633) (QUOTE (-549))))) (|HasCategory| |#1| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560)))) (-4133 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560)))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-376))) (|HasAttribute| |#1| (QUOTE -4508)) (|HasCategory| |#1| (QUOTE (-466))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-940)))) (-4133 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-940)))) (|HasCategory| |#1| (QUOTE (-147))))) +((|HasCategory| |#1| (QUOTE (-940))) (-4144 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-940)))) (-4144 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-940)))) (-4144 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-940)))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-175))) (-4144 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| |#3| (|%list| (QUOTE -912) (QUOTE (-391))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| |#3| (|%list| (QUOTE -912) (QUOTE (-560))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| |#3| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| |#3| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#3| (|%list| (QUOTE -633) (QUOTE (-549))))) (|HasCategory| |#1| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560)))) (-4144 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560)))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-376))) (|HasAttribute| |#1| (QUOTE -4508)) (|HasCategory| |#1| (QUOTE (-466))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-940)))) (-4144 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-940)))) (|HasCategory| |#1| (QUOTE (-147))))) (-276 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}.")) (|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 @@ -1076,11 +1076,11 @@ NIL ((|constructor| (NIL "A domain used in the construction of the exterior algebra on a set \\spad{X} over a ring \\spad{R}. This domain represents the set of all ordered subsets of the set \\spad{X},{} assumed to be in correspondance with {1,{}2,{}3,{} ...}. The ordered subsets are themselves ordered lexicographically and are in bijective correspondance with an ordered basis of the exterior algebra. In this domain we are dealing strictly with the exponents of basis elements which can only be 0 or 1. \\blankline The multiplicative identity element of the exterior algebra corresponds to the empty subset of \\spad{X}. A coerce from List Integer to an ordered basis element is provided to allow the convenient input of expressions. Another exported function forgets the ordered structure and simply returns the list corresponding to an ordered subset.")) (|Nul| (($ (|NonNegativeInteger|)) "\\spad{Nul()} gives the basis element 1 for the algebra generated by \\spad{n} generators.")) (|exponents| (((|List| (|Integer|)) $) "\\spad{exponents(x)} converts a domain element into a list of zeros and ones corresponding to the exponents in the basis element that \\spad{x} represents.")) (|degree| (((|NonNegativeInteger|) $) "\\spad{degree(x)} gives the numbers of 1'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's and 1's into a basis element,{} where 1 (respectively 0) designates that the variable of the corresponding index of \\spad{l} is (respectively,{} is not) present. Error: if an element of \\spad{l} is not 0 or 1."))) NIL NIL -(-287 R -4131) +(-287 R -4164) ((|constructor| (NIL "Provides elementary functions over an integral domain.")) (|localReal?| (((|Boolean|) |#2|) "\\spad{localReal?(x)} should be local but conditional")) (|specialTrigs| (((|Union| |#2| "failed") |#2| (|List| (|Record| (|:| |func| |#2|) (|:| |pole| (|Boolean|))))) "\\spad{specialTrigs(x,l)} should be local but conditional")) (|iiacsch| ((|#2| |#2|) "\\spad{iiacsch(x)} should be local but conditional")) (|iiasech| ((|#2| |#2|) "\\spad{iiasech(x)} should be local but conditional")) (|iiacoth| ((|#2| |#2|) "\\spad{iiacoth(x)} should be local but conditional")) (|iiatanh| ((|#2| |#2|) "\\spad{iiatanh(x)} should be local but conditional")) (|iiacosh| ((|#2| |#2|) "\\spad{iiacosh(x)} should be local but conditional")) (|iiasinh| ((|#2| |#2|) "\\spad{iiasinh(x)} should be local but conditional")) (|iicsch| ((|#2| |#2|) "\\spad{iicsch(x)} should be local but conditional")) (|iisech| ((|#2| |#2|) "\\spad{iisech(x)} should be local but conditional")) (|iicoth| ((|#2| |#2|) "\\spad{iicoth(x)} should be local but conditional")) (|iitanh| ((|#2| |#2|) "\\spad{iitanh(x)} should be local but conditional")) (|iicosh| ((|#2| |#2|) "\\spad{iicosh(x)} should be local but conditional")) (|iisinh| ((|#2| |#2|) "\\spad{iisinh(x)} should be local but conditional")) (|iiacsc| ((|#2| |#2|) "\\spad{iiacsc(x)} should be local but conditional")) (|iiasec| ((|#2| |#2|) "\\spad{iiasec(x)} should be local but conditional")) (|iiacot| ((|#2| |#2|) "\\spad{iiacot(x)} should be local but conditional")) (|iiatan| ((|#2| |#2|) "\\spad{iiatan(x)} should be local but conditional")) (|iiacos| ((|#2| |#2|) "\\spad{iiacos(x)} should be local but conditional")) (|iiasin| ((|#2| |#2|) "\\spad{iiasin(x)} should be local but conditional")) (|iicsc| ((|#2| |#2|) "\\spad{iicsc(x)} should be local but conditional")) (|iisec| ((|#2| |#2|) "\\spad{iisec(x)} should be local but conditional")) (|iicot| ((|#2| |#2|) "\\spad{iicot(x)} should be local but conditional")) (|iitan| ((|#2| |#2|) "\\spad{iitan(x)} should be local but conditional")) (|iicos| ((|#2| |#2|) "\\spad{iicos(x)} should be local but conditional")) (|iisin| ((|#2| |#2|) "\\spad{iisin(x)} should be local but conditional")) (|iilog| ((|#2| |#2|) "\\spad{iilog(x)} should be local but conditional")) (|iiexp| ((|#2| |#2|) "\\spad{iiexp(x)} should be local but conditional")) (|iisqrt3| ((|#2|) "\\spad{iisqrt3()} should be local but conditional")) (|iisqrt2| ((|#2|) "\\spad{iisqrt2()} should be local but conditional")) (|operator| (((|BasicOperator|) (|BasicOperator|)) "\\spad{operator(p)} returns an elementary operator with the same symbol as \\spad{p}")) (|belong?| (((|Boolean|) (|BasicOperator|)) "\\spad{belong?(p)} returns \\spad{true} if operator \\spad{p} is elementary")) (|pi| ((|#2|) "\\spad{pi()} returns the \\spad{pi} operator")) (|acsch| ((|#2| |#2|) "\\spad{acsch(x)} applies the inverse hyperbolic cosecant operator to \\spad{x}")) (|asech| ((|#2| |#2|) "\\spad{asech(x)} applies the inverse hyperbolic secant operator to \\spad{x}")) (|acoth| ((|#2| |#2|) "\\spad{acoth(x)} applies the inverse hyperbolic cotangent operator to \\spad{x}")) (|atanh| ((|#2| |#2|) "\\spad{atanh(x)} applies the inverse hyperbolic tangent operator to \\spad{x}")) (|acosh| ((|#2| |#2|) "\\spad{acosh(x)} applies the inverse hyperbolic cosine operator to \\spad{x}")) (|asinh| ((|#2| |#2|) "\\spad{asinh(x)} applies the inverse hyperbolic sine operator to \\spad{x}")) (|csch| ((|#2| |#2|) "\\spad{csch(x)} applies the hyperbolic cosecant operator to \\spad{x}")) (|sech| ((|#2| |#2|) "\\spad{sech(x)} applies the hyperbolic secant operator to \\spad{x}")) (|coth| ((|#2| |#2|) "\\spad{coth(x)} applies the hyperbolic cotangent operator to \\spad{x}")) (|tanh| ((|#2| |#2|) "\\spad{tanh(x)} applies the hyperbolic tangent operator to \\spad{x}")) (|cosh| ((|#2| |#2|) "\\spad{cosh(x)} applies the hyperbolic cosine operator to \\spad{x}")) (|sinh| ((|#2| |#2|) "\\spad{sinh(x)} applies the hyperbolic sine operator to \\spad{x}")) (|acsc| ((|#2| |#2|) "\\spad{acsc(x)} applies the inverse cosecant operator to \\spad{x}")) (|asec| ((|#2| |#2|) "\\spad{asec(x)} applies the inverse secant operator to \\spad{x}")) (|acot| ((|#2| |#2|) "\\spad{acot(x)} applies the inverse cotangent operator to \\spad{x}")) (|atan| ((|#2| |#2|) "\\spad{atan(x)} applies the inverse tangent operator to \\spad{x}")) (|acos| ((|#2| |#2|) "\\spad{acos(x)} applies the inverse cosine operator to \\spad{x}")) (|asin| ((|#2| |#2|) "\\spad{asin(x)} applies the inverse sine operator to \\spad{x}")) (|csc| ((|#2| |#2|) "\\spad{csc(x)} applies the cosecant operator to \\spad{x}")) (|sec| ((|#2| |#2|) "\\spad{sec(x)} applies the secant operator to \\spad{x}")) (|cot| ((|#2| |#2|) "\\spad{cot(x)} applies the cotangent operator to \\spad{x}")) (|tan| ((|#2| |#2|) "\\spad{tan(x)} applies the tangent operator to \\spad{x}")) (|cos| ((|#2| |#2|) "\\spad{cos(x)} applies the cosine operator to \\spad{x}")) (|sin| ((|#2| |#2|) "\\spad{sin(x)} applies the sine operator to \\spad{x}")) (|log| ((|#2| |#2|) "\\spad{log(x)} applies the logarithm operator to \\spad{x}")) (|exp| ((|#2| |#2|) "\\spad{exp(x)} applies the exponential operator to \\spad{x}"))) NIL NIL -(-288 R -4131) +(-288 R -4164) ((|constructor| (NIL "ElementaryFunctionStructurePackage provides functions to test the algebraic independence of various elementary functions,{} using the Risch structure theorem (real and complex versions). It also provides transformations on elementary functions which are not considered simplifications.")) (|tanQ| ((|#2| (|Fraction| (|Integer|)) |#2|) "\\spad{tanQ(q,a)} is a local function with a conditional implementation.")) (|rootNormalize| ((|#2| |#2| (|Kernel| |#2|)) "\\spad{rootNormalize(f, k)} returns \\spad{f} rewriting either \\spad{k} which must be an \\spad{n}th-root in terms of radicals already in \\spad{f},{} or some radicals in \\spad{f} in terms of \\spad{k}.")) (|validExponential| (((|Union| |#2| "failed") (|List| (|Kernel| |#2|)) |#2| (|Symbol|)) "\\spad{validExponential([k1,...,kn],f,x)} returns \\spad{g} if \\spad{exp(f)=g} and \\spad{g} involves only \\spad{k1...kn},{} and \"failed\" otherwise.")) (|realElementary| ((|#2| |#2| (|Symbol|)) "\\spad{realElementary(f,x)} rewrites the kernels of \\spad{f} involving \\spad{x} in terms of the 4 fundamental real transcendental elementary functions: \\spad{log, exp, tan, atan}.") ((|#2| |#2|) "\\spad{realElementary(f)} rewrites \\spad{f} in terms of the 4 fundamental real transcendental elementary functions: \\spad{log, exp, tan, atan}.")) (|rischNormalize| (((|Record| (|:| |func| |#2|) (|:| |kers| (|List| (|Kernel| |#2|))) (|:| |vals| (|List| |#2|))) |#2| (|Symbol|)) "\\spad{rischNormalize(f, x)} returns \\spad{[g, [k1,...,kn], [h1,...,hn]]} such that \\spad{g = normalize(f, x)} and each \\spad{ki} was rewritten as \\spad{hi} during the normalization.")) (|normalize| ((|#2| |#2| (|Symbol|)) "\\spad{normalize(f, x)} rewrites \\spad{f} using the least possible number of real algebraically independent kernels involving \\spad{x}.") ((|#2| |#2|) "\\spad{normalize(f)} rewrites \\spad{f} using the least possible number of real algebraically independent kernels."))) NIL NIL @@ -1132,7 +1132,7 @@ NIL ((|constructor| (NIL "An eltable aggregate is one which can be viewed as a function. For example,{} the list \\axiom{[1,{}7,{}4]} can applied to 0,{}1,{} and 2 respectively will return the integers 1,{}7,{} and 4; thus this list may be viewed as mapping 0 to 1,{} 1 to 7 and 2 to 4. In general,{} an aggregate can map members of a domain {\\em Dom} to an image domain {\\em Im}.")) (|qsetelt!| ((|#2| $ |#1| |#2|) "\\spad{qsetelt!(u,x,y)} sets the image of \\axiom{\\spad{x}} to be \\axiom{\\spad{y}} under \\axiom{\\spad{u}},{} without checking that \\axiom{\\spad{x}} is in the domain of \\axiom{\\spad{u}}. If such a check is required use the function \\axiom{setelt}.")) (|setelt| ((|#2| $ |#1| |#2|) "\\spad{setelt(u,x,y)} sets the image of \\spad{x} to be \\spad{y} under \\spad{u},{} assuming \\spad{x} is in the domain of \\spad{u}. Error: if \\spad{x} is not in the domain of \\spad{u}.")) (|qelt| ((|#2| $ |#1|) "\\spad{qelt(u, x)} applies \\axiom{\\spad{u}} to \\axiom{\\spad{x}} without checking whether \\axiom{\\spad{x}} is in the domain of \\axiom{\\spad{u}}. If \\axiom{\\spad{x}} is not in the domain of \\axiom{\\spad{u}} a memory-access violation may occur. If a check on whether \\axiom{\\spad{x}} is in the domain of \\axiom{\\spad{u}} is required,{} use the function \\axiom{elt}.")) (|elt| ((|#2| $ |#1| |#2|) "\\spad{elt(u, x, y)} applies \\spad{u} to \\spad{x} if \\spad{x} is in the domain of \\spad{u},{} and returns \\spad{y} otherwise. For example,{} if \\spad{u} is a polynomial in \\axiom{\\spad{x}} over the rationals,{} \\axiom{elt(\\spad{u},{}\\spad{n},{}0)} may define the coefficient of \\axiom{\\spad{x}} to the power \\spad{n},{} returning 0 when \\spad{n} is out of range."))) NIL NIL -(-301 S R |Mod| -1740 -2237 |exactQuo|) +(-301 S R |Mod| -2386 -2834 |exactQuo|) ((|constructor| (NIL "These domains are used for the factorization and gcds of univariate polynomials over the integers in order to work modulo different primes. See \\spadtype{ModularRing},{} \\spadtype{ModularField}")) (|inv| (($ $) "\\spad{inv(x)} \\undocumented")) (|recip| (((|Union| $ "failed") $) "\\spad{recip(x)} \\undocumented")) (|exQuo| (((|Union| $ "failed") $ $) "\\spad{exQuo(x,y)} \\undocumented")) (|reduce| (($ |#2| |#3|) "\\spad{reduce(r,m)} \\undocumented")) (|coerce| ((|#2| $) "\\spad{coerce(x)} \\undocumented")) (|modulus| ((|#3| $) "\\spad{modulus(x)} \\undocumented"))) ((-4503 . T) ((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) NIL @@ -1150,8 +1150,8 @@ NIL NIL (-305 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 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 \\spad{e1} and \\spad{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."))) -((-4507 -4133 (|has| |#1| (-1081)) (|has| |#1| (-487))) (-4504 |has| |#1| (-1081)) (-4505 |has| |#1| (-1081))) -((|HasCategory| |#1| (QUOTE (-376))) (-4133 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-1081)))) (-4133 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-1081))) (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (-4133 (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-1081)))) (-4133 (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-1081)))) (-4133 (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-1081)))) (-4133 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-1081)))) (-4133 (|HasCategory| |#1| (QUOTE (-487))) (|HasCategory| |#1| (QUOTE (-748)))) (|HasCategory| |#1| (QUOTE (-487))) (-4133 (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-487))) (|HasCategory| |#1| (QUOTE (-748))) (|HasCategory| |#1| (QUOTE (-1081))) (|HasCategory| |#1| (QUOTE (-1144))) (|HasCategory| |#1| (QUOTE (-1133)))) (-4133 (|HasCategory| |#1| (QUOTE (-487))) (|HasCategory| |#1| (QUOTE (-748))) (|HasCategory| |#1| (QUOTE (-1144)))) (|HasCategory| |#1| (|%list| (QUOTE -528) (QUOTE (-1209)) (|devaluate| |#1|))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-310))) (-4133 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-487)))) (-4133 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-748)))) (-4133 (|HasCategory| |#1| (QUOTE (-487))) (|HasCategory| |#1| (QUOTE (-1081)))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-1144))) (|HasCategory| |#1| (QUOTE (-748)))) +((-4507 -4144 (|has| |#1| (-1081)) (|has| |#1| (-487))) (-4504 |has| |#1| (-1081)) (-4505 |has| |#1| (-1081))) +((|HasCategory| |#1| (QUOTE (-376))) (-4144 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-1081)))) (-4144 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-1081))) (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (-4144 (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-1081)))) (-4144 (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-1081)))) (-4144 (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-1081)))) (-4144 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-1081)))) (-4144 (|HasCategory| |#1| (QUOTE (-487))) (|HasCategory| |#1| (QUOTE (-748)))) (|HasCategory| |#1| (QUOTE (-487))) (-4144 (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-487))) (|HasCategory| |#1| (QUOTE (-748))) (|HasCategory| |#1| (QUOTE (-1081))) (|HasCategory| |#1| (QUOTE (-1144))) (|HasCategory| |#1| (QUOTE (-1133)))) (-4144 (|HasCategory| |#1| (QUOTE (-487))) (|HasCategory| |#1| (QUOTE (-748))) (|HasCategory| |#1| (QUOTE (-1144)))) (|HasCategory| |#1| (|%list| (QUOTE -528) (QUOTE (-1209)) (|devaluate| |#1|))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-310))) (-4144 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-487)))) (-4144 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-748)))) (-4144 (|HasCategory| |#1| (QUOTE (-487))) (|HasCategory| |#1| (QUOTE (-1081)))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-1144))) (|HasCategory| |#1| (QUOTE (-748)))) (-306 S R) ((|constructor| (NIL "This package provides operations for mapping the sides of equations.")) (|map| (((|Equation| |#2|) (|Mapping| |#2| |#1|) (|Equation| |#1|)) "\\spad{map(f,eq)} returns an equation where \\spad{f} is applied to the sides of \\spad{eq}"))) NIL @@ -1159,7 +1159,7 @@ NIL (-307 |Key| |Entry|) ((|constructor| (NIL "This domain provides tables where the keys are compared using \\spadfun{eq?}. Thus keys are considered equal only if they are the same instance of a structure."))) ((-4510 . T) (-4511 . T)) -((-12 (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-1133))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -1580) (|devaluate| |#1|)) (|%list| (QUOTE |:|) (QUOTE -3432) (|devaluate| |#2|)))))) (-4133 (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-1133))) (|HasCategory| |#2| (QUOTE (-1133)))) (-4133 (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-1133))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-1133)))) (-4133 (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-1133))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (|%list| (QUOTE -633) (QUOTE (-549)))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-1133))) (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#2| (QUOTE (-1133))) (-4133 (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888))))) (-4133 (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-102)))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-102)))) +((-12 (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-1133))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -2118) (|devaluate| |#1|)) (|%list| (QUOTE |:|) (QUOTE -3964) (|devaluate| |#2|)))))) (-4144 (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-1133))) (|HasCategory| |#2| (QUOTE (-1133)))) (-4144 (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-1133))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-1133)))) (-4144 (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-1133))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (|%list| (QUOTE -633) (QUOTE (-549)))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-1133))) (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#2| (QUOTE (-1133))) (-4144 (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888))))) (-4144 (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-102)))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-102)))) (-308) ((|constructor| (NIL "ErrorFunctions implements error functions callable from the system interpreter. Typically,{} these functions would be called in user functions. The simple forms of the functions take one argument which is either a string (an error message) or a list of strings which all together make up a message. The list can contain formatting codes (see below). The more sophisticated versions takes two arguments where the first argument is the name of the function from which the error was invoked and the second argument is either a string or a list of strings,{} as above. When you use the one argument version in an interpreter function,{} the system will automatically insert the name of the function as the new first argument. Thus in the user interpreter function \\indented{2}{\\spad{f x == if x < 0 then error \"negative argument\" else x}} the call to error will actually be of the form \\indented{2}{\\spad{error(\"f\",\"negative argument\")}} because the interpreter will have created a new first argument. \\blankline Formatting codes: error messages may contain the following formatting codes (they should either start or end a string or else have blanks around them): \\indented{3}{\\spad{\\%l}\\space{6}start a new line} \\indented{3}{\\spad{\\%b}\\space{6}start printing in a bold font (where available)} \\indented{3}{\\spad{\\%d}\\space{6}stop\\space{2}printing in a bold font (where available)} \\indented{3}{\\spad{ \\%ceon}\\space{2}start centering message lines} \\indented{3}{\\spad{\\%ceoff}\\space{2}stop\\space{2}centering message lines} \\indented{3}{\\spad{\\%rjon}\\space{3}start displaying lines \"ragged left\"} \\indented{3}{\\spad{\\%rjoff}\\space{2}stop\\space{2}displaying lines \"ragged left\"} \\indented{3}{\\spad{\\%i}\\space{6}indent\\space{3}following lines 3 additional spaces} \\indented{3}{\\spad{\\%u}\\space{6}unindent following lines 3 additional spaces} \\indented{3}{\\spad{\\%xN}\\space{5}insert \\spad{N} blanks (eg,{} \\spad{\\%x10} inserts 10 blanks)} \\blankline")) (|error| (((|Exit|) (|String|) (|List| (|String|))) "\\spad{error(nam,lmsg)} displays error messages \\spad{lmsg} preceded by a message containing the name \\spad{nam} of the function in which the error is contained.") (((|Exit|) (|String|) (|String|)) "\\spad{error(nam,msg)} displays error message \\spad{msg} preceded by a message containing the name \\spad{nam} of the function in which the error is contained.") (((|Exit|) (|List| (|String|))) "\\spad{error(lmsg)} displays error message \\spad{lmsg} and terminates.") (((|Exit|) (|String|)) "\\spad{error(msg)} displays error message \\spad{msg} and terminates."))) NIL @@ -1172,11 +1172,11 @@ NIL ((|constructor| (NIL "An expression space is a set which is closed under certain operators.")) (|odd?| (((|Boolean|) $) "\\spad{odd? x} is \\spad{true} if \\spad{x} is an odd integer.")) (|even?| (((|Boolean|) $) "\\spad{even? x} is \\spad{true} if \\spad{x} is an even integer.")) (|definingPolynomial| (($ $) "\\spad{definingPolynomial(x)} returns an expression \\spad{p} such that \\spad{p(x) = 0}.")) (|minPoly| (((|SparseUnivariatePolynomial| $) (|Kernel| $)) "\\spad{minPoly(k)} returns \\spad{p} such that \\spad{p(k) = 0}.")) (|eval| (($ $ (|BasicOperator|) (|Mapping| $ $)) "\\spad{eval(x, s, f)} replaces every \\spad{s(a)} in \\spad{x} by \\spad{f(a)} for any \\spad{a}.") (($ $ (|BasicOperator|) (|Mapping| $ (|List| $))) "\\spad{eval(x, s, f)} replaces every \\spad{s(a1,..,am)} in \\spad{x} by \\spad{f(a1,..,am)} for any \\spad{a1},{}...,{}\\spad{am}.") (($ $ (|List| (|BasicOperator|)) (|List| (|Mapping| $ (|List| $)))) "\\spad{eval(x, [s1,...,sm], [f1,...,fm])} replaces every \\spad{si(a1,...,an)} in \\spad{x} by \\spad{fi(a1,...,an)} for any \\spad{a1},{}...,{}\\spad{an}.") (($ $ (|List| (|BasicOperator|)) (|List| (|Mapping| $ $))) "\\spad{eval(x, [s1,...,sm], [f1,...,fm])} replaces every \\spad{si(a)} in \\spad{x} by \\spad{fi(a)} for any \\spad{a}.") (($ $ (|Symbol|) (|Mapping| $ $)) "\\spad{eval(x, s, f)} replaces every \\spad{s(a)} in \\spad{x} by \\spad{f(a)} for any \\spad{a}.") (($ $ (|Symbol|) (|Mapping| $ (|List| $))) "\\spad{eval(x, s, f)} replaces every \\spad{s(a1,..,am)} in \\spad{x} by \\spad{f(a1,..,am)} for any \\spad{a1},{}...,{}\\spad{am}.") (($ $ (|List| (|Symbol|)) (|List| (|Mapping| $ (|List| $)))) "\\spad{eval(x, [s1,...,sm], [f1,...,fm])} replaces every \\spad{si(a1,...,an)} in \\spad{x} by \\spad{fi(a1,...,an)} for any \\spad{a1},{}...,{}\\spad{an}.") (($ $ (|List| (|Symbol|)) (|List| (|Mapping| $ $))) "\\spad{eval(x, [s1,...,sm], [f1,...,fm])} replaces every \\spad{si(a)} in \\spad{x} by \\spad{fi(a)} for any \\spad{a}.")) (|freeOf?| (((|Boolean|) $ (|Symbol|)) "\\spad{freeOf?(x, s)} tests if \\spad{x} does not contain any operator whose name is \\spad{s}.") (((|Boolean|) $ $) "\\spad{freeOf?(x, y)} tests if \\spad{x} does not contain any occurrence of \\spad{y},{} where \\spad{y} is a single kernel.")) (|map| (($ (|Mapping| $ $) (|Kernel| $)) "\\spad{map(f, k)} returns \\spad{op(f(x1),...,f(xn))} where \\spad{k = op(x1,...,xn)}.")) (|kernel| (($ (|BasicOperator|) (|List| $)) "\\spad{kernel(op, [f1,...,fn])} constructs \\spad{op(f1,...,fn)} without evaluating it.") (($ (|BasicOperator|) $) "\\spad{kernel(op, x)} constructs \\spad{op}(\\spad{x}) without evaluating it.")) (|is?| (((|Boolean|) $ (|Symbol|)) "\\spad{is?(x, s)} tests if \\spad{x} is a kernel and is the name of its operator is \\spad{s}.") (((|Boolean|) $ (|BasicOperator|)) "\\spad{is?(x, op)} tests if \\spad{x} is a kernel and is its operator is op.")) (|belong?| (((|Boolean|) (|BasicOperator|)) "\\spad{belong?(op)} tests if \\% accepts \\spad{op} as applicable to its elements.")) (|operator| (((|BasicOperator|) (|BasicOperator|)) "\\spad{operator(op)} returns a copy of \\spad{op} with the domain-dependent properties appropriate for \\%.")) (|operators| (((|List| (|BasicOperator|)) $) "\\spad{operators(f)} returns all the basic operators appearing in \\spad{f},{} no matter what their levels are.")) (|tower| (((|List| (|Kernel| $)) $) "\\spad{tower(f)} returns all the kernels appearing in \\spad{f},{} no matter what their levels are.")) (|kernels| (((|List| (|Kernel| $)) $) "\\spad{kernels(f)} returns the list of all the top-level kernels appearing in \\spad{f},{} but not the ones appearing in the arguments of the top-level kernels.")) (|mainKernel| (((|Union| (|Kernel| $) "failed") $) "\\spad{mainKernel(f)} returns a kernel of \\spad{f} with maximum nesting level,{} or if \\spad{f} has no kernels (\\spadignore{i.e.} \\spad{f} is a constant).")) (|height| (((|NonNegativeInteger|) $) "\\spad{height(f)} returns the highest nesting level appearing in \\spad{f}. Constants have height 0. Symbols have height 1. For any operator op and expressions \\spad{f1},{}...,{}fn,{} \\spad{op(f1,...,fn)} has height equal to \\spad{1 + max(height(f1),...,height(fn))}.")) (|distribute| (($ $ $) "\\spad{distribute(f, g)} expands all the kernels in \\spad{f} that contain \\spad{g} in their arguments and that are formally enclosed by a \\spadfunFrom{box}{ExpressionSpace} or a \\spadfunFrom{paren}{ExpressionSpace} expression.") (($ $) "\\spad{distribute(f)} expands all the kernels in \\spad{f} that are formally enclosed by a \\spadfunFrom{box}{ExpressionSpace} or \\spadfunFrom{paren}{ExpressionSpace} expression.")) (|paren| (($ (|List| $)) "\\spad{paren([f1,...,fn])} returns \\spad{(f1,...,fn)}. This prevents the \\spad{fi} from being evaluated when operators are applied to them,{} and makes them applicable to a unary operator. For example,{} \\spad{atan(paren [x, 2])} returns the formal kernel \\spad{atan((x, 2))}.") (($ $) "\\spad{paren(f)} returns (\\spad{f}). This prevents \\spad{f} from being evaluated when operators are applied to it. For example,{} \\spad{log(1)} returns 0,{} but \\spad{log(paren 1)} returns the formal kernel log((1)).")) (|box| (($ (|List| $)) "\\spad{box([f1,...,fn])} returns \\spad{(f1,...,fn)} with a 'box' around them that prevents the \\spad{fi} from being evaluated when operators are applied to them,{} and makes them applicable to a unary operator. For example,{} \\spad{atan(box [x, 2])} returns the formal kernel \\spad{atan(x, 2)}.") (($ $) "\\spad{box(f)} returns \\spad{f} with a 'box' around it that prevents \\spad{f} from being evaluated when operators are applied to it. For example,{} \\spad{log(1)} returns 0,{} but \\spad{log(box 1)} returns the formal kernel log(1).")) (|subst| (($ $ (|List| (|Kernel| $)) (|List| $)) "\\spad{subst(f, [k1...,kn], [g1,...,gn])} replaces the kernels \\spad{k1},{}...,{}kn by \\spad{g1},{}...,{}gn formally in \\spad{f}.") (($ $ (|List| (|Equation| $))) "\\spad{subst(f, [k1 = g1,...,kn = gn])} replaces the kernels \\spad{k1},{}...,{}kn by \\spad{g1},{}...,{}gn formally in \\spad{f}.") (($ $ (|Equation| $)) "\\spad{subst(f, k = g)} replaces the kernel \\spad{k} by \\spad{g} formally in \\spad{f}.")) (|elt| (($ (|BasicOperator|) (|List| $)) "\\spad{elt(op,[x1,...,xn])} or \\spad{op}([\\spad{x1},{}...,{}xn]) applies the \\spad{n}-ary operator \\spad{op} to \\spad{x1},{}...,{}xn.") (($ (|BasicOperator|) $ $ $ $) "\\spad{elt(op,x,y,z,t)} or \\spad{op}(\\spad{x},{} \\spad{y},{} \\spad{z},{} \\spad{t}) applies the 4-ary operator \\spad{op} to \\spad{x},{} \\spad{y},{} \\spad{z} and \\spad{t}.") (($ (|BasicOperator|) $ $ $) "\\spad{elt(op,x,y,z)} or \\spad{op}(\\spad{x},{} \\spad{y},{} \\spad{z}) applies the ternary operator \\spad{op} to \\spad{x},{} \\spad{y} and \\spad{z}.") (($ (|BasicOperator|) $ $) "\\spad{elt(op,x,y)} or \\spad{op}(\\spad{x},{} \\spad{y}) applies the binary operator \\spad{op} to \\spad{x} and \\spad{y}.") (($ (|BasicOperator|) $) "\\spad{elt(op,x)} or \\spad{op}(\\spad{x}) applies the unary operator \\spad{op} to \\spad{x}."))) NIL NIL -(-311 -4131 S) +(-311 -4164 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 -(-312 E -4131) +(-312 E -4164) ((|constructor| (NIL "This package allows a mapping \\spad{E} -> \\spad{F} to be lifted to a kernel over \\spad{E}; This lifting can fail if the operator of the kernel cannot be applied in \\spad{F}; Do not use this package with \\spad{E} = \\spad{F},{} since this may drop some properties of the operators.")) (|map| ((|#2| (|Mapping| |#2| |#1|) (|Kernel| |#1|)) "\\spad{map(f, k)} returns \\spad{g = op(f(a1),...,f(an))} where \\spad{k = op(a1,...,an)}."))) NIL NIL @@ -1216,7 +1216,7 @@ NIL ((|constructor| (NIL "This category provides \\spadfun{eval} operations. A domain may belong to this category if it is possible to make ``evaluation'' substitutions.")) (|eval| (($ $ (|List| (|Equation| |#1|))) "\\spad{eval(f, [x1 = v1,...,xn = vn])} replaces \\spad{xi} by \\spad{vi} in \\spad{f}.") (($ $ (|Equation| |#1|)) "\\spad{eval(f,x = v)} replaces \\spad{x} by \\spad{v} in \\spad{f}."))) NIL NIL -(-322 -4131) +(-322 -4164) ((|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 @@ -1231,11 +1231,11 @@ NIL (-325 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))}."))) ((-4502 . T) (-4508 . T) (-4503 . T) ((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) -((|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (QUOTE (-940))) (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -1070) (QUOTE (-1209)))) (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (QUOTE (-147))) (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (QUOTE (-149))) (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (QUOTE (-1052))) (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (QUOTE (-844))) (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (QUOTE (-872))) (-4133 (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (QUOTE (-844))) (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (QUOTE (-872)))) (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (QUOTE (-1184))) (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (QUOTE (-239))) (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (QUOTE (-240))) (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -528) (QUOTE (-1209)) (|%list| (QUOTE -1286) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#4|)))) (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -321) (|%list| (QUOTE -1286) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#4|)))) (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -298) (|%list| (QUOTE -1286) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#4|)) (|%list| (QUOTE -1286) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#4|)))) (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (QUOTE (-319))) (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (QUOTE (-559))) (-12 (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (QUOTE (-940))) (|HasCategory| $ (QUOTE (-147)))) (-4133 (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (QUOTE (-147))) (-12 (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (QUOTE (-940))) (|HasCategory| $ (QUOTE (-147)))))) +((|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (QUOTE (-940))) (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -1070) (QUOTE (-1209)))) (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (QUOTE (-147))) (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (QUOTE (-149))) (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (QUOTE (-1052))) (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (QUOTE (-844))) (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (QUOTE (-872))) (-4144 (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (QUOTE (-844))) (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (QUOTE (-872)))) (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (QUOTE (-1184))) (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (QUOTE (-239))) (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (QUOTE (-240))) (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -528) (QUOTE (-1209)) (|%list| (QUOTE -1286) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#4|)))) (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -321) (|%list| (QUOTE -1286) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#4|)))) (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (|%list| (QUOTE -298) (|%list| (QUOTE -1286) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#4|)) (|%list| (QUOTE -1286) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#4|)))) (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (QUOTE (-319))) (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (QUOTE (-559))) (-12 (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (QUOTE (-940))) (|HasCategory| $ (QUOTE (-147)))) (-4144 (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (QUOTE (-147))) (-12 (|HasCategory| (-1286 |#1| |#2| |#3| |#4|) (QUOTE (-940))) (|HasCategory| $ (QUOTE (-147)))))) (-326 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."))) -((-4507 -4133 (-12 (|has| |#1| (-571)) (-4133 (|has| |#1| (-1081)) (|has| |#1| (-487)))) (|has| |#1| (-1081)) (|has| |#1| (-487))) (-4505 |has| |#1| (-175)) (-4504 |has| |#1| (-175)) ((-4512 "*") |has| |#1| (-571)) (-4503 |has| |#1| (-571)) (-4508 |has| |#1| (-571)) (-4502 |has| |#1| (-571))) -((-4133 (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (-12 (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560)))))) (|HasCategory| |#1| (QUOTE (-571))) (-4133 (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-1081)))) (|HasCategory| |#1| (QUOTE (-21))) (-4133 (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-571)))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-4133 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-1081)))) (|HasCategory| |#1| (QUOTE (-1081))) (-4133 (-12 (|HasCategory| |#1| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-147)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-149)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-175)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-571)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-1081))))) (-4133 (|HasCategory| |#1| (QUOTE (-487))) (|HasCategory| |#1| (QUOTE (-1144)))) (|HasCategory| |#1| (QUOTE (-487))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549)))) (-4133 (|HasCategory| |#1| (QUOTE (-1081))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (-12 (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-4133 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-1081)))) (-4133 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-1081)))) (-4133 (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-1081)))) (-12 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-571)))) (-4133 (|HasCategory| |#1| (QUOTE (-487))) (|HasCategory| |#1| (QUOTE (-571)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-1081)))) (-4133 (-12 (|HasCategory| |#1| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-1081)))) (|HasCategory| |#1| (QUOTE (-21)))) (-4133 (-12 (|HasCategory| |#1| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-1081)))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-1144)))) (-4133 (-12 (|HasCategory| |#1| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-1081)))) (|HasCategory| |#1| (QUOTE (-25)))) (-4133 (|HasCategory| |#1| (QUOTE (-487))) (|HasCategory| |#1| (QUOTE (-1081)))) (-4133 (-12 (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-571)))) (-12 (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560)))))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-1144))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| $ (QUOTE (-1081))) (|HasCategory| $ (|%list| (QUOTE -1070) (QUOTE (-560))))) +((-4507 -4144 (-12 (|has| |#1| (-571)) (-4144 (|has| |#1| (-1081)) (|has| |#1| (-487)))) (|has| |#1| (-1081)) (|has| |#1| (-487))) (-4505 |has| |#1| (-175)) (-4504 |has| |#1| (-175)) ((-4512 "*") |has| |#1| (-571)) (-4503 |has| |#1| (-571)) (-4508 |has| |#1| (-571)) (-4502 |has| |#1| (-571))) +((-4144 (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (-12 (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560)))))) (|HasCategory| |#1| (QUOTE (-571))) (-4144 (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-1081)))) (|HasCategory| |#1| (QUOTE (-21))) (-4144 (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-571)))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-4144 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-1081)))) (|HasCategory| |#1| (QUOTE (-1081))) (-4144 (-12 (|HasCategory| |#1| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-147)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-149)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-175)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-571)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-1081))))) (-4144 (|HasCategory| |#1| (QUOTE (-487))) (|HasCategory| |#1| (QUOTE (-1144)))) (|HasCategory| |#1| (QUOTE (-487))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549)))) (-4144 (|HasCategory| |#1| (QUOTE (-1081))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (-12 (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-4144 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-1081)))) (-4144 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-1081)))) (-4144 (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-1081)))) (-12 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-571)))) (-4144 (|HasCategory| |#1| (QUOTE (-487))) (|HasCategory| |#1| (QUOTE (-571)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-1081)))) (-4144 (-12 (|HasCategory| |#1| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-1081)))) (|HasCategory| |#1| (QUOTE (-21)))) (-4144 (-12 (|HasCategory| |#1| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-1081)))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-1144)))) (-4144 (-12 (|HasCategory| |#1| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-1081)))) (|HasCategory| |#1| (QUOTE (-25)))) (-4144 (|HasCategory| |#1| (QUOTE (-487))) (|HasCategory| |#1| (QUOTE (-1081)))) (-4144 (-12 (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-571)))) (-12 (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560)))))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-1144))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| $ (QUOTE (-1081))) (|HasCategory| $ (|%list| (QUOTE -1070) (QUOTE (-560))))) (-327 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 @@ -1244,7 +1244,7 @@ NIL ((|constructor| (NIL "This package provides functions to convert functional expressions to power series.")) (|series| (((|Any|) |#2| (|Equation| |#2|) (|Fraction| (|Integer|))) "\\spad{series(f,x = a,n)} expands the expression \\spad{f} as a series in powers of (\\spad{x} - a); terms will be computed up to order at least \\spad{n}.") (((|Any|) |#2| (|Equation| |#2|)) "\\spad{series(f,x = a)} expands the expression \\spad{f} as a series in powers of (\\spad{x} - a).") (((|Any|) |#2| (|Fraction| (|Integer|))) "\\spad{series(f,n)} returns a series expansion of the expression \\spad{f}. Note: \\spad{f} should have only one variable; the series will be expanded in powers of that variable and terms will be computed up to order at least \\spad{n}.") (((|Any|) |#2|) "\\spad{series(f)} returns a series expansion of the expression \\spad{f}. Note: \\spad{f} should have only one variable; the series will be expanded in powers of that variable.") (((|Any|) (|Symbol|)) "\\spad{series(x)} returns \\spad{x} viewed as a series.")) (|puiseux| (((|Any|) |#2| (|Equation| |#2|) (|Fraction| (|Integer|))) "\\spad{puiseux(f,x = a,n)} expands the expression \\spad{f} as a Puiseux series in powers of \\spad{(x - a)}; terms will be computed up to order at least \\spad{n}.") (((|Any|) |#2| (|Equation| |#2|)) "\\spad{puiseux(f,x = a)} expands the expression \\spad{f} as a Puiseux series in powers of \\spad{(x - a)}.") (((|Any|) |#2| (|Fraction| (|Integer|))) "\\spad{puiseux(f,n)} returns a Puiseux expansion of the expression \\spad{f}. Note: \\spad{f} should have only one variable; the series will be expanded in powers of that variable and terms will be computed up to order at least \\spad{n}.") (((|Any|) |#2|) "\\spad{puiseux(f)} returns a Puiseux expansion of the expression \\spad{f}. Note: \\spad{f} should have only one variable; the series will be expanded in powers of that variable.") (((|Any|) (|Symbol|)) "\\spad{puiseux(x)} returns \\spad{x} viewed as a Puiseux series.")) (|laurent| (((|Any|) |#2| (|Equation| |#2|) (|Integer|)) "\\spad{laurent(f,x = a,n)} expands the expression \\spad{f} as a Laurent series in powers of \\spad{(x - a)}; terms will be computed up to order at least \\spad{n}.") (((|Any|) |#2| (|Equation| |#2|)) "\\spad{laurent(f,x = a)} expands the expression \\spad{f} as a Laurent series in powers of \\spad{(x - a)}.") (((|Any|) |#2| (|Integer|)) "\\spad{laurent(f,n)} returns a Laurent expansion of the expression \\spad{f}. Note: \\spad{f} should have only one variable; the series will be expanded in powers of that variable and terms will be computed up to order at least \\spad{n}.") (((|Any|) |#2|) "\\spad{laurent(f)} returns a Laurent expansion of the expression \\spad{f}. Note: \\spad{f} should have only one variable; the series will be expanded in powers of that variable.") (((|Any|) (|Symbol|)) "\\spad{laurent(x)} returns \\spad{x} viewed as a Laurent series.")) (|taylor| (((|Any|) |#2| (|Equation| |#2|) (|NonNegativeInteger|)) "\\spad{taylor(f,x = a)} expands the expression \\spad{f} as a Taylor series in powers of \\spad{(x - a)}; terms will be computed up to order at least \\spad{n}.") (((|Any|) |#2| (|Equation| |#2|)) "\\spad{taylor(f,x = a)} expands the expression \\spad{f} as a Taylor series in powers of \\spad{(x - a)}.") (((|Any|) |#2| (|NonNegativeInteger|)) "\\spad{taylor(f,n)} returns a Taylor expansion of the expression \\spad{f}. Note: \\spad{f} should have only one variable; the series will be expanded in powers of that variable and terms will be computed up to order at least \\spad{n}.") (((|Any|) |#2|) "\\spad{taylor(f)} returns a Taylor expansion of the expression \\spad{f}. Note: \\spad{f} should have only one variable; the series will be expanded in powers of that variable.") (((|Any|) (|Symbol|)) "\\spad{taylor(x)} returns \\spad{x} viewed as a Taylor series."))) NIL NIL -(-329 R -4131) +(-329 R -4164) ((|constructor| (NIL "Taylor series solutions of explicit ODE's.")) (|seriesSolve| (((|Any|) |#2| (|BasicOperator|) (|Equation| |#2|) (|List| |#2|)) "\\spad{seriesSolve(eq, y, x = a, [b0,...,bn])} is equivalent to \\spad{seriesSolve(eq = 0, y, x = a, [b0,...,b(n-1)])}.") (((|Any|) |#2| (|BasicOperator|) (|Equation| |#2|) (|Equation| |#2|)) "\\spad{seriesSolve(eq, y, x = a, y a = b)} is equivalent to \\spad{seriesSolve(eq=0, y, x=a, y a = b)}.") (((|Any|) |#2| (|BasicOperator|) (|Equation| |#2|) |#2|) "\\spad{seriesSolve(eq, y, x = a, b)} is equivalent to \\spad{seriesSolve(eq = 0, y, x = a, y a = b)}.") (((|Any|) (|Equation| |#2|) (|BasicOperator|) (|Equation| |#2|) |#2|) "\\spad{seriesSolve(eq,y, x=a, b)} is equivalent to \\spad{seriesSolve(eq, y, x=a, y a = b)}.") (((|Any|) (|List| |#2|) (|List| (|BasicOperator|)) (|Equation| |#2|) (|List| (|Equation| |#2|))) "\\spad{seriesSolve([eq1,...,eqn], [y1,...,yn], x = a,[y1 a = b1,..., yn a = bn])} is equivalent to \\spad{seriesSolve([eq1=0,...,eqn=0], [y1,...,yn], x = a, [y1 a = b1,..., yn a = bn])}.") (((|Any|) (|List| |#2|) (|List| (|BasicOperator|)) (|Equation| |#2|) (|List| |#2|)) "\\spad{seriesSolve([eq1,...,eqn], [y1,...,yn], x=a, [b1,...,bn])} is equivalent to \\spad{seriesSolve([eq1=0,...,eqn=0], [y1,...,yn], x=a, [b1,...,bn])}.") (((|Any|) (|List| (|Equation| |#2|)) (|List| (|BasicOperator|)) (|Equation| |#2|) (|List| |#2|)) "\\spad{seriesSolve([eq1,...,eqn], [y1,...,yn], x=a, [b1,...,bn])} is equivalent to \\spad{seriesSolve([eq1,...,eqn], [y1,...,yn], x = a, [y1 a = b1,..., yn a = bn])}.") (((|Any|) (|List| (|Equation| |#2|)) (|List| (|BasicOperator|)) (|Equation| |#2|) (|List| (|Equation| |#2|))) "\\spad{seriesSolve([eq1,...,eqn],[y1,...,yn],x = a,[y1 a = b1,...,yn a = bn])} returns a taylor series solution of \\spad{[eq1,...,eqn]} around \\spad{x = a} with initial conditions \\spad{yi(a) = bi}. Note: eqi must be of the form \\spad{fi(x, y1 x, y2 x,..., yn x) y1'(x) + gi(x, y1 x, y2 x,..., yn x) = h(x, y1 x, y2 x,..., yn x)}.") (((|Any|) (|Equation| |#2|) (|BasicOperator|) (|Equation| |#2|) (|List| |#2|)) "\\spad{seriesSolve(eq,y,x=a,[b0,...,b(n-1)])} returns a Taylor series solution of \\spad{eq} around \\spad{x = a} with initial conditions \\spad{y(a) = b0},{} \\spad{y'(a) = b1},{} \\spad{y''(a) = b2},{} ...,{}\\spad{y(n-1)(a) = b(n-1)} \\spad{eq} must be of the form \\spad{f(x, y x, y'(x),..., y(n-1)(x)) y(n)(x) + g(x,y x,y'(x),...,y(n-1)(x)) = h(x,y x, y'(x),..., y(n-1)(x))}.") (((|Any|) (|Equation| |#2|) (|BasicOperator|) (|Equation| |#2|) (|Equation| |#2|)) "\\spad{seriesSolve(eq,y,x=a, y a = b)} returns a Taylor series solution of \\spad{eq} around \\spad{x} = a with initial condition \\spad{y(a) = b}. Note: \\spad{eq} must be of the form \\spad{f(x, y x) y'(x) + g(x, y x) = h(x, y x)}."))) NIL NIL @@ -1255,7 +1255,7 @@ NIL (-331 FE |var| |cen|) ((|constructor| (NIL "ExponentialOfUnivariatePuiseuxSeries is a domain used to represent essential singularities of functions. An object in this domain is a function of the form \\spad{exp(f(x))},{} where \\spad{f(x)} is a Puiseux series with no terms of non-negative degree. Objects are ordered according to order of singularity,{} with functions which tend more rapidly to zero or infinity considered to be larger. Thus,{} if \\spad{order(f(x)) < order(g(x))},{} \\spadignore{i.e.} the first non-zero term of \\spad{f(x)} has lower degree than the first non-zero term of \\spad{g(x)},{} then \\spad{exp(f(x)) > exp(g(x))}. If \\spad{order(f(x)) = order(g(x))},{} then the ordering is essentially random. This domain is used in computing limits involving functions with essential singularities.")) (|exponentialOrder| (((|Fraction| (|Integer|)) $) "\\spad{exponentialOrder(exp(c * x **(-n) + ...))} returns \\spad{-n}. exponentialOrder(0) returns \\spad{0}.")) (|exponent| (((|UnivariatePuiseuxSeries| |#1| |#2| |#3|) $) "\\spad{exponent(exp(f(x)))} returns \\spad{f(x)}")) (|exponential| (($ (|UnivariatePuiseuxSeries| |#1| |#2| |#3|)) "\\spad{exponential(f(x))} returns \\spad{exp(f(x))}. Note: the function does NOT check that \\spad{f(x)} has no non-negative terms."))) (((-4512 "*") |has| |#1| (-175)) (-4503 |has| |#1| (-571)) (-4508 |has| |#1| (-376)) (-4502 |has| |#1| (-376)) (-4504 . T) (-4505 . T) (-4507 . T)) -((|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-175))) (-4133 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (|%list| (QUOTE -421) (QUOTE (-560))) (|devaluate| |#1|))))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (|%list| (QUOTE -421) (QUOTE (-560))) (|devaluate| |#1|)))) (|HasCategory| (-421 (-560)) (QUOTE (-1144))) (|HasCategory| |#1| (QUOTE (-376))) (-4133 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-571)))) (-4133 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-571)))) (-12 (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (|%list| (QUOTE -421) (QUOTE (-560)))))) (|HasSignature| |#1| (|%list| (QUOTE -4080) (|%list| (|devaluate| |#1|) (QUOTE (-1209)))))) (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (|%list| (QUOTE -421) (QUOTE (-560)))))) (-4133 (-12 (|HasCategory| |#1| (|%list| (QUOTE -29) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-990))) (|HasCategory| |#1| (QUOTE (-1235)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasSignature| |#1| (|%list| (QUOTE -3538) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1209))))) (|HasSignature| |#1| (|%list| (QUOTE -2985) (|%list| (|%list| (QUOTE -663) (QUOTE (-1209))) (|devaluate| |#1|))))))) +((|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-175))) (-4144 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (|%list| (QUOTE -421) (QUOTE (-560))) (|devaluate| |#1|))))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (|%list| (QUOTE -421) (QUOTE (-560))) (|devaluate| |#1|)))) (|HasCategory| (-421 (-560)) (QUOTE (-1144))) (|HasCategory| |#1| (QUOTE (-376))) (-4144 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-571)))) (-4144 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-571)))) (-12 (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (|%list| (QUOTE -421) (QUOTE (-560)))))) (|HasSignature| |#1| (|%list| (QUOTE -3903) (|%list| (|devaluate| |#1|) (QUOTE (-1209)))))) (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (|%list| (QUOTE -421) (QUOTE (-560)))))) (-4144 (-12 (|HasCategory| |#1| (|%list| (QUOTE -29) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-990))) (|HasCategory| |#1| (QUOTE (-1235)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasSignature| |#1| (|%list| (QUOTE -2884) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1209))))) (|HasSignature| |#1| (|%list| (QUOTE -3648) (|%list| (|%list| (QUOTE -663) (QUOTE (-1209))) (|devaluate| |#1|))))))) (-332 M) ((|constructor| (NIL "computes various functions on factored arguments.")) (|log| (((|List| (|Record| (|:| |coef| (|NonNegativeInteger|)) (|:| |logand| |#1|))) (|Factored| |#1|)) "\\spad{log(f)} returns \\spad{[(a1,b1),...,(am,bm)]} such that the logarithm of \\spad{f} is equal to \\spad{a1*log(b1) + ... + am*log(bm)}.")) (|nthRoot| (((|Record| (|:| |exponent| (|NonNegativeInteger|)) (|:| |coef| |#1|) (|:| |radicand| (|List| |#1|))) (|Factored| |#1|) (|NonNegativeInteger|)) "\\spad{nthRoot(f, n)} returns \\spad{(p, r, [r1,...,rm])} such that the \\spad{n}th-root of \\spad{f} is equal to \\spad{r * \\spad{p}th-root(r1 * ... * rm)},{} where \\spad{r1},{}...,{}rm are distinct factors of \\spad{f},{} each of which has an exponent smaller than \\spad{p} in \\spad{f}."))) NIL @@ -1287,12 +1287,12 @@ NIL (-339 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."))) ((-4511 . T) (-4510 . T)) -((-4133 (-12 (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549)))) (-4133 (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133)))) (|HasCategory| |#1| (QUOTE (-872))) (-4133 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133)))) (|HasCategory| (-560) (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) -(-340 S -4131) +((-4144 (-12 (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549)))) (-4144 (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133)))) (|HasCategory| |#1| (QUOTE (-872))) (-4144 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133)))) (|HasCategory| (-560) (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) +(-340 S -4164) ((|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})\\$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})\\$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**(q**(d*i)) for \\spad{i} in 0..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},{}...,{}vn are the elements of the fixed basis.")) (|coordinates| (((|Matrix| |#2|) (|Vector| $)) "\\spad{coordinates([v1,...,vm])} returns the coordinates of the \\spad{vi}'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 \\$ as \\spad{F}-vectorspace.") (((|Vector| $)) "\\spad{basis()} returns a fixed basis of \\$ as \\spad{F}-vectorspace."))) NIL ((|HasCategory| |#2| (QUOTE (-381)))) -(-341 -4131) +(-341 -4164) ((|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})\\$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})\\$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**(q**(d*i)) for \\spad{i} in 0..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},{}...,{}vn are the elements of the fixed basis.")) (|coordinates| (((|Matrix| |#1|) (|Vector| $)) "\\spad{coordinates([v1,...,vm])} returns the coordinates of the \\spad{vi}'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 \\$ as \\spad{F}-vectorspace.") (((|Vector| $)) "\\spad{basis()} returns a fixed basis of \\$ as \\spad{F}-vectorspace."))) ((-4502 . T) (-4508 . T) (-4503 . T) ((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) NIL @@ -1312,7 +1312,7 @@ NIL ((|constructor| (NIL "Represntation of data needed to instantiate a domain constructor.")) (|lookupFunction| (((|Identifier|) $) "\\spad{lookupFunction x} returns the name of the lookup function associated with the functor data \\spad{x}.")) (|categories| (((|PrimitiveArray| (|ConstructorCall| (|CategoryConstructor|))) $) "\\spad{categories x} returns the list of categories forms each domain object obtained from the domain data \\spad{x} belongs to.")) (|encodingDirectory| (((|PrimitiveArray| (|NonNegativeInteger|)) $) "\\spad{encodintDirectory x} returns the directory of domain-wide entity description.")) (|attributeData| (((|List| (|Pair| (|Syntax|) (|NonNegativeInteger|))) $) "\\spad{attributeData x} returns the list of attribute-predicate bit vector index pair associated with the functor data \\spad{x}.")) (|domainTemplate| (((|DomainTemplate|) $) "\\spad{domainTemplate x} returns the domain template vector associated with the functor data \\spad{x}."))) NIL NIL -(-346 -4131 UP UPUP R) +(-346 -4164 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}'s are integers and the \\spad{P}'s are finite rational points on the curve.")) (|lSpaceBasis| (((|Vector| |#4|) $) "\\spad{lSpaceBasis(d)} returns a basis for \\spad{L(d) = {f | (f) >= -d}} as a module over \\spad{K[x]}.")) (|finiteBasis| (((|Vector| |#4|) $) "\\spad{finiteBasis(d)} returns a basis for \\spad{d} as a module over {\\em K[x]}."))) NIL NIL @@ -1320,11 +1320,11 @@ 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 -(-348 S -4131 UP UPUP R) +(-348 S -4164 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}'s are integers and the \\spad{P}'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 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 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 -(-349 -4131 UP UPUP R) +(-349 -4164 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}'s are integers and the \\spad{P}'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 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 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 @@ -1343,12 +1343,12 @@ NIL (-353 |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}."))) ((-4502 . T) (-4508 . T) (-4503 . T) ((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) -((-4133 (|HasCategory| (-936 |#1|) (QUOTE (-147))) (|HasCategory| (-936 |#1|) (QUOTE (-381)))) (|HasCategory| (-936 |#1|) (QUOTE (-149))) (|HasCategory| (-936 |#1|) (QUOTE (-381))) (|HasCategory| (-936 |#1|) (QUOTE (-147)))) -(-354 S -4131 UP UPUP) +((-4144 (|HasCategory| (-936 |#1|) (QUOTE (-147))) (|HasCategory| (-936 |#1|) (QUOTE (-381)))) (|HasCategory| (-936 |#1|) (QUOTE (-149))) (|HasCategory| (-936 |#1|) (QUOTE (-381))) (|HasCategory| (-936 |#1|) (QUOTE (-147)))) +(-354 S -4164 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 \\spad{u1},{}...,{}un of an affine non-singular model for the curve.")) (|algSplitSimple| (((|Record| (|:| |num| $) (|:| |den| |#3|) (|:| |derivden| |#3|) (|:| |gd| |#3|)) $ (|Mapping| |#3| |#3|)) "\\spad{algSplitSimple(f, D)} returns \\spad{[h,d,d',g]} such that \\spad{f=h/d},{} \\spad{h} is integral at all the normal places \\spad{w}.\\spad{r}.\\spad{t}. \\spad{D},{} \\spad{d' = Dd},{} \\spad{g = gcd(d, discriminant())} and \\spad{D} is the derivation to use. \\spad{f} must have at most simple finite poles.")) (|hyperelliptic| (((|Union| |#3| "failed")) "\\spad{hyperelliptic()} returns \\spad{p(x)} if the curve is the hyperelliptic defined by \\spad{y**2 = p(x)},{} \"failed\" otherwise.")) (|elliptic| (((|Union| |#3| "failed")) "\\spad{elliptic()} returns \\spad{p(x)} if the curve is the elliptic defined by \\spad{y**2 = p(x)},{} \"failed\" otherwise.")) (|elt| ((|#2| $ |#2| |#2|) "\\spad{elt(f,a,b)} or \\spad{f}(a,{} \\spad{b}) returns the value of \\spad{f} at the point \\spad{(x = a, y = b)} if it is not singular.")) (|primitivePart| (($ $) "\\spad{primitivePart(f)} removes the content of the denominator and the common content of the numerator of \\spad{f}.")) (|differentiate| (($ $ (|Mapping| |#3| |#3|)) "\\spad{differentiate(x, d)} extends the derivation \\spad{d} from UP to \\$ and applies it to \\spad{x}.")) (|integralDerivationMatrix| (((|Record| (|:| |num| (|Matrix| |#3|)) (|:| |den| |#3|)) (|Mapping| |#3| |#3|)) "\\spad{integralDerivationMatrix(d)} extends the derivation \\spad{d} from UP to \\$ and returns (\\spad{M},{} \\spad{Q}) such that the i^th row of \\spad{M} divided by \\spad{Q} form the coordinates of \\spad{d(wi)} with respect to \\spad{(w1,...,wn)} where \\spad{(w1,...,wn)} is the integral basis returned by integralBasis().")) (|integralRepresents| (($ (|Vector| |#3|) |#3|) "\\spad{integralRepresents([A1,...,An], D)} returns \\spad{(A1 w1+...+An wn)/D} where \\spad{(w1,...,wn)} is the integral basis of \\spad{integralBasis()}.")) (|integralCoordinates| (((|Record| (|:| |num| (|Vector| |#3|)) (|:| |den| |#3|)) $) "\\spad{integralCoordinates(f)} returns \\spad{[[A1,...,An], D]} such that \\spad{f = (A1 w1 +...+ An wn) / D} where \\spad{(w1,...,wn)} is the integral basis returned by \\spad{integralBasis()}.")) (|represents| (($ (|Vector| |#3|) |#3|) "\\spad{represents([A0,...,A(n-1)],D)} returns \\spad{(A0 + A1 y +...+ A(n-1)*y**(n-1))/D}.")) (|yCoordinates| (((|Record| (|:| |num| (|Vector| |#3|)) (|:| |den| |#3|)) $) "\\spad{yCoordinates(f)} returns \\spad{[[A1,...,An], D]} such that \\spad{f = (A1 + A2 y +...+ An y**(n-1)) / D}.")) (|inverseIntegralMatrixAtInfinity| (((|Matrix| (|Fraction| |#3|))) "\\spad{inverseIntegralMatrixAtInfinity()} returns \\spad{M} such that \\spad{M (v1,...,vn) = (1, y, ..., y**(n-1))} where \\spad{(v1,...,vn)} is the local integral basis at infinity returned by \\spad{infIntBasis()}.")) (|integralMatrixAtInfinity| (((|Matrix| (|Fraction| |#3|))) "\\spad{integralMatrixAtInfinity()} returns \\spad{M} such that \\spad{(v1,...,vn) = M (1, y, ..., y**(n-1))} where \\spad{(v1,...,vn)} is the local integral basis at infinity returned by \\spad{infIntBasis()}.")) (|inverseIntegralMatrix| (((|Matrix| (|Fraction| |#3|))) "\\spad{inverseIntegralMatrix()} returns \\spad{M} such that \\spad{M (w1,...,wn) = (1, y, ..., y**(n-1))} where \\spad{(w1,...,wn)} is the integral basis of \\spadfunFrom{integralBasis}{FunctionFieldCategory}.")) (|integralMatrix| (((|Matrix| (|Fraction| |#3|))) "\\spad{integralMatrix()} returns \\spad{M} such that \\spad{(w1,...,wn) = M (1, y, ..., y**(n-1))},{} where \\spad{(w1,...,wn)} is the integral basis of \\spadfunFrom{integralBasis}{FunctionFieldCategory}.")) (|reduceBasisAtInfinity| (((|Vector| $) (|Vector| $)) "\\spad{reduceBasisAtInfinity(b1,...,bn)} returns \\spad{(x**i * bj)} for all \\spad{i},{}\\spad{j} such that \\spad{x**i*bj} is locally integral at infinity.")) (|normalizeAtInfinity| (((|Vector| $) (|Vector| $)) "\\spad{normalizeAtInfinity(v)} makes \\spad{v} normal at infinity.")) (|complementaryBasis| (((|Vector| $) (|Vector| $)) "\\spad{complementaryBasis(b1,...,bn)} returns the complementary basis \\spad{(b1',...,bn')} of \\spad{(b1,...,bn)}.")) (|integral?| (((|Boolean|) $ |#3|) "\\spad{integral?(f, p)} tests whether \\spad{f} is locally integral at \\spad{p(x) = 0}.") (((|Boolean|) $ |#2|) "\\spad{integral?(f, a)} tests whether \\spad{f} is locally integral at \\spad{x = a}.") (((|Boolean|) $) "\\spad{integral?()} tests if \\spad{f} is integral over \\spad{k[x]}.")) (|integralAtInfinity?| (((|Boolean|) $) "\\spad{integralAtInfinity?()} tests if \\spad{f} is locally integral at infinity.")) (|integralBasisAtInfinity| (((|Vector| $)) "\\spad{integralBasisAtInfinity()} returns the local integral basis at infinity.")) (|integralBasis| (((|Vector| $)) "\\spad{integralBasis()} returns the integral basis for the curve.")) (|ramified?| (((|Boolean|) |#3|) "\\spad{ramified?(p)} tests whether \\spad{p(x) = 0} is ramified.") (((|Boolean|) |#2|) "\\spad{ramified?(a)} tests whether \\spad{x = a} is ramified.")) (|ramifiedAtInfinity?| (((|Boolean|)) "\\spad{ramifiedAtInfinity?()} tests if infinity is ramified.")) (|singular?| (((|Boolean|) |#3|) "\\spad{singular?(p)} tests whether \\spad{p(x) = 0} is singular.") (((|Boolean|) |#2|) "\\spad{singular?(a)} tests whether \\spad{x = a} is singular.")) (|singularAtInfinity?| (((|Boolean|)) "\\spad{singularAtInfinity?()} tests if there is a singularity at infinity.")) (|branchPoint?| (((|Boolean|) |#3|) "\\spad{branchPoint?(p)} tests whether \\spad{p(x) = 0} is a branch point.") (((|Boolean|) |#2|) "\\spad{branchPoint?(a)} tests whether \\spad{x = a} is a branch point.")) (|branchPointAtInfinity?| (((|Boolean|)) "\\spad{branchPointAtInfinity?()} tests if there is a branch point at infinity.")) (|rationalPoint?| (((|Boolean|) |#2| |#2|) "\\spad{rationalPoint?(a, b)} tests if \\spad{(x=a,y=b)} is on the curve.")) (|absolutelyIrreducible?| (((|Boolean|)) "\\spad{absolutelyIrreducible?()} tests if the curve absolutely irreducible?")) (|genus| (((|NonNegativeInteger|)) "\\spad{genus()} returns the genus of one absolutely irreducible component")) (|numberOfComponents| (((|NonNegativeInteger|)) "\\spad{numberOfComponents()} returns the number of absolutely irreducible components."))) NIL ((|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (QUOTE (-376)))) -(-355 -4131 UP UPUP) +(-355 -4164 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 \\spad{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."))) ((-4503 |has| (-421 |#2|) (-376)) (-4508 |has| (-421 |#2|) (-376)) (-4502 |has| (-421 |#2|) (-376)) ((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) NIL @@ -1359,15 +1359,15 @@ NIL (-357 |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."))) ((-4502 . T) (-4508 . T) (-4503 . T) ((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) -((-4133 (|HasCategory| (-936 |#1|) (QUOTE (-147))) (|HasCategory| (-936 |#1|) (QUOTE (-381)))) (|HasCategory| (-936 |#1|) (QUOTE (-149))) (|HasCategory| (-936 |#1|) (QUOTE (-381))) (|HasCategory| (-936 |#1|) (QUOTE (-147)))) +((-4144 (|HasCategory| (-936 |#1|) (QUOTE (-147))) (|HasCategory| (-936 |#1|) (QUOTE (-381)))) (|HasCategory| (-936 |#1|) (QUOTE (-149))) (|HasCategory| (-936 |#1|) (QUOTE (-381))) (|HasCategory| (-936 |#1|) (QUOTE (-147)))) (-358 GF |defpol|) ((|constructor| (NIL "FiniteFieldCyclicGroupExtensionByPolynomial(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."))) ((-4502 . T) (-4508 . T) (-4503 . T) ((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) -((-4133 (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-381)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-381))) (|HasCategory| |#1| (QUOTE (-147)))) +((-4144 (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-381)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-381))) (|HasCategory| |#1| (QUOTE (-147)))) (-359 GF |extdeg|) ((|constructor| (NIL "FiniteFieldCyclicGroupExtension(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."))) ((-4502 . T) (-4508 . T) (-4503 . T) ((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) -((-4133 (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-381)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-381))) (|HasCategory| |#1| (QUOTE (-147)))) +((-4144 (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-381)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-381))) (|HasCategory| |#1| (QUOTE (-147)))) (-360 GF) ((|constructor| (NIL "FiniteFieldFunctions(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 @@ -1384,42 +1384,42 @@ 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 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."))) ((-4502 . T) (-4508 . T) (-4503 . T) ((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) NIL -(-364 R UP -4131) +(-364 R UP -4164) ((|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 (-365 |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."))) ((-4502 . T) (-4508 . T) (-4503 . T) ((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) -((-4133 (|HasCategory| (-936 |#1|) (QUOTE (-147))) (|HasCategory| (-936 |#1|) (QUOTE (-381)))) (|HasCategory| (-936 |#1|) (QUOTE (-149))) (|HasCategory| (-936 |#1|) (QUOTE (-381))) (|HasCategory| (-936 |#1|) (QUOTE (-147)))) +((-4144 (|HasCategory| (-936 |#1|) (QUOTE (-147))) (|HasCategory| (-936 |#1|) (QUOTE (-381)))) (|HasCategory| (-936 |#1|) (QUOTE (-149))) (|HasCategory| (-936 |#1|) (QUOTE (-381))) (|HasCategory| (-936 |#1|) (QUOTE (-147)))) (-366 GF |uni|) ((|constructor| (NIL "FiniteFieldNormalBasisExtensionByPolynomial(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."))) ((-4502 . T) (-4508 . T) (-4503 . T) ((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) -((-4133 (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-381)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-381))) (|HasCategory| |#1| (QUOTE (-147)))) +((-4144 (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-381)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-381))) (|HasCategory| |#1| (QUOTE (-147)))) (-367 GF |extdeg|) ((|constructor| (NIL "FiniteFieldNormalBasisExtensionByPolynomial(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."))) ((-4502 . T) (-4508 . T) (-4503 . T) ((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) -((-4133 (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-381)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-381))) (|HasCategory| |#1| (QUOTE (-147)))) +((-4144 (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-381)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-381))) (|HasCategory| |#1| (QUOTE (-147)))) (-368 GF |defpol|) ((|constructor| (NIL "FiniteFieldExtensionByPolynomial(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."))) ((-4502 . T) (-4508 . T) (-4503 . T) ((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) -((-4133 (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-381)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-381))) (|HasCategory| |#1| (QUOTE (-147)))) +((-4144 (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-381)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-381))) (|HasCategory| |#1| (QUOTE (-147)))) (-369 GF) ((|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(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(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(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(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(GF) generates a normal polynomial of degree \\spad{n} over the finite field {\\em GF}.")) (|createPrimitivePoly| (((|SparseUnivariatePolynomial| |#1|) (|PositiveInteger|)) "\\spad{createPrimitivePoly(n)}\\$FFPOLY(GF) generates a primitive polynomial of degree \\spad{n} over the finite field {\\em GF}.")) (|createIrreduciblePoly| (((|SparseUnivariatePolynomial| |#1|) (|PositiveInteger|)) "\\spad{createIrreduciblePoly(n)}\\$FFPOLY(GF) generates a monic irreducible univariate polynomial of degree \\spad{n} over the finite field {\\em GF}.")) (|numberOfNormalPoly| (((|PositiveInteger|) (|PositiveInteger|)) "\\spad{numberOfNormalPoly(n)}\\$FFPOLY(GF) yields the number of normal polynomials of degree \\spad{n} over the finite field {\\em GF}.")) (|numberOfPrimitivePoly| (((|PositiveInteger|) (|PositiveInteger|)) "\\spad{numberOfPrimitivePoly(n)}\\$FFPOLY(GF) yields the number of primitive polynomials of degree \\spad{n} over the finite field {\\em GF}.")) (|numberOfIrreduciblePoly| (((|PositiveInteger|) (|PositiveInteger|)) "\\spad{numberOfIrreduciblePoly(n)}\\$FFPOLY(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 -(-370 -4131 GF) +(-370 -4164 GF) ((|constructor| (NIL "\\spad{FiniteFieldPolynomialPackage2}(\\spad{F},{}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 -(-371 -4131 FP FPP) +(-371 -4164 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}'s exists."))) NIL NIL (-372 GF |n|) ((|constructor| (NIL "FiniteFieldExtensionByPolynomial(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}."))) ((-4502 . T) (-4508 . T) (-4503 . T) ((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) -((-4133 (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-381)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-381))) (|HasCategory| |#1| (QUOTE (-147)))) +((-4144 (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-381)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-381))) (|HasCategory| |#1| (QUOTE (-147)))) (-373 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{ls}."))) NIL @@ -1494,7 +1494,7 @@ NIL NIL (-391) ((|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}."))) -((-4493 . T) (-4501 . T) (-2793 . T) (-4502 . T) (-4508 . T) (-4503 . T) ((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) +((-4493 . T) (-4501 . T) (-2862 . T) (-4502 . T) (-4508 . T) (-4503 . T) ((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) NIL (-392 |Par|) ((|constructor| (NIL "\\indented{3}{This is a package for the approximation of complex solutions for} systems of equations of rational functions with complex rational coefficients. The results are expressed as either complex rational numbers or complex floats depending on the type of the precision parameter which can be either a rational number or a floating point number.")) (|complexRoots| (((|List| (|List| (|Complex| |#1|))) (|List| (|Fraction| (|Polynomial| (|Complex| (|Integer|))))) (|List| (|Symbol|)) |#1|) "\\spad{complexRoots(lrf, lv, eps)} finds all the complex solutions of a list of rational functions with rational number coefficients with respect the the variables appearing in \\spad{lv}. Each solution is computed to precision eps and returned as list corresponding to the order of variables in \\spad{lv}.") (((|List| (|Complex| |#1|)) (|Fraction| (|Polynomial| (|Complex| (|Integer|)))) |#1|) "\\spad{complexRoots(rf, eps)} finds all the complex solutions of a univariate rational function with rational number coefficients. The solutions are computed to precision eps.")) (|complexSolve| (((|List| (|Equation| (|Polynomial| (|Complex| |#1|)))) (|Equation| (|Fraction| (|Polynomial| (|Complex| (|Integer|))))) |#1|) "\\spad{complexSolve(eq,eps)} finds all the complex solutions of the equation \\spad{eq} of rational functions with rational rational coefficients with respect to all the variables appearing in \\spad{eq},{} with precision \\spad{eps}.") (((|List| (|Equation| (|Polynomial| (|Complex| |#1|)))) (|Fraction| (|Polynomial| (|Complex| (|Integer|)))) |#1|) "\\spad{complexSolve(p,eps)} find all the complex solutions of the rational function \\spad{p} with complex rational coefficients with respect to all the variables appearing in \\spad{p},{} with precision \\spad{eps}.") (((|List| (|List| (|Equation| (|Polynomial| (|Complex| |#1|))))) (|List| (|Equation| (|Fraction| (|Polynomial| (|Complex| (|Integer|)))))) |#1|) "\\spad{complexSolve(leq,eps)} finds all the complex solutions to precision \\spad{eps} of the system \\spad{leq} of equations of rational functions over complex rationals with respect to all the variables appearing in lp.") (((|List| (|List| (|Equation| (|Polynomial| (|Complex| |#1|))))) (|List| (|Fraction| (|Polynomial| (|Complex| (|Integer|))))) |#1|) "\\spad{complexSolve(lp,eps)} finds all the complex solutions to precision \\spad{eps} of the system \\spad{lp} of rational functions over the complex rationals with respect to all the variables appearing in \\spad{lp}."))) @@ -1552,7 +1552,7 @@ NIL ((|constructor| (NIL "Code to manipulate Fortran Output Stack")) (|topFortranOutputStack| (((|String|)) "\\spad{topFortranOutputStack()} returns the top element of the Fortran output stack")) (|pushFortranOutputStack| (((|Void|) (|String|)) "\\spad{pushFortranOutputStack(f)} pushes \\spad{f} onto the Fortran output stack") (((|Void|) (|FileName|)) "\\spad{pushFortranOutputStack(f)} pushes \\spad{f} onto the Fortran output stack")) (|popFortranOutputStack| (((|Void|)) "\\spad{popFortranOutputStack()} pops the Fortran output stack")) (|showFortranOutputStack| (((|Stack| (|String|))) "\\spad{showFortranOutputStack()} returns the Fortran output stack")) (|clearFortranOutputStack| (((|Stack| (|String|))) "\\spad{clearFortranOutputStack()} clears the Fortran output stack"))) NIL NIL -(-406 -4131 UP UPUP R) +(-406 -4164 UP UPUP R) ((|constructor| (NIL "\\indented{1}{Finds the order of a divisor over a finite field} Author: Manuel Bronstein Date Created: 1988 Date Last Updated: 11 Jul 1990")) (|order| (((|NonNegativeInteger|) (|FiniteDivisor| |#1| |#2| |#3| |#4|)) "\\spad{order(x)} \\undocumented"))) NIL NIL @@ -1576,11 +1576,11 @@ NIL ((|constructor| (NIL "\\axiomType{FortranFunctionCategory} is the category of arguments to NAG Library routines which return (sets of) function values.")) (|retractIfCan| (((|Union| $ "failed") (|Fraction| (|Polynomial| (|Integer|)))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (((|Union| $ "failed") (|Fraction| (|Polynomial| (|Float|)))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (((|Union| $ "failed") (|Polynomial| (|Integer|))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (((|Union| $ "failed") (|Polynomial| (|Float|))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (((|Union| $ "failed") (|Expression| (|Integer|))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (((|Union| $ "failed") (|Expression| (|Float|))) "\\spad{retractIfCan(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}")) (|retract| (($ (|Fraction| (|Polynomial| (|Integer|)))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (($ (|Fraction| (|Polynomial| (|Float|)))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (($ (|Polynomial| (|Integer|))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (($ (|Polynomial| (|Float|))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (($ (|Expression| (|Integer|))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}") (($ (|Expression| (|Float|))) "\\spad{retract(e)} tries to convert \\spad{e} into an ASP,{} checking that \\indented{1}{legal Fortran-77 is produced.}")) (|coerce| (($ (|Record| (|:| |localSymbols| (|SymbolTable|)) (|:| |code| (|List| (|FortranCode|))))) "\\spad{coerce(e)} takes the component of \\spad{e} from \\spadtype{List FortranCode} and uses it as the body of the ASP,{} making the declarations in the \\spadtype{SymbolTable} component.") (($ (|FortranCode|)) "\\spad{coerce(e)} takes an object from \\spadtype{FortranCode} and \\indented{1}{uses it as the body of an ASP.}") (($ (|List| (|FortranCode|))) "\\spad{coerce(e)} takes an object from \\spadtype{List FortranCode} and \\indented{1}{uses it as the body of an ASP.}"))) NIL NIL -(-412 -3665 |returnType| -3962 |symbols|) +(-412 -4401 |returnType| -1629 |symbols|) ((|constructor| (NIL "\\axiomType{FortranProgram} allows the user to build and manipulate simple models of FORTRAN subprograms. These can then be transformed into actual FORTRAN notation.")) (|coerce| (($ (|Equation| (|Expression| (|Complex| (|Float|))))) "\\spad{coerce(eq)} \\undocumented{}") (($ (|Equation| (|Expression| (|Float|)))) "\\spad{coerce(eq)} \\undocumented{}") (($ (|Equation| (|Expression| (|Integer|)))) "\\spad{coerce(eq)} \\undocumented{}") (($ (|Expression| (|Complex| (|Float|)))) "\\spad{coerce(e)} \\undocumented{}") (($ (|Expression| (|Float|))) "\\spad{coerce(e)} \\undocumented{}") (($ (|Expression| (|Integer|))) "\\spad{coerce(e)} \\undocumented{}") (($ (|Equation| (|Expression| (|MachineComplex|)))) "\\spad{coerce(eq)} \\undocumented{}") (($ (|Equation| (|Expression| (|MachineFloat|)))) "\\spad{coerce(eq)} \\undocumented{}") (($ (|Equation| (|Expression| (|MachineInteger|)))) "\\spad{coerce(eq)} \\undocumented{}") (($ (|Expression| (|MachineComplex|))) "\\spad{coerce(e)} \\undocumented{}") (($ (|Expression| (|MachineFloat|))) "\\spad{coerce(e)} \\undocumented{}") (($ (|Expression| (|MachineInteger|))) "\\spad{coerce(e)} \\undocumented{}") (($ (|Record| (|:| |localSymbols| (|SymbolTable|)) (|:| |code| (|List| (|FortranCode|))))) "\\spad{coerce(r)} \\undocumented{}") (($ (|List| (|FortranCode|))) "\\spad{coerce(lfc)} \\undocumented{}") (($ (|FortranCode|)) "\\spad{coerce(fc)} \\undocumented{}"))) NIL NIL -(-413 -4131 UP) +(-413 -4164 UP) ((|constructor| (NIL "\\indented{1}{Full partial fraction expansion of rational functions} Author: Manuel Bronstein Date Created: 9 December 1992 Date Last Updated: June 18,{} 2010 References: \\spad{M}.Bronstein & \\spad{B}.Salvy,{} \\indented{12}{Full Partial Fraction Decomposition of Rational Functions,{}} \\indented{12}{in Proceedings of \\spad{ISSAC'93},{} Kiev,{} ACM Press.}")) (|construct| (($ (|List| (|Record| (|:| |exponent| (|NonNegativeInteger|)) (|:| |center| |#2|) (|:| |num| |#2|)))) "\\spad{construct(l)} is the inverse of fracPart.")) (|fracPart| (((|List| (|Record| (|:| |exponent| (|NonNegativeInteger|)) (|:| |center| |#2|) (|:| |num| |#2|))) $) "\\spad{fracPart(f)} returns the list of summands of the fractional part of \\spad{f}.")) (|polyPart| ((|#2| $) "\\spad{polyPart(f)} returns the polynomial part of \\spad{f}.")) (|fullPartialFraction| (($ (|Fraction| |#2|)) "\\spad{fullPartialFraction(f)} returns \\spad{[p, [[j, Dj, Hj]...]]} such that \\spad{f = p(x) + \\sum_{[j,Dj,Hj] in l} \\sum_{Dj(a)=0} Hj(a)/(x - a)\\^j}.")) (+ (($ |#2| $) "\\spad{p + x} returns the sum of \\spad{p} and \\spad{x}"))) NIL NIL @@ -1602,12 +1602,12 @@ NIL ((|HasAttribute| |#1| (QUOTE -4493)) (|HasAttribute| |#1| (QUOTE -4501))) (-418) ((|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(\"+\") 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'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'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\"."))) -((-2793 . T) (-4502 . T) (-4508 . T) (-4503 . T) ((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) +((-2862 . T) (-4502 . T) (-4508 . T) (-4503 . T) ((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) NIL (-419 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 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."))) ((-4503 . T) ((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) -((|HasCategory| |#1| (|%list| (QUOTE -528) (QUOTE (-1209)) (QUOTE $))) (|HasCategory| |#1| (|%list| (QUOTE -321) (QUOTE $))) (|HasCategory| |#1| (|%list| (QUOTE -298) (QUOTE $) (QUOTE $))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#1| (QUOTE (-1254))) (-4133 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-1254)))) (|HasCategory| |#1| (QUOTE (-1052))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -528) (QUOTE (-1209)) (|devaluate| |#1|))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))) (|HasCategory| |#1| (|%list| (QUOTE -298) (|devaluate| |#1|) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-240))) (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-466)))) +((|HasCategory| |#1| (|%list| (QUOTE -528) (QUOTE (-1209)) (QUOTE $))) (|HasCategory| |#1| (|%list| (QUOTE -321) (QUOTE $))) (|HasCategory| |#1| (|%list| (QUOTE -298) (QUOTE $) (QUOTE $))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#1| (QUOTE (-1254))) (-4144 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-1254)))) (|HasCategory| |#1| (QUOTE (-1052))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -528) (QUOTE (-1209)) (|devaluate| |#1|))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))) (|HasCategory| |#1| (|%list| (QUOTE -298) (|devaluate| |#1|) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-240))) (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-466)))) (-420 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."))) NIL @@ -1615,7 +1615,7 @@ NIL (-421 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 gcd's between numerator and denominator will be cancelled during all operations.")) (|canonical| ((|attribute|) "\\spad{canonical} means that equal elements are in fact identical."))) ((-4497 -12 (|has| |#1| (-6 -4508)) (|has| |#1| (-466)) (|has| |#1| (-6 -4497))) (-4502 . T) (-4508 . T) (-4503 . T) ((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) -((|HasCategory| |#1| (QUOTE (-940))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-845)))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549))))) (|HasCategory| |#1| (QUOTE (-1052))) (|HasCategory| |#1| (QUOTE (-844))) (|HasCategory| |#1| (QUOTE (-872))) (-4133 (|HasCategory| |#1| (QUOTE (-844))) (|HasCategory| |#1| (QUOTE (-872)))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-845)))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-1184))) (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-391)))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-845)))) (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (-4133 (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (-12 (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-845))))) (-4133 (|HasCategory| |#1| (|%list| (QUOTE -660) (QUOTE (-560)))) (-12 (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-845))))) (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-240))) (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#1| (|%list| (QUOTE -528) (QUOTE (-1209)) (|devaluate| |#1|))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))) (|HasCategory| |#1| (|%list| (QUOTE -298) (|devaluate| |#1|) (|devaluate| |#1|))) (-12 (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-845)))) (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-559))) (-12 (|HasAttribute| |#1| (QUOTE -4508)) (|HasAttribute| |#1| (QUOTE -4497)) (|HasCategory| |#1| (QUOTE (-466)))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -660) (QUOTE (-560)))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-940)))) (-4133 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-940)))) (|HasCategory| |#1| (QUOTE (-147))))) +((|HasCategory| |#1| (QUOTE (-940))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-845)))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549))))) (|HasCategory| |#1| (QUOTE (-1052))) (|HasCategory| |#1| (QUOTE (-844))) (|HasCategory| |#1| (QUOTE (-872))) (-4144 (|HasCategory| |#1| (QUOTE (-844))) (|HasCategory| |#1| (QUOTE (-872)))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-845)))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-1184))) (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-391)))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-845)))) (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (-4144 (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (-12 (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-845))))) (-4144 (|HasCategory| |#1| (|%list| (QUOTE -660) (QUOTE (-560)))) (-12 (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-845))))) (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-240))) (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#1| (|%list| (QUOTE -528) (QUOTE (-1209)) (|devaluate| |#1|))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))) (|HasCategory| |#1| (|%list| (QUOTE -298) (|devaluate| |#1|) (|devaluate| |#1|))) (-12 (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-845)))) (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-559))) (-12 (|HasAttribute| |#1| (QUOTE -4508)) (|HasAttribute| |#1| (QUOTE -4497)) (|HasCategory| |#1| (QUOTE (-466)))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -660) (QUOTE (-560)))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-940)))) (-4144 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-940)))) (|HasCategory| |#1| (QUOTE (-147))))) (-422 A B) ((|constructor| (NIL "This package extends a map between integral domains to a map between Fractions over those domains by applying the map to the numerators and denominators.")) (|map| (((|Fraction| |#2|) (|Mapping| |#2| |#1|) (|Fraction| |#1|)) "\\spad{map(func,frac)} applies the function \\spad{func} to the numerator and denominator of the fraction \\spad{frac}."))) NIL @@ -1636,7 +1636,7 @@ NIL ((|constructor| (NIL "\\indented{2}{A is fully retractable to \\spad{B} means that A is retractable to \\spad{B},{} and,{}} \\indented{2}{in addition,{} if \\spad{B} is retractable to the integers or rational} \\indented{2}{numbers then so is A.} \\indented{2}{In particular,{} what we are asserting is that there are no integers} \\indented{2}{(rationals) in A which don't retract into \\spad{B}.} Date Created: March 1990 Date Last Updated: 9 April 1991"))) NIL NIL -(-427 R -4131 UP A) +(-427 R -4164 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)}."))) ((-4507 . T)) NIL @@ -1644,7 +1644,7 @@ 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 -(-429 R -4131 UP A |ibasis|) +(-429 R -4164 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 -1070) (|devaluate| |#2|)))) @@ -1670,7 +1670,7 @@ NIL ((|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-571))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-149))) (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-487))) (|HasCategory| |#2| (QUOTE (-1144))) (|HasCategory| |#2| (|%list| (QUOTE -633) (QUOTE (-549))))) (-435 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 \\spad{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 \\spad{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}'s in \\spad{f}.") (($ $ (|Symbol|)) "\\spad{eval(f, foo)} unquotes all the foo'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}."))) -((-4507 -4133 (|has| |#1| (-1081)) (|has| |#1| (-487))) (-4505 |has| |#1| (-175)) (-4504 |has| |#1| (-175)) ((-4512 "*") |has| |#1| (-571)) (-4503 |has| |#1| (-571)) (-4508 |has| |#1| (-571)) (-4502 |has| |#1| (-571))) +((-4507 -4144 (|has| |#1| (-1081)) (|has| |#1| (-487))) (-4505 |has| |#1| (-175)) (-4504 |has| |#1| (-175)) ((-4512 "*") |has| |#1| (-571)) (-4503 |has| |#1| (-571)) (-4508 |has| |#1| (-571)) (-4502 |has| |#1| (-571))) NIL (-436 R A S B) ((|constructor| (NIL "This package allows a mapping \\spad{R} -> \\spad{S} to be lifted to a mapping from a function space over \\spad{R} to a function space over \\spad{S}.")) (|map| ((|#4| (|Mapping| |#3| |#1|) |#2|) "\\spad{map(f, a)} applies \\spad{f} to all the constants in \\spad{R} appearing in \\spad{a}."))) @@ -1696,7 +1696,7 @@ NIL ((|constructor| (NIL "\\spad{FiniteSetAggregateFunctions2} provides functions involving two finite set aggregates where the underlying domains might be different. An example of this is to create a set of rational numbers by mapping a function across a set of integers,{} where the function divides each integer by 1000.")) (|scan| ((|#4| (|Mapping| |#3| |#1| |#3|) |#2| |#3|) "\\spad{scan(f,a,r)} successively applies \\spad{reduce(f,x,r)} to more and more leading sub-aggregates \\spad{x} of aggregate \\spad{a}. More precisely,{} if \\spad{a} is \\spad{[a1,a2,...]},{} then \\spad{scan(f,a,r)} returns \\spad {[reduce(f,[a1],r),reduce(f,[a1,a2],r),...]}.")) (|reduce| ((|#3| (|Mapping| |#3| |#1| |#3|) |#2| |#3|) "\\spad{reduce(f,a,r)} applies function \\spad{f} to each successive element of the aggregate \\spad{a} and an accumulant initialised to \\spad{r}. For example,{} \\spad{reduce(_+\\$Integer,[1,2,3],0)} does a \\spad{3+(2+(1+0))}. Note: third argument \\spad{r} may be regarded as an identity element for the function.")) (|map| ((|#4| (|Mapping| |#3| |#1|) |#2|) "\\spad{map(f,a)} applies function \\spad{f} to each member of aggregate \\spad{a},{} creating a new aggregate with a possibly different underlying domain."))) NIL NIL -(-442 R -4131) +(-442 R -4164) ((|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 @@ -1704,19 +1704,19 @@ 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"))) ((-4497 -12 (|has| |#1| (-6 -4497)) (|has| |#2| (-6 -4497))) (-4504 . T) (-4505 . T) (-4507 . T)) ((-12 (|HasAttribute| |#1| (QUOTE -4497)) (|HasAttribute| |#2| (QUOTE -4497)))) -(-444 R -4131) +(-444 R -4164) ((|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 -(-445 R -4131) +(-445 R -4164) ((|constructor| (NIL "Provides some special functions over an integral domain.")) (|iiabs| ((|#2| |#2|) "\\spad{iiabs(x)} should be local but conditional.")) (|iiGamma| ((|#2| |#2|) "\\spad{iiGamma(x)} should be local but conditional.")) (|airyBi| ((|#2| |#2|) "\\spad{airyBi(x)} returns the airybi function applied to \\spad{x}")) (|airyAi| ((|#2| |#2|) "\\spad{airyAi(x)} returns the airyai function applied to \\spad{x}")) (|besselK| ((|#2| |#2| |#2|) "\\spad{besselK(x,y)} returns the besselk function applied to \\spad{x} and \\spad{y}")) (|besselI| ((|#2| |#2| |#2|) "\\spad{besselI(x,y)} returns the besseli function applied to \\spad{x} and \\spad{y}")) (|besselY| ((|#2| |#2| |#2|) "\\spad{besselY(x,y)} returns the bessely function applied to \\spad{x} and \\spad{y}")) (|besselJ| ((|#2| |#2| |#2|) "\\spad{besselJ(x,y)} returns the besselj function applied to \\spad{x} and \\spad{y}")) (|polygamma| ((|#2| |#2| |#2|) "\\spad{polygamma(x,y)} returns the polygamma function applied to \\spad{x} and \\spad{y}")) (|digamma| ((|#2| |#2|) "\\spad{digamma(x)} returns the digamma function applied to \\spad{x}")) (|Beta| ((|#2| |#2| |#2|) "\\spad{Beta(x,y)} returns the beta function applied to \\spad{x} and \\spad{y}")) (|Gamma| ((|#2| |#2| |#2|) "\\spad{Gamma(a,x)} returns the incomplete Gamma function applied to a and \\spad{x}") ((|#2| |#2|) "\\spad{Gamma(f)} returns the formal Gamma function applied to \\spad{f}")) (|abs| ((|#2| |#2|) "\\spad{abs(f)} returns the absolute value operator applied to \\spad{f}")) (|operator| (((|BasicOperator|) (|BasicOperator|)) "\\spad{operator(op)} returns a copy of \\spad{op} with the domain-dependent properties appropriate for \\spad{F}; error if \\spad{op} is not a special function operator")) (|belong?| (((|Boolean|) (|BasicOperator|)) "\\spad{belong?(op)} is \\spad{true} if \\spad{op} is a special function operator."))) NIL NIL -(-446 R -4131) +(-446 R -4164) ((|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 \\spad{a2} may involve \\spad{a1},{} but the minimal polynomial for \\spad{a1} may not involve \\spad{a2}; This operations uses \\spadfun{resultant}.") (((|Record| (|:| |primelt| |#2|) (|:| |poly| (|List| (|SparseUnivariatePolynomial| |#2|))) (|:| |prim| (|SparseUnivariatePolynomial| |#2|))) (|List| |#2|)) "\\spad{primitiveElement([a1,...,an])} returns \\spad{[a, [q1,...,qn], q]} such that then \\spad{k(a1,...,an) = k(a)},{} \\spad{ai = qi(a)},{} and \\spad{q(a) = 0}. This operation uses the technique of \\spadglossSee{groebner bases}{Groebner basis}."))) NIL ((|HasCategory| |#2| (QUOTE (-27)))) -(-447 R -4131) +(-447 R -4164) ((|constructor| (NIL "This package provides function which replaces transcendental kernels in a function space by random integers. The correspondence between the kernels and the integers is fixed between calls to new().")) (|newReduc| (((|Void|)) "\\spad{newReduc()} \\undocumented")) (|bringDown| (((|SparseUnivariatePolynomial| (|Fraction| (|Integer|))) |#2| (|Kernel| |#2|)) "\\spad{bringDown(f,k)} \\undocumented") (((|Fraction| (|Integer|)) |#2|) "\\spad{bringDown(f)} \\undocumented"))) NIL NIL @@ -1724,7 +1724,7 @@ NIL ((|constructor| (NIL "Creates and manipulates objects which correspond to the basic FORTRAN data types: REAL,{} INTEGER,{} COMPLEX,{} LOGICAL and CHARACTER")) (= (((|Boolean|) $ $) "\\spad{x=y} tests for equality")) (|logical?| (((|Boolean|) $) "\\spad{logical?(t)} tests whether \\spad{t} is equivalent to the FORTRAN type LOGICAL.")) (|character?| (((|Boolean|) $) "\\spad{character?(t)} tests whether \\spad{t} is equivalent to the FORTRAN type CHARACTER.")) (|doubleComplex?| (((|Boolean|) $) "\\spad{doubleComplex?(t)} tests whether \\spad{t} is equivalent to the (non-standard) FORTRAN type DOUBLE COMPLEX.")) (|complex?| (((|Boolean|) $) "\\spad{complex?(t)} tests whether \\spad{t} is equivalent to the FORTRAN type COMPLEX.")) (|integer?| (((|Boolean|) $) "\\spad{integer?(t)} tests whether \\spad{t} is equivalent to the FORTRAN type INTEGER.")) (|double?| (((|Boolean|) $) "\\spad{double?(t)} tests whether \\spad{t} is equivalent to the FORTRAN type DOUBLE PRECISION")) (|real?| (((|Boolean|) $) "\\spad{real?(t)} tests whether \\spad{t} is equivalent to the FORTRAN type REAL.")) (|coerce| (((|SExpression|) $) "\\spad{coerce(x)} returns the \\spad{s}-expression associated with \\spad{x}") (((|Symbol|) $) "\\spad{coerce(x)} returns the symbol associated with \\spad{x}") (($ (|Symbol|)) "\\spad{coerce(s)} transforms the symbol \\spad{s} into an element of FortranScalarType provided \\spad{s} is one of real,{} complex,{}double precision,{} logical,{} integer,{} character,{} REAL,{} COMPLEX,{} LOGICAL,{} INTEGER,{} CHARACTER,{} DOUBLE PRECISION") (($ (|String|)) "\\spad{coerce(s)} transforms the string \\spad{s} into an element of FortranScalarType provided \\spad{s} is one of \"real\",{} \"double precision\",{} \"complex\",{} \"logical\",{} \"integer\",{} \"character\",{} \"REAL\",{} \"COMPLEX\",{} \"LOGICAL\",{} \"INTEGER\",{} \"CHARACTER\",{} \"DOUBLE PRECISION\""))) NIL NIL -(-449 R -4131 UP) +(-449 R -4164 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 -1070) (QUOTE (-48))))) @@ -1756,7 +1756,7 @@ NIL ((|constructor| (NIL "\\spadtype{GaloisGroupFactorizer} provides functions to factor resolvents.")) (|btwFact| (((|Record| (|:| |contp| (|Integer|)) (|:| |factors| (|List| (|Record| (|:| |irr| |#1|) (|:| |pow| (|Integer|)))))) |#1| (|Boolean|) (|Set| (|NonNegativeInteger|)) (|NonNegativeInteger|)) "\\spad{btwFact(p,sqf,pd,r)} returns the factorization of \\spad{p},{} the result is a Record such that \\spad{contp=}content \\spad{p},{} \\spad{factors=}List of irreducible factors of \\spad{p} with exponent. If \\spad{sqf=true} the polynomial is assumed to be square free (\\spadignore{i.e.} without repeated factors). \\spad{pd} is the \\spadtype{Set} of possible degrees. \\spad{r} is a lower bound for the number of factors of \\spad{p}. Please do not use this function in your code because its design may change.")) (|henselFact| (((|Record| (|:| |contp| (|Integer|)) (|:| |factors| (|List| (|Record| (|:| |irr| |#1|) (|:| |pow| (|Integer|)))))) |#1| (|Boolean|)) "\\spad{henselFact(p,sqf)} returns the factorization of \\spad{p},{} the result is a Record such that \\spad{contp=}content \\spad{p},{} \\spad{factors=}List of irreducible factors of \\spad{p} with exponent. If \\spad{sqf=true} the polynomial is assumed to be square free (\\spadignore{i.e.} without repeated factors).")) (|factorOfDegree| (((|Union| |#1| "failed") (|PositiveInteger|) |#1| (|List| (|NonNegativeInteger|)) (|NonNegativeInteger|) (|Boolean|)) "\\spad{factorOfDegree(d,p,listOfDegrees,r,sqf)} returns a factor of \\spad{p} of degree \\spad{d} knowing that \\spad{p} has for possible splitting of its degree \\spad{listOfDegrees},{} and that \\spad{p} has at least \\spad{r} factors. If \\spad{sqf=true} the polynomial is assumed to be square free (\\spadignore{i.e.} without repeated factors).") (((|Union| |#1| "failed") (|PositiveInteger|) |#1| (|List| (|NonNegativeInteger|)) (|NonNegativeInteger|)) "\\spad{factorOfDegree(d,p,listOfDegrees,r)} returns a factor of \\spad{p} of degree \\spad{d} knowing that \\spad{p} has for possible splitting of its degree \\spad{listOfDegrees},{} and that \\spad{p} has at least \\spad{r} factors.") (((|Union| |#1| "failed") (|PositiveInteger|) |#1| (|List| (|NonNegativeInteger|))) "\\spad{factorOfDegree(d,p,listOfDegrees)} returns a factor of \\spad{p} of degree \\spad{d} knowing that \\spad{p} has for possible splitting of its degree \\spad{listOfDegrees}.") (((|Union| |#1| "failed") (|PositiveInteger|) |#1| (|NonNegativeInteger|)) "\\spad{factorOfDegree(d,p,r)} returns a factor of \\spad{p} of degree \\spad{d} knowing that \\spad{p} has at least \\spad{r} factors.") (((|Union| |#1| "failed") (|PositiveInteger|) |#1|) "\\spad{factorOfDegree(d,p)} returns a factor of \\spad{p} of degree \\spad{d}.")) (|factorSquareFree| (((|Factored| |#1|) |#1| (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{factorSquareFree(p,d,r)} factorizes the polynomial \\spad{p} using the single factor bound algorithm,{} knowing that \\spad{d} divides the degree of all factors of \\spad{p} and that \\spad{p} has at least \\spad{r} factors. \\spad{f} is supposed not having any repeated factor (this is not checked).") (((|Factored| |#1|) |#1| (|List| (|NonNegativeInteger|)) (|NonNegativeInteger|)) "\\spad{factorSquareFree(p,listOfDegrees,r)} factorizes the polynomial \\spad{p} using the single factor bound algorithm,{} knowing that \\spad{p} has for possible splitting of its degree \\spad{listOfDegrees} and that \\spad{p} has at least \\spad{r} factors. \\spad{f} is supposed not having any repeated factor (this is not checked).") (((|Factored| |#1|) |#1| (|List| (|NonNegativeInteger|))) "\\spad{factorSquareFree(p,listOfDegrees)} factorizes the polynomial \\spad{p} using the single factor bound algorithm and knowing that \\spad{p} has for possible splitting of its degree \\spad{listOfDegrees}. \\spad{f} is supposed not having any repeated factor (this is not checked).") (((|Factored| |#1|) |#1| (|NonNegativeInteger|)) "\\spad{factorSquareFree(p,r)} factorizes the polynomial \\spad{p} using the single factor bound algorithm and knowing that \\spad{p} has at least \\spad{r} factors. \\spad{f} is supposed not having any repeated factor (this is not checked).") (((|Factored| |#1|) |#1|) "\\spad{factorSquareFree(p)} returns the factorization of \\spad{p} which is supposed not having any repeated factor (this is not checked).")) (|factor| (((|Factored| |#1|) |#1| (|NonNegativeInteger|) (|NonNegativeInteger|)) "\\spad{factor(p,d,r)} factorizes the polynomial \\spad{p} using the single factor bound algorithm,{} knowing that \\spad{d} divides the degree of all factors of \\spad{p} and that \\spad{p} has at least \\spad{r} factors.") (((|Factored| |#1|) |#1| (|List| (|NonNegativeInteger|)) (|NonNegativeInteger|)) "\\spad{factor(p,listOfDegrees,r)} factorizes the polynomial \\spad{p} using the single factor bound algorithm,{} knowing that \\spad{p} has for possible splitting of its degree \\spad{listOfDegrees} and that \\spad{p} has at least \\spad{r} factors.") (((|Factored| |#1|) |#1| (|List| (|NonNegativeInteger|))) "\\spad{factor(p,listOfDegrees)} factorizes the polynomial \\spad{p} using the single factor bound algorithm and knowing that \\spad{p} has for possible splitting of its degree \\spad{listOfDegrees}.") (((|Factored| |#1|) |#1| (|NonNegativeInteger|)) "\\spad{factor(p,r)} factorizes the polynomial \\spad{p} using the single factor bound algorithm and knowing that \\spad{p} has at least \\spad{r} factors.") (((|Factored| |#1|) |#1|) "\\spad{factor(p)} returns the factorization of \\spad{p} over the integers.")) (|tryFunctionalDecomposition| (((|Boolean|) (|Boolean|)) "\\spad{tryFunctionalDecomposition(b)} chooses whether factorizers have to look for functional decomposition of polynomials (\\spad{true}) or not (\\spad{false}). Returns the previous value.")) (|tryFunctionalDecomposition?| (((|Boolean|)) "\\spad{tryFunctionalDecomposition?()} returns \\spad{true} if factorizers try functional decomposition of polynomials before factoring them.")) (|eisensteinIrreducible?| (((|Boolean|) |#1|) "\\spad{eisensteinIrreducible?(p)} returns \\spad{true} if \\spad{p} can be shown to be irreducible by Eisenstein's criterion,{} \\spad{false} is inconclusive.")) (|useEisensteinCriterion| (((|Boolean|) (|Boolean|)) "\\spad{useEisensteinCriterion(b)} chooses whether factorizers check Eisenstein'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's criterion before factoring.")) (|useSingleFactorBound| (((|Boolean|) (|Boolean|)) "\\spad{useSingleFactorBound(b)} chooses the algorithm to be used by the factorizers: \\spad{true} for algorithm with single factor bound,{} \\spad{false} for algorithm with overall bound. Returns the previous value.")) (|useSingleFactorBound?| (((|Boolean|)) "\\spad{useSingleFactorBound?()} returns \\spad{true} if algorithm with single factor bound is used for factorization,{} \\spad{false} for algorithm with overall bound.")) (|modularFactor| (((|Record| (|:| |prime| (|Integer|)) (|:| |factors| (|List| |#1|))) |#1|) "\\spad{modularFactor(f)} chooses a \"good\" prime and returns the factorization of \\spad{f} modulo this prime in a form that may be used by \\spadfunFrom{completeHensel}{GeneralHenselPackage}. If prime is zero it means that \\spad{f} has been proved to be irreducible over the integers or that \\spad{f} is a unit (\\spadignore{i.e.} 1 or \\spad{-1}). \\spad{f} shall be primitive (\\spadignore{i.e.} content(\\spad{p})\\spad{=1}) and square free (\\spadignore{i.e.} without repeated factors).")) (|numberOfFactors| (((|NonNegativeInteger|) (|List| (|Record| (|:| |factor| |#1|) (|:| |degree| (|Integer|))))) "\\spad{numberOfFactors(ddfactorization)} returns the number of factors of the polynomial \\spad{f} modulo \\spad{p} where \\spad{ddfactorization} is the distinct degree factorization of \\spad{f} computed by \\spadfunFrom{ddFact}{ModularDistinctDegreeFactorizer} for some prime \\spad{p}.")) (|stopMusserTrials| (((|PositiveInteger|) (|PositiveInteger|)) "\\spad{stopMusserTrials(n)} sets to \\spad{n} the bound on the number of factors for which \\spadfun{modularFactor} stops to look for an other prime. You will have to remember that the step of recombining the extraneous factors may take up to \\spad{2**n} trials. Returns the previous value.") (((|PositiveInteger|)) "\\spad{stopMusserTrials()} returns the bound on the number of factors for which \\spadfun{modularFactor} stops to look for an other prime. You will have to remember that the step of recombining the extraneous factors may take up to \\spad{2**stopMusserTrials()} trials.")) (|musserTrials| (((|PositiveInteger|) (|PositiveInteger|)) "\\spad{musserTrials(n)} sets to \\spad{n} the number of primes to be tried in \\spadfun{modularFactor} and returns the previous value.") (((|PositiveInteger|)) "\\spad{musserTrials()} returns the number of primes that are tried in \\spadfun{modularFactor}.")) (|degreePartition| (((|Multiset| (|NonNegativeInteger|)) (|List| (|Record| (|:| |factor| |#1|) (|:| |degree| (|Integer|))))) "\\spad{degreePartition(ddfactorization)} returns the degree partition of the polynomial \\spad{f} modulo \\spad{p} where \\spad{ddfactorization} is the distinct degree factorization of \\spad{f} computed by \\spadfunFrom{ddFact}{ModularDistinctDegreeFactorizer} for some prime \\spad{p}.")) (|makeFR| (((|Factored| |#1|) (|Record| (|:| |contp| (|Integer|)) (|:| |factors| (|List| (|Record| (|:| |irr| |#1|) (|:| |pow| (|Integer|))))))) "\\spad{makeFR(flist)} turns the final factorization of henselFact into a \\spadtype{Factored} object."))) NIL NIL -(-457 R UP -4131) +(-457 R UP -4164) ((|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 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'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'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's norm of \\spad{p}.") ((|#3| |#2|) "\\spad{bombieriNorm(p)} returns quadratic Bombieri'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 @@ -1803,7 +1803,7 @@ NIL (-468 |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"))) (((-4512 "*") |has| |#2| (-175)) (-4503 |has| |#2| (-571)) (-4508 |has| |#2| (-6 -4508)) (-4505 . T) (-4504 . T) (-4507 . T)) -((|HasCategory| |#2| (QUOTE (-940))) (-4133 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-466))) (|HasCategory| |#2| (QUOTE (-571))) (|HasCategory| |#2| (QUOTE (-940)))) (-4133 (|HasCategory| |#2| (QUOTE (-466))) (|HasCategory| |#2| (QUOTE (-571))) (|HasCategory| |#2| (QUOTE (-940)))) (-4133 (|HasCategory| |#2| (QUOTE (-466))) (|HasCategory| |#2| (QUOTE (-940)))) (|HasCategory| |#2| (QUOTE (-571))) (|HasCategory| |#2| (QUOTE (-175))) (-4133 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-571)))) (-12 (|HasCategory| (-889 |#1|) (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| |#2| (|%list| (QUOTE -912) (QUOTE (-391))))) (-12 (|HasCategory| (-889 |#1|) (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| |#2| (|%list| (QUOTE -912) (QUOTE (-560))))) (-12 (|HasCategory| (-889 |#1|) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| |#2| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391)))))) (-12 (|HasCategory| (-889 |#1|) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560)))))) (-12 (|HasCategory| (-889 |#1|) (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#2| (|%list| (QUOTE -633) (QUOTE (-549))))) (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-149))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560)))) (-4133 (|HasCategory| |#2| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560)))))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-376))) (|HasAttribute| |#2| (QUOTE -4508)) (|HasCategory| |#2| (QUOTE (-466))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-940)))) (-4133 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-940)))) (|HasCategory| |#2| (QUOTE (-147))))) +((|HasCategory| |#2| (QUOTE (-940))) (-4144 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-466))) (|HasCategory| |#2| (QUOTE (-571))) (|HasCategory| |#2| (QUOTE (-940)))) (-4144 (|HasCategory| |#2| (QUOTE (-466))) (|HasCategory| |#2| (QUOTE (-571))) (|HasCategory| |#2| (QUOTE (-940)))) (-4144 (|HasCategory| |#2| (QUOTE (-466))) (|HasCategory| |#2| (QUOTE (-940)))) (|HasCategory| |#2| (QUOTE (-571))) (|HasCategory| |#2| (QUOTE (-175))) (-4144 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-571)))) (-12 (|HasCategory| (-889 |#1|) (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| |#2| (|%list| (QUOTE -912) (QUOTE (-391))))) (-12 (|HasCategory| (-889 |#1|) (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| |#2| (|%list| (QUOTE -912) (QUOTE (-560))))) (-12 (|HasCategory| (-889 |#1|) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| |#2| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391)))))) (-12 (|HasCategory| (-889 |#1|) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560)))))) (-12 (|HasCategory| (-889 |#1|) (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#2| (|%list| (QUOTE -633) (QUOTE (-549))))) (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-149))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560)))) (-4144 (|HasCategory| |#2| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560)))))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-376))) (|HasAttribute| |#2| (QUOTE -4508)) (|HasCategory| |#2| (QUOTE (-466))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-940)))) (-4144 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-940)))) (|HasCategory| |#2| (QUOTE (-147))))) (-469 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's conditional."))) NIL @@ -1868,7 +1868,7 @@ NIL ((|constructor| (NIL "GradedModule(\\spad{R},{}\\spad{E}) denotes ``E-graded \\spad{R}-module'',{} \\spadignore{i.e.} collection of \\spad{R}-modules indexed by an abelian monoid \\spad{E}. An element \\spad{g} of \\spad{G[s]} for some specific \\spad{s} in \\spad{E} is said to be an element of \\spad{G} with {\\em degree} \\spad{s}. Sums are defined in each module \\spad{G[s]} so two elements of \\spad{G} have a sum if they have the same degree. \\blankline Morphisms can be defined and composed by degree to give the mathematical category of graded modules.")) (+ (($ $ $) "\\spad{g+h} is the sum of \\spad{g} and \\spad{h} in the module of elements of the same degree as \\spad{g} and \\spad{h}. Error: if \\spad{g} and \\spad{h} have different degrees.")) (- (($ $ $) "\\spad{g-h} is the difference of \\spad{g} and \\spad{h} in the module of elements of the same degree as \\spad{g} and \\spad{h}. Error: if \\spad{g} and \\spad{h} have different degrees.") (($ $) "\\spad{-g} is the additive inverse of \\spad{g} in the module of elements of the same grade as \\spad{g}.")) (* (($ $ |#1|) "\\spad{g*r} is right module multiplication.") (($ |#1| $) "\\spad{r*g} is left module multiplication.")) ((|Zero|) (($) "0 denotes the zero of degree 0.")) (|degree| ((|#2| $) "\\spad{degree(g)} names the degree of \\spad{g}. The set of all elements of a given degree form an \\spad{R}-module."))) NIL NIL -(-485 |lv| -4131 R) +(-485 |lv| -4164 R) ((|constructor| (NIL "\\indented{1}{Author : \\spad{P}.Gianni,{} Summer \\spad{'88},{} revised November \\spad{'89}} Solve systems of polynomial equations using Groebner bases Total order Groebner bases are computed and then converted to lex ones This package is mostly intended for internal use.")) (|genericPosition| (((|Record| (|:| |dpolys| (|List| (|DistributedMultivariatePolynomial| |#1| |#2|))) (|:| |coords| (|List| (|Integer|)))) (|List| (|DistributedMultivariatePolynomial| |#1| |#2|)) (|List| (|OrderedVariableList| |#1|))) "\\spad{genericPosition(lp,lv)} puts a radical zero dimensional ideal in general position,{} for system \\spad{lp} in variables \\spad{lv}.")) (|testDim| (((|Union| (|List| (|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|)) "failed") (|List| (|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|)) (|List| (|OrderedVariableList| |#1|))) "\\spad{testDim(lp,lv)} tests if the polynomial system \\spad{lp} in variables \\spad{lv} is zero dimensional.")) (|groebSolve| (((|List| (|List| (|DistributedMultivariatePolynomial| |#1| |#2|))) (|List| (|DistributedMultivariatePolynomial| |#1| |#2|)) (|List| (|OrderedVariableList| |#1|))) "\\spad{groebSolve(lp,lv)} reduces the polynomial system \\spad{lp} in variables \\spad{lv} to triangular form. Algorithm based on groebner bases algorithm with linear algebra for change of ordering. Preprocessing for the general solver. The polynomials in input are of type \\spadtype{DMP}."))) NIL NIL @@ -1883,11 +1883,11 @@ NIL (-488 |Coef| |var| |cen|) ((|constructor| (NIL "This is a category of univariate Puiseux series constructed from univariate Laurent series. A Puiseux series is represented by a pair \\spad{[r,f(x)]},{} where \\spad{r} is a positive rational number and \\spad{f(x)} is a Laurent series. This pair represents the Puiseux series \\spad{f(x\\^r)}.")) (|integrate| (($ $ (|Variable| |#2|)) "\\spad{integrate(f(x))} returns an anti-derivative of the power series \\spad{f(x)} with constant coefficient 0. We may integrate a series when we can divide coefficients by integers.")) (|coerce| (($ (|UnivariatePuiseuxSeries| |#1| |#2| |#3|)) "\\spad{coerce(f)} converts a Puiseux series to a general power series.") (($ (|Variable| |#2|)) "\\spad{coerce(var)} converts the series variable \\spad{var} into a Puiseux series."))) (((-4512 "*") |has| |#1| (-175)) (-4503 |has| |#1| (-571)) (-4508 |has| |#1| (-376)) (-4502 |has| |#1| (-376)) (-4504 . T) (-4505 . T) (-4507 . T)) -((|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-175))) (-4133 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (|%list| (QUOTE -421) (QUOTE (-560))) (|devaluate| |#1|))))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (|%list| (QUOTE -421) (QUOTE (-560))) (|devaluate| |#1|)))) (|HasCategory| (-421 (-560)) (QUOTE (-1144))) (|HasCategory| |#1| (QUOTE (-376))) (-4133 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-571)))) (-4133 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-571)))) (-12 (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (|%list| (QUOTE -421) (QUOTE (-560)))))) (|HasSignature| |#1| (|%list| (QUOTE -4080) (|%list| (|devaluate| |#1|) (QUOTE (-1209)))))) (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (|%list| (QUOTE -421) (QUOTE (-560)))))) (-4133 (-12 (|HasCategory| |#1| (|%list| (QUOTE -29) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-990))) (|HasCategory| |#1| (QUOTE (-1235)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasSignature| |#1| (|%list| (QUOTE -3538) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1209))))) (|HasSignature| |#1| (|%list| (QUOTE -2985) (|%list| (|%list| (QUOTE -663) (QUOTE (-1209))) (|devaluate| |#1|))))))) +((|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-175))) (-4144 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (|%list| (QUOTE -421) (QUOTE (-560))) (|devaluate| |#1|))))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (|%list| (QUOTE -421) (QUOTE (-560))) (|devaluate| |#1|)))) (|HasCategory| (-421 (-560)) (QUOTE (-1144))) (|HasCategory| |#1| (QUOTE (-376))) (-4144 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-571)))) (-4144 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-571)))) (-12 (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (|%list| (QUOTE -421) (QUOTE (-560)))))) (|HasSignature| |#1| (|%list| (QUOTE -3903) (|%list| (|devaluate| |#1|) (QUOTE (-1209)))))) (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (|%list| (QUOTE -421) (QUOTE (-560)))))) (-4144 (-12 (|HasCategory| |#1| (|%list| (QUOTE -29) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-990))) (|HasCategory| |#1| (QUOTE (-1235)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasSignature| |#1| (|%list| (QUOTE -2884) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1209))))) (|HasSignature| |#1| (|%list| (QUOTE -3648) (|%list| (|%list| (QUOTE -663) (QUOTE (-1209))) (|devaluate| |#1|))))))) (-489 |Key| |Entry| |Tbl| |dent|) ((|constructor| (NIL "A sparse table has a default entry,{} which is returned if no other value has been explicitly stored for a key."))) ((-4511 . T)) -((-12 (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-1133))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -1580) (|devaluate| |#1|)) (|%list| (QUOTE |:|) (QUOTE -3432) (|devaluate| |#2|)))))) (-4133 (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-1133))) (|HasCategory| |#2| (QUOTE (-1133)))) (-4133 (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-1133))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-1133)))) (-4133 (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-1133))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (|%list| (QUOTE -633) (QUOTE (-549)))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (|HasCategory| |#1| (QUOTE (-872))) (-4133 (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-102)))) (-4133 (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-1133)))) +((-12 (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-1133))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -2118) (|devaluate| |#1|)) (|%list| (QUOTE |:|) (QUOTE -3964) (|devaluate| |#2|)))))) (-4144 (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-1133))) (|HasCategory| |#2| (QUOTE (-1133)))) (-4144 (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-1133))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-1133)))) (-4144 (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-1133))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (|%list| (QUOTE -633) (QUOTE (-549)))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (|HasCategory| |#1| (QUOTE (-872))) (-4144 (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-102)))) (-4144 (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-1133)))) (-490 R E V P) ((|constructor| (NIL "A domain constructor of the category \\axiomType{TriangularSetCategory}. The only requirement for a list of polynomials to be a member of such a domain is the following: no polynomial is constant and two distinct polynomials have distinct main variables. Such a triangular set may not be auto-reduced or consistent. Triangular sets are stored as sorted lists \\spad{w}.\\spad{r}.\\spad{t}. the main variables of their members but they are displayed in reverse order.\\newline References : \\indented{1}{[1] \\spad{P}. AUBRY,{} \\spad{D}. LAZARD and \\spad{M}. MORENO MAZA \"On the Theories} \\indented{5}{of Triangular Sets\" Journal of Symbol. Comp. (to appear)}"))) ((-4511 . T) (-4510 . T)) @@ -1903,7 +1903,7 @@ NIL (-493 |Key| |Entry| |hashfn|) ((|constructor| (NIL "This domain provides access to the underlying Lisp hash tables. By varying the hashfn parameter,{} tables suited for different purposes can be obtained."))) ((-4510 . T) (-4511 . T)) -((-12 (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-1133))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -1580) (|devaluate| |#1|)) (|%list| (QUOTE |:|) (QUOTE -3432) (|devaluate| |#2|)))))) (-4133 (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-1133))) (|HasCategory| |#2| (QUOTE (-1133)))) (-4133 (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-1133))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-1133)))) (-4133 (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-1133))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (|%list| (QUOTE -633) (QUOTE (-549)))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-1133))) (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#2| (QUOTE (-1133))) (-4133 (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888))))) (-4133 (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-102)))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-102)))) +((-12 (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-1133))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -2118) (|devaluate| |#1|)) (|%list| (QUOTE |:|) (QUOTE -3964) (|devaluate| |#2|)))))) (-4144 (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-1133))) (|HasCategory| |#2| (QUOTE (-1133)))) (-4144 (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-1133))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-1133)))) (-4144 (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-1133))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (|%list| (QUOTE -633) (QUOTE (-549)))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-1133))) (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#2| (QUOTE (-1133))) (-4144 (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888))))) (-4144 (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-102)))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-102)))) (-494) ((|constructor| (NIL "\\indented{1}{Author : Larry Lambe} Date Created : August 1988 Date Last Updated : March 9 1990 Related Constructors: OrderedSetInts,{} Commutator,{} FreeNilpotentLie AMS Classification: Primary 17B05,{} 17B30; Secondary 17A50 Keywords: free Lie algebra,{} Hall basis,{} basic commutators Description : Generate a basis for the free Lie algebra on \\spad{n} generators over a ring \\spad{R} with identity up to basic commutators of length \\spad{c} using the algorithm of \\spad{P}. Hall as given in Serre's book Lie Groups -- 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{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 @@ -1911,11 +1911,11 @@ NIL (-495 |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"))) (((-4512 "*") |has| |#2| (-175)) (-4503 |has| |#2| (-571)) (-4508 |has| |#2| (-6 -4508)) (-4505 . T) (-4504 . T) (-4507 . T)) -((|HasCategory| |#2| (QUOTE (-940))) (-4133 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-466))) (|HasCategory| |#2| (QUOTE (-571))) (|HasCategory| |#2| (QUOTE (-940)))) (-4133 (|HasCategory| |#2| (QUOTE (-466))) (|HasCategory| |#2| (QUOTE (-571))) (|HasCategory| |#2| (QUOTE (-940)))) (-4133 (|HasCategory| |#2| (QUOTE (-466))) (|HasCategory| |#2| (QUOTE (-940)))) (|HasCategory| |#2| (QUOTE (-571))) (|HasCategory| |#2| (QUOTE (-175))) (-4133 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-571)))) (-12 (|HasCategory| (-889 |#1|) (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| |#2| (|%list| (QUOTE -912) (QUOTE (-391))))) (-12 (|HasCategory| (-889 |#1|) (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| |#2| (|%list| (QUOTE -912) (QUOTE (-560))))) (-12 (|HasCategory| (-889 |#1|) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| |#2| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391)))))) (-12 (|HasCategory| (-889 |#1|) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560)))))) (-12 (|HasCategory| (-889 |#1|) (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#2| (|%list| (QUOTE -633) (QUOTE (-549))))) (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-149))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560)))) (-4133 (|HasCategory| |#2| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560)))))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-376))) (|HasAttribute| |#2| (QUOTE -4508)) (|HasCategory| |#2| (QUOTE (-466))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-940)))) (-4133 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-940)))) (|HasCategory| |#2| (QUOTE (-147))))) -(-496 -4478 S) +((|HasCategory| |#2| (QUOTE (-940))) (-4144 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-466))) (|HasCategory| |#2| (QUOTE (-571))) (|HasCategory| |#2| (QUOTE (-940)))) (-4144 (|HasCategory| |#2| (QUOTE (-466))) (|HasCategory| |#2| (QUOTE (-571))) (|HasCategory| |#2| (QUOTE (-940)))) (-4144 (|HasCategory| |#2| (QUOTE (-466))) (|HasCategory| |#2| (QUOTE (-940)))) (|HasCategory| |#2| (QUOTE (-571))) (|HasCategory| |#2| (QUOTE (-175))) (-4144 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-571)))) (-12 (|HasCategory| (-889 |#1|) (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| |#2| (|%list| (QUOTE -912) (QUOTE (-391))))) (-12 (|HasCategory| (-889 |#1|) (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| |#2| (|%list| (QUOTE -912) (QUOTE (-560))))) (-12 (|HasCategory| (-889 |#1|) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| |#2| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391)))))) (-12 (|HasCategory| (-889 |#1|) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560)))))) (-12 (|HasCategory| (-889 |#1|) (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#2| (|%list| (QUOTE -633) (QUOTE (-549))))) (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-149))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560)))) (-4144 (|HasCategory| |#2| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560)))))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-376))) (|HasAttribute| |#2| (QUOTE -4508)) (|HasCategory| |#2| (QUOTE (-466))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-940)))) (-4144 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-940)))) (|HasCategory| |#2| (QUOTE (-147))))) +(-496 -2127 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}."))) ((-4504 |has| |#2| (-1081)) (-4505 |has| |#2| (-1081)) (-4507 |has| |#2| (-6 -4507)) (-4510 . T)) -((-4133 (-12 (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-748))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-817))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-872))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))))) (-4133 (-12 (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-1081)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-1133)))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-1081)))) (-12 (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209))))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#2| (QUOTE (-376))) (-4133 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1081)))) (-4133 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-376)))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (QUOTE (-748))) (|HasCategory| |#2| (QUOTE (-817))) (-4133 (|HasCategory| |#2| (QUOTE (-817))) (|HasCategory| |#2| (QUOTE (-872)))) (|HasCategory| |#2| (QUOTE (-872))) (|HasCategory| |#2| (QUOTE (-381))) (-4133 (-12 (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-175)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-240)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-376)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-1081))))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (-4133 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (QUOTE (-748))) (|HasCategory| |#2| (QUOTE (-817))) (|HasCategory| |#2| (QUOTE (-872))) (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (QUOTE (-1133)))) (-4133 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (QUOTE (-748))) (|HasCategory| |#2| (QUOTE (-817))) (|HasCategory| |#2| (QUOTE (-872))) (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (QUOTE (-1133)))) (-4133 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1081)))) (-4133 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1081)))) (-4133 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1081)))) (-4133 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1081)))) (-4133 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-1081)))) (|HasCategory| |#2| (QUOTE (-240))) (-4133 (|HasCategory| |#2| (QUOTE (-240))) (-12 (|HasCategory| |#2| (QUOTE (-239))) (|HasCategory| |#2| (QUOTE (-1081))))) (-4133 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (-12 (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (|%list| (QUOTE -930) (QUOTE (-1209)))))) (|HasCategory| |#2| (QUOTE (-1133))) (-4133 (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-21)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-23)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-25)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-133)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-175)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-240)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-376)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-381)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-748)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-817)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-872)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-1081)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-1133))))) (-4133 (-12 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-748))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-817))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-872))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-1081))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560)))))) (-4133 (-12 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-748))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-817))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-872))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560)))))) (|HasCategory| (-560) (QUOTE (-872))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-1081)))) (-12 (|HasCategory| |#2| (QUOTE (-239))) (|HasCategory| |#2| (QUOTE (-1081)))) (-12 (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (|%list| (QUOTE -930) (QUOTE (-1209))))) (-4133 (|HasCategory| |#2| (QUOTE (-1081))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560)))))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-1133)))) (|HasAttribute| |#2| (QUOTE -4507)) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-1081)))) (-12 (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209))))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#2| (QUOTE (-102))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|))))) +((-4144 (-12 (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-748))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-817))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-872))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))))) (-4144 (-12 (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-1081)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-1133)))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-1081)))) (-12 (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209))))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#2| (QUOTE (-376))) (-4144 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1081)))) (-4144 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-376)))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (QUOTE (-748))) (|HasCategory| |#2| (QUOTE (-817))) (-4144 (|HasCategory| |#2| (QUOTE (-817))) (|HasCategory| |#2| (QUOTE (-872)))) (|HasCategory| |#2| (QUOTE (-872))) (|HasCategory| |#2| (QUOTE (-381))) (-4144 (-12 (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-175)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-240)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-376)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-1081))))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (-4144 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (QUOTE (-748))) (|HasCategory| |#2| (QUOTE (-817))) (|HasCategory| |#2| (QUOTE (-872))) (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (QUOTE (-1133)))) (-4144 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (QUOTE (-748))) (|HasCategory| |#2| (QUOTE (-817))) (|HasCategory| |#2| (QUOTE (-872))) (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (QUOTE (-1133)))) (-4144 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1081)))) (-4144 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1081)))) (-4144 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1081)))) (-4144 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1081)))) (-4144 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-1081)))) (|HasCategory| |#2| (QUOTE (-240))) (-4144 (|HasCategory| |#2| (QUOTE (-240))) (-12 (|HasCategory| |#2| (QUOTE (-239))) (|HasCategory| |#2| (QUOTE (-1081))))) (-4144 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (-12 (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (|%list| (QUOTE -930) (QUOTE (-1209)))))) (|HasCategory| |#2| (QUOTE (-1133))) (-4144 (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-21)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-23)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-25)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-133)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-175)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-240)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-376)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-381)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-748)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-817)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-872)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-1081)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-1133))))) (-4144 (-12 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-748))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-817))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-872))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-1081))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560)))))) (-4144 (-12 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-748))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-817))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-872))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560)))))) (|HasCategory| (-560) (QUOTE (-872))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-1081)))) (-12 (|HasCategory| |#2| (QUOTE (-239))) (|HasCategory| |#2| (QUOTE (-1081)))) (-12 (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (|%list| (QUOTE -930) (QUOTE (-1209))))) (-4144 (|HasCategory| |#2| (QUOTE (-1081))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560)))))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-1133)))) (|HasAttribute| |#2| (QUOTE -4507)) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-1081)))) (-12 (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209))))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#2| (QUOTE (-102))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|))))) (-497) ((|constructor| (NIL "This domain represents the header of a definition.")) (|parameters| (((|List| (|ParameterAst|)) $) "\\spad{parameters(h)} gives the parameters specified in the definition header `h'.")) (|name| (((|Identifier|) $) "\\spad{name(h)} returns the name of the operation defined defined.")) (|headAst| (($ (|Identifier|) (|List| (|ParameterAst|))) "\\spad{headAst(f,[x1,..,xn])} constructs a function definition header."))) NIL @@ -1923,8 +1923,8 @@ NIL (-498 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}."))) ((-4510 . T) (-4511 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1133))) (-4133 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1133)))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102)))) -(-499 -4131 UP UPUP R) +((-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1133))) (-4144 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1133)))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102)))) +(-499 -4164 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}'s are integers and the \\spad{P}'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 @@ -1935,7 +1935,7 @@ NIL (-501) ((|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."))) ((-4502 . T) (-4508 . T) (-4503 . T) ((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) -((|HasCategory| (-560) (QUOTE (-940))) (|HasCategory| (-560) (|%list| (QUOTE -1070) (QUOTE (-1209)))) (|HasCategory| (-560) (QUOTE (-147))) (|HasCategory| (-560) (QUOTE (-149))) (|HasCategory| (-560) (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| (-560) (QUOTE (-1052))) (|HasCategory| (-560) (QUOTE (-844))) (|HasCategory| (-560) (QUOTE (-872))) (-4133 (|HasCategory| (-560) (QUOTE (-844))) (|HasCategory| (-560) (QUOTE (-872)))) (|HasCategory| (-560) (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| (-560) (QUOTE (-1184))) (|HasCategory| (-560) (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| (-560) (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| (-560) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| (-560) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| (-560) (QUOTE (-239))) (|HasCategory| (-560) (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| (-560) (QUOTE (-240))) (|HasCategory| (-560) (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| (-560) (|%list| (QUOTE -528) (QUOTE (-1209)) (QUOTE (-560)))) (|HasCategory| (-560) (|%list| (QUOTE -321) (QUOTE (-560)))) (|HasCategory| (-560) (|%list| (QUOTE -298) (QUOTE (-560)) (QUOTE (-560)))) (|HasCategory| (-560) (QUOTE (-319))) (|HasCategory| (-560) (QUOTE (-559))) (|HasCategory| (-560) (|%list| (QUOTE -660) (QUOTE (-560)))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-560) (QUOTE (-940)))) (-4133 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-560) (QUOTE (-940)))) (|HasCategory| (-560) (QUOTE (-147))))) +((|HasCategory| (-560) (QUOTE (-940))) (|HasCategory| (-560) (|%list| (QUOTE -1070) (QUOTE (-1209)))) (|HasCategory| (-560) (QUOTE (-147))) (|HasCategory| (-560) (QUOTE (-149))) (|HasCategory| (-560) (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| (-560) (QUOTE (-1052))) (|HasCategory| (-560) (QUOTE (-844))) (|HasCategory| (-560) (QUOTE (-872))) (-4144 (|HasCategory| (-560) (QUOTE (-844))) (|HasCategory| (-560) (QUOTE (-872)))) (|HasCategory| (-560) (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| (-560) (QUOTE (-1184))) (|HasCategory| (-560) (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| (-560) (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| (-560) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| (-560) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| (-560) (QUOTE (-239))) (|HasCategory| (-560) (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| (-560) (QUOTE (-240))) (|HasCategory| (-560) (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| (-560) (|%list| (QUOTE -528) (QUOTE (-1209)) (QUOTE (-560)))) (|HasCategory| (-560) (|%list| (QUOTE -321) (QUOTE (-560)))) (|HasCategory| (-560) (|%list| (QUOTE -298) (QUOTE (-560)) (QUOTE (-560)))) (|HasCategory| (-560) (QUOTE (-319))) (|HasCategory| (-560) (QUOTE (-559))) (|HasCategory| (-560) (|%list| (QUOTE -660) (QUOTE (-560)))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-560) (QUOTE (-940)))) (-4144 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-560) (QUOTE (-940)))) (|HasCategory| (-560) (QUOTE (-147))))) (-502 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 @@ -1960,7 +1960,7 @@ NIL ((|constructor| (NIL "Category for the hyperbolic trigonometric functions.")) (|tanh| (($ $) "\\spad{tanh(x)} returns the hyperbolic tangent of \\spad{x}.")) (|sinh| (($ $) "\\spad{sinh(x)} returns the hyperbolic sine of \\spad{x}.")) (|sech| (($ $) "\\spad{sech(x)} returns the hyperbolic secant of \\spad{x}.")) (|csch| (($ $) "\\spad{csch(x)} returns the hyperbolic cosecant of \\spad{x}.")) (|coth| (($ $) "\\spad{coth(x)} returns the hyperbolic cotangent of \\spad{x}.")) (|cosh| (($ $) "\\spad{cosh(x)} returns the hyperbolic cosine of \\spad{x}."))) NIL NIL -(-508 -4131 UP |AlExt| |AlPol|) +(-508 -4164 UP |AlExt| |AlPol|) ((|constructor| (NIL "Factorization of univariate polynomials with coefficients in an algebraic extension of a field over which we can factor UP'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 @@ -1971,16 +1971,16 @@ NIL (-510 S |mn|) ((|constructor| (NIL "\\indented{1}{Author Micheal Monagan \\spad{Aug/87}} This is the basic one dimensional array data type."))) ((-4511 . T) (-4510 . T)) -((-4133 (-12 (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549)))) (-4133 (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133)))) (|HasCategory| |#1| (QUOTE (-872))) (-4133 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133)))) (|HasCategory| (-560) (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) +((-4144 (-12 (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549)))) (-4144 (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133)))) (|HasCategory| |#1| (QUOTE (-872))) (-4144 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133)))) (|HasCategory| (-560) (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-511 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'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."))) ((-4510 . T) (-4511 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1133))) (-4133 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1133)))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102)))) +((-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1133))) (-4144 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1133)))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102)))) (-512 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 -(-513 R UP -4131) +(-513 R UP -4164) ((|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 gcd of the entries of the \\spad{n}-by-\\spad{n} upper-triangular matrix \\spad{mat}.")) (|diagonalProduct| ((|#1| (|Matrix| |#1|)) "\\spad{diagonalProduct(m)} returns the product of the elements on the diagonal of the matrix \\spad{m}")) (|squareFree| (((|Factored| $) $) "\\spad{squareFree(x)} returns a square-free factorisation of \\spad{x}"))) NIL NIL @@ -2000,7 +2000,7 @@ NIL ((|constructor| (NIL "InnerCommonDenominator provides functions to compute the common denominator of a finite linear aggregate of elements of the quotient field of an integral domain.")) (|splitDenominator| (((|Record| (|:| |num| |#3|) (|:| |den| |#1|)) |#4|) "\\spad{splitDenominator([q1,...,qn])} returns \\spad{[[p1,...,pn], d]} such that \\spad{qi = pi/d} and \\spad{d} is a common denominator for the \\spad{qi}'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}'s.")) (|commonDenominator| ((|#1| |#4|) "\\spad{commonDenominator([q1,...,qn])} returns a common denominator \\spad{d} for \\spad{q1},{}...,{}qn."))) NIL NIL -(-518 -4131 |Expon| |VarSet| |DPoly|) +(-518 -4164 |Expon| |VarSet| |DPoly|) ((|constructor| (NIL "This domain represents polynomial ideals with coefficients in any field and supports the basic ideal operations,{} including intersection sum and quotient. An ideal is represented by a list of polynomials (the generators of the ideal) and a boolean that is \\spad{true} if the generators are a Groebner basis. The algorithms used are based on Groebner basis computations. The ordering is determined by the datatype of the input polynomials. Users may use refinements of total degree orderings.")) (|relationsIdeal| (((|SuchThat| (|List| (|Polynomial| |#1|)) (|List| (|Equation| (|Polynomial| |#1|)))) (|List| |#4|)) "\\spad{relationsIdeal(polyList)} returns the ideal of relations among the polynomials in \\spad{polyList}.")) (|saturate| (($ $ |#4| (|List| |#3|)) "\\spad{saturate(I,f,lvar)} is the saturation with respect to the prime principal ideal which is generated by \\spad{f} in the polynomial ring \\spad{F[lvar]}.") (($ $ |#4|) "\\spad{saturate(I,f)} is the saturation of the ideal \\spad{I} with respect to the multiplicative set generated by the polynomial \\spad{f}.")) (|coerce| (($ (|List| |#4|)) "\\spad{coerce(polyList)} converts the list of polynomials \\spad{polyList} to an ideal.")) (|generators| (((|List| |#4|) $) "\\spad{generators(I)} returns a list of generators for the ideal \\spad{I}.")) (|groebner?| (((|Boolean|) $) "\\spad{groebner?(I)} tests if the generators of the ideal \\spad{I} are a Groebner basis.")) (|groebnerIdeal| (($ (|List| |#4|)) "\\spad{groebnerIdeal(polyList)} constructs the ideal generated by the list of polynomials \\spad{polyList} which are assumed to be a Groebner basis. Note: this operation avoids a Groebner basis computation.")) (|ideal| (($ (|List| |#4|)) "\\spad{ideal(polyList)} constructs the ideal generated by the list of polynomials \\spad{polyList}.")) (|leadingIdeal| (($ $) "\\spad{leadingIdeal(I)} is the ideal generated by the leading terms of the elements of the ideal \\spad{I}.")) (|dimension| (((|Integer|) $) "\\spad{dimension(I)} gives the dimension of the ideal \\spad{I}. in the ring \\spad{F[lvar]},{} where lvar are the variables appearing in \\spad{I}") (((|Integer|) $ (|List| |#3|)) "\\spad{dimension(I,lvar)} gives the dimension of the ideal \\spad{I},{} in the ring \\spad{F[lvar]}")) (|backOldPos| (($ (|Record| (|:| |mval| (|Matrix| |#1|)) (|:| |invmval| (|Matrix| |#1|)) (|:| |genIdeal| $))) "\\spad{backOldPos(genPos)} takes the result produced by \\spadfunFrom{generalPosition}{PolynomialIdeals} and performs the inverse transformation,{} returning the original ideal \\spad{backOldPos(generalPosition(I,listvar))} = \\spad{I}.")) (|generalPosition| (((|Record| (|:| |mval| (|Matrix| |#1|)) (|:| |invmval| (|Matrix| |#1|)) (|:| |genIdeal| $)) $ (|List| |#3|)) "\\spad{generalPosition(I,listvar)} perform a random linear transformation on the variables in \\spad{listvar} and returns the transformed ideal along with the change of basis matrix.")) (|groebner| (($ $) "\\spad{groebner(I)} returns a set of generators of \\spad{I} that are a Groebner basis for \\spad{I}.")) (|quotient| (($ $ |#4|) "\\spad{quotient(I,f)} computes the quotient of the ideal \\spad{I} by the principal ideal generated by the polynomial \\spad{f},{} \\spad{(I:(f))}.") (($ $ $) "\\spad{quotient(I,J)} computes the quotient of the ideals \\spad{I} and \\spad{J},{} \\spad{(I:J)}.")) (|intersect| (($ (|List| $)) "\\spad{intersect(LI)} computes the intersection of the list of ideals \\spad{LI}.") (($ $ $) "\\spad{intersect(I,J)} computes the intersection of the ideals \\spad{I} and \\spad{J}.")) (|zeroDim?| (((|Boolean|) $) "\\spad{zeroDim?(I)} tests if the ideal \\spad{I} is zero dimensional,{} \\spadignore{i.e.} all its associated primes are maximal,{} in the ring \\spad{F[lvar]},{} where lvar are the variables appearing in \\spad{I}") (((|Boolean|) $ (|List| |#3|)) "\\spad{zeroDim?(I,lvar)} tests if the ideal \\spad{I} is zero dimensional,{} \\spadignore{i.e.} all its associated primes are maximal,{} in the ring \\spad{F[lvar]}")) (|inRadical?| (((|Boolean|) |#4| $) "\\spad{inRadical?(f,I)} tests if some power of the polynomial \\spad{f} belongs to the ideal \\spad{I}.")) (|in?| (((|Boolean|) $ $) "\\spad{in?(I,J)} tests if the ideal \\spad{I} is contained in the ideal \\spad{J}.")) (|element?| (((|Boolean|) |#4| $) "\\spad{element?(f,I)} tests whether the polynomial \\spad{f} belongs to the ideal \\spad{I}.")) (|zero?| (((|Boolean|) $) "\\spad{zero?(I)} tests whether the ideal \\spad{I} is the zero ideal")) (|one?| (((|Boolean|) $) "\\spad{one?(I)} tests whether the ideal \\spad{I} is the unit ideal,{} \\spadignore{i.e.} contains 1.")) (+ (($ $ $) "\\spad{I+J} computes the ideal generated by the union of \\spad{I} and \\spad{J}.")) (** (($ $ (|NonNegativeInteger|)) "\\spad{I**n} computes the \\spad{n}th power of the ideal \\spad{I}.")) (* (($ $ $) "\\spad{I*J} computes the product of the ideal \\spad{I} and \\spad{J}."))) NIL ((|HasCategory| |#3| (|%list| (QUOTE -633) (QUOTE (-1209))))) @@ -2051,7 +2051,7 @@ NIL (-530 S |mn|) ((|constructor| (NIL "\\indented{1}{Author: Michael Monagan \\spad{July/87},{} modified SMW \\spad{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}"))) ((-4511 . T) (-4510 . T)) -((-4133 (-12 (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549)))) (-4133 (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133)))) (|HasCategory| |#1| (QUOTE (-872))) (-4133 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133)))) (|HasCategory| (-560) (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) +((-4144 (-12 (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549)))) (-4144 (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133)))) (|HasCategory| |#1| (QUOTE (-872))) (-4144 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133)))) (|HasCategory| (-560) (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-531) ((|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 @@ -2059,15 +2059,15 @@ NIL (-532 |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}."))) ((-4502 . T) (-4508 . T) (-4503 . T) ((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) -((-4133 (|HasCategory| (-595 |#1|) (QUOTE (-147))) (|HasCategory| (-595 |#1|) (QUOTE (-381)))) (|HasCategory| (-595 |#1|) (QUOTE (-149))) (|HasCategory| (-595 |#1|) (QUOTE (-381))) (|HasCategory| (-595 |#1|) (QUOTE (-147)))) +((-4144 (|HasCategory| (-595 |#1|) (QUOTE (-147))) (|HasCategory| (-595 |#1|) (QUOTE (-381)))) (|HasCategory| (-595 |#1|) (QUOTE (-149))) (|HasCategory| (-595 |#1|) (QUOTE (-381))) (|HasCategory| (-595 |#1|) (QUOTE (-147)))) (-533 R |mnRow| |mnCol| |Row| |Col|) ((|constructor| (NIL "\\indented{1}{This is an internal type which provides an implementation of} 2-dimensional arrays as PrimitiveArray's of PrimitiveArray's."))) ((-4510 . T) (-4511 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1133))) (-4133 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1133)))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102)))) +((-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1133))) (-4144 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1133)))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102)))) (-534 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."))) ((-4511 . T) (-4510 . T)) -((-4133 (-12 (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549)))) (-4133 (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133)))) (|HasCategory| |#1| (QUOTE (-872))) (-4133 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133)))) (|HasCategory| (-560) (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) +((-4144 (-12 (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549)))) (-4144 (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133)))) (|HasCategory| |#1| (QUOTE (-872))) (-4144 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133)))) (|HasCategory| (-560) (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-535 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,{} m*h and 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 @@ -2079,7 +2079,7 @@ NIL (-537 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."))) ((-4510 . T) (-4511 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1133))) (-4133 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1133)))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-571))) (|HasAttribute| |#1| (QUOTE (-4512 "*"))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102)))) +((-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1133))) (-4144 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1133)))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-571))) (|HasAttribute| |#1| (QUOTE (-4512 "*"))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102)))) (-538) ((|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 @@ -2112,7 +2112,7 @@ NIL ((|constructor| (NIL "\\indented{2}{IndexedExponents of an ordered set of variables gives a representation} for the degree of polynomials in commuting variables. It gives an ordered pairing of non negative integer exponents with variables"))) NIL ((-12 (|HasCategory| (-793) (QUOTE (-1133))) (|HasCategory| |#1| (QUOTE (-1133))))) -(-546 K -4131 |Par|) +(-546 K -4164 |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 br used to reduce the characteristic polynomial into irreducible factors.")) (|solve1| (((|List| |#2|) (|SparseUnivariatePolynomial| |#1|) |#3|) "\\spad{solve1(pol, eps)} finds the roots of the univariate polynomial polynomial \\spad{pol} to precision eps. If \\spad{K} is \\spad{Fraction Integer} then only the real roots are returned,{} if \\spad{K} is \\spad{Complex Fraction Integer} then all roots are found.")) (|charpol| (((|SparseUnivariatePolynomial| |#1|) (|Matrix| |#1|)) "\\spad{charpol(m)} computes the characteristic polynomial of a matrix \\spad{m} with entries in \\spad{K}. This function returns a polynomial over \\spad{K},{} while the general one (that is in EiegenPackage) returns Fraction \\spad{P} \\spad{K}"))) NIL NIL @@ -2136,7 +2136,7 @@ NIL ((|constructor| (NIL "This package computes infinite products of univariate Taylor series over an integral domain of characteristic 0.")) (|generalInfiniteProduct| ((|#2| |#2| (|Integer|) (|Integer|)) "\\spad{generalInfiniteProduct(f(x),a,d)} computes \\spad{product(n=a,a+d,a+2*d,...,f(x**n))}. The series \\spad{f(x)} should have constant coefficient 1.")) (|oddInfiniteProduct| ((|#2| |#2|) "\\spad{oddInfiniteProduct(f(x))} computes \\spad{product(n=1,3,5...,f(x**n))}. The series \\spad{f(x)} should have constant coefficient 1.")) (|evenInfiniteProduct| ((|#2| |#2|) "\\spad{evenInfiniteProduct(f(x))} computes \\spad{product(n=2,4,6...,f(x**n))}. The series \\spad{f(x)} should have constant coefficient 1.")) (|infiniteProduct| ((|#2| |#2|) "\\spad{infiniteProduct(f(x))} computes \\spad{product(n=1,2,3...,f(x**n))}. The series \\spad{f(x)} should have constant coefficient 1."))) NIL NIL -(-552 K -4131 |Par|) +(-552 K -4164 |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 @@ -2191,12 +2191,12 @@ NIL (-565 |Key| |Entry| |addDom|) ((|constructor| (NIL "This domain is used to provide a conditional \"add\" domain for the implementation of \\spadtype{Table}."))) ((-4510 . T) (-4511 . T)) -((-12 (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-1133))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -1580) (|devaluate| |#1|)) (|%list| (QUOTE |:|) (QUOTE -3432) (|devaluate| |#2|)))))) (-4133 (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-1133))) (|HasCategory| |#2| (QUOTE (-1133)))) (-4133 (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-1133))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-1133)))) (-4133 (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-1133))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (|%list| (QUOTE -633) (QUOTE (-549)))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-1133))) (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#2| (QUOTE (-1133))) (-4133 (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888))))) (-4133 (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-102)))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-102)))) -(-566 R -4131) +((-12 (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-1133))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -2118) (|devaluate| |#1|)) (|%list| (QUOTE |:|) (QUOTE -3964) (|devaluate| |#2|)))))) (-4144 (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-1133))) (|HasCategory| |#2| (QUOTE (-1133)))) (-4144 (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-1133))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-1133)))) (-4144 (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-1133))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (|%list| (QUOTE -633) (QUOTE (-549)))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-1133))) (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#2| (QUOTE (-1133))) (-4144 (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888))))) (-4144 (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-102)))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-102)))) +(-566 R -4164) ((|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 -(-567 R0 -4131 UP UPUP R) +(-567 R0 -4164 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 @@ -2206,7 +2206,7 @@ NIL NIL (-569 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{sup}} or \\axiom{[\\spad{sup},{}in]} otherwise."))) -((-2793 . T) (-4503 . T) ((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) +((-2862 . T) (-4503 . T) ((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) NIL (-570 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."))) @@ -2216,7 +2216,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."))) ((-4503 . T) ((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) NIL -(-572 R -4131) +(-572 R -4164) ((|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},{}...,{}kn (the \\spad{ki}'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}'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 @@ -2228,7 +2228,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 -(-575 R -4131 L) +(-575 R -4164 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}'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}'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 -680) (|devaluate| |#2|)))) @@ -2236,11 +2236,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 -(-577 -4131 UP UPUP R) +(-577 -4164 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 -(-578 -4131 UP) +(-578 -4164 UP) ((|constructor| (NIL "Hermite integration,{} transcendental case.")) (|HermiteIntegrate| (((|Record| (|:| |answer| (|Fraction| |#2|)) (|:| |logpart| (|Fraction| |#2|)) (|:| |specpart| (|Fraction| |#2|)) (|:| |polypart| |#2|)) (|Fraction| |#2|) (|Mapping| |#2| |#2|)) "\\spad{HermiteIntegrate(f, D)} returns \\spad{[g, h, s, p]} such that \\spad{f = Dg + h + s + p},{} \\spad{h} has a squarefree denominator normal \\spad{w}.\\spad{r}.\\spad{t}. \\spad{D},{} and all the squarefree factors of the denominator of \\spad{s} are special \\spad{w}.\\spad{r}.\\spad{t}. \\spad{D}. Furthermore,{} \\spad{h} and \\spad{s} have no polynomial parts. \\spad{D} is the derivation to use on \\spadtype{UP}."))) NIL NIL @@ -2248,15 +2248,15 @@ NIL ((|measure| (((|Record| (|:| |measure| (|Float|)) (|:| |name| (|String|)) (|:| |explanations| (|List| (|String|))) (|:| |extra| (|Result|))) (|NumericalIntegrationProblem|) (|RoutinesTable|)) "\\spad{measure(prob,R)} is a top level ANNA function for identifying the most appropriate numerical routine from those in the routines table provided for solving the numerical integration problem defined by \\axiom{\\spad{prob}}. \\blankline It calls each \\axiom{domain} listed in \\axiom{\\spad{R}} of \\axiom{category} \\axiomType{NumericalIntegrationCategory} in turn to calculate all measures and returns the best \\spadignore{i.e.} the name of the most appropriate domain and any other relevant information.") (((|Record| (|:| |measure| (|Float|)) (|:| |name| (|String|)) (|:| |explanations| (|List| (|String|))) (|:| |extra| (|Result|))) (|NumericalIntegrationProblem|)) "\\spad{measure(prob)} is a top level ANNA function for identifying the most appropriate numerical routine for solving the numerical integration problem defined by \\axiom{\\spad{prob}}. \\blankline It calls each \\axiom{domain} of \\axiom{category} \\axiomType{NumericalIntegrationCategory} in turn to calculate all measures and returns the best \\spadignore{i.e.} the name of the most appropriate domain and any other relevant information.")) (|integrate| (((|Union| (|Result|) "failed") (|Expression| (|Float|)) (|SegmentBinding| (|OrderedCompletion| (|Float|))) (|Symbol|)) "\\spad{integrate(exp, x = a..b, numerical)} is a top level ANNA function to integrate an expression,{} {\\tt \\spad{exp}},{} over a given range,{} {\\tt a} to {\\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 {\\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,{} {\\tt \\spad{exp}},{} over a given range,{} {\\tt a} to {\\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 {\\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,{} {\\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,{} {\\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,{} {\\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,{} {\\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,{} {\\tt \\spad{exp}},{} over a given range {\\tt a} to {\\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,{} {\\tt \\spad{exp}},{} over a given range {\\tt a} to {\\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,{} {\\tt \\spad{exp}},{} over a given range {\\tt a} to {\\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,{} {\\tt \\spad{exp}},{} over a given range {\\tt a} to {\\tt \\spad{b}} to the required absolute and relative accuracy using the routines available in the RoutinesTable provided. \\blankline It iterates over the \\axiom{domains} of \\axiomType{NumericalIntegrationCategory} to get the name and other relevant information of the the (domain of the) numerical routine likely to be the most appropriate,{} \\spadignore{i.e.} have the best \\axiom{measure}. \\blankline It then performs the integration of the given expression on that \\axiom{domain}."))) NIL NIL -(-580 R -4131 L) +(-580 R -4164 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}'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 -680) (|devaluate| |#2|)))) -(-581 R -4131) +(-581 R -4164) ((|constructor| (NIL "\\spadtype{PatternMatchIntegration} provides functions that use the pattern matcher to find some indefinite and definite integrals involving special functions and found in the litterature.")) (|pmintegrate| (((|Union| |#2| "failed") |#2| (|Symbol|) (|OrderedCompletion| |#2|) (|OrderedCompletion| |#2|)) "\\spad{pmintegrate(f, x = a..b)} returns the integral of \\spad{f(x)dx} from a to \\spad{b} if it can be found by the built-in pattern matching rules.") (((|Union| (|Record| (|:| |special| |#2|) (|:| |integrand| |#2|)) "failed") |#2| (|Symbol|)) "\\spad{pmintegrate(f, x)} returns either \"failed\" or \\spad{[g,h]} such that \\spad{integrate(f,x) = g + integrate(h,x)}.")) (|pmComplexintegrate| (((|Union| (|Record| (|:| |special| |#2|) (|:| |integrand| |#2|)) "failed") |#2| (|Symbol|)) "\\spad{pmComplexintegrate(f, x)} returns either \"failed\" or \\spad{[g,h]} such that \\spad{integrate(f,x) = g + integrate(h,x)}. It only looks for special complex integrals that pmintegrate does not return.")) (|splitConstant| (((|Record| (|:| |const| |#2|) (|:| |nconst| |#2|)) |#2| (|Symbol|)) "\\spad{splitConstant(f, x)} returns \\spad{[c, g]} such that \\spad{f = c * g} and \\spad{c} does not involve \\spad{t}."))) NIL ((-12 (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-1171)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-649))))) -(-582 -4131 UP) +(-582 -4164 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}'s are among \\spad{[g1,...,gn]},{} \\spad{ci' = 0},{} and \\spad{(h+sum(ci log(gi)))' = f},{} if possible,{} \"failed\" otherwise.")) (|extendedint| (((|Union| (|Record| (|:| |ratpart| (|Fraction| |#2|)) (|:| |coeff| (|Fraction| |#2|))) "failed") (|Fraction| |#2|) (|Fraction| |#2|)) "\\spad{extendedint(f, g)} returns fractions \\spad{[h, c]} such that \\spad{c' = 0} and \\spad{h' = f - cg},{} if \\spad{(h, c)} exist,{} \"failed\" otherwise.")) (|infieldint| (((|Union| (|Fraction| |#2|) "failed") (|Fraction| |#2|)) "\\spad{infieldint(f)} returns \\spad{g} such that \\spad{g' = f} or \"failed\" if the integral of \\spad{f} is not a rational function.")) (|integrate| (((|IntegrationResult| (|Fraction| |#2|)) (|Fraction| |#2|)) "\\spad{integrate(f)} returns \\spad{g} such that \\spad{g' = f}."))) NIL NIL @@ -2264,27 +2264,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 -(-584 -4131) +(-584 -4164) ((|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}'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 (-585 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."))) -((-2793 . T) (-4503 . T) ((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) +((-2862 . T) (-4503 . T) ((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) NIL (-586) ((|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}'s exists."))) NIL NIL -(-587 R -4131) +(-587 R -4164) ((|constructor| (NIL "\\indented{1}{Tools for the integrator} Author: Manuel Bronstein Date Created: 25 April 1990 Date Last Updated: 9 June 1993 Keywords: elementary,{} function,{} integration.")) (|intPatternMatch| (((|IntegrationResult| |#2|) |#2| (|Symbol|) (|Mapping| (|IntegrationResult| |#2|) |#2| (|Symbol|)) (|Mapping| (|Union| (|Record| (|:| |special| |#2|) (|:| |integrand| |#2|)) "failed") |#2| (|Symbol|))) "\\spad{intPatternMatch(f, x, int, pmint)} tries to integrate \\spad{f} first by using the integration function \\spad{int},{} and then by using the pattern match intetgration function \\spad{pmint} on any remaining unintegrable part.")) (|mkPrim| ((|#2| |#2| (|Symbol|)) "\\spad{mkPrim(f, x)} makes the logs in \\spad{f} which are linear in \\spad{x} primitive with respect to \\spad{x}.")) (|removeConstantTerm| ((|#2| |#2| (|Symbol|)) "\\spad{removeConstantTerm(f, x)} returns \\spad{f} minus any additive constant with respect to \\spad{x}.")) (|vark| (((|List| (|Kernel| |#2|)) (|List| |#2|) (|Symbol|)) "\\spad{vark([f1,...,fn],x)} returns the set-theoretic union of \\spad{(varselect(f1,x),...,varselect(fn,x))}.")) (|union| (((|List| (|Kernel| |#2|)) (|List| (|Kernel| |#2|)) (|List| (|Kernel| |#2|))) "\\spad{union(l1, l2)} returns set-theoretic union of \\spad{l1} and \\spad{l2}.")) (|ksec| (((|Kernel| |#2|) (|Kernel| |#2|) (|List| (|Kernel| |#2|)) (|Symbol|)) "\\spad{ksec(k, [k1,...,kn], x)} returns the second top-level \\spad{ki} after \\spad{k} involving \\spad{x}.")) (|kmax| (((|Kernel| |#2|) (|List| (|Kernel| |#2|))) "\\spad{kmax([k1,...,kn])} returns the top-level \\spad{ki} for integration.")) (|varselect| (((|List| (|Kernel| |#2|)) (|List| (|Kernel| |#2|)) (|Symbol|)) "\\spad{varselect([k1,...,kn], x)} returns the \\spad{ki} which involve \\spad{x}."))) NIL ((-12 (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-296))) (|HasCategory| |#2| (QUOTE (-649))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-1209))))) (-12 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#2| (QUOTE (-296)))) (|HasCategory| |#1| (QUOTE (-571)))) -(-588 -4131 UP) +(-588 -4164 UP) ((|constructor| (NIL "This package provides functions for the transcendental case of the Risch algorithm.")) (|monomialIntPoly| (((|Record| (|:| |answer| |#2|) (|:| |polypart| |#2|)) |#2| (|Mapping| |#2| |#2|)) "\\spad{monomialIntPoly(p, ')} returns [\\spad{q},{} \\spad{r}] such that \\spad{p = q' + r} and \\spad{degree(r) < degree(t')}. Error if \\spad{degree(t') < 2}.")) (|monomialIntegrate| (((|Record| (|:| |ir| (|IntegrationResult| (|Fraction| |#2|))) (|:| |specpart| (|Fraction| |#2|)) (|:| |polypart| |#2|)) (|Fraction| |#2|) (|Mapping| |#2| |#2|)) "\\spad{monomialIntegrate(f, ')} returns \\spad{[ir, s, p]} such that \\spad{f = ir' + s + p} and all the squarefree factors of the denominator of \\spad{s} are special \\spad{w}.\\spad{r}.\\spad{t} the derivation '.")) (|expintfldpoly| (((|Union| (|LaurentPolynomial| |#1| |#2|) "failed") (|LaurentPolynomial| |#1| |#2|) (|Mapping| (|Record| (|:| |ans| |#1|) (|:| |right| |#1|) (|:| |sol?| (|Boolean|))) (|Integer|) |#1|)) "\\spad{expintfldpoly(p, foo)} returns \\spad{q} such that \\spad{p' = q} or \"failed\" if no such \\spad{q} exists. Argument foo is a Risch differential equation function on \\spad{F}.")) (|primintfldpoly| (((|Union| |#2| "failed") |#2| (|Mapping| (|Union| (|Record| (|:| |ratpart| |#1|) (|:| |coeff| |#1|)) "failed") |#1|) |#1|) "\\spad{primintfldpoly(p, ', t')} returns \\spad{q} such that \\spad{p' = q} or \"failed\" if no such \\spad{q} exists. Argument \\spad{t'} is the derivative of the primitive generating the extension.")) (|primlimintfrac| (((|Union| (|Record| (|:| |mainpart| (|Fraction| |#2|)) (|:| |limitedlogs| (|List| (|Record| (|:| |coeff| (|Fraction| |#2|)) (|:| |logand| (|Fraction| |#2|)))))) "failed") (|Fraction| |#2|) (|Mapping| |#2| |#2|) (|List| (|Fraction| |#2|))) "\\spad{primlimintfrac(f, ', [u1,...,un])} returns \\spad{[v, [c1,...,cn]]} such that \\spad{ci' = 0} and \\spad{f = v' + +/[ci * ui'/ui]}. Error: if \\spad{degree numer f >= degree denom f}.")) (|primextintfrac| (((|Union| (|Record| (|:| |ratpart| (|Fraction| |#2|)) (|:| |coeff| (|Fraction| |#2|))) "failed") (|Fraction| |#2|) (|Mapping| |#2| |#2|) (|Fraction| |#2|)) "\\spad{primextintfrac(f, ', g)} returns \\spad{[v, c]} such that \\spad{f = v' + c g} and \\spad{c' = 0}. Error: if \\spad{degree numer f >= degree denom f} or if \\spad{degree numer g >= degree denom g} or if \\spad{denom g} is not squarefree.")) (|explimitedint| (((|Union| (|Record| (|:| |answer| (|Record| (|:| |mainpart| (|Fraction| |#2|)) (|:| |limitedlogs| (|List| (|Record| (|:| |coeff| (|Fraction| |#2|)) (|:| |logand| (|Fraction| |#2|))))))) (|:| |a0| |#1|)) "failed") (|Fraction| |#2|) (|Mapping| |#2| |#2|) (|Mapping| (|Record| (|:| |ans| |#1|) (|:| |right| |#1|) (|:| |sol?| (|Boolean|))) (|Integer|) |#1|) (|List| (|Fraction| |#2|))) "\\spad{explimitedint(f, ', foo, [u1,...,un])} returns \\spad{[v, [c1,...,cn], a]} such that \\spad{ci' = 0},{} \\spad{f = v' + a + reduce(+,[ci * ui'/ui])},{} and \\spad{a = 0} or \\spad{a} has no integral in \\spad{F}. Returns \"failed\" if no such \\spad{v},{} \\spad{ci},{} a exist. Argument \\spad{foo} is a Risch differential equation function on \\spad{F}.")) (|primlimitedint| (((|Union| (|Record| (|:| |answer| (|Record| (|:| |mainpart| (|Fraction| |#2|)) (|:| |limitedlogs| (|List| (|Record| (|:| |coeff| (|Fraction| |#2|)) (|:| |logand| (|Fraction| |#2|))))))) (|:| |a0| |#1|)) "failed") (|Fraction| |#2|) (|Mapping| |#2| |#2|) (|Mapping| (|Union| (|Record| (|:| |ratpart| |#1|) (|:| |coeff| |#1|)) "failed") |#1|) (|List| (|Fraction| |#2|))) "\\spad{primlimitedint(f, ', foo, [u1,...,un])} returns \\spad{[v, [c1,...,cn], a]} such that \\spad{ci' = 0},{} \\spad{f = v' + a + reduce(+,[ci * ui'/ui])},{} and \\spad{a = 0} or \\spad{a} has no integral in UP. Returns \"failed\" if no such \\spad{v},{} \\spad{ci},{} a exist. Argument \\spad{foo} is an extended integration function on \\spad{F}.")) (|expextendedint| (((|Union| (|Record| (|:| |answer| (|Fraction| |#2|)) (|:| |a0| |#1|)) (|Record| (|:| |ratpart| (|Fraction| |#2|)) (|:| |coeff| (|Fraction| |#2|))) "failed") (|Fraction| |#2|) (|Mapping| |#2| |#2|) (|Mapping| (|Record| (|:| |ans| |#1|) (|:| |right| |#1|) (|:| |sol?| (|Boolean|))) (|Integer|) |#1|) (|Fraction| |#2|)) "\\spad{expextendedint(f, ', foo, g)} returns either \\spad{[v, c]} such that \\spad{f = v' + c g} and \\spad{c' = 0},{} or \\spad{[v, a]} such that \\spad{f = g' + a},{} and \\spad{a = 0} or \\spad{a} has no integral in \\spad{F}. Returns \"failed\" if neither case can hold. Argument \\spad{foo} is a Risch differential equation function on \\spad{F}.")) (|primextendedint| (((|Union| (|Record| (|:| |answer| (|Fraction| |#2|)) (|:| |a0| |#1|)) (|Record| (|:| |ratpart| (|Fraction| |#2|)) (|:| |coeff| (|Fraction| |#2|))) "failed") (|Fraction| |#2|) (|Mapping| |#2| |#2|) (|Mapping| (|Union| (|Record| (|:| |ratpart| |#1|) (|:| |coeff| |#1|)) "failed") |#1|) (|Fraction| |#2|)) "\\spad{primextendedint(f, ', foo, g)} returns either \\spad{[v, c]} such that \\spad{f = v' + c g} and \\spad{c' = 0},{} or \\spad{[v, a]} such that \\spad{f = g' + a},{} and \\spad{a = 0} or \\spad{a} has no integral in UP. Returns \"failed\" if neither case can hold. Argument \\spad{foo} is an extended integration function on \\spad{F}.")) (|tanintegrate| (((|Record| (|:| |answer| (|IntegrationResult| (|Fraction| |#2|))) (|:| |a0| |#1|)) (|Fraction| |#2|) (|Mapping| |#2| |#2|) (|Mapping| (|Union| (|List| |#1|) "failed") (|Integer|) |#1| |#1|)) "\\spad{tanintegrate(f, ', foo)} returns \\spad{[g, a]} such that \\spad{f = g' + a},{} and \\spad{a = 0} or \\spad{a} has no integral in \\spad{F}; Argument foo is a Risch differential system solver on \\spad{F}.")) (|expintegrate| (((|Record| (|:| |answer| (|IntegrationResult| (|Fraction| |#2|))) (|:| |a0| |#1|)) (|Fraction| |#2|) (|Mapping| |#2| |#2|) (|Mapping| (|Record| (|:| |ans| |#1|) (|:| |right| |#1|) (|:| |sol?| (|Boolean|))) (|Integer|) |#1|)) "\\spad{expintegrate(f, ', foo)} returns \\spad{[g, a]} such that \\spad{f = g' + a},{} and \\spad{a = 0} or \\spad{a} has no integral in \\spad{F}; Argument foo is a Risch differential equation solver on \\spad{F}.")) (|primintegrate| (((|Record| (|:| |answer| (|IntegrationResult| (|Fraction| |#2|))) (|:| |a0| |#1|)) (|Fraction| |#2|) (|Mapping| |#2| |#2|) (|Mapping| (|Union| (|Record| (|:| |ratpart| |#1|) (|:| |coeff| |#1|)) "failed") |#1|)) "\\spad{primintegrate(f, ', foo)} returns \\spad{[g, a]} such that \\spad{f = g' + a},{} and \\spad{a = 0} or \\spad{a} has no integral in UP. Argument foo is an extended integration function on \\spad{F}."))) NIL NIL -(-589 R -4131) +(-589 R -4164) ((|constructor| (NIL "This package computes the inverse Laplace Transform.")) (|inverseLaplace| (((|Union| |#2| "failed") |#2| (|Symbol|) (|Symbol|)) "\\spad{inverseLaplace(f, s, t)} returns the Inverse Laplace transform of \\spad{f(s)} using \\spad{t} as the new variable or \"failed\" if unable to find a closed form."))) NIL NIL @@ -2316,15 +2316,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 -(-597 -4131) +(-597 -4164) ((|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 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}."))) ((-4505 . T) (-4504 . T)) ((|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-1209))))) -(-598 E -4131) +(-598 E -4164) ((|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 -(-599 R -4131) +(-599 R -4164) ((|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},{}...,{}Pn are the factors of \\spad{P}."))) NIL NIL @@ -2359,7 +2359,7 @@ NIL (-607 |mn|) ((|constructor| (NIL "This domain implements low-level strings"))) ((-4511 . T) (-4510 . T)) -((-4133 (-12 (|HasCategory| (-146) (QUOTE (-872))) (|HasCategory| (-146) (|%list| (QUOTE -321) (QUOTE (-146))))) (-12 (|HasCategory| (-146) (QUOTE (-1133))) (|HasCategory| (-146) (|%list| (QUOTE -321) (QUOTE (-146)))))) (-4133 (|HasCategory| (-146) (|%list| (QUOTE -632) (QUOTE (-888)))) (-12 (|HasCategory| (-146) (QUOTE (-1133))) (|HasCategory| (-146) (|%list| (QUOTE -321) (QUOTE (-146)))))) (|HasCategory| (-146) (|%list| (QUOTE -633) (QUOTE (-549)))) (-4133 (|HasCategory| (-146) (QUOTE (-872))) (|HasCategory| (-146) (QUOTE (-1133)))) (|HasCategory| (-146) (QUOTE (-872))) (-4133 (|HasCategory| (-146) (QUOTE (-102))) (|HasCategory| (-146) (QUOTE (-872))) (|HasCategory| (-146) (QUOTE (-1133)))) (|HasCategory| (-560) (QUOTE (-872))) (|HasCategory| (-146) (QUOTE (-1133))) (|HasCategory| (-146) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-146) (QUOTE (-102))) (-12 (|HasCategory| (-146) (QUOTE (-1133))) (|HasCategory| (-146) (|%list| (QUOTE -321) (QUOTE (-146)))))) +((-4144 (-12 (|HasCategory| (-146) (QUOTE (-872))) (|HasCategory| (-146) (|%list| (QUOTE -321) (QUOTE (-146))))) (-12 (|HasCategory| (-146) (QUOTE (-1133))) (|HasCategory| (-146) (|%list| (QUOTE -321) (QUOTE (-146)))))) (-4144 (|HasCategory| (-146) (|%list| (QUOTE -632) (QUOTE (-888)))) (-12 (|HasCategory| (-146) (QUOTE (-1133))) (|HasCategory| (-146) (|%list| (QUOTE -321) (QUOTE (-146)))))) (|HasCategory| (-146) (|%list| (QUOTE -633) (QUOTE (-549)))) (-4144 (|HasCategory| (-146) (QUOTE (-872))) (|HasCategory| (-146) (QUOTE (-1133)))) (|HasCategory| (-146) (QUOTE (-872))) (-4144 (|HasCategory| (-146) (QUOTE (-102))) (|HasCategory| (-146) (QUOTE (-872))) (|HasCategory| (-146) (QUOTE (-1133)))) (|HasCategory| (-560) (QUOTE (-872))) (|HasCategory| (-146) (QUOTE (-1133))) (|HasCategory| (-146) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-146) (QUOTE (-102))) (-12 (|HasCategory| (-146) (QUOTE (-1133))) (|HasCategory| (-146) (|%list| (QUOTE -321) (QUOTE (-146)))))) (-608 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 @@ -2367,7 +2367,7 @@ NIL (-609 |Coef|) ((|constructor| (NIL "InnerSparseUnivariatePowerSeries is an internal domain \\indented{2}{used for creating sparse Taylor and Laurent series.}")) (|cAcsch| (($ $) "\\spad{cAcsch(f)} computes the inverse hyperbolic cosecant of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cAsech| (($ $) "\\spad{cAsech(f)} computes the inverse hyperbolic secant of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cAcoth| (($ $) "\\spad{cAcoth(f)} computes the inverse hyperbolic cotangent of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cAtanh| (($ $) "\\spad{cAtanh(f)} computes the inverse hyperbolic tangent of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cAcosh| (($ $) "\\spad{cAcosh(f)} computes the inverse hyperbolic cosine of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cAsinh| (($ $) "\\spad{cAsinh(f)} computes the inverse hyperbolic sine of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cCsch| (($ $) "\\spad{cCsch(f)} computes the hyperbolic cosecant of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cSech| (($ $) "\\spad{cSech(f)} computes the hyperbolic secant of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cCoth| (($ $) "\\spad{cCoth(f)} computes the hyperbolic cotangent of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cTanh| (($ $) "\\spad{cTanh(f)} computes the hyperbolic tangent of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cCosh| (($ $) "\\spad{cCosh(f)} computes the hyperbolic cosine of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cSinh| (($ $) "\\spad{cSinh(f)} computes the hyperbolic sine of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cAcsc| (($ $) "\\spad{cAcsc(f)} computes the arccosecant of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cAsec| (($ $) "\\spad{cAsec(f)} computes the arcsecant of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cAcot| (($ $) "\\spad{cAcot(f)} computes the arccotangent of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cAtan| (($ $) "\\spad{cAtan(f)} computes the arctangent of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cAcos| (($ $) "\\spad{cAcos(f)} computes the arccosine of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cAsin| (($ $) "\\spad{cAsin(f)} computes the arcsine of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cCsc| (($ $) "\\spad{cCsc(f)} computes the cosecant of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cSec| (($ $) "\\spad{cSec(f)} computes the secant of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cCot| (($ $) "\\spad{cCot(f)} computes the cotangent of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cTan| (($ $) "\\spad{cTan(f)} computes the tangent of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cCos| (($ $) "\\spad{cCos(f)} computes the cosine of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cSin| (($ $) "\\spad{cSin(f)} computes the sine of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cLog| (($ $) "\\spad{cLog(f)} computes the logarithm of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cExp| (($ $) "\\spad{cExp(f)} computes the exponential of the power series \\spad{f}. For use when the coefficient ring is commutative.")) (|cRationalPower| (($ $ (|Fraction| (|Integer|))) "\\spad{cRationalPower(f,r)} computes \\spad{f^r}. For use when the coefficient ring is commutative.")) (|cPower| (($ $ |#1|) "\\spad{cPower(f,r)} computes \\spad{f^r},{} where \\spad{f} has constant coefficient 1. For use when the coefficient ring is commutative.")) (|integrate| (($ $) "\\spad{integrate(f(x))} returns an anti-derivative of the power series \\spad{f(x)} with constant coefficient 0. Warning: function does not check for a term of degree \\spad{-1}.")) (|seriesToOutputForm| (((|OutputForm|) (|Stream| (|Record| (|:| |k| (|Integer|)) (|:| |c| |#1|))) (|Reference| (|OrderedCompletion| (|Integer|))) (|Symbol|) |#1| (|Fraction| (|Integer|))) "\\spad{seriesToOutputForm(st,refer,var,cen,r)} prints the series \\spad{f((var - cen)^r)}.")) (|iCompose| (($ $ $) "\\spad{iCompose(f,g)} returns \\spad{f(g(x))}. This is an internal function which should only be called for Taylor series \\spad{f(x)} and \\spad{g(x)} such that the constant coefficient of \\spad{g(x)} is zero.")) (|taylorQuoByVar| (($ $) "\\spad{taylorQuoByVar(a0 + a1 x + a2 x**2 + ...)} returns \\spad{a1 + a2 x + a3 x**2 + ...}")) (|iExquo| (((|Union| $ "failed") $ $ (|Boolean|)) "\\spad{iExquo(f,g,taylor?)} is the quotient of the power series \\spad{f} and \\spad{g}. If \\spad{taylor?} is \\spad{true},{} then we must have \\spad{order(f) >= order(g)}.")) (|multiplyCoefficients| (($ (|Mapping| |#1| (|Integer|)) $) "\\spad{multiplyCoefficients(fn,f)} returns the series \\spad{sum(fn(n) * an * x^n,n = n0..)},{} where \\spad{f} is the series \\spad{sum(an * x^n,n = n0..)}.")) (|monomial?| (((|Boolean|) $) "\\spad{monomial?(f)} tests if \\spad{f} is a single monomial.")) (|series| (($ (|Stream| (|Record| (|:| |k| (|Integer|)) (|:| |c| |#1|)))) "\\spad{series(st)} creates a series from a stream of non-zero terms,{} where a term is an exponent-coefficient pair. The terms in the stream should be ordered by increasing order of exponents.")) (|getStream| (((|Stream| (|Record| (|:| |k| (|Integer|)) (|:| |c| |#1|))) $) "\\spad{getStream(f)} returns the stream of terms representing the series \\spad{f}.")) (|getRef| (((|Reference| (|OrderedCompletion| (|Integer|))) $) "\\spad{getRef(f)} returns a reference containing the order to which the terms of \\spad{f} have been computed.")) (|makeSeries| (($ (|Reference| (|OrderedCompletion| (|Integer|))) (|Stream| (|Record| (|:| |k| (|Integer|)) (|:| |c| |#1|)))) "\\spad{makeSeries(refer,str)} creates a power series from the reference \\spad{refer} and the stream \\spad{str}."))) (((-4512 "*") |has| |#1| (-175)) (-4503 |has| |#1| (-571)) (-4504 . T) (-4505 . T) (-4507 . T)) -((|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-571))) (-4133 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571)))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-560)) (|devaluate| |#1|))))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-560)) (|devaluate| |#1|)))) (|HasCategory| (-560) (QUOTE (-1144))) (|HasCategory| |#1| (QUOTE (-376))) (-12 (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-560))))) (|HasSignature| |#1| (|%list| (QUOTE -4080) (|%list| (|devaluate| |#1|) (QUOTE (-1209)))))) (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-560)))))) +((|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-571))) (-4144 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571)))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-560)) (|devaluate| |#1|))))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-560)) (|devaluate| |#1|)))) (|HasCategory| (-560) (QUOTE (-1144))) (|HasCategory| |#1| (QUOTE (-376))) (-12 (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-560))))) (|HasSignature| |#1| (|%list| (QUOTE -3903) (|%list| (|devaluate| |#1|) (QUOTE (-1209)))))) (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-560)))))) (-610 |Coef|) ((|constructor| (NIL "Internal package for dense Taylor series. This is an internal Taylor series type in which Taylor series are represented by a \\spadtype{Stream} of \\spadtype{Ring} elements. For univariate series,{} the \\spad{Stream} elements are the Taylor coefficients. For multivariate series,{} the \\spad{n}th Stream element is a form of degree \\spad{n} in the power series variables.")) (* (($ $ (|Integer|)) "\\spad{x*i} returns the product of integer \\spad{i} and the series \\spad{x}.")) (|order| (((|NonNegativeInteger|) $ (|NonNegativeInteger|)) "\\spad{order(x,n)} returns the minimum of \\spad{n} and the order of \\spad{x}.") (((|NonNegativeInteger|) $) "\\spad{order(x)} returns the order of a power series \\spad{x},{} \\indented{1}{\\spadignore{i.e.} the degree of the first non-zero term of the series.}")) (|pole?| (((|Boolean|) $) "\\spad{pole?(x)} tests if the series \\spad{x} has a pole. \\indented{1}{Note: this is \\spad{false} when \\spad{x} is a Taylor series.}")) (|series| (($ (|Stream| |#1|)) "\\spad{series(s)} creates a power series from a stream of \\indented{1}{ring elements.} \\indented{1}{For univariate series types,{} the stream \\spad{s} should be a stream} \\indented{1}{of Taylor coefficients. For multivariate series types,{} the} \\indented{1}{stream \\spad{s} should be a stream of forms the \\spad{n}th element} \\indented{1}{of which is a} \\indented{1}{form of degree \\spad{n} in the power series variables.}")) (|coefficients| (((|Stream| |#1|) $) "\\spad{coefficients(x)} returns a stream of ring elements. \\indented{1}{When \\spad{x} is a univariate series,{} this is a stream of Taylor} \\indented{1}{coefficients. When \\spad{x} is a multivariate series,{} the} \\indented{1}{\\spad{n}th element of the stream is a form of} \\indented{1}{degree \\spad{n} in the power series variables.}"))) (((-4512 "*") |has| |#1| (-571)) (-4503 |has| |#1| (-571)) (-4504 . T) (-4505 . T) (-4507 . T)) @@ -2384,7 +2384,7 @@ NIL ((|constructor| (NIL "Functions defined on streams with entries in two sets.")) (|map| (((|Stream| |#3|) (|Mapping| |#3| |#1| |#2|) (|InfiniteTuple| |#1|) (|Stream| |#2|)) "\\spad{map(f,a,b)} \\undocumented") (((|Stream| |#3|) (|Mapping| |#3| |#1| |#2|) (|Stream| |#1|) (|InfiniteTuple| |#2|)) "\\spad{map(f,a,b)} \\undocumented") (((|InfiniteTuple| |#3|) (|Mapping| |#3| |#1| |#2|) (|InfiniteTuple| |#1|) (|InfiniteTuple| |#2|)) "\\spad{map(f,a,b)} \\undocumented"))) NIL NIL -(-614 R -4131 FG) +(-614 R -4164 FG) ((|constructor| (NIL "This package provides transformations from trigonometric functions to exponentials and logarithms,{} and back. \\spad{F} and 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 @@ -2395,7 +2395,7 @@ NIL (-616 R |mn|) ((|constructor| (NIL "\\indented{2}{This type represents vector like objects with varying lengths} and a user-specified initial index."))) ((-4511 . T) (-4510 . T)) -((-4133 (-12 (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549)))) (-4133 (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133)))) (|HasCategory| |#1| (QUOTE (-872))) (-4133 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133)))) (|HasCategory| (-560) (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-748))) (|HasCategory| |#1| (QUOTE (-1081))) (-12 (|HasCategory| |#1| (QUOTE (-1034))) (|HasCategory| |#1| (QUOTE (-1081)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) +((-4144 (-12 (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549)))) (-4144 (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133)))) (|HasCategory| |#1| (QUOTE (-872))) (-4144 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133)))) (|HasCategory| (-560) (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-748))) (|HasCategory| |#1| (QUOTE (-1081))) (-12 (|HasCategory| |#1| (QUOTE (-1034))) (|HasCategory| |#1| (QUOTE (-1081)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-617 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 @@ -2410,8 +2410,8 @@ NIL NIL (-620 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)."))) -((-4507 -4133 (-2522 (|has| |#2| (-380 |#1|)) (|has| |#1| (-571))) (-12 (|has| |#2| (-432 |#1|)) (|has| |#1| (-571)))) (-4505 . T) (-4504 . T)) -((-4133 (|HasCategory| |#2| (|%list| (QUOTE -380) (|devaluate| |#1|))) (|HasCategory| |#2| (|%list| (QUOTE -432) (|devaluate| |#1|)))) (|HasCategory| |#2| (|%list| (QUOTE -432) (|devaluate| |#1|))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -432) (|devaluate| |#1|)))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#2| (|%list| (QUOTE -380) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#2| (|%list| (QUOTE -432) (|devaluate| |#1|))))) (|HasCategory| |#2| (|%list| (QUOTE -380) (|devaluate| |#1|)))) +((-4507 -4144 (-2609 (|has| |#2| (-380 |#1|)) (|has| |#1| (-571))) (-12 (|has| |#2| (-432 |#1|)) (|has| |#1| (-571)))) (-4505 . T) (-4504 . T)) +((-4144 (|HasCategory| |#2| (|%list| (QUOTE -380) (|devaluate| |#1|))) (|HasCategory| |#2| (|%list| (QUOTE -432) (|devaluate| |#1|)))) (|HasCategory| |#2| (|%list| (QUOTE -432) (|devaluate| |#1|))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -432) (|devaluate| |#1|)))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#2| (|%list| (QUOTE -380) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#2| (|%list| (QUOTE -432) (|devaluate| |#1|))))) (|HasCategory| |#2| (|%list| (QUOTE -380) (|devaluate| |#1|)))) (-621) ((|constructor| (NIL "This is the datatype for the JVM bytecodes."))) NIL @@ -2439,7 +2439,7 @@ NIL (-627 |Entry|) ((|constructor| (NIL "This domain allows a random access file to be viewed both as a table and as a file object.")) (|pack!| (($ $) "\\spad{pack!(f)} reorganizes the file \\spad{f} on disk to recover unused space."))) ((-4510 . T) (-4511 . T)) -((-12 (|HasCategory| (-2 (|:| -1580 (-1191)) (|:| -3432 |#1|)) (QUOTE (-1133))) (|HasCategory| (-2 (|:| -1580 (-1191)) (|:| -3432 |#1|)) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -1580) (QUOTE (-1191))) (|%list| (QUOTE |:|) (QUOTE -3432) (|devaluate| |#1|)))))) (|HasCategory| (-2 (|:| -1580 (-1191)) (|:| -3432 |#1|)) (|%list| (QUOTE -633) (QUOTE (-549)))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| (-1191) (QUOTE (-872))) (|HasCategory| (-2 (|:| -1580 (-1191)) (|:| -3432 |#1|)) (QUOTE (-1133))) (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-2 (|:| -1580 (-1191)) (|:| -3432 |#1|)) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-2 (|:| -1580 (-1191)) (|:| -3432 |#1|)) (QUOTE (-102)))) +((-12 (|HasCategory| (-2 (|:| -2118 (-1191)) (|:| -3964 |#1|)) (QUOTE (-1133))) (|HasCategory| (-2 (|:| -2118 (-1191)) (|:| -3964 |#1|)) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -2118) (QUOTE (-1191))) (|%list| (QUOTE |:|) (QUOTE -3964) (|devaluate| |#1|)))))) (|HasCategory| (-2 (|:| -2118 (-1191)) (|:| -3964 |#1|)) (|%list| (QUOTE -633) (QUOTE (-549)))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| (-1191) (QUOTE (-872))) (|HasCategory| (-2 (|:| -2118 (-1191)) (|:| -3964 |#1|)) (QUOTE (-1133))) (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-2 (|:| -2118 (-1191)) (|:| -3964 |#1|)) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-2 (|:| -2118 (-1191)) (|:| -3964 |#1|)) (QUOTE (-102)))) (-628 S |Key| |Entry|) ((|constructor| (NIL "A keyed dictionary is a dictionary of key-entry pairs for which there is a unique entry for each key.")) (|search| (((|Union| |#3| "failed") |#2| $) "\\spad{search(k,t)} searches the table \\spad{t} for the key \\spad{k},{} returning the entry stored in \\spad{t} for key \\spad{k}. If \\spad{t} has no such key,{} \\axiom{search(\\spad{k},{}\\spad{t})} returns \"failed\".")) (|remove!| (((|Union| |#3| "failed") |#2| $) "\\spad{remove!(k,t)} searches the table \\spad{t} for the key \\spad{k} removing (and return) the entry if there. If \\spad{t} has no such key,{} \\axiom{remove!(\\spad{k},{}\\spad{t})} returns \"failed\".")) (|keys| (((|List| |#2|) $) "\\spad{keys(t)} returns the list the keys in table \\spad{t}.")) (|key?| (((|Boolean|) |#2| $) "\\spad{key?(k,t)} tests if \\spad{k} is a key in table \\spad{t}."))) NIL @@ -2464,7 +2464,7 @@ NIL ((|constructor| (NIL "A is convertible to \\spad{B} means any element of A can be converted into an element of \\spad{B},{} but not automatically by the interpreter.")) (|convert| ((|#1| $) "\\spad{convert(a)} transforms a into an element of \\spad{S}."))) NIL NIL -(-634 -4131 UP) +(-634 -4164 UP) ((|constructor| (NIL "\\spadtype{Kovacic} provides a modified Kovacic's algorithm for solving explicitely irreducible 2nd order linear ordinary differential equations.")) (|kovacic| (((|Union| (|SparseUnivariatePolynomial| (|Fraction| |#2|)) "failed") (|Fraction| |#2|) (|Fraction| |#2|) (|Fraction| |#2|) (|Mapping| (|Factored| |#2|) |#2|)) "\\spad{kovacic(a_0,a_1,a_2,ezfactor)} returns either \"failed\" or \\spad{P}(\\spad{u}) such that \\spad{\\$e^{\\int(-a_1/2a_2)} e^{\\int u}\\$} is a solution of \\indented{5}{\\spad{\\$a_2 y'' + a_1 y' + a0 y = 0\\$}} whenever \\spad{u} is a solution of \\spad{P u = 0}. The equation must be already irreducible over the rational functions. Argument \\spad{ezfactor} is a factorisation in \\spad{UP},{} not necessarily into irreducibles.") (((|Union| (|SparseUnivariatePolynomial| (|Fraction| |#2|)) "failed") (|Fraction| |#2|) (|Fraction| |#2|) (|Fraction| |#2|)) "\\spad{kovacic(a_0,a_1,a_2)} returns either \"failed\" or \\spad{P}(\\spad{u}) such that \\spad{\\$e^{\\int(-a_1/2a_2)} e^{\\int u}\\$} is a solution of \\indented{5}{\\spad{a_2 y'' + a_1 y' + a0 y = 0}} whenever \\spad{u} is a solution of \\spad{P u = 0}. The equation must be already irreducible over the rational functions."))) NIL NIL @@ -2492,7 +2492,7 @@ NIL ((|constructor| (NIL "The category of all left algebras over an arbitrary ring.")) (|coerce| (($ |#1|) "\\spad{coerce(r)} returns \\spad{r} * 1 where 1 is the identity of the left algebra."))) ((-4507 . T)) NIL -(-641 R -4131) +(-641 R -4164) ((|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 @@ -2520,7 +2520,7 @@ NIL ((|constructor| (NIL "A package for solving polynomial systems with finitely many solutions. The decompositions are given by means of regular triangular sets. The computations use lexicographical Groebner bases. The main operations are \\axiomOpFrom{lexTriangular}{LexTriangularPackage} and \\axiomOpFrom{squareFreeLexTriangular}{LexTriangularPackage}. The second one provide decompositions by means of square-free regular triangular sets. Both are based on the {\\em lexTriangular} method described in [1]. They differ from the algorithm described in [2] by the fact that multiciplities of the roots are not kept. With the \\axiomOpFrom{squareFreeLexTriangular}{LexTriangularPackage} operation all multiciplities are removed. With the other operation some multiciplities may remain. Both operations admit an optional argument to produce normalized triangular sets. \\newline")) (|zeroSetSplit| (((|List| (|SquareFreeRegularTriangularSet| |#1| (|IndexedExponents| (|OrderedVariableList| |#2|)) (|OrderedVariableList| |#2|) (|NewSparseMultivariatePolynomial| |#1| (|OrderedVariableList| |#2|)))) (|List| (|NewSparseMultivariatePolynomial| |#1| (|OrderedVariableList| |#2|))) (|Boolean|)) "\\axiom{zeroSetSplit(lp,{} norm?)} decomposes the variety associated with \\axiom{lp} into square-free regular chains. Thus a point belongs to this variety iff it is a regular zero of a regular set in in the output. Note that \\axiom{lp} needs to generate a zero-dimensional ideal. If \\axiom{norm?} is \\axiom{\\spad{true}} then the regular sets are normalized.") (((|List| (|RegularChain| |#1| |#2|)) (|List| (|NewSparseMultivariatePolynomial| |#1| (|OrderedVariableList| |#2|))) (|Boolean|)) "\\axiom{zeroSetSplit(lp,{} norm?)} decomposes the variety associated with \\axiom{lp} into regular chains. Thus a point belongs to this variety iff it is a regular zero of a regular set in in the output. Note that \\axiom{lp} needs to generate a zero-dimensional ideal. If \\axiom{norm?} is \\axiom{\\spad{true}} then the regular sets are normalized.")) (|squareFreeLexTriangular| (((|List| (|SquareFreeRegularTriangularSet| |#1| (|IndexedExponents| (|OrderedVariableList| |#2|)) (|OrderedVariableList| |#2|) (|NewSparseMultivariatePolynomial| |#1| (|OrderedVariableList| |#2|)))) (|List| (|NewSparseMultivariatePolynomial| |#1| (|OrderedVariableList| |#2|))) (|Boolean|)) "\\axiom{squareFreeLexTriangular(base,{} norm?)} decomposes the variety associated with \\axiom{base} into square-free regular chains. Thus a point belongs to this variety iff it is a regular zero of a regular set in in the output. Note that \\axiom{base} needs to be a lexicographical Groebner basis of a zero-dimensional ideal. If \\axiom{norm?} is \\axiom{\\spad{true}} then the regular sets are normalized.")) (|lexTriangular| (((|List| (|RegularChain| |#1| |#2|)) (|List| (|NewSparseMultivariatePolynomial| |#1| (|OrderedVariableList| |#2|))) (|Boolean|)) "\\axiom{lexTriangular(base,{} norm?)} decomposes the variety associated with \\axiom{base} into regular chains. Thus a point belongs to this variety iff it is a regular zero of a regular set in in the output. Note that \\axiom{base} needs to be a lexicographical Groebner basis of a zero-dimensional ideal. If \\axiom{norm?} is \\axiom{\\spad{true}} then the regular sets are normalized.")) (|groebner| (((|List| (|NewSparseMultivariatePolynomial| |#1| (|OrderedVariableList| |#2|))) (|List| (|NewSparseMultivariatePolynomial| |#1| (|OrderedVariableList| |#2|)))) "\\axiom{groebner(lp)} returns the lexicographical Groebner basis of \\axiom{lp}. If \\axiom{lp} generates a zero-dimensional ideal then the {\\em FGLM} strategy is used,{} otherwise the {\\em Sugar} strategy is used.")) (|fglmIfCan| (((|Union| (|List| (|NewSparseMultivariatePolynomial| |#1| (|OrderedVariableList| |#2|))) "failed") (|List| (|NewSparseMultivariatePolynomial| |#1| (|OrderedVariableList| |#2|)))) "\\axiom{fglmIfCan(lp)} returns the lexicographical Groebner basis of \\axiom{lp} by using the {\\em FGLM} strategy,{} if \\axiom{zeroDimensional?(lp)} holds .")) (|zeroDimensional?| (((|Boolean|) (|List| (|NewSparseMultivariatePolynomial| |#1| (|OrderedVariableList| |#2|)))) "\\axiom{zeroDimensional?(lp)} returns \\spad{true} iff \\axiom{lp} generates a zero-dimensional ideal \\spad{w}.\\spad{r}.\\spad{t}. the variables involved in \\axiom{lp}."))) NIL NIL -(-648 R -4131) +(-648 R -4164) ((|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 @@ -2528,18 +2528,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 -(-650 |lv| -4131) +(-650 |lv| -4164) ((|constructor| (NIL "\\indented{1}{Given a Groebner basis \\spad{B} with respect to the total degree ordering for} a zero-dimensional ideal \\spad{I},{} compute a Groebner basis with respect to the lexicographical ordering by using linear algebra.")) (|transform| (((|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|) (|DistributedMultivariatePolynomial| |#1| |#2|)) "\\spad{transform }\\undocumented")) (|choosemon| (((|DistributedMultivariatePolynomial| |#1| |#2|) (|DistributedMultivariatePolynomial| |#1| |#2|) (|List| (|DistributedMultivariatePolynomial| |#1| |#2|))) "\\spad{choosemon }\\undocumented")) (|intcompBasis| (((|List| (|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|)) (|OrderedVariableList| |#1|) (|List| (|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|)) (|List| (|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|))) "\\spad{intcompBasis }\\undocumented")) (|anticoord| (((|DistributedMultivariatePolynomial| |#1| |#2|) (|List| |#2|) (|DistributedMultivariatePolynomial| |#1| |#2|) (|List| (|DistributedMultivariatePolynomial| |#1| |#2|))) "\\spad{anticoord }\\undocumented")) (|coord| (((|Vector| |#2|) (|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|) (|List| (|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|))) "\\spad{coord }\\undocumented")) (|computeBasis| (((|List| (|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|)) (|List| (|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|))) "\\spad{computeBasis }\\undocumented")) (|minPol| (((|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|) (|List| (|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|)) (|OrderedVariableList| |#1|)) "\\spad{minPol }\\undocumented") (((|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|) (|List| (|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|)) (|List| (|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|)) (|OrderedVariableList| |#1|)) "\\spad{minPol }\\undocumented")) (|totolex| (((|List| (|DistributedMultivariatePolynomial| |#1| |#2|)) (|List| (|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|))) "\\spad{totolex }\\undocumented")) (|groebgen| (((|Record| (|:| |glbase| (|List| (|DistributedMultivariatePolynomial| |#1| |#2|))) (|:| |glval| (|List| (|Integer|)))) (|List| (|DistributedMultivariatePolynomial| |#1| |#2|))) "\\spad{groebgen }\\undocumented")) (|linGenPos| (((|Record| (|:| |gblist| (|List| (|DistributedMultivariatePolynomial| |#1| |#2|))) (|:| |gvlist| (|List| (|Integer|)))) (|List| (|HomogeneousDistributedMultivariatePolynomial| |#1| |#2|))) "\\spad{linGenPos }\\undocumented"))) NIL NIL (-651) ((|constructor| (NIL "This domain provides a simple way to save values in files.")) (|setelt| (((|Any|) $ (|Symbol|) (|Any|)) "\\spad{lib.k := v} saves the value \\spad{v} in the library \\spad{lib}. It can later be extracted using the key \\spad{k}.")) (|pack!| (($ $) "\\spad{pack!(f)} reorganizes the file \\spad{f} on disk to recover unused space.")) (|library| (($ (|FileName|)) "\\spad{library(ln)} creates a new library file."))) ((-4511 . T)) -((-12 (|HasCategory| (-2 (|:| -1580 (-1191)) (|:| -3432 (-51))) (QUOTE (-1133))) (|HasCategory| (-2 (|:| -1580 (-1191)) (|:| -3432 (-51))) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -1580) (QUOTE (-1191))) (|%list| (QUOTE |:|) (QUOTE -3432) (QUOTE (-51))))))) (-4133 (|HasCategory| (-2 (|:| -1580 (-1191)) (|:| -3432 (-51))) (QUOTE (-1133))) (|HasCategory| (-51) (QUOTE (-1133)))) (-4133 (|HasCategory| (-2 (|:| -1580 (-1191)) (|:| -3432 (-51))) (QUOTE (-102))) (|HasCategory| (-2 (|:| -1580 (-1191)) (|:| -3432 (-51))) (QUOTE (-1133))) (|HasCategory| (-51) (QUOTE (-102))) (|HasCategory| (-51) (QUOTE (-1133)))) (-4133 (|HasCategory| (-2 (|:| -1580 (-1191)) (|:| -3432 (-51))) (QUOTE (-1133))) (|HasCategory| (-2 (|:| -1580 (-1191)) (|:| -3432 (-51))) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-51) (QUOTE (-1133))) (|HasCategory| (-51) (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| (-2 (|:| -1580 (-1191)) (|:| -3432 (-51))) (|%list| (QUOTE -633) (QUOTE (-549)))) (-12 (|HasCategory| (-51) (QUOTE (-1133))) (|HasCategory| (-51) (|%list| (QUOTE -321) (QUOTE (-51))))) (|HasCategory| (-1191) (QUOTE (-872))) (-4133 (|HasCategory| (-2 (|:| -1580 (-1191)) (|:| -3432 (-51))) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-51) (|%list| (QUOTE -632) (QUOTE (-888))))) (-4133 (|HasCategory| (-2 (|:| -1580 (-1191)) (|:| -3432 (-51))) (QUOTE (-102))) (|HasCategory| (-51) (QUOTE (-102)))) (|HasCategory| (-51) (QUOTE (-1133))) (|HasCategory| (-51) (QUOTE (-102))) (|HasCategory| (-51) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-2 (|:| -1580 (-1191)) (|:| -3432 (-51))) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-2 (|:| -1580 (-1191)) (|:| -3432 (-51))) (QUOTE (-102))) (|HasCategory| (-2 (|:| -1580 (-1191)) (|:| -3432 (-51))) (QUOTE (-1133)))) +((-12 (|HasCategory| (-2 (|:| -2118 (-1191)) (|:| -3964 (-51))) (QUOTE (-1133))) (|HasCategory| (-2 (|:| -2118 (-1191)) (|:| -3964 (-51))) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -2118) (QUOTE (-1191))) (|%list| (QUOTE |:|) (QUOTE -3964) (QUOTE (-51))))))) (-4144 (|HasCategory| (-2 (|:| -2118 (-1191)) (|:| -3964 (-51))) (QUOTE (-1133))) (|HasCategory| (-51) (QUOTE (-1133)))) (-4144 (|HasCategory| (-2 (|:| -2118 (-1191)) (|:| -3964 (-51))) (QUOTE (-102))) (|HasCategory| (-2 (|:| -2118 (-1191)) (|:| -3964 (-51))) (QUOTE (-1133))) (|HasCategory| (-51) (QUOTE (-102))) (|HasCategory| (-51) (QUOTE (-1133)))) (-4144 (|HasCategory| (-2 (|:| -2118 (-1191)) (|:| -3964 (-51))) (QUOTE (-1133))) (|HasCategory| (-2 (|:| -2118 (-1191)) (|:| -3964 (-51))) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-51) (QUOTE (-1133))) (|HasCategory| (-51) (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| (-2 (|:| -2118 (-1191)) (|:| -3964 (-51))) (|%list| (QUOTE -633) (QUOTE (-549)))) (-12 (|HasCategory| (-51) (QUOTE (-1133))) (|HasCategory| (-51) (|%list| (QUOTE -321) (QUOTE (-51))))) (|HasCategory| (-1191) (QUOTE (-872))) (-4144 (|HasCategory| (-2 (|:| -2118 (-1191)) (|:| -3964 (-51))) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-51) (|%list| (QUOTE -632) (QUOTE (-888))))) (-4144 (|HasCategory| (-2 (|:| -2118 (-1191)) (|:| -3964 (-51))) (QUOTE (-102))) (|HasCategory| (-51) (QUOTE (-102)))) (|HasCategory| (-51) (QUOTE (-1133))) (|HasCategory| (-51) (QUOTE (-102))) (|HasCategory| (-51) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-2 (|:| -2118 (-1191)) (|:| -3964 (-51))) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-2 (|:| -2118 (-1191)) (|:| -3964 (-51))) (QUOTE (-102))) (|HasCategory| (-2 (|:| -2118 (-1191)) (|:| -3964 (-51))) (QUOTE (-1133)))) (-652 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)."))) -((-4507 -4133 (-2522 (|has| |#2| (-380 |#1|)) (|has| |#1| (-571))) (-12 (|has| |#2| (-432 |#1|)) (|has| |#1| (-571)))) (-4505 . T) (-4504 . T)) -((-4133 (|HasCategory| |#2| (|%list| (QUOTE -380) (|devaluate| |#1|))) (|HasCategory| |#2| (|%list| (QUOTE -432) (|devaluate| |#1|)))) (|HasCategory| |#2| (|%list| (QUOTE -432) (|devaluate| |#1|))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -432) (|devaluate| |#1|)))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#2| (|%list| (QUOTE -380) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#2| (|%list| (QUOTE -432) (|devaluate| |#1|))))) (|HasCategory| |#2| (|%list| (QUOTE -380) (|devaluate| |#1|)))) +((-4507 -4144 (-2609 (|has| |#2| (-380 |#1|)) (|has| |#1| (-571))) (-12 (|has| |#2| (-432 |#1|)) (|has| |#1| (-571)))) (-4505 . T) (-4504 . T)) +((-4144 (|HasCategory| |#2| (|%list| (QUOTE -380) (|devaluate| |#1|))) (|HasCategory| |#2| (|%list| (QUOTE -432) (|devaluate| |#1|)))) (|HasCategory| |#2| (|%list| (QUOTE -432) (|devaluate| |#1|))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -432) (|devaluate| |#1|)))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#2| (|%list| (QUOTE -380) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#2| (|%list| (QUOTE -432) (|devaluate| |#1|))))) (|HasCategory| |#2| (|%list| (QUOTE -380) (|devaluate| |#1|)))) (-653 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{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 @@ -2563,7 +2563,7 @@ NIL (-658 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}'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}'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}'s are 0,{} \"failed\" if the \\spad{vi}'s are linearly independent over \\spad{S}.")) (|linearlyDependent?| (((|Boolean|) (|Vector| |#2|)) "\\spad{linearlyDependent?([v1,...,vn])} returns \\spad{true} if the \\spad{vi}'s are linearly dependent over \\spad{S},{} \\spad{false} otherwise."))) NIL -((-2511 (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-376)))) +((-2598 (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-376)))) (-659 K B) ((|constructor| (NIL "A simple data structure for elements that form a vector space of finite dimension over a given field,{} with a given symbolic basis.")) (|coordinates| (((|Vector| |#1|) $) "\\spad{coordinates x} returns the coordinates of the linear element with respect to the basis \\spad{B}.")) (|linearElement| (($ (|List| |#1|)) "\\spad{linearElement [x1,..,xn]} returns a linear element \\indented{1}{with coordinates \\spad{[x1,..,xn]} with respect to} the basis elements \\spad{B}."))) ((-4505 . T) (-4504 . T)) @@ -2583,7 +2583,7 @@ NIL (-663 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."))) ((-4511 . T) (-4510 . T)) -((-4133 (-12 (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549)))) (-4133 (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133)))) (|HasCategory| |#1| (QUOTE (-872))) (-4133 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133)))) (|HasCategory| |#1| (QUOTE (-845))) (|HasCategory| (-560) (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) +((-4144 (-12 (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549)))) (-4144 (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133)))) (|HasCategory| |#1| (QUOTE (-872))) (-4144 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133)))) (|HasCategory| |#1| (QUOTE (-845))) (|HasCategory| (-560) (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-664 A B) ((|constructor| (NIL "\\spadtype{ListFunctions2} implements utility functions that operate on two kinds of lists,{} each with a possibly different type of element.")) (|map| (((|List| |#2|) (|Mapping| |#2| |#1|) (|List| |#1|)) "\\spad{map(fn,u)} applies \\spad{fn} to each element of list \\spad{u} and returns a new list with the results. For example \\spad{map(square,[1,2,3]) = [1,4,9]}.")) (|reduce| ((|#2| (|Mapping| |#2| |#1| |#2|) (|List| |#1|) |#2|) "\\spad{reduce(fn,u,ident)} successively uses the binary function \\spad{fn} on the elements of list \\spad{u} and the result of previous applications. \\spad{ident} is returned if the \\spad{u} is empty. Note the order of application in the following examples: \\spad{reduce(fn,[1,2,3],0) = fn(3,fn(2,fn(1,0)))} and \\spad{reduce(*,[2,3],1) = 3 * (2 * 1)}.")) (|scan| (((|List| |#2|) (|Mapping| |#2| |#1| |#2|) (|List| |#1|) |#2|) "\\spad{scan(fn,u,ident)} successively uses the binary function \\spad{fn} to reduce more and more of list \\spad{u}. \\spad{ident} is returned if the \\spad{u} is empty. The result is a list of the reductions at each step. See \\spadfun{reduce} for more information. Examples: \\spad{scan(fn,[1,2],0) = [fn(2,fn(1,0)),fn(1,0)]} and \\spad{scan(*,[2,3],1) = [2 * 1, 3 * (2 * 1)]}."))) NIL @@ -2607,7 +2607,7 @@ NIL (-669 S) ((|substitute| (($ |#1| |#1| $) "\\spad{substitute(x,y,d)} replace \\spad{x}'s with \\spad{y}'s in dictionary \\spad{d}.")) (|duplicates?| (((|Boolean|) $) "\\spad{duplicates?(d)} tests if dictionary \\spad{d} has duplicate entries."))) ((-4510 . T) (-4511 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1133))) (-4133 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1133)))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102)))) +((-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1133))) (-4144 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1133)))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102)))) (-670 R) ((|constructor| (NIL "The category of left modules over an rng (ring not necessarily with unit). This is an abelian group which supports left multiplation by elements of the rng. \\blankline"))) NIL @@ -2628,11 +2628,11 @@ NIL ((|constructor| (NIL "Localize(\\spad{M},{}\\spad{R},{}\\spad{S}) produces fractions with numerators from an \\spad{R} module \\spad{M} and denominators from some multiplicative subset \\spad{D} of \\spad{R}.")) (|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{m / d} divides the element \\spad{m} by \\spad{d}.") (($ $ |#3|) "\\spad{x / d} divides the element \\spad{x} by \\spad{d}."))) ((-4505 . T) (-4504 . T)) ((|HasCategory| |#1| (QUOTE (-814)))) -(-675 R -4131 L) +(-675 R -4164 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 -(-676 A -1946) +(-676 A -3297) ((|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}}"))) ((-4504 . T) (-4505 . T) (-4507 . T)) ((|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-376)))) @@ -2652,7 +2652,7 @@ 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}."))) ((-4504 . T) (-4505 . T) (-4507 . T)) NIL -(-681 -4131 UP) +(-681 -4164 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)))) @@ -2684,11 +2684,11 @@ NIL ((|constructor| (NIL "A list aggregate is a model for a linked list data structure. A linked list is a versatile data structure. Insertion and deletion are efficient and searching is a linear operation.")) (|list| (($ |#1|) "\\spad{list(x)} returns the list of one element \\spad{x}."))) ((-4511 . T) (-4510 . T)) NIL -(-689 -4131 |Row| |Col| M) +(-689 -4164 |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 -(-690 -4131) +(-690 -4164) ((|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'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 @@ -2699,7 +2699,7 @@ NIL (-692 |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."))) ((-4507 . T) (-4510 . T) (-4504 . T) (-4505 . T)) -((|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-239))) (|HasAttribute| |#2| (QUOTE (-4512 "*"))) (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560)))) (-4133 (-12 (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))))) (|HasCategory| |#2| (QUOTE (-319))) (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-571))) (-4133 (|HasAttribute| |#2| (QUOTE (-4512 "*"))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-240)))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#2| (QUOTE (-102))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (|HasCategory| |#2| (QUOTE (-175)))) +((|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-239))) (|HasAttribute| |#2| (QUOTE (-4512 "*"))) (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560)))) (-4144 (-12 (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))))) (|HasCategory| |#2| (QUOTE (-319))) (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-571))) (-4144 (|HasAttribute| |#2| (QUOTE (-4512 "*"))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-240)))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#2| (QUOTE (-102))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (|HasCategory| |#2| (QUOTE (-175)))) (-693) ((|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 @@ -2719,7 +2719,7 @@ NIL (-697 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 -((-4133 (-12 (|HasCategory| |#1| (QUOTE (-1081))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (|HasCategory| |#1| (QUOTE (-1133))) (-4133 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1133)))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (QUOTE (-1081))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) +((-4144 (-12 (|HasCategory| |#1| (QUOTE (-1081))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (|HasCategory| |#1| (QUOTE (-1133))) (-4144 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1133)))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (QUOTE (-1081))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-698) ((|constructor| (NIL "This domain represents the syntax of a macro definition.")) (|body| (((|SpadAst|) $) "\\spad{body(m)} returns the right hand side of the definition `m'.")) (|head| (((|HeadAst|) $) "\\spad{head(m)} returns the head of the macro definition `m'. This is a list of identifiers starting with the name of the macro followed by the name of the parameters,{} if any."))) NIL @@ -2775,7 +2775,7 @@ NIL (-711 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."))) ((-4510 . T) (-4511 . T)) -((-4133 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (|HasCategory| |#1| (QUOTE (-1133))) (-4133 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1133)))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-571))) (|HasAttribute| |#1| (QUOTE (-4512 "*"))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) +((-4144 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (|HasCategory| |#1| (QUOTE (-1133))) (-4144 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1133)))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#1| (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-571))) (|HasAttribute| |#1| (QUOTE (-4512 "*"))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-712 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{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 @@ -2784,7 +2784,7 @@ NIL ((|constructor| (NIL "This domain implements the notion of optional value,{} where a computation may fail to produce expected value.")) (|nothing| (($) "\\spad{nothing} represents failure or absence of value.")) (|autoCoerce| ((|#1| $) "\\spad{autoCoerce} is a courtesy coercion function used by the compiler in case it knows that `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 `x' into \\%."))) NIL NIL -(-714 S -4131 FLAF FLAS) +(-714 S -4164 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,{} \\spad{kl+ku+1} being actual bandwidth. Stores the nonzero band in a matrix,{} dimensions \\spad{kl+ku+1} by \\#xlist. The upper triangle is in the top \\spad{ku} rows,{} the diagonal is in row \\spad{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 @@ -2794,8 +2794,8 @@ NIL NIL (-716) ((|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"))) -((-4503 . T) (-4508 |has| (-721) (-376)) (-4502 |has| (-721) (-376)) (-2804 . T) (-4509 |has| (-721) (-6 -4509)) (-4506 |has| (-721) (-6 -4506)) ((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) -((|HasCategory| (-721) (QUOTE (-149))) (|HasCategory| (-721) (QUOTE (-147))) (|HasCategory| (-721) (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| (-721) (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| (-721) (QUOTE (-381))) (|HasCategory| (-721) (QUOTE (-376))) (-4133 (|HasCategory| (-721) (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| (-721) (QUOTE (-376)))) (|HasCategory| (-721) (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| (-721) (QUOTE (-240))) (|HasCategory| (-721) (QUOTE (-239))) (-4133 (-12 (|HasCategory| (-721) (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| (-721) (QUOTE (-376)))) (|HasCategory| (-721) (|%list| (QUOTE -930) (QUOTE (-1209))))) (-4133 (|HasCategory| (-721) (QUOTE (-376))) (|HasCategory| (-721) (QUOTE (-363)))) (|HasCategory| (-721) (QUOTE (-363))) (|HasCategory| (-721) (|%list| (QUOTE -298) (QUOTE (-721)) (QUOTE (-721)))) (|HasCategory| (-721) (|%list| (QUOTE -321) (QUOTE (-721)))) (|HasCategory| (-721) (|%list| (QUOTE -528) (QUOTE (-1209)) (QUOTE (-721)))) (|HasCategory| (-721) (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| (-721) (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| (-721) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| (-721) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (-4133 (|HasCategory| (-721) (QUOTE (-319))) (|HasCategory| (-721) (QUOTE (-376))) (|HasCategory| (-721) (QUOTE (-363)))) (|HasCategory| (-721) (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| (-721) (QUOTE (-1052))) (|HasCategory| (-721) (QUOTE (-1235))) (-12 (|HasCategory| (-721) (QUOTE (-1034))) (|HasCategory| (-721) (QUOTE (-1235)))) (-4133 (-12 (|HasCategory| (-721) (QUOTE (-319))) (|HasCategory| (-721) (QUOTE (-940)))) (|HasCategory| (-721) (QUOTE (-376))) (-12 (|HasCategory| (-721) (QUOTE (-363))) (|HasCategory| (-721) (QUOTE (-940))))) (-4133 (-12 (|HasCategory| (-721) (QUOTE (-319))) (|HasCategory| (-721) (QUOTE (-940)))) (-12 (|HasCategory| (-721) (QUOTE (-376))) (|HasCategory| (-721) (QUOTE (-940)))) (-12 (|HasCategory| (-721) (QUOTE (-363))) (|HasCategory| (-721) (QUOTE (-940))))) (|HasCategory| (-721) (QUOTE (-559))) (-12 (|HasCategory| (-721) (QUOTE (-1092))) (|HasCategory| (-721) (QUOTE (-1235)))) (|HasCategory| (-721) (QUOTE (-1092))) (|HasCategory| (-721) (QUOTE (-319))) (|HasCategory| (-721) (QUOTE (-940))) (-4133 (-12 (|HasCategory| (-721) (QUOTE (-319))) (|HasCategory| (-721) (QUOTE (-940)))) (|HasCategory| (-721) (QUOTE (-376)))) (-4133 (-12 (|HasCategory| (-721) (QUOTE (-240))) (|HasCategory| (-721) (QUOTE (-376)))) (|HasCategory| (-721) (QUOTE (-239)))) (-4133 (-12 (|HasCategory| (-721) (QUOTE (-319))) (|HasCategory| (-721) (QUOTE (-940)))) (|HasCategory| (-721) (QUOTE (-571)))) (-12 (|HasCategory| (-721) (QUOTE (-239))) (|HasCategory| (-721) (QUOTE (-376)))) (-12 (|HasCategory| (-721) (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| (-721) (QUOTE (-376)))) (-12 (|HasCategory| (-721) (QUOTE (-240))) (|HasCategory| (-721) (QUOTE (-376)))) (-12 (|HasCategory| (-721) (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| (-721) (QUOTE (-376)))) (|HasCategory| (-721) (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| (-721) (QUOTE (-571))) (|HasAttribute| (-721) (QUOTE -4509)) (|HasAttribute| (-721) (QUOTE -4506)) (-12 (|HasCategory| (-721) (QUOTE (-319))) (|HasCategory| (-721) (QUOTE (-940)))) (|HasCategory| (-721) (|%list| (QUOTE -930) (QUOTE (-1209)))) (-4133 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-721) (QUOTE (-319))) (|HasCategory| (-721) (QUOTE (-940)))) (|HasCategory| (-721) (QUOTE (-147)))) (-4133 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-721) (QUOTE (-319))) (|HasCategory| (-721) (QUOTE (-940)))) (|HasCategory| (-721) (QUOTE (-363))))) +((-4503 . T) (-4508 |has| (-721) (-376)) (-4502 |has| (-721) (-376)) (-2873 . T) (-4509 |has| (-721) (-6 -4509)) (-4506 |has| (-721) (-6 -4506)) ((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) +((|HasCategory| (-721) (QUOTE (-149))) (|HasCategory| (-721) (QUOTE (-147))) (|HasCategory| (-721) (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| (-721) (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| (-721) (QUOTE (-381))) (|HasCategory| (-721) (QUOTE (-376))) (-4144 (|HasCategory| (-721) (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| (-721) (QUOTE (-376)))) (|HasCategory| (-721) (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| (-721) (QUOTE (-240))) (|HasCategory| (-721) (QUOTE (-239))) (-4144 (-12 (|HasCategory| (-721) (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| (-721) (QUOTE (-376)))) (|HasCategory| (-721) (|%list| (QUOTE -930) (QUOTE (-1209))))) (-4144 (|HasCategory| (-721) (QUOTE (-376))) (|HasCategory| (-721) (QUOTE (-363)))) (|HasCategory| (-721) (QUOTE (-363))) (|HasCategory| (-721) (|%list| (QUOTE -298) (QUOTE (-721)) (QUOTE (-721)))) (|HasCategory| (-721) (|%list| (QUOTE -321) (QUOTE (-721)))) (|HasCategory| (-721) (|%list| (QUOTE -528) (QUOTE (-1209)) (QUOTE (-721)))) (|HasCategory| (-721) (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| (-721) (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| (-721) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| (-721) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (-4144 (|HasCategory| (-721) (QUOTE (-319))) (|HasCategory| (-721) (QUOTE (-376))) (|HasCategory| (-721) (QUOTE (-363)))) (|HasCategory| (-721) (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| (-721) (QUOTE (-1052))) (|HasCategory| (-721) (QUOTE (-1235))) (-12 (|HasCategory| (-721) (QUOTE (-1034))) (|HasCategory| (-721) (QUOTE (-1235)))) (-4144 (-12 (|HasCategory| (-721) (QUOTE (-319))) (|HasCategory| (-721) (QUOTE (-940)))) (|HasCategory| (-721) (QUOTE (-376))) (-12 (|HasCategory| (-721) (QUOTE (-363))) (|HasCategory| (-721) (QUOTE (-940))))) (-4144 (-12 (|HasCategory| (-721) (QUOTE (-319))) (|HasCategory| (-721) (QUOTE (-940)))) (-12 (|HasCategory| (-721) (QUOTE (-376))) (|HasCategory| (-721) (QUOTE (-940)))) (-12 (|HasCategory| (-721) (QUOTE (-363))) (|HasCategory| (-721) (QUOTE (-940))))) (|HasCategory| (-721) (QUOTE (-559))) (-12 (|HasCategory| (-721) (QUOTE (-1092))) (|HasCategory| (-721) (QUOTE (-1235)))) (|HasCategory| (-721) (QUOTE (-1092))) (|HasCategory| (-721) (QUOTE (-319))) (|HasCategory| (-721) (QUOTE (-940))) (-4144 (-12 (|HasCategory| (-721) (QUOTE (-319))) (|HasCategory| (-721) (QUOTE (-940)))) (|HasCategory| (-721) (QUOTE (-376)))) (-4144 (-12 (|HasCategory| (-721) (QUOTE (-240))) (|HasCategory| (-721) (QUOTE (-376)))) (|HasCategory| (-721) (QUOTE (-239)))) (-4144 (-12 (|HasCategory| (-721) (QUOTE (-319))) (|HasCategory| (-721) (QUOTE (-940)))) (|HasCategory| (-721) (QUOTE (-571)))) (-12 (|HasCategory| (-721) (QUOTE (-239))) (|HasCategory| (-721) (QUOTE (-376)))) (-12 (|HasCategory| (-721) (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| (-721) (QUOTE (-376)))) (-12 (|HasCategory| (-721) (QUOTE (-240))) (|HasCategory| (-721) (QUOTE (-376)))) (-12 (|HasCategory| (-721) (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| (-721) (QUOTE (-376)))) (|HasCategory| (-721) (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| (-721) (QUOTE (-571))) (|HasAttribute| (-721) (QUOTE -4509)) (|HasAttribute| (-721) (QUOTE -4506)) (-12 (|HasCategory| (-721) (QUOTE (-319))) (|HasCategory| (-721) (QUOTE (-940)))) (|HasCategory| (-721) (|%list| (QUOTE -930) (QUOTE (-1209)))) (-4144 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-721) (QUOTE (-319))) (|HasCategory| (-721) (QUOTE (-940)))) (|HasCategory| (-721) (QUOTE (-147)))) (-4144 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-721) (QUOTE (-319))) (|HasCategory| (-721) (QUOTE (-940)))) (|HasCategory| (-721) (QUOTE (-363))))) (-717 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}."))) ((-4511 . T)) @@ -2808,13 +2808,13 @@ NIL ((|constructor| (NIL "\\indented{1}{<description of package>} Author: Jim Wen Date Created: ?? Date Last Updated: October 1991 by Jon Steinbach Keywords: Examples: References:")) (|ptFunc| (((|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|))) "\\spad{ptFunc(a,b,c,d)} is an internal function exported in order to compile packages.")) (|meshPar1Var| (((|ThreeSpace| (|DoubleFloat|)) (|Expression| (|Integer|)) (|Expression| (|Integer|)) (|Expression| (|Integer|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|List| (|DrawOption|))) "\\spad{meshPar1Var(s,t,u,f,s1,l)} \\undocumented")) (|meshFun2Var| (((|ThreeSpace| (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) (|Union| (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) "undefined") (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|List| (|DrawOption|))) "\\spad{meshFun2Var(f,g,s1,s2,l)} \\undocumented")) (|meshPar2Var| (((|ThreeSpace| (|DoubleFloat|)) (|ThreeSpace| (|DoubleFloat|)) (|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|List| (|DrawOption|))) "\\spad{meshPar2Var(sp,f,s1,s2,l)} \\undocumented") (((|ThreeSpace| (|DoubleFloat|)) (|Mapping| (|Point| (|DoubleFloat|)) (|DoubleFloat|) (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|List| (|DrawOption|))) "\\spad{meshPar2Var(f,s1,s2,l)} \\undocumented") (((|ThreeSpace| (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) (|Union| (|Mapping| (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|) (|DoubleFloat|)) "undefined") (|Segment| (|DoubleFloat|)) (|Segment| (|DoubleFloat|)) (|List| (|DrawOption|))) "\\spad{meshPar2Var(f,g,h,j,s1,s2,l)} \\undocumented"))) NIL NIL -(-720 OV E -4131 PG) +(-720 OV E -4164 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 (-721) ((|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}"))) -((-2793 . T) (-4502 . T) (-4508 . T) (-4503 . T) ((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) +((-2862 . T) (-4502 . T) (-4508 . T) (-4503 . T) ((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) NIL (-722 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."))) @@ -2840,7 +2840,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 \\spad{part1} is \\spad{a} and \\spad{part2} is \\spad{b}."))) NIL NIL -(-728 S -2421 I) +(-728 S -4219 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 @@ -2860,14 +2860,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 -(-733 R |Mod| -1740 -2237 |exactQuo|) +(-733 R |Mod| -2386 -2834 |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"))) ((-4502 . T) (-4508 . T) (-4503 . T) ((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) NIL (-734 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"))) (((-4512 "*") |has| |#1| (-175)) (-4503 |has| |#1| (-571)) (-4506 |has| |#1| (-376)) (-4508 |has| |#1| (-6 -4508)) (-4505 . T) (-4504 . T) (-4507 . T)) -((|HasCategory| |#1| (QUOTE (-940))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-175))) (-4133 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571)))) (-12 (|HasCategory| (-1114) (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-391))))) (-12 (|HasCategory| (-1114) (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-560))))) (-12 (|HasCategory| (-1114) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391)))))) (-12 (|HasCategory| (-1114) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560)))))) (-12 (|HasCategory| (-1114) (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549))))) (|HasCategory| |#1| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560)))) (-4133 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560)))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (-4133 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-940)))) (-4133 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-940)))) (-4133 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-940)))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-1184))) (|HasCategory| |#1| (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-381))) (|HasCategory| |#1| (QUOTE (-363))) (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (QUOTE (-240))) (|HasAttribute| |#1| (QUOTE -4508)) (|HasCategory| |#1| (QUOTE (-466))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-940)))) (-4133 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-940)))) (|HasCategory| |#1| (QUOTE (-147))))) +((|HasCategory| |#1| (QUOTE (-940))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-175))) (-4144 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571)))) (-12 (|HasCategory| (-1114) (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-391))))) (-12 (|HasCategory| (-1114) (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-560))))) (-12 (|HasCategory| (-1114) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391)))))) (-12 (|HasCategory| (-1114) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560)))))) (-12 (|HasCategory| (-1114) (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549))))) (|HasCategory| |#1| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560)))) (-4144 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560)))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (-4144 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-940)))) (-4144 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-940)))) (-4144 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-940)))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-1184))) (|HasCategory| |#1| (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-381))) (|HasCategory| |#1| (QUOTE (-363))) (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (QUOTE (-240))) (|HasAttribute| |#1| (QUOTE -4508)) (|HasCategory| |#1| (QUOTE (-466))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-940)))) (-4144 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-940)))) (|HasCategory| |#1| (QUOTE (-147))))) (-735 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 @@ -2876,7 +2876,7 @@ NIL ((|constructor| (NIL "Algebra of ADDITIVE operators on a module.")) (|makeop| (($ |#1| (|FreeGroup| (|BasicOperator|))) "\\spad{makeop should} be local but conditional")) (|opeval| ((|#2| (|BasicOperator|) |#2|) "\\spad{opeval should} be local but conditional")) (** (($ $ (|Integer|)) "\\spad{op**n} \\undocumented") (($ (|BasicOperator|) (|Integer|)) "\\spad{op**n} \\undocumented")) (|evaluateInverse| (($ $ (|Mapping| |#2| |#2|)) "\\spad{evaluateInverse(x,f)} \\undocumented")) (|evaluate| (($ $ (|Mapping| |#2| |#2|)) "\\spad{evaluate(f, u +-> g u)} attaches the map \\spad{g} to \\spad{f}. \\spad{f} must be a basic operator \\spad{g} MUST be additive,{} \\spadignore{i.e.} \\spad{g(a + b) = g(a) + g(b)} for any \\spad{a},{} \\spad{b} in \\spad{M}. This implies that \\spad{g(n a) = n g(a)} for any \\spad{a} in \\spad{M} and integer \\spad{n > 0}.")) (|conjug| ((|#1| |#1|) "\\spad{conjug(x)}should be local but conditional")) (|adjoint| (($ $ $) "\\spad{adjoint(op1, op2)} sets the adjoint of \\spad{op1} to be \\spad{op2}. \\spad{op1} must be a basic operator") (($ $) "\\spad{adjoint(op)} returns the adjoint of the operator \\spad{op}."))) ((-4505 |has| |#1| (-175)) (-4504 |has| |#1| (-175)) (-4507 . T)) ((|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149)))) -(-737 R |Mod| -1740 -2237 |exactQuo|) +(-737 R |Mod| -2386 -2834 |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"))) ((-4507 . T)) NIL @@ -2888,7 +2888,7 @@ NIL ((|constructor| (NIL "The category of modules over a commutative ring. \\blankline"))) ((-4505 . T) (-4504 . T)) NIL -(-740 -4131) +(-740 -4164) ((|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]]}."))) ((-4507 . T)) NIL @@ -2924,7 +2924,7 @@ NIL ((|constructor| (NIL "The class of multiplicative monoids,{} \\spadignore{i.e.} semigroups with a multiplicative identity element. \\blankline")) (|recip| (((|Union| $ "failed") $) "\\spad{recip(x)} tries to compute the multiplicative inverse for \\spad{x} or \"failed\" if it cannot find the inverse (see unitsKnown).")) (** (($ $ (|NonNegativeInteger|)) "\\spad{x**n} returns the repeated product of \\spad{x} \\spad{n} times,{} \\spadignore{i.e.} exponentiation.")) (|one?| (((|Boolean|) $) "\\spad{one?(x)} tests if \\spad{x} is equal to 1.")) (|sample| (($) "\\spad{sample yields} a value of type \\%")) ((|One|) (($) "1 is the multiplicative identity."))) NIL NIL -(-749 -4131 UP) +(-749 -4164 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 @@ -2943,7 +2943,7 @@ NIL (-753 |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."))) (((-4512 "*") |has| |#2| (-175)) (-4503 |has| |#2| (-571)) (-4508 |has| |#2| (-6 -4508)) (-4505 . T) (-4504 . T) (-4507 . T)) -((|HasCategory| |#2| (QUOTE (-940))) (-4133 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-466))) (|HasCategory| |#2| (QUOTE (-571))) (|HasCategory| |#2| (QUOTE (-940)))) (-4133 (|HasCategory| |#2| (QUOTE (-466))) (|HasCategory| |#2| (QUOTE (-571))) (|HasCategory| |#2| (QUOTE (-940)))) (-4133 (|HasCategory| |#2| (QUOTE (-466))) (|HasCategory| |#2| (QUOTE (-940)))) (|HasCategory| |#2| (QUOTE (-571))) (|HasCategory| |#2| (QUOTE (-175))) (-4133 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-571)))) (-12 (|HasCategory| (-889 |#1|) (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| |#2| (|%list| (QUOTE -912) (QUOTE (-391))))) (-12 (|HasCategory| (-889 |#1|) (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| |#2| (|%list| (QUOTE -912) (QUOTE (-560))))) (-12 (|HasCategory| (-889 |#1|) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| |#2| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391)))))) (-12 (|HasCategory| (-889 |#1|) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560)))))) (-12 (|HasCategory| (-889 |#1|) (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#2| (|%list| (QUOTE -633) (QUOTE (-549))))) (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-149))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560)))) (-4133 (|HasCategory| |#2| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560)))))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-376))) (|HasAttribute| |#2| (QUOTE -4508)) (|HasCategory| |#2| (QUOTE (-466))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-940)))) (-4133 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-940)))) (|HasCategory| |#2| (QUOTE (-147))))) +((|HasCategory| |#2| (QUOTE (-940))) (-4144 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-466))) (|HasCategory| |#2| (QUOTE (-571))) (|HasCategory| |#2| (QUOTE (-940)))) (-4144 (|HasCategory| |#2| (QUOTE (-466))) (|HasCategory| |#2| (QUOTE (-571))) (|HasCategory| |#2| (QUOTE (-940)))) (-4144 (|HasCategory| |#2| (QUOTE (-466))) (|HasCategory| |#2| (QUOTE (-940)))) (|HasCategory| |#2| (QUOTE (-571))) (|HasCategory| |#2| (QUOTE (-175))) (-4144 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-571)))) (-12 (|HasCategory| (-889 |#1|) (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| |#2| (|%list| (QUOTE -912) (QUOTE (-391))))) (-12 (|HasCategory| (-889 |#1|) (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| |#2| (|%list| (QUOTE -912) (QUOTE (-560))))) (-12 (|HasCategory| (-889 |#1|) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| |#2| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391)))))) (-12 (|HasCategory| (-889 |#1|) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560)))))) (-12 (|HasCategory| (-889 |#1|) (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#2| (|%list| (QUOTE -633) (QUOTE (-549))))) (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-149))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560)))) (-4144 (|HasCategory| |#2| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560)))))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-376))) (|HasAttribute| |#2| (QUOTE -4508)) (|HasCategory| |#2| (QUOTE (-466))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-940)))) (-4144 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-940)))) (|HasCategory| |#2| (QUOTE (-147))))) (-754 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 @@ -3076,11 +3076,11 @@ NIL ((|constructor| (NIL "This package computes explicitly eigenvalues and eigenvectors of matrices with entries over the complex rational numbers. The results are expressed either as complex floating numbers or as complex rational numbers depending on the type of the precision parameter.")) (|complexEigenvectors| (((|List| (|Record| (|:| |outval| (|Complex| |#1|)) (|:| |outmult| (|Integer|)) (|:| |outvect| (|List| (|Matrix| (|Complex| |#1|)))))) (|Matrix| (|Complex| (|Fraction| (|Integer|)))) |#1|) "\\spad{complexEigenvectors(m,eps)} returns a list of records each one containing a complex eigenvalue,{} its algebraic multiplicity,{} and a list of associated eigenvectors. All these results are computed to precision \\spad{eps} and are expressed as complex floats or complex rational numbers depending on the type of \\spad{eps} (float or rational).")) (|complexEigenvalues| (((|List| (|Complex| |#1|)) (|Matrix| (|Complex| (|Fraction| (|Integer|)))) |#1|) "\\spad{complexEigenvalues(m,eps)} computes the eigenvalues of the matrix \\spad{m} to precision \\spad{eps}. The eigenvalues are expressed as complex floats or complex rational numbers depending on the type of \\spad{eps} (float or rational).")) (|characteristicPolynomial| (((|Polynomial| (|Complex| (|Fraction| (|Integer|)))) (|Matrix| (|Complex| (|Fraction| (|Integer|)))) (|Symbol|)) "\\spad{characteristicPolynomial(m,x)} returns the characteristic polynomial of the matrix \\spad{m} expressed as polynomial over Complex Rationals with variable \\spad{x}.") (((|Polynomial| (|Complex| (|Fraction| (|Integer|)))) (|Matrix| (|Complex| (|Fraction| (|Integer|))))) "\\spad{characteristicPolynomial(m)} returns the characteristic polynomial of the matrix \\spad{m} expressed as polynomial over complex rationals with a new symbol as variable."))) NIL NIL -(-787 -4131) +(-787 -4164) ((|constructor| (NIL "\\spadtype{NumericContinuedFraction} provides functions \\indented{2}{for converting floating point numbers to continued fractions.}")) (|continuedFraction| (((|ContinuedFraction| (|Integer|)) |#1|) "\\spad{continuedFraction(f)} converts the floating point number \\spad{f} to a reduced continued fraction."))) NIL NIL -(-788 P -4131) +(-788 P -4164) ((|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''."))) NIL NIL @@ -3088,7 +3088,7 @@ NIL NIL NIL NIL -(-790 UP -4131) +(-790 UP -4164) ((|constructor| (NIL "In this package \\spad{F} is a framed algebra over the integers (typically \\spad{F = Z[a]} for some algebraic integer a). The package provides functions to compute the integral closure of \\spad{Z} in the quotient quotient field of \\spad{F}.")) (|localIntegralBasis| (((|Record| (|:| |basis| (|Matrix| (|Integer|))) (|:| |basisDen| (|Integer|)) (|:| |basisInv| (|Matrix| (|Integer|)))) (|Integer|)) "\\spad{integralBasis(p)} returns a record \\spad{[basis,basisDen,basisInv]} containing information regarding the local integral closure of \\spad{Z} at the prime \\spad{p} in the quotient field of \\spad{F},{} where \\spad{F} is a framed algebra with \\spad{Z}-module basis \\spad{w1,w2,...,wn}. If \\spad{basis} is the matrix \\spad{(aij, i = 1..n, j = 1..n)},{} then the \\spad{i}th element of the integral basis is \\spad{vi = (1/basisDen) * sum(aij * wj, j = 1..n)},{} \\spadignore{i.e.} the \\spad{i}th row of \\spad{basis} contains the coordinates of the \\spad{i}th basis vector. Similarly,{} the \\spad{i}th row of the matrix \\spad{basisInv} contains the coordinates of \\spad{wi} with respect to the basis \\spad{v1,...,vn}: if \\spad{basisInv} is the matrix \\spad{(bij, i = 1..n, j = 1..n)},{} then \\spad{wi = sum(bij * vj, j = 1..n)}.")) (|integralBasis| (((|Record| (|:| |basis| (|Matrix| (|Integer|))) (|:| |basisDen| (|Integer|)) (|:| |basisInv| (|Matrix| (|Integer|))))) "\\spad{integralBasis()} returns a record \\spad{[basis,basisDen,basisInv]} containing information regarding the integral closure of \\spad{Z} in the quotient field of \\spad{F},{} where \\spad{F} is a framed algebra with \\spad{Z}-module basis \\spad{w1,w2,...,wn}. If \\spad{basis} is the matrix \\spad{(aij, i = 1..n, j = 1..n)},{} then the \\spad{i}th element of the integral basis is \\spad{vi = (1/basisDen) * sum(aij * wj, j = 1..n)},{} \\spadignore{i.e.} the \\spad{i}th row of \\spad{basis} contains the coordinates of the \\spad{i}th basis vector. Similarly,{} the \\spad{i}th row of the matrix \\spad{basisInv} contains the coordinates of \\spad{wi} with respect to the basis \\spad{v1,...,vn}: if \\spad{basisInv} is the matrix \\spad{(bij, i = 1..n, j = 1..n)},{} then \\spad{wi = sum(bij * vj, j = 1..n)}.")) (|discriminant| (((|Integer|)) "\\spad{discriminant()} returns the discriminant of the integral closure of \\spad{Z} in the quotient field of the framed algebra \\spad{F}."))) NIL NIL @@ -3104,7 +3104,7 @@ NIL ((|constructor| (NIL "\\spadtype{NonNegativeInteger} provides functions for non \\indented{2}{negative integers.}")) (|commutative| ((|attribute| "*") "\\spad{commutative(\"*\")} means multiplication is commutative : \\spad{x*y = y*x}.")) (|random| (($ $) "\\spad{random(n)} returns a random integer from 0 to \\spad{n-1}.")) (|shift| (($ $ (|Integer|)) "\\spad{shift(a,i)} shift \\spad{a} by \\spad{i} bits.")) (|exquo| (((|Union| $ "failed") $ $) "\\spad{exquo(a,b)} returns the quotient of \\spad{a} and \\spad{b},{} or \"failed\" if \\spad{b} is zero or \\spad{a} rem \\spad{b} is zero.")) (|divide| (((|Record| (|:| |quotient| $) (|:| |remainder| $)) $ $) "\\spad{divide(a,b)} returns a record containing both remainder and quotient.")) (|gcd| (($ $ $) "\\spad{gcd(a,b)} computes the greatest common divisor of two non negative integers \\spad{a} and \\spad{b}.")) (|rem| (($ $ $) "\\spad{a rem b} returns the remainder of \\spad{a} and \\spad{b}.")) (|quo| (($ $ $) "\\spad{a quo b} returns the quotient of \\spad{a} and \\spad{b},{} forgetting the remainder."))) (((-4512 "*") . T)) NIL -(-794 R -4131) +(-794 R -4164) ((|constructor| (NIL "NonLinearFirstOrderODESolver provides a function for finding closed form first integrals of nonlinear ordinary differential equations of order 1.")) (|solve| (((|Union| |#2| "failed") |#2| |#2| (|BasicOperator|) (|Symbol|)) "\\spad{solve(M(x,y), N(x,y), y, x)} returns \\spad{F(x,y)} such that \\spad{F(x,y) = c} for a constant \\spad{c} is a first integral of the equation \\spad{M(x,y) dx + N(x,y) dy = 0},{} or \"failed\" if no first-integral can be found."))) NIL NIL @@ -3124,7 +3124,7 @@ NIL ((|constructor| (NIL "A package for computing normalized assocites of univariate polynomials with coefficients in a tower of simple extensions of a field.\\newline References : \\indented{1}{[1] \\spad{D}. LAZARD \"A new method for solving algebraic systems of} \\indented{5}{positive dimension\" Discr. App. Math. 33:147-160,{}1991} \\indented{1}{[2] \\spad{M}. MORENO MAZA and \\spad{R}. RIOBOO \"Computations of gcd over} \\indented{5}{algebraic towers of simple extensions\" In proceedings of \\spad{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},{}ts)} is an internal subroutine,{} exported only for developement.")) (|outputArgs| (((|Void|) (|String|) (|String|) |#4| |#5|) "\\axiom{outputArgs(\\spad{s1},{}\\spad{s2},{}\\spad{p},{}ts)} is an internal subroutine,{} exported only for developement.")) (|normalize| (((|List| (|Record| (|:| |val| |#4|) (|:| |tower| |#5|))) |#4| |#5|) "\\axiom{normalize(\\spad{p},{}ts)} normalizes \\axiom{\\spad{p}} \\spad{w}.\\spad{r}.\\spad{t} \\spad{ts}.")) (|normalizedAssociate| ((|#4| |#4| |#5|) "\\axiom{normalizedAssociate(\\spad{p},{}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},{}ts)} returns the inverse of \\axiom{\\spad{p}} \\spad{w}.\\spad{r}.\\spad{t} \\spad{ts} assuming that \\axiom{\\spad{p}} is invertible \\spad{w}.\\spad{r}.\\spad{t} \\spad{ts}."))) NIL NIL -(-799 -4131 |ExtF| |SUEx| |ExtP| |n|) +(-799 -4164 |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 @@ -3139,11 +3139,11 @@ NIL (-802 R |VarSet|) ((|constructor| (NIL "A post-facto extension for \\axiomType{SMP} in order to speed up operations related to pseudo-division and gcd. This domain is based on the \\axiomType{NSUP} constructor which is itself a post-facto extension of the \\axiomType{SUP} constructor."))) (((-4512 "*") |has| |#1| (-175)) (-4503 |has| |#1| (-571)) (-4508 |has| |#1| (-6 -4508)) (-4505 . T) (-4504 . T) (-4507 . T)) -((|HasCategory| |#1| (QUOTE (-940))) (-4133 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-940)))) (-4133 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-940)))) (-4133 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-940)))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-175))) (-4133 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| |#2| (|%list| (QUOTE -912) (QUOTE (-391))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| |#2| (|%list| (QUOTE -912) (QUOTE (-560))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| |#2| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#2| (|%list| (QUOTE -633) (QUOTE (-549))))) (|HasCategory| |#1| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560)))) (-4133 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560)))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| |#2| (|%list| (QUOTE -633) (QUOTE (-1209))))) (|HasCategory| |#2| (|%list| (QUOTE -633) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-376))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -633) (QUOTE (-1209))))) (-4133 (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (QUOTE (-560)))) (|HasCategory| |#2| (|%list| (QUOTE -633) (QUOTE (-1209)))) (-2511 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -633) (QUOTE (-1209)))))) (-4133 (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (QUOTE (-560)))) (|HasCategory| |#2| (|%list| (QUOTE -633) (QUOTE (-1209)))) (-2511 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560)))))) (-2511 (|HasCategory| |#1| (QUOTE (-559))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -633) (QUOTE (-1209)))) (-2511 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560)))))) (-2511 (|HasCategory| |#1| (|%list| (QUOTE -38) (QUOTE (-560)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -633) (QUOTE (-1209)))) (-2511 (|HasCategory| |#1| (|%list| (QUOTE -1023) (QUOTE (-560))))))) (|HasAttribute| |#1| (QUOTE -4508)) (|HasCategory| |#1| (QUOTE (-466))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-940)))) (-4133 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-940)))) (|HasCategory| |#1| (QUOTE (-147))))) +((|HasCategory| |#1| (QUOTE (-940))) (-4144 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-940)))) (-4144 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-940)))) (-4144 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-940)))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-175))) (-4144 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| |#2| (|%list| (QUOTE -912) (QUOTE (-391))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| |#2| (|%list| (QUOTE -912) (QUOTE (-560))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| |#2| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#2| (|%list| (QUOTE -633) (QUOTE (-549))))) (|HasCategory| |#1| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560)))) (-4144 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560)))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| |#2| (|%list| (QUOTE -633) (QUOTE (-1209))))) (|HasCategory| |#2| (|%list| (QUOTE -633) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-376))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -633) (QUOTE (-1209))))) (-4144 (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (QUOTE (-560)))) (|HasCategory| |#2| (|%list| (QUOTE -633) (QUOTE (-1209)))) (-2598 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -633) (QUOTE (-1209)))))) (-4144 (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (QUOTE (-560)))) (|HasCategory| |#2| (|%list| (QUOTE -633) (QUOTE (-1209)))) (-2598 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560)))))) (-2598 (|HasCategory| |#1| (QUOTE (-559))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -633) (QUOTE (-1209)))) (-2598 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560)))))) (-2598 (|HasCategory| |#1| (|%list| (QUOTE -38) (QUOTE (-560)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -633) (QUOTE (-1209)))) (-2598 (|HasCategory| |#1| (|%list| (QUOTE -1023) (QUOTE (-560))))))) (|HasAttribute| |#1| (QUOTE -4508)) (|HasCategory| |#1| (QUOTE (-466))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-940)))) (-4144 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-940)))) (|HasCategory| |#1| (QUOTE (-147))))) (-803 R) ((|constructor| (NIL "A post-facto extension for \\axiomType{SUP} in order to speed up operations related to pseudo-division and gcd for both \\axiomType{SUP} and,{} consequently,{} \\axiomType{NSMP}.")) (|halfExtendedResultant2| (((|Record| (|:| |resultant| |#1|) (|:| |coef2| $)) $ $) "\\axiom{\\spad{halfExtendedResultant2}(a,{}\\spad{b})} returns \\axiom{[\\spad{r},{}ca]} such that \\axiom{extendedResultant(a,{}\\spad{b})} returns \\axiom{[\\spad{r},{}ca,{} cb]}")) (|halfExtendedResultant1| (((|Record| (|:| |resultant| |#1|) (|:| |coef1| $)) $ $) "\\axiom{\\spad{halfExtendedResultant1}(a,{}\\spad{b})} returns \\axiom{[\\spad{r},{}ca]} such that \\axiom{extendedResultant(a,{}\\spad{b})} returns \\axiom{[\\spad{r},{}ca,{} cb]}")) (|extendedResultant| (((|Record| (|:| |resultant| |#1|) (|:| |coef1| $) (|:| |coef2| $)) $ $) "\\axiom{extendedResultant(a,{}\\spad{b})} returns \\axiom{[\\spad{r},{}ca,{}cb]} such that \\axiom{\\spad{r}} is the resultant of \\axiom{a} and \\axiom{\\spad{b}} and \\axiom{\\spad{r} = ca * a + cb * \\spad{b}}")) (|halfExtendedSubResultantGcd2| (((|Record| (|:| |gcd| $) (|:| |coef2| $)) $ $) "\\axiom{\\spad{halfExtendedSubResultantGcd2}(a,{}\\spad{b})} returns \\axiom{[\\spad{g},{}cb]} such that \\axiom{extendedSubResultantGcd(a,{}\\spad{b})} returns \\axiom{[\\spad{g},{}ca,{} cb]}")) (|halfExtendedSubResultantGcd1| (((|Record| (|:| |gcd| $) (|:| |coef1| $)) $ $) "\\axiom{\\spad{halfExtendedSubResultantGcd1}(a,{}\\spad{b})} returns \\axiom{[\\spad{g},{}ca]} such that \\axiom{extendedSubResultantGcd(a,{}\\spad{b})} returns \\axiom{[\\spad{g},{}ca,{} cb]}")) (|extendedSubResultantGcd| (((|Record| (|:| |gcd| $) (|:| |coef1| $) (|:| |coef2| $)) $ $) "\\axiom{extendedSubResultantGcd(a,{}\\spad{b})} returns \\axiom{[\\spad{g},{}ca,{} cb]} such that \\axiom{\\spad{g}} is a gcd of \\axiom{a} and \\axiom{\\spad{b}} in \\axiom{R^(\\spad{-1}) \\spad{P}} and \\axiom{\\spad{g} = ca * a + 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 gcd in \\axiom{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{c^n * a = q*b +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{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 -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)}"))) (((-4512 "*") |has| |#1| (-175)) (-4503 |has| |#1| (-571)) (-4506 |has| |#1| (-376)) (-4508 |has| |#1| (-6 -4508)) (-4505 . T) (-4504 . T) (-4507 . T)) -((|HasCategory| |#1| (QUOTE (-940))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-175))) (-4133 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571)))) (-12 (|HasCategory| (-1114) (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-391))))) (-12 (|HasCategory| (-1114) (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-560))))) (-12 (|HasCategory| (-1114) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391)))))) (-12 (|HasCategory| (-1114) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560)))))) (-12 (|HasCategory| (-1114) (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549))))) (|HasCategory| |#1| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560)))) (-4133 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560)))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (-4133 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-940)))) (-4133 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-940)))) (-4133 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-940)))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-1184))) (|HasCategory| |#1| (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (QUOTE (-240))) (|HasAttribute| |#1| (QUOTE -4508)) (|HasCategory| |#1| (QUOTE (-466))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-940)))) (-4133 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-940)))) (|HasCategory| |#1| (QUOTE (-147))))) +((|HasCategory| |#1| (QUOTE (-940))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-175))) (-4144 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571)))) (-12 (|HasCategory| (-1114) (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-391))))) (-12 (|HasCategory| (-1114) (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-560))))) (-12 (|HasCategory| (-1114) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391)))))) (-12 (|HasCategory| (-1114) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560)))))) (-12 (|HasCategory| (-1114) (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549))))) (|HasCategory| |#1| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560)))) (-4144 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560)))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (-4144 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-940)))) (-4144 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-940)))) (-4144 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-940)))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-1184))) (|HasCategory| |#1| (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (QUOTE (-240))) (|HasAttribute| |#1| (QUOTE -4508)) (|HasCategory| |#1| (QUOTE (-466))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-940)))) (-4144 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-940)))) (|HasCategory| |#1| (QUOTE (-147))))) (-804 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 @@ -3219,8 +3219,8 @@ NIL (-822 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}."))) ((-4504 . T) (-4505 . T) (-4507 . T)) -((|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-381))) (|HasCategory| |#1| (|%list| (QUOTE -528) (QUOTE (-1209)) (|devaluate| |#1|))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))) (|HasCategory| |#1| (|%list| (QUOTE -298) (|devaluate| |#1|) (|devaluate| |#1|))) (-4133 (|HasCategory| (-1028 |#1|) (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560)))))) (-4133 (|HasCategory| (-1028 |#1|) (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-1092))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1028 |#1|) (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| (-1028 |#1|) (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560))))) -(-823 -4133 R OS S) +((|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-381))) (|HasCategory| |#1| (|%list| (QUOTE -528) (QUOTE (-1209)) (|devaluate| |#1|))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))) (|HasCategory| |#1| (|%list| (QUOTE -298) (|devaluate| |#1|) (|devaluate| |#1|))) (-4144 (|HasCategory| (-1028 |#1|) (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560)))))) (-4144 (|HasCategory| (-1028 |#1|) (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-1092))) (|HasCategory| |#1| (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| (-1028 |#1|) (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| (-1028 |#1|) (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560))))) +(-823 -4144 R OS S) ((|constructor| (NIL "\\spad{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 @@ -3228,11 +3228,11 @@ NIL ((|ODESolve| (((|Result|) (|Record| (|:| |xinit| (|DoubleFloat|)) (|:| |xend| (|DoubleFloat|)) (|:| |fn| (|Vector| (|Expression| (|DoubleFloat|)))) (|:| |yinit| (|List| (|DoubleFloat|))) (|:| |intvals| (|List| (|DoubleFloat|))) (|:| |g| (|Expression| (|DoubleFloat|))) (|:| |abserr| (|DoubleFloat|)) (|:| |relerr| (|DoubleFloat|)))) "\\spad{ODESolve(args)} performs the integration of the function given the strategy or method returned by \\axiomFun{measure}.")) (|measure| (((|Record| (|:| |measure| (|Float|)) (|:| |explanations| (|String|))) (|RoutinesTable|) (|Record| (|:| |xinit| (|DoubleFloat|)) (|:| |xend| (|DoubleFloat|)) (|:| |fn| (|Vector| (|Expression| (|DoubleFloat|)))) (|:| |yinit| (|List| (|DoubleFloat|))) (|:| |intvals| (|List| (|DoubleFloat|))) (|:| |g| (|Expression| (|DoubleFloat|))) (|:| |abserr| (|DoubleFloat|)) (|:| |relerr| (|DoubleFloat|)))) "\\spad{measure(R,args)} calculates an estimate of the ability of a particular method to solve a problem. \\blankline This method may be either a specific NAG routine or a strategy (such as transforming the function from one which is difficult to one which is easier to solve). \\blankline It will call whichever agents are needed to perform analysis on the problem in order to calculate the measure. There is a parameter,{} labelled \\axiom{sofar},{} which would contain the best compatibility found so far."))) NIL NIL -(-825 R -4131 L) +(-825 R -4164 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}'s form a basis for the solutions of \\spad{op y = 0}."))) NIL NIL -(-826 R -4131) +(-826 R -4164) ((|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 @@ -3240,7 +3240,7 @@ NIL ((|constructor| (NIL "\\axiom{ODEIntensityFunctionsTable()} provides a dynamic table and a set of functions to store details found out about sets of ODE'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 -(-828 R -4131) +(-828 R -4164) ((|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 @@ -3248,11 +3248,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'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'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'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'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'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'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'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's and calculating a measure of compatibility of each routine to these attributes. \\blankline It then calls the resulting `best' routine."))) NIL NIL -(-830 -4131 UP UPUP R) +(-830 -4164 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 -(-831 -4131 UP L LQ) +(-831 -4164 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}'s are the affine singularities of \\spad{op} above the roots of \\spad{p},{} and the \\spad{e_i}'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}'s are the affine singularities of \\spad{op},{} and the \\spad{e_i}'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}'s are the affine singularities of \\spad{op} above the roots of \\spad{p},{} and the \\spad{e_i}'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}'s are the affine singularities of \\spad{op},{} and the \\spad{e_i}'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 @@ -3260,38 +3260,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 -(-833 -4131 UP L LQ) +(-833 -4164 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}'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)}'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}'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}'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 mj for some \\spad{j},{} and its leading coefficient is then a zero of 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 {gcd(\\spad{d},{}\\spad{q}) = 1}."))) NIL NIL -(-834 -4131 UP) +(-834 -4164 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}'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}'s form a basis for the rational solutions of the homogeneous equation."))) NIL NIL -(-835 -4131 L UP A LO) +(-835 -4164 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 -(-836 -4131 UP) +(-836 -4164 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}'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 ++ part of any rational solution of the associated Riccati equation of \\spad{op y = 0} must be one of the \\spad{fi}'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)))) -(-837 -4131 LO) +(-837 -4164 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 -(-838 -4131 LODO) +(-838 -4164 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 -(-839 -4478 S |f|) +(-839 -2127 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}."))) ((-4504 |has| |#2| (-1081)) (-4505 |has| |#2| (-1081)) (-4507 |has| |#2| (-6 -4507)) (-4510 . T)) -((-4133 (-12 (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-748))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-817))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-872))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))))) (-4133 (-12 (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-1081)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-1133)))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-1081)))) (-12 (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209))))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#2| (QUOTE (-376))) (-4133 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1081)))) (-4133 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-376)))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (QUOTE (-748))) (|HasCategory| |#2| (QUOTE (-817))) (-4133 (|HasCategory| |#2| (QUOTE (-817))) (|HasCategory| |#2| (QUOTE (-872)))) (|HasCategory| |#2| (QUOTE (-872))) (|HasCategory| |#2| (QUOTE (-381))) (-4133 (-12 (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-175)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-240)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-376)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-1081))))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (-4133 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (QUOTE (-748))) (|HasCategory| |#2| (QUOTE (-817))) (|HasCategory| |#2| (QUOTE (-872))) (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (QUOTE (-1133)))) (-4133 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (QUOTE (-748))) (|HasCategory| |#2| (QUOTE (-817))) (|HasCategory| |#2| (QUOTE (-872))) (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (QUOTE (-1133)))) (-4133 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1081)))) (-4133 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1081)))) (-4133 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1081)))) (-4133 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1081)))) (-4133 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-1081)))) (|HasCategory| |#2| (QUOTE (-240))) (-4133 (|HasCategory| |#2| (QUOTE (-240))) (-12 (|HasCategory| |#2| (QUOTE (-239))) (|HasCategory| |#2| (QUOTE (-1081))))) (-4133 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (-12 (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (|%list| (QUOTE -930) (QUOTE (-1209)))))) (|HasCategory| |#2| (QUOTE (-1133))) (-4133 (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-21)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-23)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-25)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-133)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-175)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-240)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-376)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-381)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-748)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-817)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-872)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-1081)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-1133))))) (-4133 (-12 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-748))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-817))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-872))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-1081))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560)))))) (-4133 (-12 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-748))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-817))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-872))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560)))))) (|HasCategory| (-560) (QUOTE (-872))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-1081)))) (-12 (|HasCategory| |#2| (QUOTE (-239))) (|HasCategory| |#2| (QUOTE (-1081)))) (-12 (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (|%list| (QUOTE -930) (QUOTE (-1209))))) (-4133 (|HasCategory| |#2| (QUOTE (-1081))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560)))))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-1133)))) (|HasAttribute| |#2| (QUOTE -4507)) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-1081)))) (-12 (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209))))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#2| (QUOTE (-102))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|))))) +((-4144 (-12 (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-748))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-817))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-872))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))))) (-4144 (-12 (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-1081)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-1133)))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-1081)))) (-12 (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209))))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#2| (QUOTE (-376))) (-4144 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1081)))) (-4144 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-376)))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (QUOTE (-748))) (|HasCategory| |#2| (QUOTE (-817))) (-4144 (|HasCategory| |#2| (QUOTE (-817))) (|HasCategory| |#2| (QUOTE (-872)))) (|HasCategory| |#2| (QUOTE (-872))) (|HasCategory| |#2| (QUOTE (-381))) (-4144 (-12 (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-175)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-240)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-376)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-1081))))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (-4144 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (QUOTE (-748))) (|HasCategory| |#2| (QUOTE (-817))) (|HasCategory| |#2| (QUOTE (-872))) (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (QUOTE (-1133)))) (-4144 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (QUOTE (-748))) (|HasCategory| |#2| (QUOTE (-817))) (|HasCategory| |#2| (QUOTE (-872))) (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (QUOTE (-1133)))) (-4144 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1081)))) (-4144 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1081)))) (-4144 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1081)))) (-4144 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1081)))) (-4144 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-1081)))) (|HasCategory| |#2| (QUOTE (-240))) (-4144 (|HasCategory| |#2| (QUOTE (-240))) (-12 (|HasCategory| |#2| (QUOTE (-239))) (|HasCategory| |#2| (QUOTE (-1081))))) (-4144 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (-12 (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (|%list| (QUOTE -930) (QUOTE (-1209)))))) (|HasCategory| |#2| (QUOTE (-1133))) (-4144 (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-21)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-23)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-25)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-133)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-175)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-240)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-376)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-381)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-748)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-817)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-872)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-1081)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-1133))))) (-4144 (-12 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-748))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-817))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-872))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-1081))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560)))))) (-4144 (-12 (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-21))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-748))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-817))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-872))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560)))))) (|HasCategory| (-560) (QUOTE (-872))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-1081)))) (-12 (|HasCategory| |#2| (QUOTE (-239))) (|HasCategory| |#2| (QUOTE (-1081)))) (-12 (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (|%list| (QUOTE -930) (QUOTE (-1209))))) (-4144 (|HasCategory| |#2| (QUOTE (-1081))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560)))))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-1133)))) (|HasAttribute| |#2| (QUOTE -4507)) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-1081)))) (-12 (|HasCategory| |#2| (QUOTE (-1081))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209))))) (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-25))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#2| (QUOTE (-102))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|))))) (-840 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"))) (((-4512 "*") |has| |#1| (-175)) (-4503 |has| |#1| (-571)) (-4508 |has| |#1| (-6 -4508)) (-4505 . T) (-4504 . T) (-4507 . T)) -((|HasCategory| |#1| (QUOTE (-940))) (-4133 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-940)))) (-4133 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-940)))) (-4133 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-940)))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-175))) (-4133 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571)))) (-12 (|HasCategory| (-842 (-1209)) (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-391))))) (-12 (|HasCategory| (-842 (-1209)) (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-560))))) (-12 (|HasCategory| (-842 (-1209)) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391)))))) (-12 (|HasCategory| (-842 (-1209)) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560)))))) (-12 (|HasCategory| (-842 (-1209)) (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549))))) (|HasCategory| |#1| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560)))) (-4133 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560)))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-376))) (|HasAttribute| |#1| (QUOTE -4508)) (|HasCategory| |#1| (QUOTE (-466))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-940)))) (-4133 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-940)))) (|HasCategory| |#1| (QUOTE (-147))))) +((|HasCategory| |#1| (QUOTE (-940))) (-4144 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-940)))) (-4144 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-940)))) (-4144 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-940)))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-175))) (-4144 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571)))) (-12 (|HasCategory| (-842 (-1209)) (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-391))))) (-12 (|HasCategory| (-842 (-1209)) (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-560))))) (-12 (|HasCategory| (-842 (-1209)) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391)))))) (-12 (|HasCategory| (-842 (-1209)) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560)))))) (-12 (|HasCategory| (-842 (-1209)) (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549))))) (|HasCategory| |#1| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560)))) (-4144 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560)))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-376))) (|HasAttribute| |#1| (QUOTE -4508)) (|HasCategory| |#1| (QUOTE (-466))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-940)))) (-4144 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-940)))) (|HasCategory| |#1| (QUOTE (-147))))) (-841 |Kernels| R |var|) ((|constructor| (NIL "This constructor produces an ordinary differential ring from a partial differential ring by specifying a variable."))) (((-4512 "*") |has| |#2| (-376)) (-4503 |has| |#2| (-376)) (-4508 |has| |#2| (-376)) (-4502 |has| |#2| (-376)) (-4507 . T) (-4505 . T) (-4504 . T)) @@ -3355,7 +3355,7 @@ NIL (-856 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."))) ((-4507 |has| |#1| (-871))) -((|HasCategory| |#1| (QUOTE (-871))) (|HasCategory| |#1| (QUOTE (-21))) (-4133 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-871)))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (-4133 (|HasCategory| |#1| (QUOTE (-871))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-559)))) +((|HasCategory| |#1| (QUOTE (-871))) (|HasCategory| |#1| (QUOTE (-21))) (-4144 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-871)))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (-4144 (|HasCategory| |#1| (QUOTE (-871))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-559)))) (-857 R S) ((|constructor| (NIL "Lifting of maps to one-point completions. Date Created: 4 Oct 1989 Date Last Updated: 4 Oct 1989")) (|map| (((|OnePointCompletion| |#2|) (|Mapping| |#2| |#1|) (|OnePointCompletion| |#1|) (|OnePointCompletion| |#2|)) "\\spad{map(f, r, i)} lifts \\spad{f} and applies it to \\spad{r},{} assuming that \\spad{f}(infinity) = \\spad{i}.") (((|OnePointCompletion| |#2|) (|Mapping| |#2| |#1|) (|OnePointCompletion| |#1|)) "\\spad{map(f, r)} lifts \\spad{f} and applies it to \\spad{r},{} assuming that \\spad{f}(infinity) = infinity."))) NIL @@ -3395,7 +3395,7 @@ NIL (-866 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."))) ((-4507 |has| |#1| (-871))) -((|HasCategory| |#1| (QUOTE (-871))) (|HasCategory| |#1| (QUOTE (-21))) (-4133 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-871)))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (-4133 (|HasCategory| |#1| (QUOTE (-871))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-559)))) +((|HasCategory| |#1| (QUOTE (-871))) (|HasCategory| |#1| (QUOTE (-21))) (-4144 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-871)))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (-4144 (|HasCategory| |#1| (QUOTE (-871))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-559)))) (-867 R S) ((|constructor| (NIL "Lifting of maps to ordered completions. Date Created: 4 Oct 1989 Date Last Updated: 4 Oct 1989")) (|map| (((|OrderedCompletion| |#2|) (|Mapping| |#2| |#1|) (|OrderedCompletion| |#1|) (|OrderedCompletion| |#2|) (|OrderedCompletion| |#2|)) "\\spad{map(f, r, p, m)} lifts \\spad{f} and applies it to \\spad{r},{} assuming that \\spad{f}(plusInfinity) = \\spad{p} and that \\spad{f}(minusInfinity) = \\spad{m}.") (((|OrderedCompletion| |#2|) (|Mapping| |#2| |#1|) (|OrderedCompletion| |#1|)) "\\spad{map(f, r)} lifts \\spad{f} and applies it to \\spad{r},{} assuming that \\spad{f}(plusInfinity) = plusInfinity and that \\spad{f}(minusInfinity) = minusInfinity."))) NIL @@ -3404,7 +3404,7 @@ NIL ((|constructor| (NIL "Ordered finite sets.")) (|max| (($) "\\spad{max} is the maximum value of \\%.")) (|min| (($) "\\spad{min} is the minimum value of \\%."))) NIL NIL -(-869 -4478 S) +(-869 -2127 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 @@ -3444,11 +3444,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{\\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{\\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{\\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{\\sigma} is the morphism to use.")) (|apply| ((|#1| |#2| |#1| |#1| (|Automorphism| |#1|) (|Mapping| |#1| |#1|)) "\\spad{apply(p, c, m, sigma, delta)} returns \\spad{p(m)} where the action is given by \\spad{x m = c sigma(m) + delta(m)}.")) (|times| ((|#2| |#2| |#2| (|Automorphism| |#1|) (|Mapping| |#1| |#1|)) "\\spad{times(p, q, sigma, delta)} returns \\spad{p * q}. \\spad{\\sigma} and \\spad{\\delta} are the maps to use."))) NIL ((|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-571)))) -(-879 R |sigma| -1879) +(-879 R |sigma| -1337) ((|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."))) ((-4504 . T) (-4505 . T) (-4507 . T)) ((|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-376)))) -(-880 |x| R |sigma| -1879) +(-880 |x| R |sigma| -1337) ((|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}."))) ((-4504 . T) (-4505 . T) (-4507 . T)) ((|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-571))) (|HasCategory| |#2| (QUOTE (-466))) (|HasCategory| |#2| (QUOTE (-376)))) @@ -3515,15 +3515,15 @@ NIL (-896 |p|) ((|constructor| (NIL "Stream-based implementation of 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)."))) ((-4502 . T) (-4508 . T) (-4503 . T) ((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) -((|HasCategory| (-894 |#1|) (QUOTE (-940))) (|HasCategory| (-894 |#1|) (|%list| (QUOTE -1070) (QUOTE (-1209)))) (|HasCategory| (-894 |#1|) (QUOTE (-147))) (|HasCategory| (-894 |#1|) (QUOTE (-149))) (|HasCategory| (-894 |#1|) (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| (-894 |#1|) (QUOTE (-1052))) (|HasCategory| (-894 |#1|) (QUOTE (-844))) (|HasCategory| (-894 |#1|) (QUOTE (-872))) (-4133 (|HasCategory| (-894 |#1|) (QUOTE (-844))) (|HasCategory| (-894 |#1|) (QUOTE (-872)))) (|HasCategory| (-894 |#1|) (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| (-894 |#1|) (QUOTE (-1184))) (|HasCategory| (-894 |#1|) (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| (-894 |#1|) (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| (-894 |#1|) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| (-894 |#1|) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| (-894 |#1|) (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| (-894 |#1|) (QUOTE (-239))) (|HasCategory| (-894 |#1|) (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| (-894 |#1|) (QUOTE (-240))) (|HasCategory| (-894 |#1|) (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| (-894 |#1|) (|%list| (QUOTE -528) (QUOTE (-1209)) (|%list| (QUOTE -894) (|devaluate| |#1|)))) (|HasCategory| (-894 |#1|) (|%list| (QUOTE -321) (|%list| (QUOTE -894) (|devaluate| |#1|)))) (|HasCategory| (-894 |#1|) (|%list| (QUOTE -298) (|%list| (QUOTE -894) (|devaluate| |#1|)) (|%list| (QUOTE -894) (|devaluate| |#1|)))) (|HasCategory| (-894 |#1|) (QUOTE (-319))) (|HasCategory| (-894 |#1|) (QUOTE (-559))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-894 |#1|) (QUOTE (-940)))) (-4133 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-894 |#1|) (QUOTE (-940)))) (|HasCategory| (-894 |#1|) (QUOTE (-147))))) +((|HasCategory| (-894 |#1|) (QUOTE (-940))) (|HasCategory| (-894 |#1|) (|%list| (QUOTE -1070) (QUOTE (-1209)))) (|HasCategory| (-894 |#1|) (QUOTE (-147))) (|HasCategory| (-894 |#1|) (QUOTE (-149))) (|HasCategory| (-894 |#1|) (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| (-894 |#1|) (QUOTE (-1052))) (|HasCategory| (-894 |#1|) (QUOTE (-844))) (|HasCategory| (-894 |#1|) (QUOTE (-872))) (-4144 (|HasCategory| (-894 |#1|) (QUOTE (-844))) (|HasCategory| (-894 |#1|) (QUOTE (-872)))) (|HasCategory| (-894 |#1|) (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| (-894 |#1|) (QUOTE (-1184))) (|HasCategory| (-894 |#1|) (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| (-894 |#1|) (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| (-894 |#1|) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| (-894 |#1|) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| (-894 |#1|) (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| (-894 |#1|) (QUOTE (-239))) (|HasCategory| (-894 |#1|) (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| (-894 |#1|) (QUOTE (-240))) (|HasCategory| (-894 |#1|) (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| (-894 |#1|) (|%list| (QUOTE -528) (QUOTE (-1209)) (|%list| (QUOTE -894) (|devaluate| |#1|)))) (|HasCategory| (-894 |#1|) (|%list| (QUOTE -321) (|%list| (QUOTE -894) (|devaluate| |#1|)))) (|HasCategory| (-894 |#1|) (|%list| (QUOTE -298) (|%list| (QUOTE -894) (|devaluate| |#1|)) (|%list| (QUOTE -894) (|devaluate| |#1|)))) (|HasCategory| (-894 |#1|) (QUOTE (-319))) (|HasCategory| (-894 |#1|) (QUOTE (-559))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-894 |#1|) (QUOTE (-940)))) (-4144 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-894 |#1|) (QUOTE (-940)))) (|HasCategory| (-894 |#1|) (QUOTE (-147))))) (-897 |p| PADIC) ((|constructor| (NIL "This is the category of stream-based representations of 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)}."))) ((-4502 . T) (-4508 . T) (-4503 . T) ((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) -((|HasCategory| |#2| (QUOTE (-940))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-149))) (|HasCategory| |#2| (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#2| (QUOTE (-1052))) (|HasCategory| |#2| (QUOTE (-844))) (|HasCategory| |#2| (QUOTE (-872))) (-4133 (|HasCategory| |#2| (QUOTE (-844))) (|HasCategory| |#2| (QUOTE (-872)))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-1184))) (|HasCategory| |#2| (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| |#2| (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| |#2| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| |#2| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-239))) (|HasCategory| |#2| (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (|%list| (QUOTE -528) (QUOTE (-1209)) (|devaluate| |#2|))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|))) (|HasCategory| |#2| (|%list| (QUOTE -298) (|devaluate| |#2|) (|devaluate| |#2|))) (|HasCategory| |#2| (QUOTE (-319))) (|HasCategory| |#2| (QUOTE (-559))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-940)))) (-4133 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-940)))) (|HasCategory| |#2| (QUOTE (-147))))) +((|HasCategory| |#2| (QUOTE (-940))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-149))) (|HasCategory| |#2| (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#2| (QUOTE (-1052))) (|HasCategory| |#2| (QUOTE (-844))) (|HasCategory| |#2| (QUOTE (-872))) (-4144 (|HasCategory| |#2| (QUOTE (-844))) (|HasCategory| |#2| (QUOTE (-872)))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-1184))) (|HasCategory| |#2| (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| |#2| (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| |#2| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| |#2| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-239))) (|HasCategory| |#2| (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (|%list| (QUOTE -528) (QUOTE (-1209)) (|devaluate| |#2|))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|))) (|HasCategory| |#2| (|%list| (QUOTE -298) (|devaluate| |#2|) (|devaluate| |#2|))) (|HasCategory| |#2| (QUOTE (-319))) (|HasCategory| |#2| (QUOTE (-559))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-940)))) (-4144 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-940)))) (|HasCategory| |#2| (QUOTE (-147))))) (-898 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 `p'.")) (|first| ((|#1| $) "\\spad{first(p)} extracts the first component of `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 `s' and `t'."))) NIL -((-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#2| (QUOTE (-1133)))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#2| (QUOTE (-1133)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888)))))) +((-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#2| (QUOTE (-1133)))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#2| (QUOTE (-1133)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888)))))) (-899) ((|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'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's lowest value."))) NIL @@ -3583,7 +3583,7 @@ NIL (-913 |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 (-2511 (|HasCategory| |#2| (QUOTE (-1081)))) (-2511 (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-1209)))))) (-12 (|HasCategory| |#2| (QUOTE (-1081))) (-2511 (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-1209)))))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-1209))))) +((-12 (-2598 (|HasCategory| |#2| (QUOTE (-1081)))) (-2598 (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-1209)))))) (-12 (|HasCategory| |#2| (QUOTE (-1081))) (-2598 (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-1209)))))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-1209))))) (-914 R S) ((|constructor| (NIL "A PatternMatchResult is an object internally returned by the pattern matcher; It is either a failed match,{} or a list of matches of the form (var,{} expr) meaning that the variable var matches the expression expr.")) (|satisfy?| (((|Union| (|Boolean|) "failed") $ (|Pattern| |#1|)) "\\spad{satisfy?(r, p)} returns \\spad{true} if the matches satisfy the top-level predicate of \\spad{p},{} \\spad{false} if they don'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},{}\\spad{e1}),{}...,{}(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 @@ -3596,7 +3596,7 @@ NIL ((|constructor| (NIL "Patterns for use by the pattern matcher.")) (|optpair| (((|Union| (|List| $) "failed") (|List| $)) "\\spad{optpair(l)} returns \\spad{l} has the form \\spad{[a, b]} and a is optional,{} and \"failed\" otherwise.")) (|variables| (((|List| $) $) "\\spad{variables(p)} returns the list of matching variables appearing in \\spad{p}.")) (|getBadValues| (((|List| (|Any|)) $) "\\spad{getBadValues(p)} returns the list of \"bad values\" for \\spad{p}. Note: \\spad{p} is not allowed to match any of its \"bad values\".")) (|addBadValue| (($ $ (|Any|)) "\\spad{addBadValue(p, v)} adds \\spad{v} to the list of \"bad values\" for \\spad{p}. Note: \\spad{p} is not allowed to match any of its \"bad values\".")) (|resetBadValues| (($ $) "\\spad{resetBadValues(p)} initializes the list of \"bad values\" for \\spad{p} to \\spad{[]}. Note: \\spad{p} is not allowed to match any of its \"bad values\".")) (|hasTopPredicate?| (((|Boolean|) $) "\\spad{hasTopPredicate?(p)} tests if \\spad{p} has a top-level predicate.")) (|topPredicate| (((|Record| (|:| |var| (|List| (|Symbol|))) (|:| |pred| (|Any|))) $) "\\spad{topPredicate(x)} returns \\spad{[[a1,...,an], f]} where the top-level predicate of \\spad{x} is \\spad{f(a1,...,an)}. Note: \\spad{n} is 0 if \\spad{x} has no top-level predicate.")) (|setTopPredicate| (($ $ (|List| (|Symbol|)) (|Any|)) "\\spad{setTopPredicate(x, [a1,...,an], f)} returns \\spad{x} with the top-level predicate set to \\spad{f(a1,...,an)}.")) (|patternVariable| (($ (|Symbol|) (|Boolean|) (|Boolean|) (|Boolean|)) "\\spad{patternVariable(x, c?, o?, m?)} creates a pattern variable \\spad{x},{} which is constant if \\spad{c? = true},{} optional if \\spad{o? = true},{} and multiple if \\spad{m? = true}.")) (|withPredicates| (($ $ (|List| (|Any|))) "\\spad{withPredicates(p, [p1,...,pn])} makes a copy of \\spad{p} and attaches the predicate \\spad{p1} and ... and pn to the copy,{} which is returned.")) (|setPredicates| (($ $ (|List| (|Any|))) "\\spad{setPredicates(p, [p1,...,pn])} attaches the predicate \\spad{p1} and ... and pn to \\spad{p}.")) (|predicates| (((|List| (|Any|)) $) "\\spad{predicates(p)} returns \\spad{[p1,...,pn]} such that the predicate attached to \\spad{p} is \\spad{p1} and ... and pn.")) (|hasPredicate?| (((|Boolean|) $) "\\spad{hasPredicate?(p)} tests if \\spad{p} has predicates attached to it.")) (|optional?| (((|Boolean|) $) "\\spad{optional?(p)} tests if \\spad{p} is a single matching variable which can match an identity.")) (|multiple?| (((|Boolean|) $) "\\spad{multiple?(p)} tests if \\spad{p} is a single matching variable allowing list matching or multiple term matching in a sum or product.")) (|generic?| (((|Boolean|) $) "\\spad{generic?(p)} tests if \\spad{p} is a single matching variable.")) (|constant?| (((|Boolean|) $) "\\spad{constant?(p)} tests if \\spad{p} contains no matching variables.")) (|symbol?| (((|Boolean|) $) "\\spad{symbol?(p)} tests if \\spad{p} is a symbol.")) (|quoted?| (((|Boolean|) $) "\\spad{quoted?(p)} tests if \\spad{p} is of the form 's for a symbol \\spad{s}.")) (|inR?| (((|Boolean|) $) "\\spad{inR?(p)} tests if \\spad{p} is an atom (\\spadignore{i.e.} an element of \\spad{R}).")) (|copy| (($ $) "\\spad{copy(p)} returns a recursive copy of \\spad{p}.")) (|convert| (($ (|List| $)) "\\spad{convert([a1,...,an])} returns the pattern \\spad{[a1,...,an]}.")) (|depth| (((|NonNegativeInteger|) $) "\\spad{depth(p)} returns the nesting level of \\spad{p}.")) (/ (($ $ $) "\\spad{a / b} returns the pattern \\spad{a / b}.")) (** (($ $ $) "\\spad{a ** b} returns the pattern \\spad{a ** b}.") (($ $ (|NonNegativeInteger|)) "\\spad{a ** n} returns the pattern \\spad{a ** n}.")) (* (($ $ $) "\\spad{a * b} returns the pattern \\spad{a * b}.")) (+ (($ $ $) "\\spad{a + b} returns the pattern \\spad{a + b}.")) (|elt| (($ (|BasicOperator|) (|List| $)) "\\spad{elt(op, [a1,...,an])} returns \\spad{op(a1,...,an)}.")) (|isPower| (((|Union| (|Record| (|:| |val| $) (|:| |exponent| $)) "failed") $) "\\spad{isPower(p)} returns \\spad{[a, b]} if \\spad{p = a ** b},{} and \"failed\" otherwise.")) (|isList| (((|Union| (|List| $) "failed") $) "\\spad{isList(p)} returns \\spad{[a1,...,an]} if \\spad{p = [a1,...,an]},{} \"failed\" otherwise.")) (|isQuotient| (((|Union| (|Record| (|:| |num| $) (|:| |den| $)) "failed") $) "\\spad{isQuotient(p)} returns \\spad{[a, b]} if \\spad{p = a / b},{} and \"failed\" otherwise.")) (|isExpt| (((|Union| (|Record| (|:| |val| $) (|:| |exponent| (|NonNegativeInteger|))) "failed") $) "\\spad{isExpt(p)} returns \\spad{[q, n]} if \\spad{n > 0} and \\spad{p = q ** n},{} and \"failed\" otherwise.")) (|isOp| (((|Union| (|Record| (|:| |op| (|BasicOperator|)) (|:| |arg| (|List| $))) "failed") $) "\\spad{isOp(p)} returns \\spad{[op, [a1,...,an]]} if \\spad{p = op(a1,...,an)},{} and \"failed\" otherwise.") (((|Union| (|List| $) "failed") $ (|BasicOperator|)) "\\spad{isOp(p, op)} returns \\spad{[a1,...,an]} if \\spad{p = op(a1,...,an)},{} and \"failed\" otherwise.")) (|isTimes| (((|Union| (|List| $) "failed") $) "\\spad{isTimes(p)} returns \\spad{[a1,...,an]} if \\spad{n > 1} and \\spad{p = a1 * ... * an},{} and \"failed\" otherwise.")) (|isPlus| (((|Union| (|List| $) "failed") $) "\\spad{isPlus(p)} returns \\spad{[a1,...,an]} if \\spad{n > 1} \\indented{1}{and \\spad{p = a1 + ... + an},{}} and \"failed\" otherwise.")) ((|One|) (($) "1")) ((|Zero|) (($) "0"))) NIL NIL -(-917 R -2421) +(-917 R -4219) ((|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 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 @@ -3624,7 +3624,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 -(-924 UP -4131) +(-924 UP -4164) ((|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 @@ -3655,11 +3655,11 @@ NIL (-931 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})'s")) (|ptree| (($ $ $) "\\spad{ptree(x,y)} \\undocumented") (($ |#1|) "\\spad{ptree(s)} is a leaf? pendant tree"))) NIL -((-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1133))) (-4133 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1133)))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102)))) +((-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1133))) (-4144 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1133)))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102)))) (-932 S) ((|constructor| (NIL "Permutation(\\spad{S}) implements the group of all bijections \\indented{2}{on a set \\spad{S},{} which move only a finite number of points.} \\indented{2}{A permutation is considered as a map from \\spad{S} into \\spad{S}. In particular} \\indented{2}{multiplication is defined as composition of maps:} \\indented{2}{{\\em pi1 * pi2 = pi1 o pi2}.} \\indented{2}{The internal representation of permuatations are two lists} \\indented{2}{of equal length representing preimages and images.}")) (|coerceImages| (($ (|List| |#1|)) "\\spad{coerceImages(ls)} coerces the list {\\em ls} to a permutation whose image is given by {\\em ls} and the preimage is fixed to be {\\em [1,...,n]}. Note: {coerceImages(\\spad{ls})=coercePreimagesImages([1,{}...,{}\\spad{n}],{}\\spad{ls})}. We assume that both preimage and image do not contain repetitions.")) (|fixedPoints| (((|Set| |#1|) $) "\\spad{fixedPoints(p)} returns the points fixed by the permutation \\spad{p}.")) (|sort| (((|List| $) (|List| $)) "\\spad{sort(lp)} sorts a list of permutations {\\em lp} according to cycle structure first according to length of cycles,{} second,{} if \\spad{S} has \\spadtype{Finite} or \\spad{S} has \\spadtype{OrderedSet} according to lexicographical order of entries in cycles of equal length.")) (|odd?| (((|Boolean|) $) "\\spad{odd?(p)} returns \\spad{true} if and only if \\spad{p} is an odd permutation \\spadignore{i.e.} {\\em sign(p)} is {\\em -1}.")) (|even?| (((|Boolean|) $) "\\spad{even?(p)} returns \\spad{true} if and only if \\spad{p} is an even permutation,{} \\spadignore{i.e.} {\\em sign(p)} is 1.")) (|sign| (((|Integer|) $) "\\spad{sign(p)} returns the signum of the permutation \\spad{p},{} \\spad{+1} or \\spad{-1}.")) (|numberOfCycles| (((|NonNegativeInteger|) $) "\\spad{numberOfCycles(p)} returns the number of non-trivial cycles of the permutation \\spad{p}.")) (|order| (((|NonNegativeInteger|) $) "\\spad{order(p)} returns the order of a permutation \\spad{p} as a group element.")) (|cyclePartition| (((|Partition|) $) "\\spad{cyclePartition(p)} returns the cycle structure of a permutation \\spad{p} including cycles of length 1 only if \\spad{S} is finite.")) (|degree| (((|NonNegativeInteger|) $) "\\spad{degree(p)} retuns the number of points moved by the permutation \\spad{p}.")) (|coerceListOfPairs| (($ (|List| (|List| |#1|))) "\\spad{coerceListOfPairs(lls)} coerces a list of pairs {\\em lls} to a permutation. Error: if not consistent,{} \\spadignore{i.e.} the set of the first elements coincides with the set of second elements. coerce(\\spad{p}) generates output of the permutation \\spad{p} with domain OutputForm.")) (|coerce| (($ (|List| |#1|)) "\\spad{coerce(ls)} coerces a cycle {\\em ls},{} \\spadignore{i.e.} a list with not repetitions to a permutation,{} which maps {\\em ls.i} to {\\em ls.i+1},{} indices modulo the length of the list. Error: if repetitions occur.") (($ (|List| (|List| |#1|))) "\\spad{coerce(lls)} coerces a list of cycles {\\em lls} to a permutation,{} each cycle being a list with no repetitions,{} is coerced to the permutation,{} which maps {\\em ls.i} to {\\em ls.i+1},{} indices modulo the length of the list,{} then these permutations are mutiplied. Error: if repetitions occur in one cycle.")) (|coercePreimagesImages| (($ (|List| (|List| |#1|))) "\\spad{coercePreimagesImages(lls)} coerces the representation {\\em lls} of a permutation as a list of preimages and images to a permutation. We assume that both preimage and image do not contain repetitions.")) (|listRepresentation| (((|Record| (|:| |preimage| (|List| |#1|)) (|:| |image| (|List| |#1|))) $) "\\spad{listRepresentation(p)} produces a representation {\\em rep} of the permutation \\spad{p} as a list of preimages and images,{} \\spad{i}.\\spad{e} \\spad{p} maps {\\em (rep.preimage).k} to {\\em (rep.image).k} for all indices \\spad{k}. Elements of \\spad{S} not in {\\em (rep.preimage).k} are fixed points,{} and these are the only fixed points of the permutation."))) ((-4507 . T)) -((-4133 (|HasCategory| |#1| (QUOTE (-381))) (|HasCategory| |#1| (QUOTE (-872)))) (|HasCategory| |#1| (QUOTE (-381))) (|HasCategory| |#1| (QUOTE (-872)))) +((-4144 (|HasCategory| |#1| (QUOTE (-381))) (|HasCategory| |#1| (QUOTE (-872)))) (|HasCategory| |#1| (QUOTE (-381))) (|HasCategory| |#1| (QUOTE (-872)))) (-933 |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,{} 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 x:\\begin{items} \\item 1. if 2 has an inverse in \\spad{R} we can use the algorithm of \\indented{3}{[Nijenhuis and Wilf,{} 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 @@ -3692,7 +3692,7 @@ NIL ((|constructor| (NIL "This is the category of domains that know \"enough\" about themselves in order to factor univariate polynomials over themselves. This will be used in future releases for supporting factorization over finitely generated coefficient fields,{} it is not yet available in the current release of axiom.")) (|charthRoot| (((|Maybe| $) $) "\\spad{charthRoot(r)} returns the \\spad{p}\\spad{-}th root of \\spad{r},{} or \\spad{nothing} if none exists in the domain.")) (|conditionP| (((|Union| (|Vector| $) "failed") (|Matrix| $)) "\\spad{conditionP(m)} returns a vector of elements,{} not all zero,{} whose \\spad{p}\\spad{-}th powers (\\spad{p} is the characteristic of the domain) are a solution of the homogenous linear system represented by \\spad{m},{} or \"failed\" is there is no such vector.")) (|solveLinearPolynomialEquation| (((|Union| (|List| (|SparseUnivariatePolynomial| $)) "failed") (|List| (|SparseUnivariatePolynomial| $)) (|SparseUnivariatePolynomial| $)) "\\spad{solveLinearPolynomialEquation([f1, ..., fn], g)} (where the \\spad{fi} are relatively prime to each other) returns a list of \\spad{ai} such that \\spad{g/prod fi = sum ai/fi} or returns \"failed\" if no such list of \\spad{ai}'s exists.")) (|gcdPolynomial| (((|SparseUnivariatePolynomial| $) (|SparseUnivariatePolynomial| $) (|SparseUnivariatePolynomial| $)) "\\spad{gcdPolynomial(p,q)} returns the gcd of the univariate polynomials \\spad{p} qnd \\spad{q}.")) (|factorSquareFreePolynomial| (((|Factored| (|SparseUnivariatePolynomial| $)) (|SparseUnivariatePolynomial| $)) "\\spad{factorSquareFreePolynomial(p)} factors the univariate polynomial \\spad{p} into irreducibles where \\spad{p} is known to be square free and primitive with respect to its main variable.")) (|factorPolynomial| (((|Factored| (|SparseUnivariatePolynomial| $)) (|SparseUnivariatePolynomial| $)) "\\spad{factorPolynomial(p)} returns the factorization into irreducibles of the univariate polynomial \\spad{p}.")) (|squareFreePolynomial| (((|Factored| (|SparseUnivariatePolynomial| $)) (|SparseUnivariatePolynomial| $)) "\\spad{squareFreePolynomial(p)} returns the square-free factorization of the univariate polynomial \\spad{p}."))) ((-4503 . T) ((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) NIL -(-941 R0 -4131 UP UPUP R) +(-941 R0 -4164 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 @@ -3720,7 +3720,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'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's Cube acting on integers {\\em 10*i+j} for {\\em 1 <= i <= 6},{} {\\em 1 <= j <= 8}. The faces of Rubik'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's Cube acting on integers 10*i+j for 1 <= \\spad{i} <= 6,{} 1 <= \\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 -(-948 -4131) +(-948 -4164) ((|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 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 @@ -3736,11 +3736,11 @@ NIL ((|constructor| (NIL "The category of constructive principal ideal domains,{} \\spadignore{i.e.} where a single generator can be constructively found for any ideal given by a finite set of generators. Note that this constructive definition only implies that finitely generated ideals are principal. It is not clear what we would mean by an infinitely generated ideal.")) (|expressIdealMember| (((|Maybe| (|List| $)) (|List| $) $) "\\spad{expressIdealMember([f1,...,fn],h)} returns a representation of \\spad{h} as a linear combination of the \\spad{fi} or \\spad{nothing} if \\spad{h} is not in the ideal generated by the \\spad{fi}.")) (|principalIdeal| (((|Record| (|:| |coef| (|List| $)) (|:| |generator| $)) (|List| $)) "\\spad{principalIdeal([f1,...,fn])} returns a record whose generator component is a generator of the ideal generated by \\spad{[f1,...,fn]} whose coef component satisfies \\spad{generator = sum (input.i * coef.i)}"))) ((-4503 . T) ((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) NIL -(-952 |xx| -4131) +(-952 |xx| -4164) ((|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 -(-953 -4131 P) +(-953 -4164 P) ((|constructor| (NIL "This package exports interpolation algorithms")) (|LagrangeInterpolation| ((|#2| (|List| |#1|) (|List| |#1|)) "\\spad{LagrangeInterpolation(l1,l2)} \\undocumented"))) NIL NIL @@ -3768,7 +3768,7 @@ NIL ((|constructor| (NIL "Attaching assertions to symbols for pattern matching. Date Created: 21 Mar 1989 Date Last Updated: 23 May 1990")) (|multiple| (((|Expression| (|Integer|)) (|Symbol|)) "\\spad{multiple(x)} tells the pattern matcher that \\spad{x} should preferably match a multi-term quantity in a sum or product. For matching on lists,{} multiple(\\spad{x}) tells the pattern matcher that \\spad{x} should match a list instead of an element of a list.")) (|optional| (((|Expression| (|Integer|)) (|Symbol|)) "\\spad{optional(x)} tells the pattern matcher that \\spad{x} can match an identity (0 in a sum,{} 1 in a product or exponentiation)..")) (|constant| (((|Expression| (|Integer|)) (|Symbol|)) "\\spad{constant(x)} tells the pattern matcher that \\spad{x} should match only the symbol 'x and no other quantity.")) (|assert| (((|Expression| (|Integer|)) (|Symbol|) (|Identifier|)) "\\spad{assert(x, s)} makes the assertion \\spad{s} about \\spad{x}."))) NIL NIL -(-960 R -4131) +(-960 R -4164) ((|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 '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 @@ -3776,7 +3776,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 -(-962 S R -4131) +(-962 S R -4164) ((|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 @@ -3796,11 +3796,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 -912) (|devaluate| |#1|)))) -(-967 -2421) +(-967 -4219) ((|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 fn to \\spad{x}.") (((|Expression| (|Integer|)) (|Symbol|) (|Mapping| (|Boolean|) |#1|)) "\\spad{suchThat(x, foo)} attaches the predicate foo to \\spad{x}."))) NIL NIL -(-968 R -4131 -2421) +(-968 R -4164 -4219) ((|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 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 @@ -3823,7 +3823,7 @@ NIL (-973 R) ((|constructor| (NIL "This domain implements points in coordinate space"))) ((-4511 . T) (-4510 . T)) -((-4133 (-12 (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549)))) (-4133 (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133)))) (|HasCategory| |#1| (QUOTE (-872))) (-4133 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133)))) (|HasCategory| (-560) (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-748))) (|HasCategory| |#1| (QUOTE (-1081))) (-12 (|HasCategory| |#1| (QUOTE (-1034))) (|HasCategory| |#1| (QUOTE (-1081)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) +((-4144 (-12 (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549)))) (-4144 (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133)))) (|HasCategory| |#1| (QUOTE (-872))) (-4144 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133)))) (|HasCategory| (-560) (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-748))) (|HasCategory| |#1| (QUOTE (-1081))) (-12 (|HasCategory| |#1| (QUOTE (-1034))) (|HasCategory| |#1| (QUOTE (-1081)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-974 |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 @@ -3835,7 +3835,7 @@ NIL (-976 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}."))) (((-4512 "*") |has| |#1| (-175)) (-4503 |has| |#1| (-571)) (-4508 |has| |#1| (-6 -4508)) (-4505 . T) (-4504 . T) (-4507 . T)) -((|HasCategory| |#1| (QUOTE (-940))) (-4133 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-940)))) (-4133 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-940)))) (-4133 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-940)))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-175))) (-4133 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571)))) (-12 (|HasCategory| (-1209) (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-391))))) (-12 (|HasCategory| (-1209) (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-560))))) (-12 (|HasCategory| (-1209) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391)))))) (-12 (|HasCategory| (-1209) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560)))))) (-12 (|HasCategory| (-1209) (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549))))) (|HasCategory| |#1| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560)))) (-4133 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560)))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-376))) (|HasAttribute| |#1| (QUOTE -4508)) (|HasCategory| |#1| (QUOTE (-466))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-940)))) (-4133 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-940)))) (|HasCategory| |#1| (QUOTE (-147))))) +((|HasCategory| |#1| (QUOTE (-940))) (-4144 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-940)))) (-4144 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-940)))) (-4144 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-940)))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-175))) (-4144 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571)))) (-12 (|HasCategory| (-1209) (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-391))))) (-12 (|HasCategory| (-1209) (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-560))))) (-12 (|HasCategory| (-1209) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391)))))) (-12 (|HasCategory| (-1209) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560)))))) (-12 (|HasCategory| (-1209) (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549))))) (|HasCategory| |#1| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560)))) (-4144 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560)))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-376))) (|HasAttribute| |#1| (QUOTE -4508)) (|HasCategory| |#1| (QUOTE (-466))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-940)))) (-4144 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-940)))) (|HasCategory| |#1| (QUOTE (-147))))) (-977 R S) ((|constructor| (NIL "\\indented{2}{This package takes a mapping between coefficient rings,{} and lifts} it to a mapping between polynomials over those rings.")) (|map| (((|Polynomial| |#2|) (|Mapping| |#2| |#1|) (|Polynomial| |#1|)) "\\spad{map(f, p)} produces a new polynomial as a result of applying the function \\spad{f} to every coefficient of the polynomial \\spad{p}."))) NIL @@ -3852,7 +3852,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 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 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 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 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}."))) (((-4512 "*") |has| |#1| (-175)) (-4503 |has| |#1| (-571)) (-4508 |has| |#1| (-6 -4508)) (-4505 . T) (-4504 . T) (-4507 . T)) NIL -(-981 E V R P -4131) +(-981 E V R P -4164) ((|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},{}...,{}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 @@ -3860,7 +3860,7 @@ NIL ((|constructor| (NIL "This package provides a very general map function,{} which given a set \\spad{S} and polynomials over \\spad{R} with maps from the variables into \\spad{S} and the coefficients into \\spad{S},{} maps polynomials into \\spad{S}. \\spad{S} is assumed to support \\spad{+},{} \\spad{*} and \\spad{**}.")) (|map| ((|#5| (|Mapping| |#5| |#2|) (|Mapping| |#5| |#3|) |#4|) "\\spad{map(varmap, coefmap, p)} takes a \\spad{varmap},{} a mapping from the variables of polynomial \\spad{p} into \\spad{S},{} \\spad{coefmap},{} a mapping from coefficients of \\spad{p} into \\spad{S},{} and \\spad{p},{} and produces a member of \\spad{S} using the corresponding arithmetic. in \\spad{S}"))) NIL NIL -(-983 E V R P -4131) +(-983 E V R P -4164) ((|constructor| (NIL "computes \\spad{n}-th roots of quotients of multivariate polynomials")) (|nthr| (((|Record| (|:| |exponent| (|NonNegativeInteger|)) (|:| |coef| |#4|) (|:| |radicand| (|List| |#4|))) |#4| (|NonNegativeInteger|)) "\\spad{nthr(p,n)} should be local but conditional")) (|froot| (((|Record| (|:| |exponent| (|NonNegativeInteger|)) (|:| |coef| |#5|) (|:| |radicand| |#5|)) |#5| (|NonNegativeInteger|)) "\\spad{froot(f, n)} returns \\spad{[m,c,r]} such that \\spad{f**(1/n) = c * r**(1/m)}.")) (|qroot| (((|Record| (|:| |exponent| (|NonNegativeInteger|)) (|:| |coef| |#5|) (|:| |radicand| |#5|)) (|Fraction| (|Integer|)) (|NonNegativeInteger|)) "\\spad{qroot(f, n)} returns \\spad{[m,c,r]} such that \\spad{f**(1/n) = c * r**(1/m)}.")) (|rroot| (((|Record| (|:| |exponent| (|NonNegativeInteger|)) (|:| |coef| |#5|) (|:| |radicand| |#5|)) |#3| (|NonNegativeInteger|)) "\\spad{rroot(f, n)} returns \\spad{[m,c,r]} such that \\spad{f**(1/n) = c * r**(1/m)}.")) (|denom| ((|#4| $) "\\spad{denom(x)} \\undocumented")) (|numer| ((|#4| $) "\\spad{numer(x)} \\undocumented"))) NIL ((|HasCategory| |#3| (QUOTE (-466)))) @@ -3875,7 +3875,7 @@ NIL (-986 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}"))) (((-4512 "*") |has| |#1| (-175)) (-4503 |has| |#1| (-571)) (-4508 |has| |#1| (-6 -4508)) (-4504 . T) (-4505 . T) (-4507 . T)) -((|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-571))) (-4133 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571)))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-4133 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560)))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-466))) (-12 (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#2| (QUOTE (-133)))) (|HasAttribute| |#1| (QUOTE -4508))) +((|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-571))) (-4144 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571)))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-4144 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560)))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-466))) (-12 (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#2| (QUOTE (-133)))) (|HasAttribute| |#1| (QUOTE -4508))) (-987 R L) ((|constructor| (NIL "\\spadtype{PrecomputedAssociatedEquations} stores some generic precomputations which speed up the computations of the associated equations needed for factoring operators.")) (|firstUncouplingMatrix| (((|Union| (|Matrix| |#1|) "failed") |#2| (|PositiveInteger|)) "\\spad{firstUncouplingMatrix(op, m)} returns the matrix A such that \\spad{A w = (W',W'',...,W^N)} in the corresponding associated equations for right-factors of order \\spad{m} of \\spad{op}. Returns \"failed\" if the matrix A has not been precomputed for the particular combination \\spad{degree(L), m}."))) NIL @@ -3883,7 +3883,7 @@ NIL (-988 S) ((|constructor| (NIL "\\indented{1}{This provides a fast array type with no bound checking on elt's.} Minimum index is 0 in this type,{} cannot be changed"))) ((-4511 . T) (-4510 . T)) -((-4133 (-12 (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549)))) (-4133 (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133)))) (|HasCategory| |#1| (QUOTE (-872))) (-4133 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133)))) (|HasCategory| (-560) (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) +((-4144 (-12 (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549)))) (-4144 (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133)))) (|HasCategory| |#1| (QUOTE (-872))) (-4144 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133)))) (|HasCategory| (-560) (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-989 A B) ((|constructor| (NIL "\\indented{1}{This package provides tools for operating on primitive arrays} with unary and binary functions involving different underlying types")) (|map| (((|PrimitiveArray| |#2|) (|Mapping| |#2| |#1|) (|PrimitiveArray| |#1|)) "\\spad{map(f,a)} applies function \\spad{f} to each member of primitive array \\spad{a} resulting in a new primitive array over a possibly different underlying domain.")) (|reduce| ((|#2| (|Mapping| |#2| |#1| |#2|) (|PrimitiveArray| |#1|) |#2|) "\\spad{reduce(f,a,r)} applies function \\spad{f} to each successive element of the primitive array \\spad{a} and an accumulant initialized to \\spad{r}. For example,{} \\spad{reduce(_+\\$Integer,[1,2,3],0)} does \\spad{3+(2+(1+0))}. Note: third argument \\spad{r} may be regarded as the identity element for the function \\spad{f}.")) (|scan| (((|PrimitiveArray| |#2|) (|Mapping| |#2| |#1| |#2|) (|PrimitiveArray| |#1|) |#2|) "\\spad{scan(f,a,r)} successively applies \\spad{reduce(f,x,r)} to more and more leading sub-arrays \\spad{x} of primitive array \\spad{a}. More precisely,{} if \\spad{a} is \\spad{[a1,a2,...]},{} then \\spad{scan(f,a,r)} returns \\spad{[reduce(f,[a1],r),reduce(f,[a1,a2],r),...]}."))) NIL @@ -3892,7 +3892,7 @@ NIL ((|constructor| (NIL "Category for the functions defined by integrals.")) (|integral| (($ $ (|SegmentBinding| $)) "\\spad{integral(f, x = a..b)} returns the formal definite integral of \\spad{f} dx for \\spad{x} between \\spad{a} and \\spad{b}.") (($ $ (|Symbol|)) "\\spad{integral(f, x)} returns the formal integral of \\spad{f} dx."))) NIL NIL -(-991 -4131) +(-991 -4164) ((|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}'s are the defining polynomials for the \\spad{ai}'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}'s are the defining polynomials for the \\spad{ai}'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}'s are the defining polynomials for the \\spad{ai}'s. The \\spad{p2} may involve \\spad{a1},{} but \\spad{p1} must not involve \\spad{a2}. This operation uses \\spadfun{resultant}."))) NIL NIL @@ -3907,7 +3907,7 @@ NIL (-994 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"))) ((-4507 -12 (|has| |#2| (-487)) (|has| |#1| (-487)))) -((-4133 (-12 (|HasCategory| |#1| (QUOTE (-817))) (|HasCategory| |#2| (QUOTE (-817)))) (-12 (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#2| (QUOTE (-872))))) (-12 (|HasCategory| |#1| (QUOTE (-817))) (|HasCategory| |#2| (QUOTE (-817)))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-21)))) (-12 (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-133)))) (-12 (|HasCategory| |#1| (QUOTE (-817))) (|HasCategory| |#2| (QUOTE (-817))))) (-12 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-21)))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-21)))) (-12 (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-23)))) (-12 (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-133)))) (-12 (|HasCategory| |#1| (QUOTE (-817))) (|HasCategory| |#2| (QUOTE (-817))))) (-12 (|HasCategory| |#1| (QUOTE (-487))) (|HasCategory| |#2| (QUOTE (-487)))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-487))) (|HasCategory| |#2| (QUOTE (-487)))) (-12 (|HasCategory| |#1| (QUOTE (-748))) (|HasCategory| |#2| (QUOTE (-748))))) (-12 (|HasCategory| |#1| (QUOTE (-381))) (|HasCategory| |#2| (QUOTE (-381)))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-21)))) (-12 (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-23)))) (-12 (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-133)))) (-12 (|HasCategory| |#1| (QUOTE (-487))) (|HasCategory| |#2| (QUOTE (-487)))) (-12 (|HasCategory| |#1| (QUOTE (-748))) (|HasCategory| |#2| (QUOTE (-748)))) (-12 (|HasCategory| |#1| (QUOTE (-817))) (|HasCategory| |#2| (QUOTE (-817))))) (-12 (|HasCategory| |#1| (QUOTE (-748))) (|HasCategory| |#2| (QUOTE (-748)))) (-12 (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-23)))) (-12 (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-133)))) (-12 (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#2| (QUOTE (-872))))) +((-4144 (-12 (|HasCategory| |#1| (QUOTE (-817))) (|HasCategory| |#2| (QUOTE (-817)))) (-12 (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#2| (QUOTE (-872))))) (-12 (|HasCategory| |#1| (QUOTE (-817))) (|HasCategory| |#2| (QUOTE (-817)))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-21)))) (-12 (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-133)))) (-12 (|HasCategory| |#1| (QUOTE (-817))) (|HasCategory| |#2| (QUOTE (-817))))) (-12 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-21)))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-21)))) (-12 (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-23)))) (-12 (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-133)))) (-12 (|HasCategory| |#1| (QUOTE (-817))) (|HasCategory| |#2| (QUOTE (-817))))) (-12 (|HasCategory| |#1| (QUOTE (-487))) (|HasCategory| |#2| (QUOTE (-487)))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-487))) (|HasCategory| |#2| (QUOTE (-487)))) (-12 (|HasCategory| |#1| (QUOTE (-748))) (|HasCategory| |#2| (QUOTE (-748))))) (-12 (|HasCategory| |#1| (QUOTE (-381))) (|HasCategory| |#2| (QUOTE (-381)))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#2| (QUOTE (-21)))) (-12 (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-23)))) (-12 (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-133)))) (-12 (|HasCategory| |#1| (QUOTE (-487))) (|HasCategory| |#2| (QUOTE (-487)))) (-12 (|HasCategory| |#1| (QUOTE (-748))) (|HasCategory| |#2| (QUOTE (-748)))) (-12 (|HasCategory| |#1| (QUOTE (-817))) (|HasCategory| |#2| (QUOTE (-817))))) (-12 (|HasCategory| |#1| (QUOTE (-748))) (|HasCategory| |#2| (QUOTE (-748)))) (-12 (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#2| (QUOTE (-23)))) (-12 (|HasCategory| |#1| (QUOTE (-133))) (|HasCategory| |#2| (QUOTE (-133)))) (-12 (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#2| (QUOTE (-872))))) (-995) ((|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 `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 @@ -3996,7 +3996,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 -(-1017 K R UP -4131) +(-1017 K R UP -4164) ((|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 @@ -4043,7 +4043,7 @@ NIL (-1028 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.}"))) ((-4503 |has| |#1| (-302)) (-4504 . T) (-4505 . T) (-4507 . T)) -((|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#1| (QUOTE (-376))) (-4133 (|HasCategory| |#1| (QUOTE (-302))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-302))) (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -528) (QUOTE (-1209)) (|devaluate| |#1|))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))) (|HasCategory| |#1| (|%list| (QUOTE -298) (|devaluate| |#1|) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-240))) (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (-4133 (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-1092))) (|HasCategory| |#1| (QUOTE (-559)))) +((|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#1| (QUOTE (-376))) (-4144 (|HasCategory| |#1| (QUOTE (-302))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-302))) (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -528) (QUOTE (-1209)) (|devaluate| |#1|))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))) (|HasCategory| |#1| (|%list| (QUOTE -298) (|devaluate| |#1|) (|devaluate| |#1|))) (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-240))) (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (-4144 (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-1092))) (|HasCategory| |#1| (QUOTE (-559)))) (-1029 S R) ((|constructor| (NIL "\\spadtype{QuaternionCategory} describes the category of quaternions and implements functions that are not representation specific.")) (|rationalIfCan| (((|Union| (|Fraction| (|Integer|)) "failed") $) "\\spad{rationalIfCan(q)} returns \\spad{q} as a rational number,{} or \"failed\" if this is not possible. Note: if \\spad{rational?(q)} is \\spad{true},{} the conversion can be done and the rational number will be returned.")) (|rational| (((|Fraction| (|Integer|)) $) "\\spad{rational(q)} tries to convert \\spad{q} into a rational number. Error: if this is not possible. If \\spad{rational?(q)} is \\spad{true},{} the conversion will be done and the rational number returned.")) (|rational?| (((|Boolean|) $) "\\spad{rational?(q)} returns {\\it \\spad{true}} if all the imaginary parts of \\spad{q} are zero and the real part can be converted into a rational number,{} and {\\it \\spad{false}} otherwise.")) (|abs| ((|#2| $) "\\spad{abs(q)} computes the absolute value of quaternion \\spad{q} (sqrt of norm).")) (|real| ((|#2| $) "\\spad{real(q)} extracts the real part of quaternion \\spad{q}.")) (|quatern| (($ |#2| |#2| |#2| |#2|) "\\spad{quatern(r,i,j,k)} constructs a quaternion from scalars.")) (|norm| ((|#2| $) "\\spad{norm(q)} computes the norm of \\spad{q} (the sum of the squares of the components).")) (|imagK| ((|#2| $) "\\spad{imagK(q)} extracts the imaginary \\spad{k} part of quaternion \\spad{q}.")) (|imagJ| ((|#2| $) "\\spad{imagJ(q)} extracts the imaginary \\spad{j} part of quaternion \\spad{q}.")) (|imagI| ((|#2| $) "\\spad{imagI(q)} extracts the imaginary \\spad{i} part of quaternion \\spad{q}.")) (|conjugate| (($ $) "\\spad{conjugate(q)} negates the imaginary parts of quaternion \\spad{q}."))) NIL @@ -4059,7 +4059,7 @@ NIL (-1032 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}."))) ((-4510 . T) (-4511 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1133))) (-4133 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1133)))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102)))) +((-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1133))) (-4144 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1133)))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102)))) (-1033 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 @@ -4068,14 +4068,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 -(-1035 -4131 UP UPUP |radicnd| |n|) +(-1035 -4164 UP UPUP |radicnd| |n|) ((|constructor| (NIL "Function field defined by y**n = \\spad{f}(\\spad{x})."))) ((-4503 |has| (-421 |#2|) (-376)) (-4508 |has| (-421 |#2|) (-376)) (-4502 |has| (-421 |#2|) (-376)) ((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) -((|HasCategory| (-421 |#2|) (QUOTE (-147))) (|HasCategory| (-421 |#2|) (QUOTE (-149))) (|HasCategory| (-421 |#2|) (QUOTE (-363))) (-4133 (|HasCategory| (-421 |#2|) (QUOTE (-376))) (|HasCategory| (-421 |#2|) (QUOTE (-363)))) (|HasCategory| (-421 |#2|) (QUOTE (-376))) (|HasCategory| (-421 |#2|) (QUOTE (-381))) (-4133 (-12 (|HasCategory| (-421 |#2|) (QUOTE (-240))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (|HasCategory| (-421 |#2|) (QUOTE (-363)))) (-4133 (-12 (|HasCategory| (-421 |#2|) (QUOTE (-240))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (-12 (|HasCategory| (-421 |#2|) (QUOTE (-239))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (|HasCategory| (-421 |#2|) (QUOTE (-363)))) (-4133 (-12 (|HasCategory| (-421 |#2|) (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (-12 (|HasCategory| (-421 |#2|) (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| (-421 |#2|) (QUOTE (-363))))) (-4133 (-12 (|HasCategory| (-421 |#2|) (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (-12 (|HasCategory| (-421 |#2|) (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| (-421 |#2|) (QUOTE (-376))))) (|HasCategory| (-421 |#2|) (|%list| (QUOTE -660) (QUOTE (-560)))) (-4133 (|HasCategory| (-421 |#2|) (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (|HasCategory| (-421 |#2|) (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| (-421 |#2|) (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-381))) (-12 (|HasCategory| (-421 |#2|) (QUOTE (-239))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (-12 (|HasCategory| (-421 |#2|) (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (-12 (|HasCategory| (-421 |#2|) (QUOTE (-240))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (-12 (|HasCategory| (-421 |#2|) (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| (-421 |#2|) (QUOTE (-376))))) +((|HasCategory| (-421 |#2|) (QUOTE (-147))) (|HasCategory| (-421 |#2|) (QUOTE (-149))) (|HasCategory| (-421 |#2|) (QUOTE (-363))) (-4144 (|HasCategory| (-421 |#2|) (QUOTE (-376))) (|HasCategory| (-421 |#2|) (QUOTE (-363)))) (|HasCategory| (-421 |#2|) (QUOTE (-376))) (|HasCategory| (-421 |#2|) (QUOTE (-381))) (-4144 (-12 (|HasCategory| (-421 |#2|) (QUOTE (-240))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (|HasCategory| (-421 |#2|) (QUOTE (-363)))) (-4144 (-12 (|HasCategory| (-421 |#2|) (QUOTE (-240))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (-12 (|HasCategory| (-421 |#2|) (QUOTE (-239))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (|HasCategory| (-421 |#2|) (QUOTE (-363)))) (-4144 (-12 (|HasCategory| (-421 |#2|) (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (-12 (|HasCategory| (-421 |#2|) (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| (-421 |#2|) (QUOTE (-363))))) (-4144 (-12 (|HasCategory| (-421 |#2|) (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (-12 (|HasCategory| (-421 |#2|) (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| (-421 |#2|) (QUOTE (-376))))) (|HasCategory| (-421 |#2|) (|%list| (QUOTE -660) (QUOTE (-560)))) (-4144 (|HasCategory| (-421 |#2|) (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (|HasCategory| (-421 |#2|) (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| (-421 |#2|) (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-381))) (-12 (|HasCategory| (-421 |#2|) (QUOTE (-239))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (-12 (|HasCategory| (-421 |#2|) (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (-12 (|HasCategory| (-421 |#2|) (QUOTE (-240))) (|HasCategory| (-421 |#2|) (QUOTE (-376)))) (-12 (|HasCategory| (-421 |#2|) (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| (-421 |#2|) (QUOTE (-376))))) (-1036 |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."))) ((-4502 . T) (-4508 . T) (-4503 . T) ((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) -((|HasCategory| (-560) (QUOTE (-940))) (|HasCategory| (-560) (|%list| (QUOTE -1070) (QUOTE (-1209)))) (|HasCategory| (-560) (QUOTE (-147))) (|HasCategory| (-560) (QUOTE (-149))) (|HasCategory| (-560) (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| (-560) (QUOTE (-1052))) (|HasCategory| (-560) (QUOTE (-844))) (|HasCategory| (-560) (QUOTE (-872))) (-4133 (|HasCategory| (-560) (QUOTE (-844))) (|HasCategory| (-560) (QUOTE (-872)))) (|HasCategory| (-560) (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| (-560) (QUOTE (-1184))) (|HasCategory| (-560) (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| (-560) (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| (-560) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| (-560) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| (-560) (QUOTE (-239))) (|HasCategory| (-560) (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| (-560) (QUOTE (-240))) (|HasCategory| (-560) (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| (-560) (|%list| (QUOTE -528) (QUOTE (-1209)) (QUOTE (-560)))) (|HasCategory| (-560) (|%list| (QUOTE -321) (QUOTE (-560)))) (|HasCategory| (-560) (|%list| (QUOTE -298) (QUOTE (-560)) (QUOTE (-560)))) (|HasCategory| (-560) (QUOTE (-319))) (|HasCategory| (-560) (QUOTE (-559))) (|HasCategory| (-560) (|%list| (QUOTE -660) (QUOTE (-560)))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-560) (QUOTE (-940)))) (-4133 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-560) (QUOTE (-940)))) (|HasCategory| (-560) (QUOTE (-147))))) +((|HasCategory| (-560) (QUOTE (-940))) (|HasCategory| (-560) (|%list| (QUOTE -1070) (QUOTE (-1209)))) (|HasCategory| (-560) (QUOTE (-147))) (|HasCategory| (-560) (QUOTE (-149))) (|HasCategory| (-560) (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| (-560) (QUOTE (-1052))) (|HasCategory| (-560) (QUOTE (-844))) (|HasCategory| (-560) (QUOTE (-872))) (-4144 (|HasCategory| (-560) (QUOTE (-844))) (|HasCategory| (-560) (QUOTE (-872)))) (|HasCategory| (-560) (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| (-560) (QUOTE (-1184))) (|HasCategory| (-560) (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| (-560) (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| (-560) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| (-560) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| (-560) (QUOTE (-239))) (|HasCategory| (-560) (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| (-560) (QUOTE (-240))) (|HasCategory| (-560) (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| (-560) (|%list| (QUOTE -528) (QUOTE (-1209)) (QUOTE (-560)))) (|HasCategory| (-560) (|%list| (QUOTE -321) (QUOTE (-560)))) (|HasCategory| (-560) (|%list| (QUOTE -298) (QUOTE (-560)) (QUOTE (-560)))) (|HasCategory| (-560) (QUOTE (-319))) (|HasCategory| (-560) (QUOTE (-559))) (|HasCategory| (-560) (|%list| (QUOTE -660) (QUOTE (-560)))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-560) (QUOTE (-940)))) (-4144 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-560) (QUOTE (-940)))) (|HasCategory| (-560) (QUOTE (-147))))) (-1037) ((|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 @@ -4108,19 +4108,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} ** (1/2)}") (($ (|Fraction| (|Integer|))) "\\axiom{sqrt(\\spad{x})} is \\axiom{\\spad{x} ** (1/2)}") (($ $) "\\axiom{sqrt(\\spad{x})} is \\axiom{\\spad{x} ** (1/2)}") (($ $ (|PositiveInteger|)) "\\axiom{sqrt(\\spad{x},{}\\spad{n})} is \\axiom{\\spad{x} ** (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}}"))) ((-4503 . T) (-4508 . T) (-4502 . T) (-4505 . T) (-4504 . T) ((-4512 "*") . T) (-4507 . T)) NIL -(-1045 R -4131) +(-1045 R -4164) ((|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 -(-1046 R -4131) +(-1046 R -4164) ((|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 -(-1047 -4131 UP) +(-1047 -4164 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 -(-1048 -4131 UP) +(-1048 -4164 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 @@ -4155,8 +4155,8 @@ NIL (-1056 |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"))) ((-4503 . T) (-4508 . T) (-4502 . T) (-4505 . T) (-4504 . T) ((-4512 "*") . T) (-4507 . T)) -((-4133 (|HasCategory| (-421 (-560)) (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| (-421 (-560)) (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| (-421 (-560)) (|%list| (QUOTE -1070) (QUOTE (-560))))) -(-1057 -4131 L) +((-4144 (|HasCategory| (-421 (-560)) (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| (-421 (-560)) (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| (-421 (-560)) (|%list| (QUOTE -1070) (QUOTE (-560))))) +(-1057 -4164 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 @@ -4192,14 +4192,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 -(-1066 -4131 |Expon| |VarSet| |FPol| |LFPol|) +(-1066 -4164 |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"))) (((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) NIL (-1067) ((|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.}"))) ((-4510 . T) (-4511 . T)) -((-12 (|HasCategory| (-2 (|:| -1580 (-1209)) (|:| -3432 (-51))) (QUOTE (-1133))) (|HasCategory| (-2 (|:| -1580 (-1209)) (|:| -3432 (-51))) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -1580) (QUOTE (-1209))) (|%list| (QUOTE |:|) (QUOTE -3432) (QUOTE (-51))))))) (-4133 (|HasCategory| (-2 (|:| -1580 (-1209)) (|:| -3432 (-51))) (QUOTE (-1133))) (|HasCategory| (-51) (QUOTE (-1133)))) (-4133 (|HasCategory| (-2 (|:| -1580 (-1209)) (|:| -3432 (-51))) (QUOTE (-102))) (|HasCategory| (-2 (|:| -1580 (-1209)) (|:| -3432 (-51))) (QUOTE (-1133))) (|HasCategory| (-51) (QUOTE (-102))) (|HasCategory| (-51) (QUOTE (-1133)))) (-4133 (|HasCategory| (-2 (|:| -1580 (-1209)) (|:| -3432 (-51))) (QUOTE (-1133))) (|HasCategory| (-2 (|:| -1580 (-1209)) (|:| -3432 (-51))) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-51) (QUOTE (-1133))) (|HasCategory| (-51) (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| (-2 (|:| -1580 (-1209)) (|:| -3432 (-51))) (|%list| (QUOTE -633) (QUOTE (-549)))) (-12 (|HasCategory| (-51) (QUOTE (-1133))) (|HasCategory| (-51) (|%list| (QUOTE -321) (QUOTE (-51))))) (|HasCategory| (-2 (|:| -1580 (-1209)) (|:| -3432 (-51))) (QUOTE (-1133))) (|HasCategory| (-1209) (QUOTE (-872))) (|HasCategory| (-51) (QUOTE (-1133))) (-4133 (|HasCategory| (-2 (|:| -1580 (-1209)) (|:| -3432 (-51))) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-51) (|%list| (QUOTE -632) (QUOTE (-888))))) (-4133 (|HasCategory| (-2 (|:| -1580 (-1209)) (|:| -3432 (-51))) (QUOTE (-102))) (|HasCategory| (-51) (QUOTE (-102)))) (|HasCategory| (-51) (QUOTE (-102))) (|HasCategory| (-51) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-2 (|:| -1580 (-1209)) (|:| -3432 (-51))) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-2 (|:| -1580 (-1209)) (|:| -3432 (-51))) (QUOTE (-102)))) +((-12 (|HasCategory| (-2 (|:| -2118 (-1209)) (|:| -3964 (-51))) (QUOTE (-1133))) (|HasCategory| (-2 (|:| -2118 (-1209)) (|:| -3964 (-51))) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -2118) (QUOTE (-1209))) (|%list| (QUOTE |:|) (QUOTE -3964) (QUOTE (-51))))))) (-4144 (|HasCategory| (-2 (|:| -2118 (-1209)) (|:| -3964 (-51))) (QUOTE (-1133))) (|HasCategory| (-51) (QUOTE (-1133)))) (-4144 (|HasCategory| (-2 (|:| -2118 (-1209)) (|:| -3964 (-51))) (QUOTE (-102))) (|HasCategory| (-2 (|:| -2118 (-1209)) (|:| -3964 (-51))) (QUOTE (-1133))) (|HasCategory| (-51) (QUOTE (-102))) (|HasCategory| (-51) (QUOTE (-1133)))) (-4144 (|HasCategory| (-2 (|:| -2118 (-1209)) (|:| -3964 (-51))) (QUOTE (-1133))) (|HasCategory| (-2 (|:| -2118 (-1209)) (|:| -3964 (-51))) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-51) (QUOTE (-1133))) (|HasCategory| (-51) (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| (-2 (|:| -2118 (-1209)) (|:| -3964 (-51))) (|%list| (QUOTE -633) (QUOTE (-549)))) (-12 (|HasCategory| (-51) (QUOTE (-1133))) (|HasCategory| (-51) (|%list| (QUOTE -321) (QUOTE (-51))))) (|HasCategory| (-2 (|:| -2118 (-1209)) (|:| -3964 (-51))) (QUOTE (-1133))) (|HasCategory| (-1209) (QUOTE (-872))) (|HasCategory| (-51) (QUOTE (-1133))) (-4144 (|HasCategory| (-2 (|:| -2118 (-1209)) (|:| -3964 (-51))) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-51) (|%list| (QUOTE -632) (QUOTE (-888))))) (-4144 (|HasCategory| (-2 (|:| -2118 (-1209)) (|:| -3964 (-51))) (QUOTE (-102))) (|HasCategory| (-51) (QUOTE (-102)))) (|HasCategory| (-51) (QUOTE (-102))) (|HasCategory| (-51) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-2 (|:| -2118 (-1209)) (|:| -3964 (-51))) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-2 (|:| -2118 (-1209)) (|:| -3964 (-51))) (QUOTE (-102)))) (-1068) ((|constructor| (NIL "This domain represents `return' expressions.")) (|expression| (((|SpadAst|) $) "\\spad{expression(e)} returns the expression returned by `e'."))) NIL @@ -4256,7 +4256,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."))) ((-4507 . T)) NIL -(-1082 |xx| -4131) +(-1082 |xx| -4164) ((|constructor| (NIL "This package exports rational interpolation algorithms"))) NIL NIL @@ -4275,7 +4275,7 @@ NIL (-1086 |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}."))) ((-4510 . T) (-4505 . T) (-4504 . T)) -((|HasCategory| |#3| (QUOTE (-175))) (-4133 (-12 (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1133))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|))))) (|HasCategory| |#3| (|%list| (QUOTE -633) (QUOTE (-549)))) (-4133 (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (QUOTE (-376)))) (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (QUOTE (-1133))) (|HasCategory| |#3| (QUOTE (-319))) (|HasCategory| |#3| (QUOTE (-571))) (-12 (|HasCategory| |#3| (QUOTE (-1133))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (|HasCategory| |#3| (QUOTE (-102))) (|HasCategory| |#3| (|%list| (QUOTE -632) (QUOTE (-888))))) +((|HasCategory| |#3| (QUOTE (-175))) (-4144 (-12 (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1133))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|))))) (|HasCategory| |#3| (|%list| (QUOTE -633) (QUOTE (-549)))) (-4144 (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (QUOTE (-376)))) (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (QUOTE (-1133))) (|HasCategory| |#3| (QUOTE (-319))) (|HasCategory| |#3| (QUOTE (-571))) (-12 (|HasCategory| |#3| (QUOTE (-1133))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (|HasCategory| |#3| (QUOTE (-102))) (|HasCategory| |#3| (|%list| (QUOTE -632) (QUOTE (-888))))) (-1087 |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 @@ -4311,7 +4311,7 @@ NIL (-1095) ((|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's")) (|selectPDERoutines| (($ $) "\\spad{selectPDERoutines(R)} chooses only those routines from the database which are for the solution of PDE'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}"))) ((-4510 . T) (-4511 . T)) -((-12 (|HasCategory| (-2 (|:| -1580 (-1209)) (|:| -3432 (-51))) (QUOTE (-1133))) (|HasCategory| (-2 (|:| -1580 (-1209)) (|:| -3432 (-51))) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -1580) (QUOTE (-1209))) (|%list| (QUOTE |:|) (QUOTE -3432) (QUOTE (-51))))))) (-4133 (|HasCategory| (-2 (|:| -1580 (-1209)) (|:| -3432 (-51))) (QUOTE (-1133))) (|HasCategory| (-51) (QUOTE (-1133)))) (-4133 (|HasCategory| (-2 (|:| -1580 (-1209)) (|:| -3432 (-51))) (QUOTE (-102))) (|HasCategory| (-2 (|:| -1580 (-1209)) (|:| -3432 (-51))) (QUOTE (-1133))) (|HasCategory| (-51) (QUOTE (-102))) (|HasCategory| (-51) (QUOTE (-1133)))) (-4133 (|HasCategory| (-2 (|:| -1580 (-1209)) (|:| -3432 (-51))) (QUOTE (-1133))) (|HasCategory| (-2 (|:| -1580 (-1209)) (|:| -3432 (-51))) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-51) (QUOTE (-1133))) (|HasCategory| (-51) (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| (-2 (|:| -1580 (-1209)) (|:| -3432 (-51))) (|%list| (QUOTE -633) (QUOTE (-549)))) (-12 (|HasCategory| (-51) (QUOTE (-1133))) (|HasCategory| (-51) (|%list| (QUOTE -321) (QUOTE (-51))))) (|HasCategory| (-2 (|:| -1580 (-1209)) (|:| -3432 (-51))) (QUOTE (-1133))) (|HasCategory| (-1209) (QUOTE (-872))) (|HasCategory| (-51) (QUOTE (-1133))) (-4133 (|HasCategory| (-2 (|:| -1580 (-1209)) (|:| -3432 (-51))) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-51) (|%list| (QUOTE -632) (QUOTE (-888))))) (-4133 (|HasCategory| (-2 (|:| -1580 (-1209)) (|:| -3432 (-51))) (QUOTE (-102))) (|HasCategory| (-51) (QUOTE (-102)))) (|HasCategory| (-51) (QUOTE (-102))) (|HasCategory| (-51) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-2 (|:| -1580 (-1209)) (|:| -3432 (-51))) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-2 (|:| -1580 (-1209)) (|:| -3432 (-51))) (QUOTE (-102)))) +((-12 (|HasCategory| (-2 (|:| -2118 (-1209)) (|:| -3964 (-51))) (QUOTE (-1133))) (|HasCategory| (-2 (|:| -2118 (-1209)) (|:| -3964 (-51))) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -2118) (QUOTE (-1209))) (|%list| (QUOTE |:|) (QUOTE -3964) (QUOTE (-51))))))) (-4144 (|HasCategory| (-2 (|:| -2118 (-1209)) (|:| -3964 (-51))) (QUOTE (-1133))) (|HasCategory| (-51) (QUOTE (-1133)))) (-4144 (|HasCategory| (-2 (|:| -2118 (-1209)) (|:| -3964 (-51))) (QUOTE (-102))) (|HasCategory| (-2 (|:| -2118 (-1209)) (|:| -3964 (-51))) (QUOTE (-1133))) (|HasCategory| (-51) (QUOTE (-102))) (|HasCategory| (-51) (QUOTE (-1133)))) (-4144 (|HasCategory| (-2 (|:| -2118 (-1209)) (|:| -3964 (-51))) (QUOTE (-1133))) (|HasCategory| (-2 (|:| -2118 (-1209)) (|:| -3964 (-51))) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-51) (QUOTE (-1133))) (|HasCategory| (-51) (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| (-2 (|:| -2118 (-1209)) (|:| -3964 (-51))) (|%list| (QUOTE -633) (QUOTE (-549)))) (-12 (|HasCategory| (-51) (QUOTE (-1133))) (|HasCategory| (-51) (|%list| (QUOTE -321) (QUOTE (-51))))) (|HasCategory| (-2 (|:| -2118 (-1209)) (|:| -3964 (-51))) (QUOTE (-1133))) (|HasCategory| (-1209) (QUOTE (-872))) (|HasCategory| (-51) (QUOTE (-1133))) (-4144 (|HasCategory| (-2 (|:| -2118 (-1209)) (|:| -3964 (-51))) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-51) (|%list| (QUOTE -632) (QUOTE (-888))))) (-4144 (|HasCategory| (-2 (|:| -2118 (-1209)) (|:| -3964 (-51))) (QUOTE (-102))) (|HasCategory| (-51) (QUOTE (-102)))) (|HasCategory| (-51) (QUOTE (-102))) (|HasCategory| (-51) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-2 (|:| -2118 (-1209)) (|:| -3964 (-51))) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-2 (|:| -2118 (-1209)) (|:| -3964 (-51))) (QUOTE (-102)))) (-1096 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{gcd(\\spad{r},{}\\spad{p})} returns the gcd of \\axiom{\\spad{r}} and the content of \\axiom{\\spad{p}}.")) (|nextsubResultant2| (($ $ $ $ $) "\\axiom{\\spad{nextsubResultant2}(\\spad{p},{}\\spad{q},{}\\spad{z},{}\\spad{s})} is the multivariate version of the operation \\axiomOpFrom{\\spad{next_sousResultant2}}{PseudoRemainderSequence} from the \\axiomType{PseudoRemainderSequence} constructor.")) (|LazardQuotient2| (($ $ $ $ (|NonNegativeInteger|)) "\\axiom{\\spad{LazardQuotient2}(\\spad{p},{}a,{}\\spad{b},{}\\spad{n})} returns \\axiom{(a**(\\spad{n}-1) * \\spad{p}) exquo 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 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{\\spad{halfExtendedSubResultantGcd2}(a,{}\\spad{b})} returns \\axiom{[\\spad{g},{}cb]} if \\axiom{extendedSubResultantGcd(a,{}\\spad{b})} returns \\axiom{[\\spad{g},{}ca,{}cb]} otherwise produces an error.")) (|halfExtendedSubResultantGcd1| (((|Record| (|:| |gcd| $) (|:| |coef1| $)) $ $) "\\axiom{\\spad{halfExtendedSubResultantGcd1}(a,{}\\spad{b})} returns \\axiom{[\\spad{g},{}ca]} if \\axiom{extendedSubResultantGcd(a,{}\\spad{b})} returns \\axiom{[\\spad{g},{}ca,{}cb]} otherwise produces an error.")) (|extendedSubResultantGcd| (((|Record| (|:| |gcd| $) (|:| |coef1| $) (|:| |coef2| $)) $ $) "\\axiom{extendedSubResultantGcd(a,{}\\spad{b})} returns \\axiom{[ca,{}cb,{}\\spad{r}]} such that \\axiom{\\spad{r}} is \\axiom{subResultantGcd(a,{}\\spad{b})} and we have \\axiom{ca * a + cb * cb = \\spad{r}} .")) (|subResultantGcd| (($ $ $) "\\axiom{subResultantGcd(a,{}\\spad{b})} computes a 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 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)*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)*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)*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},{}lp)} returns \\spad{true} iff \\axiom{normalized?(\\spad{q},{}\\spad{p})} holds for every \\axiom{\\spad{p}} in \\axiom{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},{}lp)} returns \\spad{true} iff \\axiom{initiallyReduced?(\\spad{q},{}\\spad{p})} holds for every \\axiom{\\spad{p}} in \\axiom{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},{}lp)} returns \\spad{true} iff \\axiom{headReduced?(\\spad{q},{}\\spad{p})} holds for every \\axiom{\\spad{p}} in \\axiom{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},{}lp)} returns \\spad{true} iff \\axiom{reduced?(\\spad{q},{}\\spad{p})} holds for every \\axiom{\\spad{p}} in \\axiom{lp}.") (((|Boolean|) $ $) "\\axiom{reduced?(a,{}\\spad{b})} returns \\spad{true} iff \\axiom{degree(a,{}mvar(\\spad{b})) < mdeg(\\spad{b})}.")) (|supRittWu?| (((|Boolean|) $ $) "\\axiom{supRittWu?(a,{}\\spad{b})} returns \\spad{true} if \\axiom{a} is greater than \\axiom{\\spad{b}} \\spad{w}.\\spad{r}.\\spad{t}. the Ritt and Wu Wen Tsun ordering using the refinement of Lazard.")) (|infRittWu?| (((|Boolean|) $ $) "\\axiom{infRittWu?(a,{}\\spad{b})} returns \\spad{true} if \\axiom{a} is less than \\axiom{\\spad{b}} \\spad{w}.\\spad{r}.\\spad{t}. the Ritt and Wu Wen Tsun ordering using the refinement of Lazard.")) (|RittWuCompare| (((|Union| (|Boolean|) "failed") $ $) "\\axiom{RittWuCompare(a,{}\\spad{b})} returns \\axiom{\"failed\"} if \\axiom{a} and \\axiom{\\spad{b}} have same rank \\spad{w}.\\spad{r}.\\spad{t}. Ritt and Wu Wen Tsun ordering using the refinement of Lazard,{} otherwise returns \\axiom{infRittWu?(a,{}\\spad{b})}.")) (|mainMonomials| (((|List| $) $) "\\axiom{mainMonomials(\\spad{p})} returns an error if \\axiom{\\spad{p}} is \\axiom{\\spad{O}},{} otherwise,{} if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}} returns [1],{} otherwise returns the list of the monomials of \\axiom{\\spad{p}},{} where \\axiom{\\spad{p}} is viewed as a univariate polynomial in its main variable.")) (|mainCoefficients| (((|List| $) $) "\\axiom{mainCoefficients(\\spad{p})} returns an error if \\axiom{\\spad{p}} is \\axiom{\\spad{O}},{} otherwise,{} if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}} returns [\\spad{p}],{} otherwise returns the list of the coefficients of \\axiom{\\spad{p}},{} where \\axiom{\\spad{p}} is viewed as a univariate polynomial in its main variable.")) (|leastMonomial| (($ $) "\\axiom{leastMonomial(\\spad{p})} returns an error if \\axiom{\\spad{p}} is \\axiom{\\spad{O}},{} otherwise,{} if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}} returns \\axiom{1},{} otherwise,{} the monomial of \\axiom{\\spad{p}} with lowest degree,{} where \\axiom{\\spad{p}} is viewed as a univariate polynomial in its main variable.")) (|mainMonomial| (($ $) "\\axiom{mainMonomial(\\spad{p})} returns an error if \\axiom{\\spad{p}} is \\axiom{\\spad{O}},{} otherwise,{} if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}} returns \\axiom{1},{} otherwise,{} \\axiom{mvar(\\spad{p})} raised to the power \\axiom{mdeg(\\spad{p})}.")) (|quasiMonic?| (((|Boolean|) $) "\\axiom{quasiMonic?(\\spad{p})} returns \\spad{false} if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}},{} otherwise returns \\spad{true} iff the initial of \\axiom{\\spad{p}} lies in the base ring \\axiom{\\spad{R}}.")) (|monic?| (((|Boolean|) $) "\\axiom{monic?(\\spad{p})} returns \\spad{false} if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}},{} otherwise returns \\spad{true} iff \\axiom{\\spad{p}} is monic as a univariate polynomial in its main variable.")) (|reductum| (($ $ |#4|) "\\axiom{reductum(\\spad{p},{}\\spad{v})} returns the reductum of \\axiom{\\spad{p}},{} where \\axiom{\\spad{p}} is viewed as a univariate polynomial in \\axiom{\\spad{v}}.")) (|leadingCoefficient| (($ $ |#4|) "\\axiom{leadingCoefficient(\\spad{p},{}\\spad{v})} returns the leading coefficient of \\axiom{\\spad{p}},{} where \\axiom{\\spad{p}} is viewed as A univariate polynomial in \\axiom{\\spad{v}}.")) (|deepestInitial| (($ $) "\\axiom{deepestInitial(\\spad{p})} returns an error if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}},{} otherwise returns the last term of \\axiom{iteratedInitials(\\spad{p})}.")) (|iteratedInitials| (((|List| $) $) "\\axiom{iteratedInitials(\\spad{p})} returns \\axiom{[]} if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}},{} otherwise returns the list of the iterated initials of \\axiom{\\spad{p}}.")) (|deepestTail| (($ $) "\\axiom{deepestTail(\\spad{p})} returns \\axiom{0} if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}},{} otherwise returns tail(\\spad{p}),{} if \\axiom{tail(\\spad{p})} belongs to \\axiom{\\spad{R}} or \\axiom{mvar(tail(\\spad{p})) < mvar(\\spad{p})},{} otherwise returns \\axiom{deepestTail(tail(\\spad{p}))}.")) (|tail| (($ $) "\\axiom{tail(\\spad{p})} returns its reductum,{} where \\axiom{\\spad{p}} is viewed as a univariate polynomial in its main variable.")) (|head| (($ $) "\\axiom{head(\\spad{p})} returns \\axiom{\\spad{p}} if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}},{} otherwise returns its leading term (monomial in the AXIOM sense),{} where \\axiom{\\spad{p}} is viewed as a univariate polynomial in its main variable.")) (|init| (($ $) "\\axiom{init(\\spad{p})} returns an error if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}},{} otherwise returns its leading coefficient,{} where \\axiom{\\spad{p}} is viewed as a univariate polynomial in its main variable.")) (|mdeg| (((|NonNegativeInteger|) $) "\\axiom{mdeg(\\spad{p})} returns an error if \\axiom{\\spad{p}} is \\axiom{0},{} otherwise,{} if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}} returns \\axiom{0},{} otherwise,{} returns the degree of \\axiom{\\spad{p}} in its main variable.")) (|mvar| ((|#4| $) "\\axiom{mvar(\\spad{p})} returns an error if \\axiom{\\spad{p}} belongs to \\axiom{\\spad{R}},{} otherwise returns its main variable \\spad{w}. \\spad{r}. \\spad{t}. to the total ordering on the elements in \\axiom{\\spad{V}}."))) NIL @@ -4356,7 +4356,7 @@ NIL ((|constructor| (NIL "This is the datatype of OpenAxiom runtime values. It exists solely for internal purposes.")) (|eq| (((|Boolean|) $ $) "\\spad{eq(x,y)} holds if both values \\spad{x} and \\spad{y} resides at the same address in memory."))) NIL NIL -(-1107 |Base| R -4131) +(-1107 |Base| R -4164) ((|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},{}...,{}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 @@ -4364,7 +4364,7 @@ NIL ((|constructor| (NIL "This domain implements named rules")) (|name| (((|Symbol|) $) "\\spad{name(x)} returns the symbol"))) NIL NIL -(-1109 |Base| R -4131) +(-1109 |Base| R -4164) ((|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 @@ -4375,7 +4375,7 @@ NIL (-1111 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."))) ((-4503 |has| |#1| (-376)) (-4508 |has| |#1| (-376)) (-4502 |has| |#1| (-376)) ((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) -((|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-363))) (-4133 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-363)))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-381))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-363)))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-363)))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209))))) (-12 (|HasCategory| |#1| (QUOTE (-363))) (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -930) (QUOTE (-1209)))))) (|HasCategory| |#1| (|%list| (QUOTE -660) (QUOTE (-560)))) (-4133 (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560)))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-363)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -930) (QUOTE (-1209))))) (-12 (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| |#1| (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))))) +((|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-363))) (-4144 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-363)))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-381))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-363)))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-363)))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209))))) (-12 (|HasCategory| |#1| (QUOTE (-363))) (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -930) (QUOTE (-1209)))))) (|HasCategory| |#1| (|%list| (QUOTE -660) (QUOTE (-560)))) (-4144 (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560)))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-363)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -930) (QUOTE (-1209))))) (-12 (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| |#1| (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))))) (-1112 UP SAE UPA) ((|constructor| (NIL "Factorization of univariate polynomials with coefficients in an algebraic extension of the rational numbers (\\spadtype{Fraction Integer}).")) (|factor| (((|Factored| |#3|) |#3|) "\\spad{factor(p)} returns a prime factorisation of \\spad{p}."))) NIL @@ -4407,7 +4407,7 @@ NIL (-1119 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"))) (((-4512 "*") |has| |#1| (-175)) (-4503 |has| |#1| (-571)) (-4508 |has| |#1| (-6 -4508)) (-4505 . T) (-4504 . T) (-4507 . T)) -((|HasCategory| |#1| (QUOTE (-940))) (-4133 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-940)))) (-4133 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-940)))) (-4133 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-940)))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-175))) (-4133 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571)))) (-12 (|HasCategory| (-1120 (-1209)) (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-391))))) (-12 (|HasCategory| (-1120 (-1209)) (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-560))))) (-12 (|HasCategory| (-1120 (-1209)) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391)))))) (-12 (|HasCategory| (-1120 (-1209)) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560)))))) (-12 (|HasCategory| (-1120 (-1209)) (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549))))) (|HasCategory| |#1| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560)))) (-4133 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560)))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-376))) (|HasAttribute| |#1| (QUOTE -4508)) (|HasCategory| |#1| (QUOTE (-466))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-940)))) (-4133 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-940)))) (|HasCategory| |#1| (QUOTE (-147))))) +((|HasCategory| |#1| (QUOTE (-940))) (-4144 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-940)))) (-4144 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-940)))) (-4144 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-940)))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-175))) (-4144 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571)))) (-12 (|HasCategory| (-1120 (-1209)) (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-391))))) (-12 (|HasCategory| (-1120 (-1209)) (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-560))))) (-12 (|HasCategory| (-1120 (-1209)) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391)))))) (-12 (|HasCategory| (-1120 (-1209)) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560)))))) (-12 (|HasCategory| (-1120 (-1209)) (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549))))) (|HasCategory| |#1| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560)))) (-4144 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560)))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-376))) (|HasAttribute| |#1| (QUOTE -4508)) (|HasCategory| |#1| (QUOTE (-466))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-940)))) (-4144 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-940)))) (|HasCategory| |#1| (QUOTE (-147))))) (-1120 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 @@ -4447,7 +4447,7 @@ NIL (-1129 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)}}"))) ((-4510 . T) (-4500 . T) (-4511 . T)) -((-4133 (-12 (|HasCategory| |#1| (QUOTE (-381))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#1| (QUOTE (-381))) (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) +((-4144 (-12 (|HasCategory| |#1| (QUOTE (-381))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#1| (QUOTE (-381))) (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-1130 A S) ((|constructor| (NIL "A set category lists a collection of set-theoretic operations useful for both finite sets and multisets. Note however that finite sets are distinct from multisets. Although the operations defined for set categories are common to both,{} the relationship between the two cannot be described by inclusion or inheritance.")) (|union| (($ |#2| $) "\\spad{union(x,u)} returns the set aggregate \\spad{u} with the element \\spad{x} added. If \\spad{u} already contains \\spad{x},{} \\axiom{union(\\spad{x},{}\\spad{u})} returns a copy of \\spad{u}.") (($ $ |#2|) "\\spad{union(u,x)} returns the set aggregate \\spad{u} with the element \\spad{x} added. If \\spad{u} already contains \\spad{x},{} \\axiom{union(\\spad{u},{}\\spad{x})} returns a copy of \\spad{u}.") (($ $ $) "\\spad{union(u,v)} returns the set aggregate of elements which are members of either set aggregate \\spad{u} or \\spad{v}.")) (|subset?| (((|Boolean|) $ $) "\\spad{subset?(u,v)} tests if \\spad{u} is a subset of \\spad{v}. Note: equivalent to \\axiom{reduce(and,{}{member?(\\spad{x},{}\\spad{v}) for \\spad{x} in \\spad{u}},{}\\spad{true},{}\\spad{false})}.")) (|symmetricDifference| (($ $ $) "\\spad{symmetricDifference(u,v)} returns the set aggregate of elements \\spad{x} which are members of set aggregate \\spad{u} or set aggregate \\spad{v} but not both. If \\spad{u} and \\spad{v} have no elements in common,{} \\axiom{symmetricDifference(\\spad{u},{}\\spad{v})} returns a copy of \\spad{u}. Note: \\axiom{symmetricDifference(\\spad{u},{}\\spad{v}) = union(difference(\\spad{u},{}\\spad{v}),{}difference(\\spad{v},{}\\spad{u}))}")) (|difference| (($ $ |#2|) "\\spad{difference(u,x)} returns the set aggregate \\spad{u} with element \\spad{x} removed. If \\spad{u} does not contain \\spad{x},{} a copy of \\spad{u} is returned. Note: \\axiom{difference(\\spad{s},{} \\spad{x}) = difference(\\spad{s},{} {\\spad{x}})}.") (($ $ $) "\\spad{difference(u,v)} returns the set aggregate \\spad{w} consisting of elements in set aggregate \\spad{u} but not in set aggregate \\spad{v}. If \\spad{u} and \\spad{v} have no elements in common,{} \\axiom{difference(\\spad{u},{}\\spad{v})} returns a copy of \\spad{u}. Note: equivalent to the notation (not currently supported) \\axiom{{\\spad{x} for \\spad{x} in \\spad{u} | not member?(\\spad{x},{}\\spad{v})}}.")) (|intersect| (($ $ $) "\\spad{intersect(u,v)} returns the set aggregate \\spad{w} consisting of elements common to both set aggregates \\spad{u} and \\spad{v}. Note: equivalent to the notation (not currently supported) {\\spad{x} for \\spad{x} in \\spad{u} | member?(\\spad{x},{}\\spad{v})}.")) (|set| (($ (|List| |#2|)) "\\spad{set([x,y,...,z])} creates a set aggregate containing items \\spad{x},{}\\spad{y},{}...,{}\\spad{z}.") (($) "\\spad{set()}\\$\\spad{D} creates an empty set aggregate of type \\spad{D}.")) (|brace| (($ (|List| |#2|)) "\\spad{brace([x,y,...,z])} creates a set aggregate containing items \\spad{x},{}\\spad{y},{}...,{}\\spad{z}. This form is considered obsolete. Use \\axiomFun{set} instead.") (($) "\\spad{brace()}\\$\\spad{D} (otherwise written {}\\$\\spad{D}) creates an empty set aggregate of type \\spad{D}. This form is considered obsolete. Use \\axiomFun{set} instead.")) (|part?| (((|Boolean|) $ $) "\\spad{s} < \\spad{t} returns \\spad{true} if all elements of set aggregate \\spad{s} are also elements of set aggregate \\spad{t}."))) NIL @@ -4511,7 +4511,7 @@ NIL (-1145 |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 \\spad{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}."))) ((-4504 |has| |#3| (-1081)) (-4505 |has| |#3| (-1081)) (-4507 |has| |#3| (-6 -4507)) (-4510 . T)) -((-4133 (-12 (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-23))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-133))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-381))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-748))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-817))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-872))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1081))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1133))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|))) (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209)))))) (-4133 (-12 (|HasCategory| |#3| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#3| (QUOTE (-1081)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-1133)))) (-12 (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (QUOTE (-1081)))) (-12 (|HasCategory| |#3| (QUOTE (-1081))) (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209))))) (-12 (|HasCategory| |#3| (QUOTE (-1133))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1133))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (|HasCategory| |#3| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#3| (QUOTE (-376))) (-4133 (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (QUOTE (-1081)))) (-4133 (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (QUOTE (-376)))) (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (QUOTE (-1081))) (|HasCategory| |#3| (QUOTE (-748))) (|HasCategory| |#3| (QUOTE (-817))) (-4133 (|HasCategory| |#3| (QUOTE (-817))) (|HasCategory| |#3| (QUOTE (-872)))) (|HasCategory| |#3| (QUOTE (-872))) (|HasCategory| |#3| (QUOTE (-381))) (-4133 (-12 (|HasCategory| |#3| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209))))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#3| (QUOTE (-175)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#3| (QUOTE (-240)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#3| (QUOTE (-376)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#3| (QUOTE (-1081))))) (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209)))) (-4133 (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (QUOTE (-23))) (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (QUOTE (-102))) (|HasCategory| |#3| (QUOTE (-133))) (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (QUOTE (-381))) (|HasCategory| |#3| (QUOTE (-748))) (|HasCategory| |#3| (QUOTE (-817))) (|HasCategory| |#3| (QUOTE (-872))) (|HasCategory| |#3| (QUOTE (-1081))) (|HasCategory| |#3| (QUOTE (-1133)))) (-4133 (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (QUOTE (-23))) (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (QUOTE (-133))) (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (QUOTE (-381))) (|HasCategory| |#3| (QUOTE (-748))) (|HasCategory| |#3| (QUOTE (-817))) (|HasCategory| |#3| (QUOTE (-872))) (|HasCategory| |#3| (QUOTE (-1081))) (|HasCategory| |#3| (QUOTE (-1133)))) (-4133 (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (QUOTE (-23))) (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (QUOTE (-133))) (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (QUOTE (-1081)))) (-4133 (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (QUOTE (-23))) (|HasCategory| |#3| (QUOTE (-133))) (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (QUOTE (-1081)))) (-4133 (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (QUOTE (-133))) (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (QUOTE (-1081)))) (-4133 (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (QUOTE (-1081)))) (-4133 (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (QUOTE (-1081)))) (|HasCategory| |#3| (QUOTE (-240))) (-4133 (|HasCategory| |#3| (QUOTE (-240))) (-12 (|HasCategory| |#3| (QUOTE (-239))) (|HasCategory| |#3| (QUOTE (-1081))))) (-4133 (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209)))) (-12 (|HasCategory| |#3| (QUOTE (-1081))) (|HasCategory| |#3| (|%list| (QUOTE -930) (QUOTE (-1209)))))) (|HasCategory| |#3| (QUOTE (-1133))) (-4133 (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209))))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-21)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-23)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-25)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-133)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-175)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-240)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-376)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-381)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-748)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-817)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-872)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-1081)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-1133))))) (-4133 (-12 (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-23))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-133))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-381))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-748))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-817))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-872))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-1081))) (-12 (|HasCategory| |#3| (QUOTE (-1133))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560)))))) (-4133 (-12 (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-23))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-133))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-381))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-748))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-817))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-872))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-1081))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-1133))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560)))))) (|HasCategory| (-560) (QUOTE (-872))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#3| (QUOTE (-1081)))) (-12 (|HasCategory| |#3| (QUOTE (-239))) (|HasCategory| |#3| (QUOTE (-1081)))) (-12 (|HasCategory| |#3| (QUOTE (-1081))) (|HasCategory| |#3| (|%list| (QUOTE -930) (QUOTE (-1209))))) (-4133 (|HasCategory| |#3| (QUOTE (-1081))) (-12 (|HasCategory| |#3| (QUOTE (-1133))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560)))))) (-12 (|HasCategory| |#3| (QUOTE (-1133))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-1133)))) (|HasAttribute| |#3| (QUOTE -4507)) (-12 (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (QUOTE (-1081)))) (-12 (|HasCategory| |#3| (QUOTE (-1081))) (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209))))) (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (QUOTE (-23))) (|HasCategory| |#3| (QUOTE (-133))) (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#3| (QUOTE (-102))) (-12 (|HasCategory| |#3| (QUOTE (-1133))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|))))) +((-4144 (-12 (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-23))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-133))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-381))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-748))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-817))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-872))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1081))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1133))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|))) (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209)))))) (-4144 (-12 (|HasCategory| |#3| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#3| (QUOTE (-1081)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-1133)))) (-12 (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (QUOTE (-1081)))) (-12 (|HasCategory| |#3| (QUOTE (-1081))) (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209))))) (-12 (|HasCategory| |#3| (QUOTE (-1133))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|)))) (-12 (|HasCategory| |#3| (QUOTE (-1133))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (|HasCategory| |#3| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#3| (QUOTE (-376))) (-4144 (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (QUOTE (-1081)))) (-4144 (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (QUOTE (-376)))) (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (QUOTE (-1081))) (|HasCategory| |#3| (QUOTE (-748))) (|HasCategory| |#3| (QUOTE (-817))) (-4144 (|HasCategory| |#3| (QUOTE (-817))) (|HasCategory| |#3| (QUOTE (-872)))) (|HasCategory| |#3| (QUOTE (-872))) (|HasCategory| |#3| (QUOTE (-381))) (-4144 (-12 (|HasCategory| |#3| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209))))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#3| (QUOTE (-175)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#3| (QUOTE (-240)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#3| (QUOTE (-376)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#3| (QUOTE (-1081))))) (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209)))) (-4144 (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (QUOTE (-23))) (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (QUOTE (-102))) (|HasCategory| |#3| (QUOTE (-133))) (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (QUOTE (-381))) (|HasCategory| |#3| (QUOTE (-748))) (|HasCategory| |#3| (QUOTE (-817))) (|HasCategory| |#3| (QUOTE (-872))) (|HasCategory| |#3| (QUOTE (-1081))) (|HasCategory| |#3| (QUOTE (-1133)))) (-4144 (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (QUOTE (-23))) (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (QUOTE (-133))) (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (QUOTE (-381))) (|HasCategory| |#3| (QUOTE (-748))) (|HasCategory| |#3| (QUOTE (-817))) (|HasCategory| |#3| (QUOTE (-872))) (|HasCategory| |#3| (QUOTE (-1081))) (|HasCategory| |#3| (QUOTE (-1133)))) (-4144 (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (QUOTE (-23))) (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (QUOTE (-133))) (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (QUOTE (-1081)))) (-4144 (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (QUOTE (-23))) (|HasCategory| |#3| (QUOTE (-133))) (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (QUOTE (-1081)))) (-4144 (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (QUOTE (-133))) (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (QUOTE (-1081)))) (-4144 (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (QUOTE (-1081)))) (-4144 (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (QUOTE (-1081)))) (|HasCategory| |#3| (QUOTE (-240))) (-4144 (|HasCategory| |#3| (QUOTE (-240))) (-12 (|HasCategory| |#3| (QUOTE (-239))) (|HasCategory| |#3| (QUOTE (-1081))))) (-4144 (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209)))) (-12 (|HasCategory| |#3| (QUOTE (-1081))) (|HasCategory| |#3| (|%list| (QUOTE -930) (QUOTE (-1209)))))) (|HasCategory| |#3| (QUOTE (-1133))) (-4144 (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209))))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-21)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-23)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-25)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-133)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-175)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-240)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-376)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-381)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-748)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-817)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-872)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-1081)))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-1133))))) (-4144 (-12 (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-23))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-133))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-381))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-748))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-817))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-872))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-1081))) (-12 (|HasCategory| |#3| (QUOTE (-1133))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560)))))) (-4144 (-12 (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-21))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-23))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-133))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-376))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-381))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-748))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-817))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-872))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-1081))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (QUOTE (-1133))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560)))))) (|HasCategory| (-560) (QUOTE (-872))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#3| (QUOTE (-1081)))) (-12 (|HasCategory| |#3| (QUOTE (-239))) (|HasCategory| |#3| (QUOTE (-1081)))) (-12 (|HasCategory| |#3| (QUOTE (-1081))) (|HasCategory| |#3| (|%list| (QUOTE -930) (QUOTE (-1209))))) (-4144 (|HasCategory| |#3| (QUOTE (-1081))) (-12 (|HasCategory| |#3| (QUOTE (-1133))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560)))))) (-12 (|HasCategory| |#3| (QUOTE (-1133))) (|HasCategory| |#3| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#3| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#3| (QUOTE (-1133)))) (|HasAttribute| |#3| (QUOTE -4507)) (-12 (|HasCategory| |#3| (QUOTE (-240))) (|HasCategory| |#3| (QUOTE (-1081)))) (-12 (|HasCategory| |#3| (QUOTE (-1081))) (|HasCategory| |#3| (|%list| (QUOTE -928) (QUOTE (-1209))))) (|HasCategory| |#3| (QUOTE (-175))) (|HasCategory| |#3| (QUOTE (-23))) (|HasCategory| |#3| (QUOTE (-133))) (|HasCategory| |#3| (QUOTE (-25))) (|HasCategory| |#3| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#3| (QUOTE (-102))) (-12 (|HasCategory| |#3| (QUOTE (-1133))) (|HasCategory| |#3| (|%list| (QUOTE -321) (|devaluate| |#3|))))) (-1146 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 c_{+}-c_{-} where c_{+} is the number of real roots of \\spad{p1} with \\spad{p2>0} and c_{-} is the number of real roots of \\spad{p1} with \\spad{p2<0}. If \\spad{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 c_{+}-c_{-} where c_{+} is the number of real roots of \\spad{p1} with \\spad{p2>0} and c_{-} is the number of real roots of \\spad{p1} with \\spad{p2<0}. If \\spad{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 @@ -4524,7 +4524,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 `s'.")) (|name| (((|Identifier|) $) "\\spad{name(s)} returns the name of the signature `s'.")) (|signatureAst| (($ (|Identifier|) (|Signature|)) "\\spad{signatureAst(n,s,t)} builds the signature AST n: \\spad{s} -> \\spad{t}"))) NIL NIL -(-1149 R -4131) +(-1149 R -4164) ((|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 @@ -4559,16 +4559,16 @@ NIL (-1157 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."))) (((-4512 "*") |has| |#1| (-175)) (-4503 |has| |#1| (-571)) (-4508 |has| |#1| (-6 -4508)) (-4505 . T) (-4504 . T) (-4507 . T)) -((|HasCategory| |#1| (QUOTE (-940))) (-4133 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-940)))) (-4133 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-940)))) (-4133 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-940)))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-175))) (-4133 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| |#2| (|%list| (QUOTE -912) (QUOTE (-391))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| |#2| (|%list| (QUOTE -912) (QUOTE (-560))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| |#2| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#2| (|%list| (QUOTE -633) (QUOTE (-549))))) (|HasCategory| |#1| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560)))) (-4133 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560)))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-376))) (|HasAttribute| |#1| (QUOTE -4508)) (|HasCategory| |#1| (QUOTE (-466))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-940)))) (-4133 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-940)))) (|HasCategory| |#1| (QUOTE (-147))))) +((|HasCategory| |#1| (QUOTE (-940))) (-4144 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-940)))) (-4144 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-940)))) (-4144 (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-940)))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-175))) (-4144 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| |#2| (|%list| (QUOTE -912) (QUOTE (-391))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| |#2| (|%list| (QUOTE -912) (QUOTE (-560))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| |#2| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560)))))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#2| (|%list| (QUOTE -633) (QUOTE (-549))))) (|HasCategory| |#1| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560)))) (-4144 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560)))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-376))) (|HasAttribute| |#1| (QUOTE -4508)) (|HasCategory| |#1| (QUOTE (-466))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-940)))) (-4144 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-940)))) (|HasCategory| |#1| (QUOTE (-147))))) (-1158 |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 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 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}."))) (((-4512 "*") |has| |#1| (-175)) (-4503 |has| |#1| (-571)) (-4505 . T) (-4504 . T) (-4507 . T)) -((|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-147))) (-4133 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571)))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-376)))) +((|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-147))) (-4144 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571)))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-376)))) (-1159 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}"))) ((-4511 . T) (-4510 . T)) NIL -(-1160 UP -4131) +(-1160 UP -4164) ((|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 @@ -4623,11 +4623,11 @@ NIL (-1173 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,{}ls,{}sub?)} returns \\axiom{a} where the children list of \\axiom{\\spad{l}} has been set to \\axiom{[[\\spad{s}]\\$\\% for \\spad{s} in 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,{}ls)} returns \\axiom{a} where the children list of \\axiom{\\spad{l}} has been set to \\axiom{[[\\spad{s}]\\$\\% for \\spad{s} in 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{ls} is the leaves list of \\axiom{a} returns \\axiom{[[value(\\spad{s}),{}condition(\\spad{s})]\\$VT for \\spad{s} in 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},{}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 ls]}.") (($ |#1| |#2| (|List| (|SplittingNode| |#1| |#2|))) "\\axiom{construct(\\spad{v},{}\\spad{t},{}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 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."))) ((-4510 . T) (-4511 . T)) -((-12 (|HasCategory| (-1172 |#1| |#2|) (|%list| (QUOTE -321) (|%list| (QUOTE -1172) (|devaluate| |#1|) (|devaluate| |#2|)))) (|HasCategory| (-1172 |#1| |#2|) (QUOTE (-1133)))) (|HasCategory| (-1172 |#1| |#2|) (QUOTE (-1133))) (-4133 (|HasCategory| (-1172 |#1| |#2|) (QUOTE (-102))) (|HasCategory| (-1172 |#1| |#2|) (QUOTE (-1133)))) (-4133 (|HasCategory| (-1172 |#1| |#2|) (|%list| (QUOTE -632) (QUOTE (-888)))) (-12 (|HasCategory| (-1172 |#1| |#2|) (|%list| (QUOTE -321) (|%list| (QUOTE -1172) (|devaluate| |#1|) (|devaluate| |#2|)))) (|HasCategory| (-1172 |#1| |#2|) (QUOTE (-1133))))) (|HasCategory| (-1172 |#1| |#2|) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-1172 |#1| |#2|) (QUOTE (-102)))) +((-12 (|HasCategory| (-1172 |#1| |#2|) (|%list| (QUOTE -321) (|%list| (QUOTE -1172) (|devaluate| |#1|) (|devaluate| |#2|)))) (|HasCategory| (-1172 |#1| |#2|) (QUOTE (-1133)))) (|HasCategory| (-1172 |#1| |#2|) (QUOTE (-1133))) (-4144 (|HasCategory| (-1172 |#1| |#2|) (QUOTE (-102))) (|HasCategory| (-1172 |#1| |#2|) (QUOTE (-1133)))) (-4144 (|HasCategory| (-1172 |#1| |#2|) (|%list| (QUOTE -632) (QUOTE (-888)))) (-12 (|HasCategory| (-1172 |#1| |#2|) (|%list| (QUOTE -321) (|%list| (QUOTE -1172) (|devaluate| |#1|) (|devaluate| |#2|)))) (|HasCategory| (-1172 |#1| |#2|) (QUOTE (-1133))))) (|HasCategory| (-1172 |#1| |#2|) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-1172 |#1| |#2|) (QUOTE (-102)))) (-1174 |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}."))) ((-4507 . T) (-4499 |has| |#2| (-6 (-4512 "*"))) (-4510 . T) (-4504 . T) (-4505 . T)) -((|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-239))) (|HasAttribute| |#2| (QUOTE (-4512 "*"))) (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560)))) (-4133 (-12 (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))))) (|HasCategory| |#2| (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#2| (QUOTE (-319))) (|HasCategory| |#2| (QUOTE (-571))) (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (QUOTE (-376))) (-4133 (|HasAttribute| |#2| (QUOTE (-4512 "*"))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-240)))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#2| (QUOTE (-102))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (|HasCategory| |#2| (QUOTE (-175)))) +((|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (QUOTE (-239))) (|HasAttribute| |#2| (QUOTE (-4512 "*"))) (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560)))) (-4144 (-12 (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-240))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))))) (|HasCategory| |#2| (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#2| (QUOTE (-319))) (|HasCategory| |#2| (QUOTE (-571))) (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (QUOTE (-376))) (-4144 (|HasAttribute| |#2| (QUOTE (-4512 "*"))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-240)))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#2| (QUOTE (-102))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (|HasCategory| |#2| (QUOTE (-175)))) (-1175 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{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{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\",{}\"*\")} 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}) == 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}) == 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 @@ -4651,19 +4651,19 @@ NIL (-1180 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}."))) ((-4510 . T) (-4511 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1133))) (-4133 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1133)))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102)))) +((-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1133))) (-4144 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1133)))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102)))) (-1181 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})}."))) +((|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}.")) (|size?| (((|Boolean|) $ (|NonNegativeInteger|)) "\\spad{size?(u,n)} tests if \\spad{u} has exactly \\spad{n} elements.")) (|more?| (((|Boolean|) $ (|NonNegativeInteger|)) "\\spad{more?(u,n)} tests if \\spad{u} has greater than \\spad{n} elements.")) (|less?| (((|Boolean|) $ (|NonNegativeInteger|)) "\\spad{less?(u,n)} tests if \\spad{u} has less than \\spad{n} elements.")) (|possiblyInfinite?| (((|Boolean|) $) "\\spad{possiblyInfinite?(s)} tests if the stream \\spad{s} could possibly have an infinite number of elements. Note: for many datatypes,{} \\axiom{possiblyInfinite?(\\spad{s}) = not explictlyFinite?(\\spad{s})}.")) (|explicitlyFinite?| (((|Boolean|) $) "\\spad{explicitlyFinite?(s)} tests if the stream has a finite number of elements,{} and \\spad{false} otherwise. Note: for many datatypes,{} \\axiom{explicitlyFinite?(\\spad{s}) = not possiblyInfinite?(\\spad{s})}."))) NIL NIL (-1182 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})}."))) +((|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}.")) (|size?| (((|Boolean|) $ (|NonNegativeInteger|)) "\\spad{size?(u,n)} tests if \\spad{u} has exactly \\spad{n} elements.")) (|more?| (((|Boolean|) $ (|NonNegativeInteger|)) "\\spad{more?(u,n)} tests if \\spad{u} has greater than \\spad{n} elements.")) (|less?| (((|Boolean|) $ (|NonNegativeInteger|)) "\\spad{less?(u,n)} tests if \\spad{u} has less than \\spad{n} elements.")) (|possiblyInfinite?| (((|Boolean|) $) "\\spad{possiblyInfinite?(s)} tests if the stream \\spad{s} could possibly have an infinite number of elements. Note: for many datatypes,{} \\axiom{possiblyInfinite?(\\spad{s}) = not explictlyFinite?(\\spad{s})}.")) (|explicitlyFinite?| (((|Boolean|) $) "\\spad{explicitlyFinite?(s)} tests if the stream has a finite number of elements,{} and \\spad{false} otherwise. Note: for many datatypes,{} \\axiom{explicitlyFinite?(\\spad{s}) = not possiblyInfinite?(\\spad{s})}."))) NIL NIL (-1183 |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."))) ((-4511 . T)) -((-12 (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-1133))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -1580) (|devaluate| |#1|)) (|%list| (QUOTE |:|) (QUOTE -3432) (|devaluate| |#2|)))))) (-4133 (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-1133))) (|HasCategory| |#2| (QUOTE (-1133)))) (-4133 (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-1133))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-1133)))) (-4133 (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-1133))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (|%list| (QUOTE -633) (QUOTE (-549)))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (|HasCategory| |#1| (QUOTE (-872))) (-4133 (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-102)))) (-4133 (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-1133)))) +((-12 (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-1133))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -2118) (|devaluate| |#1|)) (|%list| (QUOTE |:|) (QUOTE -3964) (|devaluate| |#2|)))))) (-4144 (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-1133))) (|HasCategory| |#2| (QUOTE (-1133)))) (-4144 (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-1133))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-1133)))) (-4144 (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-1133))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (|%list| (QUOTE -633) (QUOTE (-549)))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (|HasCategory| |#1| (QUOTE (-872))) (-4144 (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-102)))) (-4144 (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-1133)))) (-1184) ((|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}'s are never \\spad{nothing}.}")) (|nextItem| (((|Maybe| $) $) "\\spad{nextItem(x)} returns the next item,{} or \\spad{failed} if domain is exhausted.")) (|init| (($) "\\spad{init()} chooses an initial object for stepping."))) NIL @@ -4679,7 +4679,7 @@ NIL (-1187 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."))) ((-4511 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1133))) (-4133 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1133)))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| (-560) (QUOTE (-872))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102)))) +((-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1133))) (-4144 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1133)))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| (-560) (QUOTE (-872))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102)))) (-1188 S) ((|constructor| (NIL "Functions defined on streams with entries in one set.")) (|concat| (((|Stream| |#1|) (|Stream| (|Stream| |#1|))) "\\spad{concat(u)} returns the left-to-right concatentation of the streams in \\spad{u}. Note: \\spad{concat(u) = reduce(concat,u)}."))) NIL @@ -4695,11 +4695,11 @@ NIL (-1191) ((|string| (($ (|DoubleFloat|)) "\\spad{string f} returns the decimal representation of \\spad{f} in a string") (($ (|Integer|)) "\\spad{string i} returns the decimal representation of \\spad{i} in a string"))) ((-4511 . T) (-4510 . T)) -((-4133 (-12 (|HasCategory| (-146) (QUOTE (-872))) (|HasCategory| (-146) (|%list| (QUOTE -321) (QUOTE (-146))))) (-12 (|HasCategory| (-146) (QUOTE (-1133))) (|HasCategory| (-146) (|%list| (QUOTE -321) (QUOTE (-146)))))) (-4133 (|HasCategory| (-146) (|%list| (QUOTE -632) (QUOTE (-888)))) (-12 (|HasCategory| (-146) (QUOTE (-1133))) (|HasCategory| (-146) (|%list| (QUOTE -321) (QUOTE (-146)))))) (|HasCategory| (-146) (|%list| (QUOTE -633) (QUOTE (-549)))) (-4133 (|HasCategory| (-146) (QUOTE (-872))) (|HasCategory| (-146) (QUOTE (-1133)))) (|HasCategory| (-146) (QUOTE (-872))) (-4133 (|HasCategory| (-146) (QUOTE (-102))) (|HasCategory| (-146) (QUOTE (-872))) (|HasCategory| (-146) (QUOTE (-1133)))) (|HasCategory| (-560) (QUOTE (-872))) (|HasCategory| (-146) (QUOTE (-1133))) (|HasCategory| (-146) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-146) (QUOTE (-102))) (-12 (|HasCategory| (-146) (QUOTE (-1133))) (|HasCategory| (-146) (|%list| (QUOTE -321) (QUOTE (-146)))))) +((-4144 (-12 (|HasCategory| (-146) (QUOTE (-872))) (|HasCategory| (-146) (|%list| (QUOTE -321) (QUOTE (-146))))) (-12 (|HasCategory| (-146) (QUOTE (-1133))) (|HasCategory| (-146) (|%list| (QUOTE -321) (QUOTE (-146)))))) (-4144 (|HasCategory| (-146) (|%list| (QUOTE -632) (QUOTE (-888)))) (-12 (|HasCategory| (-146) (QUOTE (-1133))) (|HasCategory| (-146) (|%list| (QUOTE -321) (QUOTE (-146)))))) (|HasCategory| (-146) (|%list| (QUOTE -633) (QUOTE (-549)))) (-4144 (|HasCategory| (-146) (QUOTE (-872))) (|HasCategory| (-146) (QUOTE (-1133)))) (|HasCategory| (-146) (QUOTE (-872))) (-4144 (|HasCategory| (-146) (QUOTE (-102))) (|HasCategory| (-146) (QUOTE (-872))) (|HasCategory| (-146) (QUOTE (-1133)))) (|HasCategory| (-560) (QUOTE (-872))) (|HasCategory| (-146) (QUOTE (-1133))) (|HasCategory| (-146) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-146) (QUOTE (-102))) (-12 (|HasCategory| (-146) (QUOTE (-1133))) (|HasCategory| (-146) (|%list| (QUOTE -321) (QUOTE (-146)))))) (-1192 |Entry|) ((|constructor| (NIL "This domain provides tables where the keys are strings. A specialized hash function for strings is used."))) ((-4510 . T) (-4511 . T)) -((-12 (|HasCategory| (-2 (|:| -1580 (-1191)) (|:| -3432 |#1|)) (QUOTE (-1133))) (|HasCategory| (-2 (|:| -1580 (-1191)) (|:| -3432 |#1|)) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -1580) (QUOTE (-1191))) (|%list| (QUOTE |:|) (QUOTE -3432) (|devaluate| |#1|)))))) (-4133 (|HasCategory| (-2 (|:| -1580 (-1191)) (|:| -3432 |#1|)) (QUOTE (-1133))) (|HasCategory| |#1| (QUOTE (-1133)))) (-4133 (|HasCategory| (-2 (|:| -1580 (-1191)) (|:| -3432 |#1|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -1580 (-1191)) (|:| -3432 |#1|)) (QUOTE (-1133))) (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1133)))) (-4133 (|HasCategory| (-2 (|:| -1580 (-1191)) (|:| -3432 |#1|)) (QUOTE (-1133))) (|HasCategory| (-2 (|:| -1580 (-1191)) (|:| -3432 |#1|)) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| (-2 (|:| -1580 (-1191)) (|:| -3432 |#1|)) (|%list| (QUOTE -633) (QUOTE (-549)))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| (-2 (|:| -1580 (-1191)) (|:| -3432 |#1|)) (QUOTE (-1133))) (|HasCategory| (-1191) (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133))) (-4133 (|HasCategory| (-2 (|:| -1580 (-1191)) (|:| -3432 |#1|)) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (-4133 (|HasCategory| (-2 (|:| -1580 (-1191)) (|:| -3432 |#1|)) (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-102)))) (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-2 (|:| -1580 (-1191)) (|:| -3432 |#1|)) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-2 (|:| -1580 (-1191)) (|:| -3432 |#1|)) (QUOTE (-102)))) +((-12 (|HasCategory| (-2 (|:| -2118 (-1191)) (|:| -3964 |#1|)) (QUOTE (-1133))) (|HasCategory| (-2 (|:| -2118 (-1191)) (|:| -3964 |#1|)) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -2118) (QUOTE (-1191))) (|%list| (QUOTE |:|) (QUOTE -3964) (|devaluate| |#1|)))))) (-4144 (|HasCategory| (-2 (|:| -2118 (-1191)) (|:| -3964 |#1|)) (QUOTE (-1133))) (|HasCategory| |#1| (QUOTE (-1133)))) (-4144 (|HasCategory| (-2 (|:| -2118 (-1191)) (|:| -3964 |#1|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -2118 (-1191)) (|:| -3964 |#1|)) (QUOTE (-1133))) (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1133)))) (-4144 (|HasCategory| (-2 (|:| -2118 (-1191)) (|:| -3964 |#1|)) (QUOTE (-1133))) (|HasCategory| (-2 (|:| -2118 (-1191)) (|:| -3964 |#1|)) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| (-2 (|:| -2118 (-1191)) (|:| -3964 |#1|)) (|%list| (QUOTE -633) (QUOTE (-549)))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| (-2 (|:| -2118 (-1191)) (|:| -3964 |#1|)) (QUOTE (-1133))) (|HasCategory| (-1191) (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133))) (-4144 (|HasCategory| (-2 (|:| -2118 (-1191)) (|:| -3964 |#1|)) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (-4144 (|HasCategory| (-2 (|:| -2118 (-1191)) (|:| -3964 |#1|)) (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-102)))) (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-2 (|:| -2118 (-1191)) (|:| -3964 |#1|)) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-2 (|:| -2118 (-1191)) (|:| -3964 |#1|)) (QUOTE (-102)))) (-1193 A) ((|constructor| (NIL "StreamTaylorSeriesOperations implements Taylor series arithmetic,{} where a Taylor series is represented by a stream of its coefficients.")) (|power| (((|Stream| |#1|) |#1| (|Stream| |#1|)) "\\spad{power(a,f)} returns the power series \\spad{f} raised to the power \\spad{a}.")) (|lazyGintegrate| (((|Stream| |#1|) (|Mapping| |#1| (|Integer|)) |#1| (|Mapping| (|Stream| |#1|))) "\\spad{lazyGintegrate(f,r,g)} is used for fixed point computations.")) (|mapdiv| (((|Stream| |#1|) (|Stream| |#1|) (|Stream| |#1|)) "\\spad{mapdiv([a0,a1,..],[b0,b1,..])} returns \\spad{[a0/b0,a1/b1,..]}.")) (|powern| (((|Stream| |#1|) (|Fraction| (|Integer|)) (|Stream| |#1|)) "\\spad{powern(r,f)} raises power series \\spad{f} to the power \\spad{r}.")) (|nlde| (((|Stream| |#1|) (|Stream| (|Stream| |#1|))) "\\spad{nlde(u)} solves a first order non-linear differential equation described by \\spad{u} of the form \\spad{[[b<0,0>,b<0,1>,...],[b<1,0>,b<1,1>,.],...]}. the differential equation has the form \\spad{y' = sum(i=0 to infinity,j=0 to infinity,b<i,j>*(x**i)*(y**j))}.")) (|lazyIntegrate| (((|Stream| |#1|) |#1| (|Mapping| (|Stream| |#1|))) "\\spad{lazyIntegrate(r,f)} is a local function used for fixed point computations.")) (|integrate| (((|Stream| |#1|) |#1| (|Stream| |#1|)) "\\spad{integrate(r,a)} returns the integral of the power series \\spad{a} with respect to the power series variableintegration where \\spad{r} denotes the constant of integration. Thus \\spad{integrate(a,[a0,a1,a2,...]) = [a,a0,a1/2,a2/3,...]}.")) (|invmultisect| (((|Stream| |#1|) (|Integer|) (|Integer|) (|Stream| |#1|)) "\\spad{invmultisect(a,b,st)} substitutes \\spad{x**((a+b)*n)} for \\spad{x**n} and multiplies by \\spad{x**b}.")) (|multisect| (((|Stream| |#1|) (|Integer|) (|Integer|) (|Stream| |#1|)) "\\spad{multisect(a,b,st)} selects the coefficients of \\spad{x**((a+b)*n+a)},{} and changes them to \\spad{x**n}.")) (|generalLambert| (((|Stream| |#1|) (|Stream| |#1|) (|Integer|) (|Integer|)) "\\spad{generalLambert(f(x),a,d)} returns \\spad{f(x**a) + f(x**(a + d)) + f(x**(a + 2 d)) + ...}. \\spad{f(x)} should have zero constant coefficient and \\spad{a} and \\spad{d} should be positive.")) (|evenlambert| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{evenlambert(st)} computes \\spad{f(x**2) + f(x**4) + f(x**6) + ...} if \\spad{st} is a stream representing \\spad{f(x)}. This function is used for computing infinite products. If \\spad{f(x)} is a power series with constant coefficient 1,{} then \\spad{prod(f(x**(2*n)),n=1..infinity) = exp(evenlambert(log(f(x))))}.")) (|oddlambert| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{oddlambert(st)} computes \\spad{f(x) + f(x**3) + f(x**5) + ...} if \\spad{st} is a stream representing \\spad{f(x)}. This function is used for computing infinite products. If \\spad{f}(\\spad{x}) is a power series with constant coefficient 1 then \\spad{prod(f(x**(2*n-1)),n=1..infinity) = exp(oddlambert(log(f(x))))}.")) (|lambert| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{lambert(st)} computes \\spad{f(x) + f(x**2) + f(x**3) + ...} if \\spad{st} is a stream representing \\spad{f(x)}. This function is used for computing infinite products. If \\spad{f(x)} is a power series with constant coefficient 1 then \\spad{prod(f(x**n),n = 1..infinity) = exp(lambert(log(f(x))))}.")) (|addiag| (((|Stream| |#1|) (|Stream| (|Stream| |#1|))) "\\spad{addiag(x)} performs diagonal addition of a stream of streams. if \\spad{x} = \\spad{[[a<0,0>,a<0,1>,..],[a<1,0>,a<1,1>,..],[a<2,0>,a<2,1>,..],..]} and \\spad{addiag(x) = [b<0,b<1>,...], then b<k> = sum(i+j=k,a<i,j>)}.")) (|revert| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{revert(a)} computes the inverse of a power series \\spad{a} with respect to composition. the series should have constant coefficient 0 and first order coefficient should be invertible.")) (|lagrange| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{lagrange(g)} produces the power series for \\spad{f} where \\spad{f} is implicitly defined as \\spad{f(z) = z*g(f(z))}.")) (|compose| (((|Stream| |#1|) (|Stream| |#1|) (|Stream| |#1|)) "\\spad{compose(a,b)} composes the power series \\spad{a} with the power series \\spad{b}.")) (|eval| (((|Stream| |#1|) (|Stream| |#1|) |#1|) "\\spad{eval(a,r)} returns a stream of partial sums of the power series \\spad{a} evaluated at the power series variable equal to \\spad{r}.")) (|coerce| (((|Stream| |#1|) |#1|) "\\spad{coerce(r)} converts a ring element \\spad{r} to a stream with one element.")) (|gderiv| (((|Stream| |#1|) (|Mapping| |#1| (|Integer|)) (|Stream| |#1|)) "\\spad{gderiv(f,[a0,a1,a2,..])} returns \\spad{[f(0)*a0,f(1)*a1,f(2)*a2,..]}.")) (|deriv| (((|Stream| |#1|) (|Stream| |#1|)) "\\spad{deriv(a)} returns the derivative of the power series with respect to the power series variable. Thus \\spad{deriv([a0,a1,a2,...])} returns \\spad{[a1,2 a2,3 a3,...]}.")) (|mapmult| (((|Stream| |#1|) (|Stream| |#1|) (|Stream| |#1|)) "\\spad{mapmult([a0,a1,..],[b0,b1,..])} returns \\spad{[a0*b0,a1*b1,..]}.")) (|int| (((|Stream| |#1|) |#1|) "\\spad{int(r)} returns [\\spad{r},{}\\spad{r+1},{}\\spad{r+2},{}...],{} where \\spad{r} is a ring element.")) (|oddintegers| (((|Stream| (|Integer|)) (|Integer|)) "\\spad{oddintegers(n)} returns \\spad{[n,n+2,n+4,...]}.")) (|integers| (((|Stream| (|Integer|)) (|Integer|)) "\\spad{integers(n)} returns \\spad{[n,n+1,n+2,...]}.")) (|monom| (((|Stream| |#1|) |#1| (|Integer|)) "\\spad{monom(deg,coef)} is a monomial of degree \\spad{deg} with coefficient \\spad{coef}.")) (|recip| (((|Union| (|Stream| |#1|) "failed") (|Stream| |#1|)) "\\spad{recip(a)} returns the power series reciprocal of \\spad{a},{} or \"failed\" if not possible.")) (/ (((|Stream| |#1|) (|Stream| |#1|) (|Stream| |#1|)) "\\spad{a / b} returns the power series quotient of \\spad{a} by \\spad{b}. An error message is returned if \\spad{b} is not invertible. This function is used in fixed point computations.")) (|exquo| (((|Union| (|Stream| |#1|) "failed") (|Stream| |#1|) (|Stream| |#1|)) "\\spad{exquo(a,b)} returns the power series quotient of \\spad{a} by \\spad{b},{} if the quotient exists,{} and \"failed\" otherwise")) (* (((|Stream| |#1|) (|Stream| |#1|) |#1|) "\\spad{a * r} returns the power series scalar multiplication of \\spad{a} by 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 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 @@ -4730,9 +4730,9 @@ NIL NIL (-1200 |Coef| |var| |cen|) ((|constructor| (NIL "Sparse Laurent series in one variable \\indented{2}{\\spadtype{SparseUnivariateLaurentSeries} is a domain representing Laurent} \\indented{2}{series in one variable with coefficients in an arbitrary ring.\\space{2}The} \\indented{2}{parameters of the type specify the coefficient ring,{} the power series} \\indented{2}{variable,{} and the center of the power series expansion.\\space{2}For example,{}} \\indented{2}{\\spad{SparseUnivariateLaurentSeries(Integer,x,3)} represents Laurent} \\indented{2}{series in \\spad{(x - 3)} with integer coefficients.}")) (|integrate| (($ $ (|Variable| |#2|)) "\\spad{integrate(f(x))} returns an anti-derivative of the power series \\spad{f(x)} with constant coefficient 0. We may integrate a series when we can divide coefficients by integers.")) (|coerce| (($ (|Variable| |#2|)) "\\spad{coerce(var)} converts the series variable \\spad{var} into a Laurent series."))) -(((-4512 "*") -4133 (-2522 (|has| |#1| (-376)) (|has| (-1207 |#1| |#2| |#3|) (-844))) (|has| |#1| (-175)) (-2522 (|has| |#1| (-376)) (|has| (-1207 |#1| |#2| |#3|) (-940)))) (-4503 -4133 (-2522 (|has| |#1| (-376)) (|has| (-1207 |#1| |#2| |#3|) (-844))) (|has| |#1| (-571)) (-2522 (|has| |#1| (-376)) (|has| (-1207 |#1| |#2| |#3|) (-940)))) (-4508 |has| |#1| (-376)) (-4502 |has| |#1| (-376)) (-4504 . T) (-4505 . T) (-4507 . T)) -((-4133 (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-844))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-940))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-1052))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-1184))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -298) (|%list| (QUOTE -1207) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (|%list| (QUOTE -1207) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -321) (|%list| (QUOTE -1207) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -528) (QUOTE (-1209)) (|%list| (QUOTE -1207) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -1070) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560)))))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-175))) (-4133 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571)))) (-4133 (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-147)))) (-4133 (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-149)))) (-4133 (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-560)) (|devaluate| |#1|)))))) (-4133 (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-560)) (|devaluate| |#1|)))))) (-4133 (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-560)) (|devaluate| |#1|))))) (-4133 (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-239))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-560)) (|devaluate| |#1|))))) (|HasCategory| (-560) (QUOTE (-1144))) (-4133 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-571)))) (|HasCategory| |#1| (QUOTE (-376))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-940))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -1070) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-1052))) (|HasCategory| |#1| (QUOTE (-376)))) (-4133 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-571)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-844))) (|HasCategory| |#1| (QUOTE (-376)))) (-4133 (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-844))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-376))))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-1184))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -298) (|%list| (QUOTE -1207) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (|%list| (QUOTE -1207) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -321) (|%list| (QUOTE -1207) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -528) (QUOTE (-1209)) (|%list| (QUOTE -1207) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-560))))) (|HasSignature| |#1| (|%list| (QUOTE -4080) (|%list| (|devaluate| |#1|) (QUOTE (-1209)))))) (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-560))))) (-4133 (-12 (|HasCategory| |#1| (|%list| (QUOTE -29) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-990))) (|HasCategory| |#1| (QUOTE (-1235)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasSignature| |#1| (|%list| (QUOTE -3538) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1209))))) (|HasSignature| |#1| (|%list| (QUOTE -2985) (|%list| (|%list| (QUOTE -663) (QUOTE (-1209))) (|devaluate| |#1|)))))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-940))) (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-147))) (-4133 (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-844))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-940))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-571)))) (-4133 (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560)))))) (-4133 (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-844))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-940))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-175)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-239))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-940))) (|HasCategory| |#1| (QUOTE (-376)))) (-4133 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-940))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-147))))) -(-1201 R -4131) +(((-4512 "*") -4144 (-2609 (|has| |#1| (-376)) (|has| (-1207 |#1| |#2| |#3|) (-844))) (|has| |#1| (-175)) (-2609 (|has| |#1| (-376)) (|has| (-1207 |#1| |#2| |#3|) (-940)))) (-4503 -4144 (-2609 (|has| |#1| (-376)) (|has| (-1207 |#1| |#2| |#3|) (-844))) (|has| |#1| (-571)) (-2609 (|has| |#1| (-376)) (|has| (-1207 |#1| |#2| |#3|) (-940)))) (-4508 |has| |#1| (-376)) (-4502 |has| |#1| (-376)) (-4504 . T) (-4505 . T) (-4507 . T)) +((-4144 (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-844))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-940))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-1052))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-1184))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -298) (|%list| (QUOTE -1207) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (|%list| (QUOTE -1207) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -321) (|%list| (QUOTE -1207) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -528) (QUOTE (-1209)) (|%list| (QUOTE -1207) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -1070) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560)))))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-175))) (-4144 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571)))) (-4144 (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-147)))) (-4144 (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-149)))) (-4144 (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-560)) (|devaluate| |#1|)))))) (-4144 (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-560)) (|devaluate| |#1|)))))) (-4144 (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-560)) (|devaluate| |#1|))))) (-4144 (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-239))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-560)) (|devaluate| |#1|))))) (|HasCategory| (-560) (QUOTE (-1144))) (-4144 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-571)))) (|HasCategory| |#1| (QUOTE (-376))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-940))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -1070) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-1052))) (|HasCategory| |#1| (QUOTE (-376)))) (-4144 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-571)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-844))) (|HasCategory| |#1| (QUOTE (-376)))) (-4144 (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-844))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-376))))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-1184))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -298) (|%list| (QUOTE -1207) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (|%list| (QUOTE -1207) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -321) (|%list| (QUOTE -1207) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -528) (QUOTE (-1209)) (|%list| (QUOTE -1207) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-560))))) (|HasSignature| |#1| (|%list| (QUOTE -3903) (|%list| (|devaluate| |#1|) (QUOTE (-1209)))))) (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-560))))) (-4144 (-12 (|HasCategory| |#1| (|%list| (QUOTE -29) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-990))) (|HasCategory| |#1| (QUOTE (-1235)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasSignature| |#1| (|%list| (QUOTE -2884) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1209))))) (|HasSignature| |#1| (|%list| (QUOTE -3648) (|%list| (|%list| (QUOTE -663) (QUOTE (-1209))) (|devaluate| |#1|)))))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-940))) (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-147))) (-4144 (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-844))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-940))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-571)))) (-4144 (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560)))))) (-4144 (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-844))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-940))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-175)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-239))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-940))) (|HasCategory| |#1| (QUOTE (-376)))) (-4144 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-940))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1207 |#1| |#2| |#3|) (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-147))))) +(-1201 R -4164) ((|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}(\\spad{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 @@ -4743,7 +4743,7 @@ NIL (-1203 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."))) (((-4512 "*") |has| |#1| (-175)) (-4503 |has| |#1| (-571)) (-4506 |has| |#1| (-376)) (-4508 |has| |#1| (-6 -4508)) (-4505 . T) (-4504 . T) (-4507 . T)) -((|HasCategory| |#1| (QUOTE (-940))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-175))) (-4133 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571)))) (-12 (|HasCategory| (-1114) (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-391))))) (-12 (|HasCategory| (-1114) (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-560))))) (-12 (|HasCategory| (-1114) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391)))))) (-12 (|HasCategory| (-1114) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560)))))) (-12 (|HasCategory| (-1114) (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549))))) (|HasCategory| |#1| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560)))) (-4133 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560)))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (-4133 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-940)))) (-4133 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-940)))) (-4133 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-940)))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-1184))) (|HasCategory| |#1| (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (QUOTE (-240))) (|HasAttribute| |#1| (QUOTE -4508)) (|HasCategory| |#1| (QUOTE (-466))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-940)))) (-4133 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-940)))) (|HasCategory| |#1| (QUOTE (-147))))) +((|HasCategory| |#1| (QUOTE (-940))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-175))) (-4144 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571)))) (-12 (|HasCategory| (-1114) (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-391))))) (-12 (|HasCategory| (-1114) (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -912) (QUOTE (-560))))) (-12 (|HasCategory| (-1114) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391)))))) (-12 (|HasCategory| (-1114) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560)))))) (-12 (|HasCategory| (-1114) (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549))))) (|HasCategory| |#1| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560)))) (-4144 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560)))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (-4144 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-940)))) (-4144 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-940)))) (-4144 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-466))) (|HasCategory| |#1| (QUOTE (-940)))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-1184))) (|HasCategory| |#1| (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-239))) (|HasCategory| |#1| (QUOTE (-240))) (|HasAttribute| |#1| (QUOTE -4508)) (|HasCategory| |#1| (QUOTE (-466))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-940)))) (-4144 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-940)))) (|HasCategory| |#1| (QUOTE (-147))))) (-1204 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| (((|SparseUnivariatePolynomial| |#2|) (|Mapping| |#2| |#1|) (|SparseUnivariatePolynomial| |#1|)) "\\spad{map(func, poly)} creates a new polynomial by applying \\spad{func} to every non-zero coefficient of the polynomial poly."))) NIL @@ -4755,11 +4755,11 @@ NIL (-1206 |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."))) (((-4512 "*") |has| |#1| (-175)) (-4503 |has| |#1| (-571)) (-4508 |has| |#1| (-376)) (-4502 |has| |#1| (-376)) (-4504 . T) (-4505 . T) (-4507 . T)) -((|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-175))) (-4133 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (|%list| (QUOTE -421) (QUOTE (-560))) (|devaluate| |#1|))))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (|%list| (QUOTE -421) (QUOTE (-560))) (|devaluate| |#1|)))) (|HasCategory| (-421 (-560)) (QUOTE (-1144))) (|HasCategory| |#1| (QUOTE (-376))) (-4133 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-571)))) (-4133 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-571)))) (-12 (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (|%list| (QUOTE -421) (QUOTE (-560)))))) (|HasSignature| |#1| (|%list| (QUOTE -4080) (|%list| (|devaluate| |#1|) (QUOTE (-1209)))))) (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (|%list| (QUOTE -421) (QUOTE (-560)))))) (-4133 (-12 (|HasCategory| |#1| (|%list| (QUOTE -29) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-990))) (|HasCategory| |#1| (QUOTE (-1235)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasSignature| |#1| (|%list| (QUOTE -3538) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1209))))) (|HasSignature| |#1| (|%list| (QUOTE -2985) (|%list| (|%list| (QUOTE -663) (QUOTE (-1209))) (|devaluate| |#1|))))))) +((|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-175))) (-4144 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (|%list| (QUOTE -421) (QUOTE (-560))) (|devaluate| |#1|))))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (|%list| (QUOTE -421) (QUOTE (-560))) (|devaluate| |#1|)))) (|HasCategory| (-421 (-560)) (QUOTE (-1144))) (|HasCategory| |#1| (QUOTE (-376))) (-4144 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-571)))) (-4144 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-571)))) (-12 (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (|%list| (QUOTE -421) (QUOTE (-560)))))) (|HasSignature| |#1| (|%list| (QUOTE -3903) (|%list| (|devaluate| |#1|) (QUOTE (-1209)))))) (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (|%list| (QUOTE -421) (QUOTE (-560)))))) (-4144 (-12 (|HasCategory| |#1| (|%list| (QUOTE -29) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-990))) (|HasCategory| |#1| (QUOTE (-1235)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasSignature| |#1| (|%list| (QUOTE -2884) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1209))))) (|HasSignature| |#1| (|%list| (QUOTE -3648) (|%list| (|%list| (QUOTE -663) (QUOTE (-1209))) (|devaluate| |#1|))))))) (-1207 |Coef| |var| |cen|) ((|constructor| (NIL "Sparse Taylor series in one variable \\indented{2}{\\spadtype{SparseUnivariateTaylorSeries} is a domain representing Taylor} \\indented{2}{series in one variable with coefficients in an arbitrary ring.\\space{2}The} \\indented{2}{parameters of the type specify the coefficient ring,{} the power series} \\indented{2}{variable,{} and the center of the power series expansion.\\space{2}For example,{}} \\indented{2}{\\spadtype{SparseUnivariateTaylorSeries}(Integer,{}\\spad{x},{}3) represents Taylor} \\indented{2}{series in \\spad{(x - 3)} with \\spadtype{Integer} coefficients.}")) (|integrate| (($ $ (|Variable| |#2|)) "\\spad{integrate(f(x),x)} returns an anti-derivative of the power series \\spad{f(x)} with constant coefficient 0. We may integrate a series when we can divide coefficients by integers.")) (|univariatePolynomial| (((|UnivariatePolynomial| |#2| |#1|) $ (|NonNegativeInteger|)) "\\spad{univariatePolynomial(f,k)} returns a univariate polynomial \\indented{1}{consisting of the sum of all terms of \\spad{f} of degree \\spad{<= k}.}")) (|coerce| (($ (|Variable| |#2|)) "\\spad{coerce(var)} converts the series variable \\spad{var} into a \\indented{1}{Taylor series.}") (($ (|UnivariatePolynomial| |#2| |#1|)) "\\spad{coerce(p)} converts a univariate polynomial \\spad{p} in the variable \\spad{var} to a univariate Taylor series in \\spad{var}."))) (((-4512 "*") |has| |#1| (-175)) (-4503 |has| |#1| (-571)) (-4504 . T) (-4505 . T) (-4507 . T)) -((|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-571))) (-4133 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571)))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-793)) (|devaluate| |#1|))))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-793)) (|devaluate| |#1|)))) (|HasCategory| (-793) (QUOTE (-1144))) (-12 (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-793))))) (|HasSignature| |#1| (|%list| (QUOTE -4080) (|%list| (|devaluate| |#1|) (QUOTE (-1209)))))) (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-793))))) (|HasCategory| |#1| (QUOTE (-376))) (-4133 (-12 (|HasCategory| |#1| (|%list| (QUOTE -29) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-990))) (|HasCategory| |#1| (QUOTE (-1235)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasSignature| |#1| (|%list| (QUOTE -3538) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1209))))) (|HasSignature| |#1| (|%list| (QUOTE -2985) (|%list| (|%list| (QUOTE -663) (QUOTE (-1209))) (|devaluate| |#1|))))))) +((|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-571))) (-4144 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571)))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-793)) (|devaluate| |#1|))))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-793)) (|devaluate| |#1|)))) (|HasCategory| (-793) (QUOTE (-1144))) (-12 (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-793))))) (|HasSignature| |#1| (|%list| (QUOTE -3903) (|%list| (|devaluate| |#1|) (QUOTE (-1209)))))) (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-793))))) (|HasCategory| |#1| (QUOTE (-376))) (-4144 (-12 (|HasCategory| |#1| (|%list| (QUOTE -29) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-990))) (|HasCategory| |#1| (QUOTE (-1235)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasSignature| |#1| (|%list| (QUOTE -2884) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1209))))) (|HasSignature| |#1| (|%list| (QUOTE -3648) (|%list| (|%list| (QUOTE -663) (QUOTE (-1209))) (|devaluate| |#1|))))))) (-1208) ((|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 @@ -4775,7 +4775,7 @@ NIL (-1211 R) ((|constructor| (NIL "This domain implements symmetric polynomial"))) (((-4512 "*") |has| |#1| (-175)) (-4503 |has| |#1| (-571)) (-4508 |has| |#1| (-6 -4508)) (-4504 . T) (-4505 . T) (-4507 . T)) -((|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-571))) (-4133 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571)))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-4133 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560)))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-466))) (-12 (|HasCategory| (-1003) (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-571)))) (|HasAttribute| |#1| (QUOTE -4508))) +((|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-571))) (-4144 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571)))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-4144 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560)))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-466))) (-12 (|HasCategory| (-1003) (QUOTE (-133))) (|HasCategory| |#1| (QUOTE (-571)))) (|HasAttribute| |#1| (QUOTE -4508))) (-1212) ((|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 @@ -4815,7 +4815,7 @@ NIL (-1221 |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}"))) ((-4510 . T) (-4511 . T)) -((-12 (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-1133))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -1580) (|devaluate| |#1|)) (|%list| (QUOTE |:|) (QUOTE -3432) (|devaluate| |#2|)))))) (-4133 (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-1133))) (|HasCategory| |#2| (QUOTE (-1133)))) (-4133 (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-1133))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-1133)))) (-4133 (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-1133))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (|%list| (QUOTE -633) (QUOTE (-549)))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-1133))) (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#2| (QUOTE (-1133))) (-4133 (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888))))) (-4133 (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-102)))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-2 (|:| -1580 |#1|) (|:| -3432 |#2|)) (QUOTE (-102)))) +((-12 (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-1133))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (|%list| (QUOTE -321) (|%list| (QUOTE -2) (|%list| (QUOTE |:|) (QUOTE -2118) (|devaluate| |#1|)) (|%list| (QUOTE |:|) (QUOTE -3964) (|devaluate| |#2|)))))) (-4144 (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-1133))) (|HasCategory| |#2| (QUOTE (-1133)))) (-4144 (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-102))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-1133))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-1133)))) (-4144 (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-1133))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (|%list| (QUOTE -633) (QUOTE (-549)))) (-12 (|HasCategory| |#2| (QUOTE (-1133))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-1133))) (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#2| (QUOTE (-1133))) (-4144 (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888))))) (-4144 (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-102))) (|HasCategory| |#2| (QUOTE (-102)))) (|HasCategory| |#2| (QUOTE (-102))) (|HasCategory| |#2| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| (-2 (|:| -2118 |#1|) (|:| -3964 |#2|)) (QUOTE (-102)))) (-1222 S) ((|constructor| (NIL "\\indented{1}{The tableau domain is for printing Young tableaux,{} and} coercions to and from List List \\spad{S} where \\spad{S} is a set.")) (|coerce| (((|OutputForm|) $) "\\spad{coerce(t)} converts a tableau \\spad{t} to an output form.")) (|listOfLists| (((|List| (|List| |#1|)) $) "\\spad{listOfLists t} converts a tableau \\spad{t} to a list of lists.")) (|tableau| (($ (|List| (|List| |#1|))) "\\spad{tableau(ll)} converts a list of lists \\spad{ll} to a tableau."))) NIL @@ -4875,7 +4875,7 @@ NIL (-1236 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}."))) ((-4511 . T) (-4510 . T)) -((-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1133))) (-4133 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1133)))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102)))) +((-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (QUOTE (-1133))) (-4144 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-1133)))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102)))) (-1237 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 @@ -4884,7 +4884,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 -(-1239 R -4131) +(-1239 R -4164) ((|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 @@ -4892,14 +4892,14 @@ 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 -(-1241 R -4131) +(-1241 R -4164) ((|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 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 f:\\begin{items} \\item 1. logs of products are expanded into sums of logs,{} \\item 2. trigonometric and hyperbolic trigonometric functions of sums are expanded into sums of products of trigonometric and hyperbolic trigonometric functions. \\item 3. formal powers of the form \\spad{(a/b)**c} are expanded into \\spad{a**c * b**(-c)}. \\end{items}"))) NIL ((-12 (|HasCategory| |#1| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -912) (|devaluate| |#1|))) (|HasCategory| |#2| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (|devaluate| |#1|)))) (|HasCategory| |#2| (|%list| (QUOTE -912) (|devaluate| |#1|))))) (-1242 |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}."))) (((-4512 "*") |has| |#1| (-175)) (-4503 |has| |#1| (-571)) (-4505 . T) (-4504 . T) (-4507 . T)) -((|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-147))) (-4133 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571)))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-376)))) +((|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-147))) (-4144 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571)))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-376)))) (-1243 S R E V P) ((|constructor| (NIL "The category of triangular sets of multivariate polynomials with coefficients in an integral domain. Let \\axiom{\\spad{R}} be an integral domain and \\axiom{\\spad{V}} a finite ordered set of variables,{} say \\axiom{\\spad{X1} < \\spad{X2} < ... < Xn}. A set \\axiom{\\spad{S}} of polynomials in \\axiom{\\spad{R}[\\spad{X1},{}\\spad{X2},{}...,{}Xn]} is triangular if no elements of \\axiom{\\spad{S}} lies in \\axiom{\\spad{R}},{} and if two distinct elements of \\axiom{\\spad{S}} have distinct main variables. Note that the empty set is a triangular set. A triangular set is not necessarily a (lexicographical) Groebner basis and the notion of reduction related to triangular sets is based on the recursive view of polynomials. We recall this notion here and refer to [1] for more details. A polynomial \\axiom{\\spad{P}} is reduced \\spad{w}.\\spad{r}.\\spad{t} a non-constant polynomial \\axiom{\\spad{Q}} if the degree of \\axiom{\\spad{P}} in the main variable of \\axiom{\\spad{Q}} is less than the main degree of \\axiom{\\spad{Q}}. A polynomial \\axiom{\\spad{P}} is reduced \\spad{w}.\\spad{r}.\\spad{t} a triangular set \\axiom{\\spad{T}} if it is reduced \\spad{w}.\\spad{r}.\\spad{t}. every polynomial of \\axiom{\\spad{T}}. \\newline References : \\indented{1}{[1] \\spad{P}. AUBRY,{} \\spad{D}. LAZARD and \\spad{M}. MORENO MAZA \"On the Theories} \\indented{5}{of Triangular Sets\" Journal of Symbol. Comp. (to appear)}")) (|coHeight| (((|NonNegativeInteger|) $) "\\axiom{coHeight(ts)} returns \\axiom{size()\\$\\spad{V}} minus \\axiom{\\#ts}.")) (|extend| (($ $ |#5|) "\\axiom{extend(ts,{}\\spad{p})} returns a triangular set which encodes the simple extension by \\axiom{\\spad{p}} of the extension of the base field defined by \\axiom{ts},{} according to the properties of triangular sets of the current category If the required properties do not hold an error is returned.")) (|extendIfCan| (((|Union| $ "failed") $ |#5|) "\\axiom{extendIfCan(ts,{}\\spad{p})} returns a triangular set which encodes the simple extension by \\axiom{\\spad{p}} of the extension of the base field defined by \\axiom{ts},{} according to the properties of triangular sets of the current domain. If the required properties do not hold then \"failed\" is returned. This operation encodes in some sense the properties of the triangular sets of the current category. Is is used to implement the \\axiom{construct} operation to guarantee that every triangular set build from a list of polynomials has the required properties.")) (|select| (((|Union| |#5| "failed") $ |#4|) "\\axiom{select(ts,{}\\spad{v})} returns the polynomial of \\axiom{ts} with \\axiom{\\spad{v}} as main variable,{} if any.")) (|algebraic?| (((|Boolean|) |#4| $) "\\axiom{algebraic?(\\spad{v},{}ts)} returns \\spad{true} iff \\axiom{\\spad{v}} is the main variable of some polynomial in \\axiom{ts}.")) (|algebraicVariables| (((|List| |#4|) $) "\\axiom{algebraicVariables(ts)} returns the decreasingly sorted list of the main variables of the polynomials of \\axiom{ts}.")) (|rest| (((|Union| $ "failed") $) "\\axiom{rest(ts)} returns the polynomials of \\axiom{ts} with smaller main variable than \\axiom{mvar(ts)} if \\axiom{ts} is not empty,{} otherwise returns \"failed\"")) (|last| (((|Union| |#5| "failed") $) "\\axiom{last(ts)} returns the polynomial of \\axiom{ts} with smallest main variable if \\axiom{ts} is not empty,{} otherwise returns \\axiom{\"failed\"}.")) (|first| (((|Union| |#5| "failed") $) "\\axiom{first(ts)} returns the polynomial of \\axiom{ts} with greatest main variable if \\axiom{ts} is not empty,{} otherwise returns \\axiom{\"failed\"}.")) (|zeroSetSplitIntoTriangularSystems| (((|List| (|Record| (|:| |close| $) (|:| |open| (|List| |#5|)))) (|List| |#5|)) "\\axiom{zeroSetSplitIntoTriangularSystems(lp)} returns a list of triangular systems \\axiom{[[\\spad{ts1},{}\\spad{qs1}],{}...,{}[tsn,{}qsn]]} such that the zero set of \\axiom{lp} is the union of the closures of the \\axiom{W_i} where \\axiom{W_i} consists of the zeros of \\axiom{ts} which do not cancel any polynomial in \\axiom{qsi}.")) (|zeroSetSplit| (((|List| $) (|List| |#5|)) "\\axiom{zeroSetSplit(lp)} returns a list \\axiom{lts} of triangular sets such that the zero set of \\axiom{lp} is the union of the closures of the regular zero sets of the members of \\axiom{lts}.")) (|reduceByQuasiMonic| ((|#5| |#5| $) "\\axiom{reduceByQuasiMonic(\\spad{p},{}ts)} returns the same as \\axiom{remainder(\\spad{p},{}collectQuasiMonic(ts)).polnum}.")) (|collectQuasiMonic| (($ $) "\\axiom{collectQuasiMonic(ts)} returns the subset of \\axiom{ts} consisting of the polynomials with initial in \\axiom{\\spad{R}}.")) (|removeZero| ((|#5| |#5| $) "\\axiom{removeZero(\\spad{p},{}ts)} returns \\axiom{0} if \\axiom{\\spad{p}} reduces to \\axiom{0} by pseudo-division \\spad{w}.\\spad{r}.\\spad{t} \\axiom{ts} otherwise returns a polynomial \\axiom{\\spad{q}} computed from \\axiom{\\spad{p}} by removing any coefficient in \\axiom{\\spad{p}} reducing to \\axiom{0}.")) (|initiallyReduce| ((|#5| |#5| $) "\\axiom{initiallyReduce(\\spad{p},{}ts)} returns a polynomial \\axiom{\\spad{r}} such that \\axiom{initiallyReduced?(\\spad{r},{}ts)} holds and there exists some product \\axiom{\\spad{h}} of \\axiom{initials(ts)} such that \\axiom{h*p - \\spad{r}} lies in the ideal generated by \\axiom{ts}.")) (|headReduce| ((|#5| |#5| $) "\\axiom{headReduce(\\spad{p},{}ts)} returns a polynomial \\axiom{\\spad{r}} such that \\axiom{headReduce?(\\spad{r},{}ts)} holds and there exists some product \\axiom{\\spad{h}} of \\axiom{initials(ts)} such that \\axiom{h*p - \\spad{r}} lies in the ideal generated by \\axiom{ts}.")) (|stronglyReduce| ((|#5| |#5| $) "\\axiom{stronglyReduce(\\spad{p},{}ts)} returns a polynomial \\axiom{\\spad{r}} such that \\axiom{stronglyReduced?(\\spad{r},{}ts)} holds and there exists some product \\axiom{\\spad{h}} of \\axiom{initials(ts)} such that \\axiom{h*p - \\spad{r}} lies in the ideal generated by \\axiom{ts}.")) (|rewriteSetWithReduction| (((|List| |#5|) (|List| |#5|) $ (|Mapping| |#5| |#5| |#5|) (|Mapping| (|Boolean|) |#5| |#5|)) "\\axiom{rewriteSetWithReduction(lp,{}ts,{}redOp,{}redOp?)} returns a list \\axiom{lq} of polynomials such that \\axiom{[reduce(\\spad{p},{}ts,{}redOp,{}redOp?) for \\spad{p} in lp]} and \\axiom{lp} have the same zeros inside the regular zero set of \\axiom{ts}. Moreover,{} for every polynomial \\axiom{\\spad{q}} in \\axiom{lq} and every polynomial \\axiom{\\spad{t}} in \\axiom{ts} \\axiom{redOp?(\\spad{q},{}\\spad{t})} holds and there exists a polynomial \\axiom{\\spad{p}} in the ideal generated by \\axiom{lp} and a product \\axiom{\\spad{h}} of \\axiom{initials(ts)} such that \\axiom{h*p - \\spad{r}} lies in the ideal generated by \\axiom{ts}. The operation \\axiom{redOp} must satisfy the following conditions. For every \\axiom{\\spad{p}} and \\axiom{\\spad{q}} we have \\axiom{redOp?(redOp(\\spad{p},{}\\spad{q}),{}\\spad{q})} and there exists an integer \\axiom{\\spad{e}} and a polynomial \\axiom{\\spad{f}} such that \\axiom{init(\\spad{q})^e*p = f*q + redOp(\\spad{p},{}\\spad{q})}.")) (|reduce| ((|#5| |#5| $ (|Mapping| |#5| |#5| |#5|) (|Mapping| (|Boolean|) |#5| |#5|)) "\\axiom{reduce(\\spad{p},{}ts,{}redOp,{}redOp?)} returns a polynomial \\axiom{\\spad{r}} such that \\axiom{redOp?(\\spad{r},{}\\spad{p})} holds for every \\axiom{\\spad{p}} of \\axiom{ts} and there exists some product \\axiom{\\spad{h}} of the initials of the members of \\axiom{ts} such that \\axiom{h*p - \\spad{r}} lies in the ideal generated by \\axiom{ts}. The operation \\axiom{redOp} must satisfy the following conditions. For every \\axiom{\\spad{p}} and \\axiom{\\spad{q}} we have \\axiom{redOp?(redOp(\\spad{p},{}\\spad{q}),{}\\spad{q})} and there exists an integer \\axiom{\\spad{e}} and a polynomial \\axiom{\\spad{f}} such that \\axiom{init(\\spad{q})^e*p = f*q + redOp(\\spad{p},{}\\spad{q})}.")) (|autoReduced?| (((|Boolean|) $ (|Mapping| (|Boolean|) |#5| (|List| |#5|))) "\\axiom{autoReduced?(ts,{}redOp?)} returns \\spad{true} iff every element of \\axiom{ts} is reduced \\spad{w}.\\spad{r}.\\spad{t} to every other in the sense of \\axiom{redOp?}")) (|initiallyReduced?| (((|Boolean|) $) "\\spad{initiallyReduced?(ts)} returns \\spad{true} iff for every element \\axiom{\\spad{p}} of \\axiom{\\spad{ts}} \\axiom{\\spad{p}} and all its iterated initials are reduced \\spad{w}.\\spad{r}.\\spad{t}. to the other elements of \\axiom{\\spad{ts}} with the same main variable.") (((|Boolean|) |#5| $) "\\axiom{initiallyReduced?(\\spad{p},{}ts)} returns \\spad{true} iff \\axiom{\\spad{p}} and all its iterated initials are reduced \\spad{w}.\\spad{r}.\\spad{t}. to the elements of \\axiom{ts} with the same main variable.")) (|headReduced?| (((|Boolean|) $) "\\spad{headReduced?(ts)} returns \\spad{true} iff the head of every element of \\axiom{\\spad{ts}} is reduced \\spad{w}.\\spad{r}.\\spad{t} to any other element of \\axiom{\\spad{ts}}.") (((|Boolean|) |#5| $) "\\axiom{headReduced?(\\spad{p},{}ts)} returns \\spad{true} iff the head of \\axiom{\\spad{p}} is reduced \\spad{w}.\\spad{r}.\\spad{t}. \\axiom{ts}.")) (|stronglyReduced?| (((|Boolean|) $) "\\axiom{stronglyReduced?(ts)} returns \\spad{true} iff every element of \\axiom{ts} is reduced \\spad{w}.\\spad{r}.\\spad{t} to any other element of \\axiom{ts}.") (((|Boolean|) |#5| $) "\\axiom{stronglyReduced?(\\spad{p},{}ts)} returns \\spad{true} iff \\axiom{\\spad{p}} is reduced \\spad{w}.\\spad{r}.\\spad{t}. \\axiom{ts}.")) (|reduced?| (((|Boolean|) |#5| $ (|Mapping| (|Boolean|) |#5| |#5|)) "\\axiom{reduced?(\\spad{p},{}ts,{}redOp?)} returns \\spad{true} iff \\axiom{\\spad{p}} is reduced \\spad{w}.\\spad{r}.\\spad{t}. in the sense of the operation \\axiom{redOp?},{} that is if for every \\axiom{\\spad{t}} in \\axiom{ts} \\axiom{redOp?(\\spad{p},{}\\spad{t})} holds.")) (|normalized?| (((|Boolean|) $) "\\axiom{normalized?(ts)} returns \\spad{true} iff for every axiom{\\spad{p}} in axiom{ts} we have \\axiom{normalized?(\\spad{p},{}us)} where \\axiom{us} is \\axiom{collectUnder(ts,{}mvar(\\spad{p}))}.") (((|Boolean|) |#5| $) "\\axiom{normalized?(\\spad{p},{}ts)} returns \\spad{true} iff \\axiom{\\spad{p}} and all its iterated initials have degree zero \\spad{w}.\\spad{r}.\\spad{t}. the main variables of the polynomials of \\axiom{ts}")) (|quasiComponent| (((|Record| (|:| |close| (|List| |#5|)) (|:| |open| (|List| |#5|))) $) "\\axiom{quasiComponent(ts)} returns \\axiom{[lp,{}lq]} where \\axiom{lp} is the list of the members of \\axiom{ts} and \\axiom{lq}is \\axiom{initials(ts)}.")) (|degree| (((|NonNegativeInteger|) $) "\\axiom{degree(ts)} returns the product of main degrees of the members of \\axiom{ts}.")) (|initials| (((|List| |#5|) $) "\\axiom{initials(ts)} returns the list of the non-constant initials of the members of \\axiom{ts}.")) (|basicSet| (((|Union| (|Record| (|:| |bas| $) (|:| |top| (|List| |#5|))) "failed") (|List| |#5|) (|Mapping| (|Boolean|) |#5|) (|Mapping| (|Boolean|) |#5| |#5|)) "\\axiom{basicSet(ps,{}pred?,{}redOp?)} returns the same as \\axiom{basicSet(qs,{}redOp?)} where \\axiom{qs} consists of the polynomials of \\axiom{ps} satisfying property \\axiom{pred?}.") (((|Union| (|Record| (|:| |bas| $) (|:| |top| (|List| |#5|))) "failed") (|List| |#5|) (|Mapping| (|Boolean|) |#5| |#5|)) "\\axiom{basicSet(ps,{}redOp?)} returns \\axiom{[bs,{}ts]} where \\axiom{concat(bs,{}ts)} is \\axiom{ps} and \\axiom{bs} is a basic set in Wu Wen Tsun sense of \\axiom{ps} \\spad{w}.\\spad{r}.\\spad{t} the reduction-test \\axiom{redOp?},{} if no non-zero constant polynomial lie in \\axiom{ps},{} otherwise \\axiom{\"failed\"} is returned.")) (|infRittWu?| (((|Boolean|) $ $) "\\axiom{infRittWu?(\\spad{ts1},{}\\spad{ts2})} returns \\spad{true} iff \\axiom{\\spad{ts2}} has higher rank than \\axiom{\\spad{ts1}} in Wu Wen Tsun sense."))) NIL @@ -4920,7 +4920,7 @@ NIL ((|constructor| (NIL "\\indented{1}{This domain is used to interface with the interpreter'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 (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) -(-1248 -4131) +(-1248 -4164) ((|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 @@ -4966,8 +4966,8 @@ NIL NIL (-1259 |Coef| |var| |cen|) ((|constructor| (NIL "Dense Laurent series in one variable \\indented{2}{\\spadtype{UnivariateLaurentSeries} is a domain representing Laurent} \\indented{2}{series in one variable with coefficients in an arbitrary ring.\\space{2}The} \\indented{2}{parameters of the type specify the coefficient ring,{} the power series} \\indented{2}{variable,{} and the center of the power series expansion.\\space{2}For example,{}} \\indented{2}{\\spad{UnivariateLaurentSeries(Integer,x,3)} represents Laurent series in} \\indented{2}{\\spad{(x - 3)} with integer coefficients.}")) (|integrate| (($ $ (|Variable| |#2|)) "\\spad{integrate(f(x))} returns an anti-derivative of the power series \\spad{f(x)} with constant coefficient 0. We may integrate a series when we can divide coefficients by integers.")) (|coerce| (($ (|Variable| |#2|)) "\\spad{coerce(var)} converts the series variable \\spad{var} into a Laurent series."))) -(((-4512 "*") -4133 (-2522 (|has| |#1| (-376)) (|has| (-1289 |#1| |#2| |#3|) (-844))) (|has| |#1| (-175)) (-2522 (|has| |#1| (-376)) (|has| (-1289 |#1| |#2| |#3|) (-940)))) (-4503 -4133 (-2522 (|has| |#1| (-376)) (|has| (-1289 |#1| |#2| |#3|) (-844))) (|has| |#1| (-571)) (-2522 (|has| |#1| (-376)) (|has| (-1289 |#1| |#2| |#3|) (-940)))) (-4508 |has| |#1| (-376)) (-4502 |has| |#1| (-376)) (-4504 . T) (-4505 . T) (-4507 . T)) -((-4133 (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-844))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-940))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-1052))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-1184))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -298) (|%list| (QUOTE -1289) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (|%list| (QUOTE -1289) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -321) (|%list| (QUOTE -1289) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -528) (QUOTE (-1209)) (|%list| (QUOTE -1289) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -1070) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560)))))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-175))) (-4133 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571)))) (-4133 (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-147)))) (-4133 (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-149)))) (-4133 (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-560)) (|devaluate| |#1|)))))) (-4133 (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-560)) (|devaluate| |#1|)))))) (-4133 (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-560)) (|devaluate| |#1|))))) (-4133 (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-239))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-560)) (|devaluate| |#1|))))) (|HasCategory| (-560) (QUOTE (-1144))) (-4133 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-571)))) (|HasCategory| |#1| (QUOTE (-376))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-940))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -1070) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-1052))) (|HasCategory| |#1| (QUOTE (-376)))) (-4133 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-571)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-844))) (|HasCategory| |#1| (QUOTE (-376)))) (-4133 (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-844))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-376))))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-1184))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -298) (|%list| (QUOTE -1289) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (|%list| (QUOTE -1289) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -321) (|%list| (QUOTE -1289) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -528) (QUOTE (-1209)) (|%list| (QUOTE -1289) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-560))))) (|HasSignature| |#1| (|%list| (QUOTE -4080) (|%list| (|devaluate| |#1|) (QUOTE (-1209)))))) (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-560))))) (-4133 (-12 (|HasCategory| |#1| (|%list| (QUOTE -29) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-990))) (|HasCategory| |#1| (QUOTE (-1235)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasSignature| |#1| (|%list| (QUOTE -3538) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1209))))) (|HasSignature| |#1| (|%list| (QUOTE -2985) (|%list| (|%list| (QUOTE -663) (QUOTE (-1209))) (|devaluate| |#1|)))))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-940))) (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-147))) (-4133 (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-844))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-940))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-571)))) (-4133 (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560)))))) (-4133 (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-844))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-940))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-175)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-239))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-940))) (|HasCategory| |#1| (QUOTE (-376)))) (-4133 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-940))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-147))))) +(((-4512 "*") -4144 (-2609 (|has| |#1| (-376)) (|has| (-1289 |#1| |#2| |#3|) (-844))) (|has| |#1| (-175)) (-2609 (|has| |#1| (-376)) (|has| (-1289 |#1| |#2| |#3|) (-940)))) (-4503 -4144 (-2609 (|has| |#1| (-376)) (|has| (-1289 |#1| |#2| |#3|) (-844))) (|has| |#1| (-571)) (-2609 (|has| |#1| (-376)) (|has| (-1289 |#1| |#2| |#3|) (-940)))) (-4508 |has| |#1| (-376)) (-4502 |has| |#1| (-376)) (-4504 . T) (-4505 . T) (-4507 . T)) +((-4144 (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-844))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-940))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-1052))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-1184))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -298) (|%list| (QUOTE -1289) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (|%list| (QUOTE -1289) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -321) (|%list| (QUOTE -1289) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -528) (QUOTE (-1209)) (|%list| (QUOTE -1289) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -1070) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560)))))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-175))) (-4144 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571)))) (-4144 (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-147)))) (-4144 (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-149))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-149)))) (-4144 (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-560)) (|devaluate| |#1|)))))) (-4144 (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-560)) (|devaluate| |#1|)))))) (-4144 (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-560)) (|devaluate| |#1|))))) (-4144 (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-240))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-239))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-560)) (|devaluate| |#1|))))) (|HasCategory| (-560) (QUOTE (-1144))) (-4144 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-571)))) (|HasCategory| |#1| (QUOTE (-376))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-940))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -1070) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-1052))) (|HasCategory| |#1| (QUOTE (-376)))) (-4144 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-571)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-844))) (|HasCategory| |#1| (QUOTE (-376)))) (-4144 (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-844))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-376))))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-1184))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -298) (|%list| (QUOTE -1289) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)) (|%list| (QUOTE -1289) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -321) (|%list| (QUOTE -1289) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -528) (QUOTE (-1209)) (|%list| (QUOTE -1289) (|devaluate| |#1|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-560))))) (|HasSignature| |#1| (|%list| (QUOTE -3903) (|%list| (|devaluate| |#1|) (QUOTE (-1209)))))) (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-560))))) (-4144 (-12 (|HasCategory| |#1| (|%list| (QUOTE -29) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-990))) (|HasCategory| |#1| (QUOTE (-1235)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasSignature| |#1| (|%list| (QUOTE -2884) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1209))))) (|HasSignature| |#1| (|%list| (QUOTE -3648) (|%list| (|%list| (QUOTE -663) (QUOTE (-1209))) (|devaluate| |#1|)))))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-559))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-319))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-940))) (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-147))) (-4144 (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-844))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-940))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-571)))) (-4144 (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560)))))) (-4144 (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-844))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-940))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-175)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-239))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-940))) (|HasCategory| |#1| (QUOTE (-376)))) (-4144 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-940))) (|HasCategory| |#1| (QUOTE (-376)))) (-12 (|HasCategory| (-1289 |#1| |#2| |#3|) (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-376)))) (|HasCategory| |#1| (QUOTE (-147))))) (-1260 |Coef1| |Coef2| |var1| |var2| |cen1| |cen2|) ((|constructor| (NIL "Mapping package for univariate Laurent series \\indented{2}{This package allows one to apply a function to the coefficients of} \\indented{2}{a univariate Laurent series.}")) (|map| (((|UnivariateLaurentSeries| |#2| |#4| |#6|) (|Mapping| |#2| |#1|) (|UnivariateLaurentSeries| |#1| |#3| |#5|)) "\\spad{map(f,g(x))} applies the map \\spad{f} to the coefficients of the Laurent series \\spad{g(x)}."))) NIL @@ -4987,7 +4987,7 @@ NIL (-1264 |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)}."))) (((-4512 "*") |has| |#1| (-175)) (-4503 |has| |#1| (-571)) (-4508 |has| |#1| (-376)) (-4502 |has| |#1| (-376)) (-4504 . T) (-4505 . T) (-4507 . T)) -((-4133 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -298) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -528) (QUOTE (-1209)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-844)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-872)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-940)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1052)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1184)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -633) (QUOTE (-549))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-1209)))))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-175))) (-4133 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571)))) (-4133 (|HasCategory| |#1| (QUOTE (-147))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-147))))) (-4133 (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-149))))) (-4133 (-12 (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-560)) (|devaluate| |#1|))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))))) (-4133 (-12 (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-560)) (|devaluate| |#1|))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -930) (QUOTE (-1209)))))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-240)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-560)) (|devaluate| |#1|))))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-240)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-239)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-560)) (|devaluate| |#1|))))) (|HasCategory| (-560) (QUOTE (-1144))) (-4133 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-571)))) (|HasCategory| |#1| (QUOTE (-376))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-940)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-1209))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -633) (QUOTE (-549))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1052)))) (-4133 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-571)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-844)))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-844)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-872))))) (-4133 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -298) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -528) (QUOTE (-1209)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-844)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-872)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-940)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1052)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1184)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -633) (QUOTE (-549))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -912) (QUOTE (-391))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -912) (QUOTE (-560))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-1209)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1184)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -298) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -528) (QUOTE (-1209)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -912) (QUOTE (-560))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -912) (QUOTE (-391))))) (-12 (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-560))))) (|HasSignature| |#1| (|%list| (QUOTE -4080) (|%list| (|devaluate| |#1|) (QUOTE (-1209)))))) (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-560))))) (-4133 (-12 (|HasCategory| |#1| (|%list| (QUOTE -29) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-990))) (|HasCategory| |#1| (QUOTE (-1235)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasSignature| |#1| (|%list| (QUOTE -3538) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1209))))) (|HasSignature| |#1| (|%list| (QUOTE -2985) (|%list| (|%list| (QUOTE -663) (QUOTE (-1209))) (|devaluate| |#1|)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-872)))) (|HasCategory| |#2| (QUOTE (-940))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-559)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-319)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-147))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-239)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-560)) (|devaluate| |#1|))))) (-4133 (-12 (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-560)) (|devaluate| |#1|))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -930) (QUOTE (-1209)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -930) (QUOTE (-1209))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-239)))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-940)))) (-4133 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-940)))) (|HasCategory| |#1| (QUOTE (-147))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-147)))))) +((-4144 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -298) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -528) (QUOTE (-1209)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-844)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-872)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-940)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1052)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1184)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -633) (QUOTE (-549))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-1209)))))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-175))) (-4144 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571)))) (-4144 (|HasCategory| |#1| (QUOTE (-147))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-147))))) (-4144 (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-149))))) (-4144 (-12 (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-560)) (|devaluate| |#1|))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))))) (-4144 (-12 (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-560)) (|devaluate| |#1|))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -930) (QUOTE (-1209)))))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-240)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-560)) (|devaluate| |#1|))))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-240)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-239)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-560)) (|devaluate| |#1|))))) (|HasCategory| (-560) (QUOTE (-1144))) (-4144 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-571)))) (|HasCategory| |#1| (QUOTE (-376))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-940)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-1209))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -633) (QUOTE (-549))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1052)))) (-4144 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-571)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-844)))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-844)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-872))))) (-4144 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -298) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -528) (QUOTE (-1209)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-844)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-872)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-940)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1052)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1184)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -633) (QUOTE (-549))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -912) (QUOTE (-391))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -912) (QUOTE (-560))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-1209)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1184)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -298) (|devaluate| |#2|) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -321) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -528) (QUOTE (-1209)) (|devaluate| |#2|)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -912) (QUOTE (-560))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -912) (QUOTE (-391))))) (-12 (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-560))))) (|HasSignature| |#1| (|%list| (QUOTE -3903) (|%list| (|devaluate| |#1|) (QUOTE (-1209)))))) (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-560))))) (-4144 (-12 (|HasCategory| |#1| (|%list| (QUOTE -29) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-990))) (|HasCategory| |#1| (QUOTE (-1235)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasSignature| |#1| (|%list| (QUOTE -2884) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1209))))) (|HasSignature| |#1| (|%list| (QUOTE -3648) (|%list| (|%list| (QUOTE -663) (QUOTE (-1209))) (|devaluate| |#1|)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-872)))) (|HasCategory| |#2| (QUOTE (-940))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-559)))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-319)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-147))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-239)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-560)) (|devaluate| |#1|))))) (-4144 (-12 (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-560)) (|devaluate| |#1|))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -930) (QUOTE (-1209)))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (|%list| (QUOTE -930) (QUOTE (-1209))))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-239)))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-940)))) (-4144 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-940)))) (|HasCategory| |#1| (QUOTE (-147))) (-12 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-147)))))) (-1265 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 @@ -5003,7 +5003,7 @@ NIL (-1268 |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}"))) (((-4512 "*") |has| |#2| (-175)) (-4503 |has| |#2| (-571)) (-4506 |has| |#2| (-376)) (-4508 |has| |#2| (-6 -4508)) (-4505 . T) (-4504 . T) (-4507 . T)) -((|HasCategory| |#2| (QUOTE (-940))) (|HasCategory| |#2| (QUOTE (-571))) (|HasCategory| |#2| (QUOTE (-175))) (-4133 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-571)))) (-12 (|HasCategory| (-1114) (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| |#2| (|%list| (QUOTE -912) (QUOTE (-391))))) (-12 (|HasCategory| (-1114) (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| |#2| (|%list| (QUOTE -912) (QUOTE (-560))))) (-12 (|HasCategory| (-1114) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| |#2| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391)))))) (-12 (|HasCategory| (-1114) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560)))))) (-12 (|HasCategory| (-1114) (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#2| (|%list| (QUOTE -633) (QUOTE (-549))))) (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-149))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560)))) (-4133 (|HasCategory| |#2| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560)))))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (-4133 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-466))) (|HasCategory| |#2| (QUOTE (-571))) (|HasCategory| |#2| (QUOTE (-940)))) (-4133 (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-466))) (|HasCategory| |#2| (QUOTE (-571))) (|HasCategory| |#2| (QUOTE (-940)))) (-4133 (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-466))) (|HasCategory| |#2| (QUOTE (-940)))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1184))) (|HasCategory| |#2| (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-239))) (|HasCategory| |#2| (QUOTE (-240))) (|HasAttribute| |#2| (QUOTE -4508)) (|HasCategory| |#2| (QUOTE (-466))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-940)))) (-4133 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-940)))) (|HasCategory| |#2| (QUOTE (-147))))) +((|HasCategory| |#2| (QUOTE (-940))) (|HasCategory| |#2| (QUOTE (-571))) (|HasCategory| |#2| (QUOTE (-175))) (-4144 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-571)))) (-12 (|HasCategory| (-1114) (|%list| (QUOTE -912) (QUOTE (-391)))) (|HasCategory| |#2| (|%list| (QUOTE -912) (QUOTE (-391))))) (-12 (|HasCategory| (-1114) (|%list| (QUOTE -912) (QUOTE (-560)))) (|HasCategory| |#2| (|%list| (QUOTE -912) (QUOTE (-560))))) (-12 (|HasCategory| (-1114) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391))))) (|HasCategory| |#2| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-391)))))) (-12 (|HasCategory| (-1114) (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -633) (|%list| (QUOTE -916) (QUOTE (-560)))))) (-12 (|HasCategory| (-1114) (|%list| (QUOTE -633) (QUOTE (-549)))) (|HasCategory| |#2| (|%list| (QUOTE -633) (QUOTE (-549))))) (|HasCategory| |#2| (|%list| (QUOTE -660) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-149))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (QUOTE (-560)))) (-4144 (|HasCategory| |#2| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560)))))) (|HasCategory| |#2| (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (-4144 (|HasCategory| |#2| (QUOTE (-175))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-466))) (|HasCategory| |#2| (QUOTE (-571))) (|HasCategory| |#2| (QUOTE (-940)))) (-4144 (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-466))) (|HasCategory| |#2| (QUOTE (-571))) (|HasCategory| |#2| (QUOTE (-940)))) (-4144 (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-466))) (|HasCategory| |#2| (QUOTE (-940)))) (|HasCategory| |#2| (QUOTE (-376))) (|HasCategory| |#2| (QUOTE (-1184))) (|HasCategory| |#2| (|%list| (QUOTE -930) (QUOTE (-1209)))) (|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasCategory| |#2| (QUOTE (-239))) (|HasCategory| |#2| (QUOTE (-240))) (|HasAttribute| |#2| (QUOTE -4508)) (|HasCategory| |#2| (QUOTE (-466))) (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-940)))) (-4144 (-12 (|HasCategory| $ (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-940)))) (|HasCategory| |#2| (QUOTE (-147))))) (-1269 |x| R |y| S) ((|constructor| (NIL "This package lifts a mapping from coefficient rings \\spad{R} to \\spad{S} to a mapping from \\spadtype{UnivariatePolynomial}(\\spad{x},{}\\spad{R}) to \\spadtype{UnivariatePolynomial}(\\spad{y},{}\\spad{S}). Note that the mapping is assumed to send zero to zero,{} since it will only be applied to the non-zero coefficients of the polynomial.")) (|map| (((|UnivariatePolynomial| |#3| |#4|) (|Mapping| |#4| |#2|) (|UnivariatePolynomial| |#1| |#2|)) "\\spad{map(func, poly)} creates a new polynomial by applying \\spad{func} to every non-zero coefficient of the polynomial poly."))) NIL @@ -5039,7 +5039,7 @@ NIL (-1277 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{n} to be computed.")) (|approximate| ((|#2| $ |#3|) "\\spad{approximate(f)} returns a truncated power series with the series variable viewed as an element of the coefficient domain.")) (|truncate| (($ $ |#3| |#3|) "\\spad{truncate(f,k1,k2)} returns a (finite) power series consisting of the sum of all terms of \\spad{f} of degree \\spad{d} with \\spad{k1 <= d <= k2}.") (($ $ |#3|) "\\spad{truncate(f,k)} returns a (finite) power series consisting of the sum of all terms of \\spad{f} of degree \\spad{<= k}.")) (|order| ((|#3| $ |#3|) "\\spad{order(f,n) = min(m,n)},{} where \\spad{m} is the degree of the lowest order non-zero term in \\spad{f}.") ((|#3| $) "\\spad{order(f)} is the degree of the lowest order non-zero term in \\spad{f}. This will result in an infinite loop if \\spad{f} has no non-zero terms.")) (|multiplyExponents| (($ $ (|PositiveInteger|)) "\\spad{multiplyExponents(f,n)} multiplies all exponents of the power series \\spad{f} by the positive integer \\spad{n}.")) (|center| ((|#2| $) "\\spad{center(f)} returns the point about which the series \\spad{f} is expanded.")) (|variable| (((|Symbol|) $) "\\spad{variable(f)} returns the (unique) power series variable of the power series \\spad{f}.")) (|terms| (((|Stream| (|Record| (|:| |k| |#3|) (|:| |c| |#2|))) $) "\\spad{terms(f(x))} returns a stream of non-zero terms,{} where a a term is an exponent-coefficient pair. The terms in the stream are ordered by increasing order of exponents."))) NIL -((|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasSignature| |#2| (|%list| (QUOTE *) (|%list| (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#2|)))) (|HasCategory| |#3| (QUOTE (-1144))) (|HasSignature| |#2| (|%list| (QUOTE **) (|%list| (|devaluate| |#2|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasSignature| |#2| (|%list| (QUOTE -4080) (|%list| (|devaluate| |#2|) (QUOTE (-1209)))))) +((|HasCategory| |#2| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasSignature| |#2| (|%list| (QUOTE *) (|%list| (|devaluate| |#2|) (|devaluate| |#3|) (|devaluate| |#2|)))) (|HasCategory| |#3| (QUOTE (-1144))) (|HasSignature| |#2| (|%list| (QUOTE **) (|%list| (|devaluate| |#2|) (|devaluate| |#2|) (|devaluate| |#3|)))) (|HasSignature| |#2| (|%list| (QUOTE -3903) (|%list| (|devaluate| |#2|) (QUOTE (-1209)))))) (-1278 |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{n} to be computed.")) (|approximate| ((|#1| $ |#2|) "\\spad{approximate(f)} returns a truncated power series with the series variable viewed as an element of the coefficient domain.")) (|truncate| (($ $ |#2| |#2|) "\\spad{truncate(f,k1,k2)} returns a (finite) power series consisting of the sum of all terms of \\spad{f} of degree \\spad{d} with \\spad{k1 <= d <= k2}.") (($ $ |#2|) "\\spad{truncate(f,k)} returns a (finite) power series consisting of the sum of all terms of \\spad{f} of degree \\spad{<= k}.")) (|order| ((|#2| $ |#2|) "\\spad{order(f,n) = min(m,n)},{} where \\spad{m} is the degree of the lowest order non-zero term in \\spad{f}.") ((|#2| $) "\\spad{order(f)} is the degree of the lowest order non-zero term in \\spad{f}. This will result in an infinite loop if \\spad{f} has no non-zero terms.")) (|multiplyExponents| (($ $ (|PositiveInteger|)) "\\spad{multiplyExponents(f,n)} multiplies all exponents of the power series \\spad{f} by the positive integer \\spad{n}.")) (|center| ((|#1| $) "\\spad{center(f)} returns the point about which the series \\spad{f} is expanded.")) (|variable| (((|Symbol|) $) "\\spad{variable(f)} returns the (unique) power series variable of the power series \\spad{f}.")) (|terms| (((|Stream| (|Record| (|:| |k| |#2|) (|:| |c| |#1|))) $) "\\spad{terms(f(x))} returns a stream of non-zero terms,{} where a a term is an exponent-coefficient pair. The terms in the stream are ordered by increasing order of exponents."))) (((-4512 "*") |has| |#1| (-175)) (-4503 |has| |#1| (-571)) (-4504 . T) (-4505 . T) (-4507 . T)) @@ -5051,7 +5051,7 @@ NIL (-1280 |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."))) (((-4512 "*") |has| |#1| (-175)) (-4503 |has| |#1| (-571)) (-4508 |has| |#1| (-376)) (-4502 |has| |#1| (-376)) (-4504 . T) (-4505 . T) (-4507 . T)) -((|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-175))) (-4133 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (|%list| (QUOTE -421) (QUOTE (-560))) (|devaluate| |#1|))))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (|%list| (QUOTE -421) (QUOTE (-560))) (|devaluate| |#1|)))) (|HasCategory| (-421 (-560)) (QUOTE (-1144))) (|HasCategory| |#1| (QUOTE (-376))) (-4133 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-571)))) (-4133 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-571)))) (-12 (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (|%list| (QUOTE -421) (QUOTE (-560)))))) (|HasSignature| |#1| (|%list| (QUOTE -4080) (|%list| (|devaluate| |#1|) (QUOTE (-1209)))))) (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (|%list| (QUOTE -421) (QUOTE (-560)))))) (-4133 (-12 (|HasCategory| |#1| (|%list| (QUOTE -29) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-990))) (|HasCategory| |#1| (QUOTE (-1235)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasSignature| |#1| (|%list| (QUOTE -3538) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1209))))) (|HasSignature| |#1| (|%list| (QUOTE -2985) (|%list| (|%list| (QUOTE -663) (QUOTE (-1209))) (|devaluate| |#1|))))))) +((|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-175))) (-4144 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (|%list| (QUOTE -421) (QUOTE (-560))) (|devaluate| |#1|))))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (|%list| (QUOTE -421) (QUOTE (-560))) (|devaluate| |#1|)))) (|HasCategory| (-421 (-560)) (QUOTE (-1144))) (|HasCategory| |#1| (QUOTE (-376))) (-4144 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-571)))) (-4144 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-571)))) (-12 (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (|%list| (QUOTE -421) (QUOTE (-560)))))) (|HasSignature| |#1| (|%list| (QUOTE -3903) (|%list| (|devaluate| |#1|) (QUOTE (-1209)))))) (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (|%list| (QUOTE -421) (QUOTE (-560)))))) (-4144 (-12 (|HasCategory| |#1| (|%list| (QUOTE -29) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-990))) (|HasCategory| |#1| (QUOTE (-1235)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasSignature| |#1| (|%list| (QUOTE -2884) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1209))))) (|HasSignature| |#1| (|%list| (QUOTE -3648) (|%list| (|%list| (QUOTE -663) (QUOTE (-1209))) (|devaluate| |#1|))))))) (-1281 |Coef1| |Coef2| |var1| |var2| |cen1| |cen2|) ((|constructor| (NIL "Mapping package for univariate Puiseux series. This package allows one to apply a function to the coefficients of a univariate Puiseux series.")) (|map| (((|UnivariatePuiseuxSeries| |#2| |#4| |#6|) (|Mapping| |#2| |#1|) (|UnivariatePuiseuxSeries| |#1| |#3| |#5|)) "\\spad{map(f,g(x))} applies the map \\spad{f} to the coefficients of the Puiseux series \\spad{g(x)}."))) NIL @@ -5071,11 +5071,11 @@ NIL (-1285 |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)}."))) (((-4512 "*") |has| |#1| (-175)) (-4503 |has| |#1| (-571)) (-4508 |has| |#1| (-376)) (-4502 |has| |#1| (-376)) (-4504 . T) (-4505 . T) (-4507 . T)) -((|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-175))) (-4133 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (|%list| (QUOTE -421) (QUOTE (-560))) (|devaluate| |#1|))))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (|%list| (QUOTE -421) (QUOTE (-560))) (|devaluate| |#1|)))) (|HasCategory| (-421 (-560)) (QUOTE (-1144))) (|HasCategory| |#1| (QUOTE (-376))) (-4133 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-571)))) (-4133 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-571)))) (-12 (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (|%list| (QUOTE -421) (QUOTE (-560)))))) (|HasSignature| |#1| (|%list| (QUOTE -4080) (|%list| (|devaluate| |#1|) (QUOTE (-1209)))))) (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (|%list| (QUOTE -421) (QUOTE (-560)))))) (-4133 (-12 (|HasCategory| |#1| (|%list| (QUOTE -29) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-990))) (|HasCategory| |#1| (QUOTE (-1235)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasSignature| |#1| (|%list| (QUOTE -3538) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1209))))) (|HasSignature| |#1| (|%list| (QUOTE -2985) (|%list| (|%list| (QUOTE -663) (QUOTE (-1209))) (|devaluate| |#1|)))))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560)))))) +((|HasCategory| |#1| (QUOTE (-571))) (|HasCategory| |#1| (QUOTE (-175))) (-4144 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571)))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (|%list| (QUOTE -421) (QUOTE (-560))) (|devaluate| |#1|))))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (|%list| (QUOTE -421) (QUOTE (-560))) (|devaluate| |#1|)))) (|HasCategory| (-421 (-560)) (QUOTE (-1144))) (|HasCategory| |#1| (QUOTE (-376))) (-4144 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-571)))) (-4144 (|HasCategory| |#1| (QUOTE (-376))) (|HasCategory| |#1| (QUOTE (-571)))) (-12 (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (|%list| (QUOTE -421) (QUOTE (-560)))))) (|HasSignature| |#1| (|%list| (QUOTE -3903) (|%list| (|devaluate| |#1|) (QUOTE (-1209)))))) (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (|%list| (QUOTE -421) (QUOTE (-560)))))) (-4144 (-12 (|HasCategory| |#1| (|%list| (QUOTE -29) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-990))) (|HasCategory| |#1| (QUOTE (-1235)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasSignature| |#1| (|%list| (QUOTE -2884) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1209))))) (|HasSignature| |#1| (|%list| (QUOTE -3648) (|%list| (|%list| (QUOTE -663) (QUOTE (-1209))) (|devaluate| |#1|)))))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560)))))) (-1286 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))}."))) (((-4512 "*") |has| (-1280 |#2| |#3| |#4|) (-175)) (-4503 |has| (-1280 |#2| |#3| |#4|) (-571)) (-4504 . T) (-4505 . T) (-4507 . T)) -((|HasCategory| (-1280 |#2| |#3| |#4|) (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| (-1280 |#2| |#3| |#4|) (QUOTE (-147))) (|HasCategory| (-1280 |#2| |#3| |#4|) (QUOTE (-149))) (|HasCategory| (-1280 |#2| |#3| |#4|) (QUOTE (-175))) (-4133 (|HasCategory| (-1280 |#2| |#3| |#4|) (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| (-1280 |#2| |#3| |#4|) (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560)))))) (|HasCategory| (-1280 |#2| |#3| |#4|) (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| (-1280 |#2| |#3| |#4|) (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| (-1280 |#2| |#3| |#4|) (QUOTE (-376))) (|HasCategory| (-1280 |#2| |#3| |#4|) (QUOTE (-466))) (|HasCategory| (-1280 |#2| |#3| |#4|) (QUOTE (-571)))) +((|HasCategory| (-1280 |#2| |#3| |#4|) (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| (-1280 |#2| |#3| |#4|) (QUOTE (-147))) (|HasCategory| (-1280 |#2| |#3| |#4|) (QUOTE (-149))) (|HasCategory| (-1280 |#2| |#3| |#4|) (QUOTE (-175))) (-4144 (|HasCategory| (-1280 |#2| |#3| |#4|) (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| (-1280 |#2| |#3| |#4|) (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560)))))) (|HasCategory| (-1280 |#2| |#3| |#4|) (|%list| (QUOTE -1070) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| (-1280 |#2| |#3| |#4|) (|%list| (QUOTE -1070) (QUOTE (-560)))) (|HasCategory| (-1280 |#2| |#3| |#4|) (QUOTE (-376))) (|HasCategory| (-1280 |#2| |#3| |#4|) (QUOTE (-466))) (|HasCategory| (-1280 |#2| |#3| |#4|) (QUOTE (-571)))) (-1287 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{b}}) is equivalent to \\axiom{setlast!(\\spad{u},{}\\spad{v})}.") (($ $ "rest" $) "\\spad{setelt(u,\"rest\",v)} (also written: \\axiom{\\spad{u}.rest := \\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{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} >= 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} >= 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} >= 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 @@ -5087,7 +5087,7 @@ NIL (-1289 |Coef| |var| |cen|) ((|constructor| (NIL "Dense Taylor series in one variable \\spadtype{UnivariateTaylorSeries} is a domain representing Taylor series in one variable with coefficients in an arbitrary ring. The parameters of the type specify the coefficient ring,{} the power series variable,{} and the center of the power series expansion. For example,{} \\spadtype{UnivariateTaylorSeries}(Integer,{}\\spad{x},{}3) represents Taylor series in \\spad{(x - 3)} with \\spadtype{Integer} coefficients.")) (|integrate| (($ $ (|Variable| |#2|)) "\\spad{integrate(f(x),x)} returns an anti-derivative of the power series \\spad{f(x)} with constant coefficient 0. We may integrate a series when we can divide coefficients by integers.")) (|invmultisect| (($ (|Integer|) (|Integer|) $) "\\spad{invmultisect(a,b,f(x))} substitutes \\spad{x^((a+b)*n)} \\indented{1}{for \\spad{x^n} and multiples by \\spad{x^b}.}")) (|multisect| (($ (|Integer|) (|Integer|) $) "\\spad{multisect(a,b,f(x))} selects the coefficients of \\indented{1}{\\spad{x^((a+b)*n+a)},{} and changes this monomial to \\spad{x^n}.}")) (|revert| (($ $) "\\spad{revert(f(x))} returns a Taylor series \\spad{g(x)} such that \\spad{f(g(x)) = g(f(x)) = x}. Series \\spad{f(x)} should have constant coefficient 0 and invertible 1st order coefficient.")) (|generalLambert| (($ $ (|Integer|) (|Integer|)) "\\spad{generalLambert(f(x),a,d)} returns \\spad{f(x^a) + f(x^(a + d)) + \\indented{1}{f(x^(a + 2 d)) + ... }. \\spad{f(x)} should have zero constant} \\indented{1}{coefficient and \\spad{a} and \\spad{d} should be positive.}")) (|evenlambert| (($ $) "\\spad{evenlambert(f(x))} returns \\spad{f(x^2) + f(x^4) + f(x^6) + ...}. \\indented{1}{\\spad{f(x)} should have a zero constant coefficient.} \\indented{1}{This function is used for computing infinite products.} \\indented{1}{If \\spad{f(x)} is a Taylor series with constant term 1,{} then} \\indented{1}{\\spad{product(n=1..infinity,f(x^(2*n))) = exp(log(evenlambert(f(x))))}.}")) (|oddlambert| (($ $) "\\spad{oddlambert(f(x))} returns \\spad{f(x) + f(x^3) + f(x^5) + ...}. \\indented{1}{\\spad{f(x)} should have a zero constant coefficient.} \\indented{1}{This function is used for computing infinite products.} \\indented{1}{If \\spad{f(x)} is a Taylor series with constant term 1,{} then} \\indented{1}{\\spad{product(n=1..infinity,f(x^(2*n-1)))=exp(log(oddlambert(f(x))))}.}")) (|lambert| (($ $) "\\spad{lambert(f(x))} returns \\spad{f(x) + f(x^2) + f(x^3) + ...}. \\indented{1}{This function is used for computing infinite products.} \\indented{1}{\\spad{f(x)} should have zero constant coefficient.} \\indented{1}{If \\spad{f(x)} is a Taylor series with constant term 1,{} then} \\indented{1}{\\spad{product(n = 1..infinity,f(x^n)) = exp(log(lambert(f(x))))}.}")) (|lagrange| (($ $) "\\spad{lagrange(g(x))} produces the Taylor series for \\spad{f(x)} \\indented{1}{where \\spad{f(x)} is implicitly defined as \\spad{f(x) = x*g(f(x))}.}")) (|univariatePolynomial| (((|UnivariatePolynomial| |#2| |#1|) $ (|NonNegativeInteger|)) "\\spad{univariatePolynomial(f,k)} returns a univariate polynomial \\indented{1}{consisting of the sum of all terms of \\spad{f} of degree \\spad{<= k}.}")) (|coerce| (($ (|Variable| |#2|)) "\\spad{coerce(var)} converts the series variable \\spad{var} into a \\indented{1}{Taylor series.}") (($ (|UnivariatePolynomial| |#2| |#1|)) "\\spad{coerce(p)} converts a univariate polynomial \\spad{p} in the variable \\spad{var} to a univariate Taylor series in \\spad{var}."))) (((-4512 "*") |has| |#1| (-175)) (-4503 |has| |#1| (-571)) (-4504 . T) (-4505 . T) (-4507 . T)) -((|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-571))) (-4133 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571)))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-793)) (|devaluate| |#1|))))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-793)) (|devaluate| |#1|)))) (|HasCategory| (-793) (QUOTE (-1144))) (-12 (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-793))))) (|HasSignature| |#1| (|%list| (QUOTE -4080) (|%list| (|devaluate| |#1|) (QUOTE (-1209)))))) (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-793))))) (|HasCategory| |#1| (QUOTE (-376))) (-4133 (-12 (|HasCategory| |#1| (|%list| (QUOTE -29) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-990))) (|HasCategory| |#1| (QUOTE (-1235)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasSignature| |#1| (|%list| (QUOTE -3538) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1209))))) (|HasSignature| |#1| (|%list| (QUOTE -2985) (|%list| (|%list| (QUOTE -663) (QUOTE (-1209))) (|devaluate| |#1|))))))) +((|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-571))) (-4144 (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-571)))) (|HasCategory| |#1| (QUOTE (-175))) (|HasCategory| |#1| (QUOTE (-147))) (|HasCategory| |#1| (QUOTE (-149))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -928) (QUOTE (-1209)))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-793)) (|devaluate| |#1|))))) (|HasSignature| |#1| (|%list| (QUOTE *) (|%list| (|devaluate| |#1|) (QUOTE (-793)) (|devaluate| |#1|)))) (|HasCategory| (-793) (QUOTE (-1144))) (-12 (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-793))))) (|HasSignature| |#1| (|%list| (QUOTE -3903) (|%list| (|devaluate| |#1|) (QUOTE (-1209)))))) (|HasSignature| |#1| (|%list| (QUOTE **) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-793))))) (|HasCategory| |#1| (QUOTE (-376))) (-4144 (-12 (|HasCategory| |#1| (|%list| (QUOTE -29) (QUOTE (-560)))) (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#1| (QUOTE (-990))) (|HasCategory| |#1| (QUOTE (-1235)))) (-12 (|HasCategory| |#1| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasSignature| |#1| (|%list| (QUOTE -2884) (|%list| (|devaluate| |#1|) (|devaluate| |#1|) (QUOTE (-1209))))) (|HasSignature| |#1| (|%list| (QUOTE -3648) (|%list| (|%list| (QUOTE -663) (QUOTE (-1209))) (|devaluate| |#1|))))))) (-1290 |Coef1| |Coef2| UTS1 UTS2) ((|constructor| (NIL "Mapping package for univariate Taylor series. \\indented{2}{This package allows one to apply a function to the coefficients of} \\indented{2}{a univariate Taylor series.}")) (|map| ((|#4| (|Mapping| |#2| |#1|) |#3|) "\\spad{map(f,g(x))} applies the map \\spad{f} to the coefficients of \\indented{1}{the Taylor series \\spad{g(x)}.}"))) NIL @@ -5095,7 +5095,7 @@ NIL (-1291 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 (-560)))) (|HasCategory| |#2| (QUOTE (-990))) (|HasCategory| |#2| (QUOTE (-1235))) (|HasSignature| |#2| (|%list| (QUOTE -2985) (|%list| (|%list| (QUOTE -663) (QUOTE (-1209))) (|devaluate| |#2|)))) (|HasSignature| |#2| (|%list| (QUOTE -3538) (|%list| (|devaluate| |#2|) (|devaluate| |#2|) (QUOTE (-1209))))) (|HasCategory| |#2| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-376)))) +((|HasCategory| |#2| (|%list| (QUOTE -29) (QUOTE (-560)))) (|HasCategory| |#2| (QUOTE (-990))) (|HasCategory| |#2| (QUOTE (-1235))) (|HasSignature| |#2| (|%list| (QUOTE -3648) (|%list| (|%list| (QUOTE -663) (QUOTE (-1209))) (|devaluate| |#2|)))) (|HasSignature| |#2| (|%list| (QUOTE -2884) (|%list| (|devaluate| |#2|) (|devaluate| |#2|) (QUOTE (-1209))))) (|HasCategory| |#2| (|%list| (QUOTE -38) (|%list| (QUOTE -421) (QUOTE (-560))))) (|HasCategory| |#2| (QUOTE (-376)))) (-1292 |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."))) (((-4512 "*") |has| |#1| (-175)) (-4503 |has| |#1| (-571)) (-4504 . T) (-4505 . T) (-4507 . T)) @@ -5104,7 +5104,7 @@ NIL ((|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 -(-1294 -4131 UP L UTS) +(-1294 -4164 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 (-571)))) @@ -5127,7 +5127,7 @@ NIL (-1299 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."))) ((-4511 . T) (-4510 . T)) -((-4133 (-12 (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-4133 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549)))) (-4133 (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133)))) (|HasCategory| |#1| (QUOTE (-872))) (-4133 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133)))) (|HasCategory| (-560) (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-748))) (|HasCategory| |#1| (QUOTE (-1081))) (-12 (|HasCategory| |#1| (QUOTE (-1034))) (|HasCategory| |#1| (QUOTE (-1081)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) +((-4144 (-12 (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-4144 (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888))))) (|HasCategory| |#1| (|%list| (QUOTE -633) (QUOTE (-549)))) (-4144 (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133)))) (|HasCategory| |#1| (QUOTE (-872))) (-4144 (|HasCategory| |#1| (QUOTE (-102))) (|HasCategory| |#1| (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133)))) (|HasCategory| (-560) (QUOTE (-872))) (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (QUOTE (-25))) (|HasCategory| |#1| (QUOTE (-23))) (|HasCategory| |#1| (QUOTE (-21))) (|HasCategory| |#1| (QUOTE (-748))) (|HasCategory| |#1| (QUOTE (-1081))) (-12 (|HasCategory| |#1| (QUOTE (-1034))) (|HasCategory| |#1| (QUOTE (-1081)))) (|HasCategory| |#1| (|%list| (QUOTE -632) (QUOTE (-888)))) (|HasCategory| |#1| (QUOTE (-102))) (-12 (|HasCategory| |#1| (QUOTE (-1133))) (|HasCategory| |#1| (|%list| (QUOTE -321) (|devaluate| |#1|))))) (-1300 A B) ((|constructor| (NIL "\\indented{2}{This package provides operations which all take as arguments} vectors of elements of some type \\spad{A} and functions from \\spad{A} to another of type \\spad{B}. The operations all iterate over their vector argument and either return a value of type \\spad{B} or a vector over \\spad{B}.")) (|map| (((|Union| (|Vector| |#2|) "failed") (|Mapping| (|Union| |#2| "failed") |#1|) (|Vector| |#1|)) "\\spad{map(f, v)} applies the function \\spad{f} to every element of the vector \\spad{v} producing a new vector containing the values or \\spad{\"failed\"}.") (((|Vector| |#2|) (|Mapping| |#2| |#1|) (|Vector| |#1|)) "\\spad{map(f, v)} applies the function \\spad{f} to every element of the vector \\spad{v} producing a new vector containing the values.")) (|reduce| ((|#2| (|Mapping| |#2| |#1| |#2|) (|Vector| |#1|) |#2|) "\\spad{reduce(func,vec,ident)} combines the elements in \\spad{vec} using the binary function \\spad{func}. Argument \\spad{ident} is returned if \\spad{vec} is empty.")) (|scan| (((|Vector| |#2|) (|Mapping| |#2| |#1| |#2|) (|Vector| |#1|) |#2|) "\\spad{scan(func,vec,ident)} creates a new vector whose elements are the result of applying reduce to the binary function \\spad{func},{} increasing initial subsequences of the vector \\spad{vec},{} and the element \\spad{ident}."))) NIL @@ -5164,7 +5164,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]*v + A[2]\\spad{*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 -(-1309 K R UP -4131) +(-1309 K R UP -4164) ((|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 @@ -5196,11 +5196,11 @@ NIL ((|constructor| (NIL "This package provides computations of logarithms and exponentials for polynomials in non-commutative variables. \\newline Author: Michel Petitot (petitot@lifl.fr).")) (|Hausdorff| ((|#3| |#3| |#3| (|NonNegativeInteger|)) "\\axiom{Hausdorff(a,{}\\spad{b},{}\\spad{n})} returns log(exp(a)*exp(\\spad{b})) truncated at order \\axiom{\\spad{n}}.")) (|log| ((|#3| |#3| (|NonNegativeInteger|)) "\\axiom{log(\\spad{p},{} \\spad{n})} returns the logarithm of \\axiom{\\spad{p}} truncated at order \\axiom{\\spad{n}}.")) (|exp| ((|#3| |#3| (|NonNegativeInteger|)) "\\axiom{exp(\\spad{p},{} \\spad{n})} returns the exponential of \\axiom{\\spad{p}} truncated at order \\axiom{\\spad{n}}."))) NIL NIL -(-1317 S -4131) +(-1317 S -4164) ((|constructor| (NIL "ExtensionField {\\em F} is the category of fields which extend the field \\spad{F}")) (|Frobenius| (($ $ (|NonNegativeInteger|)) "\\spad{Frobenius(a,s)} returns \\spad{a**(q**s)} where \\spad{q} is the size()\\$\\spad{F}.") (($ $) "\\spad{Frobenius(a)} returns \\spad{a ** q} where \\spad{q} is the \\spad{size()\\$F}.")) (|transcendenceDegree| (((|NonNegativeInteger|)) "\\spad{transcendenceDegree()} returns the transcendence degree of the field extension,{} 0 if the extension is algebraic.")) (|extensionDegree| (((|OnePointCompletion| (|PositiveInteger|))) "\\spad{extensionDegree()} returns the degree of the field extension if the extension is algebraic,{} and \\spad{infinity} if it is not.")) (|degree| (((|OnePointCompletion| (|PositiveInteger|)) $) "\\spad{degree(a)} returns the degree of minimal polynomial of an element \\spad{a} if \\spad{a} is algebraic with respect to the ground field \\spad{F},{} and \\spad{infinity} otherwise.")) (|inGroundField?| (((|Boolean|) $) "\\spad{inGroundField?(a)} tests whether an element \\spad{a} is already in the ground field \\spad{F}.")) (|transcendent?| (((|Boolean|) $) "\\spad{transcendent?(a)} tests whether an element \\spad{a} is transcendent with respect to the ground field \\spad{F}.")) (|algebraic?| (((|Boolean|) $) "\\spad{algebraic?(a)} tests whether an element \\spad{a} is algebraic with respect to the ground field \\spad{F}."))) NIL ((|HasCategory| |#2| (QUOTE (-381))) (|HasCategory| |#2| (QUOTE (-147))) (|HasCategory| |#2| (QUOTE (-149)))) -(-1318 -4131) +(-1318 -4164) ((|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}."))) ((-4502 . T) (-4508 . T) (-4503 . T) ((-4512 "*") . T) (-4504 . T) (-4505 . T) (-4507 . T)) NIL @@ -5264,4 +5264,4 @@ NIL NIL NIL NIL -((-3 NIL 2294535 2294540 2294545 2294550) (-2 NIL 2294515 2294520 2294525 2294530) (-1 NIL 2294495 2294500 2294505 2294510) (0 NIL 2294475 2294480 2294485 2294490) (-1329 "ZMOD.spad" 2294284 2294297 2294413 2294470) (-1328 "ZLINDEP.spad" 2293382 2293393 2294274 2294279) (-1327 "ZDSOLVE.spad" 2283342 2283364 2293372 2293377) (-1326 "YSTREAM.spad" 2282837 2282848 2283332 2283337) (-1325 "YDIAGRAM.spad" 2282471 2282480 2282827 2282832) (-1324 "XRPOLY.spad" 2281691 2281711 2282327 2282396) (-1323 "XPR.spad" 2279486 2279499 2281409 2281508) (-1322 "XPOLYC.spad" 2278805 2278821 2279412 2279481) (-1321 "XPOLY.spad" 2278360 2278371 2278661 2278730) (-1320 "XPBWPOLY.spad" 2276799 2276819 2278134 2278203) (-1319 "XFALG.spad" 2273847 2273863 2276725 2276794) (-1318 "XF.spad" 2272310 2272325 2273749 2273842) (-1317 "XF.spad" 2270753 2270770 2272194 2272199) (-1316 "XEXPPKG.spad" 2270012 2270038 2270743 2270748) (-1315 "XDPOLY.spad" 2269626 2269642 2269868 2269937) (-1314 "XALG.spad" 2269294 2269305 2269582 2269621) (-1313 "WUTSET.spad" 2265264 2265281 2268895 2268922) (-1312 "WP.spad" 2264471 2264515 2265122 2265189) (-1311 "WHILEAST.spad" 2264269 2264278 2264461 2264466) (-1310 "WHEREAST.spad" 2263940 2263949 2264259 2264264) (-1309 "WFFINTBS.spad" 2261603 2261625 2263930 2263935) (-1308 "WEIER.spad" 2259825 2259836 2261593 2261598) (-1307 "VSPACE.spad" 2259498 2259509 2259793 2259820) (-1306 "VSPACE.spad" 2259191 2259204 2259488 2259493) (-1305 "VOID.spad" 2258868 2258877 2259181 2259186) (-1304 "VIEWDEF.spad" 2254069 2254078 2258858 2258863) (-1303 "VIEW3D.spad" 2238030 2238039 2254059 2254064) (-1302 "VIEW2D.spad" 2225929 2225938 2238020 2238025) (-1301 "VIEW.spad" 2223649 2223658 2225919 2225924) (-1300 "VECTOR2.spad" 2222288 2222301 2223639 2223644) (-1299 "VECTOR.spad" 2220788 2220799 2221039 2221066) (-1298 "VECTCAT.spad" 2218700 2218711 2220756 2220783) (-1297 "VECTCAT.spad" 2216419 2216432 2218477 2218482) (-1296 "VARIABLE.spad" 2216199 2216214 2216409 2216414) (-1295 "UTYPE.spad" 2215843 2215852 2216189 2216194) (-1294 "UTSODETL.spad" 2215138 2215162 2215799 2215804) (-1293 "UTSODE.spad" 2213354 2213374 2215128 2215133) (-1292 "UTSCAT.spad" 2210833 2210849 2213252 2213349) (-1291 "UTSCAT.spad" 2207932 2207950 2210353 2210358) (-1290 "UTS2.spad" 2207527 2207562 2207922 2207927) (-1289 "UTS.spad" 2202405 2202433 2205925 2206022) (-1288 "URAGG.spad" 2197126 2197137 2202395 2202400) (-1287 "URAGG.spad" 2191811 2191824 2197082 2197087) (-1286 "UPXSSING.spad" 2189429 2189455 2190865 2190998) (-1285 "UPXSCONS.spad" 2187107 2187127 2187480 2187629) (-1284 "UPXSCCA.spad" 2185678 2185698 2186953 2187102) (-1283 "UPXSCCA.spad" 2184391 2184413 2185668 2185673) (-1282 "UPXSCAT.spad" 2182980 2182996 2184237 2184386) (-1281 "UPXS2.spad" 2182523 2182576 2182970 2182975) (-1280 "UPXS.spad" 2179738 2179766 2180574 2180723) (-1279 "UPSQFREE.spad" 2178152 2178166 2179728 2179733) (-1278 "UPSCAT.spad" 2175947 2175971 2178050 2178147) (-1277 "UPSCAT.spad" 2173427 2173453 2175532 2175537) (-1276 "UPOLYC2.spad" 2172898 2172917 2173417 2173422) (-1275 "UPOLYC.spad" 2167978 2167989 2172740 2172893) (-1274 "UPOLYC.spad" 2162944 2162957 2167708 2167713) (-1273 "UPMP.spad" 2161876 2161889 2162934 2162939) (-1272 "UPDIVP.spad" 2161441 2161455 2161866 2161871) (-1271 "UPDECOMP.spad" 2159702 2159716 2161431 2161436) (-1270 "UPCDEN.spad" 2158919 2158935 2159692 2159697) (-1269 "UP2.spad" 2158283 2158304 2158909 2158914) (-1268 "UP.spad" 2155311 2155326 2155698 2155851) (-1267 "UNISEG2.spad" 2154808 2154821 2155267 2155272) (-1266 "UNISEG.spad" 2154161 2154172 2154727 2154732) (-1265 "UNIFACT.spad" 2153264 2153276 2154151 2154156) (-1264 "ULSCONS.spad" 2144176 2144196 2144546 2144695) (-1263 "ULSCCAT.spad" 2141913 2141933 2144022 2144171) (-1262 "ULSCCAT.spad" 2139758 2139780 2141869 2141874) (-1261 "ULSCAT.spad" 2137998 2138014 2139604 2139753) (-1260 "ULS2.spad" 2137512 2137565 2137988 2137993) (-1259 "ULS.spad" 2127083 2127111 2128028 2128457) (-1258 "UINT8.spad" 2126960 2126969 2127073 2127078) (-1257 "UINT64.spad" 2126836 2126845 2126950 2126955) (-1256 "UINT32.spad" 2126712 2126721 2126826 2126831) (-1255 "UINT16.spad" 2126588 2126597 2126702 2126707) (-1254 "UFD.spad" 2125653 2125662 2126514 2126583) (-1253 "UFD.spad" 2124780 2124791 2125643 2125648) (-1252 "UDVO.spad" 2123661 2123670 2124770 2124775) (-1251 "UDPO.spad" 2121242 2121253 2123617 2123622) (-1250 "TYPEAST.spad" 2121161 2121170 2121232 2121237) (-1249 "TYPE.spad" 2121093 2121102 2121151 2121156) (-1248 "TWOFACT.spad" 2119745 2119760 2121083 2121088) (-1247 "TUPLE.spad" 2119236 2119247 2119641 2119646) (-1246 "TUBETOOL.spad" 2116103 2116112 2119226 2119231) (-1245 "TUBE.spad" 2114750 2114767 2116093 2116098) (-1244 "TSETCAT.spad" 2102821 2102838 2114718 2114745) (-1243 "TSETCAT.spad" 2090878 2090897 2102777 2102782) (-1242 "TS.spad" 2089471 2089487 2090437 2090534) (-1241 "TRMANIP.spad" 2083835 2083852 2089159 2089164) (-1240 "TRIMAT.spad" 2082798 2082823 2083825 2083830) (-1239 "TRIGMNIP.spad" 2081325 2081342 2082788 2082793) (-1238 "TRIGCAT.spad" 2080837 2080846 2081315 2081320) (-1237 "TRIGCAT.spad" 2080347 2080358 2080827 2080832) (-1236 "TREE.spad" 2078793 2078804 2079825 2079852) (-1235 "TRANFUN.spad" 2078632 2078641 2078783 2078788) (-1234 "TRANFUN.spad" 2078469 2078480 2078622 2078627) (-1233 "TOPSP.spad" 2078143 2078152 2078459 2078464) (-1232 "TOOLSIGN.spad" 2077806 2077817 2078133 2078138) (-1231 "TEXTFILE.spad" 2076367 2076376 2077796 2077801) (-1230 "TEX1.spad" 2075923 2075934 2076357 2076362) (-1229 "TEX.spad" 2073117 2073126 2075913 2075918) (-1228 "TEMUTL.spad" 2072672 2072681 2073107 2073112) (-1227 "TBCMPPK.spad" 2070773 2070796 2072662 2072667) (-1226 "TBAGG.spad" 2069831 2069854 2070753 2070768) (-1225 "TBAGG.spad" 2068897 2068922 2069821 2069826) (-1224 "TANEXP.spad" 2068305 2068316 2068887 2068892) (-1223 "TALGOP.spad" 2068029 2068040 2068295 2068300) (-1222 "TABLEAU.spad" 2067510 2067521 2068019 2068024) (-1221 "TABLE.spad" 2065443 2065466 2065713 2065740) (-1220 "TABLBUMP.spad" 2062222 2062233 2065433 2065438) (-1219 "SYSTEM.spad" 2061450 2061459 2062212 2062217) (-1218 "SYSSOLP.spad" 2058933 2058944 2061440 2061445) (-1217 "SYSPTR.spad" 2058832 2058841 2058923 2058928) (-1216 "SYSNNI.spad" 2058055 2058066 2058822 2058827) (-1215 "SYSINT.spad" 2057459 2057470 2058045 2058050) (-1214 "SYNTAX.spad" 2053793 2053802 2057449 2057454) (-1213 "SYMTAB.spad" 2051861 2051870 2053783 2053788) (-1212 "SYMS.spad" 2047884 2047893 2051851 2051856) (-1211 "SYMPOLY.spad" 2046863 2046874 2046945 2047072) (-1210 "SYMFUNC.spad" 2046364 2046375 2046853 2046858) (-1209 "SYMBOL.spad" 2043859 2043868 2046354 2046359) (-1208 "SWITCH.spad" 2040630 2040639 2043849 2043854) (-1207 "SUTS.spad" 2037609 2037637 2039028 2039125) (-1206 "SUPXS.spad" 2034811 2034839 2035660 2035809) (-1205 "SUPFRACF.spad" 2033916 2033934 2034801 2034806) (-1204 "SUP2.spad" 2033308 2033321 2033906 2033911) (-1203 "SUP.spad" 2029950 2029961 2030723 2030876) (-1202 "SUMRF.spad" 2028924 2028935 2029940 2029945) (-1201 "SUMFS.spad" 2028553 2028570 2028914 2028919) (-1200 "SULS.spad" 2018111 2018139 2019069 2019498) (-1199 "SUCHTAST.spad" 2017880 2017889 2018101 2018106) (-1198 "SUCH.spad" 2017570 2017585 2017870 2017875) (-1197 "SUBSPACE.spad" 2009701 2009716 2017560 2017565) (-1196 "SUBRESP.spad" 2008871 2008885 2009657 2009662) (-1195 "STTFNC.spad" 2005339 2005355 2008861 2008866) (-1194 "STTF.spad" 2001438 2001454 2005329 2005334) (-1193 "STTAYLOR.spad" 1994083 1994094 2001313 2001318) (-1192 "STRTBL.spad" 1992098 1992115 1992247 1992274) (-1191 "STRING.spad" 1990864 1990873 1991085 1991112) (-1190 "STREAM3.spad" 1990437 1990452 1990854 1990859) (-1189 "STREAM2.spad" 1989565 1989578 1990427 1990432) (-1188 "STREAM1.spad" 1989271 1989282 1989555 1989560) (-1187 "STREAM.spad" 1986057 1986068 1988664 1988679) (-1186 "STINPROD.spad" 1984993 1985009 1986047 1986052) (-1185 "STEPAST.spad" 1984227 1984236 1984983 1984988) (-1184 "STEP.spad" 1983436 1983445 1984217 1984222) (-1183 "STBL.spad" 1981484 1981512 1981651 1981666) (-1182 "STAGG.spad" 1980559 1980570 1981474 1981479) (-1181 "STAGG.spad" 1979632 1979645 1980549 1980554) (-1180 "STACK.spad" 1978860 1978871 1979110 1979137) (-1179 "SRING.spad" 1978620 1978629 1978850 1978855) (-1178 "SREGSET.spad" 1976319 1976336 1978221 1978248) (-1177 "SRDCMPK.spad" 1974896 1974916 1976309 1976314) (-1176 "SRAGG.spad" 1970079 1970088 1974864 1974891) (-1175 "SRAGG.spad" 1965282 1965293 1970069 1970074) (-1174 "SQMATRIX.spad" 1962777 1962795 1963693 1963780) (-1173 "SPLTREE.spad" 1957243 1957256 1962039 1962066) (-1172 "SPLNODE.spad" 1953863 1953876 1957233 1957238) (-1171 "SPFCAT.spad" 1952672 1952681 1953853 1953858) (-1170 "SPECOUT.spad" 1951224 1951233 1952662 1952667) (-1169 "SPADXPT.spad" 1943315 1943324 1951214 1951219) (-1168 "spad-parser.spad" 1942780 1942789 1943305 1943310) (-1167 "SPADAST.spad" 1942481 1942490 1942770 1942775) (-1166 "SPACEC.spad" 1926696 1926707 1942471 1942476) (-1165 "SPACE3.spad" 1926472 1926483 1926686 1926691) (-1164 "SORTPAK.spad" 1926021 1926034 1926428 1926433) (-1163 "SOLVETRA.spad" 1923784 1923795 1926011 1926016) (-1162 "SOLVESER.spad" 1922240 1922251 1923774 1923779) (-1161 "SOLVERAD.spad" 1918266 1918277 1922230 1922235) (-1160 "SOLVEFOR.spad" 1916728 1916746 1918256 1918261) (-1159 "SNTSCAT.spad" 1916328 1916345 1916696 1916723) (-1158 "SMTS.spad" 1914610 1914636 1915887 1915984) (-1157 "SMP.spad" 1912013 1912033 1912403 1912530) (-1156 "SMITH.spad" 1910858 1910883 1912003 1912008) (-1155 "SMATCAT.spad" 1908976 1909006 1910802 1910853) (-1154 "SMATCAT.spad" 1907026 1907058 1908854 1908859) (-1153 "SKAGG.spad" 1905995 1906006 1906994 1907021) (-1152 "SINT.spad" 1904935 1904944 1905861 1905990) (-1151 "SIMPAN.spad" 1904663 1904672 1904925 1904930) (-1150 "SIGNRF.spad" 1903781 1903792 1904653 1904658) (-1149 "SIGNEF.spad" 1903060 1903077 1903771 1903776) (-1148 "SIGAST.spad" 1902477 1902486 1903050 1903055) (-1147 "SIG.spad" 1901839 1901848 1902467 1902472) (-1146 "SHP.spad" 1899783 1899798 1901795 1901800) (-1145 "SHDP.spad" 1887138 1887165 1887655 1887754) (-1144 "SGROUP.spad" 1886746 1886755 1887128 1887133) (-1143 "SGROUP.spad" 1886352 1886363 1886736 1886741) (-1142 "SGCF.spad" 1879491 1879500 1886342 1886347) (-1141 "SFRTCAT.spad" 1878437 1878454 1879459 1879486) (-1140 "SFRGCD.spad" 1877500 1877520 1878427 1878432) (-1139 "SFQCMPK.spad" 1872313 1872333 1877490 1877495) (-1138 "SFORT.spad" 1871752 1871766 1872303 1872308) (-1137 "SEXOF.spad" 1871595 1871635 1871742 1871747) (-1136 "SEXCAT.spad" 1869423 1869463 1871585 1871590) (-1135 "SEX.spad" 1869315 1869324 1869413 1869418) (-1134 "SETMN.spad" 1867773 1867790 1869305 1869310) (-1133 "SETCAT.spad" 1867258 1867267 1867763 1867768) (-1132 "SETCAT.spad" 1866741 1866752 1867248 1867253) (-1131 "SETAGG.spad" 1863290 1863301 1866721 1866736) (-1130 "SETAGG.spad" 1859847 1859860 1863280 1863285) (-1129 "SET.spad" 1858120 1858131 1859217 1859256) (-1128 "SEQAST.spad" 1857823 1857832 1858110 1858115) (-1127 "SEGXCAT.spad" 1856979 1856992 1857813 1857818) (-1126 "SEGCAT.spad" 1855904 1855915 1856969 1856974) (-1125 "SEGBIND2.spad" 1855602 1855615 1855894 1855899) (-1124 "SEGBIND.spad" 1855360 1855371 1855549 1855554) (-1123 "SEGAST.spad" 1855090 1855099 1855350 1855355) (-1122 "SEG2.spad" 1854525 1854538 1855046 1855051) (-1121 "SEG.spad" 1854338 1854349 1854444 1854449) (-1120 "SDVAR.spad" 1853614 1853625 1854328 1854333) (-1119 "SDPOL.spad" 1850869 1850880 1851160 1851287) (-1118 "SCPKG.spad" 1848958 1848969 1850859 1850864) (-1117 "SCOPE.spad" 1848135 1848144 1848948 1848953) (-1116 "SCACHE.spad" 1846831 1846842 1848125 1848130) (-1115 "SASTCAT.spad" 1846740 1846749 1846821 1846826) (-1114 "SAOS.spad" 1846612 1846621 1846730 1846735) (-1113 "SAERFFC.spad" 1846325 1846345 1846602 1846607) (-1112 "SAEFACT.spad" 1846026 1846046 1846315 1846320) (-1111 "SAE.spad" 1843460 1843476 1844071 1844206) (-1110 "RURPK.spad" 1841119 1841135 1843450 1843455) (-1109 "RULESET.spad" 1840572 1840596 1841109 1841114) (-1108 "RULECOLD.spad" 1840424 1840437 1840562 1840567) (-1107 "RULE.spad" 1838672 1838696 1840414 1840419) (-1106 "RTVALUE.spad" 1838407 1838416 1838662 1838667) (-1105 "RSTRCAST.spad" 1838124 1838133 1838397 1838402) (-1104 "RSETGCD.spad" 1834566 1834586 1838114 1838119) (-1103 "RSETCAT.spad" 1824534 1824551 1834534 1834561) (-1102 "RSETCAT.spad" 1814522 1814541 1824524 1824529) (-1101 "RSDCMPK.spad" 1813022 1813042 1814512 1814517) (-1100 "RRCC.spad" 1811406 1811436 1813012 1813017) (-1099 "RRCC.spad" 1809788 1809820 1811396 1811401) (-1098 "RPTAST.spad" 1809490 1809499 1809778 1809783) (-1097 "RPOLCAT.spad" 1788994 1789009 1809358 1809485) (-1096 "RPOLCAT.spad" 1768193 1768210 1788559 1788564) (-1095 "ROUTINE.spad" 1763594 1763603 1766342 1766369) (-1094 "ROMAN.spad" 1762922 1762931 1763460 1763589) (-1093 "ROIRC.spad" 1762002 1762034 1762912 1762917) (-1092 "RNS.spad" 1760978 1760987 1761904 1761997) (-1091 "RNS.spad" 1760040 1760051 1760968 1760973) (-1090 "RNGBIND.spad" 1759200 1759214 1759995 1760000) (-1089 "RNG.spad" 1758935 1758944 1759190 1759195) (-1088 "RMODULE.spad" 1758716 1758727 1758925 1758930) (-1087 "RMCAT2.spad" 1758136 1758193 1758706 1758711) (-1086 "RMATRIX.spad" 1756906 1756925 1757249 1757288) (-1085 "RMATCAT.spad" 1752485 1752516 1756862 1756901) (-1084 "RMATCAT.spad" 1747954 1747987 1752333 1752338) (-1083 "RLINSET.spad" 1747658 1747669 1747944 1747949) (-1082 "RINTERP.spad" 1747546 1747566 1747648 1747653) (-1081 "RING.spad" 1747016 1747025 1747526 1747541) (-1080 "RING.spad" 1746494 1746505 1747006 1747011) (-1079 "RIDIST.spad" 1745886 1745895 1746484 1746489) (-1078 "RGCHAIN.spad" 1744407 1744423 1745301 1745328) (-1077 "RGBCSPC.spad" 1744196 1744208 1744397 1744402) (-1076 "RGBCMDL.spad" 1743758 1743770 1744186 1744191) (-1075 "RFFACTOR.spad" 1743220 1743231 1743748 1743753) (-1074 "RFFACT.spad" 1742955 1742967 1743210 1743215) (-1073 "RFDIST.spad" 1741951 1741960 1742945 1742950) (-1072 "RF.spad" 1739625 1739636 1741941 1741946) (-1071 "RETSOL.spad" 1739044 1739057 1739615 1739620) (-1070 "RETRACT.spad" 1738472 1738483 1739034 1739039) (-1069 "RETRACT.spad" 1737898 1737911 1738462 1738467) (-1068 "RETAST.spad" 1737710 1737719 1737888 1737893) (-1067 "RESULT.spad" 1735272 1735281 1735859 1735886) (-1066 "RESRING.spad" 1734619 1734666 1735210 1735267) (-1065 "RESLATC.spad" 1733943 1733954 1734609 1734614) (-1064 "REPSQ.spad" 1733674 1733685 1733933 1733938) (-1063 "REPDB.spad" 1733381 1733392 1733664 1733669) (-1062 "REP2.spad" 1723095 1723106 1733223 1733228) (-1061 "REP1.spad" 1717315 1717326 1723045 1723050) (-1060 "REP.spad" 1714869 1714878 1717305 1717310) (-1059 "REGSET.spad" 1712661 1712678 1714470 1714497) (-1058 "REF.spad" 1711996 1712007 1712616 1712621) (-1057 "REDORDER.spad" 1711202 1711219 1711986 1711991) (-1056 "RECLOS.spad" 1709961 1709981 1710665 1710758) (-1055 "REALSOLV.spad" 1709101 1709110 1709951 1709956) (-1054 "REAL0Q.spad" 1706399 1706414 1709091 1709096) (-1053 "REAL0.spad" 1703243 1703258 1706389 1706394) (-1052 "REAL.spad" 1703115 1703124 1703233 1703238) (-1051 "RDUCEAST.spad" 1702836 1702845 1703105 1703110) (-1050 "RDIV.spad" 1702491 1702516 1702826 1702831) (-1049 "RDIST.spad" 1702058 1702069 1702481 1702486) (-1048 "RDETRS.spad" 1700922 1700940 1702048 1702053) (-1047 "RDETR.spad" 1699061 1699079 1700912 1700917) (-1046 "RDEEFS.spad" 1698160 1698177 1699051 1699056) (-1045 "RDEEF.spad" 1697170 1697187 1698150 1698155) (-1044 "RCFIELD.spad" 1694388 1694397 1697072 1697165) (-1043 "RCFIELD.spad" 1691692 1691703 1694378 1694383) (-1042 "RCAGG.spad" 1689628 1689639 1691682 1691687) (-1041 "RCAGG.spad" 1687491 1687504 1689547 1689552) (-1040 "RATRET.spad" 1686851 1686862 1687481 1687486) (-1039 "RATFACT.spad" 1686543 1686555 1686841 1686846) (-1038 "RANDSRC.spad" 1685862 1685871 1686533 1686538) (-1037 "RADUTIL.spad" 1685618 1685627 1685852 1685857) (-1036 "RADIX.spad" 1682397 1682411 1683943 1684036) (-1035 "RADFF.spad" 1680100 1680137 1680219 1680375) (-1034 "RADCAT.spad" 1679695 1679704 1680090 1680095) (-1033 "RADCAT.spad" 1679288 1679299 1679685 1679690) (-1032 "QUEUE.spad" 1678507 1678518 1678766 1678793) (-1031 "QUATCT2.spad" 1678127 1678146 1678497 1678502) (-1030 "QUATCAT.spad" 1676297 1676308 1678057 1678122) (-1029 "QUATCAT.spad" 1674215 1674228 1675977 1675982) (-1028 "QUAT.spad" 1672667 1672678 1673010 1673075) (-1027 "QUAGG.spad" 1671500 1671511 1672635 1672662) (-1026 "QQUTAST.spad" 1671268 1671277 1671490 1671495) (-1025 "QFORM.spad" 1670886 1670901 1671258 1671263) (-1024 "QFCAT2.spad" 1670578 1670595 1670876 1670881) (-1023 "QFCAT.spad" 1669280 1669291 1670480 1670573) (-1022 "QFCAT.spad" 1667564 1667577 1668766 1668771) (-1021 "QEQUAT.spad" 1667122 1667131 1667554 1667559) (-1020 "QCMPACK.spad" 1662036 1662056 1667112 1667117) (-1019 "QALGSET2.spad" 1660031 1660050 1662026 1662031) (-1018 "QALGSET.spad" 1656133 1656166 1659945 1659950) (-1017 "PWFFINTB.spad" 1653548 1653570 1656123 1656128) (-1016 "PUSHVAR.spad" 1652886 1652906 1653538 1653543) (-1015 "PTRANFN.spad" 1649021 1649032 1652876 1652881) (-1014 "PTPACK.spad" 1646108 1646119 1649011 1649016) (-1013 "PTFUNC2.spad" 1645930 1645945 1646098 1646103) (-1012 "PTCAT.spad" 1645184 1645195 1645898 1645925) (-1011 "PSQFR.spad" 1644498 1644523 1645174 1645179) (-1010 "PSEUDLIN.spad" 1643383 1643394 1644488 1644493) (-1009 "PSETPK.spad" 1630087 1630104 1643261 1643266) (-1008 "PSETCAT.spad" 1624486 1624510 1630067 1630082) (-1007 "PSETCAT.spad" 1618859 1618885 1624442 1624447) (-1006 "PSCURVE.spad" 1617857 1617866 1618849 1618854) (-1005 "PSCAT.spad" 1616639 1616669 1617755 1617852) (-1004 "PSCAT.spad" 1615511 1615543 1616629 1616634) (-1003 "PRTITION.spad" 1614208 1614217 1615501 1615506) (-1002 "PRTDAST.spad" 1613926 1613935 1614198 1614203) (-1001 "PRS.spad" 1603543 1603561 1613882 1613887) (-1000 "PRQAGG.spad" 1602977 1602988 1603511 1603538) (-999 "PROPLOG.spad" 1602581 1602589 1602967 1602972) (-998 "PROPFUN2.spad" 1602204 1602217 1602571 1602576) (-997 "PROPFUN1.spad" 1601610 1601621 1602194 1602199) (-996 "PROPFRML.spad" 1600178 1600189 1601600 1601605) (-995 "PROPERTY.spad" 1599674 1599682 1600168 1600173) (-994 "PRODUCT.spad" 1597356 1597368 1597640 1597695) (-993 "PRINT.spad" 1597108 1597116 1597346 1597351) (-992 "PRIMES.spad" 1595369 1595379 1597098 1597103) (-991 "PRIMELT.spad" 1593490 1593504 1595359 1595364) (-990 "PRIMCAT.spad" 1593133 1593141 1593480 1593485) (-989 "PRIMARR2.spad" 1591900 1591912 1593123 1593128) (-988 "PRIMARR.spad" 1590739 1590749 1590909 1590936) (-987 "PREASSOC.spad" 1590121 1590133 1590729 1590734) (-986 "PR.spad" 1588486 1588498 1589185 1589312) (-985 "PPCURVE.spad" 1587623 1587631 1588476 1588481) (-984 "PORTNUM.spad" 1587414 1587422 1587613 1587618) (-983 "POLYROOT.spad" 1586263 1586285 1587370 1587375) (-982 "POLYLIFT.spad" 1585528 1585551 1586253 1586258) (-981 "POLYCATQ.spad" 1583654 1583676 1585518 1585523) (-980 "POLYCAT.spad" 1577156 1577177 1583522 1583649) (-979 "POLYCAT.spad" 1569954 1569977 1576322 1576327) (-978 "POLY2UP.spad" 1569406 1569420 1569944 1569949) (-977 "POLY2.spad" 1569003 1569015 1569396 1569401) (-976 "POLY.spad" 1566266 1566276 1566781 1566908) (-975 "POLUTIL.spad" 1565231 1565260 1566222 1566227) (-974 "POLTOPOL.spad" 1563979 1563994 1565221 1565226) (-973 "POINT.spad" 1562643 1562653 1562730 1562757) (-972 "PNTHEORY.spad" 1559345 1559353 1562633 1562638) (-971 "PMTOOLS.spad" 1558120 1558134 1559335 1559340) (-970 "PMSYM.spad" 1557669 1557679 1558110 1558115) (-969 "PMQFCAT.spad" 1557260 1557274 1557659 1557664) (-968 "PMPREDFS.spad" 1556722 1556744 1557250 1557255) (-967 "PMPRED.spad" 1556209 1556223 1556712 1556717) (-966 "PMPLCAT.spad" 1555286 1555304 1556138 1556143) (-965 "PMLSAGG.spad" 1554871 1554885 1555276 1555281) (-964 "PMKERNEL.spad" 1554450 1554462 1554861 1554866) (-963 "PMINS.spad" 1554030 1554040 1554440 1554445) (-962 "PMFS.spad" 1553607 1553625 1554020 1554025) (-961 "PMDOWN.spad" 1552897 1552911 1553597 1553602) (-960 "PMASSFS.spad" 1551872 1551888 1552887 1552892) (-959 "PMASS.spad" 1550890 1550898 1551862 1551867) (-958 "PLOTTOOL.spad" 1550670 1550678 1550880 1550885) (-957 "PLOT3D.spad" 1547134 1547142 1550660 1550665) (-956 "PLOT1.spad" 1546307 1546317 1547124 1547129) (-955 "PLOT.spad" 1541230 1541238 1546297 1546302) (-954 "PLEQN.spad" 1528632 1528659 1541220 1541225) (-953 "PINTERPA.spad" 1528416 1528432 1528622 1528627) (-952 "PINTERP.spad" 1528038 1528057 1528406 1528411) (-951 "PID.spad" 1527012 1527020 1527964 1528033) (-950 "PICOERCE.spad" 1526669 1526679 1527002 1527007) (-949 "PI.spad" 1526286 1526294 1526643 1526664) (-948 "PGROEB.spad" 1524895 1524909 1526276 1526281) (-947 "PGE.spad" 1516568 1516576 1524885 1524890) (-946 "PGCD.spad" 1515522 1515539 1516558 1516563) (-945 "PFRPAC.spad" 1514671 1514681 1515512 1515517) (-944 "PFR.spad" 1511374 1511384 1514573 1514666) (-943 "PFOTOOLS.spad" 1510632 1510648 1511364 1511369) (-942 "PFOQ.spad" 1510002 1510020 1510622 1510627) (-941 "PFO.spad" 1509421 1509448 1509992 1509997) (-940 "PFECAT.spad" 1507131 1507139 1509347 1509416) (-939 "PFECAT.spad" 1504869 1504879 1507087 1507092) (-938 "PFBRU.spad" 1502757 1502769 1504859 1504864) (-937 "PFBR.spad" 1500317 1500340 1502747 1502752) (-936 "PF.spad" 1499891 1499903 1500122 1500215) (-935 "PERMGRP.spad" 1494661 1494671 1499881 1499886) (-934 "PERMCAT.spad" 1493322 1493332 1494641 1494656) (-933 "PERMAN.spad" 1491878 1491892 1493312 1493317) (-932 "PERM.spad" 1487685 1487695 1491708 1491723) (-931 "PENDTREE.spad" 1486905 1486915 1487185 1487190) (-930 "PDSPC.spad" 1485718 1485728 1486895 1486900) (-929 "PDSPC.spad" 1484529 1484541 1485708 1485713) (-928 "PDRING.spad" 1484371 1484381 1484509 1484524) (-927 "PDMOD.spad" 1484187 1484199 1484339 1484366) (-926 "PDEPROB.spad" 1483202 1483210 1484177 1484182) (-925 "PDEPACK.spad" 1477338 1477346 1483192 1483197) (-924 "PDECOMP.spad" 1476808 1476825 1477328 1477333) (-923 "PDECAT.spad" 1475164 1475172 1476798 1476803) (-922 "PDDOM.spad" 1474602 1474615 1475154 1475159) (-921 "PDDOM.spad" 1474038 1474053 1474592 1474597) (-920 "PCOMP.spad" 1473891 1473904 1474028 1474033) (-919 "PBWLB.spad" 1472487 1472504 1473881 1473886) (-918 "PATTERN2.spad" 1472225 1472237 1472477 1472482) (-917 "PATTERN1.spad" 1470569 1470585 1472215 1472220) (-916 "PATTERN.spad" 1465140 1465150 1470559 1470564) (-915 "PATRES2.spad" 1464812 1464826 1465130 1465135) (-914 "PATRES.spad" 1462395 1462407 1464802 1464807) (-913 "PATMATCH.spad" 1460583 1460614 1462094 1462099) (-912 "PATMAB.spad" 1460012 1460022 1460573 1460578) (-911 "PATLRES.spad" 1459098 1459112 1460002 1460007) (-910 "PATAB.spad" 1458862 1458872 1459088 1459093) (-909 "PARTPERM.spad" 1456918 1456926 1458852 1458857) (-908 "PARSURF.spad" 1456352 1456380 1456908 1456913) (-907 "PARSU2.spad" 1456149 1456165 1456342 1456347) (-906 "script-parser.spad" 1455669 1455677 1456139 1456144) (-905 "PARSCURV.spad" 1455103 1455131 1455659 1455664) (-904 "PARSC2.spad" 1454894 1454910 1455093 1455098) (-903 "PARPCURV.spad" 1454356 1454384 1454884 1454889) (-902 "PARPC2.spad" 1454147 1454163 1454346 1454351) (-901 "PARAMAST.spad" 1453275 1453283 1454137 1454142) (-900 "PAN2EXPR.spad" 1452687 1452695 1453265 1453270) (-899 "PALETTE.spad" 1451673 1451681 1452677 1452682) (-898 "PAIR.spad" 1450680 1450693 1451249 1451254) (-897 "PADICRC.spad" 1447884 1447902 1449047 1449140) (-896 "PADICRAT.spad" 1445743 1445755 1445956 1446049) (-895 "PADICCT.spad" 1444292 1444304 1445669 1445738) (-894 "PADIC.spad" 1443995 1444007 1444218 1444287) (-893 "PADEPAC.spad" 1442684 1442703 1443985 1443990) (-892 "PADE.spad" 1441436 1441452 1442674 1442679) (-891 "OWP.spad" 1440684 1440714 1441294 1441361) (-890 "OVERSET.spad" 1440257 1440265 1440674 1440679) (-889 "OVAR.spad" 1440038 1440061 1440247 1440252) (-888 "OUTFORM.spad" 1429446 1429454 1440028 1440033) (-887 "OUTBFILE.spad" 1428880 1428888 1429436 1429441) (-886 "OUTBCON.spad" 1427950 1427958 1428870 1428875) (-885 "OUTBCON.spad" 1427018 1427028 1427940 1427945) (-884 "OUT.spad" 1426136 1426144 1427008 1427013) (-883 "OSI.spad" 1425611 1425619 1426126 1426131) (-882 "OSGROUP.spad" 1425529 1425537 1425601 1425606) (-881 "ORTHPOL.spad" 1424008 1424018 1425440 1425445) (-880 "OREUP.spad" 1423452 1423480 1423679 1423718) (-879 "ORESUP.spad" 1422744 1422768 1423123 1423162) (-878 "OREPCTO.spad" 1420633 1420645 1422664 1422669) (-877 "OREPCAT.spad" 1414820 1414830 1420589 1420628) (-876 "OREPCAT.spad" 1408897 1408909 1414668 1414673) (-875 "ORDTYPE.spad" 1408134 1408142 1408887 1408892) (-874 "ORDTYPE.spad" 1407369 1407379 1408124 1408129) (-873 "ORDSTRCT.spad" 1407139 1407154 1407302 1407307) (-872 "ORDSET.spad" 1406839 1406847 1407129 1407134) (-871 "ORDRING.spad" 1406656 1406664 1406819 1406834) (-870 "ORDMON.spad" 1406511 1406519 1406646 1406651) (-869 "ORDFUNS.spad" 1405643 1405659 1406501 1406506) (-868 "ORDFIN.spad" 1405463 1405471 1405633 1405638) (-867 "ORDCOMP2.spad" 1404756 1404768 1405453 1405458) (-866 "ORDCOMP.spad" 1403209 1403219 1404291 1404320) (-865 "OPTPROB.spad" 1401847 1401855 1403199 1403204) (-864 "OPTPACK.spad" 1394256 1394264 1401837 1401842) (-863 "OPTCAT.spad" 1391935 1391943 1394246 1394251) (-862 "OPSIG.spad" 1391597 1391605 1391925 1391930) (-861 "OPQUERY.spad" 1391178 1391186 1391587 1391592) (-860 "OPERCAT.spad" 1390644 1390654 1391168 1391173) (-859 "OPERCAT.spad" 1390108 1390120 1390634 1390639) (-858 "OP.spad" 1389850 1389860 1389930 1389997) (-857 "ONECOMP2.spad" 1389274 1389286 1389840 1389845) (-856 "ONECOMP.spad" 1388007 1388017 1388809 1388838) (-855 "OMSERVER.spad" 1387013 1387021 1387997 1388002) (-854 "OMSAGG.spad" 1386801 1386811 1386969 1387008) (-853 "OMPKG.spad" 1385433 1385441 1386791 1386796) (-852 "OMLO.spad" 1384866 1384878 1385319 1385358) (-851 "OMEXPR.spad" 1384700 1384710 1384856 1384861) (-850 "OMERRK.spad" 1383750 1383758 1384690 1384695) (-849 "OMERR.spad" 1383295 1383303 1383740 1383745) (-848 "OMENC.spad" 1382647 1382655 1383285 1383290) (-847 "OMDEV.spad" 1376980 1376988 1382637 1382642) (-846 "OMCONN.spad" 1376389 1376397 1376970 1376975) (-845 "OM.spad" 1375386 1375394 1376379 1376384) (-844 "OINTDOM.spad" 1375149 1375157 1375312 1375381) (-843 "OFMONOID.spad" 1373288 1373298 1375105 1375110) (-842 "ODVAR.spad" 1372549 1372559 1373278 1373283) (-841 "ODR.spad" 1372193 1372219 1372361 1372510) (-840 "ODPOL.spad" 1369404 1369414 1369744 1369871) (-839 "ODP.spad" 1356903 1356923 1357276 1357375) (-838 "ODETOOLS.spad" 1355552 1355571 1356893 1356898) (-837 "ODESYS.spad" 1353246 1353263 1355542 1355547) (-836 "ODERTRIC.spad" 1349279 1349296 1353203 1353208) (-835 "ODERED.spad" 1348678 1348702 1349269 1349274) (-834 "ODERAT.spad" 1346309 1346326 1348668 1348673) (-833 "ODEPRRIC.spad" 1343402 1343424 1346299 1346304) (-832 "ODEPROB.spad" 1342659 1342667 1343392 1343397) (-831 "ODEPRIM.spad" 1340057 1340079 1342649 1342654) (-830 "ODEPAL.spad" 1339443 1339467 1340047 1340052) (-829 "ODEPACK.spad" 1326173 1326181 1339433 1339438) (-828 "ODEINT.spad" 1325608 1325624 1326163 1326168) (-827 "ODEIFTBL.spad" 1323011 1323019 1325598 1325603) (-826 "ODEEF.spad" 1318502 1318518 1323001 1323006) (-825 "ODECONST.spad" 1318047 1318065 1318492 1318497) (-824 "ODECAT.spad" 1316645 1316653 1318037 1318042) (-823 "OCTCT2.spad" 1316283 1316304 1316635 1316640) (-822 "OCT.spad" 1314371 1314381 1315085 1315124) (-821 "OCAMON.spad" 1314219 1314227 1314361 1314366) (-820 "OC.spad" 1312015 1312025 1314175 1314214) (-819 "OC.spad" 1309533 1309545 1311695 1311700) (-818 "OASGP.spad" 1309348 1309356 1309523 1309528) (-817 "OAMONS.spad" 1308870 1308878 1309338 1309343) (-816 "OAMON.spad" 1308628 1308636 1308860 1308865) (-815 "OAMON.spad" 1308384 1308394 1308618 1308623) (-814 "OAGROUP.spad" 1307922 1307930 1308374 1308379) (-813 "OAGROUP.spad" 1307458 1307468 1307912 1307917) (-812 "NUMTUBE.spad" 1307049 1307065 1307448 1307453) (-811 "NUMQUAD.spad" 1295025 1295033 1307039 1307044) (-810 "NUMODE.spad" 1286377 1286385 1295015 1295020) (-809 "NUMINT.spad" 1283943 1283951 1286367 1286372) (-808 "NUMFMT.spad" 1282783 1282791 1283933 1283938) (-807 "NUMERIC.spad" 1274897 1274907 1282588 1282593) (-806 "NTSCAT.spad" 1273405 1273421 1274865 1274892) (-805 "NTPOLFN.spad" 1272950 1272960 1273316 1273321) (-804 "NSUP2.spad" 1272342 1272354 1272940 1272945) (-803 "NSUP.spad" 1265337 1265347 1269757 1269910) (-802 "NSMP.spad" 1261436 1261455 1261728 1261855) (-801 "NREP.spad" 1259838 1259852 1261426 1261431) (-800 "NPCOEF.spad" 1259084 1259104 1259828 1259833) (-799 "NORMRETR.spad" 1258682 1258721 1259074 1259079) (-798 "NORMPK.spad" 1256624 1256643 1258672 1258677) (-797 "NORMMA.spad" 1256312 1256338 1256614 1256619) (-796 "NONE1.spad" 1255988 1255998 1256302 1256307) (-795 "NONE.spad" 1255729 1255737 1255978 1255983) (-794 "NODE1.spad" 1255216 1255232 1255719 1255724) (-793 "NNI.spad" 1254111 1254119 1255190 1255211) (-792 "NLINSOL.spad" 1252737 1252747 1254101 1254106) (-791 "NIPROB.spad" 1251278 1251286 1252727 1252732) (-790 "NFINTBAS.spad" 1248838 1248855 1251268 1251273) (-789 "NETCLT.spad" 1248812 1248823 1248828 1248833) (-788 "NCODIV.spad" 1247036 1247052 1248802 1248807) (-787 "NCNTFRAC.spad" 1246678 1246692 1247026 1247031) (-786 "NCEP.spad" 1244844 1244858 1246668 1246673) (-785 "NASRING.spad" 1244448 1244456 1244834 1244839) (-784 "NASRING.spad" 1244050 1244060 1244438 1244443) (-783 "NARNG.spad" 1243450 1243458 1244040 1244045) (-782 "NARNG.spad" 1242848 1242858 1243440 1243445) (-781 "NAGSP.spad" 1241925 1241933 1242838 1242843) (-780 "NAGS.spad" 1231642 1231650 1241915 1241920) (-779 "NAGF07.spad" 1230073 1230081 1231632 1231637) (-778 "NAGF04.spad" 1224475 1224483 1230063 1230068) (-777 "NAGF02.spad" 1218568 1218576 1224465 1224470) (-776 "NAGF01.spad" 1214337 1214345 1218558 1218563) (-775 "NAGE04.spad" 1208045 1208053 1214327 1214332) (-774 "NAGE02.spad" 1198697 1198705 1208035 1208040) (-773 "NAGE01.spad" 1194691 1194699 1198687 1198692) (-772 "NAGD03.spad" 1192687 1192695 1194681 1194686) (-771 "NAGD02.spad" 1185418 1185426 1192677 1192682) (-770 "NAGD01.spad" 1179703 1179711 1185408 1185413) (-769 "NAGC06.spad" 1175570 1175578 1179693 1179698) (-768 "NAGC05.spad" 1174063 1174071 1175560 1175565) (-767 "NAGC02.spad" 1173338 1173346 1174053 1174058) (-766 "NAALG.spad" 1172903 1172913 1173306 1173333) (-765 "NAALG.spad" 1172488 1172500 1172893 1172898) (-764 "MULTSQFR.spad" 1169446 1169463 1172478 1172483) (-763 "MULTFACT.spad" 1168829 1168846 1169436 1169441) (-762 "MTSCAT.spad" 1166923 1166944 1168727 1168824) (-761 "MTHING.spad" 1166582 1166592 1166913 1166918) (-760 "MSYSCMD.spad" 1166016 1166024 1166572 1166577) (-759 "MSETAGG.spad" 1165861 1165871 1165984 1166011) (-758 "MSET.spad" 1163774 1163784 1165522 1165561) (-757 "MRING.spad" 1160751 1160763 1163482 1163549) (-756 "MRF2.spad" 1160313 1160327 1160741 1160746) (-755 "MRATFAC.spad" 1159859 1159876 1160303 1160308) (-754 "MPRFF.spad" 1157899 1157918 1159849 1159854) (-753 "MPOLY.spad" 1155298 1155313 1155657 1155784) (-752 "MPCPF.spad" 1154562 1154581 1155288 1155293) (-751 "MPC3.spad" 1154379 1154419 1154552 1154557) (-750 "MPC2.spad" 1154032 1154065 1154369 1154374) (-749 "MONOTOOL.spad" 1152383 1152400 1154022 1154027) (-748 "MONOID.spad" 1151702 1151710 1152373 1152378) (-747 "MONOID.spad" 1151019 1151029 1151692 1151697) (-746 "MONOGEN.spad" 1149767 1149780 1150879 1151014) (-745 "MONOGEN.spad" 1148537 1148552 1149651 1149656) (-744 "MONADWU.spad" 1146615 1146623 1148527 1148532) (-743 "MONADWU.spad" 1144691 1144701 1146605 1146610) (-742 "MONAD.spad" 1143851 1143859 1144681 1144686) (-741 "MONAD.spad" 1143009 1143019 1143841 1143846) (-740 "MOEBIUS.spad" 1141745 1141759 1142989 1143004) (-739 "MODULE.spad" 1141615 1141625 1141713 1141740) (-738 "MODULE.spad" 1141505 1141517 1141605 1141610) (-737 "MODRING.spad" 1140840 1140879 1141485 1141500) (-736 "MODOP.spad" 1139497 1139509 1140662 1140729) (-735 "MODMONOM.spad" 1139228 1139246 1139487 1139492) (-734 "MODMON.spad" 1135852 1135868 1136571 1136724) (-733 "MODFIELD.spad" 1135214 1135253 1135754 1135847) (-732 "MMLFORM.spad" 1134074 1134082 1135204 1135209) (-731 "MMAP.spad" 1133816 1133850 1134064 1134069) (-730 "MLO.spad" 1132275 1132285 1133772 1133811) (-729 "MLIFT.spad" 1130887 1130904 1132265 1132270) (-728 "MKUCFUNC.spad" 1130422 1130440 1130877 1130882) (-727 "MKRECORD.spad" 1130010 1130023 1130412 1130417) (-726 "MKFUNC.spad" 1129417 1129427 1130000 1130005) (-725 "MKFLCFN.spad" 1128385 1128395 1129407 1129412) (-724 "MKBCFUNC.spad" 1127880 1127898 1128375 1128380) (-723 "MINT.spad" 1127319 1127327 1127782 1127875) (-722 "MHROWRED.spad" 1125830 1125840 1127309 1127314) (-721 "MFLOAT.spad" 1124350 1124358 1125720 1125825) (-720 "MFINFACT.spad" 1123750 1123772 1124340 1124345) (-719 "MESH.spad" 1121540 1121548 1123740 1123745) (-718 "MDDFACT.spad" 1119759 1119769 1121530 1121535) (-717 "MDAGG.spad" 1119050 1119060 1119739 1119754) (-716 "MCMPLX.spad" 1114415 1114423 1115029 1115230) (-715 "MCDEN.spad" 1113625 1113637 1114405 1114410) (-714 "MCALCFN.spad" 1110723 1110749 1113615 1113620) (-713 "MAYBE.spad" 1110023 1110034 1110713 1110718) (-712 "MATSTOR.spad" 1107339 1107349 1110013 1110018) (-711 "MATRIX.spad" 1105905 1105915 1106389 1106416) (-710 "MATLIN.spad" 1103273 1103297 1105789 1105794) (-709 "MATCAT2.spad" 1102555 1102603 1103263 1103268) (-708 "MATCAT.spad" 1094117 1094139 1102523 1102550) (-707 "MATCAT.spad" 1085551 1085575 1093959 1093964) (-706 "MAPPKG3.spad" 1084466 1084480 1085541 1085546) (-705 "MAPPKG2.spad" 1083804 1083816 1084456 1084461) (-704 "MAPPKG1.spad" 1082632 1082642 1083794 1083799) (-703 "MAPPAST.spad" 1081971 1081979 1082622 1082627) (-702 "MAPHACK3.spad" 1081783 1081797 1081961 1081966) (-701 "MAPHACK2.spad" 1081552 1081564 1081773 1081778) (-700 "MAPHACK1.spad" 1081196 1081206 1081542 1081547) (-699 "MAGMA.spad" 1079002 1079019 1081186 1081191) (-698 "MACROAST.spad" 1078597 1078605 1078992 1078997) (-697 "M3D.spad" 1076182 1076192 1077840 1077845) (-696 "LZSTAGG.spad" 1073436 1073446 1076172 1076177) (-695 "LZSTAGG.spad" 1070688 1070700 1073426 1073431) (-694 "LWORD.spad" 1067433 1067450 1070678 1070683) (-693 "LSTAST.spad" 1067217 1067225 1067423 1067428) (-692 "LSQM.spad" 1065329 1065343 1065723 1065774) (-691 "LSPP.spad" 1064864 1064881 1065319 1065324) (-690 "LSMP1.spad" 1062690 1062704 1064854 1064859) (-689 "LSMP.spad" 1061540 1061568 1062680 1062685) (-688 "LSAGG.spad" 1061209 1061219 1061508 1061535) (-687 "LSAGG.spad" 1060898 1060910 1061199 1061204) (-686 "LPOLY.spad" 1059860 1059879 1060754 1060823) (-685 "LPEFRAC.spad" 1059131 1059141 1059850 1059855) (-684 "LOGIC.spad" 1058733 1058741 1059121 1059126) (-683 "LOGIC.spad" 1058333 1058343 1058723 1058728) (-682 "LODOOPS.spad" 1057263 1057275 1058323 1058328) (-681 "LODOF.spad" 1056309 1056326 1057220 1057225) (-680 "LODOCAT.spad" 1054975 1054985 1056265 1056304) (-679 "LODOCAT.spad" 1053639 1053651 1054931 1054936) (-678 "LODO2.spad" 1052903 1052915 1053310 1053349) (-677 "LODO1.spad" 1052294 1052304 1052574 1052613) (-676 "LODO.spad" 1051669 1051685 1051965 1052004) (-675 "LODEEF.spad" 1050471 1050489 1051659 1051664) (-674 "LO.spad" 1049872 1049886 1050405 1050432) (-673 "LNAGG.spad" 1046059 1046069 1049862 1049867) (-672 "LNAGG.spad" 1042210 1042222 1046015 1046020) (-671 "LMOPS.spad" 1038978 1038995 1042200 1042205) (-670 "LMODULE.spad" 1038762 1038772 1038968 1038973) (-669 "LMDICT.spad" 1037933 1037943 1038181 1038208) (-668 "LLINSET.spad" 1037640 1037650 1037923 1037928) (-667 "LITERAL.spad" 1037546 1037557 1037630 1037635) (-666 "LIST3.spad" 1036857 1036871 1037536 1037541) (-665 "LIST2MAP.spad" 1033784 1033796 1036847 1036852) (-664 "LIST2.spad" 1032486 1032498 1033774 1033779) (-663 "LIST.spad" 1030047 1030057 1031459 1031486) (-662 "LINSET.spad" 1029826 1029836 1030037 1030042) (-661 "LINFORM.spad" 1029289 1029301 1029794 1029821) (-660 "LINEXP.spad" 1028032 1028042 1029279 1029284) (-659 "LINELT.spad" 1027403 1027415 1027915 1027942) (-658 "LINDEP.spad" 1026252 1026264 1027315 1027320) (-657 "LINBASIS.spad" 1025888 1025903 1026242 1026247) (-656 "LIMITRF.spad" 1023816 1023826 1025878 1025883) (-655 "LIMITPS.spad" 1022719 1022732 1023806 1023811) (-654 "LIECAT.spad" 1022203 1022213 1022645 1022714) (-653 "LIECAT.spad" 1021715 1021727 1022159 1022164) (-652 "LIE.spad" 1019710 1019722 1020984 1021129) (-651 "LIB.spad" 1017425 1017433 1017871 1017886) (-650 "LGROBP.spad" 1014778 1014797 1017415 1017420) (-649 "LFCAT.spad" 1013837 1013845 1014768 1014773) (-648 "LF.spad" 1012792 1012808 1013827 1013832) (-647 "LEXTRIPK.spad" 1008415 1008430 1012782 1012787) (-646 "LEXP.spad" 1006434 1006461 1008395 1008410) (-645 "LETAST.spad" 1006133 1006141 1006424 1006429) (-644 "LEADCDET.spad" 1004539 1004556 1006123 1006128) (-643 "LAZM3PK.spad" 1003283 1003305 1004529 1004534) (-642 "LAUPOL.spad" 1001868 1001881 1002768 1002837) (-641 "LAPLACE.spad" 1001451 1001467 1001858 1001863) (-640 "LALG.spad" 1001227 1001237 1001431 1001446) (-639 "LALG.spad" 1001011 1001023 1001217 1001222) (-638 "LA.spad" 1000451 1000465 1000933 1000972) (-637 "KVTFROM.spad" 1000194 1000204 1000441 1000446) (-636 "KTVLOGIC.spad" 999738 999746 1000184 1000189) (-635 "KRCFROM.spad" 999484 999494 999728 999733) (-634 "KOVACIC.spad" 998215 998232 999474 999479) (-633 "KONVERT.spad" 997937 997947 998205 998210) (-632 "KOERCE.spad" 997674 997684 997927 997932) (-631 "KERNEL2.spad" 997377 997389 997664 997669) (-630 "KERNEL.spad" 996017 996027 997146 997151) (-629 "KDAGG.spad" 995126 995148 995997 996012) (-628 "KDAGG.spad" 994243 994267 995116 995121) (-627 "KAFILE.spad" 993073 993089 993308 993335) (-626 "JVMOP.spad" 992986 992994 993063 993068) (-625 "JVMMDACC.spad" 992040 992048 992976 992981) (-624 "JVMFDACC.spad" 991356 991364 992030 992035) (-623 "JVMCSTTG.spad" 990085 990093 991346 991351) (-622 "JVMCFACC.spad" 989531 989539 990075 990080) (-621 "JVMBCODE.spad" 989442 989450 989521 989526) (-620 "JORDAN.spad" 987250 987262 988711 988856) (-619 "JOINAST.spad" 986952 986960 987240 987245) (-618 "IXAGG.spad" 985085 985109 986942 986947) (-617 "IXAGG.spad" 983073 983099 984932 984937) (-616 "IVECTOR.spad" 981669 981684 981824 981851) (-615 "ITUPLE.spad" 980845 980855 981659 981664) (-614 "ITRIGMNP.spad" 979692 979711 980835 980840) (-613 "ITFUN3.spad" 979198 979212 979682 979687) (-612 "ITFUN2.spad" 978942 978954 979188 979193) (-611 "ITFORM.spad" 978297 978305 978932 978937) (-610 "ITAYLOR.spad" 976291 976306 978161 978258) (-609 "ISUPS.spad" 968689 968704 975226 975323) (-608 "ISUMP.spad" 968190 968206 968679 968684) (-607 "ISTRING.spad" 967096 967109 967177 967204) (-606 "ISAST.spad" 966815 966823 967086 967091) (-605 "IRURPK.spad" 965532 965551 966805 966810) (-604 "IRSN.spad" 963536 963544 965522 965527) (-603 "IRRF2F.spad" 962029 962039 963492 963497) (-602 "IRREDFFX.spad" 961630 961641 962019 962024) (-601 "IROOT.spad" 959969 959979 961620 961625) (-600 "IRFORM.spad" 959293 959301 959959 959964) (-599 "IR2F.spad" 958507 958523 959283 959288) (-598 "IR2.spad" 957535 957551 958497 958502) (-597 "IR.spad" 955338 955352 957384 957411) (-596 "IPRNTPK.spad" 955098 955106 955328 955333) (-595 "IPF.spad" 954663 954675 954903 954996) (-594 "IPADIC.spad" 954432 954458 954589 954658) (-593 "IP4ADDR.spad" 953989 953997 954422 954427) (-592 "IOMODE.spad" 953511 953519 953979 953984) (-591 "IOBFILE.spad" 952896 952904 953501 953506) (-590 "IOBCON.spad" 952761 952769 952886 952891) (-589 "INVLAPLA.spad" 952410 952426 952751 952756) (-588 "INTTR.spad" 945792 945809 952400 952405) (-587 "INTTOOLS.spad" 943535 943551 945354 945359) (-586 "INTSLPE.spad" 942863 942871 943525 943530) (-585 "INTRVL.spad" 942429 942439 942777 942858) (-584 "INTRF.spad" 940861 940875 942419 942424) (-583 "INTRET.spad" 940293 940303 940851 940856) (-582 "INTRAT.spad" 939028 939045 940283 940288) (-581 "INTPM.spad" 937395 937411 938653 938658) (-580 "INTPAF.spad" 935264 935282 937324 937329) (-579 "INTPACK.spad" 925830 925838 935254 935259) (-578 "INTHERTR.spad" 925104 925121 925820 925825) (-577 "INTHERAL.spad" 924774 924798 925094 925099) (-576 "INTHEORY.spad" 921213 921221 924764 924769) (-575 "INTG0.spad" 914959 914977 921142 921147) (-574 "INTFTBL.spad" 908988 908996 914949 914954) (-573 "INTFACT.spad" 908055 908065 908978 908983) (-572 "INTEF.spad" 906464 906480 908045 908050) (-571 "INTDOM.spad" 905087 905095 906390 906459) (-570 "INTDOM.spad" 903772 903782 905077 905082) (-569 "INTCAT.spad" 902039 902049 903686 903767) (-568 "INTBIT.spad" 901546 901554 902029 902034) (-567 "INTALG.spad" 900734 900761 901536 901541) (-566 "INTAF.spad" 900234 900250 900724 900729) (-565 "INTABL.spad" 898274 898305 898437 898464) (-564 "INT8.spad" 898154 898162 898264 898269) (-563 "INT64.spad" 898033 898041 898144 898149) (-562 "INT32.spad" 897912 897920 898023 898028) (-561 "INT16.spad" 897791 897799 897902 897907) (-560 "INT.spad" 897234 897242 897645 897786) (-559 "INS.spad" 894737 894745 897136 897229) (-558 "INS.spad" 892326 892336 894727 894732) (-557 "INPSIGN.spad" 891774 891787 892316 892321) (-556 "INPRODPF.spad" 890870 890889 891764 891769) (-555 "INPRODFF.spad" 889958 889982 890860 890865) (-554 "INNMFACT.spad" 888933 888950 889948 889953) (-553 "INMODGCD.spad" 888437 888467 888923 888928) (-552 "INFSP.spad" 886734 886756 888427 888432) (-551 "INFPROD0.spad" 885814 885833 886724 886729) (-550 "INFORM1.spad" 885439 885449 885804 885809) (-549 "INFORM.spad" 882646 882654 885429 885434) (-548 "INFINITY.spad" 882198 882206 882636 882641) (-547 "INETCLTS.spad" 882175 882183 882188 882193) (-546 "INEP.spad" 880721 880743 882165 882170) (-545 "INDE.spad" 880370 880387 880631 880636) (-544 "INCRMAPS.spad" 879807 879817 880360 880365) (-543 "INBFILE.spad" 878903 878911 879797 879802) (-542 "INBFF.spad" 874753 874764 878893 878898) (-541 "INBCON.spad" 873019 873027 874743 874748) (-540 "INBCON.spad" 871283 871293 873009 873014) (-539 "INAST.spad" 870944 870952 871273 871278) (-538 "IMPTAST.spad" 870652 870660 870934 870939) (-537 "IMATRIX.spad" 869468 869494 869980 870007) (-536 "IMATQF.spad" 868562 868606 869424 869429) (-535 "IMATLIN.spad" 867183 867207 868518 868523) (-534 "ILIST.spad" 865667 865682 866192 866219) (-533 "IIARRAY2.spad" 864942 864980 865145 865172) (-532 "IFF.spad" 864352 864368 864623 864716) (-531 "IFAST.spad" 863966 863974 864342 864347) (-530 "IFARRAY.spad" 861277 861292 862975 863002) (-529 "IFAMON.spad" 861139 861156 861233 861238) (-528 "IEVALAB.spad" 860552 860564 861129 861134) (-527 "IEVALAB.spad" 859963 859977 860542 860547) (-526 "IDPOAMS.spad" 859641 859653 859875 859880) (-525 "IDPOAM.spad" 859283 859295 859553 859558) (-524 "IDPO.spad" 859018 859030 859195 859200) (-523 "IDPC.spad" 857747 857759 859008 859013) (-522 "IDPAM.spad" 857414 857426 857659 857664) (-521 "IDPAG.spad" 857083 857095 857326 857331) (-520 "IDENT.spad" 856733 856741 857073 857078) (-519 "IDECOMP.spad" 853972 853990 856723 856728) (-518 "IDEAL.spad" 848918 848957 853904 853909) (-517 "ICDEN.spad" 848131 848147 848908 848913) (-516 "ICARD.spad" 847322 847330 848121 848126) (-515 "IBPTOOLS.spad" 845929 845946 847312 847317) (-514 "IBITS.spad" 845085 845098 845518 845545) (-513 "IBATOOL.spad" 842070 842089 845075 845080) (-512 "IBACHIN.spad" 840577 840592 842060 842065) (-511 "IARRAY2.spad" 839444 839470 840055 840082) (-510 "IARRAY1.spad" 838307 838322 838453 838480) (-509 "IAN.spad" 836527 836535 838120 838213) (-508 "IALGFACT.spad" 836138 836171 836517 836522) (-507 "HYPCAT.spad" 835562 835570 836128 836133) (-506 "HYPCAT.spad" 834984 834994 835552 835557) (-505 "HOSTNAME.spad" 834800 834808 834974 834979) (-504 "HOMOTOP.spad" 834543 834553 834790 834795) (-503 "HOAGG.spad" 831825 831835 834533 834538) (-502 "HOAGG.spad" 828840 828852 831550 831555) (-501 "HEXADEC.spad" 826800 826808 827165 827258) (-500 "HEUGCD.spad" 825891 825902 826790 826795) (-499 "HELLFDIV.spad" 825497 825521 825881 825886) (-498 "HEAP.spad" 824760 824770 824975 825002) (-497 "HEADAST.spad" 824301 824309 824750 824755) (-496 "HDP.spad" 811796 811812 812173 812272) (-495 "HDMP.spad" 808938 808953 809554 809681) (-494 "HB.spad" 807213 807221 808928 808933) (-493 "HASHTBL.spad" 805205 805236 805416 805443) (-492 "HASAST.spad" 804921 804929 805195 805200) (-491 "HACKPI.spad" 804412 804420 804823 804916) (-490 "GTSET.spad" 803306 803322 804013 804040) (-489 "GSTBL.spad" 801347 801382 801521 801536) (-488 "GSERIES.spad" 798579 798606 799398 799547) (-487 "GROUP.spad" 797852 797860 798559 798574) (-486 "GROUP.spad" 797133 797143 797842 797847) (-485 "GROEBSOL.spad" 795627 795648 797123 797128) (-484 "GRMOD.spad" 794206 794218 795617 795622) (-483 "GRMOD.spad" 792783 792797 794196 794201) (-482 "GRIMAGE.spad" 785696 785704 792773 792778) (-481 "GRDEF.spad" 784075 784083 785686 785691) (-480 "GRAY.spad" 782546 782554 784065 784070) (-479 "GRALG.spad" 781639 781651 782536 782541) (-478 "GRALG.spad" 780730 780744 781629 781634) (-477 "GPOLSET.spad" 780155 780178 780367 780394) (-476 "GOSPER.spad" 779432 779450 780145 780150) (-475 "GMODPOL.spad" 778580 778607 779400 779427) (-474 "GHENSEL.spad" 777663 777677 778570 778575) (-473 "GENUPS.spad" 773956 773969 777653 777658) (-472 "GENUFACT.spad" 773533 773543 773946 773951) (-471 "GENPGCD.spad" 773135 773152 773523 773528) (-470 "GENMFACT.spad" 772587 772606 773125 773130) (-469 "GENEEZ.spad" 770546 770559 772577 772582) (-468 "GDMP.spad" 767530 767547 768304 768431) (-467 "GCNAALG.spad" 761453 761480 767324 767391) (-466 "GCDDOM.spad" 760645 760653 761379 761448) (-465 "GCDDOM.spad" 759899 759909 760635 760640) (-464 "GBINTERN.spad" 755919 755957 759889 759894) (-463 "GBF.spad" 751702 751740 755909 755914) (-462 "GBEUCLID.spad" 749584 749622 751692 751697) (-461 "GB.spad" 747110 747148 749540 749545) (-460 "GAUSSFAC.spad" 746423 746431 747100 747105) (-459 "GALUTIL.spad" 744749 744759 746379 746384) (-458 "GALPOLYU.spad" 743203 743216 744739 744744) (-457 "GALFACTU.spad" 741416 741435 743193 743198) (-456 "GALFACT.spad" 731629 731640 741406 741411) (-455 "FVFUN.spad" 728652 728660 731619 731624) (-454 "FVC.spad" 727704 727712 728642 728647) (-453 "FUNDESC.spad" 727382 727390 727694 727699) (-452 "FUNCTION.spad" 727231 727243 727372 727377) (-451 "FTEM.spad" 726396 726404 727221 727226) (-450 "FT.spad" 724693 724701 726386 726391) (-449 "FSUPFACT.spad" 723590 723609 724626 724631) (-448 "FST.spad" 721676 721684 723580 723585) (-447 "FSRED.spad" 721156 721172 721666 721671) (-446 "FSPRMELT.spad" 720022 720038 721113 721118) (-445 "FSPECF.spad" 718113 718129 720012 720017) (-444 "FSINT.spad" 717773 717789 718103 718108) (-443 "FSERIES.spad" 716964 716976 717593 717692) (-442 "FSCINT.spad" 716281 716297 716954 716959) (-441 "FSAGG2.spad" 715016 715032 716271 716276) (-440 "FSAGG.spad" 714133 714143 714972 715011) (-439 "FSAGG.spad" 713212 713224 714053 714058) (-438 "FS2UPS.spad" 707727 707761 713202 713207) (-437 "FS2EXPXP.spad" 706868 706891 707717 707722) (-436 "FS2.spad" 706523 706539 706858 706863) (-435 "FS.spad" 700791 700801 706298 706518) (-434 "FS.spad" 694831 694843 700340 700345) (-433 "FRUTIL.spad" 693785 693795 694821 694826) (-432 "FRNAALG.spad" 689062 689072 693727 693780) (-431 "FRNAALG.spad" 684351 684363 689018 689023) (-430 "FRNAAF2.spad" 683799 683817 684341 684346) (-429 "FRMOD.spad" 683206 683236 683727 683732) (-428 "FRIDEAL2.spad" 682810 682842 683196 683201) (-427 "FRIDEAL.spad" 682035 682056 682790 682805) (-426 "FRETRCT.spad" 681554 681564 682025 682030) (-425 "FRETRCT.spad" 680930 680942 681403 681408) (-424 "FRAMALG.spad" 679310 679323 680886 680925) (-423 "FRAMALG.spad" 677722 677737 679300 679305) (-422 "FRAC2.spad" 677327 677339 677712 677717) (-421 "FRAC.spad" 674286 674296 674673 674846) (-420 "FR2.spad" 673622 673634 674276 674281) (-419 "FR.spad" 667217 667227 672517 672586) (-418 "FPS.spad" 664056 664064 667107 667212) (-417 "FPS.spad" 660923 660933 663976 663981) (-416 "FPC.spad" 659969 659977 660825 660918) (-415 "FPC.spad" 659101 659111 659959 659964) (-414 "FPATMAB.spad" 658863 658873 659091 659096) (-413 "FPARFRAC.spad" 657705 657722 658853 658858) (-412 "FORTRAN.spad" 656211 656254 657695 657700) (-411 "FORTFN.spad" 653381 653389 656201 656206) (-410 "FORTCAT.spad" 653065 653073 653371 653376) (-409 "FORT.spad" 652014 652022 653055 653060) (-408 "FORMULA1.spad" 651493 651503 652004 652009) (-407 "FORMULA.spad" 648967 648975 651483 651488) (-406 "FORDER.spad" 648658 648682 648957 648962) (-405 "FOP.spad" 647859 647867 648648 648653) (-404 "FNLA.spad" 647283 647305 647827 647854) (-403 "FNCAT.spad" 645878 645886 647273 647278) (-402 "FNAME.spad" 645770 645778 645868 645873) (-401 "FMTC.spad" 645568 645576 645696 645765) (-400 "FMONOID.spad" 645249 645259 645524 645529) (-399 "FMONCAT.spad" 642418 642428 645239 645244) (-398 "FMFUN.spad" 639448 639456 642408 642413) (-397 "FMCAT.spad" 637124 637142 639416 639443) (-396 "FMC.spad" 636176 636184 637114 637119) (-395 "FM1.spad" 635541 635553 636110 636137) (-394 "FM.spad" 635156 635168 635395 635422) (-393 "FLOATRP.spad" 632899 632913 635146 635151) (-392 "FLOATCP.spad" 630338 630352 632889 632894) (-391 "FLOAT.spad" 623652 623660 630204 630333) (-390 "FLINEXP.spad" 623374 623384 623642 623647) (-389 "FLINEXP.spad" 623037 623049 623307 623312) (-388 "FLASORT.spad" 622363 622375 623027 623032) (-387 "FLALG.spad" 620033 620052 622289 622358) (-386 "FLAGG2.spad" 618750 618766 620023 620028) (-385 "FLAGG.spad" 615816 615826 618730 618745) (-384 "FLAGG.spad" 612783 612795 615699 615704) (-383 "FINRALG.spad" 610868 610881 612739 612778) (-382 "FINRALG.spad" 608879 608894 610752 610757) (-381 "FINITE.spad" 608031 608039 608869 608874) (-380 "FINAALG.spad" 597216 597226 607973 608026) (-379 "FINAALG.spad" 586413 586425 597172 597177) (-378 "FILECAT.spad" 584947 584964 586403 586408) (-377 "FILE.spad" 584530 584540 584937 584942) (-376 "FIELD.spad" 583936 583944 584432 584525) (-375 "FIELD.spad" 583428 583438 583926 583931) (-374 "FGROUP.spad" 582091 582101 583408 583423) (-373 "FGLMICPK.spad" 580886 580901 582081 582086) (-372 "FFX.spad" 580269 580284 580602 580695) (-371 "FFSLPE.spad" 579780 579801 580259 580264) (-370 "FFPOLY2.spad" 578840 578857 579770 579775) (-369 "FFPOLY.spad" 570182 570193 578830 578835) (-368 "FFP.spad" 569587 569607 569898 569991) (-367 "FFNBX.spad" 568107 568127 569303 569396) (-366 "FFNBP.spad" 566628 566645 567823 567916) (-365 "FFNB.spad" 565093 565114 566309 566402) (-364 "FFINTBAS.spad" 562607 562626 565083 565088) (-363 "FFIELDC.spad" 560192 560200 562509 562602) (-362 "FFIELDC.spad" 557863 557873 560182 560187) (-361 "FFHOM.spad" 556635 556652 557853 557858) (-360 "FFF.spad" 554078 554089 556625 556630) (-359 "FFCGX.spad" 552933 552953 553794 553887) (-358 "FFCGP.spad" 551830 551850 552649 552742) (-357 "FFCG.spad" 550622 550643 551511 551604) (-356 "FFCAT2.spad" 550369 550409 550612 550617) (-355 "FFCAT.spad" 543534 543556 550208 550364) (-354 "FFCAT.spad" 536778 536802 543454 543459) (-353 "FF.spad" 536226 536242 536459 536552) (-352 "FEXPR.spad" 527926 527972 535973 536012) (-351 "FEVALAB.spad" 527634 527644 527916 527921) (-350 "FEVALAB.spad" 527118 527130 527402 527407) (-349 "FDIVCAT.spad" 525214 525238 527108 527113) (-348 "FDIVCAT.spad" 523308 523334 525204 525209) (-347 "FDIV2.spad" 522964 523004 523298 523303) (-346 "FDIV.spad" 522422 522446 522954 522959) (-345 "FCTRDATA.spad" 521430 521438 522412 522417) (-344 "FCPAK1.spad" 519965 519973 521420 521425) (-343 "FCOMP.spad" 519344 519354 519955 519960) (-342 "FC.spad" 509351 509359 519334 519339) (-341 "FAXF.spad" 502386 502400 509253 509346) (-340 "FAXF.spad" 495473 495489 502342 502347) (-339 "FARRAY.spad" 493449 493459 494482 494509) (-338 "FAMR.spad" 491593 491605 493347 493444) (-337 "FAMR.spad" 489721 489735 491477 491482) (-336 "FAMONOID.spad" 489405 489415 489675 489680) (-335 "FAMONC.spad" 487725 487737 489395 489400) (-334 "FAGROUP.spad" 487365 487375 487621 487648) (-333 "FACUTIL.spad" 485577 485594 487355 487360) (-332 "FACTFUNC.spad" 484779 484789 485567 485572) (-331 "EXPUPXS.spad" 481531 481554 482830 482979) (-330 "EXPRTUBE.spad" 478819 478827 481521 481526) (-329 "EXPRODE.spad" 475987 476003 478809 478814) (-328 "EXPR2UPS.spad" 472109 472122 475977 475982) (-327 "EXPR2.spad" 471814 471826 472099 472104) (-326 "EXPR.spad" 466899 466909 467613 467908) (-325 "EXPEXPAN.spad" 463643 463668 464275 464368) (-324 "EXITAST.spad" 463379 463387 463633 463638) (-323 "EXIT.spad" 463050 463058 463369 463374) (-322 "EVALCYC.spad" 462510 462524 463040 463045) (-321 "EVALAB.spad" 462090 462100 462500 462505) (-320 "EVALAB.spad" 461668 461680 462080 462085) (-319 "EUCDOM.spad" 459258 459266 461594 461663) (-318 "EUCDOM.spad" 456910 456920 459248 459253) (-317 "ESTOOLS2.spad" 456505 456519 456900 456905) (-316 "ESTOOLS1.spad" 456182 456193 456495 456500) (-315 "ESTOOLS.spad" 448060 448068 456172 456177) (-314 "ESCONT1.spad" 447801 447813 448050 448055) (-313 "ESCONT.spad" 444594 444602 447791 447796) (-312 "ES2.spad" 444107 444123 444584 444589) (-311 "ES1.spad" 443677 443693 444097 444102) (-310 "ES.spad" 436548 436556 443667 443672) (-309 "ES.spad" 429322 429332 436443 436448) (-308 "ERROR.spad" 426649 426657 429312 429317) (-307 "EQTBL.spad" 424643 424665 424852 424879) (-306 "EQ2.spad" 424361 424373 424633 424638) (-305 "EQ.spad" 419137 419147 421932 422044) (-304 "EP.spad" 415463 415473 419127 419132) (-303 "ENV.spad" 414141 414149 415453 415458) (-302 "ENTIRER.spad" 413809 413817 414085 414136) (-301 "EMR.spad" 413097 413138 413735 413804) (-300 "ELTAGG.spad" 411351 411370 413087 413092) (-299 "ELTAGG.spad" 409569 409590 411307 411312) (-298 "ELTAB.spad" 409044 409057 409559 409564) (-297 "ELFUTS.spad" 408479 408498 409034 409039) (-296 "ELEMFUN.spad" 408168 408176 408469 408474) (-295 "ELEMFUN.spad" 407855 407865 408158 408163) (-294 "ELAGG.spad" 405826 405836 407835 407850) (-293 "ELAGG.spad" 403734 403746 405745 405750) (-292 "ELABOR.spad" 403080 403088 403724 403729) (-291 "ELABEXPR.spad" 402012 402020 403070 403075) (-290 "EFUPXS.spad" 398788 398818 401968 401973) (-289 "EFULS.spad" 395624 395647 398744 398749) (-288 "EFSTRUC.spad" 393639 393655 395614 395619) (-287 "EF.spad" 388415 388431 393629 393634) (-286 "EAB.spad" 386715 386723 388405 388410) (-285 "E04UCFA.spad" 386251 386259 386705 386710) (-284 "E04NAFA.spad" 385828 385836 386241 386246) (-283 "E04MBFA.spad" 385408 385416 385818 385823) (-282 "E04JAFA.spad" 384944 384952 385398 385403) (-281 "E04GCFA.spad" 384480 384488 384934 384939) (-280 "E04FDFA.spad" 384016 384024 384470 384475) (-279 "E04DGFA.spad" 383552 383560 384006 384011) (-278 "E04AGNT.spad" 379426 379434 383542 383547) (-277 "DVARCAT.spad" 376316 376326 379416 379421) (-276 "DVARCAT.spad" 373204 373216 376306 376311) (-275 "DSMP.spad" 370500 370514 370805 370932) (-274 "DSEXT.spad" 369802 369812 370490 370495) (-273 "DSEXT.spad" 369008 369020 369698 369703) (-272 "DROPT1.spad" 368673 368683 368998 369003) (-271 "DROPT0.spad" 363538 363546 368663 368668) (-270 "DROPT.spad" 357497 357505 363528 363533) (-269 "DRAWPT.spad" 355670 355678 357487 357492) (-268 "DRAWHACK.spad" 354978 354988 355660 355665) (-267 "DRAWCX.spad" 352456 352464 354968 354973) (-266 "DRAWCURV.spad" 352003 352018 352446 352451) (-265 "DRAWCFUN.spad" 341535 341543 351993 351998) (-264 "DRAW.spad" 334411 334424 341525 341530) (-263 "DQAGG.spad" 332589 332599 334379 334406) (-262 "DPOLCAT.spad" 327946 327962 332457 332584) (-261 "DPOLCAT.spad" 323389 323407 327902 327907) (-260 "DPMO.spad" 314912 314928 315050 315263) (-259 "DPMM.spad" 306448 306466 306573 306786) (-258 "DOMTMPLT.spad" 306219 306227 306438 306443) (-257 "DOMCTOR.spad" 305974 305982 306209 306214) (-256 "DOMAIN.spad" 305085 305093 305964 305969) (-255 "DMP.spad" 302273 302288 302843 302970) (-254 "DMEXT.spad" 302140 302150 302241 302268) (-253 "DLP.spad" 301500 301510 302130 302135) (-252 "DLIST.spad" 299905 299915 300509 300536) (-251 "DLAGG.spad" 298322 298332 299895 299900) (-250 "DIVRING.spad" 297864 297872 298266 298317) (-249 "DIVRING.spad" 297450 297460 297854 297859) (-248 "DISPLAY.spad" 295640 295648 297440 297445) (-247 "DIRPROD2.spad" 294458 294476 295630 295635) (-246 "DIRPROD.spad" 281690 281706 282330 282429) (-245 "DIRPCAT.spad" 280883 280899 281586 281685) (-244 "DIRPCAT.spad" 279703 279721 280408 280413) (-243 "DIOSP.spad" 278528 278536 279693 279698) (-242 "DIOPS.spad" 277524 277534 278508 278523) (-241 "DIOPS.spad" 276494 276506 277480 277485) (-240 "DIFRING.spad" 276332 276340 276474 276489) (-239 "DIFFSPC.spad" 275911 275919 276322 276327) (-238 "DIFFSPC.spad" 275488 275498 275901 275906) (-237 "DIFFMOD.spad" 274977 274987 275456 275483) (-236 "DIFFDOM.spad" 274142 274153 274967 274972) (-235 "DIFFDOM.spad" 273305 273318 274132 274137) (-234 "DIFEXT.spad" 273124 273134 273285 273300) (-233 "DIAGG.spad" 272754 272764 273104 273119) (-232 "DIAGG.spad" 272392 272404 272744 272749) (-231 "DHMATRIX.spad" 270575 270585 271720 271747) (-230 "DFSFUN.spad" 264215 264223 270565 270570) (-229 "DFLOAT.spad" 260946 260954 264105 264210) (-228 "DFINTTLS.spad" 259177 259193 260936 260941) (-227 "DERHAM.spad" 257091 257123 259157 259172) (-226 "DEQUEUE.spad" 256286 256296 256569 256596) (-225 "DEGRED.spad" 255903 255917 256276 256281) (-224 "DEFINTRF.spad" 253440 253450 255893 255898) (-223 "DEFINTEF.spad" 251950 251966 253430 253435) (-222 "DEFAST.spad" 251334 251342 251940 251945) (-221 "DECIMAL.spad" 249298 249306 249659 249752) (-220 "DDFACT.spad" 247119 247136 249288 249293) (-219 "DBLRESP.spad" 246719 246743 247109 247114) (-218 "DBASIS.spad" 246345 246360 246709 246714) (-217 "DBASE.spad" 245009 245019 246335 246340) (-216 "DATAARY.spad" 244495 244508 244999 245004) (-215 "D03FAFA.spad" 244323 244331 244485 244490) (-214 "D03EEFA.spad" 244143 244151 244313 244318) (-213 "D03AGNT.spad" 243229 243237 244133 244138) (-212 "D02EJFA.spad" 242691 242699 243219 243224) (-211 "D02CJFA.spad" 242169 242177 242681 242686) (-210 "D02BHFA.spad" 241659 241667 242159 242164) (-209 "D02BBFA.spad" 241149 241157 241649 241654) (-208 "D02AGNT.spad" 236019 236027 241139 241144) (-207 "D01WGTS.spad" 234338 234346 236009 236014) (-206 "D01TRNS.spad" 234315 234323 234328 234333) (-205 "D01GBFA.spad" 233837 233845 234305 234310) (-204 "D01FCFA.spad" 233359 233367 233827 233832) (-203 "D01ASFA.spad" 232827 232835 233349 233354) (-202 "D01AQFA.spad" 232281 232289 232817 232822) (-201 "D01APFA.spad" 231721 231729 232271 232276) (-200 "D01ANFA.spad" 231215 231223 231711 231716) (-199 "D01AMFA.spad" 230725 230733 231205 231210) (-198 "D01ALFA.spad" 230265 230273 230715 230720) (-197 "D01AKFA.spad" 229791 229799 230255 230260) (-196 "D01AJFA.spad" 229314 229322 229781 229786) (-195 "D01AGNT.spad" 225381 225389 229304 229309) (-194 "CYCLOTOM.spad" 224887 224895 225371 225376) (-193 "CYCLES.spad" 221679 221687 224877 224882) (-192 "CVMP.spad" 221096 221106 221669 221674) (-191 "CTRIGMNP.spad" 219596 219612 221086 221091) (-190 "CTORKIND.spad" 219199 219207 219586 219591) (-189 "CTORCAT.spad" 218440 218448 219189 219194) (-188 "CTORCAT.spad" 217679 217689 218430 218435) (-187 "CTORCALL.spad" 217268 217278 217669 217674) (-186 "CTOR.spad" 216959 216967 217258 217263) (-185 "CSTTOOLS.spad" 216204 216217 216949 216954) (-184 "CRFP.spad" 209976 209989 216194 216199) (-183 "CRCEAST.spad" 209696 209704 209966 209971) (-182 "CRAPACK.spad" 208763 208773 209686 209691) (-181 "CPMATCH.spad" 208264 208279 208685 208690) (-180 "CPIMA.spad" 207969 207988 208254 208259) (-179 "COORDSYS.spad" 202978 202988 207959 207964) (-178 "CONTOUR.spad" 202405 202413 202968 202973) (-177 "CONTFRAC.spad" 198155 198165 202307 202400) (-176 "CONDUIT.spad" 197913 197921 198145 198150) (-175 "COMRING.spad" 197587 197595 197851 197908) (-174 "COMPPROP.spad" 197105 197113 197577 197582) (-173 "COMPLPAT.spad" 196872 196887 197095 197100) (-172 "COMPLEX2.spad" 196587 196599 196862 196867) (-171 "COMPLEX.spad" 191898 191908 192142 192403) (-170 "COMPILER.spad" 191447 191455 191888 191893) (-169 "COMPFACT.spad" 191049 191063 191437 191442) (-168 "COMPCAT.spad" 189121 189131 190783 191044) (-167 "COMPCAT.spad" 186918 186930 188582 188587) (-166 "COMMUPC.spad" 186666 186684 186908 186913) (-165 "COMMONOP.spad" 186199 186207 186656 186661) (-164 "COMMAAST.spad" 185962 185970 186189 186194) (-163 "COMM.spad" 185773 185781 185952 185957) (-162 "COMBOPC.spad" 184696 184704 185763 185768) (-161 "COMBINAT.spad" 183463 183473 184686 184691) (-160 "COMBF.spad" 180885 180901 183453 183458) (-159 "COLOR.spad" 179722 179730 180875 180880) (-158 "COLONAST.spad" 179388 179396 179712 179717) (-157 "CMPLXRT.spad" 179099 179116 179378 179383) (-156 "CLLCTAST.spad" 178761 178769 179089 179094) (-155 "CLIP.spad" 174869 174877 178751 178756) (-154 "CLIF.spad" 173524 173540 174825 174864) (-153 "CLAGG.spad" 170061 170071 173514 173519) (-152 "CLAGG.spad" 166466 166478 169921 169926) (-151 "CINTSLPE.spad" 165821 165834 166456 166461) (-150 "CHVAR.spad" 163959 163981 165811 165816) (-149 "CHARZ.spad" 163874 163882 163939 163954) (-148 "CHARPOL.spad" 163400 163410 163864 163869) (-147 "CHARNZ.spad" 163162 163170 163380 163395) (-146 "CHAR.spad" 160530 160538 163152 163157) (-145 "CFCAT.spad" 159858 159866 160520 160525) (-144 "CDEN.spad" 159078 159092 159848 159853) (-143 "CCLASS.spad" 157174 157182 158436 158475) (-142 "CATEGORY.spad" 156248 156256 157164 157169) (-141 "CATCTOR.spad" 156139 156147 156238 156243) (-140 "CATAST.spad" 155765 155773 156129 156134) (-139 "CASEAST.spad" 155479 155487 155755 155760) (-138 "CARTEN2.spad" 154869 154896 155469 155474) (-137 "CARTEN.spad" 150236 150260 154859 154864) (-136 "CARD.spad" 147531 147539 150210 150231) (-135 "CAPSLAST.spad" 147313 147321 147521 147526) (-134 "CACHSET.spad" 146937 146945 147303 147308) (-133 "CABMON.spad" 146492 146500 146927 146932) (-132 "BYTEORD.spad" 146167 146175 146482 146487) (-131 "BYTEBUF.spad" 143868 143876 145154 145181) (-130 "BYTE.spad" 143343 143351 143858 143863) (-129 "BTREE.spad" 142287 142297 142821 142848) (-128 "BTOURN.spad" 141163 141173 141765 141792) (-127 "BTCAT.spad" 140555 140565 141131 141158) (-126 "BTCAT.spad" 139967 139979 140545 140550) (-125 "BTAGG.spad" 139433 139441 139935 139962) (-124 "BTAGG.spad" 138919 138929 139423 139428) (-123 "BSTREE.spad" 137531 137541 138397 138424) (-122 "BRILL.spad" 135736 135747 137521 137526) (-121 "BRAGG.spad" 134692 134702 135726 135731) (-120 "BRAGG.spad" 133612 133624 134648 134653) (-119 "BPADICRT.spad" 131437 131449 131684 131777) (-118 "BPADIC.spad" 131109 131121 131363 131432) (-117 "BOUNDZRO.spad" 130765 130782 131099 131104) (-116 "BOP1.spad" 128223 128233 130755 130760) (-115 "BOP.spad" 123365 123373 128213 128218) (-114 "BOOLEAN.spad" 122803 122811 123355 123360) (-113 "BOOLE.spad" 122453 122461 122793 122798) (-112 "BOOLE.spad" 122101 122111 122443 122448) (-111 "BMODULE.spad" 121813 121825 122069 122096) (-110 "BITS.spad" 121187 121195 121402 121429) (-109 "BINDING.spad" 120608 120616 121177 121182) (-108 "BINARY.spad" 118577 118585 118933 119026) (-107 "BGAGG.spad" 117782 117792 118557 118572) (-106 "BGAGG.spad" 116995 117007 117772 117777) (-105 "BFUNCT.spad" 116559 116567 116975 116990) (-104 "BEZOUT.spad" 115699 115726 116509 116514) (-103 "BBTREE.spad" 112447 112457 115177 115204) (-102 "BASTYPE.spad" 111946 111954 112437 112442) (-101 "BASTYPE.spad" 111443 111453 111936 111941) (-100 "BALFACT.spad" 110902 110915 111433 111438) (-99 "AUTOMOR.spad" 110353 110362 110882 110897) (-98 "ATTREG.spad" 107076 107083 110105 110348) (-97 "ATTRBUT.spad" 103099 103106 107056 107071) (-96 "ATTRAST.spad" 102816 102823 103089 103094) (-95 "ATRIG.spad" 102286 102293 102806 102811) (-94 "ATRIG.spad" 101754 101763 102276 102281) (-93 "ASTCAT.spad" 101658 101665 101744 101749) (-92 "ASTCAT.spad" 101560 101569 101648 101653) (-91 "ASTACK.spad" 100770 100779 101038 101065) (-90 "ASSOCEQ.spad" 99604 99615 100726 100731) (-89 "ASP9.spad" 98685 98698 99594 99599) (-88 "ASP80.spad" 98007 98020 98675 98680) (-87 "ASP8.spad" 97050 97063 97997 98002) (-86 "ASP78.spad" 96501 96514 97040 97045) (-85 "ASP77.spad" 95870 95883 96491 96496) (-84 "ASP74.spad" 94962 94975 95860 95865) (-83 "ASP73.spad" 94233 94246 94952 94957) (-82 "ASP7.spad" 93393 93406 94223 94228) (-81 "ASP6.spad" 92260 92273 93383 93388) (-80 "ASP55.spad" 90769 90782 92250 92255) (-79 "ASP50.spad" 88586 88599 90759 90764) (-78 "ASP49.spad" 87585 87598 88576 88581) (-77 "ASP42.spad" 86000 86039 87575 87580) (-76 "ASP41.spad" 84587 84626 85990 85995) (-75 "ASP4.spad" 83882 83895 84577 84582) (-74 "ASP35.spad" 82870 82883 83872 83877) (-73 "ASP34.spad" 82171 82184 82860 82865) (-72 "ASP33.spad" 81731 81744 82161 82166) (-71 "ASP31.spad" 80871 80884 81721 81726) (-70 "ASP30.spad" 79763 79776 80861 80866) (-69 "ASP29.spad" 79229 79242 79753 79758) (-68 "ASP28.spad" 70502 70515 79219 79224) (-67 "ASP27.spad" 69399 69412 70492 70497) (-66 "ASP24.spad" 68486 68499 69389 69394) (-65 "ASP20.spad" 67950 67963 68476 68481) (-64 "ASP19.spad" 62636 62649 67940 67945) (-63 "ASP12.spad" 62050 62063 62626 62631) (-62 "ASP10.spad" 61321 61334 62040 62045) (-61 "ASP1.spad" 60702 60715 61311 61316) (-60 "ARRAY2.spad" 59941 59950 60180 60207) (-59 "ARRAY12.spad" 58654 58665 59931 59936) (-58 "ARRAY1.spad" 57317 57326 57663 57690) (-57 "ARR2CAT.spad" 53099 53120 57285 57312) (-56 "ARR2CAT.spad" 48901 48924 53089 53094) (-55 "ARITY.spad" 48273 48280 48891 48896) (-54 "APPRULE.spad" 47557 47579 48263 48268) (-53 "APPLYORE.spad" 47176 47189 47547 47552) (-52 "ANY1.spad" 46247 46256 47166 47171) (-51 "ANY.spad" 45098 45105 46237 46242) (-50 "ANTISYM.spad" 43543 43559 45078 45093) (-49 "ANON.spad" 43252 43259 43533 43538) (-48 "AN.spad" 41558 41565 43065 43158) (-47 "AMR.spad" 39743 39754 41456 41553) (-46 "AMR.spad" 37759 37772 39474 39479) (-45 "ALIST.spad" 34599 34620 34949 34976) (-44 "ALGSC.spad" 33734 33760 34471 34524) (-43 "ALGPKG.spad" 29517 29528 33690 33695) (-42 "ALGMFACT.spad" 28710 28724 29507 29512) (-41 "ALGMANIP.spad" 26194 26209 28537 28542) (-40 "ALGFF.spad" 23799 23826 24016 24172) (-39 "ALGFACT.spad" 22918 22928 23789 23794) (-38 "ALGEBRA.spad" 22751 22760 22874 22913) (-37 "ALGEBRA.spad" 22616 22627 22741 22746) (-36 "ALAGG.spad" 22128 22149 22584 22611) (-35 "AHYP.spad" 21509 21516 22118 22123) (-34 "AGG.spad" 19842 19849 21499 21504) (-33 "AGG.spad" 18139 18148 19798 19803) (-32 "AF.spad" 16567 16582 18071 18076) (-31 "ADDAST.spad" 16253 16260 16557 16562) (-30 "ACPLOT.spad" 14844 14851 16243 16248) (-29 "ACFS.spad" 12701 12710 14746 14839) (-28 "ACFS.spad" 10644 10655 12691 12696) (-27 "ACF.spad" 7398 7405 10546 10639) (-26 "ACF.spad" 4238 4247 7388 7393) (-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 2294535 2294540 2294545 2294550) (-2 NIL 2294515 2294520 2294525 2294530) (-1 NIL 2294495 2294500 2294505 2294510) (0 NIL 2294475 2294480 2294485 2294490) (-1329 "ZMOD.spad" 2294284 2294297 2294413 2294470) (-1328 "ZLINDEP.spad" 2293382 2293393 2294274 2294279) (-1327 "ZDSOLVE.spad" 2283342 2283364 2293372 2293377) (-1326 "YSTREAM.spad" 2282837 2282848 2283332 2283337) (-1325 "YDIAGRAM.spad" 2282471 2282480 2282827 2282832) (-1324 "XRPOLY.spad" 2281691 2281711 2282327 2282396) (-1323 "XPR.spad" 2279486 2279499 2281409 2281508) (-1322 "XPOLYC.spad" 2278805 2278821 2279412 2279481) (-1321 "XPOLY.spad" 2278360 2278371 2278661 2278730) (-1320 "XPBWPOLY.spad" 2276799 2276819 2278134 2278203) (-1319 "XFALG.spad" 2273847 2273863 2276725 2276794) (-1318 "XF.spad" 2272310 2272325 2273749 2273842) (-1317 "XF.spad" 2270753 2270770 2272194 2272199) (-1316 "XEXPPKG.spad" 2270012 2270038 2270743 2270748) (-1315 "XDPOLY.spad" 2269626 2269642 2269868 2269937) (-1314 "XALG.spad" 2269294 2269305 2269582 2269621) (-1313 "WUTSET.spad" 2265264 2265281 2268895 2268922) (-1312 "WP.spad" 2264471 2264515 2265122 2265189) (-1311 "WHILEAST.spad" 2264269 2264278 2264461 2264466) (-1310 "WHEREAST.spad" 2263940 2263949 2264259 2264264) (-1309 "WFFINTBS.spad" 2261603 2261625 2263930 2263935) (-1308 "WEIER.spad" 2259825 2259836 2261593 2261598) (-1307 "VSPACE.spad" 2259498 2259509 2259793 2259820) (-1306 "VSPACE.spad" 2259191 2259204 2259488 2259493) (-1305 "VOID.spad" 2258868 2258877 2259181 2259186) (-1304 "VIEWDEF.spad" 2254069 2254078 2258858 2258863) (-1303 "VIEW3D.spad" 2238030 2238039 2254059 2254064) (-1302 "VIEW2D.spad" 2225929 2225938 2238020 2238025) (-1301 "VIEW.spad" 2223649 2223658 2225919 2225924) (-1300 "VECTOR2.spad" 2222288 2222301 2223639 2223644) (-1299 "VECTOR.spad" 2220788 2220799 2221039 2221066) (-1298 "VECTCAT.spad" 2218700 2218711 2220756 2220783) (-1297 "VECTCAT.spad" 2216419 2216432 2218477 2218482) (-1296 "VARIABLE.spad" 2216199 2216214 2216409 2216414) (-1295 "UTYPE.spad" 2215843 2215852 2216189 2216194) (-1294 "UTSODETL.spad" 2215138 2215162 2215799 2215804) (-1293 "UTSODE.spad" 2213354 2213374 2215128 2215133) (-1292 "UTSCAT.spad" 2210833 2210849 2213252 2213349) (-1291 "UTSCAT.spad" 2207932 2207950 2210353 2210358) (-1290 "UTS2.spad" 2207527 2207562 2207922 2207927) (-1289 "UTS.spad" 2202405 2202433 2205925 2206022) (-1288 "URAGG.spad" 2197126 2197137 2202395 2202400) (-1287 "URAGG.spad" 2191811 2191824 2197082 2197087) (-1286 "UPXSSING.spad" 2189429 2189455 2190865 2190998) (-1285 "UPXSCONS.spad" 2187107 2187127 2187480 2187629) (-1284 "UPXSCCA.spad" 2185678 2185698 2186953 2187102) (-1283 "UPXSCCA.spad" 2184391 2184413 2185668 2185673) (-1282 "UPXSCAT.spad" 2182980 2182996 2184237 2184386) (-1281 "UPXS2.spad" 2182523 2182576 2182970 2182975) (-1280 "UPXS.spad" 2179738 2179766 2180574 2180723) (-1279 "UPSQFREE.spad" 2178152 2178166 2179728 2179733) (-1278 "UPSCAT.spad" 2175947 2175971 2178050 2178147) (-1277 "UPSCAT.spad" 2173427 2173453 2175532 2175537) (-1276 "UPOLYC2.spad" 2172898 2172917 2173417 2173422) (-1275 "UPOLYC.spad" 2167978 2167989 2172740 2172893) (-1274 "UPOLYC.spad" 2162944 2162957 2167708 2167713) (-1273 "UPMP.spad" 2161876 2161889 2162934 2162939) (-1272 "UPDIVP.spad" 2161441 2161455 2161866 2161871) (-1271 "UPDECOMP.spad" 2159702 2159716 2161431 2161436) (-1270 "UPCDEN.spad" 2158919 2158935 2159692 2159697) (-1269 "UP2.spad" 2158283 2158304 2158909 2158914) (-1268 "UP.spad" 2155311 2155326 2155698 2155851) (-1267 "UNISEG2.spad" 2154808 2154821 2155267 2155272) (-1266 "UNISEG.spad" 2154161 2154172 2154727 2154732) (-1265 "UNIFACT.spad" 2153264 2153276 2154151 2154156) (-1264 "ULSCONS.spad" 2144176 2144196 2144546 2144695) (-1263 "ULSCCAT.spad" 2141913 2141933 2144022 2144171) (-1262 "ULSCCAT.spad" 2139758 2139780 2141869 2141874) (-1261 "ULSCAT.spad" 2137998 2138014 2139604 2139753) (-1260 "ULS2.spad" 2137512 2137565 2137988 2137993) (-1259 "ULS.spad" 2127083 2127111 2128028 2128457) (-1258 "UINT8.spad" 2126960 2126969 2127073 2127078) (-1257 "UINT64.spad" 2126836 2126845 2126950 2126955) (-1256 "UINT32.spad" 2126712 2126721 2126826 2126831) (-1255 "UINT16.spad" 2126588 2126597 2126702 2126707) (-1254 "UFD.spad" 2125653 2125662 2126514 2126583) (-1253 "UFD.spad" 2124780 2124791 2125643 2125648) (-1252 "UDVO.spad" 2123661 2123670 2124770 2124775) (-1251 "UDPO.spad" 2121242 2121253 2123617 2123622) (-1250 "TYPEAST.spad" 2121161 2121170 2121232 2121237) (-1249 "TYPE.spad" 2121093 2121102 2121151 2121156) (-1248 "TWOFACT.spad" 2119745 2119760 2121083 2121088) (-1247 "TUPLE.spad" 2119236 2119247 2119641 2119646) (-1246 "TUBETOOL.spad" 2116103 2116112 2119226 2119231) (-1245 "TUBE.spad" 2114750 2114767 2116093 2116098) (-1244 "TSETCAT.spad" 2102821 2102838 2114718 2114745) (-1243 "TSETCAT.spad" 2090878 2090897 2102777 2102782) (-1242 "TS.spad" 2089471 2089487 2090437 2090534) (-1241 "TRMANIP.spad" 2083835 2083852 2089159 2089164) (-1240 "TRIMAT.spad" 2082798 2082823 2083825 2083830) (-1239 "TRIGMNIP.spad" 2081325 2081342 2082788 2082793) (-1238 "TRIGCAT.spad" 2080837 2080846 2081315 2081320) (-1237 "TRIGCAT.spad" 2080347 2080358 2080827 2080832) (-1236 "TREE.spad" 2078793 2078804 2079825 2079852) (-1235 "TRANFUN.spad" 2078632 2078641 2078783 2078788) (-1234 "TRANFUN.spad" 2078469 2078480 2078622 2078627) (-1233 "TOPSP.spad" 2078143 2078152 2078459 2078464) (-1232 "TOOLSIGN.spad" 2077806 2077817 2078133 2078138) (-1231 "TEXTFILE.spad" 2076367 2076376 2077796 2077801) (-1230 "TEX1.spad" 2075923 2075934 2076357 2076362) (-1229 "TEX.spad" 2073117 2073126 2075913 2075918) (-1228 "TEMUTL.spad" 2072672 2072681 2073107 2073112) (-1227 "TBCMPPK.spad" 2070773 2070796 2072662 2072667) (-1226 "TBAGG.spad" 2069831 2069854 2070753 2070768) (-1225 "TBAGG.spad" 2068897 2068922 2069821 2069826) (-1224 "TANEXP.spad" 2068305 2068316 2068887 2068892) (-1223 "TALGOP.spad" 2068029 2068040 2068295 2068300) (-1222 "TABLEAU.spad" 2067510 2067521 2068019 2068024) (-1221 "TABLE.spad" 2065443 2065466 2065713 2065740) (-1220 "TABLBUMP.spad" 2062222 2062233 2065433 2065438) (-1219 "SYSTEM.spad" 2061450 2061459 2062212 2062217) (-1218 "SYSSOLP.spad" 2058933 2058944 2061440 2061445) (-1217 "SYSPTR.spad" 2058832 2058841 2058923 2058928) (-1216 "SYSNNI.spad" 2058055 2058066 2058822 2058827) (-1215 "SYSINT.spad" 2057459 2057470 2058045 2058050) (-1214 "SYNTAX.spad" 2053793 2053802 2057449 2057454) (-1213 "SYMTAB.spad" 2051861 2051870 2053783 2053788) (-1212 "SYMS.spad" 2047884 2047893 2051851 2051856) (-1211 "SYMPOLY.spad" 2046863 2046874 2046945 2047072) (-1210 "SYMFUNC.spad" 2046364 2046375 2046853 2046858) (-1209 "SYMBOL.spad" 2043859 2043868 2046354 2046359) (-1208 "SWITCH.spad" 2040630 2040639 2043849 2043854) (-1207 "SUTS.spad" 2037609 2037637 2039028 2039125) (-1206 "SUPXS.spad" 2034811 2034839 2035660 2035809) (-1205 "SUPFRACF.spad" 2033916 2033934 2034801 2034806) (-1204 "SUP2.spad" 2033308 2033321 2033906 2033911) (-1203 "SUP.spad" 2029950 2029961 2030723 2030876) (-1202 "SUMRF.spad" 2028924 2028935 2029940 2029945) (-1201 "SUMFS.spad" 2028553 2028570 2028914 2028919) (-1200 "SULS.spad" 2018111 2018139 2019069 2019498) (-1199 "SUCHTAST.spad" 2017880 2017889 2018101 2018106) (-1198 "SUCH.spad" 2017570 2017585 2017870 2017875) (-1197 "SUBSPACE.spad" 2009701 2009716 2017560 2017565) (-1196 "SUBRESP.spad" 2008871 2008885 2009657 2009662) (-1195 "STTFNC.spad" 2005339 2005355 2008861 2008866) (-1194 "STTF.spad" 2001438 2001454 2005329 2005334) (-1193 "STTAYLOR.spad" 1994083 1994094 2001313 2001318) (-1192 "STRTBL.spad" 1992098 1992115 1992247 1992274) (-1191 "STRING.spad" 1990864 1990873 1991085 1991112) (-1190 "STREAM3.spad" 1990437 1990452 1990854 1990859) (-1189 "STREAM2.spad" 1989565 1989578 1990427 1990432) (-1188 "STREAM1.spad" 1989271 1989282 1989555 1989560) (-1187 "STREAM.spad" 1986057 1986068 1988664 1988679) (-1186 "STINPROD.spad" 1984993 1985009 1986047 1986052) (-1185 "STEPAST.spad" 1984227 1984236 1984983 1984988) (-1184 "STEP.spad" 1983436 1983445 1984217 1984222) (-1183 "STBL.spad" 1981484 1981512 1981651 1981666) (-1182 "STAGG.spad" 1980183 1980194 1981474 1981479) (-1181 "STAGG.spad" 1978880 1978893 1980173 1980178) (-1180 "STACK.spad" 1978108 1978119 1978358 1978385) (-1179 "SRING.spad" 1977868 1977877 1978098 1978103) (-1178 "SREGSET.spad" 1975567 1975584 1977469 1977496) (-1177 "SRDCMPK.spad" 1974144 1974164 1975557 1975562) (-1176 "SRAGG.spad" 1969327 1969336 1974112 1974139) (-1175 "SRAGG.spad" 1964530 1964541 1969317 1969322) (-1174 "SQMATRIX.spad" 1962025 1962043 1962941 1963028) (-1173 "SPLTREE.spad" 1956491 1956504 1961287 1961314) (-1172 "SPLNODE.spad" 1953111 1953124 1956481 1956486) (-1171 "SPFCAT.spad" 1951920 1951929 1953101 1953106) (-1170 "SPECOUT.spad" 1950472 1950481 1951910 1951915) (-1169 "SPADXPT.spad" 1942563 1942572 1950462 1950467) (-1168 "spad-parser.spad" 1942028 1942037 1942553 1942558) (-1167 "SPADAST.spad" 1941729 1941738 1942018 1942023) (-1166 "SPACEC.spad" 1925944 1925955 1941719 1941724) (-1165 "SPACE3.spad" 1925720 1925731 1925934 1925939) (-1164 "SORTPAK.spad" 1925269 1925282 1925676 1925681) (-1163 "SOLVETRA.spad" 1923032 1923043 1925259 1925264) (-1162 "SOLVESER.spad" 1921488 1921499 1923022 1923027) (-1161 "SOLVERAD.spad" 1917514 1917525 1921478 1921483) (-1160 "SOLVEFOR.spad" 1915976 1915994 1917504 1917509) (-1159 "SNTSCAT.spad" 1915576 1915593 1915944 1915971) (-1158 "SMTS.spad" 1913858 1913884 1915135 1915232) (-1157 "SMP.spad" 1911261 1911281 1911651 1911778) (-1156 "SMITH.spad" 1910106 1910131 1911251 1911256) (-1155 "SMATCAT.spad" 1908224 1908254 1910050 1910101) (-1154 "SMATCAT.spad" 1906274 1906306 1908102 1908107) (-1153 "SKAGG.spad" 1905243 1905254 1906242 1906269) (-1152 "SINT.spad" 1904183 1904192 1905109 1905238) (-1151 "SIMPAN.spad" 1903911 1903920 1904173 1904178) (-1150 "SIGNRF.spad" 1903029 1903040 1903901 1903906) (-1149 "SIGNEF.spad" 1902308 1902325 1903019 1903024) (-1148 "SIGAST.spad" 1901725 1901734 1902298 1902303) (-1147 "SIG.spad" 1901087 1901096 1901715 1901720) (-1146 "SHP.spad" 1899031 1899046 1901043 1901048) (-1145 "SHDP.spad" 1886386 1886413 1886903 1887002) (-1144 "SGROUP.spad" 1885994 1886003 1886376 1886381) (-1143 "SGROUP.spad" 1885600 1885611 1885984 1885989) (-1142 "SGCF.spad" 1878739 1878748 1885590 1885595) (-1141 "SFRTCAT.spad" 1877685 1877702 1878707 1878734) (-1140 "SFRGCD.spad" 1876748 1876768 1877675 1877680) (-1139 "SFQCMPK.spad" 1871561 1871581 1876738 1876743) (-1138 "SFORT.spad" 1871000 1871014 1871551 1871556) (-1137 "SEXOF.spad" 1870843 1870883 1870990 1870995) (-1136 "SEXCAT.spad" 1868671 1868711 1870833 1870838) (-1135 "SEX.spad" 1868563 1868572 1868661 1868666) (-1134 "SETMN.spad" 1867021 1867038 1868553 1868558) (-1133 "SETCAT.spad" 1866506 1866515 1867011 1867016) (-1132 "SETCAT.spad" 1865989 1866000 1866496 1866501) (-1131 "SETAGG.spad" 1862538 1862549 1865969 1865984) (-1130 "SETAGG.spad" 1859095 1859108 1862528 1862533) (-1129 "SET.spad" 1857368 1857379 1858465 1858504) (-1128 "SEQAST.spad" 1857071 1857080 1857358 1857363) (-1127 "SEGXCAT.spad" 1856227 1856240 1857061 1857066) (-1126 "SEGCAT.spad" 1855152 1855163 1856217 1856222) (-1125 "SEGBIND2.spad" 1854850 1854863 1855142 1855147) (-1124 "SEGBIND.spad" 1854608 1854619 1854797 1854802) (-1123 "SEGAST.spad" 1854338 1854347 1854598 1854603) (-1122 "SEG2.spad" 1853773 1853786 1854294 1854299) (-1121 "SEG.spad" 1853586 1853597 1853692 1853697) (-1120 "SDVAR.spad" 1852862 1852873 1853576 1853581) (-1119 "SDPOL.spad" 1850117 1850128 1850408 1850535) (-1118 "SCPKG.spad" 1848206 1848217 1850107 1850112) (-1117 "SCOPE.spad" 1847383 1847392 1848196 1848201) (-1116 "SCACHE.spad" 1846079 1846090 1847373 1847378) (-1115 "SASTCAT.spad" 1845988 1845997 1846069 1846074) (-1114 "SAOS.spad" 1845860 1845869 1845978 1845983) (-1113 "SAERFFC.spad" 1845573 1845593 1845850 1845855) (-1112 "SAEFACT.spad" 1845274 1845294 1845563 1845568) (-1111 "SAE.spad" 1842708 1842724 1843319 1843454) (-1110 "RURPK.spad" 1840367 1840383 1842698 1842703) (-1109 "RULESET.spad" 1839820 1839844 1840357 1840362) (-1108 "RULECOLD.spad" 1839672 1839685 1839810 1839815) (-1107 "RULE.spad" 1837920 1837944 1839662 1839667) (-1106 "RTVALUE.spad" 1837655 1837664 1837910 1837915) (-1105 "RSTRCAST.spad" 1837372 1837381 1837645 1837650) (-1104 "RSETGCD.spad" 1833814 1833834 1837362 1837367) (-1103 "RSETCAT.spad" 1823782 1823799 1833782 1833809) (-1102 "RSETCAT.spad" 1813770 1813789 1823772 1823777) (-1101 "RSDCMPK.spad" 1812270 1812290 1813760 1813765) (-1100 "RRCC.spad" 1810654 1810684 1812260 1812265) (-1099 "RRCC.spad" 1809036 1809068 1810644 1810649) (-1098 "RPTAST.spad" 1808738 1808747 1809026 1809031) (-1097 "RPOLCAT.spad" 1788242 1788257 1808606 1808733) (-1096 "RPOLCAT.spad" 1767441 1767458 1787807 1787812) (-1095 "ROUTINE.spad" 1762842 1762851 1765590 1765617) (-1094 "ROMAN.spad" 1762170 1762179 1762708 1762837) (-1093 "ROIRC.spad" 1761250 1761282 1762160 1762165) (-1092 "RNS.spad" 1760226 1760235 1761152 1761245) (-1091 "RNS.spad" 1759288 1759299 1760216 1760221) (-1090 "RNGBIND.spad" 1758448 1758462 1759243 1759248) (-1089 "RNG.spad" 1758183 1758192 1758438 1758443) (-1088 "RMODULE.spad" 1757964 1757975 1758173 1758178) (-1087 "RMCAT2.spad" 1757384 1757441 1757954 1757959) (-1086 "RMATRIX.spad" 1756154 1756173 1756497 1756536) (-1085 "RMATCAT.spad" 1751733 1751764 1756110 1756149) (-1084 "RMATCAT.spad" 1747202 1747235 1751581 1751586) (-1083 "RLINSET.spad" 1746906 1746917 1747192 1747197) (-1082 "RINTERP.spad" 1746794 1746814 1746896 1746901) (-1081 "RING.spad" 1746264 1746273 1746774 1746789) (-1080 "RING.spad" 1745742 1745753 1746254 1746259) (-1079 "RIDIST.spad" 1745134 1745143 1745732 1745737) (-1078 "RGCHAIN.spad" 1743655 1743671 1744549 1744576) (-1077 "RGBCSPC.spad" 1743444 1743456 1743645 1743650) (-1076 "RGBCMDL.spad" 1743006 1743018 1743434 1743439) (-1075 "RFFACTOR.spad" 1742468 1742479 1742996 1743001) (-1074 "RFFACT.spad" 1742203 1742215 1742458 1742463) (-1073 "RFDIST.spad" 1741199 1741208 1742193 1742198) (-1072 "RF.spad" 1738873 1738884 1741189 1741194) (-1071 "RETSOL.spad" 1738292 1738305 1738863 1738868) (-1070 "RETRACT.spad" 1737720 1737731 1738282 1738287) (-1069 "RETRACT.spad" 1737146 1737159 1737710 1737715) (-1068 "RETAST.spad" 1736958 1736967 1737136 1737141) (-1067 "RESULT.spad" 1734520 1734529 1735107 1735134) (-1066 "RESRING.spad" 1733867 1733914 1734458 1734515) (-1065 "RESLATC.spad" 1733191 1733202 1733857 1733862) (-1064 "REPSQ.spad" 1732922 1732933 1733181 1733186) (-1063 "REPDB.spad" 1732629 1732640 1732912 1732917) (-1062 "REP2.spad" 1722343 1722354 1732471 1732476) (-1061 "REP1.spad" 1716563 1716574 1722293 1722298) (-1060 "REP.spad" 1714117 1714126 1716553 1716558) (-1059 "REGSET.spad" 1711909 1711926 1713718 1713745) (-1058 "REF.spad" 1711244 1711255 1711864 1711869) (-1057 "REDORDER.spad" 1710450 1710467 1711234 1711239) (-1056 "RECLOS.spad" 1709209 1709229 1709913 1710006) (-1055 "REALSOLV.spad" 1708349 1708358 1709199 1709204) (-1054 "REAL0Q.spad" 1705647 1705662 1708339 1708344) (-1053 "REAL0.spad" 1702491 1702506 1705637 1705642) (-1052 "REAL.spad" 1702363 1702372 1702481 1702486) (-1051 "RDUCEAST.spad" 1702084 1702093 1702353 1702358) (-1050 "RDIV.spad" 1701739 1701764 1702074 1702079) (-1049 "RDIST.spad" 1701306 1701317 1701729 1701734) (-1048 "RDETRS.spad" 1700170 1700188 1701296 1701301) (-1047 "RDETR.spad" 1698309 1698327 1700160 1700165) (-1046 "RDEEFS.spad" 1697408 1697425 1698299 1698304) (-1045 "RDEEF.spad" 1696418 1696435 1697398 1697403) (-1044 "RCFIELD.spad" 1693636 1693645 1696320 1696413) (-1043 "RCFIELD.spad" 1690940 1690951 1693626 1693631) (-1042 "RCAGG.spad" 1688876 1688887 1690930 1690935) (-1041 "RCAGG.spad" 1686739 1686752 1688795 1688800) (-1040 "RATRET.spad" 1686099 1686110 1686729 1686734) (-1039 "RATFACT.spad" 1685791 1685803 1686089 1686094) (-1038 "RANDSRC.spad" 1685110 1685119 1685781 1685786) (-1037 "RADUTIL.spad" 1684866 1684875 1685100 1685105) (-1036 "RADIX.spad" 1681645 1681659 1683191 1683284) (-1035 "RADFF.spad" 1679348 1679385 1679467 1679623) (-1034 "RADCAT.spad" 1678943 1678952 1679338 1679343) (-1033 "RADCAT.spad" 1678536 1678547 1678933 1678938) (-1032 "QUEUE.spad" 1677755 1677766 1678014 1678041) (-1031 "QUATCT2.spad" 1677375 1677394 1677745 1677750) (-1030 "QUATCAT.spad" 1675545 1675556 1677305 1677370) (-1029 "QUATCAT.spad" 1673463 1673476 1675225 1675230) (-1028 "QUAT.spad" 1671915 1671926 1672258 1672323) (-1027 "QUAGG.spad" 1670748 1670759 1671883 1671910) (-1026 "QQUTAST.spad" 1670516 1670525 1670738 1670743) (-1025 "QFORM.spad" 1670134 1670149 1670506 1670511) (-1024 "QFCAT2.spad" 1669826 1669843 1670124 1670129) (-1023 "QFCAT.spad" 1668528 1668539 1669728 1669821) (-1022 "QFCAT.spad" 1666812 1666825 1668014 1668019) (-1021 "QEQUAT.spad" 1666370 1666379 1666802 1666807) (-1020 "QCMPACK.spad" 1661284 1661304 1666360 1666365) (-1019 "QALGSET2.spad" 1659279 1659298 1661274 1661279) (-1018 "QALGSET.spad" 1655381 1655414 1659193 1659198) (-1017 "PWFFINTB.spad" 1652796 1652818 1655371 1655376) (-1016 "PUSHVAR.spad" 1652134 1652154 1652786 1652791) (-1015 "PTRANFN.spad" 1648269 1648280 1652124 1652129) (-1014 "PTPACK.spad" 1645356 1645367 1648259 1648264) (-1013 "PTFUNC2.spad" 1645178 1645193 1645346 1645351) (-1012 "PTCAT.spad" 1644432 1644443 1645146 1645173) (-1011 "PSQFR.spad" 1643746 1643771 1644422 1644427) (-1010 "PSEUDLIN.spad" 1642631 1642642 1643736 1643741) (-1009 "PSETPK.spad" 1629335 1629352 1642509 1642514) (-1008 "PSETCAT.spad" 1623734 1623758 1629315 1629330) (-1007 "PSETCAT.spad" 1618107 1618133 1623690 1623695) (-1006 "PSCURVE.spad" 1617105 1617114 1618097 1618102) (-1005 "PSCAT.spad" 1615887 1615917 1617003 1617100) (-1004 "PSCAT.spad" 1614759 1614791 1615877 1615882) (-1003 "PRTITION.spad" 1613456 1613465 1614749 1614754) (-1002 "PRTDAST.spad" 1613174 1613183 1613446 1613451) (-1001 "PRS.spad" 1602791 1602809 1613130 1613135) (-1000 "PRQAGG.spad" 1602225 1602236 1602759 1602786) (-999 "PROPLOG.spad" 1601829 1601837 1602215 1602220) (-998 "PROPFUN2.spad" 1601452 1601465 1601819 1601824) (-997 "PROPFUN1.spad" 1600858 1600869 1601442 1601447) (-996 "PROPFRML.spad" 1599426 1599437 1600848 1600853) (-995 "PROPERTY.spad" 1598922 1598930 1599416 1599421) (-994 "PRODUCT.spad" 1596604 1596616 1596888 1596943) (-993 "PRINT.spad" 1596356 1596364 1596594 1596599) (-992 "PRIMES.spad" 1594617 1594627 1596346 1596351) (-991 "PRIMELT.spad" 1592738 1592752 1594607 1594612) (-990 "PRIMCAT.spad" 1592381 1592389 1592728 1592733) (-989 "PRIMARR2.spad" 1591148 1591160 1592371 1592376) (-988 "PRIMARR.spad" 1589987 1589997 1590157 1590184) (-987 "PREASSOC.spad" 1589369 1589381 1589977 1589982) (-986 "PR.spad" 1587734 1587746 1588433 1588560) (-985 "PPCURVE.spad" 1586871 1586879 1587724 1587729) (-984 "PORTNUM.spad" 1586662 1586670 1586861 1586866) (-983 "POLYROOT.spad" 1585511 1585533 1586618 1586623) (-982 "POLYLIFT.spad" 1584776 1584799 1585501 1585506) (-981 "POLYCATQ.spad" 1582902 1582924 1584766 1584771) (-980 "POLYCAT.spad" 1576404 1576425 1582770 1582897) (-979 "POLYCAT.spad" 1569202 1569225 1575570 1575575) (-978 "POLY2UP.spad" 1568654 1568668 1569192 1569197) (-977 "POLY2.spad" 1568251 1568263 1568644 1568649) (-976 "POLY.spad" 1565514 1565524 1566029 1566156) (-975 "POLUTIL.spad" 1564479 1564508 1565470 1565475) (-974 "POLTOPOL.spad" 1563227 1563242 1564469 1564474) (-973 "POINT.spad" 1561891 1561901 1561978 1562005) (-972 "PNTHEORY.spad" 1558593 1558601 1561881 1561886) (-971 "PMTOOLS.spad" 1557368 1557382 1558583 1558588) (-970 "PMSYM.spad" 1556917 1556927 1557358 1557363) (-969 "PMQFCAT.spad" 1556508 1556522 1556907 1556912) (-968 "PMPREDFS.spad" 1555970 1555992 1556498 1556503) (-967 "PMPRED.spad" 1555457 1555471 1555960 1555965) (-966 "PMPLCAT.spad" 1554534 1554552 1555386 1555391) (-965 "PMLSAGG.spad" 1554119 1554133 1554524 1554529) (-964 "PMKERNEL.spad" 1553698 1553710 1554109 1554114) (-963 "PMINS.spad" 1553278 1553288 1553688 1553693) (-962 "PMFS.spad" 1552855 1552873 1553268 1553273) (-961 "PMDOWN.spad" 1552145 1552159 1552845 1552850) (-960 "PMASSFS.spad" 1551120 1551136 1552135 1552140) (-959 "PMASS.spad" 1550138 1550146 1551110 1551115) (-958 "PLOTTOOL.spad" 1549918 1549926 1550128 1550133) (-957 "PLOT3D.spad" 1546382 1546390 1549908 1549913) (-956 "PLOT1.spad" 1545555 1545565 1546372 1546377) (-955 "PLOT.spad" 1540478 1540486 1545545 1545550) (-954 "PLEQN.spad" 1527880 1527907 1540468 1540473) (-953 "PINTERPA.spad" 1527664 1527680 1527870 1527875) (-952 "PINTERP.spad" 1527286 1527305 1527654 1527659) (-951 "PID.spad" 1526260 1526268 1527212 1527281) (-950 "PICOERCE.spad" 1525917 1525927 1526250 1526255) (-949 "PI.spad" 1525534 1525542 1525891 1525912) (-948 "PGROEB.spad" 1524143 1524157 1525524 1525529) (-947 "PGE.spad" 1515816 1515824 1524133 1524138) (-946 "PGCD.spad" 1514770 1514787 1515806 1515811) (-945 "PFRPAC.spad" 1513919 1513929 1514760 1514765) (-944 "PFR.spad" 1510622 1510632 1513821 1513914) (-943 "PFOTOOLS.spad" 1509880 1509896 1510612 1510617) (-942 "PFOQ.spad" 1509250 1509268 1509870 1509875) (-941 "PFO.spad" 1508669 1508696 1509240 1509245) (-940 "PFECAT.spad" 1506379 1506387 1508595 1508664) (-939 "PFECAT.spad" 1504117 1504127 1506335 1506340) (-938 "PFBRU.spad" 1502005 1502017 1504107 1504112) (-937 "PFBR.spad" 1499565 1499588 1501995 1502000) (-936 "PF.spad" 1499139 1499151 1499370 1499463) (-935 "PERMGRP.spad" 1493909 1493919 1499129 1499134) (-934 "PERMCAT.spad" 1492570 1492580 1493889 1493904) (-933 "PERMAN.spad" 1491126 1491140 1492560 1492565) (-932 "PERM.spad" 1486933 1486943 1490956 1490971) (-931 "PENDTREE.spad" 1486153 1486163 1486433 1486438) (-930 "PDSPC.spad" 1484966 1484976 1486143 1486148) (-929 "PDSPC.spad" 1483777 1483789 1484956 1484961) (-928 "PDRING.spad" 1483619 1483629 1483757 1483772) (-927 "PDMOD.spad" 1483435 1483447 1483587 1483614) (-926 "PDEPROB.spad" 1482450 1482458 1483425 1483430) (-925 "PDEPACK.spad" 1476586 1476594 1482440 1482445) (-924 "PDECOMP.spad" 1476056 1476073 1476576 1476581) (-923 "PDECAT.spad" 1474412 1474420 1476046 1476051) (-922 "PDDOM.spad" 1473850 1473863 1474402 1474407) (-921 "PDDOM.spad" 1473286 1473301 1473840 1473845) (-920 "PCOMP.spad" 1473139 1473152 1473276 1473281) (-919 "PBWLB.spad" 1471735 1471752 1473129 1473134) (-918 "PATTERN2.spad" 1471473 1471485 1471725 1471730) (-917 "PATTERN1.spad" 1469817 1469833 1471463 1471468) (-916 "PATTERN.spad" 1464388 1464398 1469807 1469812) (-915 "PATRES2.spad" 1464060 1464074 1464378 1464383) (-914 "PATRES.spad" 1461643 1461655 1464050 1464055) (-913 "PATMATCH.spad" 1459831 1459862 1461342 1461347) (-912 "PATMAB.spad" 1459260 1459270 1459821 1459826) (-911 "PATLRES.spad" 1458346 1458360 1459250 1459255) (-910 "PATAB.spad" 1458110 1458120 1458336 1458341) (-909 "PARTPERM.spad" 1456166 1456174 1458100 1458105) (-908 "PARSURF.spad" 1455600 1455628 1456156 1456161) (-907 "PARSU2.spad" 1455397 1455413 1455590 1455595) (-906 "script-parser.spad" 1454917 1454925 1455387 1455392) (-905 "PARSCURV.spad" 1454351 1454379 1454907 1454912) (-904 "PARSC2.spad" 1454142 1454158 1454341 1454346) (-903 "PARPCURV.spad" 1453604 1453632 1454132 1454137) (-902 "PARPC2.spad" 1453395 1453411 1453594 1453599) (-901 "PARAMAST.spad" 1452523 1452531 1453385 1453390) (-900 "PAN2EXPR.spad" 1451935 1451943 1452513 1452518) (-899 "PALETTE.spad" 1450921 1450929 1451925 1451930) (-898 "PAIR.spad" 1449928 1449941 1450497 1450502) (-897 "PADICRC.spad" 1447132 1447150 1448295 1448388) (-896 "PADICRAT.spad" 1444991 1445003 1445204 1445297) (-895 "PADICCT.spad" 1443540 1443552 1444917 1444986) (-894 "PADIC.spad" 1443243 1443255 1443466 1443535) (-893 "PADEPAC.spad" 1441932 1441951 1443233 1443238) (-892 "PADE.spad" 1440684 1440700 1441922 1441927) (-891 "OWP.spad" 1439932 1439962 1440542 1440609) (-890 "OVERSET.spad" 1439505 1439513 1439922 1439927) (-889 "OVAR.spad" 1439286 1439309 1439495 1439500) (-888 "OUTFORM.spad" 1428694 1428702 1439276 1439281) (-887 "OUTBFILE.spad" 1428128 1428136 1428684 1428689) (-886 "OUTBCON.spad" 1427198 1427206 1428118 1428123) (-885 "OUTBCON.spad" 1426266 1426276 1427188 1427193) (-884 "OUT.spad" 1425384 1425392 1426256 1426261) (-883 "OSI.spad" 1424859 1424867 1425374 1425379) (-882 "OSGROUP.spad" 1424777 1424785 1424849 1424854) (-881 "ORTHPOL.spad" 1423256 1423266 1424688 1424693) (-880 "OREUP.spad" 1422700 1422728 1422927 1422966) (-879 "ORESUP.spad" 1421992 1422016 1422371 1422410) (-878 "OREPCTO.spad" 1419881 1419893 1421912 1421917) (-877 "OREPCAT.spad" 1414068 1414078 1419837 1419876) (-876 "OREPCAT.spad" 1408145 1408157 1413916 1413921) (-875 "ORDTYPE.spad" 1407382 1407390 1408135 1408140) (-874 "ORDTYPE.spad" 1406617 1406627 1407372 1407377) (-873 "ORDSTRCT.spad" 1406387 1406402 1406550 1406555) (-872 "ORDSET.spad" 1406087 1406095 1406377 1406382) (-871 "ORDRING.spad" 1405904 1405912 1406067 1406082) (-870 "ORDMON.spad" 1405759 1405767 1405894 1405899) (-869 "ORDFUNS.spad" 1404891 1404907 1405749 1405754) (-868 "ORDFIN.spad" 1404711 1404719 1404881 1404886) (-867 "ORDCOMP2.spad" 1404004 1404016 1404701 1404706) (-866 "ORDCOMP.spad" 1402457 1402467 1403539 1403568) (-865 "OPTPROB.spad" 1401095 1401103 1402447 1402452) (-864 "OPTPACK.spad" 1393504 1393512 1401085 1401090) (-863 "OPTCAT.spad" 1391183 1391191 1393494 1393499) (-862 "OPSIG.spad" 1390845 1390853 1391173 1391178) (-861 "OPQUERY.spad" 1390426 1390434 1390835 1390840) (-860 "OPERCAT.spad" 1389892 1389902 1390416 1390421) (-859 "OPERCAT.spad" 1389356 1389368 1389882 1389887) (-858 "OP.spad" 1389098 1389108 1389178 1389245) (-857 "ONECOMP2.spad" 1388522 1388534 1389088 1389093) (-856 "ONECOMP.spad" 1387255 1387265 1388057 1388086) (-855 "OMSERVER.spad" 1386261 1386269 1387245 1387250) (-854 "OMSAGG.spad" 1386049 1386059 1386217 1386256) (-853 "OMPKG.spad" 1384681 1384689 1386039 1386044) (-852 "OMLO.spad" 1384114 1384126 1384567 1384606) (-851 "OMEXPR.spad" 1383948 1383958 1384104 1384109) (-850 "OMERRK.spad" 1382998 1383006 1383938 1383943) (-849 "OMERR.spad" 1382543 1382551 1382988 1382993) (-848 "OMENC.spad" 1381895 1381903 1382533 1382538) (-847 "OMDEV.spad" 1376228 1376236 1381885 1381890) (-846 "OMCONN.spad" 1375637 1375645 1376218 1376223) (-845 "OM.spad" 1374634 1374642 1375627 1375632) (-844 "OINTDOM.spad" 1374397 1374405 1374560 1374629) (-843 "OFMONOID.spad" 1372536 1372546 1374353 1374358) (-842 "ODVAR.spad" 1371797 1371807 1372526 1372531) (-841 "ODR.spad" 1371441 1371467 1371609 1371758) (-840 "ODPOL.spad" 1368652 1368662 1368992 1369119) (-839 "ODP.spad" 1356151 1356171 1356524 1356623) (-838 "ODETOOLS.spad" 1354800 1354819 1356141 1356146) (-837 "ODESYS.spad" 1352494 1352511 1354790 1354795) (-836 "ODERTRIC.spad" 1348527 1348544 1352451 1352456) (-835 "ODERED.spad" 1347926 1347950 1348517 1348522) (-834 "ODERAT.spad" 1345557 1345574 1347916 1347921) (-833 "ODEPRRIC.spad" 1342650 1342672 1345547 1345552) (-832 "ODEPROB.spad" 1341907 1341915 1342640 1342645) (-831 "ODEPRIM.spad" 1339305 1339327 1341897 1341902) (-830 "ODEPAL.spad" 1338691 1338715 1339295 1339300) (-829 "ODEPACK.spad" 1325421 1325429 1338681 1338686) (-828 "ODEINT.spad" 1324856 1324872 1325411 1325416) (-827 "ODEIFTBL.spad" 1322259 1322267 1324846 1324851) (-826 "ODEEF.spad" 1317750 1317766 1322249 1322254) (-825 "ODECONST.spad" 1317295 1317313 1317740 1317745) (-824 "ODECAT.spad" 1315893 1315901 1317285 1317290) (-823 "OCTCT2.spad" 1315531 1315552 1315883 1315888) (-822 "OCT.spad" 1313619 1313629 1314333 1314372) (-821 "OCAMON.spad" 1313467 1313475 1313609 1313614) (-820 "OC.spad" 1311263 1311273 1313423 1313462) (-819 "OC.spad" 1308781 1308793 1310943 1310948) (-818 "OASGP.spad" 1308596 1308604 1308771 1308776) (-817 "OAMONS.spad" 1308118 1308126 1308586 1308591) (-816 "OAMON.spad" 1307876 1307884 1308108 1308113) (-815 "OAMON.spad" 1307632 1307642 1307866 1307871) (-814 "OAGROUP.spad" 1307170 1307178 1307622 1307627) (-813 "OAGROUP.spad" 1306706 1306716 1307160 1307165) (-812 "NUMTUBE.spad" 1306297 1306313 1306696 1306701) (-811 "NUMQUAD.spad" 1294273 1294281 1306287 1306292) (-810 "NUMODE.spad" 1285625 1285633 1294263 1294268) (-809 "NUMINT.spad" 1283191 1283199 1285615 1285620) (-808 "NUMFMT.spad" 1282031 1282039 1283181 1283186) (-807 "NUMERIC.spad" 1274145 1274155 1281836 1281841) (-806 "NTSCAT.spad" 1272653 1272669 1274113 1274140) (-805 "NTPOLFN.spad" 1272198 1272208 1272564 1272569) (-804 "NSUP2.spad" 1271590 1271602 1272188 1272193) (-803 "NSUP.spad" 1264585 1264595 1269005 1269158) (-802 "NSMP.spad" 1260684 1260703 1260976 1261103) (-801 "NREP.spad" 1259086 1259100 1260674 1260679) (-800 "NPCOEF.spad" 1258332 1258352 1259076 1259081) (-799 "NORMRETR.spad" 1257930 1257969 1258322 1258327) (-798 "NORMPK.spad" 1255872 1255891 1257920 1257925) (-797 "NORMMA.spad" 1255560 1255586 1255862 1255867) (-796 "NONE1.spad" 1255236 1255246 1255550 1255555) (-795 "NONE.spad" 1254977 1254985 1255226 1255231) (-794 "NODE1.spad" 1254464 1254480 1254967 1254972) (-793 "NNI.spad" 1253359 1253367 1254438 1254459) (-792 "NLINSOL.spad" 1251985 1251995 1253349 1253354) (-791 "NIPROB.spad" 1250526 1250534 1251975 1251980) (-790 "NFINTBAS.spad" 1248086 1248103 1250516 1250521) (-789 "NETCLT.spad" 1248060 1248071 1248076 1248081) (-788 "NCODIV.spad" 1246284 1246300 1248050 1248055) (-787 "NCNTFRAC.spad" 1245926 1245940 1246274 1246279) (-786 "NCEP.spad" 1244092 1244106 1245916 1245921) (-785 "NASRING.spad" 1243696 1243704 1244082 1244087) (-784 "NASRING.spad" 1243298 1243308 1243686 1243691) (-783 "NARNG.spad" 1242698 1242706 1243288 1243293) (-782 "NARNG.spad" 1242096 1242106 1242688 1242693) (-781 "NAGSP.spad" 1241173 1241181 1242086 1242091) (-780 "NAGS.spad" 1230890 1230898 1241163 1241168) (-779 "NAGF07.spad" 1229321 1229329 1230880 1230885) (-778 "NAGF04.spad" 1223723 1223731 1229311 1229316) (-777 "NAGF02.spad" 1217816 1217824 1223713 1223718) (-776 "NAGF01.spad" 1213585 1213593 1217806 1217811) (-775 "NAGE04.spad" 1207293 1207301 1213575 1213580) (-774 "NAGE02.spad" 1197945 1197953 1207283 1207288) (-773 "NAGE01.spad" 1193939 1193947 1197935 1197940) (-772 "NAGD03.spad" 1191935 1191943 1193929 1193934) (-771 "NAGD02.spad" 1184666 1184674 1191925 1191930) (-770 "NAGD01.spad" 1178951 1178959 1184656 1184661) (-769 "NAGC06.spad" 1174818 1174826 1178941 1178946) (-768 "NAGC05.spad" 1173311 1173319 1174808 1174813) (-767 "NAGC02.spad" 1172586 1172594 1173301 1173306) (-766 "NAALG.spad" 1172151 1172161 1172554 1172581) (-765 "NAALG.spad" 1171736 1171748 1172141 1172146) (-764 "MULTSQFR.spad" 1168694 1168711 1171726 1171731) (-763 "MULTFACT.spad" 1168077 1168094 1168684 1168689) (-762 "MTSCAT.spad" 1166171 1166192 1167975 1168072) (-761 "MTHING.spad" 1165830 1165840 1166161 1166166) (-760 "MSYSCMD.spad" 1165264 1165272 1165820 1165825) (-759 "MSETAGG.spad" 1165109 1165119 1165232 1165259) (-758 "MSET.spad" 1163022 1163032 1164770 1164809) (-757 "MRING.spad" 1159999 1160011 1162730 1162797) (-756 "MRF2.spad" 1159561 1159575 1159989 1159994) (-755 "MRATFAC.spad" 1159107 1159124 1159551 1159556) (-754 "MPRFF.spad" 1157147 1157166 1159097 1159102) (-753 "MPOLY.spad" 1154546 1154561 1154905 1155032) (-752 "MPCPF.spad" 1153810 1153829 1154536 1154541) (-751 "MPC3.spad" 1153627 1153667 1153800 1153805) (-750 "MPC2.spad" 1153280 1153313 1153617 1153622) (-749 "MONOTOOL.spad" 1151631 1151648 1153270 1153275) (-748 "MONOID.spad" 1150950 1150958 1151621 1151626) (-747 "MONOID.spad" 1150267 1150277 1150940 1150945) (-746 "MONOGEN.spad" 1149015 1149028 1150127 1150262) (-745 "MONOGEN.spad" 1147785 1147800 1148899 1148904) (-744 "MONADWU.spad" 1145863 1145871 1147775 1147780) (-743 "MONADWU.spad" 1143939 1143949 1145853 1145858) (-742 "MONAD.spad" 1143099 1143107 1143929 1143934) (-741 "MONAD.spad" 1142257 1142267 1143089 1143094) (-740 "MOEBIUS.spad" 1140993 1141007 1142237 1142252) (-739 "MODULE.spad" 1140863 1140873 1140961 1140988) (-738 "MODULE.spad" 1140753 1140765 1140853 1140858) (-737 "MODRING.spad" 1140088 1140127 1140733 1140748) (-736 "MODOP.spad" 1138745 1138757 1139910 1139977) (-735 "MODMONOM.spad" 1138476 1138494 1138735 1138740) (-734 "MODMON.spad" 1135100 1135116 1135819 1135972) (-733 "MODFIELD.spad" 1134462 1134501 1135002 1135095) (-732 "MMLFORM.spad" 1133322 1133330 1134452 1134457) (-731 "MMAP.spad" 1133064 1133098 1133312 1133317) (-730 "MLO.spad" 1131523 1131533 1133020 1133059) (-729 "MLIFT.spad" 1130135 1130152 1131513 1131518) (-728 "MKUCFUNC.spad" 1129670 1129688 1130125 1130130) (-727 "MKRECORD.spad" 1129258 1129271 1129660 1129665) (-726 "MKFUNC.spad" 1128665 1128675 1129248 1129253) (-725 "MKFLCFN.spad" 1127633 1127643 1128655 1128660) (-724 "MKBCFUNC.spad" 1127128 1127146 1127623 1127628) (-723 "MINT.spad" 1126567 1126575 1127030 1127123) (-722 "MHROWRED.spad" 1125078 1125088 1126557 1126562) (-721 "MFLOAT.spad" 1123598 1123606 1124968 1125073) (-720 "MFINFACT.spad" 1122998 1123020 1123588 1123593) (-719 "MESH.spad" 1120788 1120796 1122988 1122993) (-718 "MDDFACT.spad" 1119007 1119017 1120778 1120783) (-717 "MDAGG.spad" 1118298 1118308 1118987 1119002) (-716 "MCMPLX.spad" 1113663 1113671 1114277 1114478) (-715 "MCDEN.spad" 1112873 1112885 1113653 1113658) (-714 "MCALCFN.spad" 1109971 1109997 1112863 1112868) (-713 "MAYBE.spad" 1109271 1109282 1109961 1109966) (-712 "MATSTOR.spad" 1106587 1106597 1109261 1109266) (-711 "MATRIX.spad" 1105153 1105163 1105637 1105664) (-710 "MATLIN.spad" 1102521 1102545 1105037 1105042) (-709 "MATCAT2.spad" 1101803 1101851 1102511 1102516) (-708 "MATCAT.spad" 1093365 1093387 1101771 1101798) (-707 "MATCAT.spad" 1084799 1084823 1093207 1093212) (-706 "MAPPKG3.spad" 1083714 1083728 1084789 1084794) (-705 "MAPPKG2.spad" 1083052 1083064 1083704 1083709) (-704 "MAPPKG1.spad" 1081880 1081890 1083042 1083047) (-703 "MAPPAST.spad" 1081219 1081227 1081870 1081875) (-702 "MAPHACK3.spad" 1081031 1081045 1081209 1081214) (-701 "MAPHACK2.spad" 1080800 1080812 1081021 1081026) (-700 "MAPHACK1.spad" 1080444 1080454 1080790 1080795) (-699 "MAGMA.spad" 1078250 1078267 1080434 1080439) (-698 "MACROAST.spad" 1077845 1077853 1078240 1078245) (-697 "M3D.spad" 1075430 1075440 1077088 1077093) (-696 "LZSTAGG.spad" 1072684 1072694 1075420 1075425) (-695 "LZSTAGG.spad" 1069936 1069948 1072674 1072679) (-694 "LWORD.spad" 1066681 1066698 1069926 1069931) (-693 "LSTAST.spad" 1066465 1066473 1066671 1066676) (-692 "LSQM.spad" 1064577 1064591 1064971 1065022) (-691 "LSPP.spad" 1064112 1064129 1064567 1064572) (-690 "LSMP1.spad" 1061938 1061952 1064102 1064107) (-689 "LSMP.spad" 1060788 1060816 1061928 1061933) (-688 "LSAGG.spad" 1060457 1060467 1060756 1060783) (-687 "LSAGG.spad" 1060146 1060158 1060447 1060452) (-686 "LPOLY.spad" 1059108 1059127 1060002 1060071) (-685 "LPEFRAC.spad" 1058379 1058389 1059098 1059103) (-684 "LOGIC.spad" 1057981 1057989 1058369 1058374) (-683 "LOGIC.spad" 1057581 1057591 1057971 1057976) (-682 "LODOOPS.spad" 1056511 1056523 1057571 1057576) (-681 "LODOF.spad" 1055557 1055574 1056468 1056473) (-680 "LODOCAT.spad" 1054223 1054233 1055513 1055552) (-679 "LODOCAT.spad" 1052887 1052899 1054179 1054184) (-678 "LODO2.spad" 1052151 1052163 1052558 1052597) (-677 "LODO1.spad" 1051542 1051552 1051822 1051861) (-676 "LODO.spad" 1050917 1050933 1051213 1051252) (-675 "LODEEF.spad" 1049719 1049737 1050907 1050912) (-674 "LO.spad" 1049120 1049134 1049653 1049680) (-673 "LNAGG.spad" 1045307 1045317 1049110 1049115) (-672 "LNAGG.spad" 1041458 1041470 1045263 1045268) (-671 "LMOPS.spad" 1038226 1038243 1041448 1041453) (-670 "LMODULE.spad" 1038010 1038020 1038216 1038221) (-669 "LMDICT.spad" 1037181 1037191 1037429 1037456) (-668 "LLINSET.spad" 1036888 1036898 1037171 1037176) (-667 "LITERAL.spad" 1036794 1036805 1036878 1036883) (-666 "LIST3.spad" 1036105 1036119 1036784 1036789) (-665 "LIST2MAP.spad" 1033032 1033044 1036095 1036100) (-664 "LIST2.spad" 1031734 1031746 1033022 1033027) (-663 "LIST.spad" 1029295 1029305 1030707 1030734) (-662 "LINSET.spad" 1029074 1029084 1029285 1029290) (-661 "LINFORM.spad" 1028537 1028549 1029042 1029069) (-660 "LINEXP.spad" 1027280 1027290 1028527 1028532) (-659 "LINELT.spad" 1026651 1026663 1027163 1027190) (-658 "LINDEP.spad" 1025500 1025512 1026563 1026568) (-657 "LINBASIS.spad" 1025136 1025151 1025490 1025495) (-656 "LIMITRF.spad" 1023064 1023074 1025126 1025131) (-655 "LIMITPS.spad" 1021967 1021980 1023054 1023059) (-654 "LIECAT.spad" 1021451 1021461 1021893 1021962) (-653 "LIECAT.spad" 1020963 1020975 1021407 1021412) (-652 "LIE.spad" 1018958 1018970 1020232 1020377) (-651 "LIB.spad" 1016673 1016681 1017119 1017134) (-650 "LGROBP.spad" 1014026 1014045 1016663 1016668) (-649 "LFCAT.spad" 1013085 1013093 1014016 1014021) (-648 "LF.spad" 1012040 1012056 1013075 1013080) (-647 "LEXTRIPK.spad" 1007663 1007678 1012030 1012035) (-646 "LEXP.spad" 1005682 1005709 1007643 1007658) (-645 "LETAST.spad" 1005381 1005389 1005672 1005677) (-644 "LEADCDET.spad" 1003787 1003804 1005371 1005376) (-643 "LAZM3PK.spad" 1002531 1002553 1003777 1003782) (-642 "LAUPOL.spad" 1001116 1001129 1002016 1002085) (-641 "LAPLACE.spad" 1000699 1000715 1001106 1001111) (-640 "LALG.spad" 1000475 1000485 1000679 1000694) (-639 "LALG.spad" 1000259 1000271 1000465 1000470) (-638 "LA.spad" 999699 999713 1000181 1000220) (-637 "KVTFROM.spad" 999442 999452 999689 999694) (-636 "KTVLOGIC.spad" 998986 998994 999432 999437) (-635 "KRCFROM.spad" 998732 998742 998976 998981) (-634 "KOVACIC.spad" 997463 997480 998722 998727) (-633 "KONVERT.spad" 997185 997195 997453 997458) (-632 "KOERCE.spad" 996922 996932 997175 997180) (-631 "KERNEL2.spad" 996625 996637 996912 996917) (-630 "KERNEL.spad" 995265 995275 996394 996399) (-629 "KDAGG.spad" 994374 994396 995245 995260) (-628 "KDAGG.spad" 993491 993515 994364 994369) (-627 "KAFILE.spad" 992321 992337 992556 992583) (-626 "JVMOP.spad" 992234 992242 992311 992316) (-625 "JVMMDACC.spad" 991288 991296 992224 992229) (-624 "JVMFDACC.spad" 990604 990612 991278 991283) (-623 "JVMCSTTG.spad" 989333 989341 990594 990599) (-622 "JVMCFACC.spad" 988779 988787 989323 989328) (-621 "JVMBCODE.spad" 988690 988698 988769 988774) (-620 "JORDAN.spad" 986498 986510 987959 988104) (-619 "JOINAST.spad" 986200 986208 986488 986493) (-618 "IXAGG.spad" 984333 984357 986190 986195) (-617 "IXAGG.spad" 982321 982347 984180 984185) (-616 "IVECTOR.spad" 980917 980932 981072 981099) (-615 "ITUPLE.spad" 980093 980103 980907 980912) (-614 "ITRIGMNP.spad" 978940 978959 980083 980088) (-613 "ITFUN3.spad" 978446 978460 978930 978935) (-612 "ITFUN2.spad" 978190 978202 978436 978441) (-611 "ITFORM.spad" 977545 977553 978180 978185) (-610 "ITAYLOR.spad" 975539 975554 977409 977506) (-609 "ISUPS.spad" 967937 967952 974474 974571) (-608 "ISUMP.spad" 967438 967454 967927 967932) (-607 "ISTRING.spad" 966344 966357 966425 966452) (-606 "ISAST.spad" 966063 966071 966334 966339) (-605 "IRURPK.spad" 964780 964799 966053 966058) (-604 "IRSN.spad" 962784 962792 964770 964775) (-603 "IRRF2F.spad" 961277 961287 962740 962745) (-602 "IRREDFFX.spad" 960878 960889 961267 961272) (-601 "IROOT.spad" 959217 959227 960868 960873) (-600 "IRFORM.spad" 958541 958549 959207 959212) (-599 "IR2F.spad" 957755 957771 958531 958536) (-598 "IR2.spad" 956783 956799 957745 957750) (-597 "IR.spad" 954586 954600 956632 956659) (-596 "IPRNTPK.spad" 954346 954354 954576 954581) (-595 "IPF.spad" 953911 953923 954151 954244) (-594 "IPADIC.spad" 953680 953706 953837 953906) (-593 "IP4ADDR.spad" 953237 953245 953670 953675) (-592 "IOMODE.spad" 952759 952767 953227 953232) (-591 "IOBFILE.spad" 952144 952152 952749 952754) (-590 "IOBCON.spad" 952009 952017 952134 952139) (-589 "INVLAPLA.spad" 951658 951674 951999 952004) (-588 "INTTR.spad" 945040 945057 951648 951653) (-587 "INTTOOLS.spad" 942783 942799 944602 944607) (-586 "INTSLPE.spad" 942111 942119 942773 942778) (-585 "INTRVL.spad" 941677 941687 942025 942106) (-584 "INTRF.spad" 940109 940123 941667 941672) (-583 "INTRET.spad" 939541 939551 940099 940104) (-582 "INTRAT.spad" 938276 938293 939531 939536) (-581 "INTPM.spad" 936643 936659 937901 937906) (-580 "INTPAF.spad" 934512 934530 936572 936577) (-579 "INTPACK.spad" 925078 925086 934502 934507) (-578 "INTHERTR.spad" 924352 924369 925068 925073) (-577 "INTHERAL.spad" 924022 924046 924342 924347) (-576 "INTHEORY.spad" 920461 920469 924012 924017) (-575 "INTG0.spad" 914207 914225 920390 920395) (-574 "INTFTBL.spad" 908236 908244 914197 914202) (-573 "INTFACT.spad" 907303 907313 908226 908231) (-572 "INTEF.spad" 905712 905728 907293 907298) (-571 "INTDOM.spad" 904335 904343 905638 905707) (-570 "INTDOM.spad" 903020 903030 904325 904330) (-569 "INTCAT.spad" 901287 901297 902934 903015) (-568 "INTBIT.spad" 900794 900802 901277 901282) (-567 "INTALG.spad" 899982 900009 900784 900789) (-566 "INTAF.spad" 899482 899498 899972 899977) (-565 "INTABL.spad" 897522 897553 897685 897712) (-564 "INT8.spad" 897402 897410 897512 897517) (-563 "INT64.spad" 897281 897289 897392 897397) (-562 "INT32.spad" 897160 897168 897271 897276) (-561 "INT16.spad" 897039 897047 897150 897155) (-560 "INT.spad" 896482 896490 896893 897034) (-559 "INS.spad" 893985 893993 896384 896477) (-558 "INS.spad" 891574 891584 893975 893980) (-557 "INPSIGN.spad" 891022 891035 891564 891569) (-556 "INPRODPF.spad" 890118 890137 891012 891017) (-555 "INPRODFF.spad" 889206 889230 890108 890113) (-554 "INNMFACT.spad" 888181 888198 889196 889201) (-553 "INMODGCD.spad" 887685 887715 888171 888176) (-552 "INFSP.spad" 885982 886004 887675 887680) (-551 "INFPROD0.spad" 885062 885081 885972 885977) (-550 "INFORM1.spad" 884687 884697 885052 885057) (-549 "INFORM.spad" 881894 881902 884677 884682) (-548 "INFINITY.spad" 881446 881454 881884 881889) (-547 "INETCLTS.spad" 881423 881431 881436 881441) (-546 "INEP.spad" 879969 879991 881413 881418) (-545 "INDE.spad" 879618 879635 879879 879884) (-544 "INCRMAPS.spad" 879055 879065 879608 879613) (-543 "INBFILE.spad" 878151 878159 879045 879050) (-542 "INBFF.spad" 874001 874012 878141 878146) (-541 "INBCON.spad" 872267 872275 873991 873996) (-540 "INBCON.spad" 870531 870541 872257 872262) (-539 "INAST.spad" 870192 870200 870521 870526) (-538 "IMPTAST.spad" 869900 869908 870182 870187) (-537 "IMATRIX.spad" 868716 868742 869228 869255) (-536 "IMATQF.spad" 867810 867854 868672 868677) (-535 "IMATLIN.spad" 866431 866455 867766 867771) (-534 "ILIST.spad" 864915 864930 865440 865467) (-533 "IIARRAY2.spad" 864190 864228 864393 864420) (-532 "IFF.spad" 863600 863616 863871 863964) (-531 "IFAST.spad" 863214 863222 863590 863595) (-530 "IFARRAY.spad" 860525 860540 862223 862250) (-529 "IFAMON.spad" 860387 860404 860481 860486) (-528 "IEVALAB.spad" 859800 859812 860377 860382) (-527 "IEVALAB.spad" 859211 859225 859790 859795) (-526 "IDPOAMS.spad" 858889 858901 859123 859128) (-525 "IDPOAM.spad" 858531 858543 858801 858806) (-524 "IDPO.spad" 858266 858278 858443 858448) (-523 "IDPC.spad" 856995 857007 858256 858261) (-522 "IDPAM.spad" 856662 856674 856907 856912) (-521 "IDPAG.spad" 856331 856343 856574 856579) (-520 "IDENT.spad" 855981 855989 856321 856326) (-519 "IDECOMP.spad" 853220 853238 855971 855976) (-518 "IDEAL.spad" 848166 848205 853152 853157) (-517 "ICDEN.spad" 847379 847395 848156 848161) (-516 "ICARD.spad" 846570 846578 847369 847374) (-515 "IBPTOOLS.spad" 845177 845194 846560 846565) (-514 "IBITS.spad" 844333 844346 844766 844793) (-513 "IBATOOL.spad" 841318 841337 844323 844328) (-512 "IBACHIN.spad" 839825 839840 841308 841313) (-511 "IARRAY2.spad" 838692 838718 839303 839330) (-510 "IARRAY1.spad" 837555 837570 837701 837728) (-509 "IAN.spad" 835775 835783 837368 837461) (-508 "IALGFACT.spad" 835386 835419 835765 835770) (-507 "HYPCAT.spad" 834810 834818 835376 835381) (-506 "HYPCAT.spad" 834232 834242 834800 834805) (-505 "HOSTNAME.spad" 834048 834056 834222 834227) (-504 "HOMOTOP.spad" 833791 833801 834038 834043) (-503 "HOAGG.spad" 831073 831083 833781 833786) (-502 "HOAGG.spad" 828088 828100 830798 830803) (-501 "HEXADEC.spad" 826048 826056 826413 826506) (-500 "HEUGCD.spad" 825139 825150 826038 826043) (-499 "HELLFDIV.spad" 824745 824769 825129 825134) (-498 "HEAP.spad" 824008 824018 824223 824250) (-497 "HEADAST.spad" 823549 823557 823998 824003) (-496 "HDP.spad" 811044 811060 811421 811520) (-495 "HDMP.spad" 808186 808201 808802 808929) (-494 "HB.spad" 806461 806469 808176 808181) (-493 "HASHTBL.spad" 804453 804484 804664 804691) (-492 "HASAST.spad" 804169 804177 804443 804448) (-491 "HACKPI.spad" 803660 803668 804071 804164) (-490 "GTSET.spad" 802554 802570 803261 803288) (-489 "GSTBL.spad" 800595 800630 800769 800784) (-488 "GSERIES.spad" 797827 797854 798646 798795) (-487 "GROUP.spad" 797100 797108 797807 797822) (-486 "GROUP.spad" 796381 796391 797090 797095) (-485 "GROEBSOL.spad" 794875 794896 796371 796376) (-484 "GRMOD.spad" 793454 793466 794865 794870) (-483 "GRMOD.spad" 792031 792045 793444 793449) (-482 "GRIMAGE.spad" 784944 784952 792021 792026) (-481 "GRDEF.spad" 783323 783331 784934 784939) (-480 "GRAY.spad" 781794 781802 783313 783318) (-479 "GRALG.spad" 780887 780899 781784 781789) (-478 "GRALG.spad" 779978 779992 780877 780882) (-477 "GPOLSET.spad" 779403 779426 779615 779642) (-476 "GOSPER.spad" 778680 778698 779393 779398) (-475 "GMODPOL.spad" 777828 777855 778648 778675) (-474 "GHENSEL.spad" 776911 776925 777818 777823) (-473 "GENUPS.spad" 773204 773217 776901 776906) (-472 "GENUFACT.spad" 772781 772791 773194 773199) (-471 "GENPGCD.spad" 772383 772400 772771 772776) (-470 "GENMFACT.spad" 771835 771854 772373 772378) (-469 "GENEEZ.spad" 769794 769807 771825 771830) (-468 "GDMP.spad" 766778 766795 767552 767679) (-467 "GCNAALG.spad" 760701 760728 766572 766639) (-466 "GCDDOM.spad" 759893 759901 760627 760696) (-465 "GCDDOM.spad" 759147 759157 759883 759888) (-464 "GBINTERN.spad" 755167 755205 759137 759142) (-463 "GBF.spad" 750950 750988 755157 755162) (-462 "GBEUCLID.spad" 748832 748870 750940 750945) (-461 "GB.spad" 746358 746396 748788 748793) (-460 "GAUSSFAC.spad" 745671 745679 746348 746353) (-459 "GALUTIL.spad" 743997 744007 745627 745632) (-458 "GALPOLYU.spad" 742451 742464 743987 743992) (-457 "GALFACTU.spad" 740664 740683 742441 742446) (-456 "GALFACT.spad" 730877 730888 740654 740659) (-455 "FVFUN.spad" 727900 727908 730867 730872) (-454 "FVC.spad" 726952 726960 727890 727895) (-453 "FUNDESC.spad" 726630 726638 726942 726947) (-452 "FUNCTION.spad" 726479 726491 726620 726625) (-451 "FTEM.spad" 725644 725652 726469 726474) (-450 "FT.spad" 723941 723949 725634 725639) (-449 "FSUPFACT.spad" 722838 722857 723874 723879) (-448 "FST.spad" 720924 720932 722828 722833) (-447 "FSRED.spad" 720404 720420 720914 720919) (-446 "FSPRMELT.spad" 719270 719286 720361 720366) (-445 "FSPECF.spad" 717361 717377 719260 719265) (-444 "FSINT.spad" 717021 717037 717351 717356) (-443 "FSERIES.spad" 716212 716224 716841 716940) (-442 "FSCINT.spad" 715529 715545 716202 716207) (-441 "FSAGG2.spad" 714264 714280 715519 715524) (-440 "FSAGG.spad" 713381 713391 714220 714259) (-439 "FSAGG.spad" 712460 712472 713301 713306) (-438 "FS2UPS.spad" 706975 707009 712450 712455) (-437 "FS2EXPXP.spad" 706116 706139 706965 706970) (-436 "FS2.spad" 705771 705787 706106 706111) (-435 "FS.spad" 700039 700049 705546 705766) (-434 "FS.spad" 694079 694091 699588 699593) (-433 "FRUTIL.spad" 693033 693043 694069 694074) (-432 "FRNAALG.spad" 688310 688320 692975 693028) (-431 "FRNAALG.spad" 683599 683611 688266 688271) (-430 "FRNAAF2.spad" 683047 683065 683589 683594) (-429 "FRMOD.spad" 682454 682484 682975 682980) (-428 "FRIDEAL2.spad" 682058 682090 682444 682449) (-427 "FRIDEAL.spad" 681283 681304 682038 682053) (-426 "FRETRCT.spad" 680802 680812 681273 681278) (-425 "FRETRCT.spad" 680178 680190 680651 680656) (-424 "FRAMALG.spad" 678558 678571 680134 680173) (-423 "FRAMALG.spad" 676970 676985 678548 678553) (-422 "FRAC2.spad" 676575 676587 676960 676965) (-421 "FRAC.spad" 673534 673544 673921 674094) (-420 "FR2.spad" 672870 672882 673524 673529) (-419 "FR.spad" 666465 666475 671765 671834) (-418 "FPS.spad" 663304 663312 666355 666460) (-417 "FPS.spad" 660171 660181 663224 663229) (-416 "FPC.spad" 659217 659225 660073 660166) (-415 "FPC.spad" 658349 658359 659207 659212) (-414 "FPATMAB.spad" 658111 658121 658339 658344) (-413 "FPARFRAC.spad" 656953 656970 658101 658106) (-412 "FORTRAN.spad" 655459 655502 656943 656948) (-411 "FORTFN.spad" 652629 652637 655449 655454) (-410 "FORTCAT.spad" 652313 652321 652619 652624) (-409 "FORT.spad" 651262 651270 652303 652308) (-408 "FORMULA1.spad" 650741 650751 651252 651257) (-407 "FORMULA.spad" 648215 648223 650731 650736) (-406 "FORDER.spad" 647906 647930 648205 648210) (-405 "FOP.spad" 647107 647115 647896 647901) (-404 "FNLA.spad" 646531 646553 647075 647102) (-403 "FNCAT.spad" 645126 645134 646521 646526) (-402 "FNAME.spad" 645018 645026 645116 645121) (-401 "FMTC.spad" 644816 644824 644944 645013) (-400 "FMONOID.spad" 644497 644507 644772 644777) (-399 "FMONCAT.spad" 641666 641676 644487 644492) (-398 "FMFUN.spad" 638696 638704 641656 641661) (-397 "FMCAT.spad" 636372 636390 638664 638691) (-396 "FMC.spad" 635424 635432 636362 636367) (-395 "FM1.spad" 634789 634801 635358 635385) (-394 "FM.spad" 634404 634416 634643 634670) (-393 "FLOATRP.spad" 632147 632161 634394 634399) (-392 "FLOATCP.spad" 629586 629600 632137 632142) (-391 "FLOAT.spad" 622900 622908 629452 629581) (-390 "FLINEXP.spad" 622622 622632 622890 622895) (-389 "FLINEXP.spad" 622285 622297 622555 622560) (-388 "FLASORT.spad" 621611 621623 622275 622280) (-387 "FLALG.spad" 619281 619300 621537 621606) (-386 "FLAGG2.spad" 617998 618014 619271 619276) (-385 "FLAGG.spad" 615064 615074 617978 617993) (-384 "FLAGG.spad" 612031 612043 614947 614952) (-383 "FINRALG.spad" 610116 610129 611987 612026) (-382 "FINRALG.spad" 608127 608142 610000 610005) (-381 "FINITE.spad" 607279 607287 608117 608122) (-380 "FINAALG.spad" 596464 596474 607221 607274) (-379 "FINAALG.spad" 585661 585673 596420 596425) (-378 "FILECAT.spad" 584195 584212 585651 585656) (-377 "FILE.spad" 583778 583788 584185 584190) (-376 "FIELD.spad" 583184 583192 583680 583773) (-375 "FIELD.spad" 582676 582686 583174 583179) (-374 "FGROUP.spad" 581339 581349 582656 582671) (-373 "FGLMICPK.spad" 580134 580149 581329 581334) (-372 "FFX.spad" 579517 579532 579850 579943) (-371 "FFSLPE.spad" 579028 579049 579507 579512) (-370 "FFPOLY2.spad" 578088 578105 579018 579023) (-369 "FFPOLY.spad" 569430 569441 578078 578083) (-368 "FFP.spad" 568835 568855 569146 569239) (-367 "FFNBX.spad" 567355 567375 568551 568644) (-366 "FFNBP.spad" 565876 565893 567071 567164) (-365 "FFNB.spad" 564341 564362 565557 565650) (-364 "FFINTBAS.spad" 561855 561874 564331 564336) (-363 "FFIELDC.spad" 559440 559448 561757 561850) (-362 "FFIELDC.spad" 557111 557121 559430 559435) (-361 "FFHOM.spad" 555883 555900 557101 557106) (-360 "FFF.spad" 553326 553337 555873 555878) (-359 "FFCGX.spad" 552181 552201 553042 553135) (-358 "FFCGP.spad" 551078 551098 551897 551990) (-357 "FFCG.spad" 549870 549891 550759 550852) (-356 "FFCAT2.spad" 549617 549657 549860 549865) (-355 "FFCAT.spad" 542782 542804 549456 549612) (-354 "FFCAT.spad" 536026 536050 542702 542707) (-353 "FF.spad" 535474 535490 535707 535800) (-352 "FEXPR.spad" 527174 527220 535221 535260) (-351 "FEVALAB.spad" 526882 526892 527164 527169) (-350 "FEVALAB.spad" 526366 526378 526650 526655) (-349 "FDIVCAT.spad" 524462 524486 526356 526361) (-348 "FDIVCAT.spad" 522556 522582 524452 524457) (-347 "FDIV2.spad" 522212 522252 522546 522551) (-346 "FDIV.spad" 521670 521694 522202 522207) (-345 "FCTRDATA.spad" 520678 520686 521660 521665) (-344 "FCPAK1.spad" 519213 519221 520668 520673) (-343 "FCOMP.spad" 518592 518602 519203 519208) (-342 "FC.spad" 508599 508607 518582 518587) (-341 "FAXF.spad" 501634 501648 508501 508594) (-340 "FAXF.spad" 494721 494737 501590 501595) (-339 "FARRAY.spad" 492697 492707 493730 493757) (-338 "FAMR.spad" 490841 490853 492595 492692) (-337 "FAMR.spad" 488969 488983 490725 490730) (-336 "FAMONOID.spad" 488653 488663 488923 488928) (-335 "FAMONC.spad" 486973 486985 488643 488648) (-334 "FAGROUP.spad" 486613 486623 486869 486896) (-333 "FACUTIL.spad" 484825 484842 486603 486608) (-332 "FACTFUNC.spad" 484027 484037 484815 484820) (-331 "EXPUPXS.spad" 480779 480802 482078 482227) (-330 "EXPRTUBE.spad" 478067 478075 480769 480774) (-329 "EXPRODE.spad" 475235 475251 478057 478062) (-328 "EXPR2UPS.spad" 471357 471370 475225 475230) (-327 "EXPR2.spad" 471062 471074 471347 471352) (-326 "EXPR.spad" 466147 466157 466861 467156) (-325 "EXPEXPAN.spad" 462891 462916 463523 463616) (-324 "EXITAST.spad" 462627 462635 462881 462886) (-323 "EXIT.spad" 462298 462306 462617 462622) (-322 "EVALCYC.spad" 461758 461772 462288 462293) (-321 "EVALAB.spad" 461338 461348 461748 461753) (-320 "EVALAB.spad" 460916 460928 461328 461333) (-319 "EUCDOM.spad" 458506 458514 460842 460911) (-318 "EUCDOM.spad" 456158 456168 458496 458501) (-317 "ESTOOLS2.spad" 455753 455767 456148 456153) (-316 "ESTOOLS1.spad" 455430 455441 455743 455748) (-315 "ESTOOLS.spad" 447308 447316 455420 455425) (-314 "ESCONT1.spad" 447049 447061 447298 447303) (-313 "ESCONT.spad" 443842 443850 447039 447044) (-312 "ES2.spad" 443355 443371 443832 443837) (-311 "ES1.spad" 442925 442941 443345 443350) (-310 "ES.spad" 435796 435804 442915 442920) (-309 "ES.spad" 428570 428580 435691 435696) (-308 "ERROR.spad" 425897 425905 428560 428565) (-307 "EQTBL.spad" 423891 423913 424100 424127) (-306 "EQ2.spad" 423609 423621 423881 423886) (-305 "EQ.spad" 418385 418395 421180 421292) (-304 "EP.spad" 414711 414721 418375 418380) (-303 "ENV.spad" 413389 413397 414701 414706) (-302 "ENTIRER.spad" 413057 413065 413333 413384) (-301 "EMR.spad" 412345 412386 412983 413052) (-300 "ELTAGG.spad" 410599 410618 412335 412340) (-299 "ELTAGG.spad" 408817 408838 410555 410560) (-298 "ELTAB.spad" 408292 408305 408807 408812) (-297 "ELFUTS.spad" 407727 407746 408282 408287) (-296 "ELEMFUN.spad" 407416 407424 407717 407722) (-295 "ELEMFUN.spad" 407103 407113 407406 407411) (-294 "ELAGG.spad" 405074 405084 407083 407098) (-293 "ELAGG.spad" 402982 402994 404993 404998) (-292 "ELABOR.spad" 402328 402336 402972 402977) (-291 "ELABEXPR.spad" 401260 401268 402318 402323) (-290 "EFUPXS.spad" 398036 398066 401216 401221) (-289 "EFULS.spad" 394872 394895 397992 397997) (-288 "EFSTRUC.spad" 392887 392903 394862 394867) (-287 "EF.spad" 387663 387679 392877 392882) (-286 "EAB.spad" 385963 385971 387653 387658) (-285 "E04UCFA.spad" 385499 385507 385953 385958) (-284 "E04NAFA.spad" 385076 385084 385489 385494) (-283 "E04MBFA.spad" 384656 384664 385066 385071) (-282 "E04JAFA.spad" 384192 384200 384646 384651) (-281 "E04GCFA.spad" 383728 383736 384182 384187) (-280 "E04FDFA.spad" 383264 383272 383718 383723) (-279 "E04DGFA.spad" 382800 382808 383254 383259) (-278 "E04AGNT.spad" 378674 378682 382790 382795) (-277 "DVARCAT.spad" 375564 375574 378664 378669) (-276 "DVARCAT.spad" 372452 372464 375554 375559) (-275 "DSMP.spad" 369748 369762 370053 370180) (-274 "DSEXT.spad" 369050 369060 369738 369743) (-273 "DSEXT.spad" 368256 368268 368946 368951) (-272 "DROPT1.spad" 367921 367931 368246 368251) (-271 "DROPT0.spad" 362786 362794 367911 367916) (-270 "DROPT.spad" 356745 356753 362776 362781) (-269 "DRAWPT.spad" 354918 354926 356735 356740) (-268 "DRAWHACK.spad" 354226 354236 354908 354913) (-267 "DRAWCX.spad" 351704 351712 354216 354221) (-266 "DRAWCURV.spad" 351251 351266 351694 351699) (-265 "DRAWCFUN.spad" 340783 340791 351241 351246) (-264 "DRAW.spad" 333659 333672 340773 340778) (-263 "DQAGG.spad" 331837 331847 333627 333654) (-262 "DPOLCAT.spad" 327194 327210 331705 331832) (-261 "DPOLCAT.spad" 322637 322655 327150 327155) (-260 "DPMO.spad" 314160 314176 314298 314511) (-259 "DPMM.spad" 305696 305714 305821 306034) (-258 "DOMTMPLT.spad" 305467 305475 305686 305691) (-257 "DOMCTOR.spad" 305222 305230 305457 305462) (-256 "DOMAIN.spad" 304333 304341 305212 305217) (-255 "DMP.spad" 301521 301536 302091 302218) (-254 "DMEXT.spad" 301388 301398 301489 301516) (-253 "DLP.spad" 300748 300758 301378 301383) (-252 "DLIST.spad" 299153 299163 299757 299784) (-251 "DLAGG.spad" 297570 297580 299143 299148) (-250 "DIVRING.spad" 297112 297120 297514 297565) (-249 "DIVRING.spad" 296698 296708 297102 297107) (-248 "DISPLAY.spad" 294888 294896 296688 296693) (-247 "DIRPROD2.spad" 293706 293724 294878 294883) (-246 "DIRPROD.spad" 280938 280954 281578 281677) (-245 "DIRPCAT.spad" 280131 280147 280834 280933) (-244 "DIRPCAT.spad" 278951 278969 279656 279661) (-243 "DIOSP.spad" 277776 277784 278941 278946) (-242 "DIOPS.spad" 276772 276782 277756 277771) (-241 "DIOPS.spad" 275742 275754 276728 276733) (-240 "DIFRING.spad" 275580 275588 275722 275737) (-239 "DIFFSPC.spad" 275159 275167 275570 275575) (-238 "DIFFSPC.spad" 274736 274746 275149 275154) (-237 "DIFFMOD.spad" 274225 274235 274704 274731) (-236 "DIFFDOM.spad" 273390 273401 274215 274220) (-235 "DIFFDOM.spad" 272553 272566 273380 273385) (-234 "DIFEXT.spad" 272372 272382 272533 272548) (-233 "DIAGG.spad" 272002 272012 272352 272367) (-232 "DIAGG.spad" 271640 271652 271992 271997) (-231 "DHMATRIX.spad" 269823 269833 270968 270995) (-230 "DFSFUN.spad" 263463 263471 269813 269818) (-229 "DFLOAT.spad" 260194 260202 263353 263458) (-228 "DFINTTLS.spad" 258425 258441 260184 260189) (-227 "DERHAM.spad" 256339 256371 258405 258420) (-226 "DEQUEUE.spad" 255534 255544 255817 255844) (-225 "DEGRED.spad" 255151 255165 255524 255529) (-224 "DEFINTRF.spad" 252688 252698 255141 255146) (-223 "DEFINTEF.spad" 251198 251214 252678 252683) (-222 "DEFAST.spad" 250582 250590 251188 251193) (-221 "DECIMAL.spad" 248546 248554 248907 249000) (-220 "DDFACT.spad" 246367 246384 248536 248541) (-219 "DBLRESP.spad" 245967 245991 246357 246362) (-218 "DBASIS.spad" 245593 245608 245957 245962) (-217 "DBASE.spad" 244257 244267 245583 245588) (-216 "DATAARY.spad" 243743 243756 244247 244252) (-215 "D03FAFA.spad" 243571 243579 243733 243738) (-214 "D03EEFA.spad" 243391 243399 243561 243566) (-213 "D03AGNT.spad" 242477 242485 243381 243386) (-212 "D02EJFA.spad" 241939 241947 242467 242472) (-211 "D02CJFA.spad" 241417 241425 241929 241934) (-210 "D02BHFA.spad" 240907 240915 241407 241412) (-209 "D02BBFA.spad" 240397 240405 240897 240902) (-208 "D02AGNT.spad" 235267 235275 240387 240392) (-207 "D01WGTS.spad" 233586 233594 235257 235262) (-206 "D01TRNS.spad" 233563 233571 233576 233581) (-205 "D01GBFA.spad" 233085 233093 233553 233558) (-204 "D01FCFA.spad" 232607 232615 233075 233080) (-203 "D01ASFA.spad" 232075 232083 232597 232602) (-202 "D01AQFA.spad" 231529 231537 232065 232070) (-201 "D01APFA.spad" 230969 230977 231519 231524) (-200 "D01ANFA.spad" 230463 230471 230959 230964) (-199 "D01AMFA.spad" 229973 229981 230453 230458) (-198 "D01ALFA.spad" 229513 229521 229963 229968) (-197 "D01AKFA.spad" 229039 229047 229503 229508) (-196 "D01AJFA.spad" 228562 228570 229029 229034) (-195 "D01AGNT.spad" 224629 224637 228552 228557) (-194 "CYCLOTOM.spad" 224135 224143 224619 224624) (-193 "CYCLES.spad" 220927 220935 224125 224130) (-192 "CVMP.spad" 220344 220354 220917 220922) (-191 "CTRIGMNP.spad" 218844 218860 220334 220339) (-190 "CTORKIND.spad" 218447 218455 218834 218839) (-189 "CTORCAT.spad" 217688 217696 218437 218442) (-188 "CTORCAT.spad" 216927 216937 217678 217683) (-187 "CTORCALL.spad" 216516 216526 216917 216922) (-186 "CTOR.spad" 216207 216215 216506 216511) (-185 "CSTTOOLS.spad" 215452 215465 216197 216202) (-184 "CRFP.spad" 209224 209237 215442 215447) (-183 "CRCEAST.spad" 208944 208952 209214 209219) (-182 "CRAPACK.spad" 208011 208021 208934 208939) (-181 "CPMATCH.spad" 207512 207527 207933 207938) (-180 "CPIMA.spad" 207217 207236 207502 207507) (-179 "COORDSYS.spad" 202226 202236 207207 207212) (-178 "CONTOUR.spad" 201653 201661 202216 202221) (-177 "CONTFRAC.spad" 197403 197413 201555 201648) (-176 "CONDUIT.spad" 197161 197169 197393 197398) (-175 "COMRING.spad" 196835 196843 197099 197156) (-174 "COMPPROP.spad" 196353 196361 196825 196830) (-173 "COMPLPAT.spad" 196120 196135 196343 196348) (-172 "COMPLEX2.spad" 195835 195847 196110 196115) (-171 "COMPLEX.spad" 191146 191156 191390 191651) (-170 "COMPILER.spad" 190695 190703 191136 191141) (-169 "COMPFACT.spad" 190297 190311 190685 190690) (-168 "COMPCAT.spad" 188369 188379 190031 190292) (-167 "COMPCAT.spad" 186166 186178 187830 187835) (-166 "COMMUPC.spad" 185914 185932 186156 186161) (-165 "COMMONOP.spad" 185447 185455 185904 185909) (-164 "COMMAAST.spad" 185210 185218 185437 185442) (-163 "COMM.spad" 185021 185029 185200 185205) (-162 "COMBOPC.spad" 183944 183952 185011 185016) (-161 "COMBINAT.spad" 182711 182721 183934 183939) (-160 "COMBF.spad" 180133 180149 182701 182706) (-159 "COLOR.spad" 178970 178978 180123 180128) (-158 "COLONAST.spad" 178636 178644 178960 178965) (-157 "CMPLXRT.spad" 178347 178364 178626 178631) (-156 "CLLCTAST.spad" 178009 178017 178337 178342) (-155 "CLIP.spad" 174117 174125 177999 178004) (-154 "CLIF.spad" 172772 172788 174073 174112) (-153 "CLAGG.spad" 169309 169319 172762 172767) (-152 "CLAGG.spad" 165714 165726 169169 169174) (-151 "CINTSLPE.spad" 165069 165082 165704 165709) (-150 "CHVAR.spad" 163207 163229 165059 165064) (-149 "CHARZ.spad" 163122 163130 163187 163202) (-148 "CHARPOL.spad" 162648 162658 163112 163117) (-147 "CHARNZ.spad" 162410 162418 162628 162643) (-146 "CHAR.spad" 159778 159786 162400 162405) (-145 "CFCAT.spad" 159106 159114 159768 159773) (-144 "CDEN.spad" 158326 158340 159096 159101) (-143 "CCLASS.spad" 156422 156430 157684 157723) (-142 "CATEGORY.spad" 155496 155504 156412 156417) (-141 "CATCTOR.spad" 155387 155395 155486 155491) (-140 "CATAST.spad" 155013 155021 155377 155382) (-139 "CASEAST.spad" 154727 154735 155003 155008) (-138 "CARTEN2.spad" 154117 154144 154717 154722) (-137 "CARTEN.spad" 149484 149508 154107 154112) (-136 "CARD.spad" 146779 146787 149458 149479) (-135 "CAPSLAST.spad" 146561 146569 146769 146774) (-134 "CACHSET.spad" 146185 146193 146551 146556) (-133 "CABMON.spad" 145740 145748 146175 146180) (-132 "BYTEORD.spad" 145415 145423 145730 145735) (-131 "BYTEBUF.spad" 143116 143124 144402 144429) (-130 "BYTE.spad" 142591 142599 143106 143111) (-129 "BTREE.spad" 141535 141545 142069 142096) (-128 "BTOURN.spad" 140411 140421 141013 141040) (-127 "BTCAT.spad" 139803 139813 140379 140406) (-126 "BTCAT.spad" 139215 139227 139793 139798) (-125 "BTAGG.spad" 138681 138689 139183 139210) (-124 "BTAGG.spad" 138167 138177 138671 138676) (-123 "BSTREE.spad" 136779 136789 137645 137672) (-122 "BRILL.spad" 134984 134995 136769 136774) (-121 "BRAGG.spad" 133940 133950 134974 134979) (-120 "BRAGG.spad" 132860 132872 133896 133901) (-119 "BPADICRT.spad" 130685 130697 130932 131025) (-118 "BPADIC.spad" 130357 130369 130611 130680) (-117 "BOUNDZRO.spad" 130013 130030 130347 130352) (-116 "BOP1.spad" 127471 127481 130003 130008) (-115 "BOP.spad" 122613 122621 127461 127466) (-114 "BOOLEAN.spad" 122051 122059 122603 122608) (-113 "BOOLE.spad" 121701 121709 122041 122046) (-112 "BOOLE.spad" 121349 121359 121691 121696) (-111 "BMODULE.spad" 121061 121073 121317 121344) (-110 "BITS.spad" 120435 120443 120650 120677) (-109 "BINDING.spad" 119856 119864 120425 120430) (-108 "BINARY.spad" 117825 117833 118181 118274) (-107 "BGAGG.spad" 117030 117040 117805 117820) (-106 "BGAGG.spad" 116243 116255 117020 117025) (-105 "BFUNCT.spad" 115807 115815 116223 116238) (-104 "BEZOUT.spad" 114947 114974 115757 115762) (-103 "BBTREE.spad" 111695 111705 114425 114452) (-102 "BASTYPE.spad" 111194 111202 111685 111690) (-101 "BASTYPE.spad" 110691 110701 111184 111189) (-100 "BALFACT.spad" 110150 110163 110681 110686) (-99 "AUTOMOR.spad" 109601 109610 110130 110145) (-98 "ATTREG.spad" 106324 106331 109353 109596) (-97 "ATTRBUT.spad" 102347 102354 106304 106319) (-96 "ATTRAST.spad" 102064 102071 102337 102342) (-95 "ATRIG.spad" 101534 101541 102054 102059) (-94 "ATRIG.spad" 101002 101011 101524 101529) (-93 "ASTCAT.spad" 100906 100913 100992 100997) (-92 "ASTCAT.spad" 100808 100817 100896 100901) (-91 "ASTACK.spad" 100018 100027 100286 100313) (-90 "ASSOCEQ.spad" 98852 98863 99974 99979) (-89 "ASP9.spad" 97933 97946 98842 98847) (-88 "ASP80.spad" 97255 97268 97923 97928) (-87 "ASP8.spad" 96298 96311 97245 97250) (-86 "ASP78.spad" 95749 95762 96288 96293) (-85 "ASP77.spad" 95118 95131 95739 95744) (-84 "ASP74.spad" 94210 94223 95108 95113) (-83 "ASP73.spad" 93481 93494 94200 94205) (-82 "ASP7.spad" 92641 92654 93471 93476) (-81 "ASP6.spad" 91508 91521 92631 92636) (-80 "ASP55.spad" 90017 90030 91498 91503) (-79 "ASP50.spad" 87834 87847 90007 90012) (-78 "ASP49.spad" 86833 86846 87824 87829) (-77 "ASP42.spad" 85248 85287 86823 86828) (-76 "ASP41.spad" 83835 83874 85238 85243) (-75 "ASP4.spad" 83130 83143 83825 83830) (-74 "ASP35.spad" 82118 82131 83120 83125) (-73 "ASP34.spad" 81419 81432 82108 82113) (-72 "ASP33.spad" 80979 80992 81409 81414) (-71 "ASP31.spad" 80119 80132 80969 80974) (-70 "ASP30.spad" 79011 79024 80109 80114) (-69 "ASP29.spad" 78477 78490 79001 79006) (-68 "ASP28.spad" 69750 69763 78467 78472) (-67 "ASP27.spad" 68647 68660 69740 69745) (-66 "ASP24.spad" 67734 67747 68637 68642) (-65 "ASP20.spad" 67198 67211 67724 67729) (-64 "ASP19.spad" 61884 61897 67188 67193) (-63 "ASP12.spad" 61298 61311 61874 61879) (-62 "ASP10.spad" 60569 60582 61288 61293) (-61 "ASP1.spad" 59950 59963 60559 60564) (-60 "ARRAY2.spad" 59189 59198 59428 59455) (-59 "ARRAY12.spad" 57902 57913 59179 59184) (-58 "ARRAY1.spad" 56565 56574 56911 56938) (-57 "ARR2CAT.spad" 52347 52368 56533 56560) (-56 "ARR2CAT.spad" 48149 48172 52337 52342) (-55 "ARITY.spad" 47521 47528 48139 48144) (-54 "APPRULE.spad" 46805 46827 47511 47516) (-53 "APPLYORE.spad" 46424 46437 46795 46800) (-52 "ANY1.spad" 45495 45504 46414 46419) (-51 "ANY.spad" 44346 44353 45485 45490) (-50 "ANTISYM.spad" 42791 42807 44326 44341) (-49 "ANON.spad" 42500 42507 42781 42786) (-48 "AN.spad" 40806 40813 42313 42406) (-47 "AMR.spad" 38991 39002 40704 40801) (-46 "AMR.spad" 37007 37020 38722 38727) (-45 "ALIST.spad" 33847 33868 34197 34224) (-44 "ALGSC.spad" 32982 33008 33719 33772) (-43 "ALGPKG.spad" 28765 28776 32938 32943) (-42 "ALGMFACT.spad" 27958 27972 28755 28760) (-41 "ALGMANIP.spad" 25442 25457 27785 27790) (-40 "ALGFF.spad" 23047 23074 23264 23420) (-39 "ALGFACT.spad" 22166 22176 23037 23042) (-38 "ALGEBRA.spad" 21999 22008 22122 22161) (-37 "ALGEBRA.spad" 21864 21875 21989 21994) (-36 "ALAGG.spad" 21376 21397 21832 21859) (-35 "AHYP.spad" 20757 20764 21366 21371) (-34 "AGG.spad" 19466 19473 20747 20752) (-33 "AGG.spad" 18139 18148 19422 19427) (-32 "AF.spad" 16567 16582 18071 18076) (-31 "ADDAST.spad" 16253 16260 16557 16562) (-30 "ACPLOT.spad" 14844 14851 16243 16248) (-29 "ACFS.spad" 12701 12710 14746 14839) (-28 "ACFS.spad" 10644 10655 12691 12696) (-27 "ACF.spad" 7398 7405 10546 10639) (-26 "ACF.spad" 4238 4247 7388 7393) (-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 |